2 * simple arithmetic expression evaluator
4 * Copyright (c) 2002-2006 Michael Niedermayer <michaelni@gmx.at>
5 * Copyright (c) 2006 Oded Shimon <ods15@ods15.dyndns.org>
7 * This file is part of FFmpeg.
9 * FFmpeg is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public
11 * License as published by the Free Software Foundation; either
12 * version 2.1 of the License, or (at your option) any later version.
14 * FFmpeg is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with FFmpeg; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26 * simple arithmetic expression evaluator.
28 * see http://joe.hotchkiss.com/programming/eval/eval.html
32 #include "mpegvideo.h"
45 #define M_PI 3.14159265358979323846
48 typedef struct Parser{
52 const char **const_name; // NULL terminated
53 double (**func1)(void *, double a); // NULL terminated
54 const char **func1_name; // NULL terminated
55 double (**func2)(void *, double a, double b); // NULL terminated
56 char **func2_name; // NULL terminated
63 static int8_t si_prefixes['z' - 'E' + 1]={
86 /** strtod() function extended with 'k', 'M', 'G', 'ki', 'Mi', 'Gi' and 'B'
87 * postfixes. This allows using f.e. kB, MiB, G and B as a postfix. This
88 * function assumes that the unit of numbers is bits not bytes.
90 static double av_strtod(const char *name, char **tail) {
93 d = strtod(name, &next);
94 /* if parsing succeeded, check for and interpret postfixes */
97 if(*next >= 'E' && *next <= 'z'){
98 int e= si_prefixes[*next - 'E'];
115 /* if requested, fill in tail with the position after the last parsed
122 static int strmatch(const char *s, const char *prefix){
124 for(i=0; prefix[i]; i++){
125 if(prefix[i] != s[i]) return 0;
132 e_value, e_const, e_func0, e_func1, e_func2,
133 e_squish, e_gauss, e_ld,
134 e_mod, e_max, e_min, e_eq, e_gt, e_gte,
135 e_pow, e_mul, e_div, e_add,
136 e_last, e_st, e_while,
138 double value; // is sign in other types
141 double (*func0)(double);
142 double (*func1)(void *, double);
143 double (*func2)(void *, double, double);
145 AVEvalExpr * param[2];
148 static double eval_expr(Parser * p, AVEvalExpr * e) {
150 case e_value: return e->value;
151 case e_const: return e->value * p->const_value[e->a.const_index];
152 case e_func0: return e->value * e->a.func0(eval_expr(p, e->param[0]));
153 case e_func1: return e->value * e->a.func1(p->opaque, eval_expr(p, e->param[0]));
154 case e_func2: return e->value * e->a.func2(p->opaque, eval_expr(p, e->param[0]), eval_expr(p, e->param[1]));
155 case e_squish: return 1/(1+exp(4*eval_expr(p, e->param[0])));
156 case e_gauss: { double d = eval_expr(p, e->param[0]); return exp(-d*d/2)/sqrt(2*M_PI); }
157 case e_ld: return e->value * p->var[av_clip(eval_expr(p, e->param[0]), 0, VARS-1)];
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 AVEvalExpr * parse_expr(Parser *p);
188 void ff_eval_free(AVEvalExpr * e) {
190 ff_eval_free(e->param[0]);
191 ff_eval_free(e->param[1]);
195 static AVEvalExpr * parse_primary(Parser *p) {
196 AVEvalExpr * d = av_mallocz(sizeof(AVEvalExpr));
201 d->value = av_strtod(p->s, &next);
209 /* named constants */
210 for(i=0; p->const_name && p->const_name[i]; i++){
211 if(strmatch(p->s, p->const_name[i])){
212 p->s+= strlen(p->const_name[i]);
214 d->a.const_index = i;
219 p->s= strchr(p->s, '(');
221 *p->error = "missing (";
227 if (*next == '(') { // special case do-nothing
231 *p->error = "missing )";
238 d->param[0] = parse_expr(p);
241 d->param[1] = parse_expr(p);
244 *p->error = "missing )";
251 if( strmatch(next, "sinh" ) ) d->a.func0 = sinh;
252 else if( strmatch(next, "cosh" ) ) d->a.func0 = cosh;
253 else if( strmatch(next, "tanh" ) ) d->a.func0 = tanh;
254 else if( strmatch(next, "sin" ) ) d->a.func0 = sin;
255 else if( strmatch(next, "cos" ) ) d->a.func0 = cos;
256 else if( strmatch(next, "tan" ) ) d->a.func0 = tan;
257 else if( strmatch(next, "atan" ) ) d->a.func0 = atan;
258 else if( strmatch(next, "asin" ) ) d->a.func0 = asin;
259 else if( strmatch(next, "acos" ) ) d->a.func0 = acos;
260 else if( strmatch(next, "exp" ) ) d->a.func0 = exp;
261 else if( strmatch(next, "log" ) ) d->a.func0 = log;
262 else if( strmatch(next, "abs" ) ) d->a.func0 = fabs;
263 else if( strmatch(next, "squish") ) d->type = e_squish;
264 else if( strmatch(next, "gauss" ) ) d->type = e_gauss;
265 else if( strmatch(next, "mod" ) ) d->type = e_mod;
266 else if( strmatch(next, "max" ) ) d->type = e_max;
267 else if( strmatch(next, "min" ) ) d->type = e_min;
268 else if( strmatch(next, "eq" ) ) d->type = e_eq;
269 else if( strmatch(next, "gte" ) ) d->type = e_gte;
270 else if( strmatch(next, "gt" ) ) d->type = e_gt;
271 else if( strmatch(next, "lte" ) ) { AVEvalExpr * tmp = d->param[1]; d->param[1] = d->param[0]; d->param[0] = tmp; d->type = e_gt; }
272 else if( strmatch(next, "lt" ) ) { AVEvalExpr * tmp = d->param[1]; d->param[1] = d->param[0]; d->param[0] = tmp; d->type = e_gte; }
273 else if( strmatch(next, "ld" ) ) d->type = e_ld;
274 else if( strmatch(next, "st" ) ) d->type = e_st;
275 else if( strmatch(next, "while" ) ) d->type = e_while;
277 for(i=0; p->func1_name && p->func1_name[i]; i++){
278 if(strmatch(next, p->func1_name[i])){
279 d->a.func1 = p->func1[i];
285 for(i=0; p->func2_name && p->func2_name[i]; i++){
286 if(strmatch(next, p->func2_name[i])){
287 d->a.func2 = p->func2[i];
293 *p->error = "unknown function";
301 static AVEvalExpr * new_eval_expr(int type, int value, AVEvalExpr *p0, AVEvalExpr *p1){
302 AVEvalExpr * e = av_mallocz(sizeof(AVEvalExpr));
310 static AVEvalExpr * parse_pow(Parser *p, int *sign){
311 *sign= (*p->s == '+') - (*p->s == '-');
313 return parse_primary(p);
316 static AVEvalExpr * parse_factor(Parser *p){
318 AVEvalExpr * e = parse_pow(p, &sign);
321 e= new_eval_expr(e_pow, 1, e, parse_pow(p, &sign2));
322 if (e->param[1]) e->param[1]->value *= (sign2|1);
324 if (e) e->value *= (sign|1);
328 static AVEvalExpr * parse_term(Parser *p){
329 AVEvalExpr * e = parse_factor(p);
330 while(p->s[0]=='*' || p->s[0]=='/'){
332 e= new_eval_expr(c == '*' ? e_mul : e_div, 1, e, parse_factor(p));
337 static AVEvalExpr * parse_subexpr(Parser *p) {
338 AVEvalExpr * e = parse_term(p);
339 while(*p->s == '+' || *p->s == '-') {
340 e= new_eval_expr(e_add, 1, e, parse_term(p));
346 static AVEvalExpr * parse_expr(Parser *p) {
349 if(p->stack_index <= 0) //protect against stack overflows
353 e = parse_subexpr(p);
355 while(*p->s == ';') {
357 e= new_eval_expr(e_last, 1, e, parse_subexpr(p));
365 static int verify_expr(AVEvalExpr * e) {
369 case e_const: return 1;
374 case e_gauss: return verify_expr(e->param[0]);
375 default: return verify_expr(e->param[0]) && verify_expr(e->param[1]);
379 AVEvalExpr * ff_parse(char *s, const char **const_name,
380 double (**func1)(void *, double), const char **func1_name,
381 double (**func2)(void *, double, double), char **func2_name,
385 char w[strlen(s) + 1], * wp = w;
388 if (!isspace(*s++)) *wp++ = s[-1];
393 p.const_name = const_name;
395 p.func1_name = func1_name;
397 p.func2_name = func2_name;
401 if (!verify_expr(e)) {
408 double ff_parse_eval(AVEvalExpr * e, double *const_value, void *opaque) {
411 p.const_value= const_value;
413 return eval_expr(&p, e);
416 double ff_eval2(char *s, double *const_value, const char **const_name,
417 double (**func1)(void *, double), const char **func1_name,
418 double (**func2)(void *, double, double), char **func2_name,
419 void *opaque, char **error){
420 AVEvalExpr * e = ff_parse(s, const_name, func1, func1_name, func2, func2_name, error);
423 d = ff_parse_eval(e, const_value, opaque);
428 #if LIBAVCODEC_VERSION_INT < ((52<<16)+(0<<8)+0)
429 attribute_deprecated double ff_eval(char *s, double *const_value, const char **const_name,
430 double (**func1)(void *, double), const char **func1_name,
431 double (**func2)(void *, double, double), char **func2_name,
435 ret = ff_eval2(s, const_value, const_name, func1, func1_name, func2, func2_name, opaque, &error);
437 av_log(NULL, AV_LOG_ERROR, "Error evaluating \"%s\": %s\n", s, error);
444 static double const_values[]={
449 static const char *const_names[]={
456 printf("%f == 12.7\n", ff_eval("1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)", const_values, const_names, NULL, NULL, NULL, NULL, NULL));
457 printf("%f == 0.931322575\n", ff_eval("80G/80Gi", const_values, const_names, NULL, NULL, NULL, NULL, NULL));
459 for(i=0; i<1050; i++){
461 ff_eval("1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)", const_values, const_names, NULL, NULL, NULL, NULL, NULL);
462 STOP_TIMER("ff_eval")