cmp 373 libavcodec/atrac3.c TonalComponent *cmp = &components[component_count]; cmp 381 libavcodec/atrac3.c cmp->pos = b * 64 + get_bits(gb, 6); cmp 383 libavcodec/atrac3.c max_coded_values = SAMPLES_PER_FRAME - cmp->pos; cmp 393 libavcodec/atrac3.c cmp->num_coefs = coded_values; cmp 397 libavcodec/atrac3.c cmp->coef[m] = mantissa[m] * scale_factor; cmp 158 libavcodec/huffman.c Node *nodes, HuffCmp cmp, int flags) cmp 176 libavcodec/huffman.c AV_QSORT(nodes, nb_codes, Node, cmp); cmp 44 libavcodec/huffman.h Node *nodes, HuffCmp cmp, int flags); cmp 474 libavcodec/me_cmp.c void ff_set_cmp(MECmpContext *c, me_cmp_func *cmp, int type) cmp 478 libavcodec/me_cmp.c memset(cmp, 0, sizeof(void *) * 6); cmp 483 libavcodec/me_cmp.c cmp[i] = c->sad[i]; cmp 486 libavcodec/me_cmp.c cmp[i] = c->median_sad[i]; cmp 489 libavcodec/me_cmp.c cmp[i] = c->hadamard8_diff[i]; cmp 492 libavcodec/me_cmp.c cmp[i] = c->sse[i]; cmp 495 libavcodec/me_cmp.c cmp[i] = c->dct_sad[i]; cmp 498 libavcodec/me_cmp.c cmp[i] = c->dct264_sad[i]; cmp 501 libavcodec/me_cmp.c cmp[i] = c->dct_max[i]; cmp 504 libavcodec/me_cmp.c cmp[i] = c->quant_psnr[i]; cmp 507 libavcodec/me_cmp.c cmp[i] = c->bit[i]; cmp 510 libavcodec/me_cmp.c cmp[i] = c->rd[i]; cmp 513 libavcodec/me_cmp.c cmp[i] = c->vsad[i]; cmp 516 libavcodec/me_cmp.c cmp[i] = c->vsse[i]; cmp 519 libavcodec/me_cmp.c cmp[i] = zero_cmp; cmp 522 libavcodec/me_cmp.c cmp[i] = c->nsse[i]; cmp 526 libavcodec/me_cmp.c cmp[i]= c->w53[i]; cmp 529 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 77 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 184 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 239 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 305 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 369 libavcodec/motion_est_template.c d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\ cmp 391 libavcodec/motion_est_template.c d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\ cmp 433 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 657 libavcodec/motion_est_template.c d= cmp(s, ax, ay, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\ cmp 893 libavcodec/motion_est_template.c dmin= cmp(s, 0, 0, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags); cmp 68 libavcodec/mpeg12framerate.c int cmp; cmp 73 libavcodec/mpeg12framerate.c cmp = av_cmp_q(test, frame_rate); cmp 74 libavcodec/mpeg12framerate.c if (cmp == 0) { cmp 81 libavcodec/mpeg12framerate.c if (cmp < 0) cmp 86 libavcodec/mpeg12framerate.c cmp = av_cmp_q(error, best_error); cmp 87 libavcodec/mpeg12framerate.c if (cmp < 0 || (cmp == 0 && n == 1 && d == 1)) { cmp 199 libavfilter/vf_deband.c int avg[4], cmp[4] = { 0 }, src[4]; cmp 217 libavfilter/vf_deband.c cmp[p] = FFABS(src0 - avg[p]) < thr; cmp 219 libavfilter/vf_deband.c cmp[p] = (FFABS(src0 - ref0) < thr) && cmp 227 libavfilter/vf_deband.c if (!cmp[p]) cmp 264 libavfilter/vf_deband.c int avg[4], cmp[4] = { 0 }, src[4]; cmp 282 libavfilter/vf_deband.c cmp[p] = FFABS(src0 - avg[p]) < thr; cmp 284 libavfilter/vf_deband.c cmp[p] = (FFABS(src0 - ref0) < thr) && cmp 292 libavfilter/vf_deband.c if (!cmp[z]) cmp 105 libavfilter/vf_deshake.c AV_QSORT(values, count, double, cmp); cmp 294 libavfilter/vf_signature.c qsort(sortsignature, elemcat->elem_count, sizeof(uint64_t), (void*) cmp); cmp 320 libavfilter/vf_signature.c qsort(conflist, DIFFELEM_SIZE, sizeof(uint64_t), (void*) cmp); cmp 146 libavformat/asfdec_f.c #define PRINT_IF_GUID(g, cmp) \ cmp 147 libavformat/asfdec_f.c if (!ff_guidcmp(g, &cmp)) \ cmp 148 libavformat/asfdec_f.c av_log(NULL, AV_LOG_TRACE, "(GUID: %s) ", # cmp) cmp 125 libavformat/cache.c entry = av_tree_find(c->root, &c->logical_pos, cmp, (void**)next); cmp 144 libavformat/cache.c entry_ret = av_tree_insert(&c->root, entry, cmp, &node); cmp 168 libavformat/cache.c entry = av_tree_find(c->root, &c->logical_pos, cmp, (void**)next); cmp 33 libavutil/qsort.h #define AV_QSORT(p, num, type, cmp) do {\ cmp 47 libavutil/qsort.h if(cmp(start, end) > 0) {\ cmp 48 libavutil/qsort.h if(cmp( end, mid) > 0) FFSWAP(type, *start, *mid);\ cmp 51 libavutil/qsort.h if(cmp(start, mid) > 0) FFSWAP(type, *start, *mid);\ cmp 54 libavutil/qsort.h if(cmp(mid, end) > 0){ \ cmp 61 libavutil/qsort.h while(left<=right && cmp(left, end-1) < 0)\ cmp 63 libavutil/qsort.h while(left<=right && cmp(right, end-1) > 0)\ cmp 74 libavutil/qsort.h while(mid<end && cmp(mid, mid+1) <= 0)\ cmp 89 libavutil/qsort.h if(cmp(start, end) > 0)\ cmp 103 libavutil/qsort.h #define AV_MSORT(p, tmp, num, type, cmp) do {\ cmp 110 libavutil/qsort.h int idx= cmp(p+a[0], p+a[1]) > 0;\ cmp 90 libavutil/tests/tree.c av_tree_insert(&root, (void *)(j + 1), cmp, &node); cmp 96 libavutil/tests/tree.c av_tree_insert(&root, (void *)(j + 1), cmp, &node2); cmp 97 libavutil/tests/tree.c k = av_tree_find(root, (void *)(j + 1), cmp, NULL); cmp 40 libavutil/tree.c int (*cmp)(const 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)(const 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 68 libavutil/tree.h int (*cmp)(const void *key, const void *b), void *next[2]); cmp 115 libavutil/tree.h int (*cmp)(const void *key, const void *b), cmp 131 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 275 libswresample/tests/swresample.c qsort(remaining_tests + max_tests - num_tests, num_tests, sizeof(remaining_tests[0]), cmp); cmp 556 tests/checkasm/checkasm.c int cmp = cmp_func_names(name, f->name); cmp 557 tests/checkasm/checkasm.c if (cmp) { cmp 558 tests/checkasm/checkasm.c f = get_func(&f->child[cmp > 0], name);