Lines Matching refs:cur
76 void HeapObjectIterator::Initialize(Address cur, Address end,
78 cur_addr_ = cur;
912 Address cur = p->ObjectAreaStart();
914 while (cur < end) {
915 HeapObject* obj = HeapObject::FromAddress(cur);
916 Address next = cur + obj->Size();
917 if ((cur <= addr) && (addr < next)) return obj;
918 cur = next;
1813 int cur = kHead;
1814 for (int i = cur + 1; i < kFreeListsLength; i++) {
1816 free_[cur].next_size_ = i;
1817 cur = i;
1820 free_[cur].next_size_ = kEnd;
1876 int cur = FindSize(index, &prev);
1877 ASSERT(index < cur);
1878 if (cur == kEnd) {
1884 int rem = cur - index;
1886 FreeListNode* cur_node = FreeListNode::FromAddress(free_[cur].head_node_);
1887 ASSERT(cur_node->Size() == (cur << kPointerSizeLog2));
1888 FreeListNode* rem_node = FreeListNode::FromAddress(free_[cur].head_node_ +
1890 // Distinguish the cases prev < rem < cur and rem <= prev < cur
1893 // Simple case: insert rem between prev and cur.
1896 // If this was the last block of size cur, remove the size.
1897 if ((free_[cur].head_node_ = cur_node->next(heap_)) == NULL) {
1898 free_[rem].next_size_ = free_[cur].next_size_;
1900 free_[rem].next_size_ = cur;
1907 // If this was the last block of size cur, remove the size.
1908 if ((free_[cur].head_node_ = cur_node->next(heap_)) == NULL) {
1910 free_[prev].next_size_ = free_[cur].next_size_;
