/external/clang/test/Preprocessor/ |
macro_paste_simple.c | 9 #define M1(A) A 11 B: M1(M2(##))
|
macro_rescan.c | 3 #define M1(a) (a+1) 6 int ei_1 = M2(M1)(17); 9 int ei_2 = (M2(M1))(17); 10 // CHECK: {{^}}int ei_2 = (M1)(17);{{$}}
|
pp-record.c | 25 #define M1 c 28 FM2(M1, M2);
|
/external/clang/test/PCH/ |
macro-redef.c | 11 #define M1 0 // expected-note {{previous}} 12 #define M1 1 // expected-warning {{redefined}} 25 int x = M1; // expected-note {{previous}}
|
/external/libcxx/test/containers/associative/multimap/ |
scary.pass.cpp | 20 typedef std::map<int, int> M1; 23 M1::iterator j = i;
|
/external/libcxx/test/containers/associative/multiset/ |
scary.pass.cpp | 20 typedef std::set<int> M1; 23 M1::iterator j = i;
|
/external/libcxx/test/containers/unord/unord.multimap/ |
scary.pass.cpp | 20 typedef std::unordered_map<int, int> M1; 23 M1::iterator j = i;
|
/external/libcxx/test/containers/unord/unord.multiset/ |
scary.pass.cpp | 20 typedef std::unordered_set<int> M1; 23 M1::iterator j = i;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/ |
scary.pass.cpp | 20 typedef std::map<int, int> M1; 23 M1::iterator j = i;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
scary.pass.cpp | 20 typedef std::set<int> M1; 23 M1::iterator j = i;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
scary.pass.cpp | 20 typedef std::unordered_map<int, int> M1; 23 M1::iterator j = i;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
scary.pass.cpp | 20 typedef std::unordered_set<int> M1; 23 M1::iterator j = i;
|
/external/clang/test/Misc/ |
macro-backtrace.c | 4 #define M1(A, B) ((A) < (B)) 5 #define M2(A, B) M1(A, B) 31 // CHECK-LIMIT: #define M2(A, B) M1(A, B) 32 // CHECK-LIMIT: macro-backtrace.c:4:23: note: expanded from macro 'M1' 33 // CHECK-LIMIT: #define M1(A, B) ((A) < (B)) 44 // CHECK-NO-CARETS-NEXT: macro-backtrace.c:4:23: note: expanded from macro 'M1'
|
caret-diags-macros.c | 3 #define M1(x) x 6 M1( 10 // CHECK: {{.*}}:3:{{[0-9]+}}: note: expanded from macro 'M1'
|
/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(); 61 MemoryBlock M1 = Memory::allocateMappedMemory(sizeof(int), nullptr, Flags,EC); 64 EXPECT_NE((void*)nullptr, M1.base()); 65 EXPECT_LE(sizeof(int), M1.size()); 67 EXPECT_FALSE(Memory::releaseMappedMemory(M1)); [all...] |
/external/clang/test/SemaCXX/ |
switch-implicit-fallthrough-macro.cpp | 35 #define M1 [[clang::fallthrough]] 37 #define M2 M1 51 case 1: // expected-warning{{unannotated fall-through between switch labels}} expected-note{{insert 'M1;' to silence this warning}} expected-note{{insert 'break;' to avoid fall-through}} 58 #undef M1
|
/external/clang/test/CodeGenCXX/ |
copy-assign-synthesis.cpp | 21 M() : M1(10), M2(11) , auM1(12) {} 22 int M1; 25 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
|
copy-assign-synthesis-1.cpp | 25 M() : M1(10), M2(11) , auM1(12) {} 26 int M1; 29 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
|
/external/clang/unittests/Driver/ |
MultilibTest.cpp | 54 Multilib M1, M2; 55 M1.flag("+foo"); 57 ASSERT_TRUE(M1 == M2) << "Multilibs with the same flag should be the same"; 61 Multilib M1, M2; 62 M1.flag("+foo"); 64 ASSERT_FALSE(M1 == M2) << "Multilibs with conflicting flags are not the same"; 65 ASSERT_FALSE(M2 == M1) 70 Multilib M1, M2; 72 ASSERT_FALSE(M1 == M2) << "Flags make Multilibs different"; 76 Multilib M1, M2 [all...] |
/external/llvm/unittests/ExecutionEngine/JIT/ |
MultiJITTest.cpp | 38 void createModule1(LLVMContext &Context1, Module *&M1, Function *&FooF1) { 39 M1 = new Module("test1", Context1); 40 LoadAssemblyInto(M1, 52 FooF1 = M1->getFunction("foo1"); 74 Module *M1 = nullptr; 76 createModule1(Context1, M1, FooF1); 84 std::unique_ptr<ExecutionEngine> EE1(EngineBuilder(M1).create()); 104 Module *M1 = nullptr; 106 createModule1(Context1, M1, FooF1); 114 std::unique_ptr<ExecutionEngine> EE1(EngineBuilder(M1).create()) [all...] |
/external/chromium_org/third_party/opus/src/celt/ |
mathops.h | 221 #define M1 32767 230 return MULT16_16_P15(x, ADD32(M1, MULT16_16_P15(x, ADD32(M2, MULT16_16_P15(x, ADD32(M3, MULT16_16_P15(M4, x))))))); 233 #undef M1
|
/external/libopus/celt/ |
mathops.h | 221 #define M1 32767 230 return MULT16_16_P15(x, ADD32(M1, MULT16_16_P15(x, ADD32(M2, MULT16_16_P15(x, ADD32(M3, MULT16_16_P15(M4, x))))))); 233 #undef M1
|
/external/llvm/unittests/Analysis/ |
LazyCallGraphTest.cpp | 618 std::unique_ptr<Module> M1 = parseAssembly( 634 LazyCallGraph CG1(*M1); 641 LazyCallGraph::Node &A = *CG1.lookup(lookupFunction(*M1, "a")); 642 LazyCallGraph::Node &B = *CG1.lookup(lookupFunction(*M1, "b")); 643 LazyCallGraph::Node &C = *CG1.lookup(lookupFunction(*M1, "c")); 665 std::unique_ptr<Module> M1 = parseAssembly( 687 LazyCallGraph CG1(*M1); 694 LazyCallGraph::Node &A = *CG1.lookup(lookupFunction(*M1, "a")); 695 LazyCallGraph::Node &B = *CG1.lookup(lookupFunction(*M1, "b")); 696 LazyCallGraph::Node &C = *CG1.lookup(lookupFunction(*M1, "c")) [all...] |
ScalarEvolutionTest.cpp | 65 const SCEVMulExpr *M1 = cast<SCEVMulExpr>(P1); 70 EXPECT_EQ(cast<SCEVConstant>(M1->getOperand(0))->getValue()->getZExtValue(), 77 EXPECT_EQ(cast<SCEVUnknown>(M1->getOperand(1))->getValue(), V1); 86 EXPECT_EQ(cast<SCEVUnknown>(M1->getOperand(1))->getValue(), V0);
|
/external/chromium_org/third_party/mesa/src/src/mesa/sparc/ |
sparc_matrix.h | 36 #define M1 %f17
|