Lines Matching refs:branch_factor
256 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
285 if (child + 1 <= branch_factor && child_tid + 1 < nproc) in __kmp_tree_barrier_gather()
319 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
363 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
426 if (child + 1 <= branch_factor && child_tid + 1 < nproc) in __kmp_tree_barrier_release()
455 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
474 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
499 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
523 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
530 if (child + 1 < branch_factor && next_child_tid < num_threads) in __kmp_hyper_barrier_gather()
592 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
658 offset < num_threads && (((tid >> level) & (branch_factor - 1)) == 0); in __kmp_hyper_barrier_release()
675 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
679 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
685 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_release()
700 if (child + 1 < branch_factor && next_child_tid < num_threads) in __kmp_hyper_barrier_release()