Home
last modified time | relevance | path

Searched refs:bitpos0 (Results 1 – 2 of 2) sorted by relevance

/dragonfly/contrib/gcc-8.0/gcc/
HDfold-const.c8454 poly_int64 bitsize, bitpos0 = 0, bitpos1 = 0; in fold_comparison() local
8468 &bitsize, &bitpos0, &offset0, &mode, in fold_comparison()
8483 &bitsize, &bitpos0, &offset0, &mode, in fold_comparison()
8500 tem += bitpos0; in fold_comparison()
8501 if (tem.to_shwi (&bitpos0)) in fold_comparison()
8565 && maybe_ne (bitpos0, bitpos1) in fold_comparison()
8566 && (pointer_may_wrap_p (base0, offset0, bitpos0) in fold_comparison()
8576 if (known_eq (bitpos0, bitpos1)) in fold_comparison()
8578 if (known_ne (bitpos0, bitpos1)) in fold_comparison()
8582 if (known_ne (bitpos0, bitpos1)) in fold_comparison()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
HDfold-const.c8903 HOST_WIDE_INT bitsize, bitpos0 = 0, bitpos1 = 0; in fold_comparison() local
8916 &bitsize, &bitpos0, &offset0, &mode, in fold_comparison()
8940 bitpos0 = off * BITS_PER_UNIT; in fold_comparison()
9021 && bitpos0 != bitpos1 in fold_comparison()
9022 && (pointer_may_wrap_p (base0, offset0, bitpos0) in fold_comparison()
9032 return constant_boolean_node (bitpos0 == bitpos1, type); in fold_comparison()
9034 return constant_boolean_node (bitpos0 != bitpos1, type); in fold_comparison()
9036 return constant_boolean_node (bitpos0 < bitpos1, type); in fold_comparison()
9038 return constant_boolean_node (bitpos0 <= bitpos1, type); in fold_comparison()
9040 return constant_boolean_node (bitpos0 >= bitpos1, type); in fold_comparison()
[all …]