HomeSort by: relevance | last modified time | path
    Searched defs:minv (Results 1 - 25 of 42) sorted by relevancy

1 2

  /src/sys/arch/zaurus/stand/zbsdmod/
zbsdmod.c 86 static vaddr_t minv, maxv, posv; variable
114 minv = (vaddr_t)~0;
136 if (minv > posv)
137 minv = posv;
165 ((char *)minv - BOOTARGS_BUFSIZ)[sz] = bootargs[sz];
zbsdmod.c 86 static vaddr_t minv, maxv, posv; variable
114 minv = (vaddr_t)~0;
136 if (minv > posv)
137 minv = posv;
165 ((char *)minv - BOOTARGS_BUFSIZ)[sz] = bootargs[sz];
  /src/sys/arch/sparc64/dev/
pcf8591_envctrl.c 125 int64_t minv, warnv, crit, num, den; local
158 minv = cp[0] << 24 | cp[1] << 16 | cp[2] << 8 | cp[3]; cp += 4;
201 273150000 + 1000000 * minv;
pcf8591_envctrl.c 125 int64_t minv, warnv, crit, num, den; local
158 minv = cp[0] << 24 | cp[1] << 16 | cp[2] << 8 | cp[3]; cp += 4;
201 273150000 + 1000000 * minv;
  /src/sys/arch/xen/xenbus/
xenbus_probe.c 334 unsigned long minv; local
357 minv = UINT32_MAX;
360 if (id[i] < minv && id[i] > 0) {
361 minv = id[i];
xenbus_probe.c 334 unsigned long minv; local
357 minv = UINT32_MAX;
360 if (id[i] < minv && id[i] > 0) {
361 minv = id[i];
  /src/sys/arch/zaurus/dev/
zapm.c 703 int minv, maxv, v; local
718 minv = 0;
722 minv = i;
736 DPRINTF(("max1111_adc_value_avg: minv = %d, maxv = %d\n", minv, maxv));
739 if (i == minv || i == maxv)
zapm.c 703 int minv, maxv, v; local
718 minv = 0;
722 minv = i;
736 DPRINTF(("max1111_adc_value_avg: minv = %d, maxv = %d\n", minv, maxv));
739 if (i == minv || i == maxv)
  /src/external/gpl3/gcc/dist/gcc/
tree-affine.cc 343 wide_int minv, maxv; local
356 wide_int minv = vr.lower_bound (); local
365 wi::sub (minv, wi::to_wide (op1), sign, &overflow);
tree-pretty-print.cc 2794 tree minv = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node))); local
2796 curidx = wi::to_widest (minv);
tree-affine.cc 343 wide_int minv, maxv; local
356 wide_int minv = vr.lower_bound (); local
365 wi::sub (minv, wi::to_wide (op1), sign, &overflow);
tree-pretty-print.cc 2794 tree minv = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node))); local
2796 curidx = wi::to_widest (minv);
ubsan.cc 1744 tree minv = NULL_TREE, maxv = NULL_TREE; local
1749 minv = boolean_false_node;
1759 minv = TYPE_MIN_VALUE (TREE_TYPE (type));
1815 minv = fold_convert (utype, minv);
1817 if (!integer_zerop (minv))
1819 g = gimple_build_assign (make_ssa_name (utype), MINUS_EXPR, urhs, minv);
1829 int_const_binop (MINUS_EXPR, maxv, minv),
ubsan.cc 1744 tree minv = NULL_TREE, maxv = NULL_TREE; local
1749 minv = boolean_false_node;
1759 minv = TYPE_MIN_VALUE (TREE_TYPE (type));
1815 minv = fold_convert (utype, minv);
1817 if (!integer_zerop (minv))
1819 g = gimple_build_assign (make_ssa_name (utype), MINUS_EXPR, urhs, minv);
1829 int_const_binop (MINUS_EXPR, maxv, minv),
range-op.cc 3486 wide_int minv = valv & cst2v, maxv; local
3488 if (minv != valv)
3491 minv = masked_increment (valv, cst2v, sgnbit, nprec);
3492 if (minv == valv)
3503 create_possibly_reversed_range (r, type, minv, maxv);
3516 minv = valv & cst2v;
3517 if (minv == valv)
3533 minv = sgnbit;
3535 create_possibly_reversed_range (upper_bits, type, minv, maxv);
tree-ssa-loop-niter.cc 350 wide_int minv, maxv; local
379 minv = var_range.lower_bound ();
398 minv = phi_range.lower_bound ();
403 minv = wi::max (minv, phi_range.lower_bound (), sgn);
409 if (wi::gt_p (minv, maxv, sgn))
419 minv = vr.lower_bound ();
436 gcc_assert (wi::le_p (minv, maxv, sgn));
437 wi::to_mpz (minv, minm, sgn);
472 is always fine. If off is negative and minv + off isn'
5410 wide_int minv, maxv, diff, step_wi; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-affine.cc 344 wide_int minv, maxv; local
356 wide_int minv = vr.lower_bound (); local
365 wi::sub (minv, wi::to_wide (op1), sign, &overflow);
tree-pretty-print.cc 2520 tree minv = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node))); local
2522 curidx = wi::to_widest (minv);
tree-affine.cc 344 wide_int minv, maxv; local
356 wide_int minv = vr.lower_bound (); local
365 wi::sub (minv, wi::to_wide (op1), sign, &overflow);
tree-pretty-print.cc 2520 tree minv = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (node))); local
2522 curidx = wi::to_widest (minv);
ubsan.cc 1671 tree minv = NULL_TREE, maxv = NULL_TREE; local
1676 minv = boolean_false_node;
1686 minv = TYPE_MIN_VALUE (TREE_TYPE (type));
1742 minv = fold_convert (utype, minv);
1744 if (!integer_zerop (minv))
1746 g = gimple_build_assign (make_ssa_name (utype), MINUS_EXPR, urhs, minv);
1756 int_const_binop (MINUS_EXPR, maxv, minv),
ubsan.cc 1671 tree minv = NULL_TREE, maxv = NULL_TREE; local
1676 minv = boolean_false_node;
1686 minv = TYPE_MIN_VALUE (TREE_TYPE (type));
1742 minv = fold_convert (utype, minv);
1744 if (!integer_zerop (minv))
1746 g = gimple_build_assign (make_ssa_name (utype), MINUS_EXPR, urhs, minv);
1756 int_const_binop (MINUS_EXPR, maxv, minv),
range-op.cc 2883 wide_int minv = valv & cst2v, maxv; local
2885 if (minv != valv)
2888 minv = masked_increment (valv, cst2v, sgnbit, nprec);
2889 if (minv == valv)
2900 r = int_range<1> (type, minv, maxv);
2913 minv = valv & cst2v;
2914 if (minv == valv)
2930 minv = sgnbit;
2931 int_range<1> upper_bits (type, minv, maxv);
tree-ssa-loop-niter.cc 356 wide_int minv, maxv; local
382 minv = var_range.lower_bound ();
400 minv = phi_range.lower_bound ();
405 minv = wi::max (minv, phi_range.lower_bound (), sgn);
411 if (wi::gt_p (minv, maxv, sgn))
418 minv = vr.lower_bound ();
435 gcc_assert (wi::le_p (minv, maxv, sgn));
436 wi::to_mpz (minv, minm, sgn);
472 is always fine. If off is negative and minv + off isn'
4973 wide_int minv, maxv, diff, step_wi; local
    [all...]
tree-vrp.cc 1788 wide_int minv, maxv, valv, cst2v; local
1806 minv = valv & cst2v;
1862 if (minv != valv)
1866 minv = masked_increment (valv, cst2v, sgnbit, nprec);
1867 if (minv == valv)
1876 /* Find out smallest MINV where MINV > VAL
1877 && (MINV & CST2) == MINV, if any. If VAL is signed and
1879 minv = masked_increment (valv, cst2v, sgnbit, nprec)
    [all...]

Completed in 84 milliseconds

1 2