/external/chromium/base/ |
H A D | sys_info_freebsd.cc | 14 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 D | sys_info_linux.cc | 13 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 D | main.py | 36 from handlers import pages namespace 42 ('/', pages.Home), 43 ('/builder/picker', pages.BuilderPicker),
|
/external/webkit/Source/WebCore/page/ |
H A D | PageGroupLoadDeferrer.cpp | 37 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 D | PageGroup.h | 68 const HashSet<Page*>& pages() const { return m_pages; } function in class:WebCore::PageGroup
|
H A D | FrameTree.cpp | 225 // 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) {
|
/external/kernel-headers/original/linux/ |
H A D | vmalloc.h | 12 #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 D | dmaengine.h | 221 * 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 D | ConversationUtils.java | 38 public ArrayList<ConversationPage> pages = new ArrayList<ConversationPage>(); field in class:ConversationUtils.Conversation 75 currentConversation.pages.add(page);
|
/external/webkit/Source/WebCore/storage/ |
H A D | StorageEventDispatcher.cpp | 69 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 D | StorageEventDispatcherImpl.cpp | 65 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 D | StorageAreaProxy.cpp | 136 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 D | extension_ui_unittest.cc | 26 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 D | tlb.h | 44 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 D | vbetables-gen.c | 94 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 D | HAREntry.js | 204 pages: this._buildPages(),
|
/external/webkit/Source/WebCore/page/wince/ |
H A D | FrameWinCE.cpp | 55 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/jmonkeyengine/engine/src/core/com/jme3/font/ |
H A D | BitmapFont.java | 91 private Material[] pages;
field in class:BitmapFont 111 public void setPages(Material[] pages) {
argument 112 this.pages = pages;
113 charSet.setPageSize(pages.length);
117 return pages[index];
121 return pages.length;
158 oc.write(pages, "pages", null);
165 Savable[] pagesSavable = ic.readSavableArray("pages", nul [all...] |
/external/kernel-headers/original/linux/mtd/ |
H A D | bbm.h | 23 * @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 D | SkPDFDocument.cpp | 35 const SkTDArray<SkPDFPage*>& pages, 41 for (int i = 0; i < pages.count(); ++i) { 42 usage.merge(pages[i]->getFontGlyphUsage()); 34 perform_font_subsetting(SkPDFCatalog* catalog, const SkTDArray<SkPDFPage*>& pages, SkTDArray<SkPDFObject*>* substitutes) argument
|
H A D | SkPDFPage.cpp | 50 void SkPDFPage::GeneratePageTree(const SkTDArray<SkPDFPage*>& pages, argument 54 // PDF wants a tree describing all the pages in the document. We arbitrary 72 curNodes.setReserve(pages.count()); 73 for (int i = 0; i < pages.count(); i++) { 74 SkSafeRef(pages[i]); 75 curNodes.push(pages[i]); 80 nextRoundNodes.setReserve((pages.count() + kNodeSize - 1)/kNodeSize); 105 if (curNodes[i] != pages[0]) { 117 pageCount = pages.count() % treeCapacity;
|
/external/webkit/Source/WebCore/bindings/js/ |
H A D | PageScriptDebugServer.cpp | 158 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)
|
/external/chromium/chrome/browser/ui/webui/ |
H A D | most_visited_handler.cc | 42 // 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 D | xdr.h | 41 * 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,
|
/external/linux-tools-perf/util/ |
H A D | evlist.c | 363 * @pages - map length in pages 375 int perf_evlist__mmap(struct perf_evlist *evlist, int pages, bool overwrite) argument 378 int mask = pages * page_size - 1; 391 evlist->mmap_len = (pages + 1) * page_size;
|