1 /*****************************************************************************
3 *****************************************************************************
4 * Copyright (C) 2004 the VideoLAN team
7 * Authors: Cyril Deguet <asmax@videolan.org>
8 * code from projectM http://xmms-projectm.sourceforge.net
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
23 *****************************************************************************/
32 #include "param_types.h"
33 #include "func_types.h"
34 #include "expr_types.h"
36 #include "engine_vars.h"
37 #include "builtin_funcs.h"
40 /* All infix operators (except '=') are prototyped here */
41 infix_op_t * infix_add, * infix_minus, * infix_div, * infix_mult,
42 * infix_or, * infix_and, * infix_mod, * infix_negative, * infix_positive;
43 int mesh_i=-1, mesh_j=-1;
45 static inline double eval_tree_expr(tree_expr_t * tree_expr);
46 static inline double eval_prefun_expr(prefun_expr_t * prefun_expr);
47 static inline double eval_val_expr(val_expr_t * val_expr);
50 inline double eval_gen_expr(gen_expr_t * gen_expr) {
56 switch(gen_expr->type) {
58 return eval_val_expr(gen_expr->item);
60 l = eval_prefun_expr(gen_expr->item);
61 //if (EVAL_DEBUG) printf("eval_gen_expr: prefix function return value: %f\n", l);
64 return eval_tree_expr(gen_expr->item);
67 printf("eval_gen_expr: general expression matched no cases!\n");
74 /* Evaluates functions in prefix form */
75 static inline double eval_prefun_expr(prefun_expr_t * prefun_expr) {
79 /* This is slightly less than safe, since
80 who knows if the passed argument is valid. For
81 speed purposes we'll go with this */
82 double arg_list[prefun_expr->num_args];
88 /* Evaluate each argument before calling the function itself */
89 for (i = 0; i < prefun_expr->num_args; i++) {
90 arg_list[i] = eval_gen_expr(prefun_expr->expr_list[i]);
92 if (i < (prefun_expr->num_args - 1))
103 /* Now we call the function, passing a list of
104 doubles as its argument */
108 return (prefun_expr->func_ptr)(arg_list);
111 /* Evaluates a value expression */
112 static inline double eval_val_expr(val_expr_t * val_expr) {
114 /* Shouldn't happen */
115 if (val_expr == NULL)
118 /* Value is a constant, return the double value */
119 if (val_expr->type == CONSTANT_TERM_T) {
121 printf("%.4f", val_expr->term.constant);
124 return (val_expr->term.constant);
127 /* Value is variable, dereference it */
128 if (val_expr->type == PARAM_TERM_T) {
129 switch (val_expr->term.param->type) {
133 printf("(%s:%.4f)", val_expr->term.param->name, (double)(*((int*)(val_expr->term.param->engine_val))));
138 return (double)(*((int*)(val_expr->term.param->engine_val)));
141 printf("(%s:%.4f)", val_expr->term.param->name, (double)(*((int*)(val_expr->term.param->engine_val))));
146 return (double)(*((int*)(val_expr->term.param->engine_val)));
149 printf("(%s:%.4f)", val_expr->term.param->name, (*((double*)val_expr->term.param->engine_val)));
153 if (val_expr->term.param->matrix_flag | (val_expr->term.param->flags & P_FLAG_ALWAYS_MATRIX)) {
155 return (((double**)val_expr->term.param->matrix)[mesh_i][mesh_j]);
158 return (((double*)val_expr->term.param->matrix)[mesh_i]);
161 return *((double*)(val_expr->term.param->engine_val));
166 /* Unknown type, return failure */
170 /* Evaluates an expression tree */
171 static inline double eval_tree_expr(tree_expr_t * tree_expr) {
173 double left_arg, right_arg;
174 infix_op_t * infix_op;
176 /* Shouldn't happen */
177 if (tree_expr == NULL)
180 /* A leaf node, evaluate the general expression. If the expression is null as well, return zero */
181 if (tree_expr->infix_op == NULL) {
182 if (tree_expr->gen_expr == NULL)
185 return eval_gen_expr(tree_expr->gen_expr);
188 /* Otherwise, this node is an infix operator. Evaluate
191 infix_op = (infix_op_t*)tree_expr->infix_op;
197 left_arg = eval_tree_expr(tree_expr->left);
201 switch (infix_op->type) {
230 right_arg = eval_tree_expr(tree_expr->right);
237 switch (infix_op->type) {
239 return (left_arg + right_arg);
241 return (left_arg - right_arg);
243 return (left_arg * right_arg);
245 if ((int)right_arg == 0) {
247 printf("eval_tree_expr: modulo zero!\n");
251 return ((int)left_arg % (int)right_arg);
253 return ((int)left_arg | (int)right_arg);
255 return ((int)left_arg & (int)right_arg);
257 if (right_arg == 0) {
259 printf("eval_tree_expr: division by zero!\n");
261 return MAX_DOUBLE_SIZE;
263 return (left_arg / right_arg);
266 printf("eval_tree_expr: unknown infix operator!\n");
274 /* Converts a double value to a general expression */
275 gen_expr_t * const_to_expr(double val) {
277 gen_expr_t * gen_expr;
278 val_expr_t * val_expr;
283 if ((val_expr = new_val_expr(CONSTANT_TERM_T, term)) == NULL)
286 gen_expr = new_gen_expr(VAL_T, (void*)val_expr);
288 if (gen_expr == NULL) {
289 free_val_expr(val_expr);
295 /* Converts a regular parameter to an expression */
296 gen_expr_t * param_to_expr(param_t * param) {
298 gen_expr_t * gen_expr = NULL;
299 val_expr_t * val_expr = NULL;
305 /* This code is still a work in progress. We need
306 to figure out if the initial condition is used for
307 each per frame equation or not. I am guessing that
308 it isn't, and it is thusly implemented this way */
310 /* Current guess of true behavior (08/01/03) note from carm
311 First try to use the per_pixel_expr (with cloning).
312 If it is null however, use the engine variable instead. */
314 /* 08/20/03 : Presets are now objects, as well as per pixel equations. This ends up
315 making the parser handle the case where parameters are essentially per pixel equation
320 if ((val_expr = new_val_expr(PARAM_TERM_T, term)) == NULL)
323 if ((gen_expr = new_gen_expr(VAL_T, (void*)val_expr)) == NULL) {
324 free_val_expr(val_expr);
330 /* Converts a prefix function to an expression */
331 gen_expr_t * prefun_to_expr(double (*func_ptr)(), gen_expr_t ** expr_list, int num_args) {
333 gen_expr_t * gen_expr;
334 prefun_expr_t * prefun_expr;
337 /* Malloc a new prefix function expression */
338 prefun_expr = (prefun_expr_t*)malloc(sizeof(prefun_expr_t));
340 if (prefun_expr == NULL)
343 prefun_expr->num_args = num_args;
344 prefun_expr->func_ptr = func_ptr;
345 prefun_expr->expr_list = expr_list;
347 gen_expr = new_gen_expr(PREFUN_T, (void*)prefun_expr);
349 if (gen_expr == NULL)
350 free_prefun_expr(prefun_expr);
355 /* Creates a new tree expression */
356 tree_expr_t * new_tree_expr(infix_op_t * infix_op, gen_expr_t * gen_expr, tree_expr_t * left, tree_expr_t * right) {
358 tree_expr_t * tree_expr;
359 tree_expr = (tree_expr_t*)malloc(sizeof(tree_expr_t));
361 if (tree_expr == NULL)
363 tree_expr->infix_op = infix_op;
364 tree_expr->gen_expr = gen_expr;
365 tree_expr->left = left;
366 tree_expr->right = right;
371 /* Creates a new value expression */
372 val_expr_t * new_val_expr(int type, term_t term) {
374 val_expr_t * val_expr;
375 val_expr = (val_expr_t*)malloc(sizeof(val_expr_t));
377 if (val_expr == NULL)
380 val_expr->type = type;
381 val_expr->term = term;
386 /* Creates a new general expression */
387 gen_expr_t * new_gen_expr(int type, void * item) {
389 gen_expr_t * gen_expr;
391 gen_expr = (gen_expr_t*)malloc(sizeof(gen_expr_t));
392 if (gen_expr == NULL)
394 gen_expr->type = type;
395 gen_expr->item = item;
400 /* Frees a general expression */
401 int free_gen_expr(gen_expr_t * gen_expr) {
403 if (gen_expr == NULL)
406 switch (gen_expr->type) {
408 free_val_expr(gen_expr->item);
411 free_prefun_expr(gen_expr->item);
414 free_tree_expr(gen_expr->item);
426 /* Frees a function in prefix notation */
427 int free_prefun_expr(prefun_expr_t * prefun_expr) {
430 if (prefun_expr == NULL)
433 /* Free every element in expression list */
434 for (i = 0 ; i < prefun_expr->num_args; i++) {
435 free_gen_expr(prefun_expr->expr_list[i]);
442 /* Frees values of type VARIABLE and CONSTANT */
443 int free_val_expr(val_expr_t * val_expr) {
445 if (val_expr == NULL)
452 /* Frees a tree expression */
453 int free_tree_expr(tree_expr_t * tree_expr) {
455 if (tree_expr == NULL)
459 free_tree_expr(tree_expr->left);
461 /* free general expression object */
462 free_gen_expr(tree_expr->gen_expr);
464 /* Note that infix operators are always
465 stored in memory unless the program
466 exits, so we don't remove them here */
468 /* free right tree */
469 free_tree_expr(tree_expr->right);
472 /* finally, free the struct itself */
479 /* Initializes all infix operators */
480 int init_infix_ops() {
482 infix_add = new_infix_op(INFIX_ADD, 4);
483 infix_minus = new_infix_op(INFIX_MINUS, 3);
484 infix_div = new_infix_op(INFIX_DIV, 2);
485 infix_or = new_infix_op(INFIX_OR, 5);
486 infix_and = new_infix_op(INFIX_AND,4);
487 infix_mod = new_infix_op(INFIX_MOD, 1);
488 infix_mult = new_infix_op(INFIX_MULT, 2);
490 /* Prefix operators */
491 infix_positive = new_infix_op(INFIX_ADD, 0);
492 infix_negative = new_infix_op(INFIX_MINUS, 0);
497 /* Destroys the infix operator list. This should
498 be done on program exit */
499 int destroy_infix_ops()
509 free(infix_positive);
510 free(infix_negative);
515 /* Initializes an infix operator */
516 infix_op_t * new_infix_op(int type, int precedence) {
518 infix_op_t * infix_op;
520 infix_op = (infix_op_t*)malloc(sizeof(infix_op_t));
522 if (infix_op == NULL)
525 infix_op->type = type;
526 infix_op->precedence = precedence;
534 /* Clones a general expression */
535 gen_expr_t * clone_gen_expr(gen_expr_t * gen_expr) {
537 gen_expr_t * new_gen_expr;
538 val_expr_t * val_expr;
539 tree_expr_t * tree_expr;
540 prefun_expr_t * prefun_expr;
542 /* Null argument check */
543 if (gen_expr == NULL)
547 if ((new_gen_expr = (gen_expr_t*)malloc(sizeof(gen_expr_t))) == NULL)
550 /* Case on the type of general expression */
551 switch (new_gen_expr->type = gen_expr->type) {
553 case VAL_T: /* val expression */
554 if ((val_expr = clone_val_expr((val_expr_t*)gen_expr->item)) == NULL) {
558 new_gen_expr->item = (void*)val_expr;
561 case PREFUN_T: /* prefix function expression */
562 if ((prefun_expr = clone_prefun_expr((prefun_expr_t*)gen_expr->item)) == NULL) {
566 new_gen_expr->item = (void*)prefun_expr;
569 case TREE_T: /* tree expression */
570 if ((tree_expr = clone_tree_expr((tree_expr_t*)gen_expr->item)) == NULL) {
574 new_gen_expr->item = (void*)tree_expr;
577 default: /* unknown type, ut oh.. */
582 return new_gen_expr; /* Return the new (cloned) general expression */
586 /* Clones a tree expression */
587 tree_expr_t * clone_tree_expr(tree_expr_t * tree_expr) {
589 tree_expr_t * new_tree_expr;
592 if (tree_expr == NULL)
596 if ((new_tree_expr = (tree_expr_t*)malloc(sizeof(tree_expr_t))) == NULL)
599 /* Set each argument in tree_expr_t struct */
600 new_tree_expr->infix_op = tree_expr->infix_op; /* infix operators are in shared memory */
601 new_tree_expr->gen_expr = clone_gen_expr(tree_expr->gen_expr); /* clone the general expression */
602 new_tree_expr->left = clone_tree_expr(tree_expr->left); /* clone the left tree expression */
603 new_tree_expr->right = clone_tree_expr(tree_expr->right); /* clone the right tree expression */
605 return new_tree_expr; /* Return the new (cloned) tree expression */
608 /* Clones a value expression, currently only passes the pointer to
609 the value that this object represents, not a pointer to a copy of the value */
610 val_expr_t * clone_val_expr(val_expr_t * val_expr) {
612 val_expr_t * new_val_expr;
615 if (val_expr == NULL)
618 /* Allocate space, check for out of memory */
619 if ((new_val_expr = (val_expr_t*)malloc(sizeof(val_expr_t))) == NULL)
622 /* Set the values in the val_expr_t struct */
623 new_val_expr->type = val_expr->type;
624 new_val_expr->term = val_expr->term;
626 /* Return the new (cloned) value expression */
630 /* Clones a prefix function with its arguments */
631 prefun_expr_t * clone_prefun_expr(prefun_expr_t * prefun_expr) {
634 prefun_expr_t * new_prefun_expr;
637 if (prefun_expr == NULL)
641 if ((new_prefun_expr = (prefun_expr_t*)malloc(sizeof(prefun_expr_t))) == NULL)
644 /* Set the function argument paired with its number of arguments */
645 new_prefun_expr->num_args = prefun_expr->num_args;
646 new_prefun_expr->func_ptr = prefun_expr->func_ptr;
648 /* Allocate space for the expression list pointers */
649 if ((new_prefun_expr->expr_list = (gen_expr_t**)malloc(sizeof(gen_expr_t*)*new_prefun_expr->num_args)) == NULL) {
650 free(new_prefun_expr);
654 /* Now copy each general expression from the argument expression list */
655 for (i = 0; i < new_prefun_expr->num_args;i++)
656 new_prefun_expr->expr_list[i] = clone_gen_expr(prefun_expr->expr_list[i]);
658 /* Finally, return the new (cloned) prefix function expression */
659 return new_prefun_expr;
662 /* Reinitializes the engine variables to a default (conservative and sane) value */
663 void reset_engine_vars() {
724 /* PER_FRAME CONSTANTS END */
727 fVideoEchoZoom = 1.0;
729 nVideoEchoOrientation = 0;
735 bModWaveAlphaByVolume = 0;
736 bMaximizeWaveColor = 0;
744 bMotionVectorsOn = 1;
750 fModWaveAlphaStart = 0;
751 fModWaveAlphaEnd = 0;
757 /* PER_PIXEL CONSTANTS BEGIN */
763 /* PER_PIXEL CONSTANT END */
766 /* Q VARIABLES START */
778 /* Q VARIABLES END */