| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | IdenticalExprChecker.cpp | 138 while (const IfStmt *I2 = dyn_cast_or_null<IfStmt>(Else)) { in VisitIfStmt() local
333 Expr::const_child_iterator I2 = Expr2->child_begin(); in isIdenticalStmt() local
440 CompoundStmt::const_body_iterator I2 = CompStmt2->body_begin(); in isIdenticalStmt() local
471 llvm::APInt I2 = IntLit2->getValue(); in isIdenticalStmt() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | APSInt.h | 319 static bool isSameValue(const APSInt &I1, const APSInt &I2) { in isSameValue()
324 static int compareValues(const APSInt &I1, const APSInt &I2) { in compareValues()
|
| H A D | APInt.h | 531 static bool isSameValue(const APInt &I1, const APInt &I2) { in isSameValue()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCopyToCombine.cpp | 259 MachineInstr &I2, in isSafeToMoveTogether()
504 MachineInstr *I2 = findPairable(I1, DoInsertAtI1, OptForSize); in runOnMachineFunction() local
522 MachineBasicBlock::iterator I2 = std::next(MachineBasicBlock::iterator(I1)); in findPairable() local
568 void HexagonCopyToCombine::combine(MachineInstr &I1, MachineInstr &I2, in combine()
|
| H A D | HexagonVectorLoopCarriedReuse.cpp | 324 Instruction *I2) { in isEquivalentOperation()
638 Instruction *I2, in getDepChainBtwn()
|
| /freebsd/contrib/llvm-project/llvm/lib/MCA/Stages/ |
| H A D | InstructionTables.cpp | 53 for (unsigned I2 = 0, E2 = SubUnit.NumUnits; I2 < E2; ++I2) { in execute() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | AliasAnalysisEvaluator.cpp | 131 for (auto I2 = Pointers.begin(); I2 != I1; ++I2) { in runInternal() local
186 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) { in runInternal() local
|
| H A D | InlineOrder.cpp | 205 const auto I2 = Priorities.find(R); in hasLowerPriority() local
|
| H A D | AliasAnalysis.cpp | 714 const Instruction &I2, in canInstructionRangeModRef()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | TLSVariableHoist.cpp | 186 Instruction *I2) { in getDomInst()
|
| H A D | Reassociate.cpp | 1153 if (Instruction *I2 = dyn_cast<Instruction>(X)) in FindInOperandList() local
1162 if (Instruction *I2 = dyn_cast<Instruction>(X)) in FindInOperandList() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | DeadArgumentElimination.cpp | 238 I2 = NF->arg_begin(); in deleteDeadVarargs() local
1021 I2 = NF->arg_begin(); in removeDeadStuffFromFunction() local
|
| H A D | ArgumentPromotion.cpp | 309 Function::arg_iterator I2 = NF->arg_begin(); in doPromotion() local
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 272 const IntervalInfo &I2) { in lowestStartPoint()
279 const IntervalInfo &I2) { in lowestEndPoint()
|
| H A D | BranchFolding.cpp | 328 MachineBasicBlock::iterator &I2) { in ComputeCommonTailLength()
541 MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, in ProfitableToMerge()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 221 auto *I2 = dyn_cast<VPInstruction>(V2); in getLAScore() local
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.cpp | 998 for (auto I2 = I.base(), E2 = RegClasses.end(); I2 != E2; ++I2) { in computeSubClasses() local
1010 for (auto I2 = std::next(I); I2 != E && testSubClass(&RC, &*I2); ++I2) in computeSubClasses() local
1490 for (auto I2 : SRM2) { in computeComposites() local
2421 for (auto I2 = RegClasses.begin(), E2 = std::next(FirstNewRC); I2 != E2; in computeInferredRegisterClasses() local
|
| /freebsd/libexec/getty/ |
| H A D | gettytab.h | 121 #define I2 gettynums[18].value macro
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86OptimizeLEAs.cpp | 633 auto I2 = std::next(I1); in removeRedundantLEAs() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 1425 Instruction *I1, Instruction *I2) { in isSafeToHoistInvoke()
1500 static bool shouldHoistCommonInstructions(Instruction *I1, Instruction *I2, in shouldHoistCommonInstructions()
1605 Instruction *I2 = &*Iter; in hoistCommonCodeFromSuccessors() local
1612 Instruction *I2 = &*SuccIter; in hoistCommonCodeFromSuccessors() local
1621 Instruction *I2 = &*SuccIter; in hoistCommonCodeFromSuccessors() local
1646 Instruction *I2 = &*Pair.first; in hoistCommonCodeFromSuccessors() local
1665 auto *I2 = &*SuccIter++; in hoistCommonCodeFromSuccessors() local
1676 Instruction *I2 = &*SuccIter++; in hoistCommonCodeFromSuccessors() local
1718 auto *I2 = *OtherSuccTIs.begin(); in hoistSuccIdenticalTerminatorToSwitchOrIf() local
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
| H A D | MappedBlockStream.cpp | 38 static Interval intersect(const Interval &I1, const Interval &I2) { in intersect()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64StackTagging.cpp | 217 auto I2 = Out.find(Offset + 8); in generate() local
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.cpp | 87 auto I2 = RHS.Ranges.begin(), E2 = RHS.Ranges.end(); in contains() local
111 auto I2 = RHS.Ranges.begin(), E2 = RHS.Ranges.end(); in intersects() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/ |
| H A D | AArch64PostLegalizerLowering.cpp | 1143 MachineInstr *I2 = getDefIgnoringCopies(MI.getOperand(2).getReg(), MRI); in matchExtMulToMULL() local
1173 MachineInstr *I2 = getDefIgnoringCopies(MI.getOperand(2).getReg(), MRI); in applyExtMulToMULL() local
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Instruction.cpp | 695 bool Instruction::hasSameSpecialState(const Instruction *I2, in hasSameSpecialState()
|