| /external/libxaac/decoder/ |
| ixheaacd_lpc_dec.c | 54 FLOAT32 d[ORDER + 1];
57 d[ORDER] = FREQ_MAX - lsfq[ORDER - 1];
58 for (i = 1; i < ORDER; i++) {
62 for (i = 0; i < ORDER; i++) {
108 WORD32 avq[ORDER];
109 FLOAT32 d[ORDER + 1], lsf_min;
112 ptr_w = &ixheaacd_weight_table_avq[(indx[0] * ORDER)];
116 for (i = 0; i < ORDER; i++) {
117 lsf[i] = ixheaacd_dico_lsf_abs_8b_flt[indx[0] * ORDER + i]
[all...] |
| ixheaacd_tcx_fwd_alcnx.c | 146 FLOAT32 *ptr_a, i_ap[ORDER + 1];
150 FLOAT32 x[LEN_SUPERFRAME], buf[ORDER + LEN_SUPERFRAME];
238 ixheaacd_lpc_coeff_wt_apply(lp_flt_coff_a + (ORDER + 1), i_ap);
239 ixheaacd_lpc_to_td(i_ap, ORDER, gain1, usac_data->len_subfrm / 4);
241 ixheaacd_lpc_coeff_wt_apply(lp_flt_coff_a + (2 * (ORDER + 1)), i_ap);
242 ixheaacd_lpc_to_td(i_ap, ORDER, gain2, usac_data->len_subfrm / 4);
310 ixheaacd_lpc_coeff_wt_apply(lp_flt_coff_a + (ORDER + 1), i_ap);
348 for (i = 0; i < ORDER + fac_length; i++)
349 buf[i] = synth[i - ORDER - fac_length] -
350 (PREEMPH_FILT_FAC * synth[i - ORDER - fac_length - 1])
[all...] |
| ixheaacd_lpc.c | 56 extern const FLOAT32 lsf_init[ORDER];
157 ixheaacd_memset(st->lp_flt_coeff_a_prev, 2 * (ORDER + 1));
324 FLOAT32 lsp_curr[ORDER];
325 FLOAT32 lsf_curr[ORDER];
330 FLOAT32 lsf_flt[(2 * NUM_FRAMES + 1) * ORDER];
377 ixheaacd_lsp_2_lsf_conversion(st->lspold, lsf_flt, ORDER);
384 ixheaacd_mem_cpy(&lsf_flt[0], st->lsf_prev, ORDER);
385 ixheaacd_lsf_2_lsp_conversion_float(st->lsf_prev, st->lspold, ORDER);
390 FLOAT32 lp_flt_coeff_a[9 * (ORDER + 1)];
391 FLOAT32 tmp_buf[3 * LEN_FRAME + ORDER];
[all...] |
| ixheaacd_cnst.h | 30 #define ORDER 16
31 #define ORDER_BY_2 (ORDER / 2)
|
| ixheaacd_main.h | 42 float lp_flt_coeff_a_prev[2 * (ORDER + 1)];
48 WORD32 ilspold[ORDER];
53 FLOAT32 lsf_prev[ORDER];
54 FLOAT32 lspold[ORDER];
55 WORD32 lsfold_first[ORDER];
61 FLOAT32 fd_synth_buf[3 * LEN_FRAME + 1 + ORDER];
99 FLOAT32 lpc_prev[MAX_NUM_CHANNELS][ORDER + 1];
|
| ixheaacd_fwd_alias_cnx.c | 64 for (i = 1; i <= ORDER; i++) {
78 for (j = 1; j <= ORDER; j += 4) {
99 FLOAT32 lp_filt_coeff_a[ORDER + 1];
112 memset(fac_signal - 16, 0, ORDER * sizeof(WORD32));
147 WORD32 lp_filt_coeff_a[ORDER + 1];
174 memset(fac_data_out - 16, 0, ORDER * sizeof(WORD32));
|
| ixheaacd_acelp_tools.c | 79 for (j = 1; j <= ORDER; j += 4) {
97 memcpy(buf, mem, ORDER * sizeof(FLOAT32));
98 yy = &buf[ORDER];
101 for (j = 1; j <= ORDER; j += 4) {
119 for (j = 1; j <= ORDER; j += 4) {
|
| ixheaacd_tcx_fwd_mdct.c | 106 plp_flt_coff_a_top = lp_flt_coff_a + ORDER;
117 VOID ixheaacd_lpc_to_td(float *coeff, WORD32 order, float *gains, WORD32 lg) {
133 for (i = 0; i < order + 1; i++) {
204 FLOAT32 lsf[ORDER], *ptr_a;
230 FLOAT32 lsp[ORDER];
241 for (i = 0; i < ORDER; i++) {
248 lp_flt_coff_a += (ORDER + 1);
|
| ixheaacd_acelp_decode.c | 432 ptr_lp_filt_coeff += (ORDER + 1);
441 for (i = 0; i < ORDER; i++)
442 synth_temp[i] = synth_signal[i - ORDER] -
443 (PREEMPH_FILT_FAC * synth_signal[i - ORDER - 1]);
571 memcpy(synth_temp, &synth_signal[subfr_idx + LEN_SUBFR - ORDER],
572 ORDER * sizeof(FLOAT32));
574 ptr_lp_filt_coeff += (ORDER + 1);
583 ptr_lp_filt_coeff -= (2 * (ORDER + 1));
585 (2 * (ORDER + 1)) * sizeof(FLOAT32));
|
| /external/python/cpython3/Include/ |
| pyatomic.h | 46 #define _Py_atomic_signal_fence(/*memory_order*/ ORDER) \
47 atomic_signal_fence(ORDER)
49 #define _Py_atomic_thread_fence(/*memory_order*/ ORDER) \
50 atomic_thread_fence(ORDER)
52 #define _Py_atomic_store_explicit(ATOMIC_VAL, NEW_VAL, ORDER) \
53 atomic_store_explicit(&(ATOMIC_VAL)->_value, NEW_VAL, ORDER)
55 #define _Py_atomic_load_explicit(ATOMIC_VAL, ORDER) \
56 atomic_load_explicit(&(ATOMIC_VAL)->_value, ORDER)
77 #define _Py_atomic_signal_fence(/*memory_order*/ ORDER) \
78 __atomic_signal_fence(ORDER)
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| qisf_ns_tab.cpp | 45 const int16 mean_isf_noise[ORDER] =
|
| qisf_ns.h | 63 #define ORDER 16 /* order of linear prediction filter */
83 extern const int16 mean_isf_noise[ORDER];
|
| qisf_ns.cpp | 138 for (i = 0; i < ORDER; i++)
143 Reorder_isf(isf_q, ISF_GAP, ORDER);
|
| qpisf_2s_tab.cpp | 43 const int16 mean_isf[ORDER] =
[all...] |
| qpisf_2s.h | 86 extern const int16 mean_isf[ORDER];
|
| qpisf_2s.cpp | 167 for (i = 0; i < ORDER; i++)
201 for (i = 0; i < ORDER; i++)
208 for (i = 0; i < ORDER; i++)
217 Reorder_isf(isf_q, ISF_GAP, ORDER);
261 for (i = 0; i < ORDER; i++)
296 for (i = 0; i < ORDER; i++)
303 for (i = 0; i < ORDER; i++)
311 Reorder_isf(isf_q, ISF_GAP, ORDER);
319 * To make sure that the isfs are properly order and to keep a certain
326 * n LPC order
[all...] |
| /external/clang/test/Modules/ |
| merge-using-decls.cpp | 5 #if ORDER == 1
35 // if this varies with ORDER, but it must be consistent across runs.
36 #if ORDER == 1
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/ |
| qpisf_2s.tab | 25 #define ORDER 16 /* order of linear prediction filter */
42 static Word16 mean_isf[ORDER] = {
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| qisf_ns.c | 44 for (i = 0; i < ORDER; i++)
100 for (i = 0; i < ORDER; i++)
105 Reorder_isf(isf_q, ISF_GAP, ORDER);
|
| qpisf_2s.c | 67 Word16 isf[ORDER];
68 Word16 isf_stage2[ORDER];
70 for (i = 0; i < ORDER; i++)
157 Word16 isf[ORDER];
158 Word16 isf_stage2[ORDER];
160 for (i = 0; i < ORDER; i++)
262 for (i = 0; i < ORDER; i++)
294 for (i = 0; i < ORDER; i++)
300 for (i = 0; i < ORDER; i++)
308 Reorder_isf(isf_q, ISF_GAP, ORDER);
[all...] |
| /external/perfetto/test/trace_processor/ |
| oom_query.sql | 4 LEAD(ts, 1, ts) OVER(PARTITION BY ref ORDER BY ts) - ts as dur,
13 lead(ts, 1, ts) over(PARTITION by ref order by ts) - ts as dur,
22 lead(ts, 1, ts) over(PARTITION by ref order by ts) - ts as dur,
58 WINDOW win AS (PARTITION BY upid ORDER BY ts);
75 WINDOW win as (ORDER BY ts)
76 ORDER BY ts;
|
| b120487929.sql | 4 lead(ts) OVER (PARTITION BY name, ref ORDER BY ts) - ts as dur,
15 lead(ts) OVER (PARTITION BY name, ref ORDER BY ts) - ts as dur,
|
| /external/perfetto/src/trace_processor/metrics/android/ |
| android_mem_lmk.sql | 26 row_number() OVER (PARTITION BY counter_id ORDER BY ts DESC) AS rank
42 ORDER BY lmk_events.upid;
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/ |
| Common.java | 37 public static final int[] ORDER = order();
93 * Returns array consists the frequencies of the test pips in the order that will be used in test.
100 randomFrequencies[i] = originalFrequencies[ORDER[i] % originalFrequencies.length];
131 private static int[] order() { method in class:Common
132 int[] order = new int[REPETITIONS * PIP_NUM]; local
137 order[i] = order[j];
138 order[j] = i;
140 return order;
[all...] |
| /developers/build/prebuilts/gradle/RuntimePermissions/Application/src/main/java/com/example/android/system/runtimepermissions/contacts/ |
| ContactsFragment.java | 63 * Sort order for the query. Sorted by primary name in ascending order.
65 private static final String ORDER = ContactsContract.Contacts.DISPLAY_NAME_PRIMARY + " ASC";
119 null, null, ORDER);
|
