Searched refs:I2 (Results 1 - 25 of 38) sorted by relevance

12

/freebsd-10-stable/contrib/llvm/lib/DebugInfo/
H A DDWARFDebugLoc.cpp21 for (SmallVectorImpl<Entry>::const_iterator I2 = I->Entries.begin(), E2 = I->Entries.end(); I2 != E2; ++I2) {
22 if (I2 != I->Entries.begin())
24 OS << "Beginning address offset: " << format("0x%016" PRIx64, I2->Begin)
27 << format("0x%016" PRIx64, I2->End) << '\n';
29 for (SmallVectorImpl<unsigned char>::const_iterator I3 = I2->Loc.begin(), E3 = I2->Loc.end(); I3 != E3; ++I3) {
/freebsd-10-stable/contrib/llvm/lib/Analysis/
H A DAliasAnalysisEvaluator.cpp194 for (SetVector<Value *>::iterator I2 = Pointers.begin(); I2 != I1; ++I2) {
196 Type *I2ElTy =cast<PointerType>((*I2)->getType())->getElementType();
199 switch (AA.alias(*I1, I1Size, *I2, I2Size)) {
201 PrintResults("NoAlias", PrintNoAlias, *I1, *I2, F.getParent());
204 PrintResults("MayAlias", PrintMayAlias, *I1, *I2, F.getParent());
207 PrintResults("PartialAlias", PrintPartialAlias, *I1, *I2,
211 PrintResults("MustAlias", PrintMustAlias, *I1, *I2, F.getParent());
221 for (SetVector<Value *>::iterator I2
[all...]
H A DAliasAnalysis.cpp503 /// instructions to consider are all of the instructions in the range of [I1,I2]
504 /// INCLUSIVE. I1 and I2 must be in the same basic block.
507 const Instruction &I2,
509 assert(I1.getParent() == I2.getParent() &&
512 BasicBlock::const_iterator E = &I2;
506 canInstructionRangeModify(const Instruction &I1, const Instruction &I2, const Location &Loc) argument
/freebsd-10-stable/contrib/llvm/lib/Target/Hexagon/
H A DHexagonCopyToCombine.cpp87 void combine(MachineInstr *I1, MachineInstr *I2,
90 bool isSafeToMoveTogether(MachineInstr *I1, MachineInstr *I2,
232 /// isSafeToMoveTogether - Returns true if it is safe to move I1 next to I2 such
235 MachineInstr *I2,
240 bool IsImmUseReg = I2->getOperand(1).isImm() || I2->getOperand(1).isGlobal();
241 unsigned I2UseReg = IsImmUseReg ? 0 : I2->getOperand(1).getReg();
243 // It is not safe to move I1 and I2 into one combine if I2 has a true
250 // First try to move I2 toward
234 isSafeToMoveTogether(MachineInstr *I1, MachineInstr *I2, unsigned I1DestReg, unsigned I2DestReg, bool &DoInsertAtI1) argument
451 MachineInstr *I2 = findPairable(I1, DoInsertAtI1); local
468 MachineBasicBlock::iterator I2 = llvm::next(MachineBasicBlock::iterator(I1)); local
513 combine(MachineInstr *I1, MachineInstr *I2, MachineBasicBlock::iterator &MI, bool DoInsertAtI1) argument
[all...]
/freebsd-10-stable/contrib/llvm/include/llvm/ADT/
H A DAPSInt.h268 static bool isSameValue(const APSInt &I1, const APSInt &I2) { argument
269 if (I1.getBitWidth() == I2.getBitWidth() && I1.isSigned() == I2.isSigned())
270 return I1 == I2;
273 if (I1.getBitWidth() > I2.getBitWidth())
274 return isSameValue(I1, I2.extend(I1.getBitWidth()));
275 else if (I2.getBitWidth() > I1.getBitWidth())
276 return isSameValue(I1.extend(I2.getBitWidth()), I2);
284 return APSInt(I1, true) == I2;
[all...]
H A DAPInt.h554 static bool isSameValue(const APInt &I1, const APInt &I2) {
555 if (I1.getBitWidth() == I2.getBitWidth())
556 return I1 == I2;
558 if (I1.getBitWidth() > I2.getBitWidth())
559 return I1 == I2.zext(I1.getBitWidth());
561 return I1.zext(I2.getBitWidth()) == I2;
/freebsd-10-stable/contrib/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp187 const Instruction *I2) const;
298 const Instruction *I2) const {
303 if (I1->getOpcode() != I2->getOpcode() ||
304 I1->getNumOperands() != I2->getNumOperands() ||
305 !isEquivalentType(I1->getType(), I2->getType()) ||
306 !I1->hasSameSubclassOptionalData(I2))
313 I2->getOperand(i)->getType()))
318 return LI->isVolatile() == cast<LoadInst>(I2)->isVolatile() &&
319 LI->getAlignment() == cast<LoadInst>(I2)->getAlignment() &&
320 LI->getOrdering() == cast<LoadInst>(I2)
[all...]
H A DArgumentPromotion.cpp773 I2 = NF->arg_begin(); I != E; ++I) {
777 I->replaceAllUsesWith(I2);
778 I2->takeName(I);
779 AA.replaceWithNewValue(I, I2);
780 ++I2;
802 I2->setName(I->getName()+"."+Twine(i));
803 new StoreInst(I2++, Idx, InsertPt);
827 I2->setName(I->getName()+".val");
828 LI->replaceAllUsesWith(I2);
829 AA.replaceWithNewValue(LI, I2);
[all...]
H A DDeadArgumentElimination.cpp326 I2 = NF->arg_begin(); I != E; ++I, ++I2) {
328 I->replaceAllUsesWith(I2);
329 I2->takeName(I);
1034 I2 = NF->arg_begin(); I != E; ++I, ++i)
1038 I->replaceAllUsesWith(I2);
1039 I2->takeName(I);
1040 ++I2;
/freebsd-10-stable/contrib/binutils/opcodes/
H A Dmips-opc.c83 #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 Dia64-opc-i.c27 #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-10-stable/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DIdenticalExprChecker.cpp145 Expr::const_child_iterator I2 = Expr2->child_begin(); local
146 while (I1 != Expr1->child_end() && I2 != Expr2->child_end()) {
148 const Expr *Child2 = dyn_cast<Expr>(*I2);
152 ++I2;
158 if (I2 != Expr2->child_end())
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
H A DBranchFolding.cpp308 MachineBasicBlock::iterator &I2) {
310 I2 = MBB2->end();
313 while (I1 != MBB1->begin() && I2 != MBB2->begin()) {
314 --I1; --I2;
318 while (I2->isDebugValue()) {
319 if (I2==MBB2->begin())
320 // I1==DBG at begin; I2==DBG at begin
322 --I2;
324 ++I2;
325 // I1==DBG at begin; I2
305 ComputeCommonTailLength(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2) argument
522 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, unsigned minCommonTailLength, unsigned &CommonTailLen, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument
[all...]
H A DPrologEpilogInserter.cpp353 MachineBasicBlock::iterator I2 = I; local
354 while (I2 != MBB->begin() && (--I2)->isTerminator())
355 I = I2;
H A DMachineInstr.cpp785 MachineBasicBlock::const_instr_iterator I2 = *Other; local
788 ++I2;
789 if (I2 == E2 || !I2->isInsideBundle() || !I1->isIdenticalTo(I2, Check))
/freebsd-10-stable/contrib/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp984 Instruction *I1, Instruction *I2) {
991 if (BB1V != BB2V && (BB1V==I1 || BB2V==I2)) {
1014 Instruction *I1 = BB1_Itr++, *I2 = BB2_Itr++; local
1017 DbgInfoIntrinsic *DBI2 = dyn_cast<DbgInfoIntrinsic>(I2);
1021 while (isa<DbgInfoIntrinsic>(I2))
1022 I2 = BB2_Itr++;
1024 if (isa<PHINode>(I1) || !I1->isIdenticalToWhenDefined(I2) ||
1025 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
1041 if (!I2->use_empty())
1042 I2
983 isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, Instruction *I1, Instruction *I2) argument
[all...]
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/
H A DAliasAnalysis.h506 /// range of [I1,I2] INCLUSIVE. I1 and I2 must be in the same basic block.
507 bool canInstructionRangeModify(const Instruction &I1, const Instruction &I2,
511 bool canInstructionRangeModify(const Instruction &I1, const Instruction &I2, argument
513 return canInstructionRangeModify(I1, I2, Location(Ptr, Size));
/freebsd-10-stable/contrib/llvm/lib/Transforms/Vectorize/
H A DBBVectorize.cpp2395 Value *I1, *I2 = 0; local
2400 I2 = LSV->getOperand(1);
2401 if (I2 == I1 || isa<UndefValue>(I2))
2402 I2 = 0;
2407 if (!I2 && I3 != I1)
2408 I2 = I3;
2409 else if (I3 != I1 && I3 != I2)
2413 if (!I2 && I3 != I1)
2414 I2
[all...]
/freebsd-10-stable/contrib/llvm/lib/Target/Sparc/Disassembler/
H A DSparcDisassembler.cpp83 SP::I0, SP::I1, SP::I2, SP::I3,
/freebsd-10-stable/libexec/getty/
H A Dgettytab.h121 #define I2 gettynums[18].value macro
H A Dsubr.c264 tmode.c_iflag = I2;
/freebsd-10-stable/contrib/gcc/
H A Dlocal-alloc.c1574 #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; }
/freebsd-10-stable/contrib/gdb/gdb/
H A Dsparc-stub.c113 I0, I1, I2, I3, I4, I5, FP, I7, enumerator in enum:regnames
/freebsd-10-stable/contrib/llvm/lib/IR/
H A DLegacyPassManager.cpp632 for (AnalysisUsage::VectorType::const_iterator I2 = RequiredSet.begin(),
633 E = RequiredSet.end(); I2 != E && I2 != I; ++I2) {
634 Pass *AnalysisPass2 = findAnalysisPass(*I2);
/freebsd-10-stable/contrib/llvm/lib/Target/PowerPC/
H A DPPCISelDAGToDAG.cpp241 MachineBasicBlock::iterator I2 = IP; local
242 while (I2 != BB->begin() && (--I2)->isTerminator())
243 IP = I2;

Completed in 396 milliseconds

12