Searched defs:pages (Results 1 - 25 of 43) sorted by relevance

12

/external/chromium/base/
H A Dsys_info_freebsd.cc14 int pages, page_size; local
15 size_t size = sizeof(pages);
16 sysctlbyname("vm.stats.vm.v_page_count", &pages, &size, NULL, 0);
18 if (pages == -1 || page_size == -1) {
22 return static_cast<int64>(pages) * page_size;
H A Dsys_info_linux.cc13 long pages = sysconf(_SC_PHYS_PAGES); local
15 if (pages == -1 || page_size == -1) {
20 return static_cast<int64>(pages) * page_size;
/external/webkit/Tools/RebaselineQueueServer/
H A Dmain.py36 from handlers import pages namespace
42 ('/', pages.Home),
43 ('/builder/picker', pages.BuilderPicker),
/external/webkit/Source/WebCore/page/
H A DPageGroupLoadDeferrer.cpp37 const HashSet<Page*>& pages = page->group().pages(); local
39 HashSet<Page*>::const_iterator end = pages.end();
40 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it) {
H A DPageGroup.h68 const HashSet<Page*>& pages() const { return m_pages; } function in class:WebCore::PageGroup
H A DFrameTree.cpp225 // Search the entire tree of each of the other pages in this namespace.
227 const HashSet<Page*>& pages = page->group().pages(); local
228 HashSet<Page*>::const_iterator end = pages.end();
229 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it) {
H A DPageGroup.cpp186 HashSet<Page*> pages = it->second->pages(); local
187 HashSet<Page*>::iterator pagesEnd = pages.end();
189 for(HashSet<Page*>::iterator pit = pages.begin(); pit != pagesEnd; ++pit) {
193 // to the same value on all private browsing and "normal" pages,
198 // DOM storage is disabled in private browsing pages, so nothing to do if
212 // If page is still null at this point, then the only pages that are
213 // open are private browsing pages. Hence no pages are currently using local
238 HashSet<Page*> pages local
[all...]
/external/kernel-headers/original/linux/
H A Dvmalloc.h12 #define VM_MAP 0x00000004 /* vmap()ed pages */
14 #define VM_VPAGES 0x00000010 /* buffer for pages was vmalloc'ed */
22 #define IOREMAP_MAX_ORDER (7 + PAGE_SHIFT) /* 128 pages */
29 struct page **pages; member in struct:vm_struct
51 extern void *vmap(struct page **pages, unsigned int count,
69 struct page ***pages);
H A Ddmaengine.h221 * user space pages).
245 * locked user space pages)
271 * (kernel memory or locked user space pages).
348 struct page **pages; member in struct:dma_page_list
/external/replicaisland/src/com/replica/replicaisland/
H A DConversationUtils.java38 public ArrayList<ConversationPage> pages = new ArrayList<ConversationPage>(); field in class:ConversationUtils.Conversation
75 currentConversation.pages.add(page);
/external/webkit/Source/WebCore/storage/
H A DStorageEventDispatcher.cpp69 const HashSet<Page*>& pages = page->group().pages(); local
70 HashSet<Page*>::const_iterator end = pages.end();
71 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it) {
/external/webkit/Source/WebKit/chromium/src/
H A DStorageEventDispatcherImpl.cpp65 const HashSet<Page*>& pages = m_pageGroup->pages(); local
66 HashSet<Page*>::const_iterator end = pages.end();
67 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it) {
H A DStorageAreaProxy.cpp136 const HashSet<Page*>& pages = page->group().pages(); local
137 HashSet<Page*>::const_iterator end = pages.end();
138 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it) {
/external/chromium/chrome/browser/extensions/
H A Dextension_ui_unittest.cc26 const std::vector<ExtensionPage>& pages,
43 NULL, extension.get(), pages, true, false);
49 const std::vector<ExtensionPage>& pages,
60 extension_path, pages, Extension::INVALID));
97 std::vector<ExtensionPage> pages; local
98 pages.push_back(ExtensionPage(
101 pages.push_back(ExtensionPage(
110 CompareExpectedAndActualOutput(extension_path, pages, expected_output_path);
126 pages[1].url = pages[
24 CreateExtensionDetailViewFromPath( const FilePath& extension_path, const std::vector<ExtensionPage>& pages, Extension::Location location) argument
47 CompareExpectedAndActualOutput( const FilePath& extension_path, const std::vector<ExtensionPage>& pages, const FilePath& expected_output_path) argument
160 std::vector<ExtensionPage> pages; local
192 std::vector<ExtensionPage> pages; local
221 std::vector<ExtensionPage> pages; local
[all...]
/external/kernel-headers/original/asm-generic/
H A Dtlb.h44 struct page * pages[FREE_PTE_NR]; member in struct:mmu_gather
76 free_pages_and_swap_cache(tlb->pages, tlb->nr);
108 tlb->pages[tlb->nr++] = page;
118 * unmapping already-unmapped pages, which happens quite a lot.
/external/qemu-pc-bios/vgabios/
H A Dvbetables-gen.c94 int pages, pitch; local
108 pages = vram_size / (pm->height * pitch);
109 if (pages > 0) {
168 printf("/*Bit8u NumberOfImagePages*/ %d,\n", (pages / 4) - 1);
170 printf("/*Bit8u NumberOfImagePages*/ %d,\n", pages - 1);
/external/webkit/Source/WebCore/inspector/front-end/
H A DHAREntry.js204 pages: this._buildPages(),
/external/webkit/Source/WebCore/page/wince/
H A DFrameWinCE.cpp55 void computePageRectsForFrame(Frame* frame, const IntRect& printRect, float headerHeight, float footerHeight, float userScaleFactor, Vector<IntRect>& pages, int& outPageHeight) argument
59 pages.clear();
102 pages.append(IntRect(0, printedPagesHeight, currPageWidth, currPageHeight));
/external/bluetooth/glib/tests/
H A Dslice-threadinit.c23 #define N_PAGES (101) /* number of pages to sample */
34 } pages[N_PAGES] = { { NULL, }, }; variable in typeref:struct:__anon715
63 if (pages[j].page == p)
81 /* allocate blocks from N_PAGES different pages */
87 if (pages[j].page == p)
94 pages[j].page = p;
95 pages[j].sample = b;
101 /* ensure that we can allocate from known pages */
156 /* ensure that we can allocate from known pages */
/external/kernel-headers/original/linux/mtd/
H A Dbbm.h23 * @pages: the page(s) where we find the bbt, used with
25 * then we store the found bbts pages here.
46 int pages[NAND_MAX_CHIPS]; member in struct:nand_bbt_descr
76 /* Search good / bad pattern through all pages of a block */
/external/skia/src/pdf/
H A DSkPDFPage.cpp57 void SkPDFPage::generatePageTree(const SkTDArray<SkPDFPage*>& pages, argument
61 // PDF wants a tree describing all the pages in the document. We arbitrary
79 curNodes.setReserve(pages.count());
80 for (int i = 0; i < pages.count(); i++) {
81 SkSafeRef(pages[i]);
82 curNodes.push(pages[i]);
87 nextRoundNodes.setReserve((pages.count() + kNodeSize - 1)/kNodeSize);
112 if (curNodes[i] != pages[0]) {
123 pageCount = pages.count() % treeCapacity;
/external/webkit/Source/WebCore/bindings/js/
H A DPageScriptDebugServer.cpp158 const HashSet<Page*>& pages = pageGroup.pages(); local
160 HashSet<Page*>::const_iterator end = pages.end();
161 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it)
H A DScriptController.cpp283 const HashSet<Page*>& pages = page->group().pages(); local
284 HashSet<Page*>::const_iterator end = pages.end();
285 for (HashSet<Page*>::const_iterator it = pages.begin(); it != end; ++it) {
/external/chromium/chrome/browser/ui/webui/
H A Dmost_visited_handler.cc42 // The number of most visited pages we show.
50 // This struct is used when getting the pre-populated pages in case the user
51 // hasn't filled up his most visited pages.
80 // We pre-emptively make a fetch for the most visited pages so we have the
293 // Special case for prepopulated pages: thumbnailUrl is different from url.
319 // If we found no pages we treat this as the first run.
333 static std::vector<MostVisitedPage> pages; local
334 if (pages.empty()) {
340 pages.push_back(welcome_page);
347 pages
383 const std::vector<MostVisitedPage> pages = local
[all...]
/external/kernel-headers/original/linux/sunrpc/
H A Dxdr.h41 * pages.
43 * main interest is for appending padding to the pages in order to
48 * operations and/or has a need for scatter/gather involving pages.
54 struct page ** pages; /* Array of contiguous pages */ member in struct:xdr_buf
192 extern void xdr_write_pages(struct xdr_stream *xdr, struct page **pages,

Completed in 457 milliseconds

12