Searched refs:NE (Results 51 - 75 of 93) sorted by relevance

1234

/freebsd-11.0-release/contrib/gcc/
H A Dexpmed.c4533 t3 = emit_store_flag (t3, NE, t2, const0_rtx,
4596 do_cmp_and_jump (adjusted_op0, const0_rtx, NE,
4631 t3 = emit_store_flag (t3, NE, t2, const0_rtx,
5174 op1 = const0_rtx, code = NE;
5190 if ((code == EQ || code == NE)
5405 && GET_MODE_CLASS (mode) == MODE_INT && (code == EQ || code == NE)
5422 /* Some other cases we can do are EQ, NE, LE, and GT comparisons with
5429 || (code != EQ && code != NE
5485 if (code == EQ || code == NE)
5487 /* For EQ or NE, on
[all...]
H A Dpredict.c809 else if (GET_CODE (cond) == NE)
815 EQ tests are usually false and NE tests are usually true. Also,
842 case NE:
1076 EQ tests are usually false and NE tests are usually true. Also,
H A Doptabs.c3864 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). It will
3911 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). */
3965 rtx temp = simplify_gen_relational (NE, word_mode, mode, x, x);
3966 equiv = simplify_gen_relational (NE, word_mode, mode, y, y);
3984 case NE:
4028 comparison = reversed_p ? EQ : NE;
5271 ne_optab = init_optab (NE);
5650 code = NE;
6005 emit_jump_insn (bcc_gen_fctn[NE] (label));
H A Dcse.c2603 case NE:
3081 operation (EQ, NE, GT, etc.), follow it back through the hash table and
3126 if (code == NE
3189 either STORE_FLAG_VALUE or zero. If this is an NE operation,
3193 || ((code == NE
4118 else if (code == NE)
4212 case NE:
4654 /* Similarly, if this is an NE comparison, and either is a SUBREG
4655 making a smaller mode, we know the whole thing is also NE. */
4661 if (code == NE
[all...]
H A Dgensupport.c1352 {"comparison_operator", false, {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU,
H A Difcvt.c829 if (code != NE && code != EQ)
1935 if (code != NE && code != EQ)
1971 result = (code == NE) ? a : NULL_RTX;
1972 else if (code == NE)
H A Drtlanal.c2160 case NE:
2271 /* Return nonzero if X contains a comparison that is not either EQ or NE,
3535 case EQ: case NE:
4264 case EQ: case NE: case GE: case GT: case LE: case LT:
4334 (1) The code will always be a comparison operation (EQ, NE, GT, etc.).
4469 || (((code == NE
H A Dexpr.c575 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
8373 comparison_code = unsignedp ? NE : GT;
9127 code = NE;
9199 if ((code == NE || code == EQ)
9204 return expand_expr (fold_single_bit_test (code == NE ? NE_EXPR : EQ_EXPR,
9222 else if (! only_cheap && (code == NE || code == EQ)
H A Dpostreload.c1395 && GET_CODE (cnd) == NE
H A Dgenattrtab.c833 case NE: case EQ:
3174 case EQ: case NE:
3188 case NE:
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp534 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
544 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ)
H A DHexagonISelDAGToDAG.cpp777 unsigned NE = OpVT.getVectorNumElements(); local
781 for (unsigned i = 0; i < NE; ++i) {
/freebsd-11.0-release/contrib/gcc/config/mips/
H A Dmips.c2562 if (((outer_code) == EQ || (outer_code) == NE)
3192 case NE:
3208 If NEED_EQ_NE_P, then only EQ/NE comparisons against zero are possible,
3212 - EQ/NE between two registers.
3225 else if (*code == EQ || *code == NE)
3247 *code = (invert ? EQ : NE);
3261 *code = mips_reverse_fp_cond_p (&cmp_code) ? EQ : NE;
3283 if (code == EQ || code == NE)
5386 't' like 'T', but with the EQ/NE cases reversed
5563 case NE
[all...]
/freebsd-11.0-release/contrib/gcc/config/i386/
H A Di386.c7796 case NE:
8196 case NE:
10158 case NE: /* ZF!=0 */
10370 return NE;
10423 case NE: /* NE - ZF=0 - fails on unordered */
10468 case NE:
10629 code = NE;
10644 code = NE;
10660 code = NE;
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExprEngine.h203 void ProcessNewAllocator(const CXXNewExpr *NE, ExplodedNode *Pred);
/freebsd-11.0-release/contrib/binutils/ld/
H A Dldexp.c79 { NE, "!=" },
366 BOP (NE, !=);
H A Dldlex.l213 <BOTH,SCRIPT,EXPRESSION,MRI>"!=" { RTOKEN(NE);}
/freebsd-11.0-release/usr.bin/xlint/lint1/
H A Dscan.l124 "!=" return (operator(T_EQOP, NE));
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Vectorize/
H A DBBVectorize.cpp2280 for (std::vector<Value *>::iterator N = NN.begin(), NE = NN.end();
2281 N != NE; ++N) {
3169 NE = II->second.end(); N != NE; ++N)
3175 NE = JJ->second.end(); N != NE; ++N)
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64FastISel.cpp2138 return AArch64CC::NE;
2355 AArch64CC::CondCode CC = AArch64CC::NE;
2453 { AArch64CC::NE, AArch64CC::VC },
2590 AArch64CC::CondCode CC = AArch64CC::NE;
3274 TmpCC = AArch64CC::NE;
3552 CC = AArch64CC::NE;
3587 CC = AArch64CC::NE;
H A DAArch64InstrInfo.cpp432 CC = AArch64CC::NE;
436 CC = AArch64CC::NE;
467 CC = AArch64CC::NE;
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/
H A DARMFastISel.cpp1238 return ARMCC::NE;
1292 unsigned CCMode = ARMCC::NE;
1330 unsigned CCMode = ARMCC::NE;
1680 .addImm(ARMCC::NE)
/freebsd-11.0-release/contrib/gcc/config/rs6000/
H A Drs6000.c9715 gcc_assert (mode != CCEQmode || code == EQ || code == NE);
10142 case NE:
10757 case NE:
11196 else if ((code == EQ || code == NE)
11227 case EQ: case UNEQ: case NE: case LTGT:
11351 if (code == NE || code == LTGT)
11352 code = NE;
11464 gcc_assert (cond_code == NE || cond_code == EQ);
11466 if (cond_code == NE)
11473 if (cond_code == NE
[all...]
H A Drs6000.h1877 /* Given a comparison code (EQ, NE, etc.) and the first operand of a
1887 : (((OP) == EQ || (OP) == NE) && COMPARISON_P (X) \
/freebsd-11.0-release/contrib/llvm/lib/Target/PowerPC/AsmParser/
H A DPPCAsmParser.cpp817 const MCExpr *NE = MCBinaryExpr::createSub(BinExpr->getRHS(), local
819 Inst.addOperand(MCOperand::createExpr(NE));

Completed in 365 milliseconds

1234