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

1 2

  /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/clang/test/Preprocessor/
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);{{$}}
macro_paste_simple.c 9 #define M1(A) A
11 B: M1(M2(##))
pp-record.c 25 #define M1 c
28 FM2(M1, 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();
61 MemoryBlock M1 = Memory::allocateMappedMemory(sizeof(int), 0, Flags, EC);
64 EXPECT_NE((void*)0, M1.base());
65 EXPECT_LE(sizeof(int), M1.size());
67 EXPECT_FALSE(Memory::releaseMappedMemory(M1));
    [all...]
  /external/llvm/unittests/ExecutionEngine/JIT/
MultiJITTest.cpp 34 void createModule1(LLVMContext &Context1, Module *&M1, Function *&FooF1) {
35 M1 = new Module("test1", Context1);
36 LoadAssemblyInto(M1,
48 FooF1 = M1->getFunction("foo1");
73 Module *M1 = 0;
75 createModule1(Context1, M1, FooF1);
83 OwningPtr<ExecutionEngine> EE1(EngineBuilder(M1).create());
103 Module *M1 = 0;
105 createModule1(Context1, M1, FooF1);
113 OwningPtr<ExecutionEngine> EE1(EngineBuilder(M1).create())
    [all...]
  /external/openfst/src/include/fst/
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-filter.h 159 // template <class M1, class M2>
162 // typedef typename M1::FST1 FST1;
163 // typedef typename M1::FST2 FST2;
171 // // M1 *matcher1 = 0, M2 *matcher2 = 0);
174 // ComposeFilter(const ComposeFilter<M1, M2> &filter,
206 template <class M1, class M2>
209 typedef typename M1::FST FST1;
213 typedef M1 Matcher1;
221 M1 *matcher1 = 0, M2 *matcher2 = 0)
222 : matcher1_(matcher1 ? matcher1 : new M1(fst1, MATCH_OUTPUT))
    [all...]
lookahead-filter.h 37 template <class M1, class M2>
38 MatchType LookAheadMatchType(const M1 &m1, const M2 &m2) {
39 MatchType type1 = m1.Type(false);
42 m1.Flags() & kOutputLookAheadMatcher)
47 else if (m1.Flags() & kOutputLookAheadMatcher &&
48 m1.Type(true) == MATCH_OUTPUT)
76 template <class M1, class M2, MatchType MT>
123 template <class M1, class M2>
124 class LookAheadSelector<M1, M2, MATCH_INPUT>
    [all...]
compose.h 79 template <class M1, class M2,
80 class F = SequenceComposeFilter<M1, M2>,
81 class T = GenericComposeStateTable<typename M1::Arc,
84 M1 *matcher1; // FST1 matcher (see matcher.h)
90 M1 *mat1 = 0, M2 *mat2 = 0,
203 template <class M1, class M2, class F, class T>
204 class ComposeFstImpl : public ComposeFstImplBase<typename M1::Arc> {
205 typedef typename M1::FST FST1;
207 typedef typename M1::Arc Arc;
223 const ComposeFstImplOptions<M1, M2, F, T> &opts)
    [all...]
  /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/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 26 M() : M1(10), M2(11) , auM1(12) {}
27 int M1;
30 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
  /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/llvm/include/llvm/Support/
CommandLine.h     [all...]
  /external/clang/test/Sema/
unused-expr.c 130 #define M1(a, b) (long)foo((a), (b))
138 M1(i, j); // no warning
152 #undef M1
warn-duplicate-enum.c 81 M1,
  /external/clang/include/clang/ASTMatchers/
ASTMatchers.h 1190 template <typename M1, typename M2>
1191 internal::PolymorphicMatcherWithParam2<internal::EachOfMatcher, M1, M2>
1192 eachOf(const M1 &P1, const M2 &P2) {
1193 return internal::PolymorphicMatcherWithParam2<internal::EachOfMatcher, M1,
1203 template<typename M1, typename M2>
1204 internal::PolymorphicMatcherWithParam2<internal::AnyOfMatcher, M1, M2>
1205 anyOf(const M1 &P1, const M2 &P2) {
1207 M1, M2 >(P1, P2);
1209 template<typename M1, typename M2, typename M3>
1210 internal::PolymorphicMatcherWithParam2<internal::AnyOfMatcher, M1,
    [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/openssl/crypto/md5/asm/
md5-ia64.S 40 // {in,out}9 Block Value 1 M1
126 #define M1 in9
310 // loading into M12 here produces the M0 value, M13 -> M1, etc.
544 G(D, A, B, C, M1) \
545 COMPUTE(D, A, 9, M1, RotateM1) \
554 H(D, A, B, C, M1) \
555 COMPUTE(D, A, 11, M1, RotateM1) \
564 I(D, A, B, C, M1) \
565 COMPUTE(D, A, 10, M1, RotateM1) \
677 mov M0 = M1
    [all...]
  /external/speex/libspeex/
math_approx.h 274 #define M1 32767
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)))))));
284 #undef M1
  /external/llvm/unittests/Analysis/
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/llvm/lib/Analysis/
TypeBasedAliasAnalysis.cpp 292 if (const MDNode *M1 =
296 if (!Aliases(M1, M2))

Completed in 562 milliseconds

1 2