Home
last modified time | relevance | path

Searched refs:top_ (Results 1 – 10 of 10) sorted by relevance

/external/v8/src/
Dmark-compact.h173 : array_(NULL), top_(0), bottom_(0), mask_(0), overflowed_(false) { } in MarkingDeque()
180 top_ = bottom_ = 0; in Initialize()
184 inline bool IsFull() { return ((top_ + 1) & mask_) == bottom_; } in IsFull()
186 inline bool IsEmpty() { return top_ == bottom_; } in IsEmpty()
204 array_[top_] = object; in PushBlack()
205 top_ = ((top_ + 1) & mask_); in PushBlack()
214 array_[top_] = object; in PushGrey()
215 top_ = ((top_ + 1) & mask_); in PushGrey()
221 top_ = ((top_ - 1) & mask_); in Pop()
222 HeapObject* object = array_[top_]; in Pop()
[all …]
Ddeoptimizer.h418 intptr_t GetTop() const { return top_; } in GetTop()
419 void SetTop(intptr_t top) { top_ = top; } in SetTop()
488 intptr_t top_; variable
Dparser.cc54 explicit PositionStack(bool* ok) : top_(NULL), ok_(ok) {} in PositionStack()
73 bool is_empty() { return top_ == NULL; } in is_empty()
76 int result = top_->value(); in pop()
77 top_ = top_->previous(); in pop()
82 Element* top() { return top_; } in top()
83 void set_top(Element* value) { top_ = value; } in set_top()
84 Element* top_; member in v8::internal::PositionStack
Ddeoptimizer.cc1217 top_(kZapUint32), in FrameDescription()
/external/compiler-rt/lib/asan/
Dasan_allocator.h78 node->next = top_; in LifoPush()
79 top_ = node; in LifoPush()
82 CHECK(top_); in LifoPop()
83 top_ = top_->next; in LifoPop()
85 FakeFrame *top() { return top_; } in top()
87 FakeFrame *top_;
/external/chromium/chrome/browser/sync/engine/
Dchange_reorder_buffer.cc34 Traversal() : top_(kInvalidId) { } in Traversal()
41 if (top_ == kInvalidId) { in ExpandToInclude()
42 top_ = child_handle; in ExpandToInclude()
47 while (node_to_include != kInvalidId && node_to_include != top_) { in ExpandToInclude()
57 node_to_include = top_; in ExpandToInclude()
58 top_ = node.Get(syncable::META_HANDLE); in ExpandToInclude()
82 int64 top() const { return top_; } in top()
104 int64 top_; member in sync_api::ChangeReorderBuffer::Traversal
/external/chromium/chrome/browser/ui/views/bubble/
Dbubble_border.cc17 SkBitmap* BubbleBorder::top_ = NULL; member in BubbleBorder
117 int top = top_->height(); in GetInsets()
171 top_ = rb.GetBitmapNamed(IDR_BUBBLE_T); in InitClass()
202 const int t_height = top_->height(); in Paint()
277 top_, in Paint()
283 top_->height() - top_arrow_->height()); in Paint()
285 canvas->TileImageInt(*top_, left + tl_width, top, in Paint()
Dbubble_border.h134 static SkBitmap* top_; variable
/external/chromium/chrome/browser/resources/net_internals/
Dview.js20 this.top_ = top;
51 return this.top_;
/external/icu4c/test/cintltst/
Dcmsccoll.c540 UBool varT = FALSE; UBool top_ = TRUE; in testCollator() local
584 top_ = (UBool)((specs & UCOL_TOK_TOP) != 0); in testCollator()
585 if(top_) { /* if reset is on top, the sequence is broken. We should have an empty string */ in testCollator()
924 UBool varT = FALSE; UBool top_ = TRUE; in testAgainstUCA() local
968 top_ = (UBool)((specs & UCOL_TOK_TOP) != 0); in testAgainstUCA()
1098 UBool varT = FALSE; UBool top_ = TRUE; in testCEs() local
1200 top_ = (UBool)((specs & UCOL_TOK_TOP) != 0); in testCEs()
1219 if(top_ == TRUE) { in testCEs()