| /external/libopus/celt/ |
| D | cwrs.c | 196 # define CELT_PVQ_U(_n,_k) (CELT_PVQ_U_ROW[IMIN(_n,_k)][IMAX(_n,_k)]) argument
199 # define CELT_PVQ_V(_n,_k) (CELT_PVQ_U(_n,_k)+CELT_PVQ_U(_n,(_k)+1)) argument
458 void encode_pulses(const int *_y,int _n,int _k,ec_enc *_enc){ in encode_pulses() argument
459 celt_assert(_k>0); in encode_pulses()
460 ec_enc_uint(_enc,icwrs(_n,_y),CELT_PVQ_V(_n,_k)); in encode_pulses()
463 static opus_val32 cwrsi(int _n,int _k,opus_uint32 _i,int *_y){ in cwrsi() argument
469 celt_assert(_k>0); in cwrsi()
474 if(_k>=_n){ in cwrsi()
478 p=row[_k+1]; in cwrsi()
482 k0=_k; in cwrsi()
[all …]
|
| /external/libopus/tests/ |
| D | test_opus_common.h | 28 static OPUS_INLINE void deb2_impl(unsigned char *_t,unsigned char **_p,int _k,int _x,int _y) in deb2_impl() argument
35 deb2_impl(_t,_p,_k,_x+1,_y); in deb2_impl()
36 for(i=_t[_x-_y]+1;i<_k;i++){ in deb2_impl()
38 deb2_impl(_t,_p,_k,_x+1,_x); in deb2_impl()
44 static OPUS_INLINE void debruijn2(int _k, unsigned char *_res) in debruijn2() argument
48 t=malloc(sizeof(unsigned char)*_k*2); in debruijn2()
49 memset(t,0,sizeof(unsigned char)*_k*2); in debruijn2()
50 p=&_res[_k*_k]; in debruijn2()
51 deb2_impl(t,&p,_k,1,1); in debruijn2()
|
| /external/eigen/bench/ |
| D | sparse_trisolver.cpp | 33 for (int _k=0; _k<REPEAT; ++_k) { \
194 for (int _k=0; _k<1000000; ++_k) { in main()
209 for (int _k=0; _k<1000000; ++_k) { in main()
|
| D | sparse_randomsetter.cpp | 36 for (int _k=0; _k<REPEAT; ++_k) { \
|
| D | sparse_transpose.cpp | 32 for (int _k=0; _k<REPEAT; ++_k) { \
|
| D | sparse_lu.cpp | 37 for (int _k=0; _k<REPEAT; ++_k) { \
|
| D | sparse_cholesky.cpp | 37 for (int _k=0; _k<REPEAT; ++_k) { \
|
| D | sparse_dense_product.cpp | 32 for (int _k=0; _k<REPEAT; ++_k) { \
|
| D | sparse_product.cpp | 34 for (int _k=0; _k<REPEAT; ++_k) { \
|
| /external/google-fruit/extras/scripts/ |
| D | parsetab.py | 13 for _k, _v in _lr_action_items.items():
16 _lr_action[_x][_k] = _y
22 for _k, _v in _lr_goto_items.items():
25 _lr_goto[_x][_k] = _y
|
| /external/ply/ply/test/pkg_test5/parsing/ |
| D | parsetab.py | 14 for _k, _v in _lr_action_items.items():
17 _lr_action[_x][_k] = _y
23 for _k, _v in _lr_goto_items.items():
26 _lr_goto[_x][_k] = _y
|
| /external/ply/ply/test/pkg_test2/parsing/ |
| D | calcparsetab.py | 14 for _k, _v in _lr_action_items.items():
17 _lr_action[_x][_k] = _y
23 for _k, _v in _lr_goto_items.items():
26 _lr_goto[_x][_k] = _y
|
| /external/ply/ply/test/pkg_test6/parsing/ |
| D | parsetab.py | 14 for _k, _v in _lr_action_items.items():
17 _lr_action[_x][_k] = _y
23 for _k, _v in _lr_goto_items.items():
26 _lr_goto[_x][_k] = _y
|
| /external/ply/ply/test/pkg_test1/parsing/ |
| D | parsetab.py | 14 for _k, _v in _lr_action_items.items():
17 _lr_action[_x][_k] = _y
23 for _k, _v in _lr_goto_items.items():
26 _lr_goto[_x][_k] = _y
|
| /external/ply/ply/test/pkg_test3/generated/ |
| D | parsetab.py | 14 for _k, _v in _lr_action_items.items():
17 _lr_action[_x][_k] = _y
23 for _k, _v in _lr_goto_items.items():
26 _lr_goto[_x][_k] = _y
|
| /external/minijail/ |
| D | syscall_filter_unittest_macros.h | 12 #define EXPECT_EQ_BLOCK(_block, _code, _k, _jt, _jf) \ argument
15 EXPECT_EQ((_block)->k, (unsigned int)(_k)); \
20 #define EXPECT_EQ_STMT(_block, _code, _k) \ argument
21 EXPECT_EQ_BLOCK(_block, _code, _k, 0, 0)
|
| D | bpf.h | 156 #define set_bpf_stmt(_block, _code, _k) \ argument
157 set_bpf_instr((_block), (_code), (_k), 0, 0)
159 #define set_bpf_jump(_block, _code, _k, _jt, _jf) \ argument
160 set_bpf_instr((_block), (_code), (_k), (_jt), (_jf))
|
| /external/OpenCL-CTS/test_conformance/workgroups/ |
| D | test_wg_broadcast.cpp | 122 size_t i, j, k, _i, _j, _k; in verify_wg_broadcast_3D() local
142 for (_k=0; _k < local_size_x; _k++) in verify_wg_broadcast_3D()
144 size_t indx = (i + _i) * ny * nx + (j + _j) * nx + (k + _k); in verify_wg_broadcast_3D()
147 …work_group_broadcast: Error at (%u, %u, %u): expected = %f, got = %f\n", k+_k, j+_j, i+_i, broadca… in verify_wg_broadcast_3D()
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| D | RecognitionException.cs | 84 private int _k; field in Antlr.Runtime.RecognitionException
174 this._k = k; in RecognitionException()
280 return _k;
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | 2010-02-04-EmptyGlobal.ll | 18 ; CHECK: _k:
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | Tnaf.java | 286 int _k = (m + 5)/2 + c; in approximateDivisionByN() local
287 BigInteger ns = k.shiftRight(m - _k - 2 + a); in approximateDivisionByN()
296 BigInteger ls = gsPlusJs.shiftRight(_k-c); in approximateDivisionByN()
297 if (gsPlusJs.testBit(_k-c-1)) in approximateDivisionByN()
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ec/ |
| D | Tnaf.java | 287 int _k = (m + 5)/2 + c; in approximateDivisionByN() local
288 BigInteger ns = k.shiftRight(m - _k - 2 + a); in approximateDivisionByN()
297 BigInteger ls = gsPlusJs.shiftRight(_k-c); in approximateDivisionByN()
298 if (gsPlusJs.testBit(_k-c-1)) in approximateDivisionByN()
|
| /external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/math/ec/ |
| D | Tnaf.java | 287 int _k = (m + 5)/2 + c; in approximateDivisionByN() local
288 BigInteger ns = k.shiftRight(m - _k - 2 + a); in approximateDivisionByN()
297 BigInteger ls = gsPlusJs.shiftRight(_k-c); in approximateDivisionByN()
298 if (gsPlusJs.testBit(_k-c-1)) in approximateDivisionByN()
|
| /external/exoplayer/tree/testdata/src/test/assets/amr/ |
| D | sample_nb.amr | 7 �������Aw�_k� �B���P��z\�c ���� � #�q �3��E��� ��L^O�>� ?;_K�{�� ��{.Ǿ�JPG�#<?���H�4…
|
| D | sample_nb_cbr.amr | 7 �������Aw�_k� �B���P��z\�c ���� � #�q �3��E��� ��L^O�>� ?;_K�{�� ��{.Ǿ�JPG�#<?���H�4…
|