2 * Copyright (c) 2002-2006 Michael Niedermayer <michaelni@gmx.at>
3 * Copyright (c) 2006 Oded Shimon <ods15@ods15.dyndns.org>
5 * This file is part of FFmpeg.
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
24 * simple arithmetic expression evaluator.
26 * see http://joe.hotchkiss.com/programming/eval/eval.html
30 #include "attributes.h"
37 #include "mathematics.h"
43 typedef struct Parser {
47 const double *const_values;
48 const char * const *const_names; // NULL terminated
49 double (* const *funcs1)(void *, double a); // NULL terminated
50 const char * const *func1_names; // NULL terminated
51 double (* const *funcs2)(void *, double a, double b); // NULL terminated
52 const char * const *func2_names; // NULL terminated
60 static const AVClass eval_class = { "Eval", av_default_item_name, NULL, LIBAVUTIL_VERSION_INT, offsetof(Parser,log_offset), offsetof(Parser,log_ctx) };
66 } si_prefixes['z' - 'E' + 1] = {
67 ['y'-'E']= { 8.271806125530276749e-25, 1e-24, -24 },
68 ['z'-'E']= { 8.4703294725430034e-22, 1e-21, -21 },
69 ['a'-'E']= { 8.6736173798840355e-19, 1e-18, -18 },
70 ['f'-'E']= { 8.8817841970012523e-16, 1e-15, -15 },
71 ['p'-'E']= { 9.0949470177292824e-13, 1e-12, -12 },
72 ['n'-'E']= { 9.3132257461547852e-10, 1e-9, -9 },
73 ['u'-'E']= { 9.5367431640625e-7, 1e-6, -6 },
74 ['m'-'E']= { 9.765625e-4, 1e-3, -3 },
75 ['c'-'E']= { 9.8431332023036951e-3, 1e-2, -2 },
76 ['d'-'E']= { 9.921256574801246e-2, 1e-1, -1 },
77 ['h'-'E']= { 1.0159366732596479e2, 1e2, 2 },
78 ['k'-'E']= { 1.024e3, 1e3, 3 },
79 ['K'-'E']= { 1.024e3, 1e3, 3 },
80 ['M'-'E']= { 1.048576e6, 1e6, 6 },
81 ['G'-'E']= { 1.073741824e9, 1e9, 9 },
82 ['T'-'E']= { 1.099511627776e12, 1e12, 12 },
83 ['P'-'E']= { 1.125899906842624e15, 1e15, 15 },
84 ['E'-'E']= { 1.152921504606847e18, 1e18, 18 },
85 ['Z'-'E']= { 1.1805916207174113e21, 1e21, 21 },
86 ['Y'-'E']= { 1.2089258196146292e24, 1e24, 24 },
96 { "QP2LAMBDA", FF_QP2LAMBDA },
99 double av_strtod(const char *numstr, char **tail)
103 if(numstr[0]=='0' && (numstr[1]|0x20)=='x') {
104 d = strtoul(numstr, &next, 16);
106 d = strtod(numstr, &next);
107 /* if parsing succeeded, check for and interpret postfixes */
109 if (next[0] == 'd' && next[1] == 'B') {
110 /* treat dB as decibels instead of decibytes */
111 d = ff_exp10(d / 20);
113 } else if (*next >= 'E' && *next <= 'z') {
114 int e= si_prefixes[*next - 'E'].exp;
116 if (next[1] == 'i') {
117 d*= si_prefixes[*next - 'E'].bin_val;
120 d*= si_prefixes[*next - 'E'].dec_val;
131 /* if requested, fill in tail with the position after the last parsed
138 #define IS_IDENTIFIER_CHAR(c) ((c) - '0' <= 9U || (c) - 'a' <= 25U || (c) - 'A' <= 25U || (c) == '_')
140 static int strmatch(const char *s, const char *prefix)
143 for (i=0; prefix[i]; i++) {
144 if (prefix[i] != s[i]) return 0;
146 /* return 1 only if the s identifier is terminated */
147 return !IS_IDENTIFIER_CHAR(s[i]);
152 e_value, e_const, e_func0, e_func1, e_func2,
153 e_squish, e_gauss, e_ld, e_isnan, e_isinf,
154 e_mod, e_max, e_min, e_eq, e_gt, e_gte, e_lte, e_lt,
155 e_pow, e_mul, e_div, e_add,
156 e_last, e_st, e_while, e_taylor, e_root, e_floor, e_ceil, e_trunc,
157 e_sqrt, e_not, e_random, e_hypot, e_gcd,
158 e_if, e_ifnot, e_print, e_bitand, e_bitor, e_between, e_clip, e_atan2
160 double value; // is sign in other types
163 double (*func0)(double);
164 double (*func1)(void *, double);
165 double (*func2)(void *, double, double);
167 struct AVExpr *param[3];
171 static double etime(double v)
173 return av_gettime() * 0.000001;
176 static double eval_expr(Parser *p, AVExpr *e)
179 case e_value: return e->value;
180 case e_const: return e->value * p->const_values[e->a.const_index];
181 case e_func0: return e->value * e->a.func0(eval_expr(p, e->param[0]));
182 case e_func1: return e->value * e->a.func1(p->opaque, eval_expr(p, e->param[0]));
183 case e_func2: return e->value * e->a.func2(p->opaque, eval_expr(p, e->param[0]), eval_expr(p, e->param[1]));
184 case e_squish: return 1/(1+exp(4*eval_expr(p, e->param[0])));
185 case e_gauss: { double d = eval_expr(p, e->param[0]); return exp(-d*d/2)/sqrt(2*M_PI); }
186 case e_ld: return e->value * p->var[av_clip(eval_expr(p, e->param[0]), 0, VARS-1)];
187 case e_isnan: return e->value * !!isnan(eval_expr(p, e->param[0]));
188 case e_isinf: return e->value * !!isinf(eval_expr(p, e->param[0]));
189 case e_floor: return e->value * floor(eval_expr(p, e->param[0]));
190 case e_ceil : return e->value * ceil (eval_expr(p, e->param[0]));
191 case e_trunc: return e->value * trunc(eval_expr(p, e->param[0]));
192 case e_sqrt: return e->value * sqrt (eval_expr(p, e->param[0]));
193 case e_not: return e->value * (eval_expr(p, e->param[0]) == 0);
194 case e_if: return e->value * (eval_expr(p, e->param[0]) ? eval_expr(p, e->param[1]) :
195 e->param[2] ? eval_expr(p, e->param[2]) : 0);
196 case e_ifnot: return e->value * (!eval_expr(p, e->param[0]) ? eval_expr(p, e->param[1]) :
197 e->param[2] ? eval_expr(p, e->param[2]) : 0);
199 double x = eval_expr(p, e->param[0]);
200 double min = eval_expr(p, e->param[1]), max = eval_expr(p, e->param[2]);
201 if (isnan(min) || isnan(max) || isnan(x) || min > max)
203 return e->value * av_clipd(eval_expr(p, e->param[0]), min, max);
206 double d = eval_expr(p, e->param[0]);
207 return e->value * (d >= eval_expr(p, e->param[1]) &&
208 d <= eval_expr(p, e->param[2]));
211 double x = eval_expr(p, e->param[0]);
212 int level = e->param[1] ? av_clip(eval_expr(p, e->param[1]), INT_MIN, INT_MAX) : AV_LOG_INFO;
213 av_log(p, level, "%f\n", x);
217 int idx= av_clip(eval_expr(p, e->param[0]), 0, VARS-1);
218 uint64_t r= isnan(p->var[idx]) ? 0 : p->var[idx];
219 r= r*1664525+1013904223;
221 return e->value * (r * (1.0/UINT64_MAX));
225 while (eval_expr(p, e->param[0]))
226 d=eval_expr(p, e->param[1]);
230 double t = 1, d = 0, v;
231 double x = eval_expr(p, e->param[1]);
232 int id = e->param[2] ? av_clip(eval_expr(p, e->param[2]), 0, VARS-1) : 0;
234 double var0 = p->var[id];
235 for(i=0; i<1000; i++) {
238 v = eval_expr(p, e->param[0]);
249 double low = -1, high = -1, v, low_v = -DBL_MAX, high_v = DBL_MAX;
250 double var0 = p->var[0];
251 double x_max = eval_expr(p, e->param[1]);
252 for(i=-1; i<1024; i++) {
254 p->var[0] = ff_reverse[i&255]*x_max/255;
256 p->var[0] = x_max*pow(0.9, i-255);
257 if (i&1) p->var[0] *= -1;
258 if (i&2) p->var[0] += low;
259 else p->var[0] += high;
261 v = eval_expr(p, e->param[0]);
262 if (v<=0 && v>low_v) {
266 if (v>=0 && v<high_v) {
270 if (low>=0 && high>=0){
271 for (j=0; j<1000; j++) {
272 p->var[0] = (low+high)*0.5;
273 if (low == p->var[0] || high == p->var[0])
275 v = eval_expr(p, e->param[0]);
276 if (v<=0) low = p->var[0];
277 if (v>=0) high= p->var[0];
287 return -low_v<high_v ? low : high;
290 double d = eval_expr(p, e->param[0]);
291 double d2 = eval_expr(p, e->param[1]);
293 case e_mod: return e->value * (d - floor((!CONFIG_FTRAPV || d2) ? d / d2 : d * INFINITY) * d2);
294 case e_gcd: return e->value * av_gcd(d,d2);
295 case e_max: return e->value * (d > d2 ? d : d2);
296 case e_min: return e->value * (d < d2 ? d : d2);
297 case e_eq: return e->value * (d == d2 ? 1.0 : 0.0);
298 case e_gt: return e->value * (d > d2 ? 1.0 : 0.0);
299 case e_gte: return e->value * (d >= d2 ? 1.0 : 0.0);
300 case e_lt: return e->value * (d < d2 ? 1.0 : 0.0);
301 case e_lte: return e->value * (d <= d2 ? 1.0 : 0.0);
302 case e_pow: return e->value * pow(d, d2);
303 case e_mul: return e->value * (d * d2);
304 case e_div: return e->value * ((!CONFIG_FTRAPV || d2 ) ? (d / d2) : d * INFINITY);
305 case e_add: return e->value * (d + d2);
306 case e_last:return e->value * d2;
307 case e_st : return e->value * (p->var[av_clip(d, 0, VARS-1)]= d2);
308 case e_hypot:return e->value * hypot(d, d2);
309 case e_atan2:return e->value * atan2(d, d2);
310 case e_bitand: return isnan(d) || isnan(d2) ? NAN : e->value * ((long int)d & (long int)d2);
311 case e_bitor: return isnan(d) || isnan(d2) ? NAN : e->value * ((long int)d | (long int)d2);
318 static int parse_expr(AVExpr **e, Parser *p);
320 void av_expr_free(AVExpr *e)
323 av_expr_free(e->param[0]);
324 av_expr_free(e->param[1]);
325 av_expr_free(e->param[2]);
330 static int parse_primary(AVExpr **e, Parser *p)
332 AVExpr *d = av_mallocz(sizeof(AVExpr));
333 char *next = p->s, *s0 = p->s;
337 return AVERROR(ENOMEM);
340 d->value = av_strtod(p->s, &next);
349 /* named constants */
350 for (i=0; p->const_names && p->const_names[i]; i++) {
351 if (strmatch(p->s, p->const_names[i])) {
352 p->s+= strlen(p->const_names[i]);
354 d->a.const_index = i;
359 for (i = 0; i < FF_ARRAY_ELEMS(constants); i++) {
360 if (strmatch(p->s, constants[i].name)) {
361 p->s += strlen(constants[i].name);
363 d->value = constants[i].value;
369 p->s= strchr(p->s, '(');
371 av_log(p, AV_LOG_ERROR, "Undefined constant or missing '(' in '%s'\n", s0);
374 return AVERROR(EINVAL);
377 if (*next == '(') { // special case do-nothing
379 if ((ret = parse_expr(&d, p)) < 0)
381 if (p->s[0] != ')') {
382 av_log(p, AV_LOG_ERROR, "Missing ')' in '%s'\n", s0);
384 return AVERROR(EINVAL);
390 if ((ret = parse_expr(&(d->param[0]), p)) < 0) {
396 parse_expr(&d->param[1], p);
400 parse_expr(&d->param[2], p);
402 if (p->s[0] != ')') {
403 av_log(p, AV_LOG_ERROR, "Missing ')' or too many args in '%s'\n", s0);
405 return AVERROR(EINVAL);
410 if (strmatch(next, "sinh" )) d->a.func0 = sinh;
411 else if (strmatch(next, "cosh" )) d->a.func0 = cosh;
412 else if (strmatch(next, "tanh" )) d->a.func0 = tanh;
413 else if (strmatch(next, "sin" )) d->a.func0 = sin;
414 else if (strmatch(next, "cos" )) d->a.func0 = cos;
415 else if (strmatch(next, "tan" )) d->a.func0 = tan;
416 else if (strmatch(next, "atan" )) d->a.func0 = atan;
417 else if (strmatch(next, "asin" )) d->a.func0 = asin;
418 else if (strmatch(next, "acos" )) d->a.func0 = acos;
419 else if (strmatch(next, "exp" )) d->a.func0 = exp;
420 else if (strmatch(next, "log" )) d->a.func0 = log;
421 else if (strmatch(next, "abs" )) d->a.func0 = fabs;
422 else if (strmatch(next, "time" )) d->a.func0 = etime;
423 else if (strmatch(next, "squish")) d->type = e_squish;
424 else if (strmatch(next, "gauss" )) d->type = e_gauss;
425 else if (strmatch(next, "mod" )) d->type = e_mod;
426 else if (strmatch(next, "max" )) d->type = e_max;
427 else if (strmatch(next, "min" )) d->type = e_min;
428 else if (strmatch(next, "eq" )) d->type = e_eq;
429 else if (strmatch(next, "gte" )) d->type = e_gte;
430 else if (strmatch(next, "gt" )) d->type = e_gt;
431 else if (strmatch(next, "lte" )) d->type = e_lte;
432 else if (strmatch(next, "lt" )) d->type = e_lt;
433 else if (strmatch(next, "ld" )) d->type = e_ld;
434 else if (strmatch(next, "isnan" )) d->type = e_isnan;
435 else if (strmatch(next, "isinf" )) d->type = e_isinf;
436 else if (strmatch(next, "st" )) d->type = e_st;
437 else if (strmatch(next, "while" )) d->type = e_while;
438 else if (strmatch(next, "taylor")) d->type = e_taylor;
439 else if (strmatch(next, "root" )) d->type = e_root;
440 else if (strmatch(next, "floor" )) d->type = e_floor;
441 else if (strmatch(next, "ceil" )) d->type = e_ceil;
442 else if (strmatch(next, "trunc" )) d->type = e_trunc;
443 else if (strmatch(next, "sqrt" )) d->type = e_sqrt;
444 else if (strmatch(next, "not" )) d->type = e_not;
445 else if (strmatch(next, "pow" )) d->type = e_pow;
446 else if (strmatch(next, "print" )) d->type = e_print;
447 else if (strmatch(next, "random")) d->type = e_random;
448 else if (strmatch(next, "hypot" )) d->type = e_hypot;
449 else if (strmatch(next, "gcd" )) d->type = e_gcd;
450 else if (strmatch(next, "if" )) d->type = e_if;
451 else if (strmatch(next, "ifnot" )) d->type = e_ifnot;
452 else if (strmatch(next, "bitand")) d->type = e_bitand;
453 else if (strmatch(next, "bitor" )) d->type = e_bitor;
454 else if (strmatch(next, "between"))d->type = e_between;
455 else if (strmatch(next, "clip" )) d->type = e_clip;
456 else if (strmatch(next, "atan2" )) d->type = e_atan2;
458 for (i=0; p->func1_names && p->func1_names[i]; i++) {
459 if (strmatch(next, p->func1_names[i])) {
460 d->a.func1 = p->funcs1[i];
467 for (i=0; p->func2_names && p->func2_names[i]; i++) {
468 if (strmatch(next, p->func2_names[i])) {
469 d->a.func2 = p->funcs2[i];
476 av_log(p, AV_LOG_ERROR, "Unknown function in '%s'\n", s0);
478 return AVERROR(EINVAL);
485 static AVExpr *make_eval_expr(int type, int value, AVExpr *p0, AVExpr *p1)
487 AVExpr *e = av_mallocz(sizeof(AVExpr));
497 static int parse_pow(AVExpr **e, Parser *p, int *sign)
499 *sign= (*p->s == '+') - (*p->s == '-');
501 return parse_primary(e, p);
504 static int parse_dB(AVExpr **e, Parser *p, int *sign)
506 /* do not filter out the negative sign when parsing a dB value.
507 for example, -3dB is not the same as -(3dB) */
510 double av_unused ignored = strtod(p->s, &next);
511 if (next != p->s && next[0] == 'd' && next[1] == 'B') {
513 return parse_primary(e, p);
516 return parse_pow(e, p, sign);
519 static int parse_factor(AVExpr **e, Parser *p)
521 int sign, sign2, ret;
522 AVExpr *e0, *e1, *e2;
523 if ((ret = parse_dB(&e0, p, &sign)) < 0)
528 if ((ret = parse_dB(&e2, p, &sign2)) < 0) {
532 e0 = make_eval_expr(e_pow, 1, e1, e2);
536 return AVERROR(ENOMEM);
538 if (e0->param[1]) e0->param[1]->value *= (sign2|1);
540 if (e0) e0->value *= (sign|1);
546 static int parse_term(AVExpr **e, Parser *p)
549 AVExpr *e0, *e1, *e2;
550 if ((ret = parse_factor(&e0, p)) < 0)
552 while (p->s[0]=='*' || p->s[0]=='/') {
555 if ((ret = parse_factor(&e2, p)) < 0) {
559 e0 = make_eval_expr(c == '*' ? e_mul : e_div, 1, e1, e2);
563 return AVERROR(ENOMEM);
570 static int parse_subexpr(AVExpr **e, Parser *p)
573 AVExpr *e0, *e1, *e2;
574 if ((ret = parse_term(&e0, p)) < 0)
576 while (*p->s == '+' || *p->s == '-') {
578 if ((ret = parse_term(&e2, p)) < 0) {
582 e0 = make_eval_expr(e_add, 1, e1, e2);
586 return AVERROR(ENOMEM);
594 static int parse_expr(AVExpr **e, Parser *p)
597 AVExpr *e0, *e1, *e2;
598 if (p->stack_index <= 0) //protect against stack overflows
599 return AVERROR(EINVAL);
602 if ((ret = parse_subexpr(&e0, p)) < 0)
604 while (*p->s == ';') {
607 if ((ret = parse_subexpr(&e2, p)) < 0) {
611 e0 = make_eval_expr(e_last, 1, e1, e2);
615 return AVERROR(ENOMEM);
624 static int verify_expr(AVExpr *e)
629 case e_const: return 1;
643 return verify_expr(e->param[0]) && !e->param[1];
645 return verify_expr(e->param[0])
646 && (!e->param[1] || verify_expr(e->param[1]));
650 return verify_expr(e->param[0]) && verify_expr(e->param[1])
651 && (!e->param[2] || verify_expr(e->param[2]));
654 return verify_expr(e->param[0]) &&
655 verify_expr(e->param[1]) &&
656 verify_expr(e->param[2]);
657 default: return verify_expr(e->param[0]) && verify_expr(e->param[1]) && !e->param[2];
661 int av_expr_parse(AVExpr **expr, const char *s,
662 const char * const *const_names,
663 const char * const *func1_names, double (* const *funcs1)(void *, double),
664 const char * const *func2_names, double (* const *funcs2)(void *, double, double),
665 int log_offset, void *log_ctx)
669 char *w = av_malloc(strlen(s) + 1);
675 return AVERROR(ENOMEM);
678 if (!av_isspace(*s++)) *wp++ = s[-1];
681 p.class = &eval_class;
684 p.const_names = const_names;
686 p.func1_names = func1_names;
688 p.func2_names = func2_names;
689 p.log_offset = log_offset;
692 if ((ret = parse_expr(&e, &p)) < 0)
695 av_log(&p, AV_LOG_ERROR, "Invalid chars '%s' at the end of expression '%s'\n", p.s, s0);
696 ret = AVERROR(EINVAL);
699 if (!verify_expr(e)) {
700 ret = AVERROR(EINVAL);
703 e->var= av_mallocz(sizeof(double) *VARS);
705 ret = AVERROR(ENOMEM);
716 double av_expr_eval(AVExpr *e, const double *const_values, void *opaque)
721 p.const_values = const_values;
723 return eval_expr(&p, e);
726 int av_expr_parse_and_eval(double *d, const char *s,
727 const char * const *const_names, const double *const_values,
728 const char * const *func1_names, double (* const *funcs1)(void *, double),
729 const char * const *func2_names, double (* const *funcs2)(void *, double, double),
730 void *opaque, int log_offset, void *log_ctx)
733 int ret = av_expr_parse(&e, s, const_names, func1_names, funcs1, func2_names, funcs2, log_offset, log_ctx);
739 *d = av_expr_eval(e, const_values, opaque);
741 return isnan(*d) ? AVERROR(EINVAL) : 0;