Lines Matching refs:IOR

789 	      /* Make an IOR tree of the possible values.  */
795 orexp = insert_right_side (IOR, orexp, newexp, -2, -2);
813 case IOR:
951 case IOR:
1244 if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1703 = insert_right_side (IOR, tests[i - 2], newtest,
1794 AND or IOR expressions and insert a new term. The new term will be
1816 if (code == IOR && term == true_rtx)
1818 if (code == IOR && term == false_rtx)
1820 if (code == IOR && exp == true_rtx)
1822 if (code == IOR && exp == false_rtx)
1859 If so, we can optimize. Similarly for IOR's of EQ_ATTR.
1861 This routine is passed an expression and either AND or IOR. It returns a
1877 else if (code == IOR && GET_CODE (exp) == EQ_ATTR
1886 if (code == IOR && !XINT (exp, 1))
1956 /* We construct an IOR of all the cases for which the
1984 orexp = insert_right_side (IOR, orexp, right,
1998 newexp = insert_right_side (IOR, orexp, right, insn_code, insn_index);
2055 else if (GET_CODE (exp) == IOR)
2057 /* For the IOR case, we do the same as above, except that we can
2058 only eliminate `term' if both sides of the IOR would do so. */
2072 newexp = attr_rtx (IOR, left, right);
2163 /* Similar to `simplify_and_tree', but for IOR trees. */
2173 if (GET_CODE (exp) == IOR)
2475 /* If either side is an IOR and we have (eq_attr "alternative" ..")
2478 if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
2479 && compute_alternative_mask (left, IOR)
2480 && compute_alternative_mask (right, IOR))
2482 if (GET_CODE (left) == IOR)
2489 newexp = attr_rtx (IOR,
2564 case IOR:
2604 newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
2616 && (GET_CODE (left) == IOR
2621 || GET_CODE (right) == IOR
2627 i = compute_alternative_mask (exp, IOR);
2638 /* If just one excluded, IOR a comparison with that one to the
2644 newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
2652 newexp = attr_rtx (IOR, left, right);
2681 if (GET_CODE (left) == IOR)
2691 newexp = attr_rtx (IOR,
3146 We use AND and IOR both for logical and bit-wise operations, so
3179 case AND: case IOR: case XOR:
3235 case IOR: