| /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/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/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/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/webrtc/third_party/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/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/angle/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/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/rust/crates/grpcio-sys/grpc/third_party/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/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 91 base_checker() : const_tree_(tree_) {} in base_checker()
93 : tree_(x.tree_), const_tree_(tree_), checker_(x.checker_) {} in base_checker()
96 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
98 iterator begin() { return tree_.begin(); } in begin()
99 const_iterator begin() const { return tree_.begin(); } in begin()
100 iterator end() { return tree_.end(); } in end()
101 const_iterator end() const { return tree_.end(); } in end()
102 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
103 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
104 reverse_iterator rend() { return tree_.rend(); } in rend()
[all …]
|
| /external/abseil-cpp/absl/container/ |
| D | btree_test.cc | 91 base_checker() : const_tree_(tree_) {} in base_checker()
93 : tree_(x.tree_), const_tree_(tree_), checker_(x.checker_) {} in base_checker()
96 : tree_(b, e), const_tree_(tree_), checker_(b, e) {} in base_checker()
98 iterator begin() { return tree_.begin(); } in begin()
99 const_iterator begin() const { return tree_.begin(); } in begin()
100 iterator end() { return tree_.end(); } in end()
101 const_iterator end() const { return tree_.end(); } in end()
102 reverse_iterator rbegin() { return tree_.rbegin(); } in rbegin()
103 const_reverse_iterator rbegin() const { return tree_.rbegin(); } in rbegin()
104 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 | 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/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/angle/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/tensorflow/compiler/xla/service/ |
| D | tuple_points_to_analysis.h | 57 explicit PointsToSet(const Shape* shape) : tree_(shape) {} in PointsToSet()
117 return tree_.element(index).buffers; in element()
120 return &tree_.mutable_element(index)->buffers; in mutable_element()
126 tree_.ForEachElement([&fn](const ShapeIndex& index, const Elem& elem) { in ForEachElement()
132 tree_.ForEachMutableElement([&fn](const ShapeIndex& index, Elem* elem) { in ForEachMutableElement()
138 return tree_.ForEachElementWithStatus( in ForEachElementWithStatus()
149 ShapeTree<Elem> tree_; variable
|
| D | tuple_points_to_analysis.cc | 116 return tree_.element(index).tuple_sources; in tuple_sources()
121 tree_.mutable_element(index)->tuple_sources.insert(tuple); in add_tuple_source()
|
| /external/antlr/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| D | LeftRecursiveRuleWalker.g | 252 | tree_
269 tree_
|
| D | ANTLRTreePrinter.g | 386 | tree_
426 tree_
|
| D | AssignTokenTypesWalker.g | 369 | tree_
387 tree_
|
| D | TreeToNFAConverter.g | 366 | tree_ {$g = $tree_.g;}
461 tree_ returns [StateCluster g=null]
|
| /external/jemalloc_new/test/unit/ |
| D | rb.c | 45 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
|