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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
|
/* SPDX-License-Identifier: GPL-3.0-or-later */
/*
* 1. build netdata (as normally)
* 2. cd profile/
* 3. compile with:
* gcc -O1 -ggdb -Wall -Wextra -I ../src/ -I ../ -o test-eval test-eval.c ../src/log.o ../src/eval.o ../src/common.o ../src/clocks.o ../src/web_buffer.o ../src/storage_number.o -pthread -lm
*/
#include "config.h"
#include "libnetdata/libnetdata.h"
#include "database/rrdcalc.h"
void netdata_cleanup_and_exit(int ret) { exit(ret); }
/*
void indent(int level, int show) {
int i = level;
while(i--) printf(" | ");
if(show) printf(" \\_ ");
else printf(" \\_ ");
}
void print_node(EVAL_NODE *op, int level);
void print_value(EVAL_VALUE *v, int level) {
indent(level, 0);
switch(v->type) {
case EVAL_VALUE_INVALID:
printf("value (NOP)\n");
break;
case EVAL_VALUE_NUMBER:
printf("value %Lf (NUMBER)\n", v->number);
break;
case EVAL_VALUE_EXPRESSION:
printf("value (SUB-EXPRESSION)\n");
print_node(v->expression, level+1);
break;
default:
printf("value (INVALID type %d)\n", v->type);
break;
}
}
void print_node(EVAL_NODE *op, int level) {
// if(op->operator != EVAL_OPERATOR_NOP) {
indent(level, 1);
if(op->operator) printf("%c (node %d, precedence: %d)\n", op->operator, op->id, op->precedence);
else printf("NOP (node %d, precedence: %d)\n", op->id, op->precedence);
// }
int i = op->count;
while(i--) print_value(&op->ops[i], level + 1);
}
calculated_number evaluate(EVAL_NODE *op, int depth);
calculated_number evaluate_value(EVAL_VALUE *v, int depth) {
switch(v->type) {
case EVAL_VALUE_NUMBER:
return v->number;
case EVAL_VALUE_EXPRESSION:
return evaluate(v->expression, depth);
default:
fatal("I don't know how to handle EVAL_VALUE type %d", v->type);
}
}
void print_depth(int depth) {
static int count = 0;
printf("%d. ", ++count);
while(depth--) printf(" ");
}
calculated_number evaluate(EVAL_NODE *op, int depth) {
calculated_number n1, n2, r;
switch(op->operator) {
case EVAL_OPERATOR_SIGN_PLUS:
r = evaluate_value(&op->ops[0], depth);
break;
case EVAL_OPERATOR_SIGN_MINUS:
r = -evaluate_value(&op->ops[0], depth);
break;
case EVAL_OPERATOR_PLUS:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 + n2;
print_depth(depth);
printf("%Lf = %Lf + %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_MINUS:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 - n2;
print_depth(depth);
printf("%Lf = %Lf - %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_MULTIPLY:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 * n2;
print_depth(depth);
printf("%Lf = %Lf * %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_DIVIDE:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 / n2;
print_depth(depth);
printf("%Lf = %Lf / %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_NOT:
n1 = evaluate_value(&op->ops[0], depth);
r = !n1;
print_depth(depth);
printf("%Lf = NOT %Lf\n", r, n1);
break;
case EVAL_OPERATOR_AND:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 && n2;
print_depth(depth);
printf("%Lf = %Lf AND %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_OR:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 || n2;
print_depth(depth);
printf("%Lf = %Lf OR %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_GREATER_THAN_OR_EQUAL:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 >= n2;
print_depth(depth);
printf("%Lf = %Lf >= %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_LESS_THAN_OR_EQUAL:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 <= n2;
print_depth(depth);
printf("%Lf = %Lf <= %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_GREATER:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 > n2;
print_depth(depth);
printf("%Lf = %Lf > %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_LESS:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 < n2;
print_depth(depth);
printf("%Lf = %Lf < %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_NOT_EQUAL:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 != n2;
print_depth(depth);
printf("%Lf = %Lf <> %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_EQUAL:
if(op->count != 2)
fatal("Operator '%c' requires 2 values, but we have %d", op->operator, op->count);
n1 = evaluate_value(&op->ops[0], depth);
n2 = evaluate_value(&op->ops[1], depth);
r = n1 == n2;
print_depth(depth);
printf("%Lf = %Lf == %Lf\n", r, n1, n2);
break;
case EVAL_OPERATOR_EXPRESSION_OPEN:
printf("BEGIN SUB-EXPRESSION\n");
r = evaluate_value(&op->ops[0], depth + 1);
printf("END SUB-EXPRESSION\n");
break;
case EVAL_OPERATOR_NOP:
case EVAL_OPERATOR_VALUE:
r = evaluate_value(&op->ops[0], depth);
break;
default:
error("I don't know how to handle operator '%c'", op->operator);
r = 0;
break;
}
return r;
}
void print_expression(EVAL_NODE *op, const char *failed_at, int error) {
if(op) {
printf("expression tree:\n");
print_node(op, 0);
printf("\nevaluation steps:\n");
evaluate(op, 0);
int error;
calculated_number ret = expression_evaluate(op, &error);
printf("\ninternal evaluator:\nSTATUS: %d, RESULT = %Lf\n", error, ret);
expression_free(op);
}
else {
printf("error: %d, failed_at: '%s'\n", error, (failed_at)?failed_at:"<NONE>");
}
}
*/
int health_variable_lookup(const char *variable, uint32_t hash, RRDCALC *rc, calculated_number *result) {
(void)variable;
(void)hash;
(void)rc;
(void)result;
return 0;
}
int main(int argc, char **argv) {
if(argc != 2) {
fprintf(stderr, "I need an epxression (enclose it in single-quotes (') as a single parameter)\n");
exit(1);
}
const char *failed_at = NULL;
int error;
EVAL_EXPRESSION *exp = expression_parse(argv[1], &failed_at, &error);
if(!exp)
printf("\nPARSING FAILED\nExpression: '%s'\nParsing stopped at: '%s'\nParsing error code: %d (%s)\n", argv[1], (failed_at)?((*failed_at)?failed_at:"<END OF EXPRESSION>"):"<NONE>", error, expression_strerror(error));
else {
printf("\nPARSING OK\nExpression: '%s'\nParsed as : '%s'\nParsing error code: %d (%s)\n", argv[1], exp->parsed_as, error, expression_strerror(error));
if(expression_evaluate(exp)) {
printf("\nEvaluates to: %Lf\n\n", exp->result);
}
else {
printf("\nEvaluation failed with code %d and message: %s\n\n", exp->error, buffer_tostring(exp->error_msg));
}
expression_free(exp);
}
return 0;
}
|
