cmp 369 libavcodec/atrac3.c TonalComponent *cmp = &components[component_count]; cmp 377 libavcodec/atrac3.c cmp->pos = b * 64 + get_bits(gb, 6); cmp 379 libavcodec/atrac3.c max_coded_values = SAMPLES_PER_FRAME - cmp->pos; cmp 389 libavcodec/atrac3.c cmp->num_coefs = coded_values; cmp 393 libavcodec/atrac3.c cmp->coef[m] = mantissa[m] * scale_factor; cmp 155 libavcodec/huffman.c Node *nodes, HuffCmp cmp, int flags) cmp 173 libavcodec/huffman.c qsort(nodes, nb_codes, sizeof(Node), cmp); cmp 44 libavcodec/huffman.h Node *nodes, HuffCmp cmp, int flags); cmp 370 libavcodec/me_cmp.c void ff_set_cmp(MECmpContext *c, me_cmp_func *cmp, int type) cmp 374 libavcodec/me_cmp.c memset(cmp, 0, sizeof(void *) * 6); cmp 379 libavcodec/me_cmp.c cmp[i] = c->sad[i]; cmp 382 libavcodec/me_cmp.c cmp[i] = c->hadamard8_diff[i]; cmp 385 libavcodec/me_cmp.c cmp[i] = c->sse[i]; cmp 388 libavcodec/me_cmp.c cmp[i] = c->dct_sad[i]; cmp 391 libavcodec/me_cmp.c cmp[i] = c->dct264_sad[i]; cmp 394 libavcodec/me_cmp.c cmp[i] = c->dct_max[i]; cmp 397 libavcodec/me_cmp.c cmp[i] = c->quant_psnr[i]; cmp 400 libavcodec/me_cmp.c cmp[i] = c->bit[i]; cmp 403 libavcodec/me_cmp.c cmp[i] = c->rd[i]; cmp 406 libavcodec/me_cmp.c cmp[i] = c->vsad[i]; cmp 409 libavcodec/me_cmp.c cmp[i] = c->vsse[i]; cmp 412 libavcodec/me_cmp.c cmp[i] = zero_cmp; cmp 415 libavcodec/me_cmp.c cmp[i] = c->nsse[i]; cmp 419 libavcodec/me_cmp.c cmp[i]= c->w53[i]; cmp 422 libavcodec/me_cmp.c cmp[i]= c->w97[i]; cmp 91 libavcodec/me_cmp.h void ff_set_cmp(MECmpContext *c, me_cmp_func *cmp, int type); cmp 76 libavcodec/motion_est_template.c dmin= cmp(s, mx, my, 0, 0, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags); cmp 183 libavcodec/motion_est_template.c d= cmp(s, mx>>(qpel+1), my>>(qpel+1), mx&mask, my&mask, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags); cmp 238 libavcodec/motion_est_template.c dmin= cmp(s, mx, my, 0, 0, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags); cmp 304 libavcodec/motion_est_template.c tl= cmp(s, mx-1, my-1, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);//FIXME wrong if chroma me is different cmp 368 libavcodec/motion_est_template.c d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\ cmp 390 libavcodec/motion_est_template.c d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\ cmp 432 libavcodec/motion_est_template.c score_map[index]= cmp(s, best[0], best[1], 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags); cmp 656 libavcodec/motion_est_template.c d= cmp(s, ax, ay, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\ cmp 891 libavcodec/motion_est_template.c dmin= cmp(s, 0, 0, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags); cmp 108 libavfilter/vf_deshake.c qsort(values, count, sizeof(double), (void*)cmp); cmp 111 libavformat/asfdec.c #define PRINT_IF_GUID(g, cmp) \ cmp 112 libavformat/asfdec.c if (!ff_guidcmp(g, &cmp)) \ cmp 113 libavformat/asfdec.c av_dlog(NULL, "(GUID: %s) ", # cmp) cmp 118 libavformat/cache.c entry = av_tree_find(c->root, &c->logical_pos, cmp, (void**)next); cmp 137 libavformat/cache.c entry_ret = av_tree_insert(&c->root, entry, cmp, &node); cmp 161 libavformat/cache.c entry = av_tree_find(c->root, &c->logical_pos, cmp, (void**)next); cmp 30 libavutil/qsort.h #define AV_QSORT(p, num, type, cmp) {\ cmp 44 libavutil/qsort.h if(cmp(start, end) > 0) {\ cmp 45 libavutil/qsort.h if(cmp( end, mid) > 0) FFSWAP(type, *start, *mid);\ cmp 48 libavutil/qsort.h if(cmp(start, mid) > 0) FFSWAP(type, *start, *mid);\ cmp 51 libavutil/qsort.h if(cmp(mid, end) > 0){ \ cmp 58 libavutil/qsort.h while(left<=right && cmp(left, end-1) < 0)\ cmp 60 libavutil/qsort.h while(left<=right && cmp(right, end-1) > 0)\ cmp 71 libavutil/qsort.h while(mid<end && cmp(mid, mid+1) <= 0)\ cmp 86 libavutil/qsort.h if(cmp(start, end) > 0)\ cmp 100 libavutil/qsort.h #define AV_MSORT(p, tmp, num, type, cmp) {\ cmp 107 libavutil/qsort.h int idx= cmp(p+a[0], p+a[1]) > 0;\ cmp 40 libavutil/tree.c int (*cmp)(void *key, const void *b), void *next[2]) cmp 43 libavutil/tree.c unsigned int v = cmp(key, t->elem); cmp 47 libavutil/tree.c return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next); cmp 50 libavutil/tree.c av_tree_find(t->child[0], key, cmp, next); cmp 51 libavutil/tree.c av_tree_find(t->child[1], key, cmp, next); cmp 60 libavutil/tree.c int (*cmp)(void *key, const void *b), AVTreeNode **next) cmp 64 libavutil/tree.c unsigned int v = cmp(t->elem, key); cmp 72 libavutil/tree.c av_tree_find(t->child[i], key, cmp, next_elem); cmp 81 libavutil/tree.c ret = av_tree_insert(&t->child[v >> 31], key, cmp, next); cmp 156 libavutil/tree.c int (*cmp)(void *opaque, void *elem), cmp 160 libavutil/tree.c int v = cmp ? cmp(opaque, t->elem) : 0; cmp 162 libavutil/tree.c av_tree_enumerate(t->child[0], opaque, cmp, enu); cmp 166 libavutil/tree.c av_tree_enumerate(t->child[1], opaque, cmp, enu); cmp 238 libavutil/tree.c av_tree_insert(&root, (void *)(j + 1), cmp, &node); cmp 244 libavutil/tree.c av_tree_insert(&root, (void *)(j + 1), cmp, &node2); cmp 245 libavutil/tree.c k = av_tree_find(root, (void *)(j + 1), cmp, NULL); cmp 63 libavutil/tree.h int (*cmp)(void *key, const void *b), void *next[2]); cmp 109 libavutil/tree.h int (*cmp)(void *key, const void *b), cmp 125 libavutil/tree.h int (*cmp)(void *opaque, void *elem), cmp 661 libpostproc/postprocess_altivec_template.c const vector unsigned char cmp = \ cmp 664 libpostproc/postprocess_altivec_template.c (vector unsigned short)vec_mergeh(cmp, cmp); \ cmp 666 libpostproc/postprocess_altivec_template.c (vector unsigned short)vec_mergel(cmp, cmp); \ cmp 274 libswresample/swresample-test.c qsort(remaining_tests + max_tests - num_tests, num_tests, sizeof(remaining_tests[0]), (void*)cmp);