| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/ |
| D | dominator_analysis.h | 29 explicit DominatorAnalysisBase(bool is_post_dom) : tree_(is_post_dom) {} in DominatorAnalysisBase()
33 tree_.InitializeTree(cfg, f); in InitializeTree()
45 return tree_.Dominates(a, b); in Dominates()
61 return tree_.StrictlyDominates(a, b); in StrictlyDominates()
68 return tree_.ImmediateDominator(node); in ImmediateDominator()
74 return tree_.ImmediateDominator(node_id); in ImmediateDominator()
80 return tree_.ReachableFromRoots(node->id()); in IsReachable()
85 return tree_.ReachableFromRoots(node_id); in IsReachable()
89 inline void DumpAsDot(std::ostream& out) const { tree_.DumpTreeAsDot(out); } in DumpAsDot()
92 inline bool IsPostDominator() const { return tree_.IsPostDominator(); } in IsPostDominator()
[all …]
|
| D | dominator_analysis.cpp | 55 return tree_.Dominates(bb_a, bb_b); in Dominates()
61 if (tree_.IsPostDominator()) { in Dominates()
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | dominator_analysis.h | 29 explicit DominatorAnalysisBase(bool is_post_dom) : tree_(is_post_dom) {} in DominatorAnalysisBase()
33 tree_.InitializeTree(cfg, f); in InitializeTree()
45 return tree_.Dominates(a, b); in Dominates()
61 return tree_.StrictlyDominates(a, b); in StrictlyDominates()
68 return tree_.ImmediateDominator(node); in ImmediateDominator()
74 return tree_.ImmediateDominator(node_id); in ImmediateDominator()
80 return tree_.ReachableFromRoots(node->id()); in IsReachable()
85 return tree_.ReachableFromRoots(node_id); in IsReachable()
89 inline void DumpAsDot(std::ostream& out) const { tree_.DumpTreeAsDot(out); } in DumpAsDot()
92 inline bool IsPostDominator() const { return tree_.IsPostDominator(); } in IsPostDominator()
[all …]
|
| D | dominator_analysis.cpp | 55 return tree_.Dominates(bb_a, bb_b); in Dominates()
61 if (tree_.IsPostDominator()) { in Dominates()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | dominator_analysis.h | 29 explicit DominatorAnalysisBase(bool is_post_dom) : tree_(is_post_dom) {} in DominatorAnalysisBase()
33 tree_.InitializeTree(cfg, f); in InitializeTree()
45 return tree_.Dominates(a, b); in Dominates()
61 return tree_.StrictlyDominates(a, b); in StrictlyDominates()
68 return tree_.ImmediateDominator(node); in ImmediateDominator()
74 return tree_.ImmediateDominator(node_id); in ImmediateDominator()
80 return tree_.ReachableFromRoots(node->id()); in IsReachable()
85 return tree_.ReachableFromRoots(node_id); in IsReachable()
89 inline void DumpAsDot(std::ostream& out) const { tree_.DumpTreeAsDot(out); } in DumpAsDot()
92 inline bool IsPostDominator() const { return tree_.IsPostDominator(); } in IsPostDominator()
[all …]
|
| D | dominator_analysis.cpp | 55 return tree_.Dominates(bb_a, bb_b); in Dominates()
61 if (tree_.IsPostDominator()) { in Dominates()
|
| /external/openscreen/third_party/abseil/src/absl/container/internal/ |
| D | btree_container.h | 68 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
71 : tree_(comp, alloc) {} in tree_() function
73 : tree_(key_compare(), alloc) {} in btree_container()
80 : tree_(other.tree_, alloc) {} in btree_container()
85 : tree_(std::move(other.tree_), alloc) {} in btree_container()
92 iterator begin() { return tree_.begin(); } in begin()
93 const_iterator begin() const { return tree_.begin(); } in begin()
94 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
95 iterator end() { return tree_.end(); } in end()
96 const_iterator end() const { return tree_.end(); } in end()
[all …]
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 69 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
72 : tree_(comp, alloc) {} in tree_() function
74 : tree_(key_compare(), alloc) {} in btree_container()
81 : tree_(other.tree_, alloc) {} in btree_container()
86 : tree_(std::move(other.tree_), alloc) {} in btree_container()
93 iterator begin() { return tree_.begin(); } in begin()
94 const_iterator begin() const { return tree_.begin(); } in begin()
95 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
96 iterator end() { return tree_.end(); } in end()
97 const_iterator end() const { return tree_.end(); } in end()
[all …]
|
| /external/cronet/third_party/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 74 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
77 : tree_(comp, alloc) {} in tree_() function
79 : tree_(key_compare(), alloc) {} in btree_container()
86 : tree_(other.tree_, alloc) {} in btree_container()
91 : tree_(std::move(other.tree_), alloc) {} in btree_container()
98 iterator begin() { return tree_.begin(); } in begin()
99 const_iterator begin() const { return tree_.begin(); } in begin()
100 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
101 iterator end() { return tree_.end(); } in end()
102 const_iterator end() const { return tree_.end(); } in end()
[all …]
|
| /external/webrtc/third_party/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 69 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
72 : tree_(comp, alloc) {} in tree_() function
74 : tree_(key_compare(), alloc) {} in btree_container()
81 : tree_(other.tree_, alloc) {} in btree_container()
86 : tree_(std::move(other.tree_), alloc) {} in btree_container()
93 iterator begin() { return tree_.begin(); } in begin()
94 const_iterator begin() const { return tree_.begin(); } in begin()
95 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
96 iterator end() { return tree_.end(); } in end()
97 const_iterator end() const { return tree_.end(); } in end()
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 74 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
77 : tree_(comp, alloc) {} in tree_() function
79 : tree_(key_compare(), alloc) {} in btree_container()
86 : tree_(other.tree_, alloc) {} in btree_container()
91 : tree_(std::move(other.tree_), alloc) {} in btree_container()
98 iterator begin() ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.begin(); } in begin()
100 return tree_.begin(); in begin()
103 return tree_.begin(); in cbegin()
105 iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.end(); } in end()
107 return tree_.end(); in end()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 68 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
71 : tree_(comp, alloc) {} in tree_() function
73 : tree_(key_compare(), alloc) {} in btree_container()
80 : tree_(other.tree_, alloc) {} in btree_container()
85 : tree_(std::move(other.tree_), alloc) {} in btree_container()
92 iterator begin() { return tree_.begin(); } in begin()
93 const_iterator begin() const { return tree_.begin(); } in begin()
94 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
95 iterator end() { return tree_.end(); } in end()
96 const_iterator end() const { return tree_.end(); } in end()
[all …]
|
| /external/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 69 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
72 : tree_(comp, alloc) {} in tree_() function
74 : tree_(key_compare(), alloc) {} in btree_container()
81 : tree_(other.tree_, alloc) {} in btree_container()
86 : tree_(std::move(other.tree_), alloc) {} in btree_container()
93 iterator begin() { return tree_.begin(); } in begin()
94 const_iterator begin() const { return tree_.begin(); } in begin()
95 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
96 iterator end() { return tree_.end(); } in end()
97 const_iterator end() const { return tree_.end(); } in end()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 67 btree_container() : tree_(key_compare(), allocator_type()) {} in btree_container()
70 : tree_(comp, alloc) {} in tree_() function
78 iterator begin() { return tree_.begin(); } in begin()
79 const_iterator begin() const { return tree_.begin(); } in begin()
80 const_iterator cbegin() const { return tree_.begin(); } in cbegin()
81 iterator end() { return tree_.end(); } in end()
82 const_iterator end() const { return tree_.end(); } in end()
83 const_iterator cend() const { return tree_.end(); } in cend()
84 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
85 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
[all …]
|
| /external/cronet/base/substring_set_matcher/ |
| D | substring_set_matcher.cc | 80 tree_.reserve(GetTreeSize(patterns)); in Build()
85 DCHECK_EQ(tree_.size(), static_cast<size_t>(GetTreeSize(patterns))); in Build()
87 is_empty_ = patterns.empty() && tree_.size() == 1u; in Build()
100 const AhoCorasickNode* const root = &tree_[kRootID]; in Match()
111 current_node = &tree_[current_node->failure()]; in Match()
118 current_node = &tree_[child]; in Match()
132 const AhoCorasickNode* const root = &tree_[kRootID]; in AnyMatch()
145 current_node = &tree_[current_node->failure()]; in AnyMatch()
152 current_node = &tree_[child]; in AnyMatch()
167 return base::trace_event::EstimateMemoryUsage(tree_); in EstimateMemoryUsage()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/container/ |
| D | btree_test.cc | 93 base_checker() : const_tree_(tree_) {} in base_checker()
95 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
98 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
100 iterator begin() { return tree_.begin(); } in begin()
101 const_iterator begin() const { return tree_.begin(); } in begin()
102 iterator end() { return tree_.end(); } in end()
103 const_iterator end() const { return tree_.end(); } in end()
104 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
105 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
106 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 94 base_checker() : const_tree_(tree_) {} in base_checker()
96 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
99 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
101 iterator begin() { return tree_.begin(); } in begin()
102 const_iterator begin() const { return tree_.begin(); } in begin()
103 iterator end() { return tree_.end(); } in end()
104 const_iterator end() const { return tree_.end(); } in end()
105 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
106 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
107 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/container/ |
| D | btree_test.cc | 94 base_checker() : const_tree_(tree_) {} in base_checker()
96 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
99 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
101 iterator begin() { return tree_.begin(); } in begin()
102 const_iterator begin() const { return tree_.begin(); } in begin()
103 iterator end() { return tree_.end(); } in end()
104 const_iterator end() const { return tree_.end(); } in end()
105 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
106 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
107 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/ |
| D | btree_test.cc | 98 base_checker() : const_tree_(tree_) {} in base_checker()
100 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
103 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
105 iterator begin() { return tree_.begin(); } in begin()
106 const_iterator begin() const { return tree_.begin(); } in begin()
107 iterator end() { return tree_.end(); } in end()
108 const_iterator end() const { return tree_.end(); } in end()
109 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
110 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
111 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 101 base_checker() : const_tree_(tree_) {} in base_checker()
103 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
106 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
108 iterator begin() { return tree_.begin(); } in begin()
109 const_iterator begin() const { return tree_.begin(); } in begin()
110 iterator end() { return tree_.end(); } in end()
111 const_iterator end() const { return tree_.end(); } in end()
112 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
113 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
114 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/abseil-cpp/absl/container/ |
| D | btree_test.cc | 98 base_checker() : const_tree_(tree_) {} in base_checker()
100 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
103 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
105 iterator begin() { return tree_.begin(); } in begin()
106 const_iterator begin() const { return tree_.begin(); } in begin()
107 iterator end() { return tree_.end(); } in end()
108 const_iterator end() const { return tree_.end(); } in end()
109 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
110 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
111 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/cronet/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 112 base_checker() : const_tree_(tree_) {} in base_checker()
114 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
117 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
119 iterator begin() { return tree_.begin(); } in begin()
120 const_iterator begin() const { return tree_.begin(); } in begin()
121 iterator end() { return tree_.end(); } in end()
122 const_iterator end() const { return tree_.end(); } in end()
123 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
124 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
125 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 113 base_checker() : const_tree_(tree_) {} in base_checker()
115 : tree_(other.tree_), const_tree_(tree_), checker_(other.checker_) {} in base_checker()
118 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
120 iterator begin() { return tree_.begin(); } in begin()
121 const_iterator begin() const { return tree_.begin(); } in begin()
122 iterator end() { return tree_.end(); } in end()
123 const_iterator end() const { return tree_.end(); } in end()
124 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
125 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
126 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | tuple_points_to_analysis.h | 55 explicit PointsToSet(const Shape* shape) : tree_(shape) {} in PointsToSet()
115 return tree_.element(index).buffers; in element()
118 return &tree_.mutable_element(index)->buffers; in mutable_element()
124 tree_.ForEachElement([&fn](const ShapeIndex& index, const Elem& elem) { in ForEachElement()
130 tree_.ForEachMutableElement([&fn](const ShapeIndex& index, Elem* elem) { in ForEachMutableElement()
136 return tree_.ForEachElementWithStatus( in ForEachElementWithStatus()
147 ShapeTree<Elem> tree_; variable
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | shape_tree.h | 366 LeafIterator(const ShapeTree& tree, Iterator it) : tree_(tree), it_(it) { in LeafIterator()
367 while ((it_ != tree_.nodes_.end()) && !IsLeaf()) ++it_; in LeafIterator()
373 } while ((it_ != tree_.nodes_.end()) && !IsLeaf());
386 } while ((it_ != tree_.nodes_.begin()) && !IsLeaf());
402 bool IsLeaf() const { return tree_.IsLeaf(it_->first); } in IsLeaf()
404 const ShapeTree<T>& tree_; variable
|