Home
last modified time | relevance | path

Searched refs:nodes_ (Results 1 – 25 of 69) sorted by relevance

123

/external/libchrome/base/task/sequence_manager/
Dintrusive_heap.h50 IntrusiveHeap() : nodes_(kMinimumHeapSize), size_(0) {} in IntrusiveHeap()
66 nodes_.resize(kMinimumHeapSize); in Clear()
72 return nodes_[1]; in Min()
80 MoveHoleDownAndFillWithLeafElement(1u, std::move(nodes_[top_index])); in Pop()
85 if (size_ >= nodes_.size()) in insert()
86 nodes_.resize(nodes_.size() * 2); in insert()
99 if (nodes_[handle.index_] <= nodes_[top_index]) { in erase()
101 std::move(nodes_[top_index])); in erase()
103 MoveHoleUpAndFillWithElement(handle.index_, std::move(nodes_[top_index])); in erase()
114 if (nodes_[handle.index_] <= element) { in ChangeKey()
[all …]
/external/tensorflow/tensorflow/compiler/xla/
Dshape_tree.h162 return iterator(&nodes_, nodes_.begin(), in begin()
166 return iterator(&nodes_, nodes_.end(), in end()
170 return const_iterator(&nodes_, nodes_.begin(), in begin()
174 return const_iterator(&nodes_, nodes_.end(), in end()
191 return iterator(&nodes_, nodes_.begin(), in leaf_begin()
195 return iterator(&nodes_, nodes_.end(), in leaf_end()
199 return const_iterator(&nodes_, nodes_.begin(), in leaf_begin()
203 return const_iterator(&nodes_, nodes_.end(), in leaf_end()
227 auto element_iter = nodes_.begin() + (element - &nodes_[0]); in find()
228 return iterator(&nodes_, element_iter, /*iterate_leaves_only=*/false); in find()
[all …]
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
Dgraphcycles.cc65 Vec<Node*> nodes_; member
79 for (Vec<Node*>::size_type i = 0; i < rep_->nodes_.size(); i++) { in ~GraphCycles()
80 delete rep_->nodes_[i]; in ~GraphCycles()
88 for (Vec<Node*>::size_type x = 0; x < r->nodes_.size(); x++) { in CheckInvariants()
89 Node* nx = r->nodes_[x]; in CheckInvariants()
97 Node* ny = r->nodes_[y]; in CheckInvariants()
112 n->rank = rep_->nodes_.size(); in NewNode()
113 rep_->nodes_.push_back(n); in NewNode()
119 rep_->nodes_[r]->data = nullptr; in NewNode()
126 Node* x = rep_->nodes_[node]; in RemoveNode()
[all …]
/external/webrtc/webrtc/modules/audio_processing/transient/
Dwpd_tree.cc35 nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
39 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
56 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
59 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
73 return nodes_[(1 << level) + index].get(); in NodeAt()
82 int update_result = nodes_[1]->set_data(data, data_length); in Update()
102 update_result = nodes_[index_left_child]->Update( in Update()
103 nodes_[index]->data(), nodes_[index]->length()); in Update()
108 update_result = nodes_[index_right_child]->Update( in Update()
109 nodes_[index]->data(), nodes_[index]->length()); in Update()
/external/swiftshader/third_party/SPIRV-Tools/source/comp/
Dmove_to_front.h50 nodes_.reserve(reserve_capacity);
53 nodes_.emplace_back(Node());
132 uint32_t ValueOf(uint32_t node) const { return nodes_.at(node).value; } in ValueOf()
135 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf()
138 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf()
141 uint32_t ParentOf(uint32_t node) const { return nodes_.at(node).parent; } in ParentOf()
146 return nodes_.at(node).timestamp; in TimestampOf()
150 uint32_t SizeOf(uint32_t node) const { return nodes_.at(node).size; } in SizeOf()
153 uint32_t HeightOf(uint32_t node) const { return nodes_.at(node).height; } in HeightOf()
158 return nodes_.at(node).value; in MutableValueOf()
[all …]
Dhuffman_codec.h70 nodes_.reserve(3 * hist.size()); in HuffmanCodec()
130 nodes_ = std::move(nodes); in HuffmanCodec()
131 assert(!nodes_.empty()); in HuffmanCodec()
132 assert(root_handle > 0 && root_handle < nodes_.size()); in HuffmanCodec()
157 for (const Node& node : nodes_) { in SerializeToText()
249 Val ValueOf(uint32_t node) const { return nodes_.at(node).value; } in ValueOf()
252 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf()
255 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf()
258 uint32_t WeightOf(uint32_t node) const { return nodes_.at(node).weight; } in WeightOf()
261 uint32_t IdOf(uint32_t node) const { return nodes_.at(node).id; } in IdOf()
[all …]
/external/deqp-deps/SPIRV-Tools/source/comp/
Dmove_to_front.h50 nodes_.reserve(reserve_capacity);
53 nodes_.emplace_back(Node());
132 uint32_t ValueOf(uint32_t node) const { return nodes_.at(node).value; } in ValueOf()
135 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf()
138 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf()
141 uint32_t ParentOf(uint32_t node) const { return nodes_.at(node).parent; } in ParentOf()
146 return nodes_.at(node).timestamp; in TimestampOf()
150 uint32_t SizeOf(uint32_t node) const { return nodes_.at(node).size; } in SizeOf()
153 uint32_t HeightOf(uint32_t node) const { return nodes_.at(node).height; } in HeightOf()
158 return nodes_.at(node).value; in MutableValueOf()
[all …]
Dhuffman_codec.h70 nodes_.reserve(3 * hist.size()); in HuffmanCodec()
130 nodes_ = std::move(nodes); in HuffmanCodec()
131 assert(!nodes_.empty()); in HuffmanCodec()
132 assert(root_handle > 0 && root_handle < nodes_.size()); in HuffmanCodec()
157 for (const Node& node : nodes_) { in SerializeToText()
249 Val ValueOf(uint32_t node) const { return nodes_.at(node).value; } in ValueOf()
252 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf()
255 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf()
258 uint32_t WeightOf(uint32_t node) const { return nodes_.at(node).weight; } in WeightOf()
261 uint32_t IdOf(uint32_t node) const { return nodes_.at(node).id; } in IdOf()
[all …]
/external/v8/src/compiler/
Dschedule.h88 bool empty() const { return nodes_.empty(); } in NON_EXPORTED_BASE()
89 size_t size() const { return nodes_.size(); } in NON_EXPORTED_BASE()
90 Node* NodeAt(size_t index) { return nodes_[index]; } in NON_EXPORTED_BASE()
91 size_t NodeCount() const { return nodes_.size(); } in NON_EXPORTED_BASE()
93 value_type& front() { return nodes_.front(); } in NON_EXPORTED_BASE()
94 value_type const& front() const { return nodes_.front(); } in NON_EXPORTED_BASE()
97 iterator begin() { return nodes_.begin(); } in NON_EXPORTED_BASE()
98 iterator end() { return nodes_.end(); } in NON_EXPORTED_BASE()
100 void RemoveNode(iterator it) { nodes_.erase(it); } in NON_EXPORTED_BASE()
103 const_iterator begin() const { return nodes_.begin(); } in NON_EXPORTED_BASE()
[all …]
Dinstruction-scheduler.cc19 auto it = nodes_.begin(); in AddNode()
20 while ((it != nodes_.end()) && in AddNode()
24 nodes_.insert(it, node); in AddNode()
31 auto candidate = nodes_.end(); in PopBestCandidate()
32 for (auto iterator = nodes_.begin(); iterator != nodes_.end(); ++iterator) { in PopBestCandidate()
40 if (candidate != nodes_.end()) { in PopBestCandidate()
42 nodes_.erase(candidate); in PopBestCandidate()
54 auto candidate = nodes_.begin(); in PopBestCandidate()
56 static_cast<int>(nodes_.size()))); in PopBestCandidate()
58 nodes_.erase(candidate); in PopBestCandidate()
/external/libtextclassifier/utils/sentencepiece/
Ddouble_array_trie.h46 : nodes_(nodes), nodes_length_(nodes_length) {} in DoubleArrayTrie()
57 bool has_leaf(uint32 i) const { return nodes_[i] & 0x100; } in has_leaf()
61 return static_cast<int>(LittleEndian::ToHost32(nodes_[i]) & 0x7fffffff); in value()
67 return LittleEndian::ToHost32(nodes_[i]) & 0x800000ff; in label()
72 const uint32 node = LittleEndian::ToHost32(nodes_[i]); in offset()
79 const TrieNode* nodes_; variable
/external/tensorflow/tensorflow/lite/testing/
Dmessage.cc32 nodes_.push(first_node); in MessageStack()
38 Message* current_node = nodes_.top(); in ConsumeToken()
45 nodes_.push(current_node ? current_node->AddChild(previous_token_) in ConsumeToken()
52 if (nodes_.size() == 1 || !previous_token_.empty()) { in ConsumeToken()
59 nodes_.pop(); in ConsumeToken()
84 std::stack<Message*> nodes_; member in tflite::testing::MessageStack
/external/tensorflow/tensorflow/lite/testing/nnapi_tflite_zip_tests/
Dmessage.cc35 nodes_.push(first_node); in MessageStack()
41 Message* current_node = nodes_.top(); in ConsumeToken()
48 nodes_.push(current_node ? current_node->AddChild(previous_token_) in ConsumeToken()
55 if (nodes_.size() == 1 || !previous_token_.empty()) { in ConsumeToken()
62 nodes_.pop(); in ConsumeToken()
87 std::stack<Message*> nodes_; member in tflite::testing::MessageStack
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler.h149 void AddNode(const NodeDef* node) override { nodes_.push_back(node); } in AddNode()
151 CHECK(!nodes_.empty()) << "GetCurrNode(), but there's no ready node"; in GetCurrNode()
152 return nodes_.front(); in GetCurrNode()
154 void RemoveCurrNode() override { nodes_.pop_front(); } in RemoveCurrNode()
155 bool Empty() const override { return nodes_.empty(); } in Empty()
158 std::list<const NodeDef*> nodes_;
171 void AddNode(const NodeDef* node) override { nodes_.push_back(node); } in AddNode()
174 bool Empty() const override { return nodes_.empty(); } in Empty()
177 std::list<const NodeDef*> nodes_;
182 std::list<const NodeDef*>::iterator curr_pos_ = nodes_.end();
[all …]
Dvirtual_scheduler.cc69 CHECK(!nodes_.empty()) << "GetCurrNode(), but there's no ready node"; in GetCurrNode()
70 if (curr_pos_ == nodes_.end()) { in GetCurrNode()
71 curr_pos_ = --(nodes_.rbegin().base()); // Last one in the list. in GetCurrNode()
84 nodes_.erase(curr_pos_); in RemoveCurrNode()
86 curr_pos_ = nodes_.end(); // Reset curr_pos_. in RemoveCurrNode()
90 std::make_heap(nodes_.begin(), nodes_.end()); in FirstReadyManager()
98 nodes_.clear(); in Init()
113 if (nodes_.empty()) { in GetCurrNode()
117 CHECK(!nodes_.empty()) << "GetCurrNode(), but there's no ready node"; in GetCurrNode()
119 return nodes_.front(); in GetCurrNode()
[all …]
/external/tensorflow/tensorflow/core/grappler/
Dgraph_view.h116 return gtl::FindWithDefault(nodes_, node_name, nullptr); in GetNode()
161 auto it = nodes_.find(tensor_id.node()); in GetFanin()
162 if (it != nodes_.end()) result.emplace(it->second, tensor_id.index()); in GetFanin()
238 auto it = nodes_.find(tensor_id.node()); in GetFanins()
239 if (it != nodes_.end()) result.emplace(it->second, tensor_id.index()); in GetFanins()
309 auto it = nodes_.find(tensor_id.node()); in GetFaninEdges()
310 if (it != nodes_.end()) { in GetFaninEdges()
322 auto inserted = nodes_.emplace(node->name(), node); in AddUniqueNode()
341 OutputPort output(nodes_[tensor_id.node()], tensor_id.index()); in AddFanouts()
358 absl::flat_hash_map<absl::string_view, NodeDefT*>& nodes() { return nodes_; } in nodes()
[all …]
Dutils.cc80 auto rslt = nodes_.emplace(node_name, node); in NodeMap()
86 outputs_[NodeName(input)].insert(nodes_[node_name]); in NodeMap()
92 nodes_.erase(NodeName(name)); in RemoveNode()
98 auto it = nodes_.find(node_name); in GetNode()
99 if (it == nodes_.end()) { in GetNode()
107 return nodes_.find(node_name) != nodes_.end(); in NodeExists()
119 auto ret = nodes_.emplace(node_name, CHECK_NOTNULL(node)); in AddNode()
125 auto output_node = nodes_[NodeName(output_name)]; in AddOutput()
132 outputs_[node_name].erase(nodes_[NodeName(output_name)]); in RemoveOutput()
142 auto node = nodes_[node_name]; in RemoveInputs()
[all …]
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc123 if (node_id < 0 || node_id > static_cast<int>(nodes_.size())) { in FindNodeId()
126 return nodes_[node_id]; in FindNodeId()
128 int num_node_ids() const { return nodes_.size(); } in num_node_ids()
129 const SimpleNode* source_node() const { return nodes_[Graph::kSourceId]; } in source_node()
130 const SimpleNode* sink_node() const { return nodes_[Graph::kSinkId]; } in sink_node()
134 std::vector<SimpleNode*> nodes_; member in tensorflow::tensorrt::segment::SimpleGraph
150 nodes_.resize(n_nodes, nullptr); in SimpleGraph()
151 nodes_[g->kSourceId] = new SimpleNode(g->source_node(), g->kSourceId); in SimpleGraph()
152 nodes_[g->kSinkId] = new SimpleNode(g->sink_node(), g->kSinkId); in SimpleGraph()
158 nodes_[i] = new SimpleNode(n, i); in SimpleGraph()
[all …]
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_tree.h207 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
/external/deqp-deps/SPIRV-Tools/source/opt/
Ddominator_tree.h207 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
/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph.cc132 return nodes_[it->second]; in GetNode()
138 return nodes_[it->second]; in GetNode()
244 for (CallGraphNode& node : nodes_) { in SetNodeDepths()
270 for (CallGraphNode& node : nodes_) { in SetNodeDepths()
286 {computation, call_graph->nodes_.size()}); in Build()
290 call_graph->nodes_.emplace_back(computation); in Build()
294 call_graph->nodes_.back().AddCallSiteForInstruction(instruction); in Build()
354 for (const CallGraphNode& node : nodes_) { in IsFlattened()
/external/v8/src/profiler/
Dsampling-heap-profiler.h28 AllocationProfile() : nodes_() {} in AllocationProfile()
31 return nodes_.size() == 0 ? nullptr : &nodes_.front(); in GetRootNode()
34 std::deque<v8::AllocationProfile::Node>& nodes() { return nodes_; } in nodes()
37 std::deque<v8::AllocationProfile::Node> nodes_;
/external/tensorflow/tensorflow/lite/
Darena_planner_test.cc69 nodes_.push_back(TfLiteNode()); in TestGraph()
70 nodes_.back().inputs = int_array(node.inputs()); in TestGraph()
74 nodes_.back().outputs = int_array(node.outputs()); in TestGraph()
78 nodes_.back().temporaries = int_array(node.temporaries()); in TestGraph()
94 for (auto node : nodes_) { in ~TestGraph()
101 const std::vector<TfLiteNode>& nodes() { return nodes_; } in nodes()
112 std::swap(nodes_, other->nodes_); in Swap()
120 std::vector<TfLiteNode> nodes_; member in tflite::__anon43acde040111::TestGraph
Dgraph_info_test.cc36 for (auto& node : nodes_) { in ~SimpleTestGraph()
43 size_t num_nodes() const override { return nodes_.size(); } in num_nodes()
44 const TfLiteNode& node(size_t index) const override { return nodes_[index]; } in node()
52 nodes_.push_back(TfLiteNode()); in AddNode()
53 TfLiteNode& node = nodes_.back(); in AddNode()
67 std::vector<TfLiteNode> nodes_; member in tflite::__anon531b66cb0111::SimpleTestGraph
/external/tensorflow/tensorflow/python/grappler/
Ditem.i198 groups->reserve(nodes_.size()); in ExtractGroups()
200 for (const auto& rep : nodes_) { in ExtractGroups()
229 auto it = nodes_.find(n); in Find()
230 if (it == nodes_.end()) { in Find()
236 nodes_[n] = node; in Find()
254 std::unordered_map<string, Rep*> nodes_; variable

123