Lines Matching refs:page
130 * 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 is known and used. unknownPages is a bitmap of
224 * information of this page is taken into acount in the model (is it
363 locationTable[logic_page_addr].page = pagesPerBlock + 2;
385 locationTable[block + count].page = (block + count) %
412 /**Just read the page*/
417 /**Write the page, and read the result*/
427 /**Copy every valid page*/
441 * clearUnknownPages. defines that a page is known and used
443 * that the information of this page is taken into acount in the model (is it
447 * unknownPage entry is a 32 bit integer. So if we have a page index, then
462 * getUnknownPages. Verify wether a page is known
534 paramOut(cp, csprintf("locationTable[%d].page", count),
535 locationTable[count].page);
558 paramIn(cp, csprintf("locationTable[%d].page", count),
559 locationTable[count].page);