| /dports/math/viennacl/ViennaCL-1.7.1/viennacl/device_specific/ |
| H A D | tree_parsing.hpp | 58 fun.call_before_expansion(statement, root_idx); in traverse()
66 fun(statement, root_idx, LHS_NODE_TYPE); in traverse()
70 fun(statement, root_idx, PARENT_NODE_TYPE); in traverse()
78 fun(statement, root_idx, RHS_NODE_TYPE); in traverse()
81 fun.call_after_expansion(statement, root_idx); in traverse()
95 out_.push_back(root_idx); in operator ()()
266 mapping_type::key_type key = std::make_pair(root_idx, leaf); in operator ()()
305 traversal_functor(statement, root_idx, leaf); in evaluate()
312 traversal_functor(statement, root_idx, leaf); in evaluate()
371 traversal_functor(statement, root_idx, leaf); in process()
[all …]
|
| H A D | mapped_objects.hpp | 90 mapping(_mapping), statement(_statement), root_idx(_root_idx) { } in node_info()
93 vcl_size_t root_idx; member
153 … return tree_parsing::evaluate(leaf, accessors, *info_.statement, info_.root_idx, *info_.mapping); in evaluate_recursive()
179 vcl_size_t root_idx() const { return info_.root_idx; } in root_idx() function in viennacl::device_specific::mapped_reduction
181 scheduler::statement_node root_node() const { return statement().array()[root_idx()]; } in root_node()
186 scheduler::op_element res = info_.statement->array()[info_.root_idx].op; in root_op()
388 …res = tree_parsing::evaluate(LHS_NODE_TYPE, accessors, *info_.statement, info_.root_idx, *info_.ma… in postprocess()
407 …res = tree_parsing::evaluate(LHS_NODE_TYPE, accessors, *info_.statement, info_.root_idx, *info_.ma… in postprocess()
426 …res = tree_parsing::evaluate(LHS_NODE_TYPE, accessors, *info_.statement, info_.root_idx, *info_.ma… in postprocess()
447 …res = tree_parsing::evaluate(LHS_NODE_TYPE, accessors, *info_.statement, info_.root_idx, *info_.ma… in postprocess()
[all …]
|
| /dports/math/viennacl/ViennaCL-1.7.1/viennacl/device_specific/templates/ |
| H A D | template_base.hpp | 74 scheduler::statement_node const * root_node = &statement->array()[root_idx]; in numeric_type()
89 …_to_string(numeric_type(statement,root_idx)), binder_.get(NULL), mapped_object::node_info(mapping,… in binary_leaf()
135 …void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf_t) const { in operator ()() argument
136 mapping_type::key_type key(root_idx, leaf_t); in operator ()()
137 scheduler::statement_node const & root_node = statement.array()[root_idx]; in operator ()()
181 void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf) const in operator ()() argument
183 scheduler::statement_node const & root_node = statement.array()[root_idx]; in operator ()()
187 mapped_object * obj = at(mapping_, std::make_pair(root_idx,leaf)).get(); in operator ()()
273 … void operator()(scheduler::statement const & statement, vcl_size_t root_idx, leaf_t leaf_t) const in operator ()() argument
275 scheduler::statement_node const & root_node = statement.array()[root_idx]; in operator ()()
[all …]
|
| H A D | utils.hpp | 72 vcl_size_t root_idx, leaf_t leaf) in process_all_at() argument
76 mapped_object * obj = at(*mit, mapping_key(root_idx, leaf)).get(); in process_all_at()
|
| /dports/www/firefox/firefox-99.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 188 return vertices_[root_idx ()]; in root()
191 unsigned root_idx () const in root_idx() function
272 queue.push (root_idx ()); in sort_kahn()
328 int new_id = root_idx (); in sort_shortest_distance()
367 unsigned root_index = root_idx (); in assign_32bit_spaces()
437 for (unsigned root_idx : roots) in isolate_subgraph() local
439 subgraph.set (root_idx, wide_parents (root_idx, parents)); in isolate_subgraph()
440 find_subgraph (root_idx, subgraph); in isolate_subgraph()
462 if (original_root_idx != root_idx () in isolate_subgraph()
466 parents.add (root_idx ()); in isolate_subgraph()
[all …]
|
| /dports/print/harfbuzz/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 188 return vertices_[root_idx ()]; in root()
191 unsigned root_idx () const in root_idx() function
272 queue.push (root_idx ()); in sort_kahn()
328 int new_id = root_idx (); in sort_shortest_distance()
367 unsigned root_index = root_idx (); in assign_32bit_spaces()
437 for (unsigned root_idx : roots) in isolate_subgraph() local
439 subgraph.set (root_idx, wide_parents (root_idx, parents)); in isolate_subgraph()
440 find_subgraph (root_idx, subgraph); in isolate_subgraph()
462 if (original_root_idx != root_idx () in isolate_subgraph()
466 parents.add (root_idx ()); in isolate_subgraph()
[all …]
|
| /dports/print/harfbuzz-icu/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 188 return vertices_[root_idx ()]; in root()
191 unsigned root_idx () const in root_idx() function
272 queue.push (root_idx ()); in sort_kahn()
328 int new_id = root_idx (); in sort_shortest_distance()
367 unsigned root_index = root_idx (); in assign_32bit_spaces()
437 for (unsigned root_idx : roots) in isolate_subgraph() local
439 subgraph.set (root_idx, wide_parents (root_idx, parents)); in isolate_subgraph()
440 find_subgraph (root_idx, subgraph); in isolate_subgraph()
462 if (original_root_idx != root_idx () in isolate_subgraph()
466 parents.add (root_idx ()); in isolate_subgraph()
[all …]
|
| /dports/print/harfbuzz-hb-view/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 188 return vertices_[root_idx ()]; in root()
191 unsigned root_idx () const in root_idx() function
272 queue.push (root_idx ()); in sort_kahn()
328 int new_id = root_idx (); in sort_shortest_distance()
367 unsigned root_index = root_idx (); in assign_32bit_spaces()
437 for (unsigned root_idx : roots) in isolate_subgraph() local
439 subgraph.set (root_idx, wide_parents (root_idx, parents)); in isolate_subgraph()
440 find_subgraph (root_idx, subgraph); in isolate_subgraph()
462 if (original_root_idx != root_idx () in isolate_subgraph()
466 parents.add (root_idx ()); in isolate_subgraph()
[all …]
|
| /dports/science/py-dlib/dlib-19.22/dlib/optimization/ |
| H A D | find_max_parse_cky.h | 309 const unsigned long root_idx = 0
312 if (root_idx >= tree.size())
316 impl::print_parse_tree_helper<false,false>(tree, words, root_idx, tree[root_idx].tag, sout);
326 const unsigned long root_idx = 0
329 if (root_idx >= tree.size())
333 impl::print_parse_tree_helper<true,false>(tree, words, root_idx, tree[root_idx].tag, sout);
|
| H A D | find_max_parse_cky_abstract.h | 225 const unsigned long root_idx = 0
261 const unsigned long root_idx = 0
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/optimization/ |
| H A D | find_max_parse_cky.h | 309 const unsigned long root_idx = 0
312 if (root_idx >= tree.size())
316 impl::print_parse_tree_helper<false,false>(tree, words, root_idx, tree[root_idx].tag, sout);
326 const unsigned long root_idx = 0
329 if (root_idx >= tree.size())
333 impl::print_parse_tree_helper<true,false>(tree, words, root_idx, tree[root_idx].tag, sout);
|
| H A D | find_max_parse_cky_abstract.h | 225 const unsigned long root_idx = 0
261 const unsigned long root_idx = 0
|
| /dports/math/cadical/cadical-1.0.3-cb89cbf/src/ |
| H A D | decompose.cpp | 52 for (int root_idx = 1; !unsat && root_idx <= max_var; root_idx++) { in decompose_round() local
53 if (!active (root_idx)) continue; in decompose_round()
55 int root = root_sign * root_idx; in decompose_round()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/wiredtiger/src/evict/ |
| H A D | evict_stat.c | 135 WT_PAGE_INDEX *root_idx; in __wt_curstat_cache_walk() local
145 root_idx = WT_INTL_INDEX_GET_SAFE(btree->root.page); in __wt_curstat_cache_walk()
147 cache_state_root_entries, root_idx->entries); in __wt_curstat_cache_walk()
|
| /dports/devel/distcc/distcc-3.3.5/include_server/ |
| H A D | include_analyzer_memoizing_node_test.py | 95 root_idx = directory_map.Index("/")
112 (root_idx, includepath_map.Index("dir/c.h")),
125 (root_idx, includepath_map.Index("dir/e.h")),
|
| /dports/sysutils/wimlib/wimlib-1.13.0/src/ |
| H A D | compress_common.c | 297 compute_length_counts(u32 A[restrict], unsigned root_idx, in compute_length_counts() argument
327 A[root_idx] &= SYMBOL_MASK; in compute_length_counts()
329 for (int node = root_idx - 1; node >= 0; node--) { in compute_length_counts()
|
| /dports/www/firefox-esr/firefox-91.8.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 173 return vertices_[root_idx ()]; in root()
176 unsigned root_idx () const in root_idx() function
236 queue.push (root_idx ()); in sort_kahn()
293 queue.insert (root ().modified_distance (0), root_idx ()); in sort_shortest_distance()
294 int new_id = root_idx (); in sort_shortest_distance()
478 for (int i = root_idx (); i >= 0; i--) in update_positions()
|
| /dports/www/lagrange/lagrange-1.7.3/lib/harfbuzz/src/ |
| H A D | hb-repacker.hh | 173 return vertices_[root_idx ()]; in root()
176 unsigned root_idx () const in root_idx() function
236 queue.push (root_idx ()); in sort_kahn()
293 queue.insert (root ().modified_distance (0), root_idx ()); in sort_shortest_distance()
294 int new_id = root_idx (); in sort_shortest_distance()
478 for (int i = root_idx (); i >= 0; i--) in update_positions()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 173 return vertices_[root_idx ()]; in root()
176 unsigned root_idx () const in root_idx() function
236 queue.push (root_idx ()); in sort_kahn()
293 queue.insert (root ().modified_distance (0), root_idx ()); in sort_shortest_distance()
294 int new_id = root_idx (); in sort_shortest_distance()
478 for (int i = root_idx (); i >= 0; i--) in update_positions()
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/lib/ |
| H A D | trees_impl.hpp | 45 index root_idx) { in tree_traversal() argument
49 stack.push(std::make_pair(root_idx, visited::none)); in tree_traversal()
|
| /dports/sysutils/ansible2/ansible-2.9.27/lib/ansible/parsing/ |
| H A D | metadata.py | 191 for root_idx, child in reversed(list(enumerate(module_ast.body))):
201 next_node = module_ast.body[root_idx + 1]
|
| /dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/python/tvm/ir/ |
| H A D | json_compact.py | 104 root_idx = jdata["root"]
105 val = jdata["nodes"][root_idx]
|
| /dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/chalk-solve-0.75.0/src/ |
| H A D | coherence.rs | 100 for root_idx in forest.externals(Direction::Incoming) { in specialization_priorities()
101 self.set_priorities(root_idx, &forest, 0, &mut result); in specialization_priorities()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/chalk-solve-0.55.0/src/ |
| H A D | coherence.rs | 100 for root_idx in forest.externals(Direction::Incoming) { in specialization_priorities()
101 self.set_priorities(root_idx, &forest, 0, &mut result); in specialization_priorities()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/chalk-solve/src/ |
| H A D | coherence.rs | 100 for root_idx in forest.externals(Direction::Incoming) { in specialization_priorities()
101 self.set_priorities(root_idx, &forest, 0, &mut result); in specialization_priorities()
|