Searched refs:page (Results 1 - 9 of 9) sorted by relevance

/gem5/src/cpu/
H A Ddecode_cache.hh53 /// A sparse map from an Addr to a Value, stored in page chunks.
106 // Didn't find an existing page, so add a new one.
124 CachePage *page = getPage(addr); local
125 return page->items[addr & (TheISA::PageBytes - 1)];
/gem5/src/arch/power/
H A Dpagetable.hh78 page() const function in struct:PowerISA::VAddr
108 // ITB/DTB page table entry
/gem5/src/arch/alpha/
H A Dfaults.cc203 TlbEntry entry(p->pTable->pid(), vaddr.page(), pte->paddr,
206 dynamic_cast<TLB *>(tc->getITBPtr())->insert(vaddr.page(), entry);
222 TlbEntry entry(p->pTable->pid(), vaddr.page(), pte->paddr,
225 dynamic_cast<TLB *>(tc->getDTBPtr())->insert(vaddr.page(), entry);
H A Dpagetable.hh53 Addr page() const { return addr & PageMask; } function in struct:AlphaISA::VAddr
95 Addr tag; // virtual page number tag
96 Addr ppn; // physical page number
103 bool valid; // valid page table entry
/gem5/src/dev/arm/
H A Dflash_device.cc130 * This is a bitmap. Every bit is a page
131 * unknownPages is a vector of 32 bit integers. If every page was an
133 * page per bit we need ceil(pagesPerDisk/32) entries. 32 = 1 << 5 hence
144 locationTable[count].page = count / blocksPerDisk;
148 locationTable[count].page = count % pagesPerBlock;
176 * The access will be broken up in a number of page accesses. The number
177 * of page accesses depends on the amount that needs to be transfered.
179 * the page size and that this model has to figure out all of the
206 //call accessTimes if appropriate, page may be unknown, so lets
222 * Check if the page i
[all...]
H A Dflash_device.hh84 /** Every logical address maps to a physical block and a physical page*/
86 uint32_t page; member in struct:FlashDevice::PageMapEntry
143 /** Function to indicate that a page is known*/
146 /** Function to test if a page is known*/
184 /** address to logic place has a block and a page field*/
/gem5/util/ccdrv/
H A Ddevtime.c32 #include <asm/page.h>
/gem5/src/mem/cache/prefetch/
H A Dbase.hh310 /** Determine if addresses are on the same page */
316 /** Determine the address of the page in which a lays */
318 /** Determine the page-offset of a */
320 /** Build the address of the i-th block inside the page */
321 Addr pageIthBlockAddress(Addr page, uint32_t i) const;
382 * page crossing references and/or uses virtual addresses for training.
H A Dbase.cc197 BasePrefetcher::pageIthBlockAddress(Addr page, uint32_t blockIndex) const argument
199 return page + (blockIndex << lBlkSize);

Completed in 15 milliseconds