HomeSort by relevance Sort by last modified time
    Searched refs:M2 (Results 1 - 25 of 26) 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(##))
  /external/clang/test/Parser/
ms-inline-asm.c 4 #define M2 int
8 void t3(void) { __asm M2 0x2c }
  /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/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/llvm/include/llvm/Support/
CommandLine.h     [all...]
  /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/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,
  /external/llvm/tools/bugpoint/
ExtractFunction.cpp 192 /// SplitStaticCtorDtor - A module was recently split into two parts, M1/M2, and
193 /// M1 has all of the global variables. If M2 contains any functions that are
194 /// static ctors/dtors, we need to add an llvm.global_[cd]tors global to M2, and
196 static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2,
224 // Map to M2's version of the function.
240 GV = M2->getNamedGlobal(GlobalName);
247 new GlobalVariable(*M2, M2Init->getType(), false,
Miscompilation.cpp 216 static Module *TestMergedProgram(const BugDriver &BD, Module *M1, Module *M2,
223 M2 = CloneModule(M2);
225 if (Linker::LinkModules(M1, M2, Linker::DestroySource, &ErrorMsg)) {
230 delete M2; // We are done with this module.
    [all...]
  /external/opencv/cvaux/src/
cvbgfg_codebook.cpp 238 uchar m0, m1, m2, M0, M1, M2; local
258 m2 = model->modMin[2]; M2 = model->modMax[2];
271 int l0 = p0 + m0, l1 = p1 + m1, l2 = p2 + m2;
272 int h0 = p0 - M0, h1 = p1 - M1, h2 = p2 - M2;
  /external/llvm/unittests/Analysis/
ScalarEvolutionTest.cpp 66 const SCEVMulExpr *M2 = cast<SCEVMulExpr>(P2);
72 EXPECT_EQ(cast<SCEVConstant>(M2->getOperand(0))->getValue()->getZExtValue(),
78 EXPECT_EQ(cast<SCEVUnknown>(M2->getOperand(1))->getValue(), V2);
87 EXPECT_EQ(cast<SCEVUnknown>(M2->getOperand(1))->getValue(), V0);
  /external/skia/bench/
MatrixBench.cpp 51 SkMatrix m0, m1, m2; local
55 m2.reset();
57 always_do(m1 == m2);
58 always_do(m2 == m0);
61 always_do(m2.getType());
303 static SkBenchmark* M2(void* p) { return new FloatConcatMatrixBench(p); }
309 static BenchRegistry gReg2(M2);
  /external/clang/lib/StaticAnalyzer/Core/
ProgramState.cpp 494 ProgramState::GenericDataMap M2 = GDMFactory.add(M1, Key, Data);
496 if (M1 == M2)
500 NewSt.GDM = M2;
  /external/opencv/cvaux/include/
cvaux.h 576 CVAPI(int) icvConvertPointSystem(CvPoint3D64f M2,
    [all...]

Completed in 302 milliseconds

1 2