HomeSort by relevance Sort by last modified time
    Searched refs:M2 (Results 1 - 25 of 38) sorted by null

1 2

  /external/clang/test/Preprocessor/
macro_rescan.c 5 #define M2(b) b
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); */
macro_paste_simple.c 10 #define M2(X) X
11 B: M1(M2(##))
microsoft-ext.c 3 # define M2(x, y) x + y
5 # define M(x, y) M2(x, P(x, y))
  /external/llvm/unittests/ExecutionEngine/JIT/
MultiJITTest.cpp 51 void createModule2(LLVMContext &Context2, Module *&M2, Function *&FooF2) {
52 M2 = new Module("test2", Context2);
53 LoadAssemblyInto(M2,
65 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/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/clang/test/Parser/
ms-inline-asm.c 4 #define M2 int
8 void t3(void) { __asm M2 0x2c } // expected-warning {{MS-style inline assembly is not supported}}
  /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/lib/AsmParser/
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/
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> &); // disallo
    [all...]
lookahead-filter.h 37 template <class M1, class M2>
38 MatchType LookAheadMatchType(const M1 &m1, const M2 &m2) {
40 MatchType type2 = m2.Type(false);
45 m2.Flags() & kInputLookAheadMatcher)
50 else if (m2.Flags() & kInputLookAheadMatcher &&
51 m2.Type(true) == MATCH_INPUT)
76 template <class M1, class M2, MatchType MT>
123 template <class M1, class M2>
124 class LookAheadSelector<M1, M2, MATCH_INPUT>
    [all...]
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;
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, F, T>(*this)
    [all...]
  /external/llvm/include/llvm/Support/
CommandLine.h     [all...]
  /external/clang/test/Sema/
warn-duplicate-enum.c 82 M2,
  /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/clang/include/clang/ASTMatchers/
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 &P2, const M3 &P3, const M4 &P4)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
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/
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/
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/openssl/crypto/md5/asm/
md5-ia64.S 45 // {in,out}14 Block Value 2 M2
133 #define M2 in14
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 = M1
    [all...]
  /external/llvm/lib/Analysis/
TypeBasedAliasAnalysis.cpp 294 if (const MDNode *M2 =
296 if (!Aliases(M1, M2))
  /libcore/luni/src/test/java/libcore/java/lang/
ClassCastExceptionTest.java 159 A2, B2, C2, D2, E2, F2, G2, H2, I2, J2, K2, L2, M2, N2, O2, P2, Q2, R2, S2, T2, U2, V2, W2, X2, Y2, Z2,
164 A2, B2, C2, D2, E2, F2, G2, H2, I2, J2, K2, L2, M2, N2, O2, P2, Q2, R2, S2, T2, U2, V2, W2, X2, Y2, Z2,

Completed in 612 milliseconds

1 2