Lines Matching refs:branch_factor
301 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
330 if (child + 1 <= branch_factor && child_tid + 1 < nproc) in __kmp_tree_barrier_gather()
367 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
411 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
474 if (child + 1 <= branch_factor && child_tid + 1 < nproc) in __kmp_tree_barrier_release()
503 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
522 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
547 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
572 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
579 if (child + 1 < branch_factor && next_child_tid < num_threads) in __kmp_hyper_barrier_gather()
645 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
711 offset < num_threads && (((tid >> level) & (branch_factor - 1)) == 0); in __kmp_hyper_barrier_release()
728 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
732 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
738 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_release()
753 if (child + 1 < branch_factor && next_child_tid < num_threads) in __kmp_hyper_barrier_release()