Searched refs:NewE (Results 1 – 7 of 7) sorted by relevance
/external/llvm/lib/Support/ |
D | ScaledNumber.cpp | 169 int NewE = std::min(ScaledNumbers::MaxScale, E + 63 - LeadingZeros); in toStringAPFloat() local 170 int Shift = 63 - (NewE - E); in toStringAPFloat() 172 assert(Shift == LeadingZeros || NewE == ScaledNumbers::MaxScale); in toStringAPFloat() 175 E = NewE; in toStringAPFloat()
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
D | DynamicTypePropagation.cpp | 105 void checkPostStmt(const CXXNewExpr *NewE, CheckerContext &C) const; 294 void DynamicTypePropagation::checkPostStmt(const CXXNewExpr *NewE, in checkPostStmt() argument 296 if (NewE->isArray()) in checkPostStmt() 300 const MemRegion *MR = C.getSVal(NewE).getAsRegion(); in checkPostStmt() 304 C.addTransition(setDynamicTypeInfo(C.getState(), MR, NewE->getType(), in checkPostStmt()
|
/external/llvm/unittests/Analysis/ |
D | LazyCallGraphTest.cpp | 507 const LazyCallGraph::Edge &NewE = A[D]; in TEST() local 508 EXPECT_TRUE(NewE); in TEST() 509 EXPECT_TRUE(NewE.isCall()); in TEST() 510 EXPECT_EQ(&D, NewE.getNode()); in TEST() 528 EXPECT_FALSE(NewE.isCall()); in TEST() 545 EXPECT_TRUE(NewE.isCall()); in TEST()
|
/external/llvm/lib/Target/Hexagon/ |
D | HexagonGenInsert.cpp | 796 iterator NewE = std::upper_bound(NewB, E, VR, RCB); in findRecordInsertForms() local 804 for (iterator I = NewE; I != E; ++I) in findRecordInsertForms() 807 B = NewB, E = NewE; in findRecordInsertForms()
|
D | HexagonCommonGEP.cpp | 642 NodeVect::iterator NewE = std::remove_if(Nodes.begin(), Nodes.end(), in common() local 644 Nodes.resize(std::distance(Nodes.begin(), NewE)); in common()
|
/external/llvm/lib/MC/MCParser/ |
D | AsmParser.cpp | 1061 const MCExpr *NewE = getTargetParser().applyModifierToExpr(E, Variant, Ctx); in applyModifierToExpr() local 1062 if (NewE) in applyModifierToExpr() 1063 return NewE; in applyModifierToExpr()
|
/external/clang/lib/Sema/ |
D | SemaOverload.cpp | 1115 NewE = New->specific_attr_end<EnableIfAttr>(), in IsOverload() 1118 NewI != NewE || OldI != OldE; ++NewI, ++OldI) { in IsOverload() 1119 if (NewI == NewE || OldI == OldE) in IsOverload()
|