Searched refs:set_top (Results 1 – 6 of 6) sorted by relevance
/external/v8/src/heap/ |
D | spaces-inl.h | 410 allocation_info_.set_top(new_top); in AllocateLinearly() 423 allocation_info_.set_top(new_top); in AllocateRawAligned() 441 allocation_info_.set_top(new_top); in AllocateLinearlyAligned() 557 allocation_info_.set_top(top + aligned_size_in_bytes); in AllocateRawAligned() 582 allocation_info_.set_top(top + size_in_bytes); in AllocateRawUnaligned() 645 allocation_info_.set_top(other->allocation_info_.top()); in TryMerge()
|
D | mark-compact.h | 248 void set_top(int top) { top_ = top; } in set_top() function
|
D | spaces.h | 379 void set_top(FreeSpace* top) { top_ = top; } in set_top() function 1674 set_top(top); in Reset() 1678 INLINE(void set_top(Address top)) { in INLINE()
|
D | spaces.cc | 2207 set_top(nullptr); in AllocateChunk() 2218 set_top(node->next()); in AllocateChunk() 2248 set_top(cur_node->next()); in AllocateChunk() 2267 set_top(free_space); in AllocateChunk()
|
D | incremental-marking.cc | 827 marking_deque->set_top(new_top); in UpdateMarkingDequeAfterScavenge()
|
/external/skia/src/gpu/ |
D | GrTessellator.cpp | 773 void set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c) { in set_top() function 823 set_top(other, edge->fBottom, activeEdges, c); in merge_edges_below() 827 set_top(edge, other->fBottom, activeEdges, c); in merge_edges_below() 889 set_top(edge, v, activeEdges, c); in split_edge() 913 set_top(edge, dst, nullptr, c); in merge_vertices()
|