| /external/speex/libspeex/ |
| H A D | vq_bfin.h | 37 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
41 best_dist[0] = 2147483647;
67 : "=&D" (dist), "=&a" (codebook), "=&d" (best_dist[0]), "=&d" (nbest[0]), "=&a" (E)
68 : "a" (len-1), "a" (in), "a" (2), "d" (entries), "d" (len<<1), "1" (codebook), "4" (E), "2" (best_dist[0]), "3" (nbest[0])
94 if (i<N || dist<best_dist[N-1])
96 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
98 best_dist[k]=best_dist[k-1];
101 best_dist[k]=dist;
|
| H A D | vq_arm4.h | 36 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
90 if (dist1<*best_dist || i==0)
92 *best_dist=dist1;
96 if (dist2<*best_dist)
98 *best_dist=dist2;
102 if (dist3<*best_dist)
104 *best_dist=dist3;
108 if (dist4<*best_dist)
110 *best_dist=dist4;
|
| H A D | vq.c | 76 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
90 if (i<N || dist<best_dist[N-1])
92 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
94 best_dist[k]=best_dist[k-1];
97 best_dist[k]=dist;
110 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
132 if (i<N || dist<best_dist[N-1])
134 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
136 best_dist[
[all...] |
| H A D | quant_lsp_bfin.h | 53 spx_word32_t best_dist=1<<30; local
58 " %0 = 1 (X);\n\t" /* %0: best_dist */
85 : "=&d" (best_dist), "=&d" (best_id)
115 spx_word32_t best_dist=1<<30; local
120 " %0 = 1 (X);\n\t" /* %0: best_dist */
154 : "=&d" (best_dist), "=&d" (best_id)
|
| H A D | vq.h | 45 void vq_nbest(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
47 void vq_nbest_sign(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|
| H A D | vq_sse.h | 36 void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
57 if (i<N || dist[i]<best_dist[N-1])
59 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
61 best_dist[k]=best_dist[k-1];
64 best_dist[k]=dist[i];
75 void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
106 if (i<N || dist[i]<best_dist[N-1])
108 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
110 best_dist[
[all...] |
| H A D | quant_lsp.c | 103 spx_word32_t best_dist=VERY_LARGE32; local
114 if (dist<best_dist)
116 best_dist=dist;
135 spx_word32_t best_dist=VERY_LARGE32; local
146 if (dist<best_dist)
148 best_dist=dist;
|
| H A D | cb_search.c | 130 spx_word32_t best_dist; local
160 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
162 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
284 VARDECL(spx_word32_t *best_dist);
332 ALLOC(best_dist, N, spx_word32_t);
381 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack);
383 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack);
389 spx_word32_t err = ADD32(ADD32(odist[j],best_dist[k]),tener);
|
| /external/chromium_org/third_party/speex/libspeex/ |
| H A D | vq.c | 76 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
90 if (i<N || dist<best_dist[N-1])
92 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
94 best_dist[k]=best_dist[k-1];
97 best_dist[k]=dist;
110 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
132 if (i<N || dist<best_dist[N-1])
134 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
136 best_dist[
[all...] |
| H A D | vq.h | 45 void vq_nbest(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
47 void vq_nbest_sign(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|
| H A D | quant_lsp.c | 103 spx_word32_t best_dist=VERY_LARGE32; local
114 if (dist<best_dist)
116 best_dist=dist;
135 spx_word32_t best_dist=VERY_LARGE32; local
146 if (dist<best_dist)
148 best_dist=dist;
|
| H A D | cb_search.c | 130 spx_word32_t best_dist; local
160 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
162 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
284 VARDECL(spx_word32_t *best_dist);
332 ALLOC(best_dist, N, spx_word32_t);
381 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack);
383 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack);
389 spx_word32_t err = ADD32(ADD32(odist[j],best_dist[k]),tener);
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| H A D | backward_references.cc | 64 size_t best_dist = 0; local
72 &best_len, &best_len_code, &best_dist, &best_score,
85 best_dist = best_dist_M1;
137 best_dist = best_dist_2;
152 cmd.copy_distance_ = best_dist;
156 if (best_dist <= std::min(i + i_diff, max_backward_limit)) {
157 hasher->set_last_distance(best_dist);
|
| /external/qemu/android/skin/ |
| H A D | trackball.c | 497 Fix16 best_dist = FIX16_ONE; local
517 if (dist < best_dist)
518 best_dist = dist;
520 if (best_dist < DOT_THRESHOLD) {
521 int a = 256*(DOT_THRESHOLD - best_dist) / DOT_THRESHOLD;
|
| /external/fio/ |
| H A D | parse.c | 1070 unsigned int best_dist = -1U; local
1078 best_dist = -1;
1097 if (dist < best_dist) {
1098 best_dist = dist;
1130 if (closest && best_dist < 3) {
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| H A D | aflatin.c | 1439 FT_Pos best_dist; /* initial threshold */ local
1444 best_dist = FT_MulFix( metrics->units_per_em / 40, scale );
1447 if ( best_dist > 64 / 2 )
1448 best_dist = 64 / 2;
1481 if ( dist < best_dist )
1483 best_dist = dist;
1503 if ( dist < best_dist )
1505 best_dist = dist;
|
| H A D | aflatin2.c | 1414 FT_Pos best_dist = best_dist0; local
1454 if ( dist < best_dist )
1456 best_dist = dist;
1477 if ( dist < best_dist )
1479 best_dist = dist;
|
| H A D | afcjk.c | 1198 /* the blue zone with the smallest best_dist to the edge. */
1204 FT_Pos best_dist = best_dist0; local
1247 if ( dist < best_dist )
1249 best_dist = dist;
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| H A D | vp9_encodeframe.c | 2040 int64_t this_dist, sum_dist = 0, best_dist = INT64_MAX; local
2174 best_dist = this_dist;
2189 (ctx->skippable && best_dist < dist_breakout_thr &&
2299 best_dist = sum_dist;
2354 best_dist = sum_dist;
2402 best_dist = sum_dist;
2416 *dist = best_dist;
2418 if (best_rate < INT_MAX && best_dist < INT64_MAX && pc_tree->index != 3) {
2429 best_rate, best_dist);
2437 assert(best_dist < INT64_MA
2723 int64_t this_dist, sum_dist = 0, best_dist = INT64_MAX; local
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_encodeframe.c | 2178 int64_t this_dist, sum_dist = 0, best_dist = INT64_MAX; local
2262 best_dist = this_dist;
2328 best_dist = sum_dist;
2385 best_dist = sum_dist;
2435 best_dist = sum_dist;
2449 *dist = best_dist;
2451 if (best_rate < INT_MAX && best_dist < INT64_MAX && do_recon) {
2464 best_rate, best_dist);
2471 assert(best_dist < INT64_MAX);
2812 int64_t this_dist, sum_dist = 0, best_dist local
[all...] |
| /external/freetype/src/autofit/ |
| H A D | aflatin.c | 1851 FT_Pos best_dist; /* initial threshold */ local
1856 best_dist = FT_MulFix( metrics->units_per_em / 40, scale );
1859 if ( best_dist > 64 / 2 )
1860 best_dist = 64 / 2;
1895 if ( dist < best_dist )
1897 best_dist = dist;
1921 if ( dist < best_dist )
1923 best_dist = dist;
|
| H A D | aflatin2.c | 1415 FT_Pos best_dist = best_dist0; local
1455 if ( dist < best_dist )
1457 best_dist = dist;
1478 if ( dist < best_dist )
1480 best_dist = dist;
|
| H A D | afcjk.c | 1220 /* the blue zone with the smallest best_dist to the edge. */
1226 FT_Pos best_dist = best_dist0; local
1269 if ( dist < best_dist )
1271 best_dist = dist;
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| H A D | pickinter.c | 184 int *best_dist
224 if (distortion > *best_dist)
232 *best_dist = distortion;
237 *best_dist = INT_MAX;
|
| /external/libvpx/libvpx/vp8/encoder/ |
| H A D | pickinter.c | 184 int *best_dist
224 if (distortion > *best_dist)
232 *best_dist = distortion;
237 *best_dist = INT_MAX;
|