Lines Matching full:page
37 Page::set_rset_state(Page::IN_USE);
40 Page* p = Page::FromAddress(page_start);
47 CHECK(!Page::IsRSetSet(addr, 0));
53 Page::SetRSet(addr, 0);
59 CHECK(Page::IsRSetSet(addr, 0));
64 TEST(Page) {
66 Page::set_rset_state(Page::NOT_IN_USE);
69 byte* mem = NewArray<byte>(2*Page::kPageSize);
73 Address page_start = RoundUp(start, Page::kPageSize);
75 Page* p = Page::FromAddress(page_start);
83 CHECK(p->ObjectAreaStart() == page_start + Page::kObjectStartOffset);
84 CHECK(p->ObjectAreaEnd() == page_start + Page::kPageSize);
86 CHECK(p->Offset(page_start + Page::kObjectStartOffset) ==
87 Page::kObjectStartOffset);
88 CHECK(p->Offset(page_start + Page::kPageSize) == Page::kPageSize);
90 CHECK(p->OffsetToAddress(Page::kObjectStartOffset) == p->ObjectAreaStart());
91 CHECK(p->OffsetToAddress(Page::kPageSize) == p->ObjectAreaEnd());
109 Page* first_page =
115 Page* last_page = first_page;
116 for (Page* p = first_page; p->is_valid(); p = p->next_page()) {
122 Page* others =
130 for (Page* p = first_page; p->is_valid(); p = p->next_page()) {
136 Page* second_page = first_page->next_page();
139 // Freeing pages at the first chunk starting at or after the second page
140 // should free the entire second chunk. It will return the last page in the
141 // first chunk (if the second page was in the first chunk) or else an
142 // invalid page (if the second page was the start of the second chunk).
143 Page* free_return = MemoryAllocator::FreePages(second_page);
147 // Freeing pages in the first chunk starting at the first page should free
148 // the first chunk and return an invalid page.
149 Page* invalid_page = MemoryAllocator::FreePages(first_page);
170 while (new_space.Available() >= Page::kMaxHeapObjectSize) {
171 Object* obj = new_space.AllocateRaw(Page::kMaxHeapObjectSize);
199 Object* obj = s->AllocateRaw(Page::kMaxHeapObjectSize);
216 int lo_size = Page::kPageSize;
