Searched defs:I1 (Results 1 - 25 of 27) sorted by relevance

12

/external/clang/test/CodeCompletion/
H A Dnamespace.cpp5 namespace I1 { } namespace in namespace:N2
6 namespace I4 = I1;
8 namespace I1 { } namespace in namespace:N2
12 // CHECK-CC1: I1
H A Dnamespace-alias.cpp8 namespace I1 { } namespace in namespace:N2
9 namespace I4 = I1;
11 namespace I1 { } namespace in namespace:N2
15 // CHECK-CC1: I1
H A Dusing-namespace.cpp8 namespace I1 { } namespace in namespace:N2
9 namespace I4 = I1;
11 namespace I1 { } namespace in namespace:N2
16 // CHECK-CC1: I1
H A Dusing.cpp8 namespace I1 { } namespace in namespace:N2
9 namespace I4 = I1;
11 namespace I1 { } namespace in namespace:N2
18 // CHECK-CC1: I1
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/
H A Dp6-0x.cpp9 typedef int I1, I2; typedef
15 q->I1::~I2();
H A Dp6.cpp7 typedef int I1, I2; typedef
13 q->I1::~I2();
/external/clang/test/CXX/class/class.nest/
H A Dp3.cpp10 class I1;
12 class I1 { }; class in class:example::E
/external/clang/test/CXX/special/class.inhctor/
H A Delsewhere.cpp18 struct I1 : B1 { struct in inherits:B1
29 struct D1 : I1 {
/external/clang/test/Sema/
H A Dcompound-literal.c29 struct Incomplete* I1 = &(struct Incomplete){1, 2, 3}; // -expected-error {{variable has incomplete type}} variable in typeref:struct:Incomplete
H A Dwarn-duplicate-enum.c56 I1 = -1, enumerator in enum:__anon4603
/external/clang/test/SemaCXX/
H A Dwarn-unique-enum.cpp19 enum I { I1 = H1, I2 = 4 }; enumerator in enum:I
/external/clang/test/Misc/
H A Ddiag-template-diffing.cpp40 class I1{}; class
41 void set1(I1<1,2,3,4,2,3,4,3>) {};
43 set1(I1<1,2,3,4,2,2,4,3,7>());
46 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'I1<[5 * ...], 2, [2 * ...], 7>' to 'I1<[5 * ...], 3, [2 * ...], (no argument)>' for 1st argument
48 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'I1<1, 2, 3, 4, 2, 2, 4, 3, 7>' to 'I1<1, 2, 3, 4, 2, 3, 4, 3, (no argument)>' for 1st argument
51 // CHECK-ELIDE-TREE: I1<
58 // CHECK-NOELIDE-TREE: I1<
/external/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);
280 if (I1
[all...]
/external/ppp/pppd/
H A Dmd4.c46 #define I1 0xefcdab89 macro
109 MDp->buffer[1] = I1;
/external/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));
/external/llvm/lib/Analysis/
H A DAliasAnalysis.cpp483 /// 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.
486 bool AliasAnalysis::canInstructionRangeModify(const Instruction &I1, argument
489 assert(I1.getParent() == I2.getParent() &&
491 BasicBlock::const_iterator I = &I1;
/external/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp177 bool isEquivalentOperation(const Instruction *I1,
286 bool FunctionComparator::isEquivalentOperation(const Instruction *I1, argument
292 if (I1->getOpcode() != I2->getOpcode() ||
293 I1->getNumOperands() != I2->getNumOperands() ||
294 !isEquivalentType(I1->getType(), I2->getType()) ||
295 !I1->hasSameSubclassOptionalData(I2))
300 for (unsigned i = 0, e = I1->getNumOperands(); i != e; ++i)
301 if (!isEquivalentType(I1->getOperand(i)->getType(),
306 if (const LoadInst *LI = dyn_cast<LoadInst>(I1))
311 if (const StoreInst *SI = dyn_cast<StoreInst>(I1))
[all...]
/external/llvm/lib/CodeGen/
H A DBranchFolding.cpp308 MachineBasicBlock::iterator &I1,
310 I1 = MBB1->end();
314 while (I1 != MBB1->begin() && I2 != MBB2->begin()) {
315 --I1; --I2;
317 while (I1->isDebugValue()) {
318 if (I1==MBB1->begin()) {
321 // I1==DBG at begin; I2==DBG at begin
326 // I1==DBG at begin; I2==non-DBG, or first of DBGs not at begin
329 --I1;
331 // I1
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...]
/external/valgrind/main/none/tests/ppc32/
H A DtestVMX.c396 signed int Iaux;//, I1, I2;
1697 signed int Iaux;//, I1, I2;
2249 signed int Iaux, I1, I2; local
3021 I1 = Saux1.e[2*i]*Saux2.e[2*i];
3023 Iaux = I1 + I2;
3024 if ((I1>0)&&(I2>0)&&(Iaux<0))
3026 else if ((I1<0)&&(I2<0)&&(Iaux>0))
3028 I1 = Iaux2.e[i];
3030 Iaux = I1 + I2;
3031 if ((I1>
6438 signed int Iaux, I1;//, I2; local
[all...]
/external/llvm/lib/Transforms/Vectorize/
H A DBBVectorize.cpp1691 Value *I1, *I2 = 0; local
1693 I1 = LEE->getOperand(0);
1695 I1 = LSV->getOperand(0);
1697 if (I2 == I1 || isa<UndefValue>(I2))
1703 if (!I2 && I3 != I1)
1705 else if (I3 != I1 && I3 != I2)
1709 if (!I2 && I3 != I1)
1711 else if (I3 != I1 && I3 != I2)
1717 if (!I2 && I4 != I1)
1719 else if (I4 != I1
[all...]
/external/qemu/
H A Darm-dis.c3632 unsigned int I1 = (given & 0x00002000u) >> 13; local
3637 offset |= !(I1 ^ S) << 23;
/external/valgrind/main/callgrind/
H A Dsim.c94 static cache_t2 I1, D1, LL; variable
307 if ( cachesim_ref( &I1, a, size) == Hit ) return L1_Hit;
414 if ( cachesim_ref( &I1, a, size) == Hit ) return L1_Hit;
521 if ( cachesim_ref( &I1, a, size) == Hit ) return L1_Hit;
542 if ( cachesim_ref( &I1, a, size) == Hit ) return L1_Hit;
672 /* for I1/D1 caches */
964 UPDATE_USE(I1); variable
967 CACHEUSE(I1); variable
984 if (I1.use)
985 for (i = 0; i < I1
[all...]
/external/llvm/lib/Target/ARM/Disassembler/
H A DARMDisassembler.cpp3366 // the encoded instruction. So here change to I1 and I2 values via:
3367 // I1 = NOT(J1 EOR S);
3370 // imm32 = SignExtend(S:I1:I2:imm10H:imm10L:'00', 32);
3374 unsigned I1 = !(J1 ^ S); local
3376 unsigned tmp = (Val & ~0x600000) | (I1 << 22) | (I2 << 21);
3498 // the encoded instruction. So here change to I1 and I2 values via:
3499 // I1 = NOT(J1 EOR S);
3502 // imm32 = SignExtend(S:I1:I2:imm10:imm11:'0', 32);
3506 unsigned I1 = !(J1 ^ S); local
3508 unsigned tmp = (Val & ~0x600000) | (I1 << 2
[all...]
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp1035 Instruction *I1, Instruction *I2) {
1042 if (BB1V != BB2V && (BB1V==I1 || BB2V==I2)) {
1065 Instruction *I1 = BB1_Itr++, *I2 = BB2_Itr++; local
1067 DbgInfoIntrinsic *DBI1 = dyn_cast<DbgInfoIntrinsic>(I1);
1070 while (isa<DbgInfoIntrinsic>(I1))
1071 I1 = BB1_Itr++;
1075 if (isa<PHINode>(I1) || !I1->isIdenticalToWhenDefined(I2) ||
1076 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I
1034 isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, Instruction *I1, Instruction *I2) argument
[all...]
/external/svox/pico/lib/
H A Dpicopam.c238 picoos_uint8 i1_secondary_phrase_syllable; /*I1 */
322 #define I1 53 macro
1855 outVect[T_I1] = inVect[I1];
4053 case I1:/*processor for I1*/
4058 pam->sSyllFeats[pam->nCurrSyllable].phoneV[I1]
4067 pam->sSyllFeats[pam->nCurrSyllable].phoneV[I1]
4074 = pam->sSyllFeats[pam->nCurrSyllable].phoneV[I1];
4079 = pam->sSyllFeats[pam->nCurrSyllable - 1].phoneV[I1];
4755 pam->sSyllFeats[pam->nCurrSyllable].phoneV[I1]
[all...]

Completed in 1058 milliseconds

12