/freebsd/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_sched.cpp | 97 kmp_uint32 nth; in __kmp_for_static_init() local 248 nth = team->t.t_nproc; in __kmp_for_static_init() 249 if (nth == 1) { in __kmp_for_static_init() 309 if (trip_count < nth) { in __kmp_for_static_init() 323 KMP_DEBUG_ASSERT(nth != 0); in __kmp_for_static_init() 325 UT small_chunk = trip_count / nth; in __kmp_for_static_init() 326 UT extras = trip_count % nth; in __kmp_for_static_init() 330 *plastiter = (tid == nth - 1); in __kmp_for_static_init() 333 (trip_count / nth + ((trip_count % nth) ? 1 : 0)) * incr; in __kmp_for_static_init() 371 if (nchunks < nth) { in __kmp_for_static_init() [all …]
|
H A D | kmp_collapse.cpp | 1350 /*in*/ kmp_uint32 nth, in kmp_handle_lower_triangle_matrix() argument 1381 iter_total / nth + ((tid < (iter_total % nth)) ? 1 : 0); in kmp_handle_lower_triangle_matrix() 1394 tid * iter_current + ((tid < iter_total % nth) ? 0 : (iter_total % nth)); in kmp_handle_lower_triangle_matrix() 1459 tid, nth, chunk_bounds_nest[0].lb0_u64, chunk_bounds_nest[1].lb0_u64, in kmp_handle_lower_triangle_matrix() 1470 /*in*/ kmp_uint32 nth, in kmp_handle_upper_triangle_matrix() argument 1501 iter_total / nth + ((tid < (iter_total % nth)) ? 1 : 0); in kmp_handle_upper_triangle_matrix() 1514 tid * iter_current + ((tid < iter_total % nth) ? 0 : (iter_total % nth)); in kmp_handle_upper_triangle_matrix() 1564 tid, nth, chunk_bounds_nest[0].lb0_u64, chunk_bounds_nest[1].lb0_u64, in kmp_handle_upper_triangle_matrix() 1626 kmp_uint32 nth = team->t.t_nproc; // Number of threads in __kmpc_for_collapsed_init() local 1628 KMP_DEBUG_ASSERT(tid < nth); in __kmpc_for_collapsed_init() [all …]
|
H A D | kmp_settings.cpp | 478 int nth = 32; in __kmp_initial_threads_capacity() local 482 if (nth < (4 * req_nproc)) in __kmp_initial_threads_capacity() 483 nth = (4 * req_nproc); in __kmp_initial_threads_capacity() 484 if (nth < (4 * __kmp_xproc)) in __kmp_initial_threads_capacity() 485 nth = (4 * __kmp_xproc); in __kmp_initial_threads_capacity() 490 nth += __kmp_hidden_helper_threads_num; in __kmp_initial_threads_capacity() 493 if (nth > __kmp_max_nth) in __kmp_initial_threads_capacity() 494 nth = __kmp_max_nth; in __kmp_initial_threads_capacity() 496 return nth; in __kmp_initial_threads_capacity() 501 int nth = 128; in __kmp_default_tp_capacity() local [all …]
|
H A D | kmp_runtime.cpp | 122 new_nested_nth->nth = (int *)KMP_INTERNAL_MALLOC(new_size * sizeof(int)); in __kmp_override_nested_nth() 124 new_nested_nth->nth[i] = 0; in __kmp_override_nested_nth() 126 new_nested_nth->nth[i] = thr->th.th_set_nested_nth[j]; in __kmp_override_nested_nth() 1317 this_thr->th.th_current_task->td_icvs.nproc = nested_nth->nth[level + 1]; in __kmp_serialized_parallel() 1373 this_thr->th.th_current_task->td_icvs.nproc = nested_nth->nth[level + 1]; in __kmp_serialized_parallel() 1579 master_th->th.th_teams_size.nth = parent_team->t.t_nproc; in __kmp_fork_in_teams() 1592 if (master_set_numthreads <= master_th->th.th_teams_size.nth) { in __kmp_fork_in_teams() 1597 int old_proc = master_th->th.th_teams_size.nth; in __kmp_fork_in_teams() 1613 int nth = __kmp_omp_num_threads(loc); in __kmp_fork_in_teams() local 1614 if (nth > 0) { // 0 means debugger doesn't want to change num threads in __kmp_fork_in_teams() [all …]
|
H A D | ompd-specific.h | 87 OMPD_ACCESS(kmp_nested_nthreads_t, nth) \
|
H A D | kmp_tasking.cpp | 2529 kmp_uint32 nth = thread->th.th_team_nproc; local 2536 if (nth == 1 && !__kmp_enable_hidden_helper) { 2559 arr[i].reduce_priv = __kmp_allocate(nth * size); 2560 arr[i].reduce_pend = (char *)(arr[i].reduce_priv) + nth * size; 2563 for (size_t j = 0; j < nth; ++j) { 2571 arr[i].reduce_priv = __kmp_allocate(nth * sizeof(void *)); 2666 kmp_int32 nth = thread->th.th_team_nproc; local 2667 if (nth == 1) 2705 for (int j = 0; j < nth; ++j) 2735 kmp_int32 nth = th->th.th_team_nproc; local [all …]
|
H A D | kmp_debugger.cpp | 108 offset_and_size_of(kmp_teams_size_t, nth),
|
H A D | kmp_affinity.cpp | 5615 int nth = nthreads; in __kmp_balanced_affinity() local 5617 while (nth > 0) { in __kmp_balanced_affinity() 5630 nth--; in __kmp_balanced_affinity() 5636 nth--; in __kmp_balanced_affinity() 5642 if (cnt == 0 || nth == 0) { in __kmp_balanced_affinity() 5646 if (nth == 0) { in __kmp_balanced_affinity()
|
H A D | kmp_dispatch.cpp | 653 T nth = nproc; in __kmp_dispatch_init_algorithm() local 658 if (nth > 1) in __kmp_dispatch_init_algorithm() 659 pr->u.p.parm1 = ((tc + nth - 1) / nth + chunk - 1) & ~(chunk - 1); in __kmp_dispatch_init_algorithm()
|
H A D | kmp.h | 537 int *nth; member 2911 kmp_int32 nth; // number of threads in each team of the league member
|
H A D | kmp_csupport.cpp | 541 KMP_DEBUG_ASSERT(this_thr->th.th_teams_size.nth >= 1); in __kmpc_fork_teams()
|
/freebsd/sys/contrib/openzfs/tests/zfs-tests/cmd/ |
H A D | xattrtest.c | 86 static int nth = 0; variable 147 nth = strtol(optarg, NULL, 0); in parse_args() 210 fprintf(stdout, "nth: %d\n", nth); in parse_args() 376 if (nth && ((i % nth) == 0)) in create_files() 475 if (nth && ((i % nth) == 0)) in setxattrs() 564 if (nth && ((i % nth) == 0)) in getxattrs() 643 if (nth && ((i % nth) == 0)) in unlink_files()
|
/freebsd/sys/netinet/ |
H A D | tcp_subr.c | 1744 struct tcphdr *nth; in tcp_respond() local 1809 nth = (struct tcphdr *)(ip6 + 1); in tcp_respond() 1812 uh = (struct udphdr *)nth; in tcp_respond() 1815 nth = (struct tcphdr *)(uh + 1); in tcp_respond() 1822 nth = (struct tcphdr *)(ip + 1); in tcp_respond() 1825 uh = (struct udphdr *)nth; in tcp_respond() 1828 nth = (struct tcphdr *)(uh + 1); in tcp_respond() 1831 bcopy((caddr_t)th, (caddr_t)nth, sizeof(struct tcphdr)); in tcp_respond() 1858 nth = (struct tcphdr *)(ip6 + 1); in tcp_respond() 1861 uh = (struct udphdr *)nth; in tcp_respond() [all …]
|
/freebsd/contrib/elftoolchain/libelftc/ |
H A D | libelftc_dem_gnu3.c | 2151 long nth; in cpp_demangle_read_subst() local 2257 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 && in cpp_demangle_read_subst() 2262 ++nth; in cpp_demangle_read_subst() 2267 assert(nth > 0); in cpp_demangle_read_subst() 2269 return (cpp_demangle_get_subst(ddata, nth)); in cpp_demangle_read_subst() 2469 long nth; in cpp_demangle_read_tmpl_param() local 2481 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 && in cpp_demangle_read_tmpl_param() 2486 ++nth; in cpp_demangle_read_tmpl_param() 2491 assert(nth > 0); in cpp_demangle_read_tmpl_param() 2493 return (cpp_demangle_get_tmpl_param(ddata, nth)); in cpp_demangle_read_tmpl_param()
|
/freebsd/contrib/libcxxrt/ |
H A D | libelftc_dem_gnu3.c | 2489 long nth; in cpp_demangle_read_subst() local 2590 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 && in cpp_demangle_read_subst() 2595 ++nth; in cpp_demangle_read_subst() 2600 assert(nth > 0); in cpp_demangle_read_subst() 2602 return (cpp_demangle_get_subst(ddata, nth)); in cpp_demangle_read_subst() 2797 long nth; in cpp_demangle_read_tmpl_param() local 2809 if ((nth = strtol(ddata->cur, (char **) NULL, 36)) == 0 && in cpp_demangle_read_tmpl_param() 2814 ++nth; in cpp_demangle_read_tmpl_param() 2819 assert(nth > 0); in cpp_demangle_read_tmpl_param() 2821 return (cpp_demangle_get_tmpl_param(ddata, nth)); in cpp_demangle_read_tmpl_param()
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
H A D | HTMLLogger.css | 55 #bb-elements td:nth-child(1) {
|
/freebsd/contrib/unbound/iterator/ |
H A D | iter_utils.c | 401 int got_num = 0, low_rtt = 0, swap_to_front, rtt_band = RTT_BAND, nth; in iter_filter_order() local 427 nth = nth_rtt(dp->result_list, num_results, in iter_filter_order() 429 if(nth > 0) { in iter_filter_order() 430 rtt_band = nth - low_rtt; in iter_filter_order()
|
/freebsd/contrib/llvm-project/libcxx/modules/std/ |
H A D | algorithm.cppm |
|
H A D | algorithm.inc | 401 // [alg.nth.element], Nth element
|
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | algorithm | 575 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++… 580 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++… 1551 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 1555 …nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compa…
|
/freebsd/contrib/libxo/xohtml/external/ |
H A D | jquery.js | 4653 nth: function( elem, i, match ) { 5552 return jQuery.nth( elem, 2, "nextSibling" ); 5555 return jQuery.nth( elem, 2, "previousSibling" ); 5631 nth: function( cur, result, dir, elem ) { method
|
/freebsd/share/dict/ |
H A D | web2a | 37557 nth degree
|
H A D | web2 | 128477 nth
|
/freebsd/contrib/one-true-awk/testdir/ |
H A D | funstack.in | 17799 … algorithms encounter special cases requiring additional computation every nth permutation when ge…
|
/freebsd/contrib/ncurses/misc/ |
H A D | terminfo.src | 24626 # 10 + n (n in 1..9) = nth alternative font,
|