Lines Matching refs:branch_factor
803 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_gather() local
832 if (child + 1 <= branch_factor && child_tid + 1 < nproc) in __kmp_tree_barrier_gather()
865 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_gather()
908 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_tree_barrier_release() local
970 if (child + 1 <= branch_factor && child_tid + 1 < nproc) in __kmp_tree_barrier_release()
998 } while (child <= branch_factor && child_tid < nproc); in __kmp_tree_barrier_release()
1016 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_gather() local
1041 if (((tid >> level) & (branch_factor - 1)) != 0) { in __kmp_hyper_barrier_gather()
1065 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_gather()
1072 if (child + 1 < branch_factor && next_child_tid < num_threads) in __kmp_hyper_barrier_gather()
1134 kmp_uint32 branch_factor = 1 << branch_bits; in __kmp_hyper_barrier_release() local
1199 offset < num_threads && (((tid >> level) & (branch_factor - 1)) == 0); in __kmp_hyper_barrier_release()
1216 for (child = (child < branch_factor - 1) ? child : branch_factor - 1, in __kmp_hyper_barrier_release()
1220 if (((tid >> level) & (branch_factor - 1)) != 0) in __kmp_hyper_barrier_release()
1226 child < branch_factor && child_tid < num_threads; in __kmp_hyper_barrier_release()
1241 if (child + 1 < branch_factor && next_child_tid < num_threads) in __kmp_hyper_barrier_release()