Home
last modified time | relevance | path

Searched refs:min2 (Results 1 – 8 of 8) sorted by relevance

/dragonfly/contrib/mdocml/
H A Dout.c126 size_t ewidth, min1, min2, wanted, width, xwidth; in tblcalc() local
266 min1 = min2 = SIZE_MAX; in tblcalc()
270 min2 = min1; in tblcalc()
272 } else if (min1 < width && min2 > width) in tblcalc()
273 min2 = width; in tblcalc()
282 wanted = min2; in tblcalc()
291 if (width > min2) in tblcalc()
292 width = min2; in tblcalc()
/dragonfly/contrib/lvm2/dist/lib/mirror/
H A Dmirrored.c363 unsigned maj2, min2, patchlevel2; in _mirrored_target_present() local
387 sscanf(vsn, "%u.%u.%u", &maj2, &min2, &patchlevel2) == 3 && in _mirrored_target_present()
388 maj2 == 4 && min2 == 5 && patchlevel2 == 0))) /* RHEL4U3 */ in _mirrored_target_present()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dgimple.c3583 tree min2 = TYPE_MIN_VALUE (i2); in gimple_types_compatible_p_1() local
3588 if ((min1 == min2 in gimple_types_compatible_p_1()
3589 || (min1 && min2 in gimple_types_compatible_p_1()
3591 && TREE_CODE (min2) == PLACEHOLDER_EXPR) in gimple_types_compatible_p_1()
3677 tree min2 = TYPE_MIN_VALUE (t2); in gimple_types_compatible_p_1() local
3684 if (min1 == NULL_TREE && min2 == NULL_TREE) in gimple_types_compatible_p_1()
3686 else if (min1 && min2 && operand_equal_p (min1, min2, 0)) in gimple_types_compatible_p_1()
4607 tree min2 = TYPE_MIN_VALUE (i2); in gimple_canonical_types_compatible_p() local
4612 if ((min1 == min2 in gimple_canonical_types_compatible_p()
4613 || (min1 && min2 in gimple_canonical_types_compatible_p()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dtree-data-ref.c1713 tree min2 = CHREC_LEFT (access2); in create_intersect_range_checks_index() local
1714 if (!types_compatible_p (TREE_TYPE (min1), TREE_TYPE (min2))) in create_intersect_range_checks_index()
1726 tree idx_len2 = fold_build2 (MULT_EXPR, TREE_TYPE (min2), idx_step, in create_intersect_range_checks_index()
1727 build_int_cst (TREE_TYPE (min2), in create_intersect_range_checks_index()
1730 tree max2 = fold_build2 (PLUS_EXPR, TREE_TYPE (min2), min2, idx_len2); in create_intersect_range_checks_index()
1736 std::swap (min2, max2); in create_intersect_range_checks_index()
1744 = fold_build2 (MULT_EXPR, TREE_TYPE (min2), idx_step, in create_intersect_range_checks_index()
1745 build_int_cst (TREE_TYPE (min2), niter_access2)); in create_intersect_range_checks_index()
1753 fold_build2 (LE_EXPR, boolean_type_node, max1, min2), in create_intersect_range_checks_index()
H A Dipa-devirt.c1433 tree min2 = TYPE_MIN_VALUE (i2);
1438 gcc_assert (min1 == min2);
H A Dtree.c13427 tree min2 = TYPE_MIN_VALUE (i2); in gimple_canonical_types_compatible_p() local
13432 if ((min1 == min2 in gimple_canonical_types_compatible_p()
13433 || (min1 && min2 in gimple_canonical_types_compatible_p()
13435 && TREE_CODE (min2) == PLACEHOLDER_EXPR) in gimple_canonical_types_compatible_p()
13436 || operand_equal_p (min1, min2, 0)))) in gimple_canonical_types_compatible_p()
/dragonfly/contrib/expat/lib/
H A Dxmltok.c1265 min2 = 0x80, in XmlUtf8Encode() enumerator
1272 if (c < min2) { in XmlUtf8Encode()
/dragonfly/sys/dev/drm/i915/
H A Di915_drv.h146 uint_fixed_16_16_t min2) in min_fixed16() argument
150 min.val = min(min1.val, min2.val); in min_fixed16()