| /external/chromium/chrome/browser/sync/engine/ |
| change_reorder_buffer.cc | 34 Traversal() : top_(kInvalidId) { }
40 // If |top_| is invalid, this is the first insertion -- easy.
41 if (top_ == kInvalidId) {
42 top_ = child_handle;
47 while (node_to_include != kInvalidId && node_to_include != top_) {
54 // (it would have to be |top_| if it were), start a new expansion
55 // upwards from |top_| to unite the original traversal with the
57 node_to_include = top_;
58 top_ = node.Get(syncable::META_HANDLE);
82 int64 top() const { return top_; }
104 int64 top_; member in class:sync_api::ChangeReorderBuffer::Traversal
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_allocator.h | 78 node->next = top_;
79 top_ = node;
82 CHECK(top_);
83 top_ = top_->next;
85 FakeFrame *top() { return top_; }
87 FakeFrame *top_; member in class:__asan::FakeFrameLifo
|
| /external/chromium/chrome/browser/ui/views/bubble/ |
| bubble_border.cc | 17 SkBitmap* BubbleBorder::top_ = NULL; member in class:BubbleBorder
117 int top = top_->height();
171 top_ = rb.GetBitmapNamed(IDR_BUBBLE_T);
202 const int t_height = top_->height();
277 top_,
283 top_->height() - top_arrow_->height());
285 canvas->TileImageInt(*top_, left + tl_width, top,
|
| bubble_border.h | 134 static SkBitmap* top_; member in class:BubbleBorder
|
| /frameworks/base/core/jni/android/graphics/ |
| Path.cpp | 175 SkScalar top_ = SkFloatToScalar(top); local
178 obj->addRect(left_, top_, right_, bottom_, dir);
|
| Canvas.cpp | 398 SkScalar top_ = SkFloatToScalar(top); local
401 canvas->drawRectCoords(left_, top_, right_, bottom_, *paint);
460 SkScalar top_ = SkFloatToScalar(top); local
470 canvas->drawBitmap(*bitmap, left_, top_, &filteredPaint);
472 canvas->drawBitmap(*bitmap, left_, top_, paint);
477 canvas->translate(left_, top_);
[all...] |
| /external/v8/src/ |
| mark-compact.h | 173 : array_(NULL), top_(0), bottom_(0), mask_(0), overflowed_(false) { }
180 top_ = bottom_ = 0;
184 inline bool IsFull() { return ((top_ + 1) & mask_) == bottom_; }
186 inline bool IsEmpty() { return top_ == bottom_; }
204 array_[top_] = object;
205 top_ = ((top_ + 1) & mask_);
214 array_[top_] = object;
215 top_ = ((top_ + 1) & mask_)
248 int top_; member in class:v8::internal::MarkingDeque
[all...] |
| parser.cc | 54 explicit PositionStack(bool* ok) : top_(NULL), ok_(ok) {}
73 bool is_empty() { return top_ == NULL; }
76 int result = top_->value();
77 top_ = top_->previous();
82 Element* top() { return top_; }
83 void set_top(Element* value) { top_ = value; }
84 Element* top_; member in class:v8::internal::PositionStack
[all...] |
| /external/icu4c/test/cintltst/ |
| cmsccoll.c | 540 UBool varT = FALSE; UBool top_ = TRUE; local
584 top_ = (UBool)((specs & UCOL_TOK_TOP) != 0);
585 if(top_) { /* if reset is on top, the sequence is broken. We should have an empty string */
924 UBool varT = FALSE; UBool top_ = TRUE; local
968 top_ = (UBool)((specs & UCOL_TOK_TOP) != 0);
1098 UBool varT = FALSE; UBool top_ = TRUE; local
[all...] |
