| /netbsd-current/external/gpl3/gcc/dist/gcc/ |
| H A D | tree-ssa-ccp.cc | 224 widest_int cval = wi::bit_and_not (wi::to_widest (val.value),
467 return (wi::bit_and_not (wi::to_widest (old_val.value), new_val.mask)
468 == wi::bit_and_not (wi::to_widest (new_val.value), new_val.mask));
547 || (wi::bit_and_not (wi::to_widest (old_val->value),
549 != wi::bit_and_not (wi::to_widest (new_val->value),
605 val.mask = wi::bit_and_not
1306 *min = wi::bit_and_not (val, mask);
1404 widest_int rval_lo = wi::bit_and_not (rval, rmask);
1513 *mask = wi::bit_and_not (r1mask | r2mask,
1514 wi::bit_and_not (r1va
[all...] |
| H A D | wide-int.cc | 691 tmp = wi::bit_and_not (x, mask);
2199 wide_int extra_bits = wi::bit_and_not (val, mask);
2225 wide_int extra_bits = wi::bit_and_not (val, mask);
2246 wide_int tmp = wi::bit_and_not (upper_mask, val);
|
| H A D | vr-values.cc | 3298 mask = wi::bit_and_not (may_be_nonzero0, must_be_nonzero1);
3304 mask = wi::bit_and_not (may_be_nonzero1, must_be_nonzero0);
3312 mask = wi::bit_and_not (may_be_nonzero0, must_be_nonzero1);
3318 mask = wi::bit_and_not (may_be_nonzero1, must_be_nonzero0);
|
| H A D | range-op.cc | 2777 mustbe_nonzero = wi::bit_and_not (mustbe_nonzero, mask);
3172 = (wi::bit_and_not (mustbe_nonzero_lh, maybe_nonzero_rh)
3173 | wi::bit_and_not (mustbe_nonzero_rh, maybe_nonzero_lh));
|
| H A D | tree-vrp.cc | 1296 res = wi::bit_and_not (val + bit, res);
2279 set_nonzero_bits (var, wi::bit_and_not (get_nonzero_bits (var),
|
| H A D | wide-int.h | 560 BINARY_FUNCTION bit_and_not (const T1 &, const T2 &);
2338 wi::bit_and_not (const T1 &x, const T2 &y) function in class:wi
|
| H A D | fold-const.cc | 10843 if (wi::ne_p (wi::zext (wi::bit_and_not (w, get_nonzero_bits (t)),
11704 if (wi::bit_and_not (msk, c1 | c2) == 0)
11715 wide_int c3 = wi::bit_and_not (c1, c2);
11721 && wi::bit_and_not (c1, mask) == 0)
|
| H A D | ipa-prop.cc | 2342 widest_int mask = wi::bit_and_not
|
| H A D | gimple-ssa-store-merging.cc | 4657 wi::bit_and_not (wi::to_wide (src),
|
| /netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
| H A D | tree-ssa-ccp.c | 223 widest_int cval = wi::bit_and_not (wi::to_widest (val.value),
466 return (wi::bit_and_not (wi::to_widest (old_val.value), new_val.mask)
467 == wi::bit_and_not (wi::to_widest (new_val.value), new_val.mask));
546 || (wi::bit_and_not (wi::to_widest (old_val->value),
548 != wi::bit_and_not (wi::to_widest (new_val->value),
604 val.mask = wi::bit_and_not
1373 *mask = wi::bit_and_not (r1mask | r2mask,
1374 wi::bit_and_not (r1val, r1mask)
1375 | wi::bit_and_not (r2val, r2mask));
1463 widest_int lo = (wi::bit_and_not (r1va
[all...] |
| H A D | wide-int.cc | 691 tmp = wi::bit_and_not (x, mask);
2198 wide_int extra_bits = wi::bit_and_not (val, mask);
2224 wide_int extra_bits = wi::bit_and_not (val, mask);
2245 wide_int tmp = wi::bit_and_not (upper_mask, val);
|
| H A D | vr-values.c | 3397 mask = wi::bit_and_not (may_be_nonzero0, must_be_nonzero1);
3403 mask = wi::bit_and_not (may_be_nonzero1, must_be_nonzero0);
3411 mask = wi::bit_and_not (may_be_nonzero0, must_be_nonzero1);
3417 mask = wi::bit_and_not (may_be_nonzero1, must_be_nonzero0);
|
| H A D | range-op.cc | 1878 mustbe_nonzero = wi::bit_and_not (mustbe_nonzero, mask);
2135 = (wi::bit_and_not (mustbe_nonzero_lh, maybe_nonzero_rh)
2136 | wi::bit_and_not (mustbe_nonzero_rh, maybe_nonzero_lh));
|
| H A D | tree-vrp.c | 1695 res = wi::bit_and_not (val + bit, res);
4209 set_nonzero_bits (var, wi::bit_and_not (get_nonzero_bits (var),
|
| H A D | wide-int.h | 560 BINARY_FUNCTION bit_and_not (const T1 &, const T2 &);
2336 wi::bit_and_not (const T1 &x, const T2 &y) function in class:wi
|
| H A D | fold-const.c | 10218 if (wi::ne_p (wi::zext (wi::bit_and_not (w, get_nonzero_bits (t)),
11079 if (wi::bit_and_not (msk, c1 | c2) == 0)
11090 wide_int c3 = wi::bit_and_not (c1, c2);
11096 && wi::bit_and_not (c1, mask) == 0)
|
| H A D | gimple-ssa-store-merging.c | 4294 wi::bit_and_not (wi::to_wide (src),
|
| H A D | ipa-prop.c | 2213 widest_int mask = wi::bit_and_not
|