/dports/lang/oo2c/oo2c_64-2.1.11/lib/src/ |
H A D | Termination.c | 39 static int proc_count = 0; variable 46 if (proc_count == 0) { in Termination__RegisterProc() 52 } else if (proc_count == max_proc_count) { in Termination__RegisterProc() 57 for (i=0; i<proc_count; i++) { in Termination__RegisterProc() 60 for (i=proc_count; i<max_proc_count; i++) { in Termination__RegisterProc() 66 proc_list[proc_count] = proc; in Termination__RegisterProc() 67 proc_count++; in Termination__RegisterProc() 73 i = proc_count; in Termination__UnregisterProc() 78 while (j != proc_count) { in Termination__UnregisterProc() 82 proc_count--; in Termination__UnregisterProc() [all …]
|
/dports/net/mpich/mpich-3.4.3/modules/ucx/src/ucg/builtin/plan/ |
H A D | builtin_pairwise.c | 22 ucg_group_member_index_t proc_idx, proc_count = group_params->member_count; in ucg_builtin_pairwise_create() local 27 ((proc_count - 1) * sizeof(uct_ep_h)); in ucg_builtin_pairwise_create() 31 pairwise->ep_cnt = proc_count - 1; in ucg_builtin_pairwise_create() 34 ucs_assert((ucg_group_member_index_t)((typeof(pairwise->ep_cnt))-1) > proc_count); in ucg_builtin_pairwise_create() 39 phase->ep_cnt = proc_count - 1; in ucg_builtin_pairwise_create() 49 for(proc_idx = 1; proc_idx < proc_count; proc_idx++) { in ucg_builtin_pairwise_create() 51 ucg_group_member_index_t next_peer = (my_index + proc_idx) % proc_count; in ucg_builtin_pairwise_create()
|
H A D | builtin_neighbor.c | 48 unsigned proc_count = group_params->member_count; in ucg_topo_neighbor_create() local 49 while (dim_size * dim_size < proc_count) { in ucg_topo_neighbor_create() 54 if (dim_size * dim_size != proc_count) { in ucg_topo_neighbor_create() 55 …ror("Neighbor topology must have proc# a power of the dimension (dim %u procs %u)", 2, proc_count); in ucg_topo_neighbor_create()
|
H A D | builtin_bruck.c | 28 unsigned proc_count = group_params->member_count; in ucg_builtin_bruck_create() local 32 while (step_size < proc_count) { in ucg_builtin_bruck_create() 53 ucg_group_member_index_t peer_index = (my_index + step_size) % proc_count; in ucg_builtin_bruck_create()
|
/dports/editors/neovim/neovim-0.6.1/src/nvim/os/ |
H A D | process.c | 107 int os_proc_children(int ppid, int **proc_list, size_t *proc_count) in os_proc_children() argument 115 *proc_count = 0; in os_proc_children() 135 temp = xrealloc(temp, (*proc_count + 1) * sizeof(*temp)); in os_proc_children() 136 temp[*proc_count] = (int)pe.th32ProcessID; in os_proc_children() 137 (*proc_count)++; in os_proc_children() 189 temp = xrealloc(temp, (*proc_count + 1) * sizeof(*temp)); in os_proc_children() 190 temp[*proc_count] = KP_PID(p_list[i]); in os_proc_children() 191 (*proc_count)++; in os_proc_children() 210 temp = xrealloc(temp, (*proc_count + 1) * sizeof(*temp)); in os_proc_children() 211 temp[*proc_count] = match_pid; in os_proc_children() [all …]
|
/dports/net/openmpi/openmpi-4.1.1/oshmem/mca/scoll/basic/ |
H A D | scoll_basic_barrier.c | 125 wait_pe_count = group->proc_count; in _algorithm_central_counter() 126 for (i = 0; i < group->proc_count; i++) { in _algorithm_central_counter() 209 int exit_flag = group->proc_count - 1; in _algorithm_tournament() 231 if (peer_id >= group->proc_count) in _algorithm_tournament() 319 i = group->proc_count; in _algorithm_recursive_doubling() 357 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_recursive_doubling() 420 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_recursive_doubling() 454 log2_proc = scoll_log2((unsigned long) group->proc_count); in _algorithm_dissemination() 464 peer_id = (my_id + (1 << round)) % group->proc_count; in _algorithm_dissemination() 563 for (i = 0; i < group->proc_count; i++) { in _algorithm_adaptive() [all …]
|
H A D | scoll_basic_collect.c | 200 group->proc_count * nlong, in _algorithm_f_central_counter() 219 int exit_flag = group->proc_count - 1; in _algorithm_f_tournament() 248 if (peer_id >= group->proc_count) in _algorithm_f_tournament() 295 (peer_id < group->proc_count) && (rc == OSHMEM_SUCCESS); in _algorithm_f_tournament() 311 group->proc_count * nlong, in _algorithm_f_tournament() 341 peer_id = (my_id + 1) % group->proc_count; in _algorithm_f_ring() 399 i = group->proc_count; in _algorithm_f_recursive_doubling() 450 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_f_recursive_doubling() 507 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_f_recursive_doubling() 560 wait_pe_count = group->proc_count; in _algorithm_central_collector() [all …]
|
H A D | scoll_basic_broadcast.c | 146 for (i = 0; (i < group->proc_count) && (rc == OSHMEM_SUCCESS); i++) { in _algorithm_central_counter() 191 int dim = opal_cube_dim(group->proc_count); in _algorithm_binomial_tree() 201 vrank = (my_id + group->proc_count - root_id) % group->proc_count; in _algorithm_binomial_tree() 233 if (peer_id < group->proc_count) { in _algorithm_binomial_tree() 235 peer_id = (peer_id + root_id) % group->proc_count; in _algorithm_binomial_tree()
|
/dports/net/openmpi3/openmpi-3.1.6/oshmem/mca/scoll/basic/ |
H A D | scoll_basic_barrier.c | 125 wait_pe_count = group->proc_count; in _algorithm_central_counter() 126 for (i = 0; i < group->proc_count; i++) { in _algorithm_central_counter() 210 int exit_flag = group->proc_count - 1; in _algorithm_tournament() 232 if (peer_id >= group->proc_count) in _algorithm_tournament() 320 i = group->proc_count; in _algorithm_recursive_doubling() 358 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_recursive_doubling() 421 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_recursive_doubling() 455 log2_proc = scoll_log2((unsigned long) group->proc_count); in _algorithm_dissemination() 465 peer_id = (my_id + (1 << round)) % group->proc_count; in _algorithm_dissemination() 564 for (i = 0; i < group->proc_count; i++) { in _algorithm_adaptive() [all …]
|
H A D | scoll_basic_collect.c | 194 group->proc_count * nlong, in _algorithm_f_central_counter() 212 int exit_flag = group->proc_count - 1; in _algorithm_f_tournament() 241 if (peer_id >= group->proc_count) in _algorithm_f_tournament() 288 (peer_id < group->proc_count) && (rc == OSHMEM_SUCCESS); in _algorithm_f_tournament() 304 group->proc_count * nlong, in _algorithm_f_tournament() 333 peer_id = (my_id + 1) % group->proc_count; in _algorithm_f_ring() 391 i = group->proc_count; in _algorithm_f_recursive_doubling() 442 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_f_recursive_doubling() 499 if ((group->proc_count - floor2_proc) > my_id) { in _algorithm_f_recursive_doubling() 552 wait_pe_count = group->proc_count; in _algorithm_central_collector() [all …]
|
H A D | scoll_basic_broadcast.c | 140 for (i = 0; (i < group->proc_count) && (rc == OSHMEM_SUCCESS); i++) { in _algorithm_central_counter() 185 int dim = opal_cube_dim(group->proc_count); in _algorithm_binomial_tree() 195 vrank = (my_id + group->proc_count - root_id) % group->proc_count; in _algorithm_binomial_tree() 227 if (peer_id < group->proc_count) { in _algorithm_binomial_tree() 229 peer_id = (peer_id + root_id) % group->proc_count; in _algorithm_binomial_tree()
|
/dports/net/openmpi/openmpi-4.1.1/oshmem/mca/scoll/fca/ |
H A D | scoll_fca_module.c | 63 for (i = 0; (i < group->proc_count) && (rc == OSHMEM_SUCCESS); i++) in _internal_barrier() 138 for (rank = 0; rank < comm->proc_count; ++rank) { in _get_local_ranks() 157 for (rank = 0; rank < comm->proc_count; ++rank) { in _get_local_ranks() 197 for (i = 0; i < comm->proc_count; i++) { in _fca_comm_new() 205 for (i = 0; i < comm->proc_count; i++) { in _fca_comm_new() 213 disps = calloc(comm->proc_count, sizeof *disps); in _fca_comm_new() 214 for (i = 0; i < comm->proc_count; ++i) { in _fca_comm_new() 234 for (i = 0; i < comm->proc_count; i++) { in _fca_comm_new() 246 for (i = 0; i < comm->proc_count; ++i) { in _fca_comm_new() 325 comm_size = fca_module->comm->proc_count; in _create_fca_comm() [all …]
|
/dports/net/openmpi3/openmpi-3.1.6/oshmem/mca/scoll/fca/ |
H A D | scoll_fca_module.c | 63 for (i = 0; (i < group->proc_count) && (rc == OSHMEM_SUCCESS); i++) in _internal_barrier() 138 for (rank = 0; rank < comm->proc_count; ++rank) { in _get_local_ranks() 157 for (rank = 0; rank < comm->proc_count; ++rank) { in _get_local_ranks() 197 for (i = 0; i < comm->proc_count; i++) { in _fca_comm_new() 205 for (i = 0; i < comm->proc_count; i++) { in _fca_comm_new() 213 disps = calloc(comm->proc_count, sizeof *disps); in _fca_comm_new() 214 for (i = 0; i < comm->proc_count; ++i) { in _fca_comm_new() 234 for (i = 0; i < comm->proc_count; i++) { in _fca_comm_new() 246 for (i = 0; i < comm->proc_count; ++i) { in _fca_comm_new() 325 comm_size = fca_module->comm->proc_count; in _create_fca_comm() [all …]
|
/dports/sysutils/bsdinfo/bsdinfo-7ed6607958035244870877191c2764c9ba77f19d/ |
H A D | bsdinfo.c | 52 int i, proc_count = 0; in main() local 70 for (i = 0, kp = plist; i < nproc; i++, kp++) proc_count++; in main() 78 … ::/sy+:.\033[0;0m "); printf("\033[1;31mProcesses:\033[0;0m %d\n", proc_count); in main() 81 … :`\033[0;0m "); printf("\033[1;31mShell:\033[0;0m ", proc_count); printshell(); … in main()
|
H A D | bsdinfo-xterm-256.c | 51 int i, proc_count = 0; in main() local 69 for (i = 0, kp = plist; i < nproc; i++, kp++) proc_count++; in main() 79 …m0\033[0;0;0m\033[38;5;16m1\033[0;0;0m"); printf("\033[1;31mProcesses:\033[0;0m %d\n", proc_count); in main() 80 …;0m\033[38;5;102m1\033[0;0;0m "); printf("\033[1;31mShell:\033[0;0m ", proc_count); printshell(); … in main()
|
/dports/security/sqlmap/sqlmap-1.3.12/sqlmap/lib/core/ |
H A D | wordlist.py | 27 def __init__(self, filenames, proc_id=None, proc_count=None, custom=None): argument 36 self.proc_count = proc_count 87 if not self.proc_count or self.counter % self.proc_count == self.proc_id:
|
/dports/science/hypre/hypre-2.23.0/src/struct_mv/ |
H A D | assumed_part.c | 1021 proc_count = 0; in hypre_StructAssumedPartitionCreate() 1064 proc_count += proc_array[i]; in hypre_StructAssumedPartitionCreate() 1092 proc_count++; in hypre_StructAssumedPartitionCreate() 1111 proc_count--; in hypre_StructAssumedPartitionCreate() 1134 proc_count = proc_array[i]; in hypre_StructAssumedPartitionCreate() 1256 proc_count = 0; in hypre_StructAssumedPartitionCreate() 1267 if ((count + proc_count) > size) in hypre_StructAssumedPartitionCreate() 1275 for (j = 0; j < proc_count; j++) in hypre_StructAssumedPartitionCreate() 1303 proc_count = 0; in hypre_StructAssumedPartitionCreate() 1317 proc_count++; in hypre_StructAssumedPartitionCreate() [all …]
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/ioss/vtkioss/ |
H A D | Ioss_FaceGenerator.C | 126 size_t proc_count = region.get_database()->util().parallel_size(); in resolve_parallel_faces() local 128 if (proc_count > 1) { in resolve_parallel_faces() 172 std::vector<INT> potential_count(proc_count); in resolve_parallel_faces() 173 std::vector<int> shared_nodes(proc_count); in resolve_parallel_faces() 192 for (size_t i = 0; i < proc_count; i++) { in resolve_parallel_faces() 204 size_t potential = potential_offset[proc_count - 1] + potential_count[proc_count - 1]; in resolve_parallel_faces() 225 for (size_t i = 0; i < proc_count; i++) { in resolve_parallel_faces() 249 std::vector<INT> check_count(proc_count); in resolve_parallel_faces() 262 for (size_t i = 0; i < proc_count; i++) { in resolve_parallel_faces() 413 if (proc_count > 1) { in generate_block_faces() [all …]
|
/dports/devel/kf5-kcoreaddons/kcoreaddons-5.89.0/src/lib/util/ |
H A D | kprocesslist_unix_procstat_p.h | 45 unsigned int proc_count; member 52 procs = procstat_getprocs(parent.pstat, KERN_PROC_PROC, 0, &proc_count); in ProcStatProcesses() 64 return procs && proc_count > 0; 69 return proc_count; in count()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/group/ |
H A D | group_sporadic.c | 121 int my_group_rank,l,i,j,proc_count; in ompi_group_incl_spor() local 134 proc_count = 0; in ompi_group_incl_spor() 177 proc_count = proc_count + new_group_pointer -> in ompi_group_incl_spor() 180 new_group_pointer->grp_proc_count = proc_count; in ompi_group_incl_spor()
|
/dports/net/openmpi/openmpi-4.1.1/oshmem/mca/scoll/mpi/ |
H A D | scoll_mpi_module.c | 122 if ((osh_group->proc_count < 2) || (osh_group->proc_count < cm->mpi_np)) { in mca_scoll_mpi_comm_query() 138 ranks = (int*) malloc(osh_group->proc_count * sizeof(int)); in mca_scoll_mpi_comm_query() 147 for (i = 0; i < osh_group->proc_count; i++) { in mca_scoll_mpi_comm_query() 153 err = ompi_group_incl(world_group, osh_group->proc_count, ranks, &new_group); in mca_scoll_mpi_comm_query()
|
/dports/net/openmpi3/openmpi-3.1.6/oshmem/mca/scoll/mpi/ |
H A D | scoll_mpi_module.c | 121 if ((osh_group->proc_count < 2) || (osh_group->proc_count < cm->mpi_np)) { in mca_scoll_mpi_comm_query() 132 ranks = (int*) malloc(osh_group->proc_count * sizeof(int)); in mca_scoll_mpi_comm_query() 138 for (i = 0; i < osh_group->proc_count; i++) { in mca_scoll_mpi_comm_query() 149 err = ompi_group_incl(parent_group, osh_group->proc_count, ranks, &new_group); in mca_scoll_mpi_comm_query()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/group/ |
H A D | group_sporadic.c | 121 int my_group_rank,l,i,j,proc_count; in ompi_group_incl_spor() local 134 proc_count = 0; in ompi_group_incl_spor() 177 proc_count = proc_count + new_group_pointer -> in ompi_group_incl_spor() 180 new_group_pointer->grp_proc_count = proc_count; in ompi_group_incl_spor()
|
/dports/net/openmpi3/openmpi-3.1.6/oshmem/proc/ |
H A D | proc.h | 63 int proc_count; /**< number of processes in group */ member 232 for (i = 0; i < group->proc_count; i++) { in oshmem_proc_group_find() 256 for (i = 0; i < group->proc_count; i++) { in oshmem_proc_group_find_id() 275 oshmem_group_all->proc_count : (int)opal_list_get_size(&ompi_proc_list)); in oshmem_num_procs()
|
/dports/net/openmpi/openmpi-4.1.1/oshmem/proc/ |
H A D | proc.h | 65 int proc_count; /**< number of processes in group */ member 254 for (i = 0; i < group->proc_count; i++) { in oshmem_proc_group_find() 278 for (i = 0; i < group->proc_count; i++) { in oshmem_proc_group_find_id() 297 oshmem_group_all->proc_count : (int)opal_list_get_size(&ompi_proc_list)); in oshmem_num_procs()
|