/external/clang/test/Preprocessor/ |
H A D | macro_rescan.c | 5 #define M2(b) b macro 7 int ei_1 = M2(M1)(17); /* becomes int ei_1 = (17+1); */ 8 int ei_2 = (M2(M1))(17); /* becomes int ei_2 = (M1)(17); */
|
H A D | macro_paste_simple.c | 10 #define M2(X) X macro 11 B: M1(M2(##))
|
H A D | microsoft-ext.c | 3 # define M2(x, y) x + y macro 5 # define M(x, y) M2(x, P(x, y))
|
/external/llvm/unittests/ExecutionEngine/JIT/ |
H A D | MultiJITTest.cpp | 51 void createModule2(LLVMContext &Context2, Module *&M2, Function *&FooF2) { argument 52 M2 = new Module("test2", Context2); 53 LoadAssemblyInto(M2, 65 FooF2 = M2->getFunction("foo2"); 78 Module *M2 = 0; local 80 createModule2(Context2, M2, FooF2); 85 OwningPtr<ExecutionEngine> EE2(EngineBuilder(M2).create()); 108 Module *M2 = 0; local 110 createModule2(Context2, M2, FooF2); 115 OwningPtr<ExecutionEngine> EE2(EngineBuilder(M2) 142 Module *M2 = 0; local [all...] |
/external/clang/test/Misc/ |
H A D | macro-backtrace.c | 5 #define M2(A, B) M1(A, B) macro 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'
|
H A D | caret-diags-macros.c | 4 #define M2 1; macro 7 M2); 9 // CHECK: :4:{{[0-9]+}}: note: expanded from macro 'M2' 64 M2, 67 // CHECK: {{.*}}:4:12: note: expanded from macro 'M2'
|
/external/clang/test/Parser/ |
H A D | ms-inline-asm.c | 4 #define M2 int macro 8 void t3(void) { __asm M2 0x2c } // expected-warning {{MS-style inline assembly is not supported}}
|
/external/clang/test/CodeGenCXX/ |
H A D | copy-assign-synthesis.cpp | 21 M() : M1(10), M2(11) , auM1(12) {} 23 int M2; member in struct:M 25 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
|
H A D | copy-assign-synthesis-1.cpp | 26 M() : M1(10), M2(11) , auM1(12) {} 28 int M2; member in struct:M 30 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
|
/external/llvm/lib/AsmParser/ |
H A D | Parser.cpp | 37 OwningPtr<Module> M2(new Module(F->getBufferIdentifier(), Context)); 38 if (LLParser(F, SM, Err, M2.get()).Run()) 40 return M2.take();
|
/external/openfst/src/include/fst/ |
H A D | compose-filter.h | 159 // template <class M1, class M2> 171 // // M1 *matcher1 = 0, M2 *matcher2 = 0); 174 // ComposeFilter(const ComposeFilter<M1, M2> &filter, 206 template <class M1, class M2> 210 typedef typename M2::FST FST2; 214 typedef M2 Matcher2; 221 M1 *matcher1 = 0, M2 *matcher2 = 0) 223 matcher2_(matcher2 ? matcher2 : new M2(fst2, MATCH_INPUT)), 229 SequenceComposeFilter(const SequenceComposeFilter<M1, M2> &filter, 286 void operator=(const SequenceComposeFilter<M1, M2> [all...] |
H A D | lookahead-filter.h | 37 template <class M1, class M2> 38 MatchType LookAheadMatchType(const M1 &m1, const M2 &m2) { 76 template <class M1, class M2, MatchType MT> 123 template <class M1, class M2> 124 class LookAheadSelector<M1, M2, MATCH_INPUT> { 128 LookAheadSelector(M1 *lmatcher1, M2 *lmatcher2, MatchType) 132 LookAheadSelector(const LookAheadSelector<M1, M2, MATCH_INPUT> &selector) 143 M2 *GetMatcher() const { return lmatcher_; } 147 M2 *lmatcher_; 149 void operator=(const LookAheadSelector<M1, M2, MATCH_INPU [all...] |
H A D | compose.h | 79 template <class M1, class M2, 80 class F = SequenceComposeFilter<M1, M2>, 85 M2 *matcher2; // FST2 matcher 90 M1 *mat1 = 0, M2 *mat2 = 0, 203 template <class M1, class M2, class F, class T> 206 typedef typename M2::FST FST2; 223 const ComposeFstImplOptions<M1, M2, F, T> &opts); 225 ComposeFstImpl(const ComposeFstImpl<M1, M2, F, T> &impl) 243 virtual ComposeFstImpl<M1, M2, F, T> *Copy() { 244 return new ComposeFstImpl<M1, M2, [all...] |
H A D | fst-decl.h | 119 template <class M1, class M2 = M1> class SequenceComposeFilter; 120 template <class M1, class M2 = M1> class AltSequenceComposeFilter; 121 template <class M1, class M2 = M1> class MatchComposeFilter;
|
/external/clang/test/Sema/ |
H A D | warn-duplicate-enum.c | 82 M2, enumerator in enum:__anon4607
|
/external/v8/test/mjsunit/harmony/ |
H A D | module-resolution.js | 98 export module A2 = M2 100 export module M2 {
|
H A D | module-parsing.js | 68 export module M2 = C.D
|
/external/llvm/include/llvm/Support/ |
H A D | CommandLine.h | 1191 const M2t &M2) : Option(Optional, NotHidden) { 1192 apply(M0, this); apply(M1, this); apply(M2, this); 1197 opt(const M0t &M0, const M1t &M1, const M2t &M2, argument 1199 apply(M0, this); apply(M1, this); apply(M2, this); apply(M3, this); 1204 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, argument 1206 apply(M0, this); apply(M1, this); apply(M2, this); apply(M3, this); 1213 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, argument 1215 apply(M0, this); apply(M1, this); apply(M2, this); apply(M3, this); 1222 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, argument 1225 apply(M0, this); apply(M1, this); apply(M2, thi 1190 opt(const M0t &M0, const M1t &M1, const M2t &M2) argument 1232 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5, const M6t &M6, const M7t &M7) argument 1355 list(const M0t &M0, const M1t &M1, const M2t &M2) argument 1362 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3) argument 1369 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4) argument 1378 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5) argument 1387 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5, const M6t &M6) argument 1397 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5, const M6t &M6, const M7t &M7) argument [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcherOpt.cpp | 330 Matcher *M2 = FindNodeWithKind(ScanMatcher, Optn->getKind()); local 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/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchers.h | 932 template<typename M1, typename M2> 933 internal::PolymorphicMatcherWithParam2<internal::AnyOfMatcher, M1, M2> 934 anyOf(const M1 &P1, const M2 &P2) { 936 M1, M2 >(P1, P2); 938 template<typename M1, typename M2, typename M3> 940 internal::PolymorphicMatcherWithParam2<internal::AnyOfMatcher, M2, M3> > 941 anyOf(const M1 &P1, const M2 &P2, const M3 &P3) { 944 template<typename M1, typename M2, typename M3, typename M4> 946 internal::PolymorphicMatcherWithParam2<internal::AnyOfMatcher, M2, 949 anyOf(const M1 &P1, const M2 [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | 3d-cube.js | 96 function MMulti(M1, M2) { 102 for (; j < 4; j++) M[i][j] = M1[i][0] * M2[0][j] + M1[i][1] * M2[1][j] + M1[i][2] * M2[2][j] + M1[i][3] * M2[3][j]; 123 function MAdd(M1, M2) { 129 for (; j < 4; j++) M[i][j] = M1[i][j] + M2[i][j];
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | 3d-cube.js | 96 function MMulti(M1, M2) { 102 for (; j < 4; j++) M[i][j] = M1[i][0] * M2[0][j] + M1[i][1] * M2[1][j] + M1[i][2] * M2[2][j] + M1[i][3] * M2[3][j]; 123 function MAdd(M1, M2) { 129 for (; j < 4; j++) M[i][j] = M1[i][j] + M2[i][j];
|
/external/speex/libspeex/ |
H A D | math_approx.h | 275 #define M2 -21 macro 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 macro
|
H A D | filters.c | 443 int i,j,k,M2; local 451 M2=M>>1; 463 for (j=0;j<M2;j++) 483 int M2, N2; local 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; [all...] |
/external/openssl/crypto/md5/asm/ |
H A D | md5-ia64.S | 45 // {in,out}14 Block Value 2 M2 133 #define M2 in14 define 546 G(C, D, A, B, M2) \ 547 COMPUTE(C, D, 14, M2, RotateM2) \ 556 H(C, D, A, B, M2) \ 557 COMPUTE(C, D, 16, M2, RotateM2) \ 566 I(C, D, A, B, M2) \ 567 COMPUTE(C, D, 15, M2, RotateM2) \ 671 mov X = M2 682 mov M2 [all...] |