Home
last modified time | relevance | path

Searched refs:tree_order (Results 1 – 25 of 66) sorted by relevance

123

/dports/net/openmpi/openmpi-4.1.1/ompi/patterns/net/
H A Dnetpatterns_knomial_tree.c60 assert(tree_order > 1); in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
66 exchange_node->tree_order = tree_order; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
75 cnt *= tree_order; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
87 cnt /= tree_order; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
554 exchange_node->tree_order = tree_order; in ompi_netpatterns_setup_recursive_knomial_tree_node()
561 cnt *= tree_order; in ompi_netpatterns_setup_recursive_knomial_tree_node()
713 tree_order /= 2; in ompi_netpatterns_setup_recursive_doubling_n_tree_node()
716 exchange_node->tree_order = tree_order; in ompi_netpatterns_setup_recursive_doubling_n_tree_node()
718 assert(0 == (tree_order & (tree_order - 1))); in ompi_netpatterns_setup_recursive_doubling_n_tree_node()
880 cnt*=tree_order;
[all …]
H A Dnetpatterns_nary_tree.c46 if( 1 >= tree_order ) { in ompi_netpatterns_setup_narray_tree()
57 result/=tree_order; in ompi_netpatterns_setup_narray_tree()
69 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
86 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
90 my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; in ompi_netpatterns_setup_narray_tree()
101 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
116 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
187 if( 1 >= tree_order ) { in ompi_netpatterns_setup_narray_knomial_tree()
210 cnt*=tree_order; in ompi_netpatterns_setup_narray_knomial_tree()
243 my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; in ompi_netpatterns_setup_narray_knomial_tree()
[all …]
H A Dnetpatterns_multinomial_tree.c30 OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes, in ompi_netpatterns_setup_multinomial_tree() argument
41 if( 1 >= tree_order ) { in ompi_netpatterns_setup_multinomial_tree()
55 cnt*=tree_order; in ompi_netpatterns_setup_multinomial_tree()
88 n_nodes_prev_level=n_nodes_in_this_level/tree_order; in ompi_netpatterns_setup_multinomial_tree()
98 (n_cum_nodes-n_nodes_prev_level)+node/tree_order; in ompi_netpatterns_setup_multinomial_tree()
121 if( n_full_stripes < tree_order ) { in ompi_netpatterns_setup_multinomial_tree()
144 n_children=tree_order; in ompi_netpatterns_setup_multinomial_tree()
145 tree_nodes[node_index].n_children=tree_order; in ompi_netpatterns_setup_multinomial_tree()
153 rank+tree_order*node; in ompi_netpatterns_setup_multinomial_tree()
164 n_nodes_in_this_level*=tree_order; in ompi_netpatterns_setup_multinomial_tree()
H A Dnetpatterns_knomial_tree.h37 int tree_order; member
80 int tree_order; member
114 …ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order,
124 int num_nodes, int node_rank, int tree_order,
131 int num_nodes, int node_rank, int tree_order, int *hier_ranks,
H A Dnetpatterns.h128 OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree(int tree_order, int my_rank, int num_nodes,
131 OMPI_DECLSPEC int ompi_netpatterns_setup_narray_knomial_tree( int tree_order, int my_rank, int num_…
139 OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes,
142 OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree_contigous_ranks(int tree_order,
/dports/net/openmpi3/openmpi-3.1.6/ompi/patterns/net/
H A Dnetpatterns_knomial_tree.c60 assert(tree_order > 1); in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
66 exchange_node->tree_order = tree_order; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
75 cnt *= tree_order; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
87 cnt /= tree_order; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
554 exchange_node->tree_order = tree_order; in ompi_netpatterns_setup_recursive_knomial_tree_node()
561 cnt *= tree_order; in ompi_netpatterns_setup_recursive_knomial_tree_node()
713 tree_order /= 2; in ompi_netpatterns_setup_recursive_doubling_n_tree_node()
716 exchange_node->tree_order = tree_order; in ompi_netpatterns_setup_recursive_doubling_n_tree_node()
718 assert(0 == (tree_order & (tree_order - 1))); in ompi_netpatterns_setup_recursive_doubling_n_tree_node()
880 cnt*=tree_order;
[all …]
H A Dnetpatterns_nary_tree.c46 if( 1 >= tree_order ) { in ompi_netpatterns_setup_narray_tree()
57 result/=tree_order; in ompi_netpatterns_setup_narray_tree()
69 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
86 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
90 my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; in ompi_netpatterns_setup_narray_tree()
101 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
116 cnt*=tree_order; in ompi_netpatterns_setup_narray_tree()
187 if( 1 >= tree_order ) { in ompi_netpatterns_setup_narray_knomial_tree()
210 cnt*=tree_order; in ompi_netpatterns_setup_narray_knomial_tree()
243 my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; in ompi_netpatterns_setup_narray_knomial_tree()
[all …]
H A Dnetpatterns_multinomial_tree.c30 OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes, in ompi_netpatterns_setup_multinomial_tree() argument
41 if( 1 >= tree_order ) { in ompi_netpatterns_setup_multinomial_tree()
55 cnt*=tree_order; in ompi_netpatterns_setup_multinomial_tree()
88 n_nodes_prev_level=n_nodes_in_this_level/tree_order; in ompi_netpatterns_setup_multinomial_tree()
98 (n_cum_nodes-n_nodes_prev_level)+node/tree_order; in ompi_netpatterns_setup_multinomial_tree()
121 if( n_full_stripes < tree_order ) { in ompi_netpatterns_setup_multinomial_tree()
144 n_children=tree_order; in ompi_netpatterns_setup_multinomial_tree()
145 tree_nodes[node_index].n_children=tree_order; in ompi_netpatterns_setup_multinomial_tree()
153 rank+tree_order*node; in ompi_netpatterns_setup_multinomial_tree()
164 n_nodes_in_this_level*=tree_order; in ompi_netpatterns_setup_multinomial_tree()
H A Dnetpatterns_knomial_tree.h37 int tree_order; member
80 int tree_order; member
114 …ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order,
124 int num_nodes, int node_rank, int tree_order,
131 int num_nodes, int node_rank, int tree_order, int *hier_ranks,
H A Dnetpatterns.h128 OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree(int tree_order, int my_rank, int num_nodes,
131 OMPI_DECLSPEC int ompi_netpatterns_setup_narray_knomial_tree( int tree_order, int my_rank, int num_…
139 OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes,
142 OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree_contigous_ranks(int tree_order,
/dports/games/liblcf/liblcf-0.7.0/src/
H A Dlmt_treemap.cpp31 ref.tree_order.push_back(stream.ReadInt()); in ReadLcf()
38 int count = ref.tree_order.size(); in WriteLcf()
41 stream.WriteInt(ref.tree_order[i]); in WriteLcf()
59 stream.Write<std::vector<int32_t>>(ref.tree_order); in WriteXml()
75 bool tree_order; member in lcf::TreeMapXmlHandler
78 ref(ref), active_node(false), tree_order(false) {} in TreeMapXmlHandler()
82 tree_order = false; in StartElement()
86 tree_order = true; in StartElement()
97 tree_order = false; in EndElement()
102 if (tree_order) in CharacterData()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/css/resolver/
H A Dcascade_priority.h29 inline uint64_t EncodeTreeOrder(uint16_t tree_order, bool important) { in EncodeTreeOrder() argument
31 return static_cast<uint64_t>(tree_order) ^ important_xor; in EncodeTreeOrder()
59 CascadePriority(CascadeOrigin origin, bool important, uint16_t tree_order) in CascadePriority() argument
60 : CascadePriority(origin, important, tree_order, 0) {} in CascadePriority()
65 uint16_t tree_order, in CascadePriority() argument
68 EncodeTreeOrder(tree_order, important) << kTreeOrderOffset | in CascadePriority()
H A Dcascade_priority_test.cc12 CascadePriority AuthorPriority(uint16_t tree_order, uint32_t position) { in AuthorPriority() argument
13 return CascadePriority(CascadeOrigin::kAuthor, false, tree_order, position); in AuthorPriority()
16 CascadePriority ImportantAuthorPriority(uint16_t tree_order, in ImportantAuthorPriority() argument
18 return CascadePriority(CascadeOrigin::kAuthor, true, tree_order, position); in ImportantAuthorPriority()
H A Dmatched_properties_cache.cc92 if (properties[i].types_.tree_order != in operator ==()
93 matched_properties_types[i].tree_order) in operator ==()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/css/resolver/
H A Dcascade_priority.h29 inline uint64_t EncodeTreeOrder(uint16_t tree_order, bool important) { in EncodeTreeOrder() argument
31 return static_cast<uint64_t>(tree_order) ^ important_xor; in EncodeTreeOrder()
59 CascadePriority(CascadeOrigin origin, bool important, uint16_t tree_order) in CascadePriority() argument
60 : CascadePriority(origin, important, tree_order, 0) {} in CascadePriority()
65 uint16_t tree_order, in CascadePriority() argument
68 EncodeTreeOrder(tree_order, important) << kTreeOrderOffset | in CascadePriority()
H A Dmatch_result.h62 uint16_t tree_order; member
158 const TreeScope& ScopeFromTreeOrder(uint16_t tree_order) const { in WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS()
159 SECURITY_DCHECK(tree_order < tree_scopes_.size()); in WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS()
160 return *tree_scopes_[tree_order]; in WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS()
H A Dcascade_priority_test.cc12 CascadePriority AuthorPriority(uint16_t tree_order, uint32_t position) { in AuthorPriority() argument
13 return CascadePriority(CascadeOrigin::kAuthor, false, tree_order, position); in AuthorPriority()
16 CascadePriority ImportantAuthorPriority(uint16_t tree_order, in ImportantAuthorPriority() argument
18 return CascadePriority(CascadeOrigin::kAuthor, true, tree_order, position); in ImportantAuthorPriority()
H A Dcascade_expansion.cc130 matched_properties_.types_.tree_order, in AdvanceNormal()
192 return matched_properties_.types_.tree_order; in TreeOrder()
/dports/games/liblcf/liblcf-0.7.0/src/generated/lcf/rpg/
H A Dtreemap.h44 std::vector<int32_t> tree_order; variable
55 && l.tree_order == r.tree_order
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/src/generic/
H A Dbemparm.c89 thee->tree_order = 1; in BEMparm_ctor2()
148 if (thee->tree_order < 1) { in BEMparm_check()
189 thee->tree_order = parm->tree_order; in BEMparm_copy()
223 } else thee->tree_order = ti; in BEMparm_parseTREE_ORDER()
/dports/www/py-django-cms/django-cms-3.7.1/cms/admin/
H A Dplaceholderadmin.py350 tree_order = placeholder.get_plugin_tree_order(plugin.parent_id)
357 tree_order=tree_order,
687 tree_order=order,
697 tree_order=order,
715 tree_order=order,
733 target_placeholder, tree_order, target_parent=None): argument
799 target_placeholder, tree_order): argument
863 target_placeholder, tree_order, target_parent=None): argument
931 new_target_order = [int(pk) for pk in tree_order]
1061 tree_order=plugin_tree_order,
[all …]
/dports/games/liblcf/liblcf-0.7.0/src/generated/
H A Drpg_treemap.cpp26 for (size_t i = 0; i < obj.tree_order.size(); ++i) { in operator <<()
27 os << (i == 0 ? "[" : ", ") << obj.tree_order[i]; in operator <<()
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/doc/apbs/input/elec/
H A Dtree_order.rst3 tree_order chapter
11 tree_order {order}
/dports/biology/clustal-omega/clustal-omega-1.2.4/src/clustal/
H A Dtree.c197 if (NULL != mseq->tree_order){ in TraverseTree()
198 mseq->tree_order[iLeafCount] = leafid; in TraverseTree()
H A Dseq.c614 prMSeq->tree_order = NULL; in ReadSequences()
724 (*prMSeq)->tree_order = NULL; in NewMSeq()
844 if ((*mseq)->tree_order){ in FreeMSeq()
845 CKFREE((*mseq)->tree_order); in FreeMSeq()
930 iI = (NULL == mseq->tree_order) ? i : mseq->tree_order[i]; in WriteAlignment()

123