1 /*****************************************************************************
2 * simple arithmetic expression evaluator
3 *****************************************************************************
4 * Copyright (c) 2002 Michael Niedermayer <michaelni@gmx.at>
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 *****************************************************************************/
23 * simple arithmetic expression evaluator.
25 * see http://joe.hotchkiss.com/programming/eval/eval.html
38 #define M_PI 3.14159265358979323846
41 #define STACK_SIZE 100
43 typedef struct Parser{
44 double stack[STACK_SIZE];
48 const char **const_name; // NULL terminated
49 double (**func1)(void *, double a); // NULL terminated
50 const char **func1_name; // NULL terminated
51 double (**func2)(void *, double a, double b); // NULL terminated
52 char **func2_name; // NULL terminated
56 static void evalExpression(Parser *p);
58 static void push(Parser *p, double d){
59 if(p->stack_index+1>= STACK_SIZE){
60 fprintf(stderr, "stack overflow in the parser\n");
63 p->stack[ p->stack_index++ ]= d;
64 //printf("push %f\n", d); fflush(stdout);
67 static double pop(Parser *p){
68 if(p->stack_index<=0){
69 fprintf(stderr, "stack underflow in the parser\n");
72 //printf("pop\n"); fflush(stdout);
73 return p->stack[ --p->stack_index ];
76 static int strmatch(const char *s, const char *prefix){
78 for(i=0; prefix[i]; i++){
79 if(prefix[i] != s[i]) return 0;
84 static void evalPrimary(Parser *p){
90 d= strtod(p->s, &next);
98 for(i=0; p->const_name[i]; i++){
99 if(strmatch(p->s, p->const_name[i])){
100 push(p, p->const_value[i]);
101 p->s+= strlen(p->const_name[i]);
106 p->s= strchr(p->s, '(');
108 fprintf(stderr, "Parser: missing ( in \"%s\"\n", next);
120 fprintf(stderr, "Parser: missing ) in \"%s\"\n", next);
125 if( strmatch(next, "sinh" ) ) d= sinh(d);
126 else if( strmatch(next, "cosh" ) ) d= cosh(d);
127 else if( strmatch(next, "tanh" ) ) d= tanh(d);
128 else if( strmatch(next, "sin" ) ) d= sin(d);
129 else if( strmatch(next, "cos" ) ) d= cos(d);
130 else if( strmatch(next, "tan" ) ) d= tan(d);
131 else if( strmatch(next, "exp" ) ) d= exp(d);
132 else if( strmatch(next, "log" ) ) d= log(d);
133 else if( strmatch(next, "squish") ) d= 1/(1+exp(4*d));
134 else if( strmatch(next, "gauss" ) ) d= exp(-d*d/2)/sqrt(2*M_PI);
135 else if( strmatch(next, "abs" ) ) d= fabs(d);
136 else if( strmatch(next, "max" ) ) d= d > d2 ? d : d2;
137 else if( strmatch(next, "min" ) ) d= d < d2 ? d : d2;
138 else if( strmatch(next, "gt" ) ) d= d > d2 ? 1.0 : 0.0;
139 else if( strmatch(next, "gte" ) ) d= d >= d2 ? 1.0 : 0.0;
140 else if( strmatch(next, "lt" ) ) d= d > d2 ? 0.0 : 1.0;
141 else if( strmatch(next, "lte" ) ) d= d >= d2 ? 0.0 : 1.0;
142 else if( strmatch(next, "eq" ) ) d= d == d2 ? 1.0 : 0.0;
143 // else if( strmatch(next, "l1" ) ) d= 1 + d2*(d - 1);
144 // else if( strmatch(next, "sq01" ) ) d= (d >= 0.0 && d <=1.0) ? 1.0 : 0.0;
147 for(i=0; p->func1_name && p->func1_name[i]; i++){
148 if(strmatch(next, p->func1_name[i])){
149 d= p->func1[i](p->opaque, d);
155 for(i=0; p->func2_name && p->func2_name[i]; i++){
156 if(strmatch(next, p->func2_name[i])){
157 d= p->func2[i](p->opaque, d, d2);
164 fprintf(stderr, "Parser: unknown function in \"%s\"\n", next);
172 static void evalPow(Parser *p){
174 if(p->s[0]=='+') p->s++;
186 fprintf(stderr, "Parser: missing )\n");
192 if(neg) push(p, -pop(p));
195 static void evalFactor(Parser *p){
203 push(p, pow(pop(p), d));
207 static void evalTerm(Parser *p){
209 while(p->s[0]=='*' || p->s[0]=='/'){
210 int inv= p->s[0]=='/';
221 static void evalExpression(Parser *p){
223 while(p->s[0]=='+' || p->s[0]=='-'){
224 int sign= p->s[0]=='-';
235 double x264_eval(char *s, double *const_value, const char **const_name,
236 double (**func1)(void *, double), const char **func1_name,
237 double (**func2)(void *, double, double), char **func2_name,
243 p.const_value= const_value;
244 p.const_name = const_name;
246 p.func1_name = func1_name;
248 p.func2_name = func2_name;