| /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()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | IdenticalExprChecker.cpp | 332 Expr::const_child_iterator I1 = Expr1->child_begin(); in isIdenticalStmt() local
439 CompoundStmt::const_body_iterator I1 = CompStmt1->body_begin(); in isIdenticalStmt() local
470 llvm::APInt I1 = IntLit1->getValue(); in isIdenticalStmt() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCopyToCombine.cpp | 258 bool HexagonCopyToCombine::isSafeToMoveTogether(MachineInstr &I1, in isSafeToMoveTogether()
485 MachineInstr &I1 = *MI++; in runOnMachineFunction() local
520 MachineInstr *HexagonCopyToCombine::findPairable(MachineInstr &I1, in findPairable()
569 void HexagonCopyToCombine::combine(MachineInstr &I1, MachineInstr &I2, in combine()
|
| H A D | HexagonVectorLoopCarriedReuse.cpp | 323 bool HexagonVectorLoopCarriedReuse::isEquivalentOperation(Instruction *I1, in isEquivalentOperation() argument
637 DepChain *HexagonVectorLoopCarriedReuse::getDepChainBtwn(Instruction *I1, in getDepChainBtwn() argument
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/MCA/Stages/ |
| H A D | InstructionTables.cpp | 49 for (unsigned I1 = 0; I1 < NumUnits; ++I1) { in execute() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | DXILABI.h | 31 I1, enumerator
77 I1, enumerator
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | AliasAnalysisEvaluator.cpp | 129 for (auto I1 = Pointers.begin(), E = Pointers.end(); I1 != E; ++I1) { in runInternal() local
184 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end(); in runInternal() local
|
| H A D | PostDominators.cpp | 54 bool PostDominatorTree::dominates(const Instruction *I1, in dominates()
|
| H A D | InlineOrder.cpp | 207 const auto I1 = Priorities.find(L); in hasLowerPriority() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CodeMoverUtils.cpp | 231 bool llvm::isControlFlowEquivalent(const Instruction &I0, const Instruction &I1, in isControlFlowEquivalent()
482 bool llvm::isReachedBefore(const Instruction *I0, const Instruction *I1, in isReachedBefore()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | TLSVariableHoist.cpp | 186 getDomInst(Instruction * I1,Instruction * I2) getDomInst() argument
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Dominators.cpp | 344 Instruction *DominatorTree::findNearestCommonDominator(Instruction *I1, in findNearestCommonDominator() argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/MCTargetDesc/ |
| H A D | ARMTargetStreamer.cpp | 75 const unsigned I1 = LittleEndian ? II + 1 : II + 0; in emitInst() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/ |
| H A D | DXILOpBuilder.cpp | 31 I1 = 1 << 4, enumerator
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 271 static bool lowestStartPoint(const IntervalInfo &I1, in lowestStartPoint()
278 static bool lowestEndPoint(const IntervalInfo &I1, in lowestEndPoint()
|
| H A D | ComplexDeinterleavingPass.cpp | 572 Value *I1 = Imag->getOperand(1); in identifyNodeWithImplicitAdd() local
701 Value *I1 = ImagMulI->getOperand(1); in identifyPartialMul() local
871 auto *I1 = Imag->getOperand(1); in identifySymmetricOperation() local
|
| H A D | BranchFolding.cpp | 331 MachineBasicBlock::iterator &I1, in ComputeCommonTailLength()
546 MachineBasicBlock::iterator &I1, in ProfitableToMerge()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 220 auto *I1 = dyn_cast<VPInstruction>(V1); in getLAScore() local
|
| /freebsd/libexec/getty/ |
| H A D | gettytab.h | 119 #define I1 gettynums[17].value macro
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86OptimizeLEAs.cpp | 630 auto I1 = List.begin(); in removeRedundantLEAs() local
|
| /freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | aarch32.cpp | 74 uint32_t I1 = ~((Lo ^ (Hi << 3)) << 10) & 0x00800000; decodeImmBT4BlT1BlxT2_J1J2() local
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
| H A D | MappedBlockStream.cpp | 39 return std::make_pair(std::max(I1.first, I2.first), in intersect() argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCalls.cpp | 1189 Value *I0 = II->getArgOperand(0), *I1 = II->getArgOperand(1); in foldClampRangeOfTwo() local
1467 foldMinimumOverTrailingOrLeadingZeroCount(Value *I0, Value *I1, in foldMinimumOverTrailingOrLeadingZeroCount()
1694 Value *I0 = II->getArgOperand(0), *I1 = II->getArgOperand(1); in visitCallInst() local
1716 Value *I0 = II->getArgOperand(0), *I1 = II->getArgOperand(1); in visitCallInst() local
1737 Value *I0 = II->getArgOperand(0), *I1 = II->getArgOperand(1); in visitCallInst() local
|
| /freebsd/contrib/llvm-project/llvm/lib/SandboxIR/ |
| H A D | SandboxIR.cpp | 389 [](auto *I1, auto *I2) { return I1->comesBefore(I2); }) && in moveBefore()
400 [](auto *I1, auto *I2) { return I1->comesBefore(I2); }) && in insertBefore()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/ |
| H A D | AArch64PostLegalizerLowering.cpp | 1143 MachineInstr *I1 = getDefIgnoringCopies(MI.getOperand(1).getReg(), MRI); in matchExtMulToMULL() local
1173 MachineInstr *I1 = getDefIgnoringCopies(MI.getOperand(1).getReg(), MRI); in applyExtMulToMULL() local
|