Lines Matching defs:top
197 // Determine the top/limit addresses.
262 // Update the allocation top with the new object allocation.
263 // TODO(bmeurer): Defer writing back top as much as possible.
264 Node* top = __ IntAdd(state->top(), size);
267 top_address, __ IntPtrConstant(0), top);
271 __ IntAdd(state->top(), __ IntPtrConstant(kHeapObjectTag)));
278 AllocationState::Open(group, state_size, top, effect, zone());
287 // Load allocation top and limit.
288 Node* top =
295 Node* check = __ UintLessThan(__ IntAdd(top, reservation_size), limit);
298 __ Goto(&done, top);
311 // Compute the new top and write it back.
312 top = __ IntAdd(done.PhiAt(0), __ IntPtrConstant(object_size));
315 top_address, __ IntPtrConstant(0), top);
327 AllocationState::Open(group, object_size, top, effect, zone());
333 // Load allocation top and limit.
334 Node* top =
339 // Compute the new top.
340 Node* new_top = __ IntAdd(top, size);
354 __ IntAdd(top, __ IntPtrConstant(kHeapObjectTag))));
710 intptr_t size, Node* top,
712 : group_(group), size_(size), top_(top), effect_(effect) {}