/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | PostDominators.cpp | 55 const Instruction *I2) const { 56 assert(I1 && I2 && "Expecting valid I1 and I2"); 59 const BasicBlock *BB2 = I2->getParent(); 65 if (isa<PHINode>(I1) && isa<PHINode>(I2)) 68 // Loop through the basic block until we find I1 or I2. 70 for (; &*I != I1 && &*I != I2; ++I) 73 return &*I == I2;
|
H A D | AliasAnalysisEvaluator.cpp | 148 for (SetVector<Value *>::iterator I2 = Pointers.begin(); I2 != I1; ++I2) { 150 Type *I2ElTy = cast<PointerType>((*I2)->getType())->getElementType(); 154 AliasResult AR = AA.alias(*I1, I1Size, *I2, I2Size); 157 PrintResults(AR, PrintNoAlias, *I1, *I2, F.getParent()); 161 PrintResults(AR, PrintMayAlias, *I1, *I2, F.getParent()); 165 PrintResults(AR, PrintPartialAlias, *I1, *I2, F.getParent()); 169 PrintResults(AR, PrintMustAlias, *I1, *I2, F.getParent()); 206 for (SetVector<Value *>::iterator I2 [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/Stages/ |
H A D | InstructionTables.cpp | 54 for (unsigned I2 = 0, E2 = SubUnit.NumUnits; I2 < E2; ++I2) { 55 ResourceRef ResourceUnit = std::make_pair(SubUnitIdx, 1U << I2);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | IdenticalExprChecker.cpp | 138 while (const IfStmt *I2 = dyn_cast_or_null<IfStmt>(Else)) { 139 const Expr *Cond2 = I2->getCond(); 148 Else = I2->getElse(); 333 Expr::const_child_iterator I2 = Expr2->child_begin(); local 334 while (I1 != Expr1->child_end() && I2 != Expr2->child_end()) { 335 if (!*I1 || !*I2 || !isIdenticalStmt(Ctx, *I1, *I2, IgnoreSideEffects)) 338 ++I2; 344 if (I2 != Expr2->child_end()) 438 CompoundStmt::const_body_iterator I2 local 469 llvm::APInt I2 = IntLit2->getValue(); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | APSInt.h | 301 static bool isSameValue(const APSInt &I1, const APSInt &I2) { argument 302 return !compareValues(I1, I2); 306 static int compareValues(const APSInt &I1, const APSInt &I2) { argument 307 if (I1.getBitWidth() == I2.getBitWidth() && I1.isSigned() == I2.isSigned()) 308 return I1.IsUnsigned ? I1.compare(I2) : I1.compareSigned(I2); 311 if (I1.getBitWidth() > I2.getBitWidth()) 312 return compareValues(I1, I2.extend(I1.getBitWidth())); 313 if (I2 [all...] |
H A D | APInt.h | 675 static bool isSameValue(const APInt &I1, const APInt &I2) { argument 676 if (I1.getBitWidth() == I2.getBitWidth()) 677 return I1 == I2; 679 if (I1.getBitWidth() > I2.getBitWidth()) 680 return I1 == I2.zext(I1.getBitWidth()); 682 return I1.zext(I2.getBitWidth()) == I2;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | Instruction.cpp | 380 static bool haveSameSpecialState(const Instruction *I1, const Instruction *I2, argument 382 assert(I1->getOpcode() == I2->getOpcode() && 386 return AI->getAllocatedType() == cast<AllocaInst>(I2)->getAllocatedType() && 387 (AI->getAlignment() == cast<AllocaInst>(I2)->getAlignment() || 390 return LI->isVolatile() == cast<LoadInst>(I2)->isVolatile() && 391 (LI->getAlignment() == cast<LoadInst>(I2)->getAlignment() || 393 LI->getOrdering() == cast<LoadInst>(I2)->getOrdering() && 394 LI->getSyncScopeID() == cast<LoadInst>(I2)->getSyncScopeID(); 396 return SI->isVolatile() == cast<StoreInst>(I2)->isVolatile() && 397 (SI->getAlignment() == cast<StoreInst>(I2) [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonCopyToCombine.cpp | 96 void combine(MachineInstr &I1, MachineInstr &I2, 100 bool isSafeToMoveTogether(MachineInstr &I1, MachineInstr &I2, 261 /// isSafeToMoveTogether - Returns true if it is safe to move I1 next to I2 such 264 MachineInstr &I2, 268 Register I2UseReg = UseReg(I2.getOperand(1)); 270 // It is not safe to move I1 and I2 into one combine if I2 has a true 277 // First try to move I2 towards I1. 279 // A reverse_iterator instantiated like below starts before I2, and I1 281 // Look at instructions I in between I2 an 263 isSafeToMoveTogether(MachineInstr &I1, MachineInstr &I2, unsigned I1DestReg, unsigned I2DestReg, bool &DoInsertAtI1) argument 509 MachineInstr *I2 = findPairable(I1, DoInsertAtI1, OptForSize); local 527 MachineBasicBlock::iterator I2 = std::next(MachineBasicBlock::iterator(I1)); local 573 combine(MachineInstr &I1, MachineInstr &I2, MachineBasicBlock::iterator &MI, bool DoInsertAtI1, bool OptForSize) argument [all...] |
H A D | HexagonVectorLoopCarriedReuse.cpp | 52 // t4 = f(X1) <-- I2 66 // I1 (of X2) and I2 (of X1) that meet the following conditions. 67 // 1. I1 and I2 are the same operation, but with different operands. 69 // 3. All other operands Op1 of I1 and Op2 of I2 are also such that there is a 88 // We proceed until we cannot find any more such instructions I1 and I2. 300 DepChain *getDepChainBtwn(Instruction *I1, Instruction *I2, int Iters); 301 bool isEquivalentOperation(Instruction *I1, Instruction *I2); 403 Instruction *I2) { 404 if (!I1->isSameOperationAs(I2)) 411 if (CallInst *C2 = dyn_cast<CallInst>(I2)) { 402 isEquivalentOperation(Instruction *I1, Instruction *I2) argument 719 getDepChainBtwn(Instruction *I1, Instruction *I2, int Iters) argument [all...] |
/freebsd-11-stable/contrib/binutils/opcodes/ |
H A D | mips-opc.c | 83 #define I2 INSN_ISA2 macro 248 {"bc1fl", "p", 0x45020000, 0xffff0000, CBL|RD_CC|FP_S, 0, I2|T3 }, 252 {"bc1tl", "p", 0x45030000, 0xffff0000, CBL|RD_CC|FP_S, 0, I2|T3 }, 257 {"beqzl", "s,p", 0x50000000, 0xfc1f0000, CBL|RD_s, 0, I2|T3 }, 260 {"beql", "s,t,p", 0x50000000, 0xfc000000, CBL|RD_s|RD_t, 0, I2|T3 }, 261 {"beql", "s,I,p", 0, (int) M_BEQL_I, INSN_MACRO, 0, I2|T3 }, 264 {"bgel", "s,t,p", 0, (int) M_BGEL, INSN_MACRO, 0, I2|T3 }, 265 {"bgel", "s,I,p", 0, (int) M_BGEL_I, INSN_MACRO, 0, I2|T3 }, 268 {"bgeul", "s,t,p", 0, (int) M_BGEUL, INSN_MACRO, 0, I2|T3 }, 269 {"bgeul", "s,I,p", 0, (int) M_BGEUL_I, INSN_MACRO, 0, I2|T [all...] |
H A D | ia64-opc-i.c | 27 #define I2 IA64_TYPE_I, 2 macro 174 I2, OpX2TaTbYaXcC (5, 0, a, b, 1, 1, c), {P1, P2, IMMU5b}, EMPTY 176 I2, OpX2TaTbYaXcC (5, 0, a, b, 1, 1, c), {P2, P1, IMMU5b}, PSEUDO, 0, NULL 196 I2, OpX2TaTbYaC (5, 0, a, b, c, d), {P1, P2, R3, POS6}, EMPTY 198 I2, OpX2TaTbYaC (5, 0, a, b, c, d), {P2, P1, R3, POS6}, PSEUDO, 0, NULL 218 I2, OpX2TaTbYaC (5, 0, a, b, c, d), {P1, P2, R3}, EMPTY 220 I2, OpX2TaTbYaC (5, 0, a, b, c, d), {P2, P1, R3}, PSEUDO, 0, NULL 288 #undef I2 macro
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | PostDominators.h | 41 /// Return true if \p I1 dominates \p I2. This checks if \p I2 comes before 43 bool dominates(const Instruction *I1, const Instruction *I2) const;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | ArgumentPromotion.cpp | 372 I2 = NF->arg_begin(); 377 I->replaceAllUsesWith(&*I2); 378 I2->takeName(&*I); 379 ++I2; 402 I2->setName(I->getName() + "." + Twine(i)); 403 new StoreInst(&*I2++, Idx, InsertPt); 433 I2->setName(I->getName() + ".val"); 434 LI->replaceAllUsesWith(&*I2); 450 Function::arg_iterator TheArg = I2; 477 // Increment I2 pas [all...] |
H A D | DeadArgumentElimination.cpp | 236 I2 = NF->arg_begin(); I != E; ++I, ++I2) { 238 I->replaceAllUsesWith(&*I2); 239 I2->takeName(&*I); 1017 I2 = NF->arg_begin(); I != E; ++I, ++i) 1021 I->replaceAllUsesWith(&*I2); 1022 I2->takeName(&*I); 1023 ++I2;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86OptimizeLEAs.cpp | 608 auto I2 = std::next(I1); local 609 while (I2 != List.end()) { 610 MachineInstr &Last = **I2; 620 ++I2; 673 I2 = List.erase(I2);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFVerifier.cpp | 64 auto I2 = RHS.Ranges.begin(), E2 = RHS.Ranges.end(); local 65 if (I2 == E2) 68 DWARFAddressRange R = *I2; 72 if (++I2 == E2) 74 R = *I2; 88 auto I2 = RHS.Ranges.begin(), E2 = RHS.Ranges.end(); local 89 while (I1 != E1 && I2 != E2) { 90 if (I1->intersects(*I2)) 92 if (I1->LowPC < I2->LowPC) 95 ++I2; [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIFixSGPRCopies.cpp | 459 for (auto I2 = std::next(I1); I2 != E; ) { 460 MachineInstr *MI2 = *I2; 502 ++I2; 519 ++I2; 538 ++I2;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 1220 Instruction *I1, Instruction *I2) { 1225 if (BB1V != BB2V && (BB1V == I1 || BB2V == I2)) { 1251 Instruction *I1 = &*BB1_Itr++, *I2 = &*BB2_Itr++; local 1254 DbgInfoIntrinsic *DBI2 = dyn_cast<DbgInfoIntrinsic>(I2); 1258 while (isa<DbgInfoIntrinsic>(I2)) 1259 I2 = &*BB2_Itr++; 1262 if (isa<PHINode>(I1) || !I1->isIdenticalToWhenDefined(I2) || 1263 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)) || 1282 auto *C2 = dyn_cast<CallInst>(I2); 1287 if (!TTI.isProfitableToHoist(I1) || !TTI.isProfitableToHoist(I2)) 1219 isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, Instruction *I1, Instruction *I2) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.cpp | 952 for (auto I2 = I.base(), E2 = RegClasses.end(); I2 != E2; ++I2) { 953 CodeGenRegisterClass &SubRC = *I2; 964 for (auto I2 = std::next(I); I2 != E && testSubClass(&RC, &*I2); ++I2) 965 RC.SubClasses.set(I2->EnumValue); 2318 for (auto I2 [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 273 const IntervalInfo &I2) { 276 return getStartPoint(I1) > getStartPoint(I2); 280 const IntervalInfo &I2) { 282 SlotIndex E2 = getEndPoint(I2); 293 return std::get<0>(I1)->reg < std::get<0>(I2)->reg; 272 lowestStartPoint(const IntervalInfo &I1, const IntervalInfo &I2) argument 279 lowestEndPoint(const IntervalInfo &I1, const IntervalInfo &I2) argument
|
H A D | BranchFolding.cpp | 338 MachineBasicBlock::iterator &I2) { 359 I2 = MBBI2; 578 /// I1, I2 Iterator references that will be changed to point to the first 590 MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, 606 CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2); 618 if (skipDebugInstructionsForward(MBB2->begin(), MBB2->end()) == I2) 619 I2 = MBB2->begin(); 622 bool FullBlockTail2 = I2 == MBB2->begin(); 335 ComputeCommonTailLength(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2) argument 587 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, unsigned MinCommonTailLength, unsigned &CommonTailLen, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB, DenseMap<const MachineBasicBlock *, int> &EHScopeMembership, bool AfterPlacement, BranchFolder::MBFIWrapper &MBBFreqInfo, ProfileSummaryInfo *PSI) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
H A D | MappedBlockStream.cpp | 40 static Interval intersect(const Interval &I1, const Interval &I2) { argument 41 return std::make_pair(std::max(I1.first, I2.first), 42 std::min(I1.second, I2.second));
|
/freebsd-11-stable/libexec/getty/ |
H A D | gettytab.h | 122 #define I2 gettynums[18].value macro
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64StackTagging.cpp | 197 auto I2 = Out.find(Offset + 8); local 198 if (I1 == Out.end() && I2 == Out.end()) 206 Value *Store2 = I2 == Out.end() ? Constant::getNullValue(IRB.getInt64Ty()) 207 : I2->second;
|
/freebsd-11-stable/contrib/gcc/ |
H A D | local-alloc.c | 1574 #define EXCHANGE(I1, I2) \ 1575 { i = qty_order[I1]; qty_order[I1] = qty_order[I2]; qty_order[I2] = i; } 1623 #define EXCHANGE(I1, I2) \ 1624 { i = qty_order[I1]; qty_order[I1] = qty_order[I2]; qty_order[I2] = i; }
|