Home
last modified time | relevance | path

Searched refs:I2 (Results 1 – 25 of 77) sorted by relevance

1234

/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCopyToCombine.cpp94 void combine(MachineInstr &I1, MachineInstr &I2,
98 bool isSafeToMoveTogether(MachineInstr &I1, MachineInstr &I2,
259 MachineInstr &I2, in isSafeToMoveTogether() argument
263 Register I2UseReg = UseReg(I2.getOperand(1)); in isSafeToMoveTogether()
277 MachineBasicBlock::reverse_iterator I = ++I2.getIterator().getReverse(); in isSafeToMoveTogether()
286 if (I2.killsRegister(I2UseReg, /*TRI=*/nullptr)) in isSafeToMoveTogether()
316 removeKillInfo(I2, KilledOperand); in isSafeToMoveTogether()
326 MachineBasicBlock::iterator I(I1), End(I2); in isSafeToMoveTogether()
329 End = std::next(MachineBasicBlock::iterator(I2)); in isSafeToMoveTogether()
505 MachineInstr *I2 = findPairable(I1, DoInsertAtI1, OptForSize); in runOnMachineFunction() local
[all …]
H A DHexagonVectorLoopCarriedReuse.cpp205 DepChain *getDepChainBtwn(Instruction *I1, Instruction *I2, int Iters);
206 bool isEquivalentOperation(Instruction *I1, Instruction *I2);
324 Instruction *I2) { in isEquivalentOperation() argument
325 if (!I1->isSameOperationAs(I2)) in isEquivalentOperation()
332 if (CallInst *C2 = dyn_cast<CallInst>(I2)) { in isEquivalentOperation()
340 if (I1->getType()->isVectorTy() && I2->getType()->isVectorTy()) { in isEquivalentOperation()
344 ConstantInt *C2 = dyn_cast<ConstantInt>(I2->getOperand(i)); in isEquivalentOperation()
638 Instruction *I2, in getDepChainBtwn() argument
641 if (D->front() == I1 && D->back() == I2 && D->iterations() == Iters) in getDepChainBtwn()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DAliasAnalysisEvaluator.cpp131 for (auto I2 = Pointers.begin(); I2 != I1; ++I2) { in runInternal() local
133 LocationSize::precise(DL.getTypeStoreSize(I2->second)); in runInternal()
134 AliasResult AR = AA.alias(I1->first, Size1, I2->first, Size2); in runInternal()
137 PrintResults(AR, PrintNoAlias, *I1, *I2, F.getParent()); in runInternal()
141 PrintResults(AR, PrintMayAlias, *I1, *I2, F.getParent()); in runInternal()
145 PrintResults(AR, PrintPartialAlias, *I1, *I2, F.getParent()); in runInternal()
149 PrintResults(AR, PrintMustAlias, *I1, *I2, F.getParent()); in runInternal()
186 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) { in runInternal() local
188 MemoryLocation::get(cast<StoreInst>(*I2))); in runInternal()
191 PrintLoadStoreResults(AR, PrintNoAlias, *I1, *I2, F.getParent()); in runInternal()
[all …]
H A DPostDominators.cpp55 const Instruction *I2) const { in dominates()
56 assert(I1 && I2 && "Expecting valid I1 and I2"); in dominates()
59 const BasicBlock *BB2 = I2->getParent(); in dominates()
65 if (isa<PHINode>(I1) && isa<PHINode>(I2)) in dominates()
70 for (; &*I != I1 && &*I != I2; ++I) in dominates()
73 return &*I == I2; in dominates()
H A DInlineOrder.cpp208 const auto I2 = Priorities.find(R); in hasLowerPriority() local
209 assert(I1 != Priorities.end() && I2 != Priorities.end()); in hasLowerPriority()
210 return PriorityT::isMoreDesirable(I2->second, I1->second); in hasLowerPriority()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DInstruction.cpp787 bool Instruction::hasSameSpecialState(const Instruction *I2, in hasSameSpecialState() argument
790 assert(I1->getOpcode() == I2->getOpcode() && in hasSameSpecialState()
794 return AI->getAllocatedType() == cast<AllocaInst>(I2)->getAllocatedType() && in hasSameSpecialState()
795 (AI->getAlign() == cast<AllocaInst>(I2)->getAlign() || in hasSameSpecialState()
798 return LI->isVolatile() == cast<LoadInst>(I2)->isVolatile() && in hasSameSpecialState()
799 (LI->getAlign() == cast<LoadInst>(I2)->getAlign() || in hasSameSpecialState()
801 LI->getOrdering() == cast<LoadInst>(I2)->getOrdering() && in hasSameSpecialState()
802 LI->getSyncScopeID() == cast<LoadInst>(I2)->getSyncScopeID(); in hasSameSpecialState()
804 return SI->isVolatile() == cast<StoreInst>(I2)->isVolatile() && in hasSameSpecialState()
805 (SI->getAlign() == cast<StoreInst>(I2)->getAlign() || in hasSameSpecialState()
[all …]
H A DDominators.cpp345 Instruction *I2) const { in findNearestCommonDominator()
347 BasicBlock *BB2 = I2->getParent(); in findNearestCommonDominator()
349 return I1->comesBefore(I2) ? I1 : I2; in findNearestCommonDominator()
353 return I2; in findNearestCommonDominator()
358 return I2; in findNearestCommonDominator()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DAPSInt.h319 static bool isSameValue(const APSInt &I1, const APSInt &I2) { in isSameValue() argument
320 return !compareValues(I1, I2); in isSameValue()
324 static int compareValues(const APSInt &I1, const APSInt &I2) { in compareValues() argument
325 if (I1.getBitWidth() == I2.getBitWidth() && I1.isSigned() == I2.isSigned()) in compareValues()
326 return I1.IsUnsigned ? I1.compare(I2) : I1.compareSigned(I2); in compareValues()
329 if (I1.getBitWidth() > I2.getBitWidth()) in compareValues()
330 return compareValues(I1, I2.extend(I1.getBitWidth())); in compareValues()
331 if (I2.getBitWidth() > I1.getBitWidth()) in compareValues()
332 return compareValues(I1.extend(I2.getBitWidth()), I2); in compareValues()
337 assert(!I2.isSigned() && "Expected signed mismatch"); in compareValues()
[all …]
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DIdenticalExprChecker.cpp138 while (const IfStmt *I2 = dyn_cast_or_null<IfStmt>(Else)) { in VisitIfStmt() local
139 const Expr *Cond2 = I2->getCond(); in VisitIfStmt()
148 Else = I2->getElse(); in VisitIfStmt()
333 Expr::const_child_iterator I2 = Expr2->child_begin(); in isIdenticalStmt() local
334 while (I1 != Expr1->child_end() && I2 != Expr2->child_end()) { in isIdenticalStmt()
335 if (!*I1 || !*I2 || !isIdenticalStmt(Ctx, *I1, *I2, IgnoreSideEffects)) in isIdenticalStmt()
338 ++I2; in isIdenticalStmt()
344 if (I2 != Expr2->child_end()) in isIdenticalStmt()
440 CompoundStmt::const_body_iterator I2 = CompStmt2->body_begin(); in isIdenticalStmt() local
441 while (I1 != CompStmt1->body_end() && I2 != CompStmt2->body_end()) { in isIdenticalStmt()
[all …]
/freebsd/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-s390x.pl226 my ($I0, $I1, $I2, $I3, $I4) = map("%v$_",(5..9));
518 vperm ($I2,$T3,$T4,$bswapmi);
523 veslg ($I2,$I2,28); # >>4
527 vn ($I2,$I2,$mask26);
537 verimg ($I2,$T2,$mask26,60); # >>4
559 vaf ($H2,$H2,$I2);
565 vmalef ($ACC0,$I2,$S3,$ACC0);
566 vmalef ($ACC1,$I2,$S4,$ACC1);
567 vmalef ($ACC2,$I2,$R0,$ACC2);
568 vmalef ($ACC3,$I2,$R1,$ACC3);
[all …]
H A Dpoly1305-ppc.pl766 my ($I0, $I1, $I2, $I3, $I4) = map("v$_",(5..9));
1010 my ($R3,$S3,$R4,$S4)=($I1,$I2,$I3,$I4);
1353 vperm $I2,$T1,$T2,$I2perm # 0x...0e0f0001...1e1f1011
1358 vsrd $I2,$I2,$_4
1363 vand $I2,$I2,$mask26
1383 vmrgow $I2,$T2,$I2
1437 vmuleuw $ACC4,$I2,$R2
1440 vmuleuw $T0,$I2,$R1
1447 vaddudm $H2,$H2,$I2
1457 vmuleuw $T0,$I2,$R0
[all …]
/freebsd/crypto/openssl/crypto/modes/asm/
H A Dghashv8-armx.pl435 $I1,$I2,$I3,$H3,$H34,$H4,$Yl,$Ym,$Yh) = map("q$_",(4..7,15..23));
457 vext.8 $I2,$j2,$j2,#8
465 vpmull.p64 $t0,$H2,$I2 @ H^2·Ii+2
466 veor $j2,$j2,$I2
467 vpmull2.p64 $I2,$H2,$I2
471 veor $Yh,$Yh,$I2
508 vext.8 $I2,$j2,$j2,#8
524 vpmull.p64 $t0,$H2,$I2 @ H^2·Ii+2
525 veor $j2,$j2,$I2
526 vpmull2.p64 $I2,$H2,$I2
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dalgorithm27 template <class I1, class I2>
33 template <class I1, class I2, class O>
39 template <class I1, class I2>
64 template<class I1, class I2>
65 using mismatch_result = in_in_result<I1, I2>;
67 template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2,
69 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
71 …mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2…
161 template<class I1, class I2, class O>
162 …using binary_transform_result = in_in_out_result<I1, I2, O>; …
[all …]
/freebsd/contrib/llvm-project/llvm/lib/MCA/Stages/
H A DInstructionTables.cpp53 for (unsigned I2 = 0, E2 = SubUnit.NumUnits; I2 < E2; ++I2) { in execute() local
54 ResourceRef ResourceUnit = std::make_pair(SubUnitIdx, 1U << I2); in execute()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZInstrFormats.td212 bits<4> I2;
217 let Inst{3-0} = I2;
241 bits<16> I2;
246 let Inst{15-0} = I2;
283 bits<16> I2;
289 let Inst{31-16} = I2;
320 bits<8> I2;
328 let Inst{15-8} = I2;
339 bits<16> I2;
344 let Inst{31-16} = I2;
[all …]
H A DSystemZInstrInfo.td290 def CallBRASL_XPLINK64 : Alias<8, (outs), (ins pcrel32:$I2, variable_ops),
291 [(z_call pcrel32:$I2)]>;
318 def CallBRASL : Alias<6, (outs), (ins pcrel32:$I2, variable_ops),
319 [(z_call pcrel32:$I2)]>;
327 def TLS_GDCALL : Alias<6, (outs), (ins tlssym:$I2, variable_ops),
328 [(z_tls_gdcall tglobaltlsaddr:$I2)]>;
329 def TLS_LDCALL : Alias<6, (outs), (ins tlssym:$I2, variable_ops),
330 [(z_tls_ldcall tglobaltlsaddr:$I2)]>;
337 def CallJG : Alias<6, (outs), (ins pcrel32:$I2),
338 [(z_sibcall pcrel32:$I2)]>;
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFAdjustOpt.cpp323 for (auto &I2 : *Inst->getParent()) { in avoidSpeculation()
324 if (isa<CallInst>(&I2)) in avoidSpeculation()
326 if (isa<LoadInst>(&I2) || isa<StoreInst>(&I2)) in avoidSpeculation()
328 if (&I2 == Inst) in avoidSpeculation()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64SchedThunderX3T110.td78 // Branch micro-ops on ports I2/I3.
81 // Branch micro-ops on ports I1/I2/I3.
84 // Integer micro-ops on ports I0/I1/I2.
87 // Integer micro-ops on ports I0/I1/I2/I3.
157 // 1 cycle on I2/I3
163 // 8 cycles on I2/I3
169 // 1 cycle on I1/I2/I3
175 // 8 cycles on I1/I2/I3
181 // 1 cycle on I0/I1/I2/I3.
187 // 2 cycles on I0/I1/I2/I
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp221 auto *I2 = dyn_cast<VPInstruction>(V2); in getLAScore() local
223 if (!I1 || !I2) in getLAScore()
227 return (unsigned)areConsecutiveOrMatch(I1, I2, IAI); in getLAScore()
231 for (unsigned J = 0, EV2 = I2->getNumOperands(); J < EV2; ++J) in getLAScore()
233 getLAScore(I1->getOperand(I), I2->getOperand(J), MaxLevel - 1, IAI); in getLAScore()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86OptimizeLEAs.cpp633 auto I2 = std::next(I1); in removeRedundantLEAs() local
634 while (I2 != List.end()) { in removeRedundantLEAs()
635 MachineInstr &Last = **I2; in removeRedundantLEAs()
645 ++I2; in removeRedundantLEAs()
701 I2 = List.erase(I2); in removeRedundantLEAs()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DTLSVariableHoist.cpp186 Instruction *I2) { in getDomInst()
188 return I2; in getDomInst()
189 return DT->findNearestCommonDominator(I1, I2); in getDomInst()
187 getDomInst(Instruction * I1,Instruction * I2) getDomInst() argument
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DDeadArgumentElimination.cpp238 I2 = NF->arg_begin(); in deleteDeadVarargs() local
239 I != E; ++I, ++I2) { in deleteDeadVarargs()
241 I->replaceAllUsesWith(&*I2); in deleteDeadVarargs()
242 I2->takeName(&*I); in deleteDeadVarargs()
1019 I2 = NF->arg_begin(); in removeDeadStuffFromFunction() local
1024 I->replaceAllUsesWith(&*I2); in removeDeadStuffFromFunction()
1025 I2->takeName(&*I); in removeDeadStuffFromFunction()
1026 ++I2; in removeDeadStuffFromFunction()
H A DArgumentPromotion.cpp311 Function::arg_iterator I2 = NF->arg_begin(); in doPromotion() local
316 Arg.replaceAllUsesWith(&*I2); in doPromotion()
317 I2->takeName(&Arg); in doPromotion()
318 ++I2; in doPromotion()
346 Argument *NewArg = I2++; in doPromotion()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenRegisters.cpp1018 for (auto I2 = I.base(), E2 = RegClasses.end(); I2 != E2; ++I2) { in computeSubClasses() local
1019 CodeGenRegisterClass &SubRC = *I2; in computeSubClasses()
1030 for (auto I2 = std::next(I); I2 != E && testSubClass(&RC, &*I2); ++I2) in computeSubClasses() local
1031 RC.SubClasses.set(I2->EnumValue); in computeSubClasses()
1532 for (auto I2 : SRM2) { in computeComposites() local
1533 CodeGenSubRegIndex *Idx2 = I2.first; in computeComposites()
1534 CodeGenRegister *Reg3 = I2.second; in computeComposites()
2443 for (auto I2 = RegClasses.begin(), E2 = std::next(FirstNewRC); I2 != E2; in computeInferredRegisterClasses() local
2444 ++I2) in computeInferredRegisterClasses()
2445 inferMatchingSuperRegClass(&*I2, E2); in computeInferredRegisterClasses()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64PostLegalizerLowering.cpp1144 MachineInstr *I2 = getDefIgnoringCopies(MI.getOperand(2).getReg(), MRI); in matchExtMulToMULL() local
1149 unsigned I2Opc = I2->getOpcode(); in matchExtMulToMULL()
1154 (MRI.getType(I2->getOperand(0).getReg()).getScalarSizeInBits() == in matchExtMulToMULL()
1155 MRI.getType(I2->getOperand(1).getReg()).getScalarSizeInBits() * 2)) { in matchExtMulToMULL()
1174 MachineInstr *I2 = getDefIgnoringCopies(MI.getOperand(2).getReg(), MRI); in applyExtMulToMULL() local
1178 unsigned I2Opc = I2->getOpcode(); in applyExtMulToMULL()
1183 (MRI.getType(I2->getOperand(0).getReg()).getScalarSizeInBits() == in applyExtMulToMULL()
1184 MRI.getType(I2->getOperand(1).getReg()).getScalarSizeInBits() * 2)) { in applyExtMulToMULL()
1190 {I1->getOperand(1).getReg(), I2->getOperand(1).getReg()}); in applyExtMulToMULL()

1234