HomeSort by: relevance | last modified time | path
    Searched defs:min1 (Results 1 - 9 of 9) sorted by relevancy

  /src/sys/arch/x68k/dev/
rtclock.c 143 u_char min1, min2; local
152 min1 = dt->dt_min / 10;
167 RTC_WRITE(RTC_MIN10, min1);
  /src/external/bsd/ntp/dist/kernel/sys/
tpro.h 15 u_short min1; /* minutes * 1 */ member in struct:tproval
  /src/external/bsd/mdocml/dist/
out.c 127 size_t ewidth, min1, min2, wanted, width, xwidth; local
279 min1 = min2 = SIZE_MAX;
282 if (min1 > width) {
283 min2 = min1;
284 min1 = width;
285 } else if (min1 < width && min2 > width)
299 if (colwidth[icol] == min1)
303 width = min1 + (g->wanted - 1) / necol + 1;
316 if (colwidth[icol] != min1)
318 if (g->wanted <= wanted - min1) {
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 2207 tree min1 = CHREC_LEFT (access1);
2209 if (!types_compatible_p (TREE_TYPE (min1), TREE_TYPE (min2)))
2254 [min1 + low_offset1, min1 + high_offset1 + idx_access1 - 1]
2267 min1 + low_offset1 <= min2 + high_offset2 + idx_access2 - 1
2268 && min2 + low_offset2 <= min1 + high_offset1 + idx_access1 - 1
2272 0 <= min2 - min1 + bias <= limit
2298 access of DR_A. In other words, we need to move min1 along by
2301 min1' = min1 + idx_ste
2206 tree min1 = CHREC_LEFT (access1); variable
    [all...]
range-op.cc 2074 // MIN1, MIN0 OP MAX1, MAX0 OP MIN1 and MAX0 OP MAX0 OP MAX1) and then
2199 widest2_int min1 = widest2_int::from (rh_lb, sign); local
2212 if (wi::ltu_p (size, min1 + max1))
2214 min1 -= size;
2221 widest2_int prod0 = min0 * min1;
2223 widest2_int prod2 = max0 * min1;
tree-ssa-ccp.cc 1833 widest_int min1, max1, min2, max2; local
1841 value_mask_to_min_max (&min1, &max1, o1val, o1mask,
1849 minmax = wi::cmp (min1, max2, r1type_sgn);
1879 widest_int min1, max1, min2, max2; local
1881 value_mask_to_min_max (&min1, &max1, r1val, r1mask, sgn, width);
1897 else if (wi::cmp (min1, max2, sgn) >= 0) /* r2 is less than r1. */
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 2194 tree min1 = CHREC_LEFT (access1);
2196 if (!types_compatible_p (TREE_TYPE (min1), TREE_TYPE (min2)))
2241 [min1 + low_offset1, min1 + high_offset1 + idx_access1 - 1]
2254 min1 + low_offset1 <= min2 + high_offset2 + idx_access2 - 1
2255 && min2 + low_offset2 <= min1 + high_offset1 + idx_access1 - 1
2259 0 <= min2 - min1 + bias <= limit
2285 access of DR_A. In other words, we need to move min1 along by
2288 min1' = min1 + idx_ste
2193 tree min1 = CHREC_LEFT (access1); variable
    [all...]
range-op.cc 1565 // MIN1, MIN0 OP MAX1, MAX0 OP MIN1 and MAX0 OP MAX0 OP MAX1) and then
1702 widest2_int min1 = widest2_int::from (rh_lb, sign); local
1715 if (wi::ltu_p (size, min1 + max1))
1717 min1 -= size;
1724 widest2_int prod0 = min0 * min1;
1726 widest2_int prod2 = max0 * min1;
tree-ssa-ccp.cc 1828 widest_int min1, max1, min2, max2; local
1836 value_mask_to_min_max (&min1, &max1, o1val, o1mask,
1844 minmax = wi::cmp (min1, max2, r1type_sgn);
1874 widest_int min1, max1, min2, max2; local
1876 value_mask_to_min_max (&min1, &max1, r1val, r1mask, sgn, width);
1892 else if (wi::cmp (min1, max2, sgn) >= 0) /* r2 is less than r1. */

Completed in 50 milliseconds