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 Libav.
7 * Libav 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 * Libav 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 Libav; 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
33 #include "mathematics.h"
35 typedef struct Parser {
39 const double *const_values;
40 const char * const *const_names; // NULL terminated
41 double (* const *funcs1)(void *, double a); // NULL terminated
42 const char * const *func1_names; // NULL terminated
43 double (* const *funcs2)(void *, double a, double b); // NULL terminated
44 const char * const *func2_names; // NULL terminated
52 static const AVClass class = { "Eval", av_default_item_name, NULL, LIBAVUTIL_VERSION_INT, offsetof(Parser,log_offset), offsetof(Parser,log_ctx) };
54 static const int8_t si_prefixes['z' - 'E' + 1] = {
77 double av_strtod(const char *numstr, char **tail)
81 d = strtod(numstr, &next);
82 /* if parsing succeeded, check for and interpret postfixes */
84 if (*next >= 'E' && *next <= 'z') {
85 int e= si_prefixes[*next - 'E'];
102 /* if requested, fill in tail with the position after the last parsed
109 #define IS_IDENTIFIER_CHAR(c) ((c) - '0' <= 9U || (c) - 'a' <= 25U || (c) - 'A' <= 25U || (c) == '_')
111 static int strmatch(const char *s, const char *prefix)
114 for (i=0; prefix[i]; i++) {
115 if (prefix[i] != s[i]) return 0;
117 /* return 1 only if the s identifier is terminated */
118 return !IS_IDENTIFIER_CHAR(s[i]);
123 e_value, e_const, e_func0, e_func1, e_func2,
124 e_squish, e_gauss, e_ld, e_isnan, e_isinf,
125 e_mod, e_max, e_min, e_eq, e_gt, e_gte,
126 e_pow, e_mul, e_div, e_add,
127 e_last, e_st, e_while, e_floor, e_ceil, e_trunc,
130 double value; // is sign in other types
133 double (*func0)(double);
134 double (*func1)(void *, double);
135 double (*func2)(void *, double, double);
137 struct AVExpr *param[2];
140 static double eval_expr(Parser *p, AVExpr *e)
143 case e_value: return e->value;
144 case e_const: return e->value * p->const_values[e->a.const_index];
145 case e_func0: return e->value * e->a.func0(eval_expr(p, e->param[0]));
146 case e_func1: return e->value * e->a.func1(p->opaque, eval_expr(p, e->param[0]));
147 case e_func2: return e->value * e->a.func2(p->opaque, eval_expr(p, e->param[0]), eval_expr(p, e->param[1]));
148 case e_squish: return 1/(1+exp(4*eval_expr(p, e->param[0])));
149 case e_gauss: { double d = eval_expr(p, e->param[0]); return exp(-d*d/2)/sqrt(2*M_PI); }
150 case e_ld: return e->value * p->var[av_clip(eval_expr(p, e->param[0]), 0, VARS-1)];
151 case e_isnan: return e->value * !!isnan(eval_expr(p, e->param[0]));
152 case e_isinf: return e->value * !!isinf(eval_expr(p, e->param[0]));
153 case e_floor: return e->value * floor(eval_expr(p, e->param[0]));
154 case e_ceil : return e->value * ceil (eval_expr(p, e->param[0]));
155 case e_trunc: return e->value * trunc(eval_expr(p, e->param[0]));
156 case e_sqrt: return e->value * sqrt (eval_expr(p, e->param[0]));
157 case e_not: return e->value * eval_expr(p, e->param[0]) == 0;
160 while (eval_expr(p, e->param[0]))
161 d=eval_expr(p, e->param[1]);
165 double d = eval_expr(p, e->param[0]);
166 double d2 = eval_expr(p, e->param[1]);
168 case e_mod: return e->value * (d - floor(d/d2)*d2);
169 case e_max: return e->value * (d > d2 ? d : d2);
170 case e_min: return e->value * (d < d2 ? d : d2);
171 case e_eq: return e->value * (d == d2 ? 1.0 : 0.0);
172 case e_gt: return e->value * (d > d2 ? 1.0 : 0.0);
173 case e_gte: return e->value * (d >= d2 ? 1.0 : 0.0);
174 case e_pow: return e->value * pow(d, d2);
175 case e_mul: return e->value * (d * d2);
176 case e_div: return e->value * (d / d2);
177 case e_add: return e->value * (d + d2);
178 case e_last:return e->value * d2;
179 case e_st : return e->value * (p->var[av_clip(d, 0, VARS-1)]= d2);
186 static int parse_expr(AVExpr **e, Parser *p);
188 void av_expr_free(AVExpr *e)
191 av_expr_free(e->param[0]);
192 av_expr_free(e->param[1]);
196 static int parse_primary(AVExpr **e, Parser *p)
198 AVExpr *d = av_mallocz(sizeof(AVExpr));
199 char *next = p->s, *s0 = p->s;
203 return AVERROR(ENOMEM);
206 d->value = av_strtod(p->s, &next);
215 /* named constants */
216 for (i=0; p->const_names && p->const_names[i]; i++) {
217 if (strmatch(p->s, p->const_names[i])) {
218 p->s+= strlen(p->const_names[i]);
220 d->a.const_index = i;
226 p->s= strchr(p->s, '(');
228 av_log(p, AV_LOG_ERROR, "Undefined constant or missing '(' in '%s'\n", s0);
231 return AVERROR(EINVAL);
234 if (*next == '(') { // special case do-nothing
236 if ((ret = parse_expr(&d, p)) < 0)
238 if (p->s[0] != ')') {
239 av_log(p, AV_LOG_ERROR, "Missing ')' in '%s'\n", s0);
241 return AVERROR(EINVAL);
247 if ((ret = parse_expr(&(d->param[0]), p)) < 0) {
253 parse_expr(&d->param[1], p);
255 if (p->s[0] != ')') {
256 av_log(p, AV_LOG_ERROR, "Missing ')' or too many args in '%s'\n", s0);
258 return AVERROR(EINVAL);
263 if (strmatch(next, "sinh" )) d->a.func0 = sinh;
264 else if (strmatch(next, "cosh" )) d->a.func0 = cosh;
265 else if (strmatch(next, "tanh" )) d->a.func0 = tanh;
266 else if (strmatch(next, "sin" )) d->a.func0 = sin;
267 else if (strmatch(next, "cos" )) d->a.func0 = cos;
268 else if (strmatch(next, "tan" )) d->a.func0 = tan;
269 else if (strmatch(next, "atan" )) d->a.func0 = atan;
270 else if (strmatch(next, "asin" )) d->a.func0 = asin;
271 else if (strmatch(next, "acos" )) d->a.func0 = acos;
272 else if (strmatch(next, "exp" )) d->a.func0 = exp;
273 else if (strmatch(next, "log" )) d->a.func0 = log;
274 else if (strmatch(next, "abs" )) d->a.func0 = fabs;
275 else if (strmatch(next, "squish")) d->type = e_squish;
276 else if (strmatch(next, "gauss" )) d->type = e_gauss;
277 else if (strmatch(next, "mod" )) d->type = e_mod;
278 else if (strmatch(next, "max" )) d->type = e_max;
279 else if (strmatch(next, "min" )) d->type = e_min;
280 else if (strmatch(next, "eq" )) d->type = e_eq;
281 else if (strmatch(next, "gte" )) d->type = e_gte;
282 else if (strmatch(next, "gt" )) d->type = e_gt;
283 else if (strmatch(next, "lte" )) { AVExpr *tmp = d->param[1]; d->param[1] = d->param[0]; d->param[0] = tmp; d->type = e_gte; }
284 else if (strmatch(next, "lt" )) { AVExpr *tmp = d->param[1]; d->param[1] = d->param[0]; d->param[0] = tmp; d->type = e_gt; }
285 else if (strmatch(next, "ld" )) d->type = e_ld;
286 else if (strmatch(next, "isnan" )) d->type = e_isnan;
287 else if (strmatch(next, "isinf" )) d->type = e_isinf;
288 else if (strmatch(next, "st" )) d->type = e_st;
289 else if (strmatch(next, "while" )) d->type = e_while;
290 else if (strmatch(next, "floor" )) d->type = e_floor;
291 else if (strmatch(next, "ceil" )) d->type = e_ceil;
292 else if (strmatch(next, "trunc" )) d->type = e_trunc;
293 else if (strmatch(next, "sqrt" )) d->type = e_sqrt;
294 else if (strmatch(next, "not" )) d->type = e_not;
296 for (i=0; p->func1_names && p->func1_names[i]; i++) {
297 if (strmatch(next, p->func1_names[i])) {
298 d->a.func1 = p->funcs1[i];
305 for (i=0; p->func2_names && p->func2_names[i]; i++) {
306 if (strmatch(next, p->func2_names[i])) {
307 d->a.func2 = p->funcs2[i];
314 av_log(p, AV_LOG_ERROR, "Unknown function in '%s'\n", s0);
316 return AVERROR(EINVAL);
323 static AVExpr *new_eval_expr(int type, int value, AVExpr *p0, AVExpr *p1)
325 AVExpr *e = av_mallocz(sizeof(AVExpr));
335 static int parse_pow(AVExpr **e, Parser *p, int *sign)
337 *sign= (*p->s == '+') - (*p->s == '-');
339 return parse_primary(e, p);
342 static int parse_factor(AVExpr **e, Parser *p)
344 int sign, sign2, ret;
345 AVExpr *e0, *e1, *e2;
346 if ((ret = parse_pow(&e0, p, &sign)) < 0)
351 if ((ret = parse_pow(&e2, p, &sign2)) < 0) {
355 e0 = new_eval_expr(e_pow, 1, e1, e2);
359 return AVERROR(ENOMEM);
361 if (e0->param[1]) e0->param[1]->value *= (sign2|1);
363 if (e0) e0->value *= (sign|1);
369 static int parse_term(AVExpr **e, Parser *p)
372 AVExpr *e0, *e1, *e2;
373 if ((ret = parse_factor(&e0, p)) < 0)
375 while (p->s[0]=='*' || p->s[0]=='/') {
378 if ((ret = parse_factor(&e2, p)) < 0) {
382 e0 = new_eval_expr(c == '*' ? e_mul : e_div, 1, e1, e2);
386 return AVERROR(ENOMEM);
393 static int parse_subexpr(AVExpr **e, Parser *p)
396 AVExpr *e0, *e1, *e2;
397 if ((ret = parse_term(&e0, p)) < 0)
399 while (*p->s == '+' || *p->s == '-') {
401 if ((ret = parse_term(&e2, p)) < 0) {
405 e0 = new_eval_expr(e_add, 1, e1, e2);
409 return AVERROR(ENOMEM);
417 static int parse_expr(AVExpr **e, Parser *p)
420 AVExpr *e0, *e1, *e2;
421 if (p->stack_index <= 0) //protect against stack overflows
422 return AVERROR(EINVAL);
425 if ((ret = parse_subexpr(&e0, p)) < 0)
427 while (*p->s == ';') {
430 if ((ret = parse_subexpr(&e2, p)) < 0) {
434 e0 = new_eval_expr(e_last, 1, e1, e2);
438 return AVERROR(ENOMEM);
447 static int verify_expr(AVExpr *e)
452 case e_const: return 1;
465 return verify_expr(e->param[0]);
466 default: return verify_expr(e->param[0]) && verify_expr(e->param[1]);
470 int av_expr_parse(AVExpr **expr, const char *s,
471 const char * const *const_names,
472 const char * const *func1_names, double (* const *funcs1)(void *, double),
473 const char * const *func2_names, double (* const *funcs2)(void *, double, double),
474 int log_offset, void *log_ctx)
478 char *w = av_malloc(strlen(s) + 1);
484 return AVERROR(ENOMEM);
487 if (!isspace(*s++)) *wp++ = s[-1];
493 p.const_names = const_names;
495 p.func1_names = func1_names;
497 p.func2_names = func2_names;
498 p.log_offset = log_offset;
501 if ((ret = parse_expr(&e, &p)) < 0)
505 av_log(&p, AV_LOG_ERROR, "Invalid chars '%s' at the end of expression '%s'\n", p.s, s0);
506 ret = AVERROR(EINVAL);
509 if (!verify_expr(e)) {
511 ret = AVERROR(EINVAL);
520 double av_expr_eval(AVExpr *e, const double *const_values, void *opaque)
524 p.const_values = const_values;
526 return eval_expr(&p, e);
529 int av_expr_parse_and_eval(double *d, const char *s,
530 const char * const *const_names, const double *const_values,
531 const char * const *func1_names, double (* const *funcs1)(void *, double),
532 const char * const *func2_names, double (* const *funcs2)(void *, double, double),
533 void *opaque, int log_offset, void *log_ctx)
536 int ret = av_expr_parse(&e, s, const_names, func1_names, funcs1, func2_names, funcs2, log_offset, log_ctx);
542 *d = av_expr_eval(e, const_values, opaque);
544 return isnan(*d) ? AVERROR(EINVAL) : 0;
551 static const double const_values[] = {
557 static const char *const const_names[] = {
563 int main(int argc, char **argv)
567 const char *const *expr;
568 static const char *const exprs[] = {
574 "1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)",
595 "bar + PI + E + 100f*2 + foo",
596 "13k + 12f - foo(1, 2)",
609 /* compute 1+2+...+N */
610 "st(0, 1); while(lte(ld(0), 100), st(1, ld(1)+ld(0));st(0, ld(0)+1)); ld(1)",
612 "st(1, 1); st(2, 2); st(0, 1); while(lte(ld(0),10), st(3, ld(1)+ld(2)); st(1, ld(2)); st(2, ld(3)); st(0, ld(0)+1)); ld(3)",
614 "st(0, 1); while(lte(ld(0),100), st(1, ld(1)+ld(0)); st(0, ld(0)+1))",
636 for (expr = exprs; *expr; expr++) {
637 printf("Evaluating '%s'\n", *expr);
638 av_expr_parse_and_eval(&d, *expr,
639 const_names, const_values,
640 NULL, NULL, NULL, NULL, NULL, 0, NULL);
642 printf("'%s' -> nan\n\n", *expr);
644 printf("'%s' -> %f\n\n", *expr, d);
647 av_expr_parse_and_eval(&d, "1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)",
648 const_names, const_values,
649 NULL, NULL, NULL, NULL, NULL, 0, NULL);
650 printf("%f == 12.7\n", d);
651 av_expr_parse_and_eval(&d, "80G/80Gi",
652 const_names, const_values,
653 NULL, NULL, NULL, NULL, NULL, 0, NULL);
654 printf("%f == 0.931322575\n", d);
656 if (argc > 1 && !strcmp(argv[1], "-t")) {
657 for (i = 0; i < 1050; i++) {
659 av_expr_parse_and_eval(&d, "1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)",
660 const_names, const_values,
661 NULL, NULL, NULL, NULL, NULL, 0, NULL);
662 STOP_TIMER("av_expr_parse_and_eval");