HomeSort by relevance Sort by last modified time
    Searched defs:new_top (Results 1 - 8 of 8) sorted by null

  /art/runtime/gc/space/
region_space-inl.h 106 uint8_t* new_top; local
109 new_top = old_top + num_bytes;
110 if (UNLIKELY(new_top > end_)) {
113 } while (!top_.CompareAndSetWeakRelaxed(old_top, new_top));
117 DCHECK_LE(new_top, end_);
  /external/v8/src/heap/
spaces-inl.h 271 Address new_top = current_top + filler_size + size_in_bytes; local
272 if (new_top > allocation_info_.limit()) return AllocationResult::Retry();
274 allocation_info_.set_top(new_top);
292 Address new_top = current_top + size_in_bytes; local
293 DCHECK_LE(new_top, allocation_info_.limit());
294 allocation_info_.set_top(new_top);
303 Address new_top = current_top + filler_size + *size_in_bytes; local
304 if (new_top > allocation_info_.limit()) return nullptr;
306 allocation_info_.set_top(new_top);
spaces.cc 2296 Address new_top = to_space_.page_low(); local
2385 Address new_top = old_top + aligned_size_in_bytes; local
    [all...]
  /external/pdfium/core/fxcrt/
fx_coordinates.cpp 344 float new_top = points[0].y; local
349 new_top = std::max(new_top, points[i].y);
352 return std::make_tuple(new_left, new_right, new_top, new_bottom);
  /external/v8/src/compiler/
memory-optimizer.cc 279 Node* new_top = local
283 Node* check = __ UintLessThan(new_top, limit);
287 top_address, __ IntPtrConstant(0), new_top);
  /external/freetype/src/truetype/
ttinterp.h 165 FT_Long new_top; /* new top after exec. */ member in struct:TT_ExecContextRec_
  /external/libcups/cups/
ppd-cache.c 992 new_top, \/* New top margin in 2540ths *\/ local
    [all...]
  /external/v8/src/
code-stub-assembler.cc 1192 Node* new_top = IntPtrAdd(top, adjusted_size.value()); local
1217 new_top); local
    [all...]

Completed in 189 milliseconds