| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | MultisetsImmutableEntryTest.java | 33 private static final String NE = null; field in MultisetsImmutableEntryTest
50 assertEquals("null", entry(NE, 1).toString()); in testToStringNull()
51 assertEquals("null x 2", entry(NE, 2).toString()); in testToStringNull()
64 assertEquals(control(NE, 1), entry(NE, 1)); in testEqualsNull()
65 assertFalse(control(NE, 1).equals(entry(NE, 2))); in testEqualsNull()
66 assertFalse(entry(NE, 1).equals(control("bar", 1))); in testEqualsNull()
67 assertFalse(entry(NE, 1).equals(new Object())); in testEqualsNull()
68 assertFalse(entry(NE, 1).equals(null)); in testEqualsNull()
77 assertEquals(control(NE, 1).hashCode(), entry(NE, 1).hashCode()); in testHashCodeNull()
|
| /external/clang/test/Preprocessor/ |
| D | macro_with_initializer_list.cpp | 74 #define NE(x,y) (void)(x != y) // expected-note 6{{defined here}} macro
80 NE(F,F); in test_NE()
82 NE(F,Foo()); in test_NE()
84 NE(F,Foo({1,2,3})); in test_NE()
86 NE((Foo{1,2,3}),(Foo{1,2,3})); in test_NE()
89 NE(F,Foo{1,2,3}); in test_NE()
93 NE(Foo{1,2,3},F); in test_NE()
97 NE(Foo{1,2,3},Foo{1,2,3}); in test_NE()
102 NE(Foo{1,2,3} + Foo{1,2,3}, F); in test_NE()
106 NE(F, Foo({1,2,3}) + Foo{1,2,3}); in test_NE()
[all …]
|
| /external/v8/src/parsing/ |
| D | token.h | 92 T(NE, "!=", 9) \
247 return op == NE || op == NE_STRICT; in IsInequalityOp()
258 case EQ: return NE; in NegateCompareOp()
259 case NE: return EQ; in NegateCompareOp()
276 case NE: return NE; in ReverseCompareOp()
294 case Token::NE: return (op1 != op2); in EvalComparison()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | PointerArithChecker.cpp | 51 AllocKind getKindOfNewOp(const CXXNewExpr *NE, const FunctionDecl *FD) const;
70 void checkPostStmt(const CXXNewExpr *NE, CheckerContext &C) const;
92 AllocKind PointerArithChecker::getKindOfNewOp(const CXXNewExpr *NE, in getKindOfNewOp() argument
100 if (NE->isArray()) in getKindOfNewOp()
243 void PointerArithChecker::checkPostStmt(const CXXNewExpr *NE, in checkPostStmt() argument
245 const FunctionDecl *FD = NE->getOperatorNew(); in checkPostStmt()
249 AllocKind Kind = getKindOfNewOp(NE, FD); in checkPostStmt()
252 SVal AllocedVal = State->getSVal(NE, C.getLocationContext()); in checkPostStmt()
|
| D | MallocChecker.cpp | 203 void checkPostStmt(const CXXNewExpr *NE, CheckerContext &C) const;
873 else if (const CXXNewExpr *NE = dyn_cast<CXXNewExpr>(E)) { in ProcessZeroAllocation() local
874 if (NE->isArray()) in ProcessZeroAllocation()
875 Arg = NE->getArraySize(); in ProcessZeroAllocation()
935 static bool treatUnusedNewEscaped(const CXXNewExpr *NE) { in treatUnusedNewEscaped() argument
937 const CXXConstructExpr *ConstructE = NE->getConstructExpr(); in treatUnusedNewEscaped()
941 if (!NE->getAllocatedType()->getAsCXXRecordDecl()) in treatUnusedNewEscaped()
962 void MallocChecker::checkPostStmt(const CXXNewExpr *NE, in checkPostStmt() argument
965 if (NE->getNumPlacementArgs()) in checkPostStmt()
966 for (CXXNewExpr::const_arg_iterator I = NE->placement_arg_begin(), in checkPostStmt()
[all …]
|
| /external/ltp/testcases/lib/ |
| D | tst_kvcmp.c | 27 NE, enumerator
43 return NE; in strtop()
141 case NE: in main()
182 case NE: in main()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 231 EdgeEntry &NE = getEdge(EId); in addConstructedEdge() local
234 NE.connect(*this, EId); in addConstructedEdge()
331 AdjEdgeIdSet(const NodeEntry &NE) : NE(NE) { } in AdjEdgeIdSet() argument
333 return NE.getAdjEdgeIds().begin(); in begin()
336 return NE.getAdjEdgeIds().end(); in end()
338 bool empty() const { return NE.getAdjEdgeIds().empty(); } in empty()
340 return NE.getAdjEdgeIds().size(); in size()
343 const NodeEntry &NE;
|
| /external/llvm/test/CodeGen/Mips/ |
| D | select.ll | 521 ; 32R6: selnez $[[NE:[0-9]+]], $4, $[[CCGPR]]
522 ; 32R6: or $2, $[[NE]], $[[EQ]]
536 ; 64R6: selnez $[[NE:[0-9]+]], $4, $[[CCGPR]]
537 ; 64R6: or $2, $[[NE]], $[[EQ]]
566 ; 32R6: selnez $[[NE:[0-9]+]], $4, $[[CCGPR]]
567 ; 32R6: or $2, $[[NE]], $[[EQ]]
581 ; 64R6: selnez $[[NE:[0-9]+]], $4, $[[CCGPR]]
582 ; 64R6: or $2, $[[NE]], $[[EQ]]
610 ; 32R6: selnez $[[NE:[0-9]+]], $4, $[[CCGPR]]
611 ; 32R6: or $2, $[[NE]], $[[EQ]]
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Target/MBlaze/ |
| D | MBlazeISelLowering.h | 29 NE, enumerator
39 case EQ: return NE; in getOppositeCondition()
40 case NE: return EQ; in getOppositeCondition()
52 case NE: return "ne"; in MBlazeCCToString()
|
| /external/llvm/lib/Target/ARM/MCTargetDesc/ |
| D | ARMBaseInfo.h | 31 NE, // Not equal Not equal, or unordered enumerator
50 case EQ: return NE; in getOppositeCondition()
51 case NE: return EQ; in getOppositeCondition()
71 case ARMCC::NE: return "ne"; in ARMCondCodeToString()
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceTargetLoweringARM32.def | 49 X(Une , NE , kNone, eq , none , false, true) \
57 X(Eq , false , false , EQ, EQ , NE , eq , false, false) \
58 X(Ne , false , false , NE, NE , EQ , eq , false, true) \
|
| /external/swiftshader/third_party/LLVM/lib/Target/ARM/MCTargetDesc/ |
| D | ARMBaseInfo.h | 31 NE, // Not equal Not equal, or unordered enumerator
50 case EQ: return NE; in getOppositeCondition()
51 case NE: return EQ; in getOppositeCondition()
72 case ARMCC::NE: return "ne"; in ARMCondCodeToString()
|
| /external/v8/src/base/ |
| D | logging.h | 149 DEFINE_SIGNED_MISMATCH_COMP(is_signed_vs_unsigned, NE, !CmpEQImpl(lhs, rhs))
153 DEFINE_SIGNED_MISMATCH_COMP(is_unsigned_vs_signed, NE, CmpNEImpl(rhs, lhs))
192 DEFINE_CHECK_OP_IMPL(NE, !=)
200 #define CHECK_NE(lhs, rhs) CHECK_OP(NE, !=, lhs, rhs)
|
| /external/toybox/toys/pending/ |
| D | expr.c | 132 enum { OR = 1, AND, EQ, NE, GT, GTE, LT, LTE, ADD, SUB, MUL, DIVI, MOD, RE }; enumerator
143 {"=", 3, SI_TO_I, EQ }, {"==", 3, SI_TO_I, EQ }, {"!=", 3, SI_TO_I, NE },
179 case NE: x = cmp != 0; break; in eval_op()
|
| /external/valgrind/none/tests/s390x/ |
| D | cgij.c | 21 #define NE 6 macro
132 CGIJ(7,NE,8,2a) "\n\t" /* 0x2a == 42 */ in compare_ne42()
|
| D | cij.c | 21 #define NE 6 macro
132 CIJ(7,NE,8,2a) "\n\t" /* 0x2a == 42 */ in compare_ne42()
|
| D | clgij.c | 21 #define NE 6 macro
132 CLGIJ(7,NE,8,2a) "\n\t" /* 0x2a == 42 */ in compare_ne42()
|
| D | clij.c | 21 #define NE 6 macro
132 CLIJ(7,NE,8,2a) "\n\t" /* 0x2a == 42 */ in compare_ne42()
|
| D | cgrj.c | 21 #define NE 6 macro
147 CGRJ(7,8,8,NE) "\n\t" in compare_ne()
|
| D | clgrj.c | 21 #define NE 6 macro
147 CLGRJ(7,8,8,NE) "\n\t" in compare_ne()
|
| D | clrj.c | 21 #define NE 6 macro
147 CLRJ(7,8,8,NE) "\n\t" in compare_ne()
|
| D | crj.c | 21 #define NE 6 macro
147 CRJ(7,8,8,NE) "\n\t" in compare_ne()
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTX.h | 36 NE, enumerator
144 NE, enumerator
|
| /external/one-true-awk/ |
| D | awkgram.y | 54 %token <i> AND BOR APPEND EQ GE GT LE LT NE IN
81 %nonassoc APPEND EQ GE GT LE LT NE MATCHOP IN '|'
232 | pattern NE pattern { $$ = op2($2, $1, $3); }
469 case LE: case LT: case EQ: case NE: case GT: case GE:
473 return op2(NE, n, nullnode);
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | DominanceFrontier.cpp | 78 NE = currentNode->end(); NI != NE; ++NI) { in calculate() local
|