Home
last modified time | relevance | path

Searched refs:edges_ (Results 1 – 25 of 29) sorted by relevance

12

/external/tensorflow/tensorflow/core/graph/
Dedgeset_test.cc26 EdgeSetTest() : edges_(nullptr) {} in EdgeSetTest()
27 ~EdgeSetTest() override { delete[] edges_; } in ~EdgeSetTest()
30 if (edges_) { in MakeEdgeSet()
31 delete[] edges_; in MakeEdgeSet()
33 edges_ = new Edge[n]; in MakeEdgeSet()
37 eset_.insert(&edges_[i]); in MakeEdgeSet()
38 model_.insert(&edges_[i]); in MakeEdgeSet()
57 Edge* edges_; member in tensorflow::EdgeSetTest
75 eset_.insert(&edges_[0]); in TEST_F()
76 model_.insert(&edges_[0]); in TEST_F()
[all …]
Dgraph.h461 const std::vector<Edge*>& edges_;
465 : edges_(edges) {} in GraphEdgesIterable()
512 return const_iterator(edges_.begin(), edges_.end()); in begin()
514 const_iterator end() { return const_iterator(edges_.end(), edges_.end()); } in end()
671 int num_edge_ids() const { return edges_.size(); } in num_edge_ids()
677 const Edge* FindEdgeId(int id) const { return edges_[id]; } in FindEdgeId()
681 GraphEdgesIterable edges() const { return GraphEdgesIterable(edges_); } in edges()
786 std::vector<Edge*> edges_; variable
Dgraph.cc480 edges_.reserve(src.num_edges()); in Copy()
568 edges_[e->id_] = nullptr; in RemoveNode()
575 edges_[e->id_] = nullptr; in RemoveNode()
602 e->id_ = edges_.size(); in AddEdge()
609 edges_.push_back(e); in AddEdge()
620 CHECK_EQ(e, edges_[e->id_]); in RemoveEdge()
623 edges_[e->id_] = nullptr; in RemoveEdge()
/external/cronet/base/substring_set_matcher/
Dsubstring_set_matcher.cc347 edges_.inline_edges[0].label = kEmptyLabel; in AhoCorasickNode()
348 edges_.inline_edges[1].label = kEmptyLabel; in AhoCorasickNode()
353 delete[] edges_.edges; in ~AhoCorasickNode()
365 delete[] edges_.edges; in operator =()
369 edges_.inline_edges[0] = other.edges_.inline_edges[0]; in operator =()
370 edges_.inline_edges[1] = other.edges_.inline_edges[1]; in operator =()
373 edges_.edges = other.edges_.edges; in operator =()
374 other.edges_.edges = nullptr; in operator =()
389 reinterpret_cast<const __m128i*>(&edges_.edges[edge_idx])); in GetEdgeNoInline()
394 return edges_.edges[edge_idx].node_id; in GetEdgeNoInline()
[all …]
Dsubstring_set_matcher.h172 if (edges_.inline_edges[0].label == label) { in GetEdge()
173 return edges_.inline_edges[0].node_id; in GetEdge()
175 if (edges_.inline_edges[1].label == label) { in GetEdge()
176 return edges_.inline_edges[1].node_id; in GetEdge()
185 DCHECK_EQ(0u, reinterpret_cast<uintptr_t>(edges_.inline_edges) % in edges()
187 return edges_capacity_ == 0 ? edges_.inline_edges : edges_.edges; in edges()
285 } edges_; variable
/external/cronet/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h584 CordRep* edges_[kMaxCapacity]; variable
610 return edges_[index]; in Edge()
614 return edges_[edge_type == kFront ? begin() : back()]; in Edge()
618 return {edges_ + begin(), size()}; in Edges()
626 return {edges_ + begin, static_cast<size_t>(end - begin)}; in Edges()
646 tree->edges_[0] = rep; in New()
656 tree->edges_[0] = front; in New()
657 tree->edges_[1] = back; in New()
736 edges_[i] = edges_[i + delta]; in AlignBegin()
754 edges_[i] = edges_[i - delta]; in AlignEnd()
[all …]
Dcord_rep_btree_navigator.cc147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
165 subtree->edges_[subtree_end++] = right; in Read()
170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read()
Dcord_rep_btree.cc500 CordRep::Unref(edges_[idx]); in SetEdge()
512 result.tree->edges_[idx] = edge; in SetEdge()
539 leaf->edges_[end++] = flat; in NewLeaf()
558 leaf->edges_[--begin] = flat; in NewLeaf()
577 edges_[fetch_add_end(1)] = flat; in AddData()
593 edges_[sub_fetch_begin(1)] = flat; in AddData()
734 sub->edges_[begin] = MakeSubstring(CordRep::Ref(edge), offset, len); in CopySuffix()
742 sub->edges_[begin] = nsub; in CopySuffix()
787 sub->edges_[end++] = MakeSubstring(CordRep::Ref(edge), 0, n); in CopyPrefix()
796 sub->edges_[end++] = nsub; in CopyPrefix()
[all …]
/external/angle/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h592 CordRep* edges_[kMaxCapacity]; variable
618 return edges_[index]; in Edge()
622 return edges_[edge_type == kFront ? begin() : back()]; in Edge()
626 return {edges_ + begin(), size()}; in Edges()
634 return {edges_ + begin, static_cast<size_t>(end - begin)}; in Edges()
654 tree->edges_[0] = rep; in New()
664 tree->edges_[0] = front; in New()
665 tree->edges_[1] = back; in New()
744 edges_[i] = edges_[i + delta]; in AlignBegin()
762 edges_[i] = edges_[i - delta]; in AlignEnd()
[all …]
Dcord_rep_btree_navigator.cc147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
165 subtree->edges_[subtree_end++] = right; in Read()
170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read()
Dcord_rep_btree.cc509 CordRep::Unref(edges_[idx]); in SetEdge()
521 result.tree->edges_[idx] = edge; in SetEdge()
548 leaf->edges_[end++] = flat; in NewLeaf()
567 leaf->edges_[--begin] = flat; in NewLeaf()
586 edges_[fetch_add_end(1)] = flat; in AddData()
602 edges_[sub_fetch_begin(1)] = flat; in AddData()
743 sub->edges_[begin] = MakeSubstring(CordRep::Ref(edge), offset, len); in CopySuffix()
751 sub->edges_[begin] = nsub; in CopySuffix()
796 sub->edges_[end++] = MakeSubstring(CordRep::Ref(edge), 0, n); in CopyPrefix()
805 sub->edges_[end++] = nsub; in CopyPrefix()
[all …]
Dcord_rep_btree_test.cc41 node->edges_[idx] = edge; in SetEdge()
44 node->edges_[node->fetch_add_end(1)] = edge; in AddEdge()
/external/tensorflow/third_party/absl/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h584 CordRep* edges_[kMaxCapacity]; variable
610 return edges_[index]; in Edge()
614 return edges_[edge_type == kFront ? begin() : back()]; in Edge()
618 return {edges_ + begin(), size()}; in Edges()
626 return {edges_ + begin, static_cast<size_t>(end - begin)}; in Edges()
646 tree->edges_[0] = rep; in New()
656 tree->edges_[0] = front; in New()
657 tree->edges_[1] = back; in New()
725 edges_[i] = edges_[i + delta]; in AlignBegin()
743 edges_[i] = edges_[i - delta]; in AlignEnd()
[all …]
Dcord_rep_btree_navigator.cc147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
165 subtree->edges_[subtree_end++] = right; in Read()
170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read()
Dcord_rep_btree.cc499 CordRep::Unref(edges_[idx]); in SetEdge()
511 result.tree->edges_[idx] = edge; in SetEdge()
538 leaf->edges_[end++] = flat; in NewLeaf()
557 leaf->edges_[--begin] = flat; in NewLeaf()
576 edges_[fetch_add_end(1)] = flat; in AddData()
592 edges_[sub_fetch_begin(1)] = flat; in AddData()
733 sub->edges_[begin] = MakeSubstring(CordRep::Ref(edge), offset, len); in CopySuffix()
741 sub->edges_[begin] = nsub; in CopySuffix()
786 sub->edges_[end++] = MakeSubstring(CordRep::Ref(edge), 0, n); in CopyPrefix()
795 sub->edges_[end++] = nsub; in CopyPrefix()
[all …]
/external/webrtc/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h584 CordRep* edges_[kMaxCapacity]; variable
610 return edges_[index]; in Edge()
614 return edges_[edge_type == kFront ? begin() : back()]; in Edge()
618 return {edges_ + begin(), size()}; in Edges()
626 return {edges_ + begin, static_cast<size_t>(end - begin)}; in Edges()
646 tree->edges_[0] = rep; in New()
656 tree->edges_[0] = front; in New()
657 tree->edges_[1] = back; in New()
725 edges_[i] = edges_[i + delta]; in AlignBegin()
743 edges_[i] = edges_[i - delta]; in AlignEnd()
[all …]
Dcord_rep_btree_navigator.cc147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
165 subtree->edges_[subtree_end++] = right; in Read()
170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read()
Dcord_rep_btree.cc499 CordRep::Unref(edges_[idx]); in SetEdge()
511 result.tree->edges_[idx] = edge; in SetEdge()
538 leaf->edges_[end++] = flat; in NewLeaf()
557 leaf->edges_[--begin] = flat; in NewLeaf()
576 edges_[fetch_add_end(1)] = flat; in AddData()
592 edges_[sub_fetch_begin(1)] = flat; in AddData()
733 sub->edges_[begin] = MakeSubstring(CordRep::Ref(edge), offset, len); in CopySuffix()
741 sub->edges_[begin] = nsub; in CopySuffix()
786 sub->edges_[end++] = MakeSubstring(CordRep::Ref(edge), 0, n); in CopyPrefix()
795 sub->edges_[end++] = nsub; in CopyPrefix()
[all …]
/external/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h583 CordRep* edges_[kMaxCapacity]; variable
609 return edges_[index]; in Edge()
613 return edges_[edge_type == kFront ? begin() : back()]; in Edge()
617 return {edges_ + begin(), size()}; in Edges()
625 return {edges_ + begin, static_cast<size_t>(end - begin)}; in Edges()
645 tree->edges_[0] = rep; in New()
655 tree->edges_[0] = front; in New()
656 tree->edges_[1] = back; in New()
724 edges_[i] = edges_[i + delta]; in AlignBegin()
742 edges_[i] = edges_[i - delta]; in AlignEnd()
[all …]
Dcord_rep_btree_navigator.cc147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
165 subtree->edges_[subtree_end++] = right; in Read()
170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read()
Dcord_rep_btree.cc496 CordRep::Unref(edges_[idx]); in SetEdge()
508 result.tree->edges_[idx] = edge; in SetEdge()
535 leaf->edges_[end++] = flat; in NewLeaf()
554 leaf->edges_[--begin] = flat; in NewLeaf()
573 edges_[fetch_add_end(1)] = flat; in AddData()
589 edges_[sub_fetch_begin(1)] = flat; in AddData()
730 sub->edges_[begin] = MakeSubstring(CordRep::Ref(edge), offset, len); in CopySuffix()
738 sub->edges_[begin] = nsub; in CopySuffix()
783 sub->edges_[end++] = MakeSubstring(CordRep::Ref(edge), 0, n); in CopyPrefix()
792 sub->edges_[end++] = nsub; in CopyPrefix()
[all …]
/external/tensorflow/tensorflow/lite/delegates/gpu/common/memory_management/
Dmin_cost_flow_assignment.cc100 const Edge& edge = edges_[edge_id]; in Solve()
123 --edges_[prev_edge[v]].cap; in Solve()
124 Edge& rev_edge = edges_[prev_edge[v] ^ 1]; in Solve()
136 const Edge& edge = edges_[edge_id]; in CalculateAssignment()
157 edges_from_[src].push_back(edges_.size()); in AddEdge()
158 edges_.emplace_back(dst, cap, cost); in AddEdge()
159 edges_from_[dst].push_back(edges_.size()); in AddEdge()
160 edges_.push_back({src, 0, -cost}); in AddEdge()
189 const Edge& edge = edges_[edge_id]; in AssignTensorsToNewSharedObject()
205 std::vector<Edge> edges_; member in tflite::gpu::__anon7795d4aa0111::MinCostFlowSolver
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h163 if (recycled_nodes_.getBit(edges_[i].from) || in newNode()
164 recycled_nodes_.getBit(edges_[i].to)) { in newNode()
165 Swap(edges_[i], edges_[n_edges_ - 1]); in newNode()
252 if (n_edges_ < ARRAY_SIZE(edges_)) { in addEdges()
256 edges_[n_edges_++] = e; in addEdges()
269 if (edges_[i].from == from_idx && edges_[i].to == to_idx) { in findEdge()
270 *stk_from = edges_[i].stk_from; in findEdge()
271 *stk_to = edges_[i].stk_to; in findEdge()
272 *unique_tid = edges_[i].unique_tid; in findEdge()
410 Edge edges_[BV::kSize * 32]; variable
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc146 std::vector<SimpleEdge*> edges_; member in tensorflow::tensorrt::segment::__anon591344890111::SimpleGraph
165 edges_.resize(n_edges, nullptr); in SimpleGraph()
184 edges_[i] = edge; in SimpleGraph()
195 int i = edges_.size(); in AddEdge()
201 edges_.push_back(nullptr); in AddEdge()
206 edges_[i] = edge; in AddEdge()
234 for (auto x : edges_) delete x; in ~SimpleGraph()
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_graph_dumper.cc451 std::vector<std::string> edges_; member in xla::__anon758a858c0111::HloDotDumper
592 return StrCat(StrJoin(edges_, "\n"), "\n}"); in Footer()
634 edges_.push_back(StrFormat( in DumpSubcomputation()
754 edges_.push_back(StrFormat(R"(%s -> %s [tooltip=" "];)", from_id, to_id)); in DumpRootTag()
1400 edges_.push_back(StrFormat(kEdgeFmt, InstructionId(from), InstructionId(to), in AddInstructionIncomingEdges()

12