/external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.typedef/ |
H A D | p3.cpp | 5 typedef int I2; typedef 6 typedef I2 I; // expected-note {{previous definition is here}}
|
/external/clang/test/CXX/class/class.nest/ |
H A D | p3.cpp | 11 class I2; 14 class E::I2 { }; class in class:example::E
|
/external/clang/test/Index/ |
H A D | complete-categories.m | 5 @interface I2 @end 6 @interface I3 : I2 @end 12 @interface I2 (Cat2) @end 13 @interface I2 (Cat3) @end 14 @interface I2 (Cat2) @end
|
H A D | complete-properties.m | 14 @interface I2 : I1 19 @implementation I2 24 @interface I3 : I2
|
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/ |
H A D | p6-0x.cpp | 9 typedef int I1, I2; typedef 15 q->I1::~I2();
|
H A D | p6.cpp | 7 typedef int I1, I2; typedef 13 q->I1::~I2();
|
/external/clang/test/SemaCXX/ |
H A D | warn-unique-enum.cpp | 19 enum I { I1 = H1, I2 = 4 }; enumerator in enum:I 20 enum J { J1 = 4, J2 = I2 };
|
/external/llvm/include/llvm/ADT/ |
H A D | APSInt.h | 268 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 D | APInt.h | 510 static bool isSameValue(const APInt &I1, const APInt &I2) { 511 if (I1.getBitWidth() == I2.getBitWidth()) 512 return I1 == I2; 514 if (I1.getBitWidth() > I2.getBitWidth()) 515 return I1 == I2.zext(I1.getBitWidth()); 517 return I1.zext(I2.getBitWidth()) == I2;
|
/external/clang/test/Sema/ |
H A D | compound-literal.c | 31 struct Incomplete* I2 = (struct foo[x]){1, 2, 3}; // -expected-error {{variable-sized object may not be initialized}} local
|
H A D | warn-duplicate-enum.c | 57 I2, enumerator in enum:__anon4603
|
/external/llvm/lib/Transforms/IPO/ |
H A D | MergeFunctions.cpp | 178 const Instruction *I2) const; 287 const Instruction *I2) const { 292 if (I1->getOpcode() != I2->getOpcode() || 293 I1->getNumOperands() != I2->getNumOperands() || 294 !isEquivalentType(I1->getType(), I2->getType()) || 295 !I1->hasSameSubclassOptionalData(I2)) 302 I2->getOperand(i)->getType())) 307 return LI->isVolatile() == cast<LoadInst>(I2)->isVolatile() && 308 LI->getAlignment() == cast<LoadInst>(I2)->getAlignment() && 309 LI->getOrdering() == cast<LoadInst>(I2) [all...] |
H A D | ArgumentPromotion.cpp | 771 I2 = NF->arg_begin(); I != E; ++I) { 775 I->replaceAllUsesWith(I2); 776 I2->takeName(I); 777 AA.replaceWithNewValue(I, I2); 778 ++I2; 800 I2->setName(I->getName()+"."+Twine(i)); 801 new StoreInst(I2++, Idx, InsertPt); 825 I2->setName(I->getName()+".val"); 826 LI->replaceAllUsesWith(I2); 827 AA.replaceWithNewValue(LI, I2); [all...] |
H A D | DeadArgumentElimination.cpp | 281 I2 = NF->arg_begin(); I != E; ++I, ++I2) { 283 I->replaceAllUsesWith(I2); 284 I2->takeName(I); 899 I2 = NF->arg_begin(); I != E; ++I, ++i) 903 I->replaceAllUsesWith(I2); 904 I2->takeName(I); 905 ++I2;
|
/external/llvm/lib/Analysis/ |
H A D | AliasAnalysisEvaluator.cpp | 177 for (SetVector<Value *>::iterator I2 = Pointers.begin(); I2 != I1; ++I2) { 179 Type *I2ElTy =cast<PointerType>((*I2)->getType())->getElementType(); 182 switch (AA.alias(*I1, I1Size, *I2, I2Size)) { 184 PrintResults("NoAlias", PrintNoAlias, *I1, *I2, F.getParent()); 187 PrintResults("MayAlias", PrintMayAlias, *I1, *I2, F.getParent()); 190 PrintResults("PartialAlias", PrintPartialAlias, *I1, *I2, 194 PrintResults("MustAlias", PrintMustAlias, *I1, *I2, F.getParent());
|
H A D | AliasAnalysis.cpp | 483 /// instructions to consider are all of the instructions in the range of [I1,I2] 484 /// INCLUSIVE. I1 and I2 must be in the same basic block. 487 const Instruction &I2, 489 assert(I1.getParent() == I2.getParent() && 492 BasicBlock::const_iterator E = &I2; 486 canInstructionRangeModify(const Instruction &I1, const Instruction &I2, const Location &Loc) argument
|
/external/clang/test/Misc/ |
H A D | diag-template-diffing.cpp | 70 class I2{}; class 71 void set2(I2<int, int>) {}; 73 set2(I2<double, int, int>()); 76 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'I2<double, [...], int>' to 'I2<int, [...], (default) void>' for 1st argument 78 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'I2<double, int, int>' to 'I2<int, int, (default) void>' for 1st argument 81 // CHECK-ELIDE-TREE: I2< 87 // CHECK-NOELIDE-TREE: I2<
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | OSAtomicChecker.cpp | 186 for (ExplodedNodeSet::iterator I2 = TmpStore.begin(), 187 E2 = TmpStore.end(); I2 != E2; ++I2) { 188 ExplodedNode *predNew = *I2;
|
/external/qemu/ |
H A D | mips-dis.c | 1112 #define I2 INSN_ISA2 1267 {"bc1fl", "p", 0x45020000, 0xffff0000, CBL|RD_CC|FP_S, 0, I2|T3 }, 1271 {"bc1tl", "p", 0x45030000, 0xffff0000, CBL|RD_CC|FP_S, 0, I2|T3 }, 1276 {"beqzl", "s,p", 0x50000000, 0xfc1f0000, CBL|RD_s, 0, I2|T3 }, 1279 {"beql", "s,t,p", 0x50000000, 0xfc000000, CBL|RD_s|RD_t, 0, I2|T3 }, 1280 {"beql", "s,I,p", 0, (int) M_BEQL_I, INSN_MACRO, 0, I2|T3 }, 1283 {"bgel", "s,t,p", 0, (int) M_BGEL, INSN_MACRO, 0, I2|T3 }, 1284 {"bgel", "s,I,p", 0, (int) M_BGEL_I, INSN_MACRO, 0, I2|T3 }, 1287 {"bgeul", "s,t,p", 0, (int) M_BGEUL, INSN_MACRO, 0, I2|T3 }, 1288 {"bgeul", "s,I,p", 0, (int) M_BGEUL_I, INSN_MACRO, 0, I2|T 1111 #define I2 macro [all...] |
/external/llvm/lib/CodeGen/ |
H A D | BranchFolding.cpp | 309 MachineBasicBlock::iterator &I2) { 311 I2 = MBB2->end(); 314 while (I1 != MBB1->begin() && I2 != MBB2->begin()) { 315 --I1; --I2; 319 while (I2->isDebugValue()) { 320 if (I2==MBB2->begin()) 321 // I1==DBG at begin; I2==DBG at begin 323 --I2; 325 ++I2; 326 // I1==DBG at begin; I2 306 ComputeCommonTailLength(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2) argument 525 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, unsigned minCommonTailLength, unsigned &CommonTailLen, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument [all...] |
H A D | PrologEpilogInserter.cpp | 329 MachineBasicBlock::iterator I2 = I; local 330 while (I2 != MBB->begin() && (--I2)->isTerminator()) 331 I = I2; 427 MachineBasicBlock::iterator I2 = I; local 428 while (I2 != MBB->begin() && (--I2)->isTerminator()) 429 I = I2;
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-function-1.cpp | 161 template<typename T, int I1, int I2> struct Switch1 { 165 case I2: return z; // expected-error{{duplicate}}
|
/external/llvm/include/llvm/Analysis/ |
H A D | AliasAnalysis.h | 506 /// 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));
|
/external/ppp/pppd/ |
H A D | md4.c | 47 #define I2 0x98badcfe macro 110 MDp->buffer[2] = I2;
|
/external/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 1035 Instruction *I1, Instruction *I2) { 1042 if (BB1V != BB2V && (BB1V==I1 || BB2V==I2)) { 1065 Instruction *I1 = BB1_Itr++, *I2 = BB2_Itr++; local 1068 DbgInfoIntrinsic *DBI2 = dyn_cast<DbgInfoIntrinsic>(I2); 1072 while (isa<DbgInfoIntrinsic>(I2)) 1073 I2 = BB2_Itr++; 1075 if (isa<PHINode>(I1) || !I1->isIdenticalToWhenDefined(I2) || 1076 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))) 1092 if (!I2->use_empty()) 1093 I2 1034 isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, Instruction *I1, Instruction *I2) argument [all...] |