dist/gcc/genattrtab.c

765 	      /* Make an IOR tree of the possible values.  */
771 		  orexp = insert_right_side (IOR, orexp, newexp, -2, -2);
789     case IOR:
924     case IOR:
1200   if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1711 	    = insert_right_side (IOR, tests[i - 2], newtest,
1802    AND or IOR expressions and insert a new term.  The new term will be
1824   if (code == IOR && term == true_rtx)
1826   if (code == IOR && term == false_rtx)
1828   if (code == IOR && exp == true_rtx)
1830   if (code == IOR && exp == false_rtx)
1867    If so, we can optimize.  Similarly for IOR's of EQ_ATTR.
1869    This routine is passed an expression and either AND or IOR.  It returns a
1885   else if (code == IOR && GET_CODE (exp) == EQ_ATTR
1894       if (code == IOR && !XWINT (exp, 1))
1993       /* We construct an IOR of all the cases for which the
2021 	  orexp = insert_right_side (IOR, orexp, right,
2035       newexp = insert_right_side (IOR, orexp, right, insn_code, insn_index);
2092   else if (GET_CODE (exp) == IOR)
2094       /* For the IOR case, we do the same as above, except that we can
2095          only eliminate `term' if both sides of the IOR would do so.  */
2109 	  newexp = attr_rtx (IOR, left, right);
2200 /* Similar to `simplify_and_tree', but for IOR trees.  */
2210   if (GET_CODE (exp) == IOR)
2449       /* If either side is an IOR and we have (eq_attr "alternative" ..")
2452       if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
2453 	  && compute_alternative_mask (left, IOR)
2454 	  && compute_alternative_mask (right, IOR))
2456 	  if (GET_CODE (left) == IOR)
2459 	  newexp = attr_rtx (IOR,
2534     case IOR:
2574 	  newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
2593 	  newexp = attr_rtx (IOR, XEXP (left, 0), XEXP (right, 0));
2605 	       && (GET_CODE (left) == IOR
2610 		   || GET_CODE (right) == IOR
2616 	  i = compute_alternative_mask (exp, IOR);
2627 	      /* If just one excluded, IOR a comparison with that one to the
2633 	      newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
2641 	  newexp = attr_rtx (IOR, left, right);
2670       if (GET_CODE (left) == IOR)
2680 	  newexp = attr_rtx (IOR,
3331     case IOR:
3347    We use AND and IOR both for logical and bit-wise operations, so
3353 /* Interpret AND/IOR as bit-wise operations instead of logical.  */
3393     case AND:    case IOR:    case XOR:
3395       if ((code != AND && code != IOR) || (flags & FLG_BITWISE))
3467 	case IOR:
3493       else if (code == IOR)
3506       if ((code == AND || code == IOR)
4922     case IOR:
4944     case IOR: