Home
last modified time | relevance | path

Searched refs:NewE (Results 1 – 14 of 14) sorted by relevance

/external/llvm/lib/Support/
DScaledNumber.cpp169 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/swiftshader/third_party/llvm-7.0/llvm/lib/Support/
DScaledNumber.cpp169 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/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Coroutines/
DCoroSplit.cpp175 auto *NewE = cast<IntrinsicInst>(VMap[End]); in replaceFallthroughCoroEnd() local
176 ReturnInst::Create(NewE->getContext(), nullptr, NewE); in replaceFallthroughCoroEnd()
179 auto *BB = NewE->getParent(); in replaceFallthroughCoroEnd()
180 BB->splitBasicBlock(NewE); in replaceFallthroughCoroEnd()
/external/clang/lib/StaticAnalyzer/Checkers/
DDynamicTypePropagation.cpp105 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/
DLazyCallGraphTest.cpp507 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/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp642 const LazyCallGraph::Edge &NewE = (*A)[D]; in TEST() local
643 EXPECT_TRUE(NewE); in TEST()
644 EXPECT_TRUE(NewE.isCall()); in TEST()
645 EXPECT_EQ(&D, &NewE.getNode()); in TEST()
667 EXPECT_FALSE(NewE.isCall()); in TEST()
688 EXPECT_TRUE(NewE.isCall()); in TEST()
/external/llvm/lib/Target/Hexagon/
DHexagonGenInsert.cpp796 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()
DHexagonCommonGEP.cpp642 NodeVect::iterator NewE = std::remove_if(Nodes.begin(), Nodes.end(), in common() local
644 Nodes.resize(std::distance(Nodes.begin(), NewE)); in common()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DHexagonGenInsert.cpp835 iterator NewE = std::upper_bound(NewB, E, VR, RCB); in findRecordInsertForms() local
843 for (iterator I = NewE; I != E; ++I) in findRecordInsertForms()
846 B = NewB, E = NewE; in findRecordInsertForms()
DHexagonCommonGEP.cpp662 NodeVect::iterator NewE = remove_if(Nodes, in_set(Erase)); in common() local
663 Nodes.resize(std::distance(Nodes.begin(), NewE)); in common()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/
DPartialInlining.cpp971 BasicBlock *NewE = cast<BasicBlock>(VMap[E]); in FunctionCloner() local
972 ClonedOI->ReturnBlockPreds.push_back(NewE); in FunctionCloner()
/external/llvm/lib/MC/MCParser/
DAsmParser.cpp1061 const MCExpr *NewE = getTargetParser().applyModifierToExpr(E, Variant, Ctx); in applyModifierToExpr() local
1062 if (NewE) in applyModifierToExpr()
1063 return NewE; in applyModifierToExpr()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/MC/MCParser/
DAsmParser.cpp1267 const MCExpr *NewE = getTargetParser().applyModifierToExpr(E, Variant, Ctx); in applyModifierToExpr() local
1268 if (NewE) in applyModifierToExpr()
1269 return NewE; in applyModifierToExpr()
/external/clang/lib/Sema/
DSemaOverload.cpp1115 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()