Home
last modified time | relevance | path

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

12

/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/v8/src/compiler/
Dschedule.h82 bool empty() const { return nodes_.empty(); } in NON_EXPORTED_BASE()
83 size_t size() const { return nodes_.size(); } in NON_EXPORTED_BASE()
84 Node* NodeAt(size_t index) { return nodes_[index]; } in NON_EXPORTED_BASE()
85 size_t NodeCount() const { return nodes_.size(); } in NON_EXPORTED_BASE()
87 value_type& front() { return nodes_.front(); } in NON_EXPORTED_BASE()
88 value_type const& front() const { return nodes_.front(); } in NON_EXPORTED_BASE()
91 iterator begin() { return nodes_.begin(); } in NON_EXPORTED_BASE()
92 iterator end() { return nodes_.end(); } in NON_EXPORTED_BASE()
95 const_iterator begin() const { return nodes_.begin(); } in NON_EXPORTED_BASE()
96 const_iterator end() const { return nodes_.end(); } in NON_EXPORTED_BASE()
[all …]
Dinstruction-scheduler.cc18 auto it = nodes_.begin(); in AddNode()
19 while ((it != nodes_.end()) && in AddNode()
23 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()
53 auto candidate = nodes_.begin(); in PopBestCandidate()
55 static_cast<int>(nodes_.size()))); in PopBestCandidate()
57 nodes_.erase(candidate); in PopBestCandidate()
Dload-elimination.h45 for (size_t i = 0; i < arraysize(nodes_); ++i) { in NON_EXPORTED_BASE()
46 nodes_[i] = nullptr; in NON_EXPORTED_BASE()
50 nodes_[next_index_++] = node; in NON_EXPORTED_BASE()
55 that->nodes_[that->next_index_] = node; in NON_EXPORTED_BASE()
56 that->next_index_ = (that->next_index_ + 1) % arraysize(nodes_); in NON_EXPORTED_BASE()
66 Node* nodes_[kMaxTrackedChecks]; in NON_EXPORTED_BASE()
Dinstruction-scheduler.h104 nodes_(scheduler->zone()) { in SchedulingQueueBase()
110 return nodes_.empty(); in IsEmpty()
115 ZoneLinkedList<ScheduleGraphNode*> nodes_; variable
Dload-elimination.cc142 for (Node* const check : nodes_) { in Lookup()
152 for (size_t i = 0; i < arraysize(nodes_); ++i) { in Equals()
153 if (Node* this_node = this->nodes_[i]) { in Equals()
155 if (j == arraysize(nodes_)) return false; in Equals()
156 if (that->nodes_[j] == this_node) break; in Equals()
160 for (size_t i = 0; i < arraysize(nodes_); ++i) { in Equals()
161 if (Node* that_node = that->nodes_[i]) { in Equals()
163 if (j == arraysize(nodes_)) return false; in Equals()
164 if (this->nodes_[j] == that_node) break; in Equals()
175 for (Node* const this_node : this->nodes_) { in Merge()
[all …]
/external/tensorflow/tensorflow/contrib/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/core/grappler/
Dgraph_view.cc25 auto rslt = nodes_.insert(std::make_pair(node->name(), node)); in GraphView()
33 fanin.node = nodes_[fanin_name]; in GraphView()
51 auto it = nodes_.find(node_name); in GetNode()
52 if (it == nodes_.end()) { in GetNode()
95 auto it = nodes_.find(fanin_name); in GetFanin()
96 if (it != nodes_.end()) { in GetFanin()
114 auto it = nodes_.find(fanin_name); in GetRegularFanin()
115 if (it == nodes_.end()) { in GetRegularFanin()
155 auto it = nodes_.find(fanin_name); in GetFanins()
156 if (it != nodes_.end()) { in GetFanins()
Dutils.cc38 auto rslt = nodes_.emplace(node_name, node); in NodeMap()
44 outputs_[NodeName(input)].insert(nodes_[node_name]); in NodeMap()
50 nodes_.erase(NodeName(name)); in RemoveNode()
56 auto it = nodes_.find(node_name); in GetNode()
57 if (it == nodes_.end()) { in GetNode()
65 return nodes_.find(node_name) != nodes_.end(); in NodeExists()
77 auto ret = nodes_.emplace(node_name, CHECK_NOTNULL(node)); in AddNode()
83 auto output_node = nodes_[NodeName(output_name)]; in AddOutput()
90 outputs_[node_name].erase(nodes_[NodeName(output_name)]); in RemoveOutput()
100 auto node = nodes_[node_name]; in RemoveInputs()
[all …]
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler.h144 void AddNode(const NodeDef* node) override { nodes_.push_back(node); } in AddNode()
146 CHECK(!nodes_.empty()) << "GetCurrNode(), but there's no ready node"; in GetCurrNode()
147 return nodes_.front(); in GetCurrNode()
149 void RemoveCurrNode() override { nodes_.pop_front(); } in RemoveCurrNode()
150 bool Empty() const override { return nodes_.empty(); } in Empty()
153 std::list<const NodeDef*> nodes_;
166 void AddNode(const NodeDef* node) override { nodes_.push_back(node); } in AddNode()
169 bool Empty() const override { return nodes_.empty(); } in Empty()
172 std::list<const NodeDef*> nodes_;
177 std::list<const NodeDef*>::iterator curr_pos_ = nodes_.end();
[all …]
Dvirtual_scheduler.cc97 CHECK(!nodes_.empty()) << "GetCurrNode(), but there's no ready node"; in GetCurrNode()
98 if (curr_pos_ == nodes_.end()) { in GetCurrNode()
99 curr_pos_ = --(nodes_.rbegin().base()); // Last one in the list. in GetCurrNode()
112 nodes_.erase(curr_pos_); in RemoveCurrNode()
114 curr_pos_ = nodes_.end(); // Reset curr_pos_. in RemoveCurrNode()
118 std::make_heap(nodes_.begin(), nodes_.end()); in FirstReadyManager()
126 nodes_.clear(); in Init()
141 if (nodes_.empty()) { in GetCurrNode()
145 CHECK(!nodes_.empty()) << "GetCurrNode(), but there's no ready node"; in GetCurrNode()
147 return nodes_.front(); in GetCurrNode()
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dgraph_rewriter.cc48 nodes_[node.name()].reset(info); in GraphRewriter()
117 auto itr = nodes_.find(node.name()); in RemovalIncreasesEdgeCount()
118 if (itr == nodes_.end()) { in RemovalIncreasesEdgeCount()
135 auto itr = nodes_.find(input_node_name); in RecordConnectivity()
136 if (itr == nodes_.end()) { in RecordConnectivity()
195 auto itr = nodes_.find(input_node_name); in ForwardInputsInternal()
196 if (itr == nodes_.end()) { in ForwardInputsInternal()
/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/contrib/lite/
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()
51 nodes_.push_back(TfLiteNode()); in AddNode()
52 TfLiteNode& node = nodes_.back(); in AddNode()
66 std::vector<TfLiteNode> nodes_; member in tflite::__anonab6bad3f0111::SimpleTestGraph
Darena_planner_test.cc67 nodes_.push_back(TfLiteNode()); in TestGraph()
68 nodes_.back().inputs = int_array(node.inputs()); in TestGraph()
72 nodes_.back().outputs = int_array(node.outputs()); in TestGraph()
76 nodes_.back().temporaries = int_array(node.temporaries()); in TestGraph()
92 for (auto node : nodes_) { in ~TestGraph()
99 const std::vector<TfLiteNode>& nodes() { return nodes_; } in nodes()
105 std::vector<TfLiteNode> nodes_; member in tflite::__anona09efff80111::TestGraph
/external/v8/src/
Dfast-accessor-assembler.cc237 nodes_.push_back(node); in FromRaw()
238 ValueId value_id = {nodes_.size() - 1}; in FromRaw()
250 CHECK_LT(value.value_id, nodes_.size()); in FromId()
251 CHECK_NOT_NULL(nodes_.at(value.value_id)); in FromId()
252 return nodes_.at(value.value_id); in FromId()
265 nodes_.clear(); in Clear()
/external/tensorflow/tensorflow/python/grappler/
Ditem.i193 groups->reserve(nodes_.size()); in ExtractGroups()
195 for (const auto& rep : nodes_) { in ExtractGroups()
224 auto it = nodes_.find(n); in Find()
225 if (it == nodes_.end()) { in Find()
231 nodes_[n] = node; in Find()
249 std::unordered_map<string, Rep*> nodes_; variable
/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph.cc128 return nodes_[it->second]; in GetNode()
134 return nodes_[it->second]; in GetNode()
247 {computation, call_graph->nodes_.size()}); in Build()
251 call_graph->nodes_.emplace_back(computation); in Build()
255 call_graph->nodes_.back().AddCallSiteForInstruction(instruction); in Build()
313 for (const CallGraphNode& node : nodes_) { in IsFlattened()
Dcall_graph.h183 const std::vector<CallGraphNode>& nodes() const { return nodes_; } in nodes()
266 std::vector<CallGraphNode> nodes_; variable
/external/tensorflow/tensorflow/contrib/lite/toco/tensorflow_graph_matching/
Dcluster.h56 const std::vector<const tensorflow::NodeDef*>& GetNodes() { return nodes_; } in GetNodes()
73 std::vector<const tensorflow::NodeDef*> nodes_; variable
/external/jsoncpp/src/lib_json/
Djson_reader.cpp126 while (!nodes_.empty()) in parse()
127 nodes_.pop(); in parse()
128 nodes_.push(&root); in parse()
438 nodes_.push(&value); in readObject()
440 nodes_.pop(); in readObject()
474 nodes_.push(&value); in readArray()
476 nodes_.pop(); in readArray()
752 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
/external/tensorflow/tensorflow/core/graph/
Dgraph.cc308 for (Node* node : nodes_) { in ~Graph()
602 if (static_cast<size_t>(id) >= nodes_.size()) { in IsValidNode()
604 "node id ", id, " is >= than number of nodes in graph ", nodes_.size()); in IsValidNode()
606 if (nodes_[id] != node) { in IsValidNode()
646 const int id = nodes_.size(); in AllocateNode()
649 nodes_.push_back(node); in AllocateNode()
656 nodes_[node->id()] = nullptr; in ReleaseNode()
/external/libmojo/mojo/edk/system/ports/
Dports_unittest.cc321 nodes_[node->name()] = node; in AddNode()
329 nodes_.erase(node->name()); in RemoveNode()
332 for (const auto& entry : nodes_) in RemoveNode()
345 for (const auto& entry : nodes_) { in WaitForIdle()
356 for (const auto& entry : nodes_) in WaitForIdle()
392 if (nodes_.find(from_node->name()) == nodes_.end()) { in ForwardMessage()
397 auto it = nodes_.find(node_name); in ForwardMessage()
398 if (it == nodes_.end()) { in ForwardMessage()
411 if (nodes_.find(from_node->name()) == nodes_.end()) in BroadcastMessage()
414 for (const auto& entry : nodes_) { in BroadcastMessage()
[all …]
/external/tensorflow/tensorflow/core/framework/
Dfunction.cc216 int gnode_idx = nodes_.size() - 1; in InstantiateNode()
332 AddInput(nodes_.size() - 1, item->nid, item->idx + i); in AddReturnNode()
344 NodeInfo& node_info = nodes_[i]; in AddNodeInputs()
395 CHECK_LT(node_index, nodes_.size()); in Name()
396 return nodes_[node_index].name; in Name()
411 nodes_.push_back({name, {}, {}}); in AddNode()
412 CHECK_EQ(result_.nodes.size(), nodes_.size()); in AddNode()
417 CHECK_LT(node_index, nodes_.size()); in AddInput()
418 nodes_[node_index].data_inputs.push_back( in AddInput()
423 CHECK_LT(node_index, nodes_.size()); in AddDep()
[all …]

12