Searched refs:ub1 (Results 1 – 4 of 4) sorted by relevance
316 (iv > (bounds->ub0 + bounds->ub1 * outer_iv))) || in kmp_iv_is_in_upper_bound_XX()318 (iv < (bounds->ub0 + bounds->ub1 * outer_iv)))) { in kmp_iv_is_in_upper_bound_XX()540 if ((bbounds.lb1 != 0) || (bbounds.ub1 != 0)) { in kmp_calc_span_lessoreq_XX()567 bbounds.ub0 + bbounds.ub1 * previous->span_smallest; in kmp_calc_span_lessoreq_XX()569 bbounds.ub0 + bbounds.ub1 * previous->span_biggest; in kmp_calc_span_lessoreq_XX()604 if ((bbounds.lb1 != 0) || (bbounds.ub1 != 0)) { in kmp_calc_span_greateroreq_XX()631 bbounds.ub0 + bbounds.ub1 * previous->span_smallest; in kmp_calc_span_greateroreq_XX()633 bbounds.ub0 + bbounds.ub1 * previous->span_biggest; in kmp_calc_span_greateroreq_XX()682 if (bbounds.lb1 == bbounds.ub1) { in kmp_calc_new_bounds_XX()689 T old_ub1 = bbounds.ub1; in kmp_calc_new_bounds_XX()[all …]
89 T ub1; member
1500 vdev_uberblock_compare(const uberblock_t *ub1, const uberblock_t *ub2) in vdev_uberblock_compare() argument1502 int cmp = TREE_CMP(ub1->ub_txg, ub2->ub_txg); in vdev_uberblock_compare()1507 cmp = TREE_CMP(ub1->ub_timestamp, ub2->ub_timestamp); in vdev_uberblock_compare()1525 if (MMP_VALID(ub1) && MMP_SEQ_VALID(ub1)) in vdev_uberblock_compare()1526 seq1 = MMP_SEQ(ub1); in vdev_uberblock_compare()
1558 vdev_uberblock_compare(const uberblock_t *ub1, const uberblock_t *ub2) in vdev_uberblock_compare() argument1562 int cmp = AVL_CMP(ub1->ub_txg, ub2->ub_txg); in vdev_uberblock_compare()1567 cmp = AVL_CMP(ub1->ub_timestamp, ub2->ub_timestamp); in vdev_uberblock_compare()1571 if (MMP_VALID(ub1) && MMP_SEQ_VALID(ub1)) in vdev_uberblock_compare()1572 seq1 = MMP_SEQ(ub1); in vdev_uberblock_compare()