Searched refs:IOR (Results 1 - 25 of 25) sorted by relevance

/freebsd-11-stable/contrib/gcc/
H A Dgenattrtab.c789 /* Make an IOR tree of the possible values. */
795 orexp = insert_right_side (IOR, orexp, newexp, -2, -2);
813 case IOR:
951 case IOR:
1245 if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1704 = insert_right_side (IOR, tests[i - 2], newtest,
1795 AND or IOR expressions and insert a new term. The new term will be
1817 if (code == IOR && term == true_rtx)
1819 if (code == IOR && term == false_rtx)
1821 if (code == IOR
[all...]
H A Dgenpreds.c54 case IOR:
208 case IOR:
294 case IOR:
360 top-level pattern is an IOR, and one of the two branches does test
382 case IOR:
497 case IOR:
600 case IOR:
H A Dcombine.c3621 so, this is an IOR of an AND, so split it into that. */
3647 simplify_gen_binary (IOR, mode, dest, or_mask));
3652 simplify_gen_binary (IOR, mode,
3820 case IOR:
3823 Similarly for IOR. */
3828 gen_rtx_fmt_ee (code == IOR ? AND : IOR,
4339 || code == AND || code == IOR || code == XOR)
4350 || code == AND || code == IOR || code == XOR
4582 the addition into an IOR
[all...]
H A Dloop-iv.c1669 case IOR:
1725 case IOR:
2461 simplify_using_initial_values (loop, IOR, &desc->noloop_assumptions);
2462 simplify_using_initial_values (loop, IOR, &desc->infinite);
2484 simplify_using_initial_values (loop, IOR, &desc->noloop_assumptions);
2485 simplify_using_initial_values (loop, IOR, &desc->infinite);
2521 simplify_using_initial_values (loop, IOR, &desc->infinite);
H A Dsimplify-rtx.c488 if (GET_CODE (op) == IOR || GET_CODE (op) == AND)
507 return gen_rtx_fmt_ee (GET_CODE (op) == IOR ? AND : IOR,
1395 on OP0 and OP1. CODE is currently one of PLUS, MULT, AND, IOR, XOR,
1979 case IOR:
2061 return simplify_gen_binary (IOR, mode,
2071 the IOR as a PLUS and we can associate. This is valid if OP1
2123 convert them into an IOR. This helps to detect rotation encoded
2129 return (simplify_gen_binary (IOR, mode, op0, op1));
2273 if (GET_CODE (op0) == IOR
[all...]
H A Dsched-vis.c174 case IOR:
H A Difcvt.c1002 target = expand_simple_binop (mode, IOR,
1959 if (GET_CODE (a) == IOR || GET_CODE (a) == XOR)
1970 if (GET_CODE (a) == IOR)
1976 result = simplify_gen_binary (IOR, mode, x, result);
H A Dread-rtl.c1703 /* Syntactic sugar for AND and IOR, allowing Lisp-like
1706 || GET_CODE (return_rtx) == IOR))
1720 for THINGs which are dyadic expressions, e.g. AND, IOR. */
H A Dflow.c3232 /* Logical arithmetic on predicate conditions. IOR, NOT and AND.
3262 case IOR:
3370 case IOR:
3469 case IOR:
H A Dcse.c2601 case IOR:
4180 equivalent to an IOR with a constant. If so, we may be able to
4185 rtx y = lookup_as_function (folded_arg0, IOR);
4334 case IOR: case AND: case XOR:
H A Doptabs.c5247 ior_optab = init_optab (IOR);
6027 case IOR:
6122 case IOR:
H A Drtlanal.c3616 case XOR: case IOR:
4126 case IOR: case AND: case XOR:
H A Dgenrecog.c250 case IOR:
H A Dbuiltins.c6320 target = expand_builtin_sync_operation (mode, arglist, IOR,
6392 target = expand_builtin_sync_operation (mode, arglist, IOR,
H A Dexpmed.c1980 comb = expand_simple_binop (dmode, IOR, v1, v2, NULL,
2262 do it as the IOR of two shifts. I.e., to rotate A
2269 shift (similarly if IOR could not be done). We will allow
H A Dreload1.c2505 case AND: case IOR: case XOR:
H A Ddwarf2out.c1686 case IOR:
/freebsd-11-stable/contrib/gcc/config/arm/
H A Darm.c1655 case IOR:
1668 IOR, AND, XOR, MINUS;
1811 case IOR:
2088 case IOR:
2090 /* If we have IOR or XOR, and the constant can be loaded in a
4368 case IOR:
4511 case AND: case XOR: case IOR:
4753 case AND: case XOR: case IOR:
6781 if (GET_CODE (x) == IOR
6805 || GET_CODE (x) == AND || GET_CODE (x) == IOR
[all...]
/freebsd-11-stable/contrib/gcc/config/s390/
H A Ds390.c1252 /* Check whether OPERANDS are OK for a logical operation (AND, IOR, XOR). */
2130 case IOR:
4203 cmpv = force_reg (SImode, expand_simple_binop (SImode, IOR, cmp, val,
4211 newv = force_reg (SImode, expand_simple_binop (SImode, IOR, new, val,
4290 new = expand_simple_binop (SImode, IOR, new, val,
4295 case IOR:
/freebsd-11-stable/contrib/gcc/config/sparc/
H A Dsparc.c6805 case IOR: fputs ("or", file); break;
6815 case IOR: fputs ("orn", file); break;
7496 case IOR:
8501 case IOR:
/freebsd-11-stable/contrib/gcc/config/rs6000/
H A Drs6000.c10628 else if (code == IOR)
12284 case IOR:
18816 || ((outer_code == IOR || outer_code == XOR)
18854 || outer_code == IOR
18867 if ((outer_code == IOR || outer_code == XOR)
18877 || outer_code == IOR
19016 if (outer_code == AND || outer_code == IOR || outer_code == XOR)
19024 case IOR:
/freebsd-11-stable/contrib/gcc/config/i386/
H A Di386.c11337 tmp = expand_simple_binop (mode, IOR,
11457 out = expand_simple_binop (mode, IOR,
18049 case IOR:
18810 i0 = expand_simple_binop (Pmode, IOR, i0, i1, i0, 1, OPTAB_DIRECT);
18942 val = expand_simple_binop (wsmode, IOR, val, x, x, 1, OPTAB_LIB_WIDEN);
19123 var = expand_simple_binop (HImode, IOR, var, x, var,
19241 word = expand_simple_binop (word_mode, IOR, word, elt,
/freebsd-11-stable/contrib/gcc/config/ia64/
H A Dia64.c5463 else if (GET_CODE (src) == IOR)
5702 case MOD: case UDIV: case UMOD: case AND: case IOR:
/freebsd-11-stable/contrib/gcc/config/mips/
H A Dmips.c2201 an IOR or PLUS operation. */
2224 codes[i].code = IOR;
2633 case IOR:
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp5932 SDValue IOR = DAG.getNode(ISD::OR, SDLoc(N0), VT, N0.getOperand(0), N1); local
5933 AddToWorklist(IOR.getNode());
5934 return DAG.getNode(ISD::AND, SDLoc(N), VT, COR, IOR);

Completed in 768 milliseconds