1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
#ifndef COIN_EVALUATOR_H
#define COIN_EVALUATOR_H
/**************************************************************************\
*
* This file is part of the Coin 3D visualization library.
* Copyright (C) by Kongsberg Oil & Gas Technologies.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* ("GPL") version 2 as published by the Free Software Foundation.
* See the file LICENSE.GPL at the root directory of this source
* distribution for additional information about the GNU GPL.
*
* For using Coin with software that can not be combined with the GNU
* GPL, and for taking advantage of the additional benefits of our
* support services, please contact Kongsberg Oil & Gas Technologies
* about acquiring a Coin Professional Edition License.
*
* See http://www.coin3d.org/ for more information.
*
* Kongsberg Oil & Gas Technologies, Bygdoy Alle 5, 0257 Oslo, NORWAY.
* http://www.sim.no/ sales@sim.no coin-support@coin3d.org
*
\**************************************************************************/
#ifndef COIN_INTERNAL
#error this is a private header file
#endif /* !COIN_INTERNAL */
/*
* expression parser/evaluator for SoCalculator expressions.
*
* I chose to implement this "module" in pure C, since I think
* mixing flex/bison code and C++ is a bad idea.
*
* The bison parser builds a tree structure which is traversed
* each time the expression needs to be evaluated. I guess
* the inputs will change more often than the expression, so I
* think this is better than parsing the expression every time.
*
* Call so_eval_parse() to build the tree structure. This method
* returns NULL if an error occured. The actual error message
* can be found by using so_eval_error().
*
* Call so_eval_evaluate() to evaluate the expression. You should
* supply callback pointers to read and write the registers.
* so_eval_evaluate() should never fail. If you supply an illegal
* value to some function, it will be clamped or the result will
* be set to some (hopefully) useful value.
* pederb, 20000307
*/
#ifdef __cplusplus
extern "C" {
#endif /* __cplusplus */
/* the expression node structure */
typedef struct so_eval_node {
int id; /* node id */
float value; /* used only by value nodes */
char regname[4]; /* register/field name in SoCalculator */
int regidx; /* index into vector register */
struct so_eval_node *child1, *child2, *child3;
} so_eval_node;
/* callbacks are needed to read/write values from/to fields.
When returning a float field value, write to data[0]. When
returning a SbVec3f, set data[0], data[1] and data[2] */
typedef struct {
void (*readfieldcb)(const char *reg, float *data, void *userdata);
/* 'component' only applies when setting vectors. If component < 0, copy
all three components from data, otherwise only copy data[0] into the
specified component (data only contains a single float */
void (*writefieldcb)(const char *reg, float *data, int component, void *userdata);
void *userdata;
} so_eval_cbdata;
/* create a tree structure from expression string */
so_eval_node *so_eval_parse(const char *buffer); /* defined in epsilon.y */
/* free memory used by tree structure */
void so_eval_delete(so_eval_node *node);
/* evaluates the tree structure */
void so_eval_evaluate(so_eval_node *node, const so_eval_cbdata *cbdata);
/* returns current error message, or NULL if none.
check this after calling so_eval_parse() */
char * so_eval_error(void); /* defined in epsilon.y */
/* methods to create misc nodes */
so_eval_node *so_eval_create_unary(int id, so_eval_node *topnode);
so_eval_node *so_eval_create_binary(int id, so_eval_node *lhs, so_eval_node *rhs);
so_eval_node *so_eval_create_ternary(int id, so_eval_node *cond,
so_eval_node *branch1, so_eval_node *branch2);
so_eval_node *so_eval_create_reg(const char *regname);
so_eval_node *so_eval_create_reg_comp(const char *regname, int index);
so_eval_node *so_eval_create_flt_val(float val);
/* node ids */
enum {
ID_ADD,
ID_ADD_VEC,
ID_SUB,
ID_SUB_VEC,
ID_MUL,
ID_DIV,
ID_NEG,
ID_NEG_VEC,
ID_AND,
ID_OR,
ID_LEQ,
ID_GEQ,
ID_EQ,
ID_NEQ,
ID_COS,
ID_SIN,
ID_TAN,
ID_ACOS,
ID_ASIN,
ID_ATAN,
ID_ATAN2,
ID_COSH,
ID_SINH,
ID_TANH,
ID_SQRT,
ID_EXP,
ID_LOG,
ID_LOG10,
ID_CEIL,
ID_FLOOR,
ID_FABS,
ID_FMOD,
ID_RAND,
ID_CROSS,
ID_DOT,
ID_LEN,
ID_NORMALIZE,
ID_TEST_FLT,
ID_TEST_VEC,
ID_VEC3F,
ID_FLT_REG,
ID_VEC_REG,
ID_VEC_REG_COMP,
ID_FLT_COND,
ID_VEC_COND,
ID_VALUE,
ID_ASSIGN_FLT,
ID_ASSIGN_VEC,
ID_SEPARATOR,
ID_NOT,
ID_LT,
ID_GT,
ID_POW,
ID_MUL_VEC_FLT,
ID_DIV_VEC_FLT
};
/* lexical tokens */
/* do not uncomment. Bison will define these
enum {
LEX_FLTFUNC,
LEX_COMPARE,
LEX_AND,
LEX_OR,
LEX_ATAN2,
LEX_POW,
LEX_FMOD,
LEX_VEC3F,
LEX_VALUE,
LEX_TMP_FLT_REG,
LEX_OUT_FLT_REG,
LEX_IN_FLT_REG,
LEX_TMP_VEC_REG,
LEX_OUT_VEC_REG,
LEX_IN_VEC_REG,
LEX_LEN,
LEX_ERROR
};
*/
#ifdef __cplusplus
}; /* extern "C" */
#endif /* __cplusplus */
#endif /* COIN_EVALUATOR_H */
|