Searched refs:MAX_CHILDS (Results 1 – 15 of 15) sorted by relevance
41 #define MAX_CHILDS 4 macro42 struct process procs[MAX_CHILDS] = {52 for (i = 0; i < MAX_CHILDS; i++) { in add_process()66 for (i = 0; i < MAX_CHILDS; i++) in find_process()75 for (i = 0; i < MAX_CHILDS; i++) in clear_proc_list()83 for (i = 0; i < MAX_CHILDS; i++) { in kill_all_processes()
40 #define MAX_CHILDS 4 macro41 struct process procs[MAX_CHILDS] = {51 for (i = 0; i < MAX_CHILDS; i++) { in add_process()65 for (i = 0; i < MAX_CHILDS; i++) in find_process()74 for (i = 0; i < MAX_CHILDS; i++) in clear_proc_list()82 for (i = 0; i < MAX_CHILDS; i++) { in kill_all_processes()
20 constexpr int MAX_CHILDS = 9; variable239 long *child2 = (long *) Malloc(MAX_CHILDS * ncells2 * sizeof(long)); in compute_child_from_parent()243 for (long k = 0; k < MAX_CHILDS; ++k) child2[i * MAX_CHILDS + k] = -1; in compute_child_from_parent()246 for (long k = 0; k < MAX_CHILDS; ++k) in compute_child_from_parent()250 child2[i * MAX_CHILDS + k] = idx1[j + k]; in compute_child_from_parent()314 long *child2 = (long *) Malloc(MAX_CHILDS * ncells2 * sizeof(long)); in compute_child_from_bounds()318 for (int k = 0; k < MAX_CHILDS; ++k) child2[cell_no2 * MAX_CHILDS + k] = -1; in compute_child_from_bounds()363 … if (k >= MAX_CHILDS) cdo_abort("Internal problem, limit of MAX_CHILDS reached (limit=9)."); in compute_child_from_bounds()364 child2[cell_no2 * MAX_CHILDS + k++] = (long) cell_no1; in compute_child_from_bounds()420 for (int k = 0; k < MAX_CHILDS; ++k) in compute_sum()[all …]
23 #define MAX_CHILDS 128 macro52 extern pid_t child_pid[MAX_CHILDS];170 if ( parent && (child_number < MAX_CHILDS ) ) in membench()
23 #define MAX_CHILDS 128 macro52 extern pid_t child_pid[MAX_CHILDS];171 if ( parent && (child_number < MAX_CHILDS ) ) in diskbench()
23 #define MAX_CHILDS 128 macro51 pid_t child_pid[MAX_CHILDS];183 if ( parent && (child_number < MAX_CHILDS ) ) in cpubench()
81 #define MAX_CHILDS 8 macro89 CodeNode* child[MAX_CHILDS];113 assert(childs <= MAX_CHILDS); in code_new_inst()421 for(i = 0; i < MAX_CHILDS; i++) in code_free()434 assert(idx < MAX_CHILDS); in code_set_child()540 for(i = 0; i < MAX_CHILDS; i++) in code_prune_tree()564 for(i = 0; i < MAX_CHILDS; i++) in code_prune_tree()587 assert(no < MAX_CHILDS); in code_get_child()
44 #define MAX_CHILDS 1024 macro
171 if (!config.childs || config.childs > MAX_CHILDS) { in main()
403 ZHWRONG(config.childs, "child_processes", MAX_CHILDS); in verify_config()
323 #define MAX_CHILDS (16) macro
957 short asyncChilds[MAX_CHILDS];
3662 if( r->nAsyncChilds >= MAX_CHILDS ) in rxvt_async_exec()
125 #define MAX_CHILDS 36 macro212 static child_t childs[MAX_CHILDS] = {{0}};676 return !(!child_slots && next_child_index >= MAX_CHILDS); in free_socket_childs()2174 header[9] = MAX_CHILDS;2256 header[9] = MAX_CHILDS;2350 header[9] = MAX_CHILDS;2469 header[9] = MAX_CHILDS;
116 my $MAX_CHILDS = 20;1118 if ( $num_childs >= $MAX_CHILDS ) {1119 syslog('warning', "Too many childs. Limit: $MAX_CHILDS");