| /external/webrtc/webrtc/common_audio/signal_processing/ |
| D | complex_fft.c | 32 int16_t wr, wi; in WebRtcSpl_ComplexFFT() local
62 wi = -kSinTable1024[j]; in WebRtcSpl_ComplexFFT()
68 tr32 = (wr * frfi[2 * j] - wi * frfi[2 * j + 1]) >> 15; in WebRtcSpl_ComplexFFT()
70 ti32 = (wr * frfi[2 * j + 1] + wi * frfi[2 * j]) >> 15; in WebRtcSpl_ComplexFFT()
102 wi = -kSinTable1024[j]; in WebRtcSpl_ComplexFFT()
107 "r"((int32_t)wr), "r"((int32_t)wi)); in WebRtcSpl_ComplexFFT()
129 tr32 = wr * frfi[2 * j] - wi * frfi[2 * j + 1] + CFFTRND; in WebRtcSpl_ComplexFFT()
131 ti32 = wr * frfi[2 * j + 1] + wi * frfi[2 * j] + CFFTRND; in WebRtcSpl_ComplexFFT()
162 int16_t wr, wi; in WebRtcSpl_ComplexIFFT() local
213 wi = kSinTable1024[j]; in WebRtcSpl_ComplexIFFT()
[all …]
|
| D | complex_fft_mips.c | 29 int32_t wr = 0, wi = 0; in WebRtcSpl_ComplexFFT() local
138 [ptr_i] "=&r" (ptr_i), [i] "=&r" (i), [wi] "=&r" (wi), [wr] "=&r" (wr), in WebRtcSpl_ComplexFFT()
155 int32_t wr = 0, wi = 0; in WebRtcSpl_ComplexIFFT() local
316 [istep] "=&r" (istep), [wi] "=&r" (wi), [wr] "=&r" (wr), [l] "=&r" (l), in WebRtcSpl_ComplexIFFT()
|
| /external/tremolo/Tremolo/ |
| D | floor0.c | 202 ogg_int32_t wi; in vorbis_lsp_to_curve() local
204 wi=vorbis_coslook2_i((map*imap)>>15); in vorbis_lsp_to_curve()
208 lsp_loop_asm(&qi,&pi,&qexp,ilsp,wi,m); in vorbis_lsp_to_curve()
215 pi*=(1<<14)-((wi*wi)>>14); in vorbis_lsp_to_curve()
220 pi*=(1<<14)-wi; in vorbis_lsp_to_curve()
221 qi*=(1<<14)+wi; in vorbis_lsp_to_curve()
233 qi*=labs(ilsp[0]-wi); in vorbis_lsp_to_curve()
234 pi*=labs(ilsp[1]-wi); in vorbis_lsp_to_curve()
241 qi=(qi>>shift)*labs(ilsp[j-1]-wi); in vorbis_lsp_to_curve()
242 pi=(pi>>shift)*labs(ilsp[j]-wi); in vorbis_lsp_to_curve()
[all …]
|
| D | asm_arm.h | 150 ogg_int32_t *ilsp,ogg_int32_t wi, in lsp_loop_asm() argument
231 : "r"(ilsp),"r"(wi),"r"(m) in lsp_loop_asm()
|
| /external/eigen/test/ |
| D | stdlist.cpp | 30 typename std::list<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator wi = w.begin(); in check_stdlist_matrix() local
33 VERIFY_IS_APPROX(*vi, *wi); in check_stdlist_matrix()
35 ++wi; in check_stdlist_matrix()
59 …typename std::list<TransformType,Eigen::aligned_allocator<TransformType> >::iterator wi = w.begin(… in check_stdlist_transform() local
62 VERIFY_IS_APPROX(*vi, *wi); in check_stdlist_transform()
64 ++wi; in check_stdlist_transform()
88 …typename std::list<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator wi = w.begi… in check_stdlist_quaternion() local
91 VERIFY_IS_APPROX(*vi, *wi); in check_stdlist_quaternion()
93 ++wi; in check_stdlist_quaternion()
|
| D | stddeque.cpp | 30 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator wi = w.begin(); in check_stddeque_matrix() local
33 VERIFY_IS_APPROX(*vi, *wi); in check_stddeque_matrix()
35 ++wi; in check_stddeque_matrix()
59 …typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator wi = w.begin… in check_stddeque_transform() local
62 VERIFY_IS_APPROX(*vi, *wi); in check_stddeque_transform()
64 ++wi; in check_stddeque_transform()
88 …typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator wi = w.beg… in check_stddeque_quaternion() local
91 VERIFY_IS_APPROX(*vi, *wi); in check_stddeque_quaternion()
93 ++wi; in check_stddeque_quaternion()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | WNafL2RMultiplier.java | 39 int wi = wnaf[--i]; in multiplyPositive() local
40 int digit = wi >> 16, zeroes = wi & 0xFFFF; in multiplyPositive()
72 int wi = wnaf[--i]; in multiplyPositive()
73 int digit = wi >> 16, zeroes = wi & 0xFFFF; in multiplyPositive()
|
| D | ECAlgorithms.java | 458 int wi = i < wnaf.length ? wnaf[i] : 0;
459 if (wi != 0)
461 int n = Math.abs(wi);
463 … ECPoint[] table = (wi < 0 == negs[j]) ? info.getPreComp() : info.getPreCompNeg();
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| D | ReverseAxesWalker.java | 134 AxesWalker savedWalker = wi().getLastUsedWalker(); in getProximityPosition()
146 wi().setLastUsedWalker(clone); in getProximityPosition()
166 wi().setLastUsedWalker(savedWalker); in getProximityPosition()
197 AxesWalker savedWalker = wi().getLastUsedWalker(); in getLastPos()
209 wi().setLastUsedWalker(clone); in getLastPos()
227 wi().setLastUsedWalker(savedWalker); in getLastPos()
|
| D | AxesWalker.java | 56 public final WalkingIterator wi() in wi() method in AxesWalker
127 if(wi().m_lastUsedWalker == this) in cloneDeep()
219 XPathContext xctxt = wi().getXPathContext(); in setRoot()
356 AxesWalker walker = wi().getLastUsedWalker(); in nextNode()
379 wi().setLastUsedWalker(walker); in nextNode()
432 WalkingIterator lpi = wi(); in getLastPos()
485 return wi().getXPathContext().getDTM(node); in getDTM()
|
| D | UnionPathIterator.java | 518 WalkingIterator wi = new WalkingIterator(getPrefixResolver()); in setExpression() local
519 FilterExprWalker few = new FilterExprWalker(wi); in setExpression()
520 wi.setFirstWalker(few); in setExpression()
522 wi.exprSetParent(UnionPathIterator.this); in setExpression()
523 few.exprSetParent(wi); in setExpression()
525 exp = wi; in setExpression()
|
| /external/valgrind/perf/ |
| D | ffbench.c | 176 double theta, wi, wpi, wpr, wr, wtemp; local
214 wi = 0.0;
220 tempr = wr * data[k2] - wi * data[k2 + 1];
221 tempi = wr * data[k2 + 1] + wi * data[k2];
228 wr = (wtemp = wr) * wpr - wi * wpi + wr;
229 wi = wi * wpr + wtemp * wpi + wi;
|
| /external/libvorbis/lib/ |
| D | lsp.c | 158 long wi=vorbis_coslook_i(k*65536/ln); in vorbis_lsp_to_curve() local
160 qi*=labs(ilsp[0]-wi); in vorbis_lsp_to_curve()
161 pi*=labs(ilsp[1]-wi); in vorbis_lsp_to_curve()
167 qi=(qi>>shift)*labs(ilsp[j-1]-wi); in vorbis_lsp_to_curve()
168 pi=(pi>>shift)*labs(ilsp[j]-wi); in vorbis_lsp_to_curve()
180 qi=(qi>>shift)*labs(ilsp[j-1]-wi); in vorbis_lsp_to_curve()
196 pi*=(1<<14)-((wi*wi)>>14); in vorbis_lsp_to_curve()
213 pi*=(1<<14)-wi; in vorbis_lsp_to_curve()
214 qi*=(1<<14)+wi; in vorbis_lsp_to_curve()
|
| /external/opencv3/modules/objdetect/src/ |
| D | cascadedetect.hpp | 517 int wi, ntrees = stage.ntrees; in predictOrdered() local
520 for( wi = 0; wi < ntrees; wi++ ) in predictOrdered()
522 CascadeClassifierImpl::Data::DTree& weak = cascadeWeaks[stage.first + wi]; in predictOrdered()
559 int wi, ntrees = stage.ntrees; in predictCategorical() local
562 for( wi = 0; wi < ntrees; wi++ ) in predictCategorical()
564 CascadeClassifierImpl::Data::DTree& weak = cascadeWeaks[stage.first + wi]; in predictCategorical()
637 int wi, ntrees = stage.ntrees; in predictCategoricalStump() local
640 for( wi = 0; wi < ntrees; wi++ ) in predictCategoricalStump()
642 const CascadeClassifierImpl::Data::Stump& stump = cascadeStumps[wi]; in predictCategoricalStump()
644 const int* subset = &cascadeSubsets[wi*subsetSize]; in predictCategoricalStump()
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | RedundentExprEliminator.java | 272 WalkingIterator wi = (WalkingIterator)testee.m_exprOwner.getExpression(); in partialIsVariable() local
273 if(wi.getFirstWalker() instanceof FilterExprWalker) in partialIsVariable()
439 protected LocPathIterator changePartToRef(final QName uniquePseudoVarName, WalkingIterator wi, in changePartToRef() argument
446 { ElemTemplateElement elem = getElemFromExpression(wi); in changePartToRef()
453 AxesWalker walker = wi.getFirstWalker(); in changePartToRef()
463 FilterExprWalker few = new FilterExprWalker(wi); in changePartToRef()
465 few.exprSetParent(wi); in changePartToRef()
468 wi.setFirstWalker(few); in changePartToRef()
469 return wi; in changePartToRef()
474 feis.exprSetParent(wi.exprGetParent()); in changePartToRef()
[all …]
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | mcm-13.ll | 10 @wi = weak global i32 0, align 4
14 %0 = load i32, i32* @wi, align 4
16 store i32 %inc, i32* @wi, align 4
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | RealSchur_MKL.h | 62 Matrix<EIGTYPE, Dynamic, Dynamic> wr, wi; \
63 wr.resize(n, 1); wi.resize(n, 1); \
64 …ct, n, (MKLTYPE*)m_matT.data(), lda, &sdim, (MKLTYPE*)wr.data(), (MKLTYPE*)wi.data(), (MKLTYPE*)m_…
|
| /external/icu/icu4c/source/data/translit/ |
| D | es_FONIPA_zh.txt | 32 [^j] { ui → wi ;
95 βwi → 维 ;
193 ʝwi → 尤伊 ;
259 ʎwi → 柳伊 ;
324 ɲwi → 纽伊 ;
453 ʧwi → 崔 ;
463 wi → 维 ;
|
| D | am_am_FONIPA.txt | 116 ቊ → kʼwi;
129 ቚ → kʼwi;
266 ዊ → wi;
345 ጒ → ɡwi;
358 ⶔ → ŋwi;
|
| D | Latin_InterIndic.txt | 15 $wi=\uE007;
186 i→$wi;
296 $virama''i→$wi;
314 ''i→$wi;
|
| /external/opencv3/modules/core/test/ |
| D | test_dxt.cpp | 13 Complexd wi, w1; in initDFTWave() local
19 w[0].re = wi.re = 1.; in initDFTWave()
20 w[0].im = wi.im = 0.; in initDFTWave()
24 double t = wi.re*w1.re - wi.im*w1.im; in initDFTWave()
25 wi.im = wi.re*w1.im + wi.im*w1.re; in initDFTWave()
26 wi.re = t; in initDFTWave()
27 w[i] = wi; in initDFTWave()
|
| /external/opencv/cxcore/src/ |
| D | cxsvd.cpp | 1045 double wi = w[i]; in icvSVBkSb_64f() local
1047 if( wi > threshold ) in icvSVBkSb_64f()
1049 wi = 1./wi; in icvSVBkSb_64f()
1071 s *= wi; in icvSVBkSb_64f()
1102 buffer[j] *= wi; in icvSVBkSb_64f()
1107 buffer[j] = uT[j]*wi; in icvSVBkSb_64f()
1139 double wi = w[i]; in icvSVBkSb_32f() local
1141 if( wi > threshold ) in icvSVBkSb_32f()
1143 wi = 1./wi; in icvSVBkSb_32f()
1165 s *= wi; in icvSVBkSb_32f()
[all …]
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseMatrix.h | 948 Matrix<Index,Dynamic,1> wi(trMat.outerSize());
949 wi.setZero();
953 wi(IsRowMajor ? it->col() : it->row())++;
957 trMat.reserve(wi);
1022 Matrix<Index,Dynamic,1> wi(innerSize());
1023 wi.fill(-1);
1033 if(wi(i)>=start)
1036 m_data.value(wi(i)) += m_data.value(k);
1042 wi(i) = count;
|
| /external/opencv3/apps/traincascade/ |
| D | cascadeclassifier.cpp | 458 for( int wi = 0; wi < weak->total; wi++ ) in save() local
462 CvCascadeBoostTree* tree = *((CvCascadeBoostTree**) cvGetSeqElem( weak, wi )); in save()
|
| /external/clang/test/SemaObjCXX/ |
| D | arc-templates.mm | 129 __weak id wi;
134 identity<__weak id> res5 = accept_any_ref(wi);
149 __weak A * wi;
154 identity<__weak A *> res5 = accept_any_ref(wi);
|