falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
87013 Commits
32 Branches
541MB
Tree: 1146133df8
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '1146133df8'
${ noResults }
FFmpeg/libavutil/eval.c

754 lines
25KB
Raw Blame History 

  1. /*

  2.  * Copyright (c) 2002-2006 Michael Niedermayer <michaelni@gmx.at>

  3.  * Copyright (c) 2006 Oded Shimon <ods15@ods15.dyndns.org>

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

  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.

  11.  *

  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.

  16.  *

  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

  20.  */

  21. 

  22. /**

  23.  * @file

  24.  * simple arithmetic expression evaluator.

  25.  *

  26.  * see http://joe.hotchkiss.com/programming/eval/eval.html

  27.  */

  28. 

  29. #include <float.h>

  30. #include "attributes.h"

  31. #include "avutil.h"

  32. #include "common.h"

  33. #include "eval.h"

  34. #include "ffmath.h"

  35. #include "internal.h"

  36. #include "log.h"

  37. #include "mathematics.h"

  38. #include "time.h"

  39. #include "avstring.h"

  40. #include "timer.h"

  41. #include "reverse.h"

  42. 

  43. typedef struct Parser {

  44.     const AVClass *class;

  45.     int stack_index;

  46.     char *s;

  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

  53.     void *opaque;

  54.     int log_offset;

  55.     void *log_ctx;

  56. #define VARS 10

  57.     double *var;

  58. } Parser;

  59. 

  60. static const AVClass eval_class = { "Eval", av_default_item_name, NULL, LIBAVUTIL_VERSION_INT, offsetof(Parser,log_offset), offsetof(Parser,log_ctx) };

  61. 

  62. static const struct {

  63.     double bin_val;

  64.     double dec_val;

  65.     int8_t exp;

  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 },

  87. };

  88. 

  89. static const struct {

  90.     const char *name;

  91.     double value;

  92. } constants[] = {

  93.     { "E",   M_E   },

  94.     { "PI",  M_PI  },

  95.     { "PHI", M_PHI },

  96.     { "QP2LAMBDA", FF_QP2LAMBDA },

  97. };

  98. 

  99. double av_strtod(const char *numstr, char **tail)

  100. {

  101.     double d;

  102.     char *next;

  103.     if(numstr[0]=='0' && (numstr[1]|0x20)=='x') {

  104.         d = strtoul(numstr, &next, 16);

  105.     } else

  106.         d = strtod(numstr, &next);

  107.     /* if parsing succeeded, check for and interpret postfixes */

  108.     if (next!=numstr) {

  109.         if (next[0] == 'd' && next[1] == 'B') {

  110.             /* treat dB as decibels instead of decibytes */

  111.             d = ff_exp10(d / 20);

  112.             next += 2;

  113.         } else if (*next >= 'E' && *next <= 'z') {

  114.             int e= si_prefixes[*next - 'E'].exp;

  115.             if (e) {

  116.                 if (next[1] == 'i') {

  117.                     d*= si_prefixes[*next - 'E'].bin_val;

  118.                     next+=2;

  119.                 } else {

  120.                     d*= si_prefixes[*next - 'E'].dec_val;

  121.                     next++;

  122.                 }

  123.             }

  124.         }

  125. 

  126.         if (*next=='B') {

  127.             d*=8;

  128.             next++;

  129.         }

  130.     }

  131.     /* if requested, fill in tail with the position after the last parsed

  132.        character */

  133.     if (tail)

  134.         *tail = next;

  135.     return d;

  136. }

  137. 

  138. #define IS_IDENTIFIER_CHAR(c) ((c) - '0' <= 9U || (c) - 'a' <= 25U || (c) - 'A' <= 25U || (c) == '_')

  139. 

  140. static int strmatch(const char *s, const char *prefix)

  141. {

  142.     int i;

  143.     for (i=0; prefix[i]; i++) {

  144.         if (prefix[i] != s[i]) return 0;

  145.     }

  146.     /* return 1 only if the s identifier is terminated */

  147.     return !IS_IDENTIFIER_CHAR(s[i]);

  148. }

  149. 

  150. struct AVExpr {

  151.     enum {

  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, e_round,

  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, e_lerp,

  159.     } type;

  160.     double value; // is sign in other types

  161.     union {

  162.         int const_index;

  163.         double (*func0)(double);

  164.         double (*func1)(void *, double);

  165.         double (*func2)(void *, double, double);

  166.     } a;

  167.     struct AVExpr *param[3];

  168.     double *var;

  169. };

  170. 

  171. static double etime(double v)

  172. {

  173.     return av_gettime() * 0.000001;

  174. }

  175. 

  176. static double eval_expr(Parser *p, AVExpr *e)

  177. {

  178.     switch (e->type) {

  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_round:  return e->value * round(eval_expr(p, e->param[0]));

  193.         case e_sqrt:   return e->value * sqrt (eval_expr(p, e->param[0]));

  194.         case e_not:    return e->value * (eval_expr(p, e->param[0]) == 0);

  195.         case e_if:     return e->value * (eval_expr(p, e->param[0]) ? eval_expr(p, e->param[1]) :

  196.                                           e->param[2] ? eval_expr(p, e->param[2]) : 0);

  197.         case e_ifnot:  return e->value * (!eval_expr(p, e->param[0]) ? eval_expr(p, e->param[1]) :

  198.                                           e->param[2] ? eval_expr(p, e->param[2]) : 0);

  199.         case e_clip: {

  200.             double x = eval_expr(p, e->param[0]);

  201.             double min = eval_expr(p, e->param[1]), max = eval_expr(p, e->param[2]);

  202.             if (isnan(min) || isnan(max) || isnan(x) || min > max)

  203.                 return NAN;

  204.             return e->value * av_clipd(eval_expr(p, e->param[0]), min, max);

  205.         }

  206.         case e_between: {

  207.             double d = eval_expr(p, e->param[0]);

  208.             return e->value * (d >= eval_expr(p, e->param[1]) &&

  209.                                d <= eval_expr(p, e->param[2]));

  210.         }

  211.         case e_lerp: {

  212.             double v0 = eval_expr(p, e->param[0]);

  213.             double v1 = eval_expr(p, e->param[1]);

  214.             double f  = eval_expr(p, e->param[2]);

  215.             return v0 + (v1 - v0) * f;

  216.         }

  217.         case e_print: {

  218.             double x = eval_expr(p, e->param[0]);

  219.             int level = e->param[1] ? av_clip(eval_expr(p, e->param[1]), INT_MIN, INT_MAX) : AV_LOG_INFO;

  220.             av_log(p, level, "%f\n", x);

  221.             return x;

  222.         }

  223.         case e_random:{

  224.             int idx= av_clip(eval_expr(p, e->param[0]), 0, VARS-1);

  225.             uint64_t r= isnan(p->var[idx]) ? 0 : p->var[idx];

  226.             r= r*1664525+1013904223;

  227.             p->var[idx]= r;

  228.             return e->value * (r * (1.0/UINT64_MAX));

  229.         }

  230.         case e_while: {

  231.             double d = NAN;

  232.             while (eval_expr(p, e->param[0]))

  233.                 d=eval_expr(p, e->param[1]);

  234.             return d;

  235.         }

  236.         case e_taylor: {

  237.             double t = 1, d = 0, v;

  238.             double x = eval_expr(p, e->param[1]);

  239.             int id = e->param[2] ? av_clip(eval_expr(p, e->param[2]), 0, VARS-1) : 0;

  240.             int i;

  241.             double var0 = p->var[id];

  242.             for(i=0; i<1000; i++) {

  243.                 double ld = d;

  244.                 p->var[id] = i;

  245.                 v = eval_expr(p, e->param[0]);

  246.                 d += t*v;

  247.                 if(ld==d && v)

  248.                     break;

  249.                 t *= x / (i+1);

  250.             }

  251.             p->var[id] = var0;

  252.             return d;

  253.         }

  254.         case e_root: {

  255.             int i, j;

  256.             double low = -1, high = -1, v, low_v = -DBL_MAX, high_v = DBL_MAX;

  257.             double var0 = p->var[0];

  258.             double x_max = eval_expr(p, e->param[1]);

  259.             for(i=-1; i<1024; i++) {

  260.                 if(i<255) {

  261.                     p->var[0] = ff_reverse[i&255]*x_max/255;

  262.                 } else {

  263.                     p->var[0] = x_max*pow(0.9, i-255);

  264.                     if (i&1) p->var[0] *= -1;

  265.                     if (i&2) p->var[0] += low;

  266.                     else     p->var[0] += high;

  267.                 }

  268.                 v = eval_expr(p, e->param[0]);

  269.                 if (v<=0 && v>low_v) {

  270.                     low    = p->var[0];

  271.                     low_v  = v;

  272.                 }

  273.                 if (v>=0 && v<high_v) {

  274.                     high   = p->var[0];

  275.                     high_v = v;

  276.                 }

  277.                 if (low>=0 && high>=0){

  278.                     for (j=0; j<1000; j++) {

  279.                         p->var[0] = (low+high)*0.5;

  280.                         if (low == p->var[0] || high == p->var[0])

  281.                             break;

  282.                         v = eval_expr(p, e->param[0]);

  283.                         if (v<=0) low = p->var[0];

  284.                         if (v>=0) high= p->var[0];

  285.                         if (isnan(v)) {

  286.                             low = high = v;

  287.                             break;

  288.                         }

  289.                     }

  290.                     break;

  291.                 }

  292.             }

  293.             p->var[0] = var0;

  294.             return -low_v<high_v ? low : high;

  295.         }

  296.         default: {

  297.             double d = eval_expr(p, e->param[0]);

  298.             double d2 = eval_expr(p, e->param[1]);

  299.             switch (e->type) {

  300.                 case e_mod: return e->value * (d - floor((!CONFIG_FTRAPV || d2) ? d / d2 : d * INFINITY) * d2);

  301.                 case e_gcd: return e->value * av_gcd(d,d2);

  302.                 case e_max: return e->value * (d >  d2 ?   d : d2);

  303.                 case e_min: return e->value * (d <  d2 ?   d : d2);

  304.                 case e_eq:  return e->value * (d == d2 ? 1.0 : 0.0);

  305.                 case e_gt:  return e->value * (d >  d2 ? 1.0 : 0.0);

  306.                 case e_gte: return e->value * (d >= d2 ? 1.0 : 0.0);

  307.                 case e_lt:  return e->value * (d <  d2 ? 1.0 : 0.0);

  308.                 case e_lte: return e->value * (d <= d2 ? 1.0 : 0.0);

  309.                 case e_pow: return e->value * pow(d, d2);

  310.                 case e_mul: return e->value * (d * d2);

  311.                 case e_div: return e->value * ((!CONFIG_FTRAPV || d2 ) ? (d / d2) : d * INFINITY);

  312.                 case e_add: return e->value * (d + d2);

  313.                 case e_last:return e->value * d2;

  314.                 case e_st : return e->value * (p->var[av_clip(d, 0, VARS-1)]= d2);

  315.                 case e_hypot:return e->value * hypot(d, d2);

  316.                 case e_atan2:return e->value * atan2(d, d2);

  317.                 case e_bitand: return isnan(d) || isnan(d2) ? NAN : e->value * ((long int)d & (long int)d2);

  318.                 case e_bitor:  return isnan(d) || isnan(d2) ? NAN : e->value * ((long int)d | (long int)d2);

  319.             }

  320.         }

  321.     }

  322.     return NAN;

  323. }

  324. 

  325. static int parse_expr(AVExpr **e, Parser *p);

  326. 

  327. void av_expr_free(AVExpr *e)

  328. {

  329.     if (!e) return;

  330.     av_expr_free(e->param[0]);

  331.     av_expr_free(e->param[1]);

  332.     av_expr_free(e->param[2]);

  333.     av_freep(&e->var);

  334.     av_freep(&e);

  335. }

  336. 

  337. static int parse_primary(AVExpr **e, Parser *p)

  338. {

  339.     AVExpr *d = av_mallocz(sizeof(AVExpr));

  340.     char *next = p->s, *s0 = p->s;

  341.     int ret, i;

  342. 

  343.     if (!d)

  344.         return AVERROR(ENOMEM);

  345. 

  346.     /* number */

  347.     d->value = av_strtod(p->s, &next);

  348.     if (next != p->s) {

  349.         d->type = e_value;

  350.         p->s= next;

  351.         *e = d;

  352.         return 0;

  353.     }

  354.     d->value = 1;

  355. 

  356.     /* named constants */

  357.     for (i=0; p->const_names && p->const_names[i]; i++) {

  358.         if (strmatch(p->s, p->const_names[i])) {

  359.             p->s+= strlen(p->const_names[i]);

  360.             d->type = e_const;

  361.             d->a.const_index = i;

  362.             *e = d;

  363.             return 0;

  364.         }

  365.     }

  366.     for (i = 0; i < FF_ARRAY_ELEMS(constants); i++) {

  367.         if (strmatch(p->s, constants[i].name)) {

  368.             p->s += strlen(constants[i].name);

  369.             d->type = e_value;

  370.             d->value = constants[i].value;

  371.             *e = d;

  372.             return 0;

  373.         }

  374.     }

  375. 

  376.     p->s= strchr(p->s, '(');

  377.     if (!p->s) {

  378.         av_log(p, AV_LOG_ERROR, "Undefined constant or missing '(' in '%s'\n", s0);

  379.         p->s= next;

  380.         av_expr_free(d);

  381.         return AVERROR(EINVAL);

  382.     }

  383.     p->s++; // "("

  384.     if (*next == '(') { // special case do-nothing

  385.         av_freep(&d);

  386.         if ((ret = parse_expr(&d, p)) < 0)

  387.             return ret;

  388.         if (p->s[0] != ')') {

  389.             av_log(p, AV_LOG_ERROR, "Missing ')' in '%s'\n", s0);

  390.             av_expr_free(d);

  391.             return AVERROR(EINVAL);

  392.         }

  393.         p->s++; // ")"

  394.         *e = d;

  395.         return 0;

  396.     }

  397.     if ((ret = parse_expr(&(d->param[0]), p)) < 0) {

  398.         av_expr_free(d);

  399.         return ret;

  400.     }

  401.     if (p->s[0]== ',') {

  402.         p->s++; // ","

  403.         parse_expr(&d->param[1], p);

  404.     }

  405.     if (p->s[0]== ',') {

  406.         p->s++; // ","

  407.         parse_expr(&d->param[2], p);

  408.     }

  409.     if (p->s[0] != ')') {

  410.         av_log(p, AV_LOG_ERROR, "Missing ')' or too many args in '%s'\n", s0);

  411.         av_expr_free(d);

  412.         return AVERROR(EINVAL);

  413.     }

  414.     p->s++; // ")"

  415. 

  416.     d->type = e_func0;

  417.          if (strmatch(next, "sinh"  )) d->a.func0 = sinh;

  418.     else if (strmatch(next, "cosh"  )) d->a.func0 = cosh;

  419.     else if (strmatch(next, "tanh"  )) d->a.func0 = tanh;

  420.     else if (strmatch(next, "sin"   )) d->a.func0 = sin;

  421.     else if (strmatch(next, "cos"   )) d->a.func0 = cos;

  422.     else if (strmatch(next, "tan"   )) d->a.func0 = tan;

  423.     else if (strmatch(next, "atan"  )) d->a.func0 = atan;

  424.     else if (strmatch(next, "asin"  )) d->a.func0 = asin;

  425.     else if (strmatch(next, "acos"  )) d->a.func0 = acos;

  426.     else if (strmatch(next, "exp"   )) d->a.func0 = exp;

  427.     else if (strmatch(next, "log"   )) d->a.func0 = log;

  428.     else if (strmatch(next, "abs"   )) d->a.func0 = fabs;

  429.     else if (strmatch(next, "time"  )) d->a.func0 = etime;

  430.     else if (strmatch(next, "squish")) d->type = e_squish;

  431.     else if (strmatch(next, "gauss" )) d->type = e_gauss;

  432.     else if (strmatch(next, "mod"   )) d->type = e_mod;

  433.     else if (strmatch(next, "max"   )) d->type = e_max;

  434.     else if (strmatch(next, "min"   )) d->type = e_min;

  435.     else if (strmatch(next, "eq"    )) d->type = e_eq;

  436.     else if (strmatch(next, "gte"   )) d->type = e_gte;

  437.     else if (strmatch(next, "gt"    )) d->type = e_gt;

  438.     else if (strmatch(next, "lte"   )) d->type = e_lte;

  439.     else if (strmatch(next, "lt"    )) d->type = e_lt;

  440.     else if (strmatch(next, "ld"    )) d->type = e_ld;

  441.     else if (strmatch(next, "isnan" )) d->type = e_isnan;

  442.     else if (strmatch(next, "isinf" )) d->type = e_isinf;

  443.     else if (strmatch(next, "st"    )) d->type = e_st;

  444.     else if (strmatch(next, "while" )) d->type = e_while;

  445.     else if (strmatch(next, "taylor")) d->type = e_taylor;

  446.     else if (strmatch(next, "root"  )) d->type = e_root;

  447.     else if (strmatch(next, "floor" )) d->type = e_floor;

  448.     else if (strmatch(next, "ceil"  )) d->type = e_ceil;

  449.     else if (strmatch(next, "trunc" )) d->type = e_trunc;

  450.     else if (strmatch(next, "round" )) d->type = e_round;

  451.     else if (strmatch(next, "sqrt"  )) d->type = e_sqrt;

  452.     else if (strmatch(next, "not"   )) d->type = e_not;

  453.     else if (strmatch(next, "pow"   )) d->type = e_pow;

  454.     else if (strmatch(next, "print" )) d->type = e_print;

  455.     else if (strmatch(next, "random")) d->type = e_random;

  456.     else if (strmatch(next, "hypot" )) d->type = e_hypot;

  457.     else if (strmatch(next, "gcd"   )) d->type = e_gcd;

  458.     else if (strmatch(next, "if"    )) d->type = e_if;

  459.     else if (strmatch(next, "ifnot" )) d->type = e_ifnot;

  460.     else if (strmatch(next, "bitand")) d->type = e_bitand;

  461.     else if (strmatch(next, "bitor" )) d->type = e_bitor;

  462.     else if (strmatch(next, "between"))d->type = e_between;

  463.     else if (strmatch(next, "clip"  )) d->type = e_clip;

  464.     else if (strmatch(next, "atan2" )) d->type = e_atan2;

  465.     else if (strmatch(next, "lerp"  )) d->type = e_lerp;

  466.     else {

  467.         for (i=0; p->func1_names && p->func1_names[i]; i++) {

  468.             if (strmatch(next, p->func1_names[i])) {

  469.                 d->a.func1 = p->funcs1[i];

  470.                 d->type = e_func1;

  471.                 *e = d;

  472.                 return 0;

  473.             }

  474.         }

  475. 

  476.         for (i=0; p->func2_names && p->func2_names[i]; i++) {

  477.             if (strmatch(next, p->func2_names[i])) {

  478.                 d->a.func2 = p->funcs2[i];

  479.                 d->type = e_func2;

  480.                 *e = d;

  481.                 return 0;

  482.             }

  483.         }

  484. 

  485.         av_log(p, AV_LOG_ERROR, "Unknown function in '%s'\n", s0);

  486.         av_expr_free(d);

  487.         return AVERROR(EINVAL);

  488.     }

  489. 

  490.     *e = d;

  491.     return 0;

  492. }

  493. 

  494. static AVExpr *make_eval_expr(int type, int value, AVExpr *p0, AVExpr *p1)

  495. {

  496.     AVExpr *e = av_mallocz(sizeof(AVExpr));

  497.     if (!e)

  498.         return NULL;

  499.     e->type     =type   ;

  500.     e->value    =value  ;

  501.     e->param[0] =p0     ;

  502.     e->param[1] =p1     ;

  503.     return e;

  504. }

  505. 

  506. static int parse_pow(AVExpr **e, Parser *p, int *sign)

  507. {

  508.     *sign= (*p->s == '+') - (*p->s == '-');

  509.     p->s += *sign&1;

  510.     return parse_primary(e, p);

  511. }

  512. 

  513. static int parse_dB(AVExpr **e, Parser *p, int *sign)

  514. {

  515.     /* do not filter out the negative sign when parsing a dB value.

  516.        for example, -3dB is not the same as -(3dB) */

  517.     if (*p->s == '-') {

  518.         char *next;

  519.         double av_unused ignored = strtod(p->s, &next);

  520.         if (next != p->s && next[0] == 'd' && next[1] == 'B') {

  521.             *sign = 0;

  522.             return parse_primary(e, p);

  523.         }

  524.     }

  525.     return parse_pow(e, p, sign);

  526. }

  527. 

  528. static int parse_factor(AVExpr **e, Parser *p)

  529. {

  530.     int sign, sign2, ret;

  531.     AVExpr *e0, *e1, *e2;

  532.     if ((ret = parse_dB(&e0, p, &sign)) < 0)

  533.         return ret;

  534.     while(p->s[0]=='^'){

  535.         e1 = e0;

  536.         p->s++;

  537.         if ((ret = parse_dB(&e2, p, &sign2)) < 0) {

  538.             av_expr_free(e1);

  539.             return ret;

  540.         }

  541.         e0 = make_eval_expr(e_pow, 1, e1, e2);

  542.         if (!e0) {

  543.             av_expr_free(e1);

  544.             av_expr_free(e2);

  545.             return AVERROR(ENOMEM);

  546.         }

  547.         if (e0->param[1]) e0->param[1]->value *= (sign2|1);

  548.     }

  549.     if (e0) e0->value *= (sign|1);

  550. 

  551.     *e = e0;

  552.     return 0;

  553. }

  554. 

  555. static int parse_term(AVExpr **e, Parser *p)

  556. {

  557.     int ret;

  558.     AVExpr *e0, *e1, *e2;

  559.     if ((ret = parse_factor(&e0, p)) < 0)

  560.         return ret;

  561.     while (p->s[0]=='*' || p->s[0]=='/') {

  562.         int c= *p->s++;

  563.         e1 = e0;

  564.         if ((ret = parse_factor(&e2, p)) < 0) {

  565.             av_expr_free(e1);

  566.             return ret;

  567.         }

  568.         e0 = make_eval_expr(c == '*' ? e_mul : e_div, 1, e1, e2);

  569.         if (!e0) {

  570.             av_expr_free(e1);

  571.             av_expr_free(e2);

  572.             return AVERROR(ENOMEM);

  573.         }

  574.     }

  575.     *e = e0;

  576.     return 0;

  577. }

  578. 

  579. static int parse_subexpr(AVExpr **e, Parser *p)

  580. {

  581.     int ret;

  582.     AVExpr *e0, *e1, *e2;

  583.     if ((ret = parse_term(&e0, p)) < 0)

  584.         return ret;

  585.     while (*p->s == '+' || *p->s == '-') {

  586.         e1 = e0;

  587.         if ((ret = parse_term(&e2, p)) < 0) {

  588.             av_expr_free(e1);

  589.             return ret;

  590.         }

  591.         e0 = make_eval_expr(e_add, 1, e1, e2);

  592.         if (!e0) {

  593.             av_expr_free(e1);

  594.             av_expr_free(e2);

  595.             return AVERROR(ENOMEM);

  596.         }

  597.     };

  598. 

  599.     *e = e0;

  600.     return 0;

  601. }

  602. 

  603. static int parse_expr(AVExpr **e, Parser *p)

  604. {

  605.     int ret;

  606.     AVExpr *e0, *e1, *e2;

  607.     if (p->stack_index <= 0) //protect against stack overflows

  608.         return AVERROR(EINVAL);

  609.     p->stack_index--;

  610. 

  611.     if ((ret = parse_subexpr(&e0, p)) < 0)

  612.         return ret;

  613.     while (*p->s == ';') {

  614.         p->s++;

  615.         e1 = e0;

  616.         if ((ret = parse_subexpr(&e2, p)) < 0) {

  617.             av_expr_free(e1);

  618.             return ret;

  619.         }

  620.         e0 = make_eval_expr(e_last, 1, e1, e2);

  621.         if (!e0) {

  622.             av_expr_free(e1);

  623.             av_expr_free(e2);

  624.             return AVERROR(ENOMEM);

  625.         }

  626.     };

  627. 

  628.     p->stack_index++;

  629.     *e = e0;

  630.     return 0;

  631. }

  632. 

  633. static int verify_expr(AVExpr *e)

  634. {

  635.     if (!e) return 0;

  636.     switch (e->type) {

  637.         case e_value:

  638.         case e_const: return 1;

  639.         case e_func0:

  640.         case e_func1:

  641.         case e_squish:

  642.         case e_ld:

  643.         case e_gauss:

  644.         case e_isnan:

  645.         case e_isinf:

  646.         case e_floor:

  647.         case e_ceil:

  648.         case e_trunc:

  649.         case e_round:

  650.         case e_sqrt:

  651.         case e_not:

  652.         case e_random:

  653.             return verify_expr(e->param[0]) && !e->param[1];

  654.         case e_print:

  655.             return verify_expr(e->param[0])

  656.                    && (!e->param[1] || verify_expr(e->param[1]));

  657.         case e_if:

  658.         case e_ifnot:

  659.         case e_taylor:

  660.             return verify_expr(e->param[0]) && verify_expr(e->param[1])

  661.                    && (!e->param[2] || verify_expr(e->param[2]));

  662.         case e_between:

  663.         case e_clip:

  664.         case e_lerp:

  665.             return verify_expr(e->param[0]) &&

  666.                    verify_expr(e->param[1]) &&

  667.                    verify_expr(e->param[2]);

  668.         default: return verify_expr(e->param[0]) && verify_expr(e->param[1]) && !e->param[2];

  669.     }

  670. }

  671. 

  672. int av_expr_parse(AVExpr **expr, const char *s,

  673.                   const char * const *const_names,

  674.                   const char * const *func1_names, double (* const *funcs1)(void *, double),

  675.                   const char * const *func2_names, double (* const *funcs2)(void *, double, double),

  676.                   int log_offset, void *log_ctx)

  677. {

  678.     Parser p = { 0 };

  679.     AVExpr *e = NULL;

  680.     char *w = av_malloc(strlen(s) + 1);

  681.     char *wp = w;

  682.     const char *s0 = s;

  683.     int ret = 0;

  684. 

  685.     if (!w)

  686.         return AVERROR(ENOMEM);

  687. 

  688.     while (*s)

  689.         if (!av_isspace(*s++)) *wp++ = s[-1];

  690.     *wp++ = 0;

  691. 

  692.     p.class      = &eval_class;

  693.     p.stack_index=100;

  694.     p.s= w;

  695.     p.const_names = const_names;

  696.     p.funcs1      = funcs1;

  697.     p.func1_names = func1_names;

  698.     p.funcs2      = funcs2;

  699.     p.func2_names = func2_names;

  700.     p.log_offset = log_offset;

  701.     p.log_ctx    = log_ctx;

  702. 

  703.     if ((ret = parse_expr(&e, &p)) < 0)

  704.         goto end;

  705.     if (*p.s) {

  706.         av_log(&p, AV_LOG_ERROR, "Invalid chars '%s' at the end of expression '%s'\n", p.s, s0);

  707.         ret = AVERROR(EINVAL);

  708.         goto end;

  709.     }

  710.     if (!verify_expr(e)) {

  711.         ret = AVERROR(EINVAL);

  712.         goto end;

  713.     }

  714.     e->var= av_mallocz(sizeof(double) *VARS);

  715.     if (!e->var) {

  716.         ret = AVERROR(ENOMEM);

  717.         goto end;

  718.     }

  719.     *expr = e;

  720.     e = NULL;

  721. end:

  722.     av_expr_free(e);

  723.     av_free(w);

  724.     return ret;

  725. }

  726. 

  727. double av_expr_eval(AVExpr *e, const double *const_values, void *opaque)

  728. {

  729.     Parser p = { 0 };

  730.     p.var= e->var;

  731. 

  732.     p.const_values = const_values;

  733.     p.opaque     = opaque;

  734.     return eval_expr(&p, e);

  735. }

  736. 

  737. int av_expr_parse_and_eval(double *d, const char *s,

  738.                            const char * const *const_names, const double *const_values,

  739.                            const char * const *func1_names, double (* const *funcs1)(void *, double),

  740.                            const char * const *func2_names, double (* const *funcs2)(void *, double, double),

  741.                            void *opaque, int log_offset, void *log_ctx)

  742. {

  743.     AVExpr *e = NULL;

  744.     int ret = av_expr_parse(&e, s, const_names, func1_names, funcs1, func2_names, funcs2, log_offset, log_ctx);

  745. 

  746.     if (ret < 0) {

  747.         *d = NAN;

  748.         return ret;

  749.     }

  750.     *d = av_expr_eval(e, const_values, opaque);

  751.     av_expr_free(e);

  752.     return isnan(*d) ? AVERROR(EINVAL) : 0;

  753. }