Home
last modified time | relevance | path

Searched refs:top_ (Results 1 - 25 of 33) sorted by relevance

12

/third_party/node/deps/v8/src/heap/
H A Dlinear-allocation-area.h24 : start_(top), top_(top), limit_(limit) { in LinearAllocationArea()
30 top_ = top; in Reset()
35 void ResetStart() { start_ = top_; } in ResetStart()
39 return (top_ + bytes) <= limit_; in CanIncrementTop()
43 Address old_top = top_; in IncrementTop()
44 top_ += bytes; in IncrementTop()
51 if ((new_top + bytes) == top_) { in DecrementTopIfAdjacent()
52 top_ = new_top; in DecrementTopIfAdjacent()
53 if (start_ > top_) { in DecrementTopIfAdjacent()
65 if (top_ in MergeIfAdjacent()
113 Address top_ = kNullAddress; global() member in v8::internal::final
[all...]
H A Dread-only-spaces.cc291 top_(kNullAddress), in ReadOnlySpace()
368 BasicMemoryChunk::UpdateHighWaterMark(top_); in RepairFreeSpacesAfterDeserialization()
514 bool allocation_pointer_found_in_space = top_ == limit_; in Verify()
524 if (page == Page::FromAllocationAreaAddress(top_)) { in Verify()
587 BasicMemoryChunk::UpdateHighWaterMark(top_); in CommittedPhysicalMemory()
599 if (top_ == kNullAddress) { in FreeLinearAllocationArea()
607 page->AddressToMarkbitIndex(top_), page->AddressToMarkbitIndex(limit_)); in FreeLinearAllocationArea()
609 heap()->CreateFillerObjectAt(top_, static_cast<int>(limit_ - top_), in FreeLinearAllocationArea()
612 BasicMemoryChunk::UpdateHighWaterMark(top_); in FreeLinearAllocationArea()
[all...]
H A Dfree-list.h89 FreeSpace top() { return top_; } in top()
90 void set_top(FreeSpace top) { top_ = top; } in set_top()
103 // |top_|: Points to the top FreeSpace in the free list category.
104 FreeSpace top_; member in v8::internal::FreeListCategory
H A Dread-only-spaces.h219 Address top() const { return top_; } in top()
250 Address top_; member in v8::internal::ReadOnlySpace
/test/testfwk/arkxtest/uitest/core/
H A Dui_model.h118 : left_(left), right_(right), top_(top), bottom_(bottom) in Rect()
120 DCHECK(right_ >= left_ && bottom_ >= top_); in Rect()
126 top_ = 0; in Rect()
131 int32_t top_; member
141 return (top_ + bottom_) / TWO; in GetCenterY()
151 return bottom_ - top_; in GetHeight()
157 ss << "Rect {left:" << left_ << ",right:" << right_ << ",top:" << top_ << ",bottom:" << bottom_ << "}"; in Describe()
195 return ra.left_ == rb.left_ && ra.right_ == rb.right_ && ra.top_ == rb.top_ && ra.bottom_ == rb.bottom_; in CheckEqual()
203 if (ra.top_ > in CheckIntersectant()
[all...]
H A Drect_algorithm.cpp27 if (ra.top_ >= rb.bottom_ || ra.bottom_ <= rb.top_) { in ComputeIntersection()
31 array<int32_t, INDEX_FOUR> py = {ra.top_, ra.bottom_, rb.top_, rb.bottom_}; in ComputeIntersection()
78 if (overlay.top_ >= rect.top_ && overlay.top_ <= rect.bottom_) { in CollectGridLineCoords()
80 if (overlay.top_ == g_YCoords[idx]) { in CollectGridLineCoords()
86 g_YCoords[g_YCount++] = overlay.top_; in CollectGridLineCoords()
91 if (overlay.bottom_ >= rect.top_ in CollectGridLineCoords()
[all...]
H A Dwindow_operator.cpp104 Point from(rect.GetCenterX(), rect.top_ + step1); in CallBar()
105 Point to(rect.GetCenterX(), rect.top_ + step2); in CallBar()
118 Point focus(rect.GetCenterX(), rect.top_ + step); in Focus()
133 Point from(rect.left_ + step, rect.top_ + step); in MoveTo()
158 from = Point(window_.bounds_.GetCenterX(), window_.bounds_.top_); in Resize()
163 to = Point(window_.bounds_.GetCenterX(), window_.bounds_.top_ + highth); in Resize()
166 from = Point(window_.bounds_.left_, window_.bounds_.top_); in Resize()
171 to = Point(window_.bounds_.right_ - width, window_.bounds_.top_ + highth); in Resize()
174 from = Point(window_.bounds_.right_, window_.bounds_.top_); in Resize()
179 to = Point(window_.bounds_.left_ + width, window_.bounds_.top_ in Resize()
[all...]
H A Dui_model.cpp52 boundStream << "[" << bounds_.left_ << "," << bounds_.top_ << "][" << bounds_.right_ << "," in GetAttrVec()
75 boundStream << "[" << bounds_.left_ << "," << bounds_.top_ << "][" << bounds_.right_ << "," in GetAttr()
117 boundStream << "[" << bounds_.left_ << "," << bounds_.top_ << "][" << bounds_.right_ << "," in WrapperWidgetToJson()
H A Dui_driver.cpp135 mergeBounds.top_ = std::min(mergeBounds.top_, winCache.window_.bounds_.top_); in DumpWindowsInfo()
159 ss << "[" << mergeBounds.left_ << "," << mergeBounds.top_ << "]" in DumpUiHierarchy()
555 mergeRect.top_ = std::min(winCache.window_.bounds_.top_, mergeRect.top_); in GetMergeWindowBounds()
H A Dwidget_operator.cpp35 return std::abs(allWidgets.at(index)->GetBounds().top_ - anchorLeafWidget->GetBounds().top_) < in IsScrolledToBorder()
254 Point topPoint(bounds.GetCenterX(), bounds.top_); in TurnPage()
/base/print/print_fwk/frameworks/models/print_models/src/
H A Dprint_margin.cpp20 PrintMargin::PrintMargin() : hasTop_(false), top_(0), hasBottom_(false), bottom_(0), hasLeft_(false), left_(0), in PrintMargin()
32 top_ = right.top_; in Set()
56 top_ = 0; in Reset()
68 top_ = top; in SetTop()
96 return top_; in GetTop()
186 PRINT_HILOGD("top_ = %{public}d", top_); in Dump()
/third_party/node/deps/v8/src/heap/base/
H A Dworklist.h77 v8::base::AsAtomicPtr(&top_)->store(segment, std::memory_order_relaxed); in set_top()
81 Segment* top_ = nullptr; member in heap::base::Worklist
89 segment->set_next(top_); in Push()
97 if (top_ == nullptr) return false; in Pop()
100 *segment = top_; in Pop()
101 set_top(top_->next()); in Pop()
107 return v8::base::AsAtomicPtr(&top_)->load(std::memory_order_relaxed) == in IsEmpty()
123 Segment* current = top_; in Clear()
137 Segment* current = top_; in Update()
145 top_ in Update()
[all...]
/third_party/node/deps/v8/src/parsing/
H A Dfunc-name-inferrer.h56 : fni_(fni), top_(fni->names_stack_.size()) { in State()
61 fni_->names_stack_.resize(top_); in ~State()
69 size_t top_; member in v8::internal::FuncNameInferrer::State
/third_party/node/deps/v8/src/deoptimizer/
H A Dframe-description.h63 top_(kZapUint32),
155 intptr_t GetTop() const { return top_; }
156 void SetTop(intptr_t top) { top_ = top; }
208 intptr_t top_;
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dquant_levels_dec_utils.c61 uint16_t* top_; member
85 const uint16_t* const top = p->top_; in VFilter()
98 p->top_ = p->cur_; in VFilter()
232 p->top_ = p->end_ - width; in InitParams()
233 memset(p->top_, 0, width * sizeof(*p->top_)); in InitParams()
/third_party/node/deps/v8/src/objects/
H A Dallocation-site-scopes-inl.h16 top_ = site; in InitializeTraversal()
19 current_ = Handle<AllocationSite>::New(*top_, isolate()); in InitializeTraversal()
H A Dallocation-site-scopes.h22 Handle<AllocationSite> top() { return top_; } in top()
36 Handle<AllocationSite> top_; member in v8::internal::AllocationSiteContext
/test/testfwk/arkxtest/uitest/test/
H A Drect_algorithm_test.cpp48 ASSERT_EQ(300, intersection.top_); in TEST()
55 ASSERT_EQ(350, intersection.top_); in TEST()
62 ASSERT_EQ(320, intersection.top_); in TEST()
H A Dui_model_test.cpp29 ASSERT_EQ(300, rect.top_); in TEST()
66 ASSERT_EQ(3, bounds.top_); in TEST()
H A Dmock_element_node_iterator.h107 eleRoot.rectInScreen.top_ = std::stoi(rectStrVec[2]); in WrapperJsonToElement()
243 boundStream << "[" << nodeOriginRect.left_ << "," << nodeOriginRect.top_ << "][" << nodeOriginRect.right_ in WrapperNodeAttrToVec()
/third_party/node/deps/v8/src/compiler/
H A Dmemory-lowering.h53 Node* top() const { return top_; } in top()
69 Node* const top_; member in v8::internal::compiler::final::final
/test/testfwk/arkxtest/uitest/record/
H A Dfind_widget.cpp33 if (!(x <= rect.right_ && x >= rect.left_ && y <= rect.bottom_ && y >= rect.top_)) { in FindWidget()
/base/update/updater/services/script/script_interpreter/
H A Dscript_context.h255 return top_; in IsTop()
260 bool top_ = false; member in Uscript::UScriptInterpretContext
/base/print/print_fwk/frameworks/models/print_models/include/
H A Dprint_margin.h71 uint32_t top_; member in OHOS::Print::final
/third_party/node/deps/v8/tools/
H A Dwindbg.js627 h.old_space_.allocation_info_.top_);
634 h.new_space_.allocation_info_.top_,
642 h.map_space_.allocation_info_.top_);
647 h.code_space_.allocation_info_.top_);

Completed in 14 milliseconds

12