Searched refs:nth (Results 1 - 14 of 14) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_sched.cpp85 kmp_uint32 nth; local
229 nth = team->t.t_nproc;
230 if (nth == 1) {
289 if (trip_count < nth) {
303 UT small_chunk = trip_count / nth;
304 UT extras = trip_count % nth;
308 *plastiter = (tid == nth - 1);
311 (trip_count / nth + ((trip_count % nth) ? 1 : 0)) * incr;
345 *pstride = span * nth;
432 kmp_uint32 nth; local
[all...]
H A Dkmp_settings.cpp497 int nth = 32; local
501 if (nth < (4 * req_nproc))
502 nth = (4 * req_nproc);
503 if (nth < (4 * __kmp_xproc))
504 nth = (4 * __kmp_xproc);
506 if (nth > __kmp_max_nth)
507 nth = __kmp_max_nth;
509 return nth;
514 int nth = 128; local
520 if (nth < (
[all...]
H A Dkmp_debugger.cpp108 offset_and_size_of(kmp_teams_size_t, nth),
H A Dkmp_tasking.cpp2087 kmp_int32 nth = thread->th.th_team_nproc; local
2094 if (nth == 1) {
2095 KA_TRACE(10, ("__kmpc_task_reduction_init: T#%d, tg %p, exiting nth=1\n",
2117 arr[i].reduce_priv = __kmp_allocate(nth * size);
2118 arr[i].reduce_pend = (char *)(arr[i].reduce_priv) + nth * size;
2121 for (int j = 0; j < nth; ++j) {
2129 arr[i].reduce_priv = __kmp_allocate(nth * sizeof(void *));
2201 kmp_int32 nth = thread->th.th_team_nproc; local
2202 if (nth == 1)
2226 for (int j = 0; j < nth;
2257 kmp_int32 nth = th->th.th_team_nproc; local
2306 kmp_int32 nth = thr->th.th_team_nproc; local
[all...]
H A Dkmp_runtime.cpp1270 __kmp_nested_nth.nth[level + 1];
1321 __kmp_nested_nth.nth[level + 1];
1596 if (master_set_numthreads < master_th->th.th_teams_size.nth) {
1610 int nth = __kmp_omp_num_threads(loc); local
1611 if (nth > 0) { // 0 means debugger doesn't want to change num threads
1612 master_set_numthreads = nth;
1940 (__kmp_nested_nth.nth[level + 1] != nthreads_icv)) {
1941 nthreads_icv = __kmp_nested_nth.nth[level + 1];
2394 // the proper adjustment of th_teams_size.nth after the fork in
2397 if (master_th->th.th_team_nproc < master_th->th.th_teams_size.nth) {
3800 int i, n, nth; local
[all...]
H A Dkmp_dispatch.cpp462 T nth = nproc; local
467 if (nth > 1)
468 pr->u.p.parm1 = ((tc + nth - 1) / nth + chunk - 1) & ~(chunk - 1);
H A Dkmp_affinity.cpp5234 int nth = nthreads; local
5236 while (nth > 0) {
5249 nth--;
5255 nth--;
5261 if (cnt == 0 || nth == 0) {
5265 if (nth == 0) {
H A Dkmp.h2393 kmp_int32 nth; // number of threads in each team of the league member in struct:kmp_teams_size
2990 int *nth; member in struct:kmp_nested_nthreads_t
H A Dkmp_csupport.cpp403 KMP_DEBUG_ASSERT(this_thr->th.th_teams_size.nth >= 1);
/freebsd-11-stable/sys/netinet/
H A Dtcp_subr.c879 struct tcphdr *nth; local
924 nth = (struct tcphdr *)(ip6 + 1);
930 nth = (struct tcphdr *)(ip + 1);
932 bcopy((caddr_t)th, (caddr_t)nth, sizeof(struct tcphdr));
959 nth = (struct tcphdr *)(ip6 + 1);
966 nth = (struct tcphdr *)(ip + 1);
968 bcopy((caddr_t)th, (caddr_t)nth, sizeof(struct tcphdr));
969 xchg(nth->th_dport, nth->th_sport, uint16_t);
970 th = nth;
[all...]
/freebsd-11-stable/contrib/elftoolchain/libelftc/
H A Dlibelftc_dem_gnu3.c2151 long nth; local
2257 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 &&
2262 ++nth;
2267 assert(nth > 0);
2269 return (cpp_demangle_get_subst(ddata, nth));
2469 long nth; local
2481 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 &&
2486 ++nth;
2491 assert(nth > 0);
2493 return (cpp_demangle_get_tmpl_param(ddata, nth));
[all...]
/freebsd-11-stable/contrib/libcxxrt/
H A Dlibelftc_dem_gnu3.c2485 long nth; local
2591 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 &&
2596 ++nth;
2601 assert(nth > 0);
2603 return (cpp_demangle_get_subst(ddata, nth));
2803 long nth; local
2815 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 &&
2820 ++nth;
2825 assert(nth > 0);
2827 return (cpp_demangle_get_tmpl_param(ddata, nth));
[all...]
/freebsd-11-stable/contrib/unbound/iterator/
H A Diter_utils.c367 int got_num = 0, low_rtt = 0, swap_to_front, rtt_band = RTT_BAND, nth; local
389 nth = nth_rtt(dp->result_list, num_results,
391 if(nth > 0) {
392 rtt_band = nth - low_rtt;
/freebsd-11-stable/contrib/libxo/xohtml/external/
H A Djquery.js4292 CHILD: /:(only|nth|last|first)-child(?:\(\s*(even|odd|(?:[+\-]?\d+|(?:[+\-]?\d*)?n\s*(?:[+\-]\s*\d+)?))\s*\))?/,
4293 POS: /:(nth|eq|gt|lt|first|last|even|odd)(?:\((\d*)\))?(?=[^\-]|$)/,
4466 if ( match[1] === "nth" ) {
4653 nth: function( elem, i, match ) {
4719 case "nth":
5552 return jQuery.nth( elem, 2, "nextSibling" );
5555 return jQuery.nth( elem, 2, "previousSibling" );
5631 nth: function( cur, result, dir, elem ) {

Completed in 391 milliseconds