radix 717 ompi/mca/coll/base/coll_base_bcast.c uint32_t segsize, int radix) radix 723 ompi/mca/coll/base/coll_base_bcast.c COLL_BASE_UPDATE_KMTREE(comm, module, root, radix); radix 248 ompi/mca/coll/base/coll_base_functions.h int ompi_coll_base_bcast_intra_knomial(BCAST_ARGS, uint32_t segsize, int radix); radix 475 ompi/mca/coll/base/coll_base_topo.c int root, int radix) radix 478 ompi/mca/coll/base/coll_base_topo.c "coll:base:topo:build_kmtree root %d, radix %d", root, radix)); radix 484 ompi/mca/coll/base/coll_base_topo.c for (int i = 1; i < comm_size; i *= radix) radix 486 ompi/mca/coll/base/coll_base_topo.c int nchilds_max = (radix - 1) * log_radix; radix 504 ompi/mca/coll/base/coll_base_topo.c if (vrank % (radix * mask)) { radix 505 ompi/mca/coll/base/coll_base_topo.c kmtree->tree_prev = vrank / (radix * mask) * (radix * mask); radix 509 ompi/mca/coll/base/coll_base_topo.c mask *= radix; radix 513 ompi/mca/coll/base/coll_base_topo.c mask /= radix; radix 516 ompi/mca/coll/base/coll_base_topo.c for (int r = 1; r < radix; r++) { radix 524 ompi/mca/coll/base/coll_base_topo.c mask /= radix; radix 58 ompi/mca/coll/base/coll_base_topo.h int root, int radix); radix 149 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_roundup_to_power_radix( int radix, int size, int *n_lvls ); radix 150 ompi/patterns/net/netpatterns_knomial_tree.h int radix, int size, radix 166 ompi/patterns/net/netpatterns_knomial_tree.h while(distance / (pow_k * radix)) { radix 167 ompi/patterns/net/netpatterns_knomial_tree.h pow_k *= radix; radix 181 ompi/patterns/net/netpatterns_knomial_tree.h int my_rank, int root, int radix, int size, radix 184 ompi/patterns/net/netpatterns_knomial_tree.h int level = radix; radix 190 ompi/patterns/net/netpatterns_knomial_tree.h level *= radix; radix 194 ompi/patterns/net/netpatterns_knomial_tree.h *k_level = level/radix; radix 223 ompi/patterns/net/netpatterns_knomial_tree.h #define MCA_COMMON_NETPATTERNS_GET_NEXT_KNOMIAL_UPDATE_LEVEL_FOR_BCAST(step_info, radix)\ radix 226 ompi/patterns/net/netpatterns_knomial_tree.h step_info.k_level /= radix; \ radix 240 ompi/patterns/net/netpatterns_knomial_tree.h #define MCA_COMMON_NETPATTERNS_GET_NEXT_KNOMIAL_PEER(my_rank, radix, step_info, peer) \ radix 244 ompi/patterns/net/netpatterns_knomial_tree.h peer = step_info.k_tmp_peer + step_info.k_level/radix; \ radix 251 ompi/patterns/net/netpatterns_knomial_tree.h if (radix == step_info.k_step) { \ radix 252 ompi/patterns/net/netpatterns_knomial_tree.h step_info.k_level /= radix; \ radix 325 ompi/patterns/net/netpatterns_nary_tree.c int ompi_roundup_to_power_radix ( int radix, int size, int *n_lvls ) radix 335 ompi/patterns/net/netpatterns_nary_tree.c result/=radix; radix 337 ompi/patterns/net/netpatterns_nary_tree.c return_value*=radix; radix 27 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/opa/pnet_opa.h int radix; radix 70 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/opa/pnet_opa_component.c .radix = 64 radix 104 opal/mca/pmix/pmix4x/pmix/src/mca/pnet/opa/pnet_opa_component.c &mca_pnet_opa_component.radix); radix 409 orte/mca/routed/radix/routed_radix.c NInLevel *= mca_routed_radix_component.radix; radix 415 orte/mca/routed/radix/routed_radix.c for (i = 0; i < mca_routed_radix_component.radix; i++) { radix 472 orte/mca/routed/radix/routed_radix.c NInLevel *= mca_routed_radix_component.radix; radix 477 orte/mca/routed/radix/routed_radix.c NInPrevLevel = NInLevel/mca_routed_radix_component.radix; radix 23 orte/mca/routed/radix/routed_radix.h int radix; radix 55 orte/mca/routed/radix/routed_radix_component.c mca_routed_radix_component.radix = 64; radix 61 orte/mca/routed/radix/routed_radix_component.c &mca_routed_radix_component.radix); radix 68 orte/mca/routed/radix/routed_radix_component.c if (0 > mca_routed_radix_component.radix) {