/external/speex/libspeex/ |
H A D | filters.c | 443 int i,j,k,M2; local 451 M2=M>>1; 463 for (j=0;j<M2;j++) 483 int M2, N2; local 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; [all...] |
H A D | math_approx.h | 275 #define M2 -21 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))))))); 285 #undef M2 macro
|
/external/srec/config/en.us/dictionary/ |
H A D | c0.6 | [all...] |
/external/opencv/cvaux/include/ |
H A D | cvaux.h | 576 CVAPI(int) icvConvertPointSystem(CvPoint3D64f M2,
|
/external/opencv/cvaux/src/ |
H A D | cvbgfg_codebook.cpp | 238 uchar m0, m1, m2, M0, M1, M2; local 258 m2 = model->modMin[2]; M2 = model->modMax[2]; 272 int h0 = p0 - M0, h1 = p1 - M1, h2 = p2 - M2;
|
H A D | cvepilines.cpp | 176 int icvConvertPointSystem(CvPoint3D64d M2, argument 186 (double*)&M2,
|
/external/openfst/src/include/fst/ |
H A D | 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> [all...] |
H A D | 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, [all...] |
H A D | 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;
|
H A D | lookahead-filter.h | 37 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> { 128 LookAheadSelector(M1 *lmatcher1, M2 *lmatcher2, MatchType) 132 LookAheadSelector(const LookAheadSelector<M1, M2, MATCH_INPUT> &selector) 143 M2 *GetMatcher() const { return lmatcher_; } 147 M2 *lmatcher_; 149 void operator=(const LookAheadSelector<M1, M2, MATCH_INPU [all...] |
/external/openssl/crypto/bn/asm/ |
H A D | modexp512-x86_64.pl | 331 my $M2 = 640; # = 8 * 8 * 10 /* += 8 * 8 */ 464 # X2 = Xh * M2 + Xl 465 # do first part (X2 = Xh * M2) 468 add \$`$M2-$M1`, %rsi # rsi -> M2 488 add \$`$K1-$M2`, %rsi # rsi -> pK1 ; 128 bits, 2 qwords
|
/external/openssl/crypto/md5/asm/ |
H A D | md5-ia64.S | 45 // {in,out}14 Block Value 2 M2 133 #define M2 in14 define 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 [all...] |
/external/openssl/crypto/rc4/asm/ |
H A D | rc4-ia64.pl | 108 # S[I] = SJ st8 [Iptr] = SJ M2-M3 c7 109 # S[J] = SI st8 [Jptr] = SI M2-M3 641 setf.sig f6 = LoopCount // M2, M3 6 cyc 642 setf.sig f7 = Remainder // M2, M3 6 cyc 653 getf.sig LoopCount = f6;; // M2 5 cyc
|
/external/mesa3d/src/mesa/sparc/ |
H A D | norm.S | 67 fmuls %f2, M2, %f10 ! FGM Group f5 available 106 fmuls M2, %f15, M2 132 fmuls %f2, M2, %f10 ! FGM Group f5 available 344 fmuls M2, %f15, M2 365 fmuls %f2, M2, %f10 ! FGM Group f5 available 457 fmuls %f2, M2, %f10 ! FGM Group f5 available
|
H A D | sparc_matrix.h | 37 #define M2 %f18 macro 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; \
|
H A D | xform.S | 84 fmuls %f0, M2, %f3 ! FGM Group 92 fmuls %f8, M2, %f11 ! FGM Group f3 available 117 fmuls %f0, M2, %f3 ! FGM Group 301 fmuls %f0, M2, %f3 ! FGM Group 308 fmuls %f4, M2, %f7 ! FGM 328 fmuls %f0, M2, %f3 462 fmuls %f0, M2, %f4 ! FGM Group 669 fmuls %f0, M2, %f4 ! FGM Group 679 fmuls %f9, M2, %f13 ! FGM Group f2, f7 available 711 fmuls %f0, M2, [all...] |
/external/llvm/unittests/Support/ |
H A D | CommandLineTest.cpp | 59 StackOption(const M0t &M0, const M1t &M1, const M2t &M2) : Base(M0, M1, M2) {} argument 63 StackOption(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3) argument 64 : Base(M0, M1, M2, M3) {}
|
H A D | MemoryTest.cpp | 45 bool doesOverlap(MemoryBlock M1, MemoryBlock M2) { argument 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, nullptr, Flags, EC); local 81 EXPECT_NE((void*)nullptr, M2.base()); 82 EXPECT_LE(64U, M2.size()); 86 EXPECT_FALSE(doesOverlap(M1, M2)); 129 MemoryBlock M2 = Memory::allocateMappedMemory(8 * sizeof(int), nullptr, Flags, local 187 MemoryBlock M2 = Memory::allocateMappedMemory(8 * sizeof(int), nullptr, Flags, local 243 MemoryBlock M2 = Memory::allocateMappedMemory(64, &M1, Flags, EC); local 269 MemoryBlock M2 = Memory::allocateMappedMemory(64, &Near, Flags, EC); local 291 MemoryBlock M2 = Memory::allocateMappedMemory(64, &Near, Flags, EC); local 317 MemoryBlock M2 = Memory::allocateMappedMemory(64, &Near, Flags, EC); local [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcherOpt.cpp | 338 Matcher *M2 = FindNodeWithKind(ScanMatcher, Optn->getKind()); local 339 if (M2 && M2 != ScanMatcher && 340 M2->canMoveBefore(ScanMatcher) && 341 (M2->isEqual(Optn) || M2->isContradictory(Optn))) { 342 Matcher *MatcherWithoutM2 = ScanMatcher->unlinkNode(M2); 343 M2->setNext(MatcherWithoutM2); 344 OptionsToMatch[Scan] = M2;
|
/external/llvm/tools/bugpoint/ |
H A D | ExtractFunction.cpp | 225 /// SplitStaticCtorDtor - A module was recently split into two parts, M1/M2, and 226 /// M1 has all of the global variables. If M2 contains any functions that are 227 /// static ctors/dtors, we need to add an llvm.global_[cd]tors global to M2, and 229 static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2, argument 257 // Map to M2's version of the function. 273 GV = M2->getNamedGlobal(GlobalName); 280 new GlobalVariable(*M2, M2Init->getType(), false,
|
H A D | Miscompilation.cpp | 217 static Module *TestMergedProgram(const BugDriver &BD, Module *M1, Module *M2, argument 224 M2 = CloneModule(M2); 226 if (Linker::LinkModules(M1, M2, Linker::DestroySource, &ErrorMsg)) { 231 delete M2; // We are done with this module.
|
/external/llvm/unittests/Analysis/ |
H A D | ScalarEvolutionTest.cpp | 66 const SCEVMulExpr *M2 = cast<SCEVMulExpr>(P2); local 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/llvm/unittests/ExecutionEngine/JIT/ |
H A D | MultiJITTest.cpp | 55 void createModule2(LLVMContext &Context2, Module *&M2, Function *&FooF2) { argument 56 M2 = new Module("test2", Context2); 57 LoadAssemblyInto(M2, 69 FooF2 = M2->getFunction("foo2"); 79 Module *M2 = nullptr; local 81 createModule2(Context2, M2, FooF2); 86 std::unique_ptr<ExecutionEngine> EE2(EngineBuilder(M2).create()); 109 Module *M2 = nullptr; local 111 createModule2(Context2, M2, FooF2); 116 std::unique_ptr<ExecutionEngine> EE2(EngineBuilder(M2) 143 Module *M2 = nullptr; local [all...] |
/external/llvm/include/llvm/Support/ |
H A D | CommandLine.h | 1225 const M2t &M2) : Option(Optional, NotHidden) { 1226 apply(M0, this); apply(M1, this); apply(M2, this); 1231 opt(const M0t &M0, const M1t &M1, const M2t &M2, argument 1233 apply(M0, this); apply(M1, this); apply(M2, this); apply(M3, this); 1238 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, argument 1240 apply(M0, this); apply(M1, this); apply(M2, this); apply(M3, this); 1247 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, argument 1249 apply(M0, this); apply(M1, this); apply(M2, this); apply(M3, this); 1256 opt(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, argument 1259 apply(M0, this); apply(M1, this); apply(M2, thi 1224 opt(const M0t &M0, const M1t &M1, const M2t &M2) argument 1266 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 1391 list(const M0t &M0, const M1t &M1, const M2t &M2) argument 1398 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3) argument 1405 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4) argument 1414 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5) argument 1423 list(const M0t &M0, const M1t &M1, const M2t &M2, const M3t &M3, const M4t &M4, const M5t &M5, const M6t &M6) argument 1433 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/llvm/lib/Analysis/ |
H A D | TypeBasedAliasAnalysis.cpp | 533 if (const MDNode *M2 = 535 if (!Aliases(M1, M2))
|