/dports/net/openmpi/openmpi-4.1.1/ompi/patterns/net/ |
H A D | netpatterns_nary_tree.c | 50 my_node->my_rank=my_rank; in ompi_netpatterns_setup_narray_tree() 51 my_node->tree_size=num_nodes; in ompi_netpatterns_setup_narray_tree() 75 my_node->n_parents=0; in ompi_netpatterns_setup_narray_tree() 76 my_node->parent_rank=-1; in ompi_netpatterns_setup_narray_tree() 79 my_node->n_parents=1; in ompi_netpatterns_setup_narray_tree() 110 my_node->n_children=0; in ompi_netpatterns_setup_narray_tree() 191 my_node->my_rank=my_rank; in ompi_netpatterns_setup_narray_knomial_tree() 216 my_node->n_parents=0; in ompi_netpatterns_setup_narray_knomial_tree() 220 my_node->n_parents=1; in ompi_netpatterns_setup_narray_knomial_tree() 236 my_node->level_size, my_node->rank_on_level, in ompi_netpatterns_setup_narray_knomial_tree() [all …]
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/patterns/net/ |
H A D | netpatterns_nary_tree.c | 50 my_node->my_rank=my_rank; in ompi_netpatterns_setup_narray_tree() 51 my_node->tree_size=num_nodes; in ompi_netpatterns_setup_narray_tree() 75 my_node->n_parents=0; in ompi_netpatterns_setup_narray_tree() 76 my_node->parent_rank=-1; in ompi_netpatterns_setup_narray_tree() 79 my_node->n_parents=1; in ompi_netpatterns_setup_narray_tree() 110 my_node->n_children=0; in ompi_netpatterns_setup_narray_tree() 191 my_node->my_rank=my_rank; in ompi_netpatterns_setup_narray_knomial_tree() 216 my_node->n_parents=0; in ompi_netpatterns_setup_narray_knomial_tree() 220 my_node->n_parents=1; in ompi_netpatterns_setup_narray_knomial_tree() 236 my_node->level_size, my_node->rank_on_level, in ompi_netpatterns_setup_narray_knomial_tree() [all …]
|
/dports/net/mad_fcl/mad_fcl_v1.7_src/alclib/ |
H A D | alc_list.c | 136 struct alc_list_node *my_node; in prepare_insert() local 162 my_node->next = NULL; in prepare_insert() 163 my_node->data = a_data; in prepare_insert() 165 return my_node; in prepare_insert() 173 if(my_node == NULL) { in push_back() 196 if(my_node == NULL) { in push_front() 235 my_ret = my_node->data; in pop_front() 239 free(my_node); in pop_front() 280 for(my_node = a_list->first_elem; my_node != NULL;) { in destroy_list() 281 my_currentnode = my_node; in destroy_list() [all …]
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/gfortran.dg/ |
H A D | intent_out_11.f90 | 45 integer(int64) :: my_node, num_nodes variable 60 if( my_node == 1 ) then 115 my_node = this_image() 117 if( my_node == 1 ) then 133 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 134 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 231 i = 1 + mod( my_node-1+stage, num_nodes ) 232 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 247 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 282 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/lang/opencoarrays/OpenCoarrays-2.9.0/src/tests/integration/dist_transpose/ |
H A D | coarray_distributed_transpose.F90 | 41 integer(int64) :: my_node, num_nodes variable 56 if( my_node == 1 ) then 111 my_node = this_image() 113 if( my_node == 1 ) then 129 first_y = (my_node-1)*my + 1; last_y = (my_node-1)*my + my 130 first_x = (my_node-1)*mx + 1; last_x = (my_node-1)*mx + mx 227 i = 1 + mod( my_node-1+stage, num_nodes ) 228 …bufr_X_Y(:,:,:,:) = u(:,:,:,1+(my_node-1)*my:my_node*my)[i] !-- inter-node transpose to bu… 243 …ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] = bufr_Y_X(:,:,:,:) !-- inter-node transpose from … 278 …bufr_Y_X(:,:,:,:) = ur(:,:,:,1+(my_node-1)*mx:my_node*mx)[i] !-- inter-node transpose to bu… [all …]
|
/dports/net/ntpsec/ntpsec-NTPsec_1_2_1/ntpd/ |
H A D | ntp_config.c | 529 my_node = emalloc_zero(sizeof(*my_node)); in create_address_node() 562 my_node = emalloc_zero(sizeof(*my_node)); in create_peer_node() 812 my_node = emalloc_zero(sizeof(*my_node)); in create_unpeer_node() 846 my_node = emalloc_zero(sizeof(*my_node)); in create_filegen_node() 865 my_node = emalloc_zero(sizeof(*my_node)); in create_restrict_node() 1049 my_node = emalloc_zero(sizeof(*my_node)); in create_setvar_node() 1069 my_node = emalloc_zero(sizeof(*my_node)); in create_nic_rule_node() 1086 my_node = emalloc_zero(sizeof(*my_node)); in create_addr_opts_node() 1322 for (; my_node != NULL; my_node = my_node->link) { in config_monitor() 1573 for (; my_node != NULL; my_node = my_node->link) { in config_access() [all …]
|
/dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/detail/ |
H A D | _node_handle.h | 57 node_handle_base(node_handle_base&& nh) : my_node(nh.my_node), in node_handle_base() 59 nh.my_node = nullptr; in node_handle_base() 69 my_node = nh.my_node; 77 swap(my_node, nh.my_node); in swap() 86 node_handle_base( node* n ) : my_node(n) {} in node_handle_base() 89 if(my_node != nullptr) { in internal_destroy() 92 node_allocator.deallocate(my_node, 1); in internal_destroy() 96 node* get_node_ptr() { return my_node; } in get_node_ptr() 98 void deactivate() { my_node = nullptr; } in deactivate() 100 node* my_node; variable [all …]
|
/dports/lang/opencoarrays/OpenCoarrays-2.9.0/src/tests/performance/mpi_dist_transpose/ |
H A D | mpi_distributed_transpose.F90 | 116 if( my_node == 0 ) then 136 first_y = my_node*my + 1; last_y = my_node*my + my 137 first_x = my_node*mx + 1; last_x = my_node*mx + mx 240 send_tag = 256*to + my_node 249 recv_tag = 256*my_node + from 265 recv_tag = 256*my_node + from 275 send_tag = 256*to + my_node 330 send_tag = 256*to + my_node 340 recv_tag = 256*my_node + from 356 recv_tag = 256*my_node + from [all …]
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/internal/ |
H A D | _node_handle_impl.h | 56 node_handle_base(node_handle_base&& nh) : my_node(nh.my_node), in node_handle_base() 58 nh.my_node = NULL; in node_handle_base() 61 bool empty() const { return my_node == NULL; } in empty() 68 my_node = nh.my_node; 76 std::swap(my_node, nh.my_node); in swap() 86 node_handle_base(node* n) : my_node(n) {} in node_handle_base() 89 if(my_node) { in internal_destroy() 92 node_allocator.deallocate(my_node, 1); in internal_destroy() 96 void deactivate() { my_node = NULL; } in deactivate() 98 node* my_node; variable [all …]
|
/dports/devel/tbb/oneTBB-2020.3/include/tbb/internal/ |
H A D | _node_handle_impl.h | 56 node_handle_base(node_handle_base&& nh) : my_node(nh.my_node), in node_handle_base() 58 nh.my_node = NULL; in node_handle_base() 61 bool empty() const { return my_node == NULL; } in empty() 68 my_node = nh.my_node; 76 std::swap(my_node, nh.my_node); in swap() 86 node_handle_base(node* n) : my_node(n) {} in node_handle_base() 89 if(my_node) { in internal_destroy() 92 node_allocator.deallocate(my_node, 1); in internal_destroy() 96 void deactivate() { my_node = NULL; } in deactivate() 98 node* my_node; variable [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/internal/ |
H A D | _node_handle_impl.h | 56 node_handle_base(node_handle_base&& nh) : my_node(nh.my_node), in node_handle_base() 58 nh.my_node = NULL; in node_handle_base() 61 bool empty() const { return my_node == NULL; } in empty() 68 my_node = nh.my_node; 76 std::swap(my_node, nh.my_node); in swap() 86 node_handle_base(node* n) : my_node(n) {} in node_handle_base() 89 if(my_node) { in internal_destroy() 92 node_allocator.deallocate(my_node, 1); in internal_destroy() 96 void deactivate() { my_node = NULL; } in deactivate() 98 node* my_node; variable [all …]
|
/dports/devel/boost-docs/boost_1_72_0/libs/intrusive/example/ |
H A D | doc_treap_algorithms.cpp | 16 struct my_node struct 18 my_node(int i = 0, unsigned int priority = 0) in my_node() argument 21 my_node *parent_, *left_, *right_; argument 30 typedef my_node node; argument 31 typedef my_node * node_ptr; 32 typedef const my_node * const_node_ptr; 43 { bool operator()(const my_node *a, const my_node *b) { return a->int_ < b->int_; } }; in operator ()() 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()() 51 my_node header, two(2, 5), three(3, 1); in main() 64 my_node *n = header.left_; in main()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/intrusive/example/ |
H A D | doc_treap_algorithms.cpp | 16 struct my_node struct 18 my_node(int i = 0, unsigned int priority = 0) in my_node() argument 21 my_node *parent_, *left_, *right_; argument 30 typedef my_node node; argument 31 typedef my_node * node_ptr; 32 typedef const my_node * const_node_ptr; 43 { bool operator()(const my_node *a, const my_node *b) { return a->int_ < b->int_; } }; in operator ()() 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()() 51 my_node header, two(2, 5), three(3, 1); in main() 64 my_node *n = header.left_; in main()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_algorithms.cpp | 16 struct my_node struct 18 my_node(int i = 0, unsigned int priority = 0) in my_node() argument 21 my_node *parent_, *left_, *right_; argument 30 typedef my_node node; argument 31 typedef my_node * node_ptr; 32 typedef const my_node * const_node_ptr; 43 { bool operator()(const my_node *a, const my_node *b) { return a->int_ < b->int_; } }; in operator ()() 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()() 51 my_node header, two(2, 5), three(3, 1); in main() 64 my_node *n = header.left_; in main()
|
/dports/databases/percona57-server/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_algorithms.cpp | 16 struct my_node struct 18 my_node(int i = 0, unsigned int priority = 0) in my_node() function 21 my_node *parent_, *left_, *right_; argument 30 typedef my_node node; argument 31 typedef my_node * node_ptr; 32 typedef const my_node * const_node_ptr; 43 { bool operator()(const my_node *a, const my_node *b) { return a->int_ < b->int_; } }; in operator ()() 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()() 51 my_node header, two(2, 5), three(3, 1); in main() 64 my_node *n = header.left_; in main()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_algorithms.cpp | 16 struct my_node struct 18 my_node(int i = 0, unsigned int priority = 0) in my_node() function 21 my_node *parent_, *left_, *right_; argument 30 typedef my_node node; argument 31 typedef my_node * node_ptr; 32 typedef const my_node * const_node_ptr; 43 { bool operator()(const my_node *a, const my_node *b) { return a->int_ < b->int_; } }; in operator ()() 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()() 51 my_node header, two(2, 5), three(3, 1); in main() 64 my_node *n = header.left_; in main()
|