Searched refs:nf (Results 1 - 3 of 3) sorted by relevance

/frameworks/base/media/libstagefright/codecs/amrwbenc/src/
H A Daz_isp.c66 Word32 i, j, nf, ip, order; local
108 nf = 0; /* number of found frequencies */
115 while ((nf < M - 1) && (j < GRID_POINTS))
164 isp[nf] = xint;
166 nf++;
182 if(nf < M - 1)
/frameworks/base/media/libstagefright/codecs/amrnb/common/src/
H A Daz_lsp.cpp385 Word16 i, j, nf, ip;
433 nf = 0; // number of found frequencies
442 // while ( (nf < M) && (j < grid_points) )
443 while ((sub (nf, M) < 0) && (sub (j, grid_points) < 0))
505 lsp[nf] = xint;
507 nf++;
526 if (sub (nf, M) < 0)
569 register Word16 nf; local
627 nf = 0; /* number of found frequencies */
637 while ((nf <
[all...]
/frameworks/base/core/java/android/widget/
H A DTextView.java3534 InputFilter[] nf = new InputFilter[filters.length + 1];
3536 System.arraycopy(filters, 0, nf, 0, filters.length);
3537 nf[filters.length] = (InputFilter) mInput;
3539 e.setFilters(nf);

Completed in 66 milliseconds