HomeSort by relevance Sort by last modified time
    Searched defs:NextI (Results 1 - 9 of 9) sorted by null

  /external/llvm/lib/Object/
SymbolSize.cpp 84 unsigned NextI = I + 1;
85 while (NextI < N && Addresses[NextI].Address == P.Address)
86 ++NextI;
88 uint64_t Size = Addresses[NextI].Address - P.Address;
  /external/llvm/lib/Target/Hexagon/
HexagonGenExtract.cpp 224 BasicBlock::iterator I = std::prev(B->end()), NextI, Begin = B->begin();
230 NextI = std::prev(I);
238 I = NextI;
HexagonGenMux.cpp 198 MachineBasicBlock::iterator NextI, End = B.end();
199 for (MachineBasicBlock::iterator I = B.begin(); I != End; I = NextI) {
201 NextI = std::next(I);
HexagonEarlyIfConv.cpp 762 MachineBasicBlock::iterator I, NextI;
764 for (I = FromB->begin(); I != End; I = NextI) {
766 NextI = std::next(I);
    [all...]
HexagonExpandCondsets.cpp 740 MachineBasicBlock::iterator I, E, NextI;
741 for (I = B.begin(), E = B.end(); I != E; I = NextI) {
742 NextI = std::next(I);
    [all...]
HexagonVLIWPacketizer.cpp 203 auto NextI = std::next(MI);
208 MI = NextI;
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64LoadStoreOptimizer.cpp 575 MachineBasicBlock::iterator NextI = I;
576 ++NextI;
577 // If NextI is the second of the two instructions to be merged, we need
581 if (NextI == Paired)
582 ++NextI;
714 return NextI;
800 return NextI;
    [all...]
  /external/llvm/lib/Transforms/Scalar/
MemCpyOptimizer.cpp 291 range_iterator NextI = I;
292 while (++NextI != Ranges.end() && End >= NextI->Start) {
294 I->TheStores.append(NextI->TheStores.begin(), NextI->TheStores.end());
295 if (NextI->End > I->End)
296 I->End = NextI->End;
297 Ranges.erase(NextI);
298 NextI = I;
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp     [all...]

Completed in 204 milliseconds