Searched refs:best_dist (Results 1 - 14 of 14) sorted by relevance

/external/speex/libspeex/
H A Dvq_bfin.h37 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 Dvq_arm4.h36 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 Dvq.c76 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 Dquant_lsp_bfin.h53 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 Dvq.h45 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 Dvq_sse.h36 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 Dquant_lsp.c103 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 Dcb_search.c130 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/qemu/android/skin/
H A Dtrackball.c497 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/freetype/src/autofit/
H A Daflatin.c1372 FT_Pos best_dist; /* initial threshold */ local
1377 best_dist = FT_MulFix( metrics->units_per_em / 40, scale );
1380 if ( best_dist > 64 / 2 )
1381 best_dist = 64 / 2;
1414 if ( dist < best_dist )
1416 best_dist = dist;
1436 if ( dist < best_dist )
1438 best_dist = dist;
H A Daflatin2.c1384 FT_Pos best_dist = best_dist0; local
1424 if ( dist < best_dist )
1426 best_dist = dist;
1447 if ( dist < best_dist )
1449 best_dist = dist;
H A Dafcjk.c1193 /* the blue zone with the smallest best_dist to the edge. */
1199 FT_Pos best_dist = best_dist0; local
1242 if ( dist < best_dist )
1244 best_dist = dist;
/external/libvpx/vp8/encoder/
H A Dpickinter.c215 int vp8_pick_intra4x4mby_modes(const VP8_ENCODER_RTCD *rtcd, MACROBLOCK *mb, int *Rate, int *best_dist) argument
243 if (distortion > *best_dist)
254 *best_dist = distortion;
259 *best_dist = INT_MAX;
/external/quake/quake/src/WinQuake/
H A Dgl_vidlinuxglx.cpp808 int best_fit, best_dist, dist, x, y; local
814 best_dist = 9999999;
825 if (dist < best_dist) {
826 best_dist = dist;

Completed in 329 milliseconds