Lines Matching defs:page
58 // spaces consists of a list of pages. A page has a page header and an object
64 // may be larger than the page size.
70 // object maps so if the page belongs to old space or large object space
71 // it is essential to guarantee that the page does not contain any
79 // To enable lazy cleaning of old space pages we can mark chunks of the page
81 // sections are skipped when scanning the page, even if we are otherwise
88 // Each page may have up to one special garbage section. The start of this
96 // Since the top and limit fields are in the space, not the page, only one page
215 // A page is a memory chunk of a size 256K. Large object pages may be larger.
217 // The only way to get a page pointer is by calling factory methods:
231 // Returns the page containing a given address. The address ranges
233 // is in fact in a page.
248 // Returns the page containing the address provided. The address can
249 // potentially point righter after the page. To be also safe for tagged values
257 // Checks if address1 and address2 are on the same new space page.
262 // Checks whether an address is page aligned.
380 explicit PageRange(Page* page) : PageRange(page, page->next_page()) {}
392 // A space has a circular list of pages. The next page can be accessed via