/external/clang/test/Preprocessor/ |
macro_paste_simple.c | 10 #define M2(X) X 11 B: M1(M2(##))
|
macro_rescan.c | 4 #define M2(b) b 6 int ei_1 = M2(M1)(17); 9 int ei_2 = (M2(M1))(17);
|
pp-record.c | 26 #define M2 int 28 FM2(M1, M2);
|
microsoft-ext.c | 4 # define M2(x, y) x + y 6 # define M(x, y) M2(x, P(x, y))
|
/external/clang/test/PCH/ |
macro-redef.c | 14 #define M2 3 19 #define M2 4 // expected-warning {{redefined}} 26 int x = M2; // expected-error {{redefinition}}
|
/external/clang/test/Parser/ |
ms-inline-asm.c | 5 #define M2 int 9 void t3(void) { __asm M2 0x2c }
|
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.unqual/ |
p14.cpp | 56 namespace M2 { 70 void M2::MInner::Bar::bar() {
|
/external/clang/test/Misc/ |
macro-backtrace.c | 5 #define M2(A, B) M1(A, B) 6 #define M3(A, B) M2(A, B) 29 // CHECK-LIMIT: #define M3(A, B) M2(A, B) 30 // CHECK-LIMIT: macro-backtrace.c:5:18: note: expanded from macro 'M2' 31 // CHECK-LIMIT: #define M2(A, B) M1(A, B) 43 // CHECK-NO-CARETS-NEXT: macro-backtrace.c:5:18: note: expanded from macro 'M2'
|
caret-diags-macros.c | 4 #define M2 1; 7 M2); 9 // CHECK: {{.*}}:4:{{[0-9]+}}: note: expanded from macro 'M2' 64 M2, 67 // CHECK: {{.*}}:4:12: note: expanded from macro 'M2'
|
/external/llvm/unittests/Support/ |
MemoryTest.cpp | 45 bool doesOverlap(MemoryBlock M1, MemoryBlock M2) { 46 if (M1.base() == M2.base()) 49 if (M1.base() > M2.base()) 50 return (unsigned char *)M2.base() + M2.size() > M1.base(); 52 return (unsigned char *)M1.base() + M1.size() > M2.base(); 74 MemoryBlock M2 = Memory::allocateMappedMemory(64, 0, Flags, EC); 81 EXPECT_NE((void*)0, M2.base()); 82 EXPECT_LE(64U, M2.size()); 86 EXPECT_FALSE(doesOverlap(M1, M2)); [all...] |
/external/clang/test/SemaCXX/ |
switch-implicit-fallthrough-macro.cpp | 37 #define M2 M1 39 #define M2 52 // there was an idea that this ^ should be M2 59 #undef M2
|
/external/clang/test/CodeGenCXX/ |
copy-assign-synthesis.cpp | 21 M() : M1(10), M2(11) , auM1(12) {} 23 int M2; 25 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
|
copy-assign-synthesis-1.cpp | 26 M() : M1(10), M2(11) , auM1(12) {} 28 int M2; 30 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
|
/external/llvm/unittests/ExecutionEngine/JIT/ |
MultiJITTest.cpp | 54 void createModule2(LLVMContext &Context2, Module *&M2, Function *&FooF2) { 55 M2 = new Module("test2", Context2); 56 LoadAssemblyInto(M2, 68 FooF2 = M2->getFunction("foo2"); 78 Module *M2 = 0; 80 createModule2(Context2, M2, FooF2); 85 OwningPtr<ExecutionEngine> EE2(EngineBuilder(M2).create()); 108 Module *M2 = 0; 110 createModule2(Context2, M2, FooF2); 115 OwningPtr<ExecutionEngine> EE2(EngineBuilder(M2).create()) [all...] |
/external/skia/bench/ |
InterpBench.cpp | 158 static SkBenchmark* M2(void* p) { return new Fixed16D48Interp(p); } 164 static BenchRegistry gReg2(M2);
|
/external/chromium_org/third_party/opus/src/celt/ |
mathops.h | 201 #define M2 -21 209 return MULT16_16_P15(x, ADD32(M1, MULT16_16_P15(x, ADD32(M2, MULT16_16_P15(x, ADD32(M3, MULT16_16_P15(M4, x))))))); 213 #undef M2
|
/external/llvm/unittests/Analysis/ |
ScalarEvolutionTest.cpp | 66 const SCEVMulExpr *M2 = cast<SCEVMulExpr>(P2); 72 EXPECT_EQ(cast<SCEVConstant>(M2->getOperand(0))->getValue()->getZExtValue(), 78 EXPECT_EQ(cast<SCEVUnknown>(M2->getOperand(1))->getValue(), V2); 87 EXPECT_EQ(cast<SCEVUnknown>(M2->getOperand(1))->getValue(), V0);
|
/external/llvm/utils/TableGen/ |
DAGISelMatcherOpt.cpp | 330 Matcher *M2 = FindNodeWithKind(ScanMatcher, Optn->getKind()); 331 if (M2 != 0 && M2 != ScanMatcher && 332 M2->canMoveBefore(ScanMatcher) && 333 (M2->isEqual(Optn) || M2->isContradictory(Optn))) { 334 Matcher *MatcherWithoutM2 = ScanMatcher->unlinkNode(M2); 335 M2->setNext(MatcherWithoutM2); 336 OptionsToMatch[Scan] = M2;
|
/external/chromium_org/third_party/mesa/src/src/mesa/sparc/ |
sparc_matrix.h | 37 #define M2 %f18 54 ldd [BASE + ( 2 * 0x4)], M2; \ 68 ld [BASE + ( 2 * 0x4)], M2; \ 83 ldd [BASE + ( 2 * 0x4)], M2; \ 96 ldd [BASE + ( 2 * 0x4)], M2; \ 115 ldd [BASE + ( 2 * 0x4)], M2; \ 135 ld [BASE + ( 2 * 0x4)], M2; \ 143 ld [BASE + ( 2 * 0x4)], M2; \
|
/external/mesa3d/src/mesa/sparc/ |
sparc_matrix.h | 37 #define M2 %f18 54 ldd [BASE + ( 2 * 0x4)], M2; \ 68 ld [BASE + ( 2 * 0x4)], M2; \ 83 ldd [BASE + ( 2 * 0x4)], M2; \ 96 ldd [BASE + ( 2 * 0x4)], M2; \ 115 ldd [BASE + ( 2 * 0x4)], M2; \ 135 ld [BASE + ( 2 * 0x4)], M2; \ 143 ld [BASE + ( 2 * 0x4)], M2; \
|
/external/opencv/cvaux/src/ |
cvbgfg_codebook.cpp | 238 uchar m0, m1, m2, M0, M1, M2; local 258 m2 = model->modMin[2]; M2 = model->modMax[2]; 271 int l0 = p0 + m0, l1 = p1 + m1, l2 = p2 + m2; 272 int h0 = p0 - M0, h1 = p1 - M1, h2 = p2 - M2;
|
/external/speex/libspeex/ |
math_approx.h | 275 #define M2 -21 281 return MULT16_16_P15(x, ADD32(M1, MULT16_16_P15(x, ADD32(M2, MULT16_16_P15(x, ADD32(M3, MULT16_16_P15(M4, x))))))); 285 #undef M2
|
filters.c | 443 int i,j,k,M2; 451 M2=M>>1; 463 for (j=0;j<M2;j++) 483 int M2, N2; 487 M2 = M>>1; 489 ALLOC(xx1, M2+N2, spx_word16_t); 490 ALLOC(xx2, M2+N2, spx_word16_t); 494 for (i = 0; i < M2; i++) 498 for (i = 0; i < M2; i++) 509 for (j = 0; j < M2; j += 2) [all...] |
/external/clang/test/Sema/ |
warn-duplicate-enum.c | 82 M2,
|
/external/clang/lib/StaticAnalyzer/Core/ |
ProgramState.cpp | 507 ProgramState::GenericDataMap M2 = GDMFactory.add(M1, Key, Data); 509 if (M1 == M2) 513 NewSt.GDM = M2;
|