Searched refs:M1 (Results 1 - 25 of 32) sorted by relevance

12

/external/clang/test/Preprocessor/
H A Dmacro_rescan.c2 // RUN: %clang_cc1 -E %s | grep 'ei_2 = (M1)(17);'
4 #define M1(a) (a+1) 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 Dmacro_paste_simple.c9 #define M1(A) A macro
11 B: M1(M2(##))
/external/llvm/unittests/ExecutionEngine/JIT/
H A DMultiJITTest.cpp34 void createModule1(LLVMContext &Context1, Module *&M1, Function *&FooF1) { argument
35 M1 = new Module("test1", Context1);
36 LoadAssemblyInto(M1,
48 FooF1 = M1->getFunction("foo1");
73 Module *M1 = 0; local
75 createModule1(Context1, M1, FooF1);
83 OwningPtr<ExecutionEngine> EE1(EngineBuilder(M1).create());
103 Module *M1 = 0; local
105 createModule1(Context1, M1, FooF1);
113 OwningPtr<ExecutionEngine> EE1(EngineBuilder(M1)
137 Module *M1 = 0; local
[all...]
/external/clang/test/Misc/
H A Dmacro-backtrace.c4 #define M1(A, B) ((A) < (B)) macro
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'
H A Dcaret-diags-macros.c3 #define M1(x) x macro
6 M1(
10 // CHECK: :3:{{[0-9]+}}: note: expanded from macro 'M1'
/external/clang/test/CodeGenCXX/
H A Dcopy-assign-synthesis.cpp21 M() : M1(10), M2(11) , auM1(12) {}
22 int M1; member in struct:M
25 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
H A Dcopy-assign-synthesis-1.cpp26 M() : M1(10), M2(11) , auM1(12) {}
27 int M1; member in struct:M
30 printf("M1 = %d M2 = %d auM1 = %d auM2 = %d\n", M1, M2, auM1, auM2);
/external/openfst/src/include/fst/
H A Dcompose-filter.h159 // 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(fst
[all...]
H A Dlookahead-filter.h37 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> {
126 typedef typename M1::FST F1;
128 LookAheadSelector(M1 *lmatcher1, M2 *lmatcher2, MatchType)
132 LookAheadSelector(const LookAheadSelector<M1, M2, MATCH_INPUT> &selector)
149 void operator=(const LookAheadSelector<M1, M2, MATCH_INPUT> &); // disallow
155 template <class M1, clas
[all...]
H A Dcompose.h79 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, M
[all...]
H A Dfst-decl.h119 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/llvm/include/llvm/Support/
H A DCommandLine.h1183 opt(const M0t &M0, const M1t &M1) : Option(Optional, NotHidden) { argument
1184 apply(M0, this); apply(M1, this);
1190 opt(const M0t &M0, const M1t &M1, argument
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, thi
1222 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5, const M6t &M6) 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
1349 list(const M0t &M0, const M1t &M1) 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/v8/test/mjsunit/harmony/
H A Dmodule-resolution.js97 export module M1 {
101 export module A1 = M1
H A Dmodule-parsing.js67 export module M1 {}
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A D3d-cube.js96 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 D3d-cube.js96 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/
H A Dmd5-ia64.S40 // {in,out}9 Block Value 1 M1
126 #define M1 in9 define
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/
H A Dmath_approx.h274 #define M1 32767 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)))))));
284 #undef M1 macro
/external/llvm/lib/Analysis/
H A DTypeBasedAliasAnalysis.cpp292 if (const MDNode *M1 =
296 if (!Aliases(M1, M2))
/external/llvm/tools/bugpoint/
H A DMiscompilation.cpp216 static Module *TestMergedProgram(const BugDriver &BD, Module *M1, Module *M2, argument
222 M1 = CloneModule(M1);
225 if (Linker::LinkModules(M1, M2, Linker::DestroySource, &ErrorMsg)) {
233 Broken = BD.diffProgram(M1, "", "", false, &Error);
236 delete M1;
239 return M1;
H A DExtractFunction.cpp224 /// SplitStaticCtorDtor - A module was recently split into two parts, M1/M2, and
225 /// M1 has all of the global variables. If M2 contains any functions that are
228 static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2, argument
230 GlobalVariable *GV = M1->getNamedGlobal(GlobalName);
267 new GlobalVariable(*M1, M1Init->getType(), false,
273 assert(GV && "Not a clone of M1?");
/external/opencv/cvaux/src/
H A Dcvbgfg_codebook.cpp238 uchar m0, m1, m2, M0, M1, M2; local
257 m1 = model->modMin[1]; M1 = model->modMax[1];
272 int h0 = p0 - M0, h1 = p1 - M1, h2 = p2 - M2;
/external/llvm/unittests/Analysis/
H A DScalarEvolutionTest.cpp65 const SCEVMulExpr *M1 = cast<SCEVMulExpr>(P1); local
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/skia/bench/
H A DMathBench.cpp291 static SkBenchmark* M1(void* p) { return new SlowISqrtMathBench(p); } function
305 static BenchRegistry gReg1(M1);
H A DMatrixBench.cpp350 static SkBenchmark* M1(void* p) { return new ScaleMatrixBench(p); } function
357 static BenchRegistry gReg1(M1);

Completed in 541 milliseconds

12