Searched refs:NewI (Results 1 - 8 of 8) sorted by relevance
| /external/llvm/lib/MC/ |
| H A D | MCModule.cpp | 58 AtomListTy::iterator NewI = std::lower_bound(atom_begin(), atom_end(), local
60 Atoms.insert(NewI, Atom);
|
| /external/llvm/lib/CodeGen/ |
| H A D | LiveIntervalAnalysis.cpp | 859 LiveInterval::iterator NewI = LI.advanceTo(I, NewIdx.getRegSlot()); local
860 if (NewI != E && SlotIndex::isSameInstr(NewI->start, NewIdx)) {
863 assert(NewI->valno != DefVNI && "Multiple defs of value?");
869 // values. The new range should be placed immediately before NewI, move any
871 assert(NewI != I && "Inconsistent iterators");
872 std::copy(llvm::next(I), NewI, I); local
873 *llvm::prior(NewI) = LiveRange(DefVNI->def, NewIdx.getDeadSlot(), DefVNI);
929 LiveInterval::iterator NewI = LI.find(NewIdx.getRegSlot()); local
930 if (SlotIndex::isSameInstr(NewI
[all...] |
| H A D | MachineBasicBlock.cpp | 530 succ_iterator NewI = E; local
535 if (NewI != E)
539 NewI = I;
548 if (NewI == E) {
558 *getWeightIterator(NewI) += *OldWI;
|
| /external/clang/lib/Edit/ |
| H A D | EditedSource.cpp | 167 NewI = FileEdits.insert(I, std::make_pair(BeginOffs, FileEdit())); local
168 NewI->second.RemoveLen = Len;
177 NewI = FileEdits.insert(I, std::make_pair(BeginOffs, FileEdit())); local
180 TopFA = &NewI->second;
|
| /external/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAddSub.cpp | 1534 Instruction *NewI = BinaryOperator::CreateFAdd(Op0, V); local
1535 NewI->copyFastMathFlags(&I);
1536 return NewI;
1541 Instruction *NewI = BinaryOperator::CreateFAdd(Op0, NewTrunc); local
1542 NewI->copyFastMathFlags(&I);
1543 return NewI;
1548 Instruction *NewI = BinaryOperator::CreateFAdd(Op0, NewExt); local
1549 NewI->copyFastMathFlags(&I);
1550 return NewI;
|
| H A D | InstCombineLoadStoreAlloca.cpp | 265 Instruction *NewI local
270 return NewI;
|
| /external/llvm/lib/Transforms/Scalar/ |
| H A D | LoopUnswitch.cpp | 328 Value *NewI = VMap.lookup(OldInst); local
329 const SwitchInst *NewInst = cast_or_null<SwitchInst>(NewI);
|
| /external/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 7106 NewI = BackedgeDumpsNew.begin();
7107 OldI != OldE; ++OldI, ++NewI) {
7108 assert(OldI->first == NewI->first && "Loop order changed!");
7115 if (OldI->second != NewI->second &&
7117 NewI->second.find("undef") == std::string::npos &&
7119 NewI->second != "***COULDNOTCOMPUTE***") {
7123 << "' to '" << NewI->second << "'!\n";
|
Completed in 4515 milliseconds