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

1 2 3

  /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/Preprocessor/
macro_rescan.c 4 #define M2(b) b
6 int ei_1 = M2(M1)(17);
9 int ei_2 = (M2(M1))(17);
macro_paste_simple.c 10 #define M2(X) X
11 B: M1(M2(##))
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/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/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/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/clang/test/Parser/
ms-inline-asm.c 5 #define M2 int
9 void t3(void) { __asm M2 0x2c }
  /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/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/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 118 template <class M1, class M2 = M1> class SequenceComposeFilter;
119 template <class M1, class M2 = M1> class AltSequenceComposeFilter;
120 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/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/llvm/include/llvm/Support/
CommandLine.h     [all...]
  /external/clang/test/Sema/
unused-expr.c 131 #define M2 (long)0;
140 M2; // no warning
153 #undef M2
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;

Completed in 678 milliseconds

1 2 3