Home
last modified time | relevance | path

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

/dragonfly/contrib/mdocml/
HDout.c126 size_t ewidth, min1, min2, wanted, width, xwidth; in tblcalc() local
266 min1 = min2 = SIZE_MAX; in tblcalc()
269 if (min1 > width) { in tblcalc()
270 min2 = min1; in tblcalc()
271 min1 = width; in tblcalc()
272 } else if (min1 < width && min2 > width) in tblcalc()
286 if (tbl->cols[icol].width == min1) in tblcalc()
290 width = min1 + (g->wanted - 1) / necol + 1; in tblcalc()
303 if (tbl->cols[icol].width != min1) in tblcalc()
305 if (g->wanted <= wanted - min1) { in tblcalc()
[all …]
/dragonfly/contrib/cvs-1.12/lib/
HDmktime.c166 ydhms_diff (long int year1, long int yday1, int hour1, int min1, int sec1, in ydhms_diff() argument
189 time_t minutes = 60 * hours + min1 - min0; in ydhms_diff()
/dragonfly/contrib/gcc-4.7/gcc/
HDgimple.c3582 tree min1 = TYPE_MIN_VALUE (i1); 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()
3590 && ((TREE_CODE (min1) == PLACEHOLDER_EXPR in gimple_types_compatible_p_1()
3592 || operand_equal_p (min1, min2, 0)))) in gimple_types_compatible_p_1()
3675 tree min1 = TYPE_MIN_VALUE (t1); 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()
4606 tree min1 = TYPE_MIN_VALUE (i1); in gimple_canonical_types_compatible_p() local
4612 if ((min1 == min2 in gimple_canonical_types_compatible_p()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
HDtree-data-ref.c1712 tree min1 = CHREC_LEFT (access1); in create_intersect_range_checks_index() local
1714 if (!types_compatible_p (TREE_TYPE (min1), TREE_TYPE (min2))) in create_intersect_range_checks_index()
1723 tree idx_len1 = fold_build2 (MULT_EXPR, TREE_TYPE (min1), idx_step, in create_intersect_range_checks_index()
1724 build_int_cst (TREE_TYPE (min1), in create_intersect_range_checks_index()
1729 tree max1 = fold_build2 (PLUS_EXPR, TREE_TYPE (min1), min1, idx_len1); in create_intersect_range_checks_index()
1735 std::swap (min1, max1); in create_intersect_range_checks_index()
1741 = fold_build2 (MULT_EXPR, TREE_TYPE (min1), idx_step, in create_intersect_range_checks_index()
1742 build_int_cst (TREE_TYPE (min1), niter_access1)); in create_intersect_range_checks_index()
1754 fold_build2 (LE_EXPR, boolean_type_node, max2, min1)); in create_intersect_range_checks_index()
HDtree-vrp.c1828 vrp_int min1 = vrp_int_cst (vr1.min); in extract_range_from_binary_expr_1() local
1839 if (wi::ltu_p (size, min1 + max1)) in extract_range_from_binary_expr_1()
1841 min1 -= size; in extract_range_from_binary_expr_1()
1846 vrp_int prod0 = min0 * min1; in extract_range_from_binary_expr_1()
1848 vrp_int prod2 = max0 * min1; in extract_range_from_binary_expr_1()
HDipa-devirt.c1432 tree min1 = TYPE_MIN_VALUE (i1);
1438 gcc_assert (min1 == min2);
HDtree.c13426 tree min1 = TYPE_MIN_VALUE (i1); 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()
13434 && ((TREE_CODE (min1) == PLACEHOLDER_EXPR in gimple_canonical_types_compatible_p()
13436 || operand_equal_p (min1, min2, 0)))) in gimple_canonical_types_compatible_p()
/dragonfly/sys/dev/drm/i915/
HDi915_drv.h145 static inline uint_fixed_16_16_t min_fixed16(uint_fixed_16_16_t min1, in min_fixed16() argument
150 min.val = min(min1.val, min2.val); in min_fixed16()