eval.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760
  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. * @file
  23. * simple arithmetic expression evaluator.
  24. *
  25. * see http://joe.hotchkiss.com/programming/eval/eval.html
  26. */
  27. #include <float.h>
  28. #include "attributes.h"
  29. #include "avutil.h"
  30. #include "common.h"
  31. #include "eval.h"
  32. #include "ffmath.h"
  33. #include "internal.h"
  34. #include "log.h"
  35. #include "mathematics.h"
  36. #include "time.h"
  37. #include "avstring.h"
  38. #include "timer.h"
  39. #include "reverse.h"
  40. typedef struct Parser {
  41. const AVClass *class;
  42. int stack_index;
  43. char *s;
  44. const double *const_values;
  45. const char * const *const_names; // NULL terminated
  46. double (* const *funcs1)(void *, double a); // NULL terminated
  47. const char * const *func1_names; // NULL terminated
  48. double (* const *funcs2)(void *, double a, double b); // NULL terminated
  49. const char * const *func2_names; // NULL terminated
  50. void *opaque;
  51. int log_offset;
  52. void *log_ctx;
  53. #define VARS 10
  54. double *var;
  55. } Parser;
  56. static const AVClass eval_class = {
  57. .class_name = "Eval",
  58. .item_name = av_default_item_name,
  59. .option = NULL,
  60. .version = LIBAVUTIL_VERSION_INT,
  61. .log_level_offset_offset = offsetof(Parser, log_offset),
  62. .parent_log_context_offset = offsetof(Parser, log_ctx),
  63. };
  64. static const struct {
  65. double bin_val;
  66. double dec_val;
  67. int8_t exp;
  68. } si_prefixes['z' - 'E' + 1] = {
  69. ['y'-'E']= { 8.271806125530276749e-25, 1e-24, -24 },
  70. ['z'-'E']= { 8.4703294725430034e-22, 1e-21, -21 },
  71. ['a'-'E']= { 8.6736173798840355e-19, 1e-18, -18 },
  72. ['f'-'E']= { 8.8817841970012523e-16, 1e-15, -15 },
  73. ['p'-'E']= { 9.0949470177292824e-13, 1e-12, -12 },
  74. ['n'-'E']= { 9.3132257461547852e-10, 1e-9, -9 },
  75. ['u'-'E']= { 9.5367431640625e-7, 1e-6, -6 },
  76. ['m'-'E']= { 9.765625e-4, 1e-3, -3 },
  77. ['c'-'E']= { 9.8431332023036951e-3, 1e-2, -2 },
  78. ['d'-'E']= { 9.921256574801246e-2, 1e-1, -1 },
  79. ['h'-'E']= { 1.0159366732596479e2, 1e2, 2 },
  80. ['k'-'E']= { 1.024e3, 1e3, 3 },
  81. ['K'-'E']= { 1.024e3, 1e3, 3 },
  82. ['M'-'E']= { 1.048576e6, 1e6, 6 },
  83. ['G'-'E']= { 1.073741824e9, 1e9, 9 },
  84. ['T'-'E']= { 1.099511627776e12, 1e12, 12 },
  85. ['P'-'E']= { 1.125899906842624e15, 1e15, 15 },
  86. ['E'-'E']= { 1.152921504606847e18, 1e18, 18 },
  87. ['Z'-'E']= { 1.1805916207174113e21, 1e21, 21 },
  88. ['Y'-'E']= { 1.2089258196146292e24, 1e24, 24 },
  89. };
  90. static const struct {
  91. const char *name;
  92. double value;
  93. } constants[] = {
  94. { "E", M_E },
  95. { "PI", M_PI },
  96. { "PHI", M_PHI },
  97. { "QP2LAMBDA", FF_QP2LAMBDA },
  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. if (*next=='B') {
  126. d*=8;
  127. next++;
  128. }
  129. }
  130. /* if requested, fill in tail with the position after the last parsed
  131. character */
  132. if (tail)
  133. *tail = next;
  134. return d;
  135. }
  136. #define IS_IDENTIFIER_CHAR(c) ((c) - '0' <= 9U || (c) - 'a' <= 25U || (c) - 'A' <= 25U || (c) == '_')
  137. static int strmatch(const char *s, const char *prefix)
  138. {
  139. int i;
  140. for (i=0; prefix[i]; i++) {
  141. if (prefix[i] != s[i]) return 0;
  142. }
  143. /* return 1 only if the s identifier is terminated */
  144. return !IS_IDENTIFIER_CHAR(s[i]);
  145. }
  146. struct AVExpr {
  147. enum {
  148. e_value, e_const, e_func0, e_func1, e_func2,
  149. e_squish, e_gauss, e_ld, e_isnan, e_isinf,
  150. e_mod, e_max, e_min, e_eq, e_gt, e_gte, e_lte, e_lt,
  151. e_pow, e_mul, e_div, e_add,
  152. e_last, e_st, e_while, e_taylor, e_root, e_floor, e_ceil, e_trunc, e_round,
  153. e_sqrt, e_not, e_random, e_hypot, e_gcd,
  154. e_if, e_ifnot, e_print, e_bitand, e_bitor, e_between, e_clip, e_atan2, e_lerp,
  155. } type;
  156. double value; // is sign in other types
  157. union {
  158. int const_index;
  159. double (*func0)(double);
  160. double (*func1)(void *, double);
  161. double (*func2)(void *, double, double);
  162. } a;
  163. struct AVExpr *param[3];
  164. double *var;
  165. };
  166. static double etime(double v)
  167. {
  168. return av_gettime() * 0.000001;
  169. }
  170. static double eval_expr(Parser *p, AVExpr *e)
  171. {
  172. switch (e->type) {
  173. case e_value: return e->value;
  174. case e_const: return e->value * p->const_values[e->a.const_index];
  175. case e_func0: return e->value * e->a.func0(eval_expr(p, e->param[0]));
  176. case e_func1: return e->value * e->a.func1(p->opaque, eval_expr(p, e->param[0]));
  177. case e_func2: return e->value * e->a.func2(p->opaque, eval_expr(p, e->param[0]), eval_expr(p, e->param[1]));
  178. case e_squish: return 1/(1+exp(4*eval_expr(p, e->param[0])));
  179. case e_gauss: { double d = eval_expr(p, e->param[0]); return exp(-d*d/2)/sqrt(2*M_PI); }
  180. case e_ld: return e->value * p->var[av_clip(eval_expr(p, e->param[0]), 0, VARS-1)];
  181. case e_isnan: return e->value * !!isnan(eval_expr(p, e->param[0]));
  182. case e_isinf: return e->value * !!isinf(eval_expr(p, e->param[0]));
  183. case e_floor: return e->value * floor(eval_expr(p, e->param[0]));
  184. case e_ceil : return e->value * ceil (eval_expr(p, e->param[0]));
  185. case e_trunc: return e->value * trunc(eval_expr(p, e->param[0]));
  186. case e_round: return e->value * round(eval_expr(p, e->param[0]));
  187. case e_sqrt: return e->value * sqrt (eval_expr(p, e->param[0]));
  188. case e_not: return e->value * (eval_expr(p, e->param[0]) == 0);
  189. case e_if: return e->value * (eval_expr(p, e->param[0]) ? eval_expr(p, e->param[1]) :
  190. e->param[2] ? eval_expr(p, e->param[2]) : 0);
  191. case e_ifnot: return e->value * (!eval_expr(p, e->param[0]) ? eval_expr(p, e->param[1]) :
  192. e->param[2] ? eval_expr(p, e->param[2]) : 0);
  193. case e_clip: {
  194. double x = eval_expr(p, e->param[0]);
  195. double min = eval_expr(p, e->param[1]), max = eval_expr(p, e->param[2]);
  196. if (isnan(min) || isnan(max) || isnan(x) || min > max)
  197. return NAN;
  198. return e->value * av_clipd(eval_expr(p, e->param[0]), min, max);
  199. }
  200. case e_between: {
  201. double d = eval_expr(p, e->param[0]);
  202. return e->value * (d >= eval_expr(p, e->param[1]) &&
  203. d <= eval_expr(p, e->param[2]));
  204. }
  205. case e_lerp: {
  206. double v0 = eval_expr(p, e->param[0]);
  207. double v1 = eval_expr(p, e->param[1]);
  208. double f = eval_expr(p, e->param[2]);
  209. return v0 + (v1 - v0) * f;
  210. }
  211. case e_print: {
  212. double x = eval_expr(p, e->param[0]);
  213. int level = e->param[1] ? av_clip(eval_expr(p, e->param[1]), INT_MIN, INT_MAX) : AV_LOG_INFO;
  214. av_log(p, level, "%f\n", x);
  215. return x;
  216. }
  217. case e_random:{
  218. int idx= av_clip(eval_expr(p, e->param[0]), 0, VARS-1);
  219. uint64_t r= isnan(p->var[idx]) ? 0 : p->var[idx];
  220. r= r*1664525+1013904223;
  221. p->var[idx]= r;
  222. return e->value * (r * (1.0/UINT64_MAX));
  223. }
  224. case e_while: {
  225. double d = NAN;
  226. while (eval_expr(p, e->param[0]))
  227. d=eval_expr(p, e->param[1]);
  228. return d;
  229. }
  230. case e_taylor: {
  231. double t = 1, d = 0, v;
  232. double x = eval_expr(p, e->param[1]);
  233. int id = e->param[2] ? av_clip(eval_expr(p, e->param[2]), 0, VARS-1) : 0;
  234. int i;
  235. double var0 = p->var[id];
  236. for(i=0; i<1000; i++) {
  237. double ld = d;
  238. p->var[id] = i;
  239. v = eval_expr(p, e->param[0]);
  240. d += t*v;
  241. if(ld==d && v)
  242. break;
  243. t *= x / (i+1);
  244. }
  245. p->var[id] = var0;
  246. return d;
  247. }
  248. case e_root: {
  249. int i, j;
  250. double low = -1, high = -1, v, low_v = -DBL_MAX, high_v = DBL_MAX;
  251. double var0 = p->var[0];
  252. double x_max = eval_expr(p, e->param[1]);
  253. for(i=-1; i<1024; i++) {
  254. if(i<255) {
  255. p->var[0] = ff_reverse[i&255]*x_max/255;
  256. } else {
  257. p->var[0] = x_max*pow(0.9, i-255);
  258. if (i&1) p->var[0] *= -1;
  259. if (i&2) p->var[0] += low;
  260. else p->var[0] += high;
  261. }
  262. v = eval_expr(p, e->param[0]);
  263. if (v<=0 && v>low_v) {
  264. low = p->var[0];
  265. low_v = v;
  266. }
  267. if (v>=0 && v<high_v) {
  268. high = p->var[0];
  269. high_v = v;
  270. }
  271. if (low>=0 && high>=0){
  272. for (j=0; j<1000; j++) {
  273. p->var[0] = (low+high)*0.5;
  274. if (low == p->var[0] || high == p->var[0])
  275. break;
  276. v = eval_expr(p, e->param[0]);
  277. if (v<=0) low = p->var[0];
  278. if (v>=0) high= p->var[0];
  279. if (isnan(v)) {
  280. low = high = v;
  281. break;
  282. }
  283. }
  284. break;
  285. }
  286. }
  287. p->var[0] = var0;
  288. return -low_v<high_v ? low : high;
  289. }
  290. default: {
  291. double d = eval_expr(p, e->param[0]);
  292. double d2 = eval_expr(p, e->param[1]);
  293. switch (e->type) {
  294. case e_mod: return e->value * (d - floor((!CONFIG_FTRAPV || d2) ? d / d2 : d * INFINITY) * d2);
  295. case e_gcd: return e->value * av_gcd(d,d2);
  296. case e_max: return e->value * (d > d2 ? d : d2);
  297. case e_min: return e->value * (d < d2 ? d : d2);
  298. case e_eq: return e->value * (d == d2 ? 1.0 : 0.0);
  299. case e_gt: return e->value * (d > d2 ? 1.0 : 0.0);
  300. case e_gte: return e->value * (d >= d2 ? 1.0 : 0.0);
  301. case e_lt: return e->value * (d < d2 ? 1.0 : 0.0);
  302. case e_lte: return e->value * (d <= d2 ? 1.0 : 0.0);
  303. case e_pow: return e->value * pow(d, d2);
  304. case e_mul: return e->value * (d * d2);
  305. case e_div: return e->value * ((!CONFIG_FTRAPV || d2 ) ? (d / d2) : d * INFINITY);
  306. case e_add: return e->value * (d + d2);
  307. case e_last:return e->value * d2;
  308. case e_st : return e->value * (p->var[av_clip(d, 0, VARS-1)]= d2);
  309. case e_hypot:return e->value * hypot(d, d2);
  310. case e_atan2:return e->value * atan2(d, d2);
  311. case e_bitand: return isnan(d) || isnan(d2) ? NAN : e->value * ((long int)d & (long int)d2);
  312. case e_bitor: return isnan(d) || isnan(d2) ? NAN : e->value * ((long int)d | (long int)d2);
  313. }
  314. }
  315. }
  316. return NAN;
  317. }
  318. static int parse_expr(AVExpr **e, Parser *p);
  319. void av_expr_free(AVExpr *e)
  320. {
  321. if (!e) return;
  322. av_expr_free(e->param[0]);
  323. av_expr_free(e->param[1]);
  324. av_expr_free(e->param[2]);
  325. av_freep(&e->var);
  326. av_freep(&e);
  327. }
  328. static int parse_primary(AVExpr **e, Parser *p)
  329. {
  330. AVExpr *d = av_mallocz(sizeof(AVExpr));
  331. char *next = p->s, *s0 = p->s;
  332. int ret, i;
  333. if (!d)
  334. return AVERROR(ENOMEM);
  335. /* number */
  336. d->value = av_strtod(p->s, &next);
  337. if (next != p->s) {
  338. d->type = e_value;
  339. p->s= next;
  340. *e = d;
  341. return 0;
  342. }
  343. d->value = 1;
  344. /* named constants */
  345. for (i=0; p->const_names && p->const_names[i]; i++) {
  346. if (strmatch(p->s, p->const_names[i])) {
  347. p->s+= strlen(p->const_names[i]);
  348. d->type = e_const;
  349. d->a.const_index = i;
  350. *e = d;
  351. return 0;
  352. }
  353. }
  354. for (i = 0; i < FF_ARRAY_ELEMS(constants); i++) {
  355. if (strmatch(p->s, constants[i].name)) {
  356. p->s += strlen(constants[i].name);
  357. d->type = e_value;
  358. d->value = constants[i].value;
  359. *e = d;
  360. return 0;
  361. }
  362. }
  363. p->s= strchr(p->s, '(');
  364. if (!p->s) {
  365. av_log(p, AV_LOG_ERROR, "Undefined constant or missing '(' in '%s'\n", s0);
  366. p->s= next;
  367. av_expr_free(d);
  368. return AVERROR(EINVAL);
  369. }
  370. p->s++; // "("
  371. if (*next == '(') { // special case do-nothing
  372. av_freep(&d);
  373. if ((ret = parse_expr(&d, p)) < 0)
  374. return ret;
  375. if (p->s[0] != ')') {
  376. av_log(p, AV_LOG_ERROR, "Missing ')' in '%s'\n", s0);
  377. av_expr_free(d);
  378. return AVERROR(EINVAL);
  379. }
  380. p->s++; // ")"
  381. *e = d;
  382. return 0;
  383. }
  384. if ((ret = parse_expr(&(d->param[0]), p)) < 0) {
  385. av_expr_free(d);
  386. return ret;
  387. }
  388. if (p->s[0]== ',') {
  389. p->s++; // ","
  390. parse_expr(&d->param[1], p);
  391. }
  392. if (p->s[0]== ',') {
  393. p->s++; // ","
  394. parse_expr(&d->param[2], p);
  395. }
  396. if (p->s[0] != ')') {
  397. av_log(p, AV_LOG_ERROR, "Missing ')' or too many args in '%s'\n", s0);
  398. av_expr_free(d);
  399. return AVERROR(EINVAL);
  400. }
  401. p->s++; // ")"
  402. d->type = e_func0;
  403. if (strmatch(next, "sinh" )) d->a.func0 = sinh;
  404. else if (strmatch(next, "cosh" )) d->a.func0 = cosh;
  405. else if (strmatch(next, "tanh" )) d->a.func0 = tanh;
  406. else if (strmatch(next, "sin" )) d->a.func0 = sin;
  407. else if (strmatch(next, "cos" )) d->a.func0 = cos;
  408. else if (strmatch(next, "tan" )) d->a.func0 = tan;
  409. else if (strmatch(next, "atan" )) d->a.func0 = atan;
  410. else if (strmatch(next, "asin" )) d->a.func0 = asin;
  411. else if (strmatch(next, "acos" )) d->a.func0 = acos;
  412. else if (strmatch(next, "exp" )) d->a.func0 = exp;
  413. else if (strmatch(next, "log" )) d->a.func0 = log;
  414. else if (strmatch(next, "abs" )) d->a.func0 = fabs;
  415. else if (strmatch(next, "time" )) d->a.func0 = etime;
  416. else if (strmatch(next, "squish")) d->type = e_squish;
  417. else if (strmatch(next, "gauss" )) d->type = e_gauss;
  418. else if (strmatch(next, "mod" )) d->type = e_mod;
  419. else if (strmatch(next, "max" )) d->type = e_max;
  420. else if (strmatch(next, "min" )) d->type = e_min;
  421. else if (strmatch(next, "eq" )) d->type = e_eq;
  422. else if (strmatch(next, "gte" )) d->type = e_gte;
  423. else if (strmatch(next, "gt" )) d->type = e_gt;
  424. else if (strmatch(next, "lte" )) d->type = e_lte;
  425. else if (strmatch(next, "lt" )) d->type = e_lt;
  426. else if (strmatch(next, "ld" )) d->type = e_ld;
  427. else if (strmatch(next, "isnan" )) d->type = e_isnan;
  428. else if (strmatch(next, "isinf" )) d->type = e_isinf;
  429. else if (strmatch(next, "st" )) d->type = e_st;
  430. else if (strmatch(next, "while" )) d->type = e_while;
  431. else if (strmatch(next, "taylor")) d->type = e_taylor;
  432. else if (strmatch(next, "root" )) d->type = e_root;
  433. else if (strmatch(next, "floor" )) d->type = e_floor;
  434. else if (strmatch(next, "ceil" )) d->type = e_ceil;
  435. else if (strmatch(next, "trunc" )) d->type = e_trunc;
  436. else if (strmatch(next, "round" )) d->type = e_round;
  437. else if (strmatch(next, "sqrt" )) d->type = e_sqrt;
  438. else if (strmatch(next, "not" )) d->type = e_not;
  439. else if (strmatch(next, "pow" )) d->type = e_pow;
  440. else if (strmatch(next, "print" )) d->type = e_print;
  441. else if (strmatch(next, "random")) d->type = e_random;
  442. else if (strmatch(next, "hypot" )) d->type = e_hypot;
  443. else if (strmatch(next, "gcd" )) d->type = e_gcd;
  444. else if (strmatch(next, "if" )) d->type = e_if;
  445. else if (strmatch(next, "ifnot" )) d->type = e_ifnot;
  446. else if (strmatch(next, "bitand")) d->type = e_bitand;
  447. else if (strmatch(next, "bitor" )) d->type = e_bitor;
  448. else if (strmatch(next, "between"))d->type = e_between;
  449. else if (strmatch(next, "clip" )) d->type = e_clip;
  450. else if (strmatch(next, "atan2" )) d->type = e_atan2;
  451. else if (strmatch(next, "lerp" )) d->type = e_lerp;
  452. else {
  453. for (i=0; p->func1_names && p->func1_names[i]; i++) {
  454. if (strmatch(next, p->func1_names[i])) {
  455. d->a.func1 = p->funcs1[i];
  456. d->type = e_func1;
  457. *e = d;
  458. return 0;
  459. }
  460. }
  461. for (i=0; p->func2_names && p->func2_names[i]; i++) {
  462. if (strmatch(next, p->func2_names[i])) {
  463. d->a.func2 = p->funcs2[i];
  464. d->type = e_func2;
  465. *e = d;
  466. return 0;
  467. }
  468. }
  469. av_log(p, AV_LOG_ERROR, "Unknown function in '%s'\n", s0);
  470. av_expr_free(d);
  471. return AVERROR(EINVAL);
  472. }
  473. *e = d;
  474. return 0;
  475. }
  476. static AVExpr *make_eval_expr(int type, int value, AVExpr *p0, AVExpr *p1)
  477. {
  478. AVExpr *e = av_mallocz(sizeof(AVExpr));
  479. if (!e)
  480. return NULL;
  481. e->type =type ;
  482. e->value =value ;
  483. e->param[0] =p0 ;
  484. e->param[1] =p1 ;
  485. return e;
  486. }
  487. static int parse_pow(AVExpr **e, Parser *p, int *sign)
  488. {
  489. *sign= (*p->s == '+') - (*p->s == '-');
  490. p->s += *sign&1;
  491. return parse_primary(e, p);
  492. }
  493. static int parse_dB(AVExpr **e, Parser *p, int *sign)
  494. {
  495. /* do not filter out the negative sign when parsing a dB value.
  496. for example, -3dB is not the same as -(3dB) */
  497. if (*p->s == '-') {
  498. char *next;
  499. double av_unused ignored = strtod(p->s, &next);
  500. if (next != p->s && next[0] == 'd' && next[1] == 'B') {
  501. *sign = 0;
  502. return parse_primary(e, p);
  503. }
  504. }
  505. return parse_pow(e, p, sign);
  506. }
  507. static int parse_factor(AVExpr **e, Parser *p)
  508. {
  509. int sign, sign2, ret;
  510. AVExpr *e0, *e1, *e2;
  511. if ((ret = parse_dB(&e0, p, &sign)) < 0)
  512. return ret;
  513. while(p->s[0]=='^'){
  514. e1 = e0;
  515. p->s++;
  516. if ((ret = parse_dB(&e2, p, &sign2)) < 0) {
  517. av_expr_free(e1);
  518. return ret;
  519. }
  520. e0 = make_eval_expr(e_pow, 1, e1, e2);
  521. if (!e0) {
  522. av_expr_free(e1);
  523. av_expr_free(e2);
  524. return AVERROR(ENOMEM);
  525. }
  526. if (e0->param[1]) e0->param[1]->value *= (sign2|1);
  527. }
  528. if (e0) e0->value *= (sign|1);
  529. *e = e0;
  530. return 0;
  531. }
  532. static int parse_term(AVExpr **e, Parser *p)
  533. {
  534. int ret;
  535. AVExpr *e0, *e1, *e2;
  536. if ((ret = parse_factor(&e0, p)) < 0)
  537. return ret;
  538. while (p->s[0]=='*' || p->s[0]=='/') {
  539. int c= *p->s++;
  540. e1 = e0;
  541. if ((ret = parse_factor(&e2, p)) < 0) {
  542. av_expr_free(e1);
  543. return ret;
  544. }
  545. e0 = make_eval_expr(c == '*' ? e_mul : e_div, 1, e1, e2);
  546. if (!e0) {
  547. av_expr_free(e1);
  548. av_expr_free(e2);
  549. return AVERROR(ENOMEM);
  550. }
  551. }
  552. *e = e0;
  553. return 0;
  554. }
  555. static int parse_subexpr(AVExpr **e, Parser *p)
  556. {
  557. int ret;
  558. AVExpr *e0, *e1, *e2;
  559. if ((ret = parse_term(&e0, p)) < 0)
  560. return ret;
  561. while (*p->s == '+' || *p->s == '-') {
  562. e1 = e0;
  563. if ((ret = parse_term(&e2, p)) < 0) {
  564. av_expr_free(e1);
  565. return ret;
  566. }
  567. e0 = make_eval_expr(e_add, 1, e1, e2);
  568. if (!e0) {
  569. av_expr_free(e1);
  570. av_expr_free(e2);
  571. return AVERROR(ENOMEM);
  572. }
  573. };
  574. *e = e0;
  575. return 0;
  576. }
  577. static int parse_expr(AVExpr **e, Parser *p)
  578. {
  579. int ret;
  580. AVExpr *e0, *e1, *e2;
  581. if (p->stack_index <= 0) //protect against stack overflows
  582. return AVERROR(EINVAL);
  583. p->stack_index--;
  584. if ((ret = parse_subexpr(&e0, p)) < 0)
  585. return ret;
  586. while (*p->s == ';') {
  587. p->s++;
  588. e1 = e0;
  589. if ((ret = parse_subexpr(&e2, p)) < 0) {
  590. av_expr_free(e1);
  591. return ret;
  592. }
  593. e0 = make_eval_expr(e_last, 1, e1, e2);
  594. if (!e0) {
  595. av_expr_free(e1);
  596. av_expr_free(e2);
  597. return AVERROR(ENOMEM);
  598. }
  599. };
  600. p->stack_index++;
  601. *e = e0;
  602. return 0;
  603. }
  604. static int verify_expr(AVExpr *e)
  605. {
  606. if (!e) return 0;
  607. switch (e->type) {
  608. case e_value:
  609. case e_const: return 1;
  610. case e_func0:
  611. case e_func1:
  612. case e_squish:
  613. case e_ld:
  614. case e_gauss:
  615. case e_isnan:
  616. case e_isinf:
  617. case e_floor:
  618. case e_ceil:
  619. case e_trunc:
  620. case e_round:
  621. case e_sqrt:
  622. case e_not:
  623. case e_random:
  624. return verify_expr(e->param[0]) && !e->param[1];
  625. case e_print:
  626. return verify_expr(e->param[0])
  627. && (!e->param[1] || verify_expr(e->param[1]));
  628. case e_if:
  629. case e_ifnot:
  630. case e_taylor:
  631. return verify_expr(e->param[0]) && verify_expr(e->param[1])
  632. && (!e->param[2] || verify_expr(e->param[2]));
  633. case e_between:
  634. case e_clip:
  635. case e_lerp:
  636. return verify_expr(e->param[0]) &&
  637. verify_expr(e->param[1]) &&
  638. verify_expr(e->param[2]);
  639. default: return verify_expr(e->param[0]) && verify_expr(e->param[1]) && !e->param[2];
  640. }
  641. }
  642. int av_expr_parse(AVExpr **expr, const char *s,
  643. const char * const *const_names,
  644. const char * const *func1_names, double (* const *funcs1)(void *, double),
  645. const char * const *func2_names, double (* const *funcs2)(void *, double, double),
  646. int log_offset, void *log_ctx)
  647. {
  648. Parser p = { 0 };
  649. AVExpr *e = NULL;
  650. char *w = av_malloc(strlen(s) + 1);
  651. char *wp = w;
  652. const char *s0 = s;
  653. int ret = 0;
  654. if (!w)
  655. return AVERROR(ENOMEM);
  656. while (*s)
  657. if (!av_isspace(*s++)) *wp++ = s[-1];
  658. *wp++ = 0;
  659. p.class = &eval_class;
  660. p.stack_index=100;
  661. p.s= w;
  662. p.const_names = const_names;
  663. p.funcs1 = funcs1;
  664. p.func1_names = func1_names;
  665. p.funcs2 = funcs2;
  666. p.func2_names = func2_names;
  667. p.log_offset = log_offset;
  668. p.log_ctx = log_ctx;
  669. if ((ret = parse_expr(&e, &p)) < 0)
  670. goto end;
  671. if (*p.s) {
  672. av_log(&p, AV_LOG_ERROR, "Invalid chars '%s' at the end of expression '%s'\n", p.s, s0);
  673. ret = AVERROR(EINVAL);
  674. goto end;
  675. }
  676. if (!verify_expr(e)) {
  677. ret = AVERROR(EINVAL);
  678. goto end;
  679. }
  680. e->var= av_mallocz(sizeof(double) *VARS);
  681. if (!e->var) {
  682. ret = AVERROR(ENOMEM);
  683. goto end;
  684. }
  685. *expr = e;
  686. e = NULL;
  687. end:
  688. av_expr_free(e);
  689. av_free(w);
  690. return ret;
  691. }
  692. double av_expr_eval(AVExpr *e, const double *const_values, void *opaque)
  693. {
  694. Parser p = { 0 };
  695. p.var= e->var;
  696. p.const_values = const_values;
  697. p.opaque = opaque;
  698. return eval_expr(&p, e);
  699. }
  700. int av_expr_parse_and_eval(double *d, const char *s,
  701. const char * const *const_names, const double *const_values,
  702. const char * const *func1_names, double (* const *funcs1)(void *, double),
  703. const char * const *func2_names, double (* const *funcs2)(void *, double, double),
  704. void *opaque, int log_offset, void *log_ctx)
  705. {
  706. AVExpr *e = NULL;
  707. int ret = av_expr_parse(&e, s, const_names, func1_names, funcs1, func2_names, funcs2, log_offset, log_ctx);
  708. if (ret < 0) {
  709. *d = NAN;
  710. return ret;
  711. }
  712. *d = av_expr_eval(e, const_values, opaque);
  713. av_expr_free(e);
  714. return isnan(*d) ? AVERROR(EINVAL) : 0;
  715. }