| /third_party/node/deps/v8/src/heap/cppgc/ |
| D | persistent-node.cc | 27 for (auto& slots : nodes_) { in ClearAllUsedNodes()
55 nodes_.cbegin(), nodes_.cend(), 0u, [](size_t acc, const auto& slots) { in NodesInUse()
71 nodes_.push_back(std::move(node_slots)); in RefillFreeList()
72 for (auto& node : *nodes_.back()) { in RefillFreeList()
88 for (auto& slots : nodes_) { in Trace()
109 nodes_.erase(std::remove_if(nodes_.begin(), nodes_.end(), in Trace()
111 nodes_.end()); in Trace()
144 nodes_.clear(); in ~CrossThreadPersistentRegion()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 294 explicit PointerMap(const Vec<Node*>* nodes) : nodes_(nodes) { in PointerMap()
301 Node* n = (*nodes_)[i]; in Find()
310 (*nodes_)[i]->next_hash = *head; in Add()
320 Node* n = (*nodes_)[index]; in Remove()
335 const Vec<Node*>* nodes_; member in absl::synchronization_internal::__anon7265cd7a0111::PointerMap
346 Vec<Node*> nodes_; member
357 Rep() : ptrmap_(&nodes_) {} in Rep()
361 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
372 for (auto* node : rep_->nodes_) { in ~GraphCycles()
383 for (uint32_t x = 0; x < r->nodes_.size(); x++) { in CheckInvariants()
[all …]
|
| /third_party/node/deps/v8/src/compiler/ |
| D | schedule.h | 91 bool empty() const { return nodes_.empty(); } in NON_EXPORTED_BASE()
92 size_t size() const { return nodes_.size(); } in NON_EXPORTED_BASE()
93 Node* NodeAt(size_t index) { return nodes_[index]; } in NON_EXPORTED_BASE()
94 size_t NodeCount() const { return nodes_.size(); } in NON_EXPORTED_BASE()
96 value_type& front() { return nodes_.front(); } in NON_EXPORTED_BASE()
97 value_type const& front() const { return nodes_.front(); } in NON_EXPORTED_BASE()
100 iterator begin() { return nodes_.begin(); } in NON_EXPORTED_BASE()
101 iterator end() { return nodes_.end(); } in NON_EXPORTED_BASE()
103 void RemoveNode(iterator it) { nodes_.erase(it); } in NON_EXPORTED_BASE()
106 const_iterator begin() const { return nodes_.begin(); } in NON_EXPORTED_BASE()
[all …]
|
| D | schedule.cc | 27 nodes_(zone), in BasicBlock()
57 void BasicBlock::AddNode(Node* node) { nodes_.push_back(node); } in AddNode()
62 if (!nodes_.empty() && control_input == nodes_.back()) { in set_control_input()
63 nodes_.pop_back(); in set_control_input()
82 void BasicBlock::TrimNodes(iterator new_end) { nodes_.erase(new_end, end()); } in TrimNodes()
|
| /third_party/ninja/src/ |
| D | deps_log.cc | 217 assert(deps_data[i] < (int)nodes_.size()); in Load()
218 assert(nodes_[deps_data[i]]); in Load()
219 deps->nodes[i] = nodes_[deps_data[i]]; in Load()
246 int id = nodes_.size(); in Load()
254 nodes_.push_back(node); in Load()
305 return nodes_[id]; in GetFirstReverseDepsNode()
327 for (vector<Node*>::iterator i = nodes_.begin(); i != nodes_.end(); ++i) in Recompact()
335 if (!IsDepsEntryLiveFor(nodes_[old_id])) in Recompact()
338 if (!new_log.RecordDeps(nodes_[old_id], deps->mtime, in Recompact()
349 nodes_.swap(new_log.nodes_); in Recompact()
[all …]
|
| D | deps_log.h | 103 const std::vector<Node*>& nodes() const { return nodes_; } in nodes()
122 std::vector<Node*> nodes_; member
|
| /third_party/node/deps/v8/src/maglev/ |
| D | maglev-basic-block.h | 29 return nodes_.is_empty() ? control_node()->id() : nodes_.first()->id(); in first_id()
34 if (!nodes_.is_empty()) { in FirstNonGapMoveId()
35 for (const Node* node : nodes_) { in FirstNonGapMoveId()
43 Node::List& nodes() { return nodes_; } in nodes()
61 DCHECK(nodes_.is_empty()); in set_empty_block_predecessor()
94 Node::List nodes_; variable
|
| /third_party/node/deps/v8/src/compiler/backend/ |
| D | instruction-scheduler.cc | 19 auto it = nodes_.begin(); in AddNode()
20 while ((it != nodes_.end()) && in AddNode()
24 nodes_.insert(it, node); in AddNode()
30 auto candidate = nodes_.end(); in PopBestCandidate()
31 for (auto iterator = nodes_.begin(); iterator != nodes_.end(); ++iterator) { in PopBestCandidate()
39 if (candidate != nodes_.end()) { in PopBestCandidate()
41 nodes_.erase(candidate); in PopBestCandidate()
52 auto candidate = nodes_.begin(); in PopBestCandidate()
54 static_cast<int>(nodes_.size()))); in PopBestCandidate()
56 nodes_.erase(candidate); in PopBestCandidate()
|
| D | instruction-scheduler.h | 109 : scheduler_(scheduler), nodes_(scheduler->zone()) {} in SchedulingQueueBase()
113 bool IsEmpty() const { return nodes_.empty(); } in IsEmpty()
117 ZoneLinkedList<ScheduleGraphNode*> nodes_; variable
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | dominator_tree.h | 207 nodes_.clear(); in ClearTree()
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode()
257 if (node_iter == nodes_.end()) { in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode()
266 if (node_iter == nodes_.end()) { in GetTreeNode()
296 DominatorTreeNodeMap nodes_; variable
|
| D | dominator_tree.cpp | 265 auto a_itr = nodes_.find(a); in ImmediateDominator()
266 if (a_itr == nodes_.end()) return nullptr; in ImmediateDominator()
281 nodes_.find(bb->id()); in GetOrInsertNode()
282 if (node_iter == nodes_.end()) { in GetOrInsertNode()
283 dtn = &nodes_.emplace(std::make_pair(bb->id(), DominatorTreeNode{bb})) in GetOrInsertNode()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | dominator_tree.h | 207 nodes_.clear(); in ClearTree()
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode()
257 if (node_iter == nodes_.end()) { in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode()
266 if (node_iter == nodes_.end()) { in GetTreeNode()
296 DominatorTreeNodeMap nodes_; variable
|
| D | dominator_tree.cpp | 265 auto a_itr = nodes_.find(a); in ImmediateDominator()
266 if (a_itr == nodes_.end()) return nullptr; in ImmediateDominator()
281 nodes_.find(bb->id()); in GetOrInsertNode()
282 if (node_iter == nodes_.end()) { in GetOrInsertNode()
283 dtn = &nodes_.emplace(std::make_pair(bb->id(), DominatorTreeNode{bb})) in GetOrInsertNode()
|
| /third_party/spirv-tools/source/opt/ |
| D | dominator_tree.h | 207 nodes_.clear(); in ClearTree()
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode()
257 if (node_iter == nodes_.end()) { in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode()
266 if (node_iter == nodes_.end()) { in GetTreeNode()
296 DominatorTreeNodeMap nodes_; variable
|
| D | dominator_tree.cpp | 253 auto a_itr = nodes_.find(a); in ImmediateDominator()
254 if (a_itr == nodes_.end()) return nullptr; in ImmediateDominator()
269 nodes_.find(bb->id()); in GetOrInsertNode()
270 if (node_iter == nodes_.end()) { in GetOrInsertNode()
271 dtn = &nodes_.emplace(std::make_pair(bb->id(), DominatorTreeNode{bb})) in GetOrInsertNode()
|
| /third_party/node/src/permission/ |
| D | permission.h | 55 auto perm_node = nodes_.find(permission);
56 if (perm_node != nodes_.end()) {
62 std::unordered_map<PermissionScope, std::shared_ptr<PermissionBase>> nodes_; variable
|
| /third_party/node/src/ |
| D | heap_utils.cc | 95 nodes_.emplace(std::move(node)); in AddNode()
109 Local<Array> nodes = Array::New(isolate_, nodes_.size()); in CreateObject()
118 for (const std::unique_ptr<Node>& n : nodes_) in CreateObject()
124 for (const std::unique_ptr<Node>& n : nodes_) { in CreateObject()
160 for (const std::unique_ptr<Node>& n : nodes_) { in CreateObject()
205 std::unordered_set<std::unique_ptr<Node>> nodes_; member in node::heap::JSGraph
|
| /third_party/node/deps/v8/src/profiler/ |
| D | sampling-heap-profiler.h | 32 return nodes_.size() == 0 ? nullptr : &nodes_.front(); in GetRootNode()
40 std::deque<v8::AllocationProfile::Node> nodes_;
|
| D | sampling-heap-profiler.cc | 239 profile->nodes_.push_back(v8::AllocationProfile::Node{ in TranslateAllocationNode()
244 v8::AllocationProfile::Node* current = &profile->nodes_.back(); in TranslateAllocationNode()
|
| /third_party/spirv-headers/tools/buildHeaders/jsoncpp/dist/ |
| D | jsoncpp.cpp | 306 while (!nodes_.empty()) in parse()
307 nodes_.pop(); in parse()
308 nodes_.push(&root); in parse()
664 nodes_.push(&value); in readObject()
666 nodes_.pop(); in readObject()
701 nodes_.push(&value); in readArray()
703 nodes_.pop(); in readArray()
972 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
1225 Nodes nodes_; member in Json::OurReader
1263 while (!nodes_.empty()) in parse()
[all …]
|
| /third_party/protobuf/conformance/third_party/jsoncpp/ |
| D | jsoncpp.cpp | 321 while (!nodes_.empty()) in parse()
322 nodes_.pop(); in parse()
323 nodes_.push(&root); in parse()
679 nodes_.push(&value); in readObject()
681 nodes_.pop(); in readObject()
716 nodes_.push(&value); in readArray()
718 nodes_.pop(); in readArray()
965 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
1205 Nodes nodes_; member in Json::OurReader
1245 while (!nodes_.empty()) in parse()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Headers/tools/buildHeaders/jsoncpp/dist/ |
| D | jsoncpp.cpp | 306 while (!nodes_.empty()) in parse()
307 nodes_.pop(); in parse()
308 nodes_.push(&root); in parse()
664 nodes_.push(&value); in readObject()
666 nodes_.pop(); in readObject()
701 nodes_.push(&value); in readArray()
703 nodes_.pop(); in readArray()
972 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
1225 Nodes nodes_; member in Json::OurReader
1263 while (!nodes_.empty()) in parse()
[all …]
|
| /third_party/skia/third_party/externals/spirv-headers/tools/buildHeaders/jsoncpp/dist/ |
| D | jsoncpp.cpp | 306 while (!nodes_.empty()) in parse()
307 nodes_.pop(); in parse()
308 nodes_.push(&root); in parse()
664 nodes_.push(&value); in readObject()
666 nodes_.pop(); in readObject()
701 nodes_.push(&value); in readArray()
703 nodes_.pop(); in readArray()
972 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
1225 Nodes nodes_; member in Json::OurReader
1263 while (!nodes_.empty()) in parse()
[all …]
|
| /third_party/node/deps/v8/include/cppgc/internal/ |
| D | persistent-node.h | 129 std::vector<std::unique_ptr<PersistentNodeSlots>> nodes_; variable
|
| /third_party/node/deps/v8/src/regexp/ |
| D | regexp-ast.h | 219 ZoneList<RegExpTree*>* nodes() const { return nodes_; } in nodes()
222 ZoneList<RegExpTree*>* nodes_;
|