9c312311 |
1 | /* This file is part of the Linux Trace Toolkit viewer |
0769c82f |
2 | * Copyright (C) 2003-2005 Michel Dagenais |
9c312311 |
3 | * |
4 | * This program is free software; you can redistribute it and/or modify |
5 | * it under the terms of the GNU General Public License Version 2 as |
6 | * published by the Free Software Foundation; |
7 | * |
8 | * This program is distributed in the hope that it will be useful, |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
11 | * GNU General Public License for more details. |
12 | * |
13 | * You should have received a copy of the GNU General Public License |
14 | * along with this program; if not, write to the Free Software |
15 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, |
16 | * MA 02111-1307, USA. |
17 | */ |
18 | |
31452f49 |
19 | /* |
a4c292d4 |
20 | read_token |
48f6f3c2 |
21 | |
a4c292d4 |
22 | read_expression |
23 | ( read expr ) |
24 | simple expr [ op expr ] |
48f6f3c2 |
25 | |
a4c292d4 |
26 | read_simple_expression |
27 | read_field_path [ rel value ] |
48f6f3c2 |
28 | |
a4c292d4 |
29 | read_field_path |
30 | read_field_component [. field path] |
48f6f3c2 |
31 | |
a4c292d4 |
32 | read_field_component |
33 | name [ \[ value \] ] |
48f6f3c2 |
34 | |
a4c292d4 |
35 | data struct: |
36 | and/or(left/right) |
37 | not(child) |
38 | op(left/right) |
39 | path(component...) -> field |
150f0d33 |
40 | |
41 | consist in AND, OR and NOT nested expressions, forming a tree with |
42 | simple relations as leaves. The simple relations test is a field |
43 | in an event is equal, not equal, smaller, smaller or equal, larger, or |
44 | larger or equal to a specified value. |
31452f49 |
45 | */ |
46 | |
150f0d33 |
47 | /* |
48 | * YET TO BE ANSWERED |
49 | * - none yet |
50 | */ |
51 | |
52 | /* |
53 | * TODO |
54 | * - refine switch of expression in multiple uses functions |
55 | * - remove the idle expressions in the tree **** |
56 | * - add the current simple expression to the tree |
389ba50e |
57 | * * clear the field_path array after use |
150f0d33 |
58 | */ |
59 | |
60 | #include <lttv/filter.h> |
61 | |
62 | /* |
1a7fa682 |
63 | GQuark |
64 | LTTV_FILTER_TRACE, |
65 | LTTV_FILTER_TRACESET, |
66 | LTTV_FILTER_TRACEFILE, |
67 | LTTV_FILTER_STATE, |
91ad3f0a |
68 | LTTV_FILTER_EVENT, |
69 | LTTV_FILTER_NAME, |
70 | LTTV_FILTER_CATEGORY, |
71 | LTTV_FILTER_TIME, |
72 | LTTV_FILTER_TSC, |
73 | LTTV_FILTER_PID, |
74 | LTTV_FILTER_PPID, |
75 | LTTV_FILTER_C_TIME, |
76 | LTTV_FILTER_I_TIME, |
77 | LTTV_FILTER_P_NAME, |
78 | LTTV_FILTER_EX_MODE, |
79 | LTTV_FILTER_EX_SUBMODE, |
80 | LTTV_FILTER_P_STATUS, |
81 | LTTV_FILTER_CPU; |
150f0d33 |
82 | */ |
0cdc2470 |
83 | |
389ba50e |
84 | /** |
85 | * Constructor for LttvSimpleExpression |
86 | * @return pointer to new LttvSimpleExpression |
87 | */ |
2ea36caf |
88 | LttvSimpleExpression* |
0cdc2470 |
89 | lttv_simple_expression_new() { |
90 | |
389ba50e |
91 | LttvSimpleExpression* se = g_new(LttvSimpleExpression,1); |
92 | |
93 | se->field = LTTV_FILTER_UNDEFINED; |
bb87caa7 |
94 | se->op = NULL; |
389ba50e |
95 | se->offset = 0; |
96 | se->value = NULL; |
97 | |
98 | return se; |
0cdc2470 |
99 | } |
f4e9dd16 |
100 | /** |
150f0d33 |
101 | * add a node to the current tree |
bb87caa7 |
102 | * FIXME: Might be used to lower coding in lttv_filter_new switch expression |
150f0d33 |
103 | * @param stack the tree stack |
104 | * @param subtree the subtree if available (pointer or NULL) |
105 | * @param op the logical operator that will form the node |
f4e9dd16 |
106 | */ |
0cdc2470 |
107 | void |
5b729fcf |
108 | lttv_filter_tree_add_node(GPtrArray* stack, LttvFilterTree* subtree, LttvLogicalOp op) { |
0cdc2470 |
109 | |
5b729fcf |
110 | LttvFilterTree* t1 = NULL; |
111 | LttvFilterTree* t2 = NULL; |
0cdc2470 |
112 | |
5b729fcf |
113 | t1 = (LttvFilterTree*)g_ptr_array_index(stack,stack->len-1); |
0cdc2470 |
114 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
115 | t2 = lttv_filter_tree_new(); |
116 | t2->node = op; |
117 | if(subtree != NULL) { |
118 | t2->left = LTTV_TREE_NODE; |
119 | t2->l_child.t = subtree; |
120 | subtree = NULL; |
121 | t1->right = LTTV_TREE_NODE; |
122 | t1->r_child.t = t2; |
123 | } else { |
124 | // a_simple_expression->value = a_field_component->str; |
125 | // a_field_component = g_string_new(""); |
126 | t2->left = LTTV_TREE_LEAF; |
127 | // t2->l_child.leaf = a_simple_expression; |
128 | // a_simple_expression = g_new(lttv_simple_expression,1); |
129 | t1->right = LTTV_TREE_NODE; |
130 | t1->r_child.t = t2; |
131 | } |
132 | |
133 | } |
134 | |
0769c82f |
135 | /** |
136 | * Parse through filtering field hierarchy as specified |
137 | * by user. This function compares each value to |
138 | * predetermined quarks |
139 | * @param fp The field path list |
bb87caa7 |
140 | * @param se current simple expression |
0769c82f |
141 | * @return success/failure of operation |
142 | */ |
143 | gboolean |
47aa6e58 |
144 | parse_field_path(GPtrArray* fp, LttvSimpleExpression* se) { |
0769c82f |
145 | |
f4e9dd16 |
146 | GString* f = NULL; |
2b99ec10 |
147 | if(fp->len < 2) return FALSE; |
f4e9dd16 |
148 | g_assert(f=g_ptr_array_index(fp,0)); //list_first(fp)->data; |
47aa6e58 |
149 | |
150 | /* |
151 | * Parse through the specified |
152 | * hardcoded fields. |
153 | * |
154 | * Take note however that the |
155 | * 'event' subfields might change |
156 | * depending on values specified |
157 | * in core.xml file. Hence, if |
158 | * none of the subfields in the |
159 | * array match the hardcoded |
160 | * subfields, it will be considered |
161 | * as a dynamic field |
162 | */ |
163 | if(g_strcasecmp(f->str,"trace") ) { |
164 | /* |
165 | * Possible values: |
166 | * trace.name |
167 | */ |
168 | f=g_ptr_array_index(fp,1); |
389ba50e |
169 | if(g_strcasecmp(f->str,"name")) { |
170 | se->field = LTTV_FILTER_TRACE_NAME; |
171 | } |
47aa6e58 |
172 | else return FALSE; |
173 | } else if(g_strcasecmp(f->str,"traceset") ) { |
174 | /* |
175 | * FIXME: not yet implemented ! |
176 | */ |
177 | } else if(g_strcasecmp(f->str,"tracefile") ) { |
178 | /* |
179 | * Possible values: |
180 | * tracefile.name |
181 | */ |
182 | f=g_ptr_array_index(fp,1); |
389ba50e |
183 | if(g_strcasecmp(f->str,"name")) { |
184 | se->field = LTTV_FILTER_TRACEFILE_NAME; |
185 | } |
47aa6e58 |
186 | else return FALSE; |
187 | } else if(g_strcasecmp(f->str,"state") ) { |
188 | /* |
189 | * Possible values: |
190 | * state.pid |
191 | * state.ppid |
192 | * state.creation_time |
193 | * state.insertion_time |
194 | * state.process_name |
195 | * state.execution_mode |
196 | * state.execution_submode |
197 | * state.process_status |
198 | * state.cpu |
199 | */ |
200 | f=g_ptr_array_index(fp,1); |
389ba50e |
201 | if(g_strcasecmp(f->str,"pid") ) { |
202 | se->field = LTTV_FILTER_STATE_PID; |
203 | } |
204 | else if(g_strcasecmp(f->str,"ppid") ) { |
205 | se->field = LTTV_FILTER_STATE_PPID; |
206 | } |
207 | else if(g_strcasecmp(f->str,"creation_time") ) { |
208 | se->field = LTTV_FILTER_STATE_CT; |
209 | } |
210 | else if(g_strcasecmp(f->str,"insertion_time") ) { |
211 | se->field = LTTV_FILTER_STATE_IT; |
212 | } |
213 | else if(g_strcasecmp(f->str,"process_name") ) { |
214 | se->field = LTTV_FILTER_STATE_P_NAME; |
215 | } |
216 | else if(g_strcasecmp(f->str,"execution_mode") ) { |
217 | se->field = LTTV_FILTER_STATE_EX_MODE; |
218 | } |
219 | else if(g_strcasecmp(f->str,"execution_submode") ) { |
220 | se->field = LTTV_FILTER_STATE_EX_SUBMODE; |
221 | } |
222 | else if(g_strcasecmp(f->str,"process_status") ) { |
223 | se->field = LTTV_FILTER_STATE_P_STATUS; |
224 | } |
225 | else if(g_strcasecmp(f->str,"cpu") ) { |
226 | se->field = LTTV_FILTER_STATE_CPU; |
227 | } |
47aa6e58 |
228 | else return FALSE; |
229 | } else if(g_strcasecmp(f->str,"event") ) { |
389ba50e |
230 | /* |
231 | * Possible values: |
232 | * event.name |
233 | * event.category |
234 | * event.time |
235 | * event.tsc |
236 | */ |
2b99ec10 |
237 | f=g_ptr_array_index(fp,1); |
389ba50e |
238 | if(g_strcasecmp(f->str,"name") ) { |
239 | se->field = LTTV_FILTER_EVENT_NAME; |
240 | } |
241 | else if(g_strcasecmp(f->str,"category") ) { |
242 | /* |
243 | * FIXME: Category not yet functional in lttv |
244 | */ |
245 | se->field = LTTV_FILTER_EVENT_CATEGORY; |
246 | } |
47aa6e58 |
247 | else if(g_strcasecmp(f->str,"time") ) { |
389ba50e |
248 | se->field = LTTV_FILTER_EVENT_TIME; |
2b99ec10 |
249 | // offset = &((LttEvent*)NULL)->event_time); |
250 | } |
47aa6e58 |
251 | else if(g_strcasecmp(f->str,"tsc") ) { |
389ba50e |
252 | se->field = LTTV_FILTER_EVENT_TSC; |
2b99ec10 |
253 | // offset = &((LttEvent*)NULL)->event_cycle_count); |
254 | } |
255 | else { /* core.xml specified options */ |
389ba50e |
256 | se->field = LTTV_FILTER_EVENT_FIELD; |
257 | //se->offset = (...); |
2b99ec10 |
258 | } |
91ad3f0a |
259 | } else { |
260 | g_warning("Unrecognized field in filter string"); |
261 | return FALSE; |
0769c82f |
262 | } |
47aa6e58 |
263 | |
bb87caa7 |
264 | /* free the pointer array */ |
265 | g_ptr_array_free(fp,FALSE); |
266 | |
91ad3f0a |
267 | return TRUE; |
0769c82f |
268 | } |
269 | |
bb87caa7 |
270 | /** |
271 | * Sets the function pointer for the current |
272 | * Simple Expression |
273 | * @param se current simple expression |
274 | * @return success/failure of operation |
275 | */ |
276 | gboolean assign_operator(LttvSimpleExpression* se, LttvExpressionOp op) { |
277 | |
278 | switch(se->field) { |
279 | /* char */ |
280 | case LTTV_FILTER_TRACE_NAME: |
281 | case LTTV_FILTER_TRACEFILE_NAME: |
282 | case LTTV_FILTER_STATE_P_NAME: |
283 | case LTTV_FILTER_EVENT_NAME: |
284 | switch(op) { |
285 | case LTTV_FIELD_EQ: |
286 | se->op = lttv_apply_op_eq_string; |
287 | break; |
288 | case LTTV_FIELD_NE: |
289 | se->op = lttv_apply_op_eq_string; |
290 | break; |
291 | default: |
292 | g_warning("Error encountered in operator assignment"); |
293 | return FALSE; |
294 | } |
295 | break; |
296 | case LTTV_FILTER_STATE_PID: |
297 | case LTTV_FILTER_STATE_PPID: |
298 | case LTTV_FILTER_STATE_EX_MODE: |
299 | case LTTV_FILTER_STATE_EX_SUBMODE: |
300 | case LTTV_FILTER_STATE_P_STATUS: |
301 | switch(op) { |
302 | case LTTV_FIELD_EQ: |
303 | se->op = lttv_apply_op_eq_uint64; |
304 | break; |
305 | case LTTV_FIELD_NE: |
306 | se->op = lttv_apply_op_ne_uint64; |
307 | break; |
308 | case LTTV_FIELD_LT: |
309 | se->op = lttv_apply_op_lt_uint64; |
310 | break; |
311 | case LTTV_FIELD_LE: |
312 | se->op = lttv_apply_op_le_uint64; |
313 | break; |
314 | case LTTV_FIELD_GT: |
315 | se->op = lttv_apply_op_gt_uint64; |
316 | break; |
317 | case LTTV_FIELD_GE: |
318 | se->op = lttv_apply_op_ge_uint64; |
319 | break; |
320 | default: |
321 | g_warning("Error encountered in operator assignment"); |
322 | return FALSE; |
323 | } |
324 | break; |
325 | case LTTV_FILTER_STATE_CT: |
326 | case LTTV_FILTER_STATE_IT: |
327 | case LTTV_FILTER_EVENT_TIME: |
328 | case LTTV_FILTER_EVENT_TSC: |
329 | switch(op) { |
330 | case LTTV_FIELD_EQ: |
331 | se->op = lttv_apply_op_eq_double; |
332 | break; |
333 | case LTTV_FIELD_NE: |
334 | se->op = lttv_apply_op_ne_double; |
335 | break; |
336 | case LTTV_FIELD_LT: |
337 | se->op = lttv_apply_op_lt_double; |
338 | break; |
339 | case LTTV_FIELD_LE: |
340 | se->op = lttv_apply_op_le_double; |
341 | break; |
342 | case LTTV_FIELD_GT: |
343 | se->op = lttv_apply_op_gt_double; |
344 | break; |
345 | case LTTV_FIELD_GE: |
346 | se->op = lttv_apply_op_ge_double; |
347 | break; |
348 | default: |
349 | g_warning("Error encountered in operator assignment"); |
350 | return FALSE; |
351 | } |
352 | break; |
353 | default: |
354 | g_warning("Error encountered in operator assignment"); |
355 | return FALSE; |
356 | } |
357 | |
358 | } |
359 | |
31452f49 |
360 | /** |
84a333d6 |
361 | * Add an filtering option to the current tree |
362 | * @param expression Current expression to parse |
363 | * @return success/failure of operation |
364 | */ |
365 | gboolean |
366 | parse_simple_expression(GString* expression) { |
367 | |
368 | unsigned i; |
369 | |
a4c292d4 |
370 | |
0769c82f |
371 | |
a4c292d4 |
372 | |
5f185a2b |
373 | } |
374 | |
375 | /** |
376 | * Append a new expression to the expression |
377 | * defined in the current filter |
378 | * @param filter pointer to the current LttvFilter |
379 | * @param expression string that must be appended |
380 | */ |
381 | void lttv_filter_append_expression(LttvFilter* filter, char *expression) { |
382 | |
383 | if(expression == NULL) return; |
384 | if(filter == NULL) { |
385 | filter = lttv_filter_new(); |
386 | filter->expression = expression; |
387 | } else if(filter->expression == NULL) { |
388 | filter->expression = expression; |
389 | } else { |
390 | filter->expression = g_strconcat(filter->expression,"&",expression); |
391 | } |
392 | |
393 | lttv_filter_update(filter); |
394 | |
395 | } |
396 | |
8c89f5a8 |
397 | /** |
398 | * Clear the filter expression from the |
399 | * current filter and sets its pointer to NULL |
400 | * @param filter pointer to the current LttvFilter |
401 | */ |
5f185a2b |
402 | void lttv_filter_clear_expression(LttvFilter* filter) { |
403 | |
404 | if(filter->expression != NULL) { |
405 | g_free(filter->expression); |
406 | filter->expression = NULL; |
407 | } |
408 | |
84a333d6 |
409 | } |
410 | |
150f0d33 |
411 | /** |
412 | * Applies the 'equal' operator to the |
47aa6e58 |
413 | * specified structure and value |
414 | * @param v1 left member of comparison |
415 | * @param v2 right member of comparison |
150f0d33 |
416 | * @return success/failure of operation |
417 | */ |
83aa92fc |
418 | gboolean lttv_apply_op_eq_uint64(gpointer v1, char* v2) { |
419 | |
420 | guint64* r = (guint64*) v1; |
421 | guint64 l = atoi(v2); |
422 | return (*r == l); |
423 | |
424 | } |
150f0d33 |
425 | |
5b729fcf |
426 | /** |
427 | * Applies the 'equal' operator to the |
47aa6e58 |
428 | * specified structure and value |
429 | * @param v1 left member of comparison |
430 | * @param v2 right member of comparison |
5b729fcf |
431 | * @return success/failure of operation |
432 | */ |
83aa92fc |
433 | gboolean lttv_apply_op_eq_uint32(gpointer v1, char* v2) { |
434 | guint32* r = (guint32*) v1; |
435 | guint32 l = atoi(v2); |
436 | return (*r == l); |
437 | } |
5b729fcf |
438 | |
439 | /** |
440 | * Applies the 'equal' operator to the |
47aa6e58 |
441 | * specified structure and value |
442 | * @param v1 left member of comparison |
443 | * @param v2 right member of comparison |
5b729fcf |
444 | * @return success/failure of operation |
445 | */ |
83aa92fc |
446 | gboolean lttv_apply_op_eq_uint16(gpointer v1, char* v2) { |
447 | guint16* r = (guint16*) v1; |
448 | guint16 l = atoi(v2); |
449 | return (*r == l); |
450 | } |
5b729fcf |
451 | |
452 | /** |
453 | * Applies the 'equal' operator to the |
47aa6e58 |
454 | * specified structure and value |
455 | * @param v1 left member of comparison |
456 | * @param v2 right member of comparison |
5b729fcf |
457 | * @return success/failure of operation |
458 | */ |
83aa92fc |
459 | gboolean lttv_apply_op_eq_double(gpointer v1, char* v2) { |
460 | double* r = (double*) v1; |
461 | double l = atof(v2); |
462 | return (*r == l); |
463 | } |
5b729fcf |
464 | |
465 | /** |
466 | * Applies the 'equal' operator to the |
47aa6e58 |
467 | * specified structure and value |
468 | * @param v1 left member of comparison |
469 | * @param v2 right member of comparison |
5b729fcf |
470 | * @return success/failure of operation |
471 | */ |
83aa92fc |
472 | gboolean lttv_apply_op_eq_string(gpointer v1, char* v2) { |
473 | char* r = (char*) v1; |
474 | return (g_strcasecmp(r,v2)); |
475 | } |
150f0d33 |
476 | |
477 | /** |
478 | * Applies the 'not equal' operator to the |
47aa6e58 |
479 | * specified structure and value |
480 | * @param v1 left member of comparison |
481 | * @param v2 right member of comparison |
150f0d33 |
482 | * @return success/failure of operation |
483 | */ |
83aa92fc |
484 | gboolean lttv_apply_op_ne_uint64(gpointer v1, char* v2) { |
485 | guint64* r = (guint64*) v1; |
486 | guint64 l = atoi(v2); |
487 | return (*r != l); |
488 | } |
150f0d33 |
489 | |
5b729fcf |
490 | /** |
491 | * Applies the 'not equal' operator to the |
47aa6e58 |
492 | * specified structure and value |
493 | * @param v1 left member of comparison |
494 | * @param v2 right member of comparison |
5b729fcf |
495 | * @return success/failure of operation |
496 | */ |
83aa92fc |
497 | gboolean lttv_apply_op_ne_uint32(gpointer v1, char* v2) { |
498 | guint32* r = (guint32*) v1; |
499 | guint32 l = atoi(v2); |
500 | return (*r != l); |
501 | } |
5b729fcf |
502 | |
503 | /** |
504 | * Applies the 'not equal' operator to the |
47aa6e58 |
505 | * specified structure and value |
506 | * @param v1 left member of comparison |
507 | * @param v2 right member of comparison |
5b729fcf |
508 | * @return success/failure of operation |
509 | */ |
83aa92fc |
510 | gboolean lttv_apply_op_ne_uint16(gpointer v1, char* v2) { |
511 | guint16* r = (guint16*) v1; |
512 | guint16 l = atoi(v2); |
513 | return (*r != l); |
514 | } |
5b729fcf |
515 | |
516 | /** |
517 | * Applies the 'not equal' operator to the |
47aa6e58 |
518 | * specified structure and value |
519 | * @param v1 left member of comparison |
520 | * @param v2 right member of comparison |
5b729fcf |
521 | * @return success/failure of operation |
522 | */ |
83aa92fc |
523 | gboolean lttv_apply_op_ne_double(gpointer v1, char* v2) { |
524 | double* r = (double*) v1; |
525 | double l = atof(v2); |
526 | return (*r != l); |
527 | } |
5b729fcf |
528 | |
529 | /** |
530 | * Applies the 'not equal' operator to the |
47aa6e58 |
531 | * specified structure and value |
532 | * @param v1 left member of comparison |
533 | * @param v2 right member of comparison |
5b729fcf |
534 | * @return success/failure of operation |
535 | */ |
83aa92fc |
536 | gboolean lttv_apply_op_ne_string(gpointer v1, char* v2) { |
537 | char* r = (char*) v1; |
538 | return (!g_strcasecmp(r,v2)); |
539 | } |
150f0d33 |
540 | |
541 | /** |
542 | * Applies the 'lower than' operator to the |
47aa6e58 |
543 | * specified structure and value |
544 | * @param v1 left member of comparison |
545 | * @param v2 right member of comparison |
150f0d33 |
546 | * @return success/failure of operation |
547 | */ |
83aa92fc |
548 | gboolean lttv_apply_op_lt_uint64(gpointer v1, char* v2) { |
549 | guint64* r = (guint64*) v1; |
550 | guint64 l = atoi(v2); |
551 | return (*r < l); |
552 | } |
150f0d33 |
553 | |
5b729fcf |
554 | /** |
555 | * Applies the 'lower than' operator to the |
47aa6e58 |
556 | * specified structure and value |
557 | * @param v1 left member of comparison |
558 | * @param v2 right member of comparison |
5b729fcf |
559 | * @return success/failure of operation |
560 | */ |
83aa92fc |
561 | gboolean lttv_apply_op_lt_uint32(gpointer v1, char* v2) { |
562 | guint32* r = (guint32*) v1; |
563 | guint32 l = atoi(v2); |
564 | return (*r < l); |
565 | } |
5b729fcf |
566 | |
567 | /** |
568 | * Applies the 'lower than' operator to the |
47aa6e58 |
569 | * specified structure and value |
570 | * @param v1 left member of comparison |
571 | * @param v2 right member of comparison |
5b729fcf |
572 | * @return success/failure of operation |
573 | */ |
83aa92fc |
574 | gboolean lttv_apply_op_lt_uint16(gpointer v1, char* v2) { |
575 | guint16* r = (guint16*) v1; |
576 | guint16 l = atoi(v2); |
577 | return (*r < l); |
578 | } |
5b729fcf |
579 | |
580 | /** |
581 | * Applies the 'lower than' operator to the |
47aa6e58 |
582 | * specified structure and value |
583 | * @param v1 left member of comparison |
584 | * @param v2 right member of comparison |
5b729fcf |
585 | * @return success/failure of operation |
586 | */ |
83aa92fc |
587 | gboolean lttv_apply_op_lt_double(gpointer v1, char* v2) { |
588 | double* r = (double*) v1; |
589 | double l = atof(v2); |
590 | return (*r < l); |
591 | } |
5b729fcf |
592 | |
593 | /** |
594 | * Applies the 'lower than' operator to the |
47aa6e58 |
595 | * specified structure and value |
596 | * @param v1 left member of comparison |
597 | * @param v2 right member of comparison |
5b729fcf |
598 | * @return success/failure of operation |
599 | */ |
83aa92fc |
600 | gboolean lttv_apply_op_le_uint64(gpointer v1, char* v2) { |
601 | guint64* r = (guint64*) v1; |
602 | guint64 l = atoi(v2); |
603 | return (*r <= l); |
604 | } |
150f0d33 |
605 | |
606 | /** |
607 | * Applies the 'lower or equal' operator to the |
47aa6e58 |
608 | * specified structure and value |
609 | * @param v1 left member of comparison |
610 | * @param v2 right member of comparison |
150f0d33 |
611 | * @return success/failure of operation |
612 | */ |
83aa92fc |
613 | gboolean lttv_apply_op_le_uint32(gpointer v1, char* v2) { |
614 | guint32* r = (guint32*) v1; |
615 | guint32 l = atoi(v2); |
616 | return (*r <= l); |
617 | } |
150f0d33 |
618 | |
5b729fcf |
619 | /** |
620 | * Applies the 'lower or equal' operator to the |
47aa6e58 |
621 | * specified structure and value |
622 | * @param v1 left member of comparison |
623 | * @param v2 right member of comparison |
5b729fcf |
624 | * @return success/failure of operation |
625 | */ |
83aa92fc |
626 | gboolean lttv_apply_op_le_uint16(gpointer v1, char* v2) { |
627 | guint16* r = (guint16*) v1; |
628 | guint16 l = atoi(v2); |
629 | return (*r <= l); |
630 | } |
5b729fcf |
631 | |
632 | /** |
633 | * Applies the 'lower or equal' operator to the |
47aa6e58 |
634 | * specified structure and value |
635 | * @param v1 left member of comparison |
636 | * @param v2 right member of comparison |
5b729fcf |
637 | * @return success/failure of operation |
638 | */ |
83aa92fc |
639 | gboolean lttv_apply_op_le_double(gpointer v1, char* v2) { |
640 | double* r = (double*) v1; |
641 | double l = atof(v2); |
642 | return (*r <= l); |
643 | } |
5b729fcf |
644 | |
645 | /** |
83aa92fc |
646 | * Applies the 'greater than' operator to the |
47aa6e58 |
647 | * specified structure and value |
648 | * @param v1 left member of comparison |
649 | * @param v2 right member of comparison |
5b729fcf |
650 | * @return success/failure of operation |
651 | */ |
83aa92fc |
652 | gboolean lttv_apply_op_gt_uint64(gpointer v1, char* v2) { |
653 | guint64* r = (guint64*) v1; |
654 | guint64 l = atoi(v2); |
655 | return (*r > l); |
656 | } |
150f0d33 |
657 | |
658 | /** |
659 | * Applies the 'greater than' operator to the |
47aa6e58 |
660 | * specified structure and value |
661 | * @param v1 left member of comparison |
662 | * @param v2 right member of comparison |
150f0d33 |
663 | * @return success/failure of operation |
664 | */ |
83aa92fc |
665 | gboolean lttv_apply_op_gt_uint32(gpointer v1, char* v2) { |
666 | guint32* r = (guint32*) v1; |
667 | guint32 l = atoi(v2); |
668 | return (*r > l); |
669 | } |
150f0d33 |
670 | |
5b729fcf |
671 | /** |
672 | * Applies the 'greater than' operator to the |
47aa6e58 |
673 | * specified structure and value |
674 | * @param v1 left member of comparison |
675 | * @param v2 right member of comparison |
5b729fcf |
676 | * @return success/failure of operation |
677 | */ |
83aa92fc |
678 | gboolean lttv_apply_op_gt_uint16(gpointer v1, char* v2) { |
679 | guint16* r = (guint16*) v1; |
680 | guint16 l = atoi(v2); |
681 | return (*r > l); |
682 | } |
5b729fcf |
683 | |
684 | /** |
685 | * Applies the 'greater than' operator to the |
47aa6e58 |
686 | * specified structure and value |
687 | * @param v1 left member of comparison |
688 | * @param v2 right member of comparison |
5b729fcf |
689 | * @return success/failure of operation |
690 | */ |
83aa92fc |
691 | gboolean lttv_apply_op_gt_double(gpointer v1, char* v2) { |
692 | double* r = (double*) v1; |
693 | double l = atof(v2); |
694 | return (*r > l); |
695 | } |
5b729fcf |
696 | |
697 | /** |
83aa92fc |
698 | * Applies the 'greater or equal' operator to the |
47aa6e58 |
699 | * specified structure and value |
700 | * @param v1 left member of comparison |
701 | * @param v2 right member of comparison |
5b729fcf |
702 | * @return success/failure of operation |
703 | */ |
83aa92fc |
704 | gboolean lttv_apply_op_ge_uint64(gpointer v1, char* v2) { |
705 | guint64* r = (guint64*) v1; |
706 | guint64 l = atoi(v2); |
707 | return (*r >= l); |
708 | } |
150f0d33 |
709 | |
710 | /** |
711 | * Applies the 'greater or equal' operator to the |
47aa6e58 |
712 | * specified structure and value |
713 | * @param v1 left member of comparison |
714 | * @param v2 right member of comparison |
150f0d33 |
715 | * @return success/failure of operation |
716 | */ |
83aa92fc |
717 | gboolean lttv_apply_op_ge_uint32(gpointer v1, char* v2) { |
718 | guint32* r = (guint32*) v1; |
719 | guint32 l = atoi(v2); |
720 | return (*r >= l); |
721 | } |
150f0d33 |
722 | |
5b729fcf |
723 | /** |
724 | * Applies the 'greater or equal' operator to the |
47aa6e58 |
725 | * specified structure and value |
726 | * @param v1 left member of comparison |
727 | * @param v2 right member of comparison |
5b729fcf |
728 | * @return success/failure of operation |
729 | */ |
83aa92fc |
730 | gboolean lttv_apply_op_ge_uint16(gpointer v1, char* v2) { |
731 | guint16* r = (guint16*) v1; |
732 | guint16 l = atoi(v2); |
733 | return (*r >= l); |
734 | } |
150f0d33 |
735 | |
5b729fcf |
736 | /** |
737 | * Applies the 'greater or equal' operator to the |
47aa6e58 |
738 | * specified structure and value |
739 | * @param v1 left member of comparison |
740 | * @param v2 right member of comparison |
5b729fcf |
741 | * @return success/failure of operation |
742 | */ |
83aa92fc |
743 | gboolean lttv_apply_op_ge_double(gpointer v1, char* v2) { |
744 | double* r = (double*) v1; |
745 | double l = atof(v2); |
746 | return (*r >= l); |
747 | } |
150f0d33 |
748 | |
749 | |
750 | /** |
751 | * Makes a copy of the current filter tree |
752 | * @param tree pointer to the current tree |
753 | * @return new copy of the filter tree |
754 | */ |
755 | LttvFilterTree* |
756 | lttv_filter_tree_clone(LttvFilterTree* tree) { |
757 | |
8c89f5a8 |
758 | LttvFilterTree* newtree = lttv_filter_tree_new(); |
150f0d33 |
759 | |
8c89f5a8 |
760 | newtree->node = tree->node; |
761 | |
762 | newtree->left = tree->left; |
763 | if(newtree->left == LTTV_TREE_NODE) { |
764 | newtree->l_child.t = lttv_filter_tree_clone(tree->l_child.t); |
765 | } else if(newtree->left == LTTV_TREE_LEAF) { |
766 | newtree->l_child.leaf = lttv_simple_expression_new(); |
767 | newtree->l_child.leaf->field = tree->l_child.leaf->field; |
768 | newtree->l_child.leaf->offset = tree->l_child.leaf->offset; |
769 | newtree->l_child.leaf->op = tree->l_child.leaf->op; |
770 | newtree->l_child.leaf->value = g_strconcat(tree->l_child.leaf->value); |
771 | } |
772 | |
773 | newtree->right = tree->right; |
774 | if(newtree->right == LTTV_TREE_NODE) { |
775 | newtree->r_child.t = lttv_filter_tree_clone(tree->r_child.t); |
776 | } else if(newtree->right == LTTV_TREE_LEAF) { |
777 | newtree->r_child.leaf = lttv_simple_expression_new(); |
778 | newtree->r_child.leaf->field = tree->r_child.leaf->field; |
779 | newtree->r_child.leaf->offset = tree->r_child.leaf->offset; |
780 | newtree->r_child.leaf->op = tree->r_child.leaf->op; |
781 | newtree->r_child.leaf->value = g_strconcat(tree->r_child.leaf->value); |
782 | } |
783 | |
784 | return newtree; |
785 | |
150f0d33 |
786 | } |
787 | |
788 | /** |
789 | * Makes a copy of the current filter |
790 | * @param filter pointer to the current filter |
791 | * @return new copy of the filter |
792 | */ |
793 | LttvFilter* |
794 | lttv_filter_clone(LttvFilter* filter) { |
795 | |
796 | |
797 | LttvFilter* newfilter = g_new(LttvFilter,1); |
798 | |
799 | // newfilter->expression = g_new(char,1) |
800 | strcpy(newfilter->expression,filter->expression); |
801 | |
802 | newfilter->head = lttv_filter_tree_clone(filter->head); |
803 | |
804 | return newfilter; |
805 | |
806 | } |
807 | |
808 | |
84a333d6 |
809 | /** |
810 | * Creates a new lttv_filter |
31452f49 |
811 | * @param expression filtering options string |
812 | * @param t pointer to the current LttvTrace |
84a333d6 |
813 | * @return the current lttv_filter or NULL if error |
31452f49 |
814 | */ |
2ea36caf |
815 | LttvFilter* |
5f185a2b |
816 | lttv_filter_new() { |
a4c292d4 |
817 | |
5f185a2b |
818 | LttvFilter* filter = g_new(LttvFilter,1); |
819 | filter->expression = NULL; |
820 | filter->head = NULL; |
821 | |
822 | } |
a4c292d4 |
823 | |
8c89f5a8 |
824 | /** |
825 | * Updates the current LttvFilter by building |
826 | * its tree based upon the expression string |
827 | * @param filter pointer to the current LttvFilter |
828 | * @return Failure/Success of operation |
829 | */ |
5f185a2b |
830 | gboolean |
831 | lttv_filter_update(LttvFilter* filter) { |
832 | |
833 | g_print("filter::lttv_filter_new()\n"); /* debug */ |
834 | |
835 | if(filter->expression == NULL) return FALSE; |
836 | |
a4c292d4 |
837 | unsigned |
838 | i, |
91ad3f0a |
839 | p_nesting=0, /* parenthesis nesting value */ |
a4c292d4 |
840 | b=0; /* current breakpoint in expression string */ |
1601b365 |
841 | |
842 | /* trees */ |
5b729fcf |
843 | LttvFilterTree |
1601b365 |
844 | *tree = lttv_filter_tree_new(), /* main tree */ |
845 | *subtree = NULL, /* buffer for subtrees */ |
846 | *t1, /* buffer #1 */ |
847 | *t2; /* buffer #2 */ |
848 | |
5f185a2b |
849 | /* |
850 | * the filter |
851 | * If the tree already exists, |
852 | * destroy it and build a new one |
853 | */ |
854 | if(filter->head != NULL) lttv_filter_tree_destroy(filter->head); |
855 | filter->head = tree; |
856 | |
1601b365 |
857 | /* |
858 | * Tree Stack |
f4e9dd16 |
859 | * each element of the list |
860 | * is a sub tree created |
861 | * by the use of parenthesis in the |
862 | * global expression. The final tree |
1601b365 |
863 | * will be the one left at the root of |
f4e9dd16 |
864 | * the list |
865 | */ |
18d1226f |
866 | GPtrArray *tree_stack = g_ptr_array_new(); |
867 | g_ptr_array_add( tree_stack,(gpointer) tree ); |
f4e9dd16 |
868 | |
a4c292d4 |
869 | /* temporary values */ |
0769c82f |
870 | GString *a_field_component = g_string_new(""); |
f4e9dd16 |
871 | GPtrArray *a_field_path = NULL; |
872 | |
389ba50e |
873 | LttvSimpleExpression* a_simple_expression = lttv_simple_expression_new(); |
0769c82f |
874 | |
a4c292d4 |
875 | /* |
876 | * Parse entire expression and construct |
877 | * the binary tree. There are two steps |
878 | * in browsing that string |
f4e9dd16 |
879 | * 1. finding boolean ops " &,|,^,! " and parenthesis " {,(,[,],),} " |
a4c292d4 |
880 | * 2. finding simple expressions |
0769c82f |
881 | * - field path ( separated by dots ) |
a4c292d4 |
882 | * - op ( >, <, =, >=, <=, !=) |
0769c82f |
883 | * - value ( integer, string ... ) |
884 | * To spare computing time, the whole |
885 | * string is parsed in this loop for a |
886 | * O(n) complexity order. |
1601b365 |
887 | * |
18d1226f |
888 | * When encountering logical op &,|,^ |
889 | * 1. parse the last value if any |
890 | * 2. create a new tree |
891 | * 3. add the expression (simple exp, or exp (subtree)) to the tree |
892 | * 4. concatenate this tree with the current tree on top of the stack |
893 | * When encountering math ops >,>=,<,<=,=,!= |
894 | * 1. add to op to the simple expression |
895 | * 2. concatenate last field component to field path |
896 | * When encountering concatening ops . |
897 | * 1. concatenate last field component to field path |
898 | * When encountering opening parenthesis (,{,[ |
899 | * 1. create a new subtree on top of tree stack |
900 | * When encountering closing parenthesis ),},] |
901 | * 1. add the expression on right child of the current tree |
902 | * 2. the subtree is completed, allocate a new subtree |
903 | * 3. pop the tree value from the tree stack |
904 | */ |
905 | |
f4e9dd16 |
906 | a_field_path = g_ptr_array_new(); |
907 | g_ptr_array_set_size(a_field_path,2); /* by default, recording 2 field expressions */ |
908 | |
18d1226f |
909 | |
5f185a2b |
910 | for(i=0;i<strlen(filter->expression);i++) { |
911 | // debug |
912 | g_print("%c ",filter->expression[i]); |
913 | switch(filter->expression[i]) { |
a4c292d4 |
914 | /* |
915 | * logical operators |
916 | */ |
917 | case '&': /* and */ |
5b729fcf |
918 | t1 = (LttvFilterTree*)g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
919 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
18d1226f |
920 | t2 = lttv_filter_tree_new(); |
0cdc2470 |
921 | t2->node = LTTV_LOGICAL_AND; |
bb87caa7 |
922 | if(subtree != NULL) { /* append subtree to current tree */ |
18d1226f |
923 | t2->left = LTTV_TREE_NODE; |
924 | t2->l_child.t = subtree; |
f4e9dd16 |
925 | subtree = NULL; |
18d1226f |
926 | t1->right = LTTV_TREE_NODE; |
410c83da |
927 | t1->r_child.t = t2; |
bb87caa7 |
928 | } else { /* append a simple expression */ |
0cdc2470 |
929 | a_simple_expression->value = a_field_component->str; |
18d1226f |
930 | a_field_component = g_string_new(""); |
931 | t2->left = LTTV_TREE_LEAF; |
0cdc2470 |
932 | t2->l_child.leaf = a_simple_expression; |
389ba50e |
933 | a_simple_expression = lttv_simple_expression_new(); |
18d1226f |
934 | t1->right = LTTV_TREE_NODE; |
410c83da |
935 | t1->r_child.t = t2; |
f4e9dd16 |
936 | } |
937 | |
938 | break; |
a4c292d4 |
939 | case '|': /* or */ |
2ea36caf |
940 | t1 = (LttvFilter*)g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
941 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
1601b365 |
942 | t2 = lttv_filter_tree_new(); |
0cdc2470 |
943 | t2->node = LTTV_LOGICAL_OR; |
bb87caa7 |
944 | if(subtree != NULL) { /* append subtree to current tree */ |
1601b365 |
945 | t2->left = LTTV_TREE_NODE; |
946 | t2->l_child.t = subtree; |
947 | subtree = NULL; |
948 | t1->right = LTTV_TREE_NODE; |
949 | t1->r_child.t = t2; |
bb87caa7 |
950 | } else { /* append a simple expression */ |
0cdc2470 |
951 | a_simple_expression->value = a_field_component->str; |
1601b365 |
952 | a_field_component = g_string_new(""); |
953 | t2->left = LTTV_TREE_LEAF; |
0cdc2470 |
954 | t2->l_child.leaf = a_simple_expression; |
389ba50e |
955 | a_simple_expression = lttv_simple_expression_new(); |
1601b365 |
956 | t1->right = LTTV_TREE_NODE; |
957 | t1->r_child.t = t2; |
958 | } |
f4e9dd16 |
959 | break; |
a4c292d4 |
960 | case '^': /* xor */ |
2ea36caf |
961 | t1 = (LttvFilter*)g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
962 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
1601b365 |
963 | t2 = lttv_filter_tree_new(); |
0cdc2470 |
964 | t2->node = LTTV_LOGICAL_XOR; |
bb87caa7 |
965 | if(subtree != NULL) { /* append subtree to current tree */ |
1601b365 |
966 | t2->left = LTTV_TREE_NODE; |
967 | t2->l_child.t = subtree; |
968 | subtree = NULL; |
969 | t1->right = LTTV_TREE_NODE; |
970 | t1->r_child.t = t2; |
bb87caa7 |
971 | } else { /* append a simple expression */ |
0cdc2470 |
972 | a_simple_expression->value = a_field_component->str; |
1601b365 |
973 | a_field_component = g_string_new(""); |
974 | t2->left = LTTV_TREE_LEAF; |
0cdc2470 |
975 | t2->l_child.leaf = a_simple_expression; |
389ba50e |
976 | a_simple_expression = lttv_simple_expression_new(); |
1601b365 |
977 | t1->right = LTTV_TREE_NODE; |
978 | t1->r_child.t = t2; |
979 | } |
a4c292d4 |
980 | break; |
981 | case '!': /* not, or not equal (math op) */ |
5f185a2b |
982 | if(filter->expression[i+1] == '=') { /* != */ |
bb87caa7 |
983 | assign_operator(a_simple_expression,LTTV_FIELD_NE); |
a4c292d4 |
984 | i++; |
0cdc2470 |
985 | g_ptr_array_add( a_field_path,(gpointer) a_field_component ); |
389ba50e |
986 | parse_field_path(a_field_path,a_simple_expression); |
0cdc2470 |
987 | a_field_component = g_string_new(""); |
a4c292d4 |
988 | } else { /* ! */ |
1601b365 |
989 | // g_print("%s\n",a_field_component); |
990 | // a_field_component = g_string_new(""); |
2ea36caf |
991 | t1 = (LttvFilter*)g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
992 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
1601b365 |
993 | t2 = lttv_filter_tree_new(); |
0cdc2470 |
994 | t2->node = LTTV_LOGICAL_NOT; |
1601b365 |
995 | t1->right = LTTV_TREE_NODE; |
996 | t1->r_child.t = t2; |
a4c292d4 |
997 | } |
998 | break; |
999 | case '(': /* start of parenthesis */ |
91ad3f0a |
1000 | case '[': |
1001 | case '{': |
1002 | p_nesting++; /* incrementing parenthesis nesting value */ |
1601b365 |
1003 | t1 = lttv_filter_tree_new(); |
1004 | g_ptr_array_add( tree_stack,(gpointer) t1 ); |
a4c292d4 |
1005 | break; |
1006 | case ')': /* end of parenthesis */ |
91ad3f0a |
1007 | case ']': |
1008 | case '}': |
1009 | p_nesting--; /* decrementing parenthesis nesting value */ |
18d1226f |
1010 | if(p_nesting<0 || tree_stack->len<2) { |
f4e9dd16 |
1011 | g_warning("Wrong filtering options, the string\n\"%s\"\n\ |
5f185a2b |
1012 | is not valid due to parenthesis incorrect use",filter->expression); |
1013 | return FALSE; |
f4e9dd16 |
1014 | } |
18d1226f |
1015 | |
1016 | g_assert(tree_stack->len>0); |
bb87caa7 |
1017 | if(subtree != NULL) { /* append subtree to current tree */ |
18d1226f |
1018 | t1 = g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
1019 | while(t1->right != LTTV_TREE_IDLE && t1->right != LTTV_TREE_LEAF) { |
18d1226f |
1020 | g_assert(t1!=NULL && t1->r_child.t != NULL); |
1021 | t1 = t1->r_child.t; |
1022 | } |
1023 | t1->right = LTTV_TREE_NODE; |
1024 | t1->r_child.t = subtree; |
1025 | subtree = g_ptr_array_index(tree_stack,tree_stack->len-1); |
1026 | g_ptr_array_remove_index(tree_stack,tree_stack->len-1); |
bb87caa7 |
1027 | } else { /* assign subtree as current tree */ |
0cdc2470 |
1028 | a_simple_expression->value = a_field_component->str; |
18d1226f |
1029 | a_field_component = g_string_new(""); |
1030 | t1 = g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
1031 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
18d1226f |
1032 | t1->right = LTTV_TREE_LEAF; |
0cdc2470 |
1033 | t1->r_child.leaf = a_simple_expression; |
389ba50e |
1034 | a_simple_expression = lttv_simple_expression_new(); |
18d1226f |
1035 | subtree = g_ptr_array_index(tree_stack,tree_stack->len-1); |
1601b365 |
1036 | g_assert(subtree != NULL); |
18d1226f |
1037 | g_ptr_array_remove_index(tree_stack,tree_stack->len-1); |
1038 | } |
a4c292d4 |
1039 | break; |
1040 | |
1041 | /* |
1042 | * mathematic operators |
1043 | */ |
1044 | case '<': /* lower, lower or equal */ |
5f185a2b |
1045 | if(filter->expression[i+1] == '=') { /* <= */ |
a4c292d4 |
1046 | i++; |
bb87caa7 |
1047 | assign_operator(a_simple_expression,LTTV_FIELD_LE); |
1048 | } else assign_operator(a_simple_expression,LTTV_FIELD_LT); |
f4e9dd16 |
1049 | g_ptr_array_add( a_field_path,(gpointer) a_field_component ); |
389ba50e |
1050 | parse_field_path(a_field_path,a_simple_expression); |
f4e9dd16 |
1051 | a_field_component = g_string_new(""); |
a4c292d4 |
1052 | break; |
1053 | case '>': /* higher, higher or equal */ |
5f185a2b |
1054 | if(filter->expression[i+1] == '=') { /* >= */ |
a4c292d4 |
1055 | i++; |
bb87caa7 |
1056 | assign_operator(a_simple_expression,LTTV_FIELD_GE); |
1057 | } else assign_operator(a_simple_expression,LTTV_FIELD_GT); |
389ba50e |
1058 | g_ptr_array_add( a_field_path,(gpointer) a_field_component ); |
1059 | parse_field_path(a_field_path,a_simple_expression); |
f4e9dd16 |
1060 | a_field_component = g_string_new(""); |
a4c292d4 |
1061 | break; |
1062 | case '=': /* equal */ |
bb87caa7 |
1063 | assign_operator(a_simple_expression,LTTV_FIELD_EQ); |
f4e9dd16 |
1064 | g_ptr_array_add( a_field_path,(gpointer) a_field_component ); |
389ba50e |
1065 | parse_field_path(a_field_path,a_simple_expression); |
f4e9dd16 |
1066 | a_field_component = g_string_new(""); |
a4c292d4 |
1067 | break; |
0769c82f |
1068 | /* |
1069 | * Field concatening caracter |
1070 | */ |
1071 | case '.': /* dot */ |
bb87caa7 |
1072 | /* |
1073 | * divide field expression into elements |
1074 | * in a_field_path array. |
1075 | */ |
1076 | if(a_simple_expression->op != NULL) { |
1077 | g_ptr_array_add( a_field_path,(gpointer) a_field_component ); |
1078 | a_field_component = g_string_new(""); |
1079 | } |
0769c82f |
1080 | break; |
a4c292d4 |
1081 | default: /* concatening current string */ |
5f185a2b |
1082 | g_string_append_c(a_field_component,filter->expression[i]); |
a4c292d4 |
1083 | } |
1084 | } |
1601b365 |
1085 | |
1086 | g_print("subtree:%p, tree:%p, t1:%p, t2:%p\n",subtree,tree,t1,t2); |
0cdc2470 |
1087 | g_print("stack size: %i\n",tree_stack->len); |
1088 | |
1089 | /* |
1090 | * Preliminary check to see |
1091 | * if tree was constructed correctly |
1092 | */ |
1093 | if( p_nesting>0 ) { |
1094 | g_warning("Wrong filtering options, the string\n\"%s\"\n\ |
5f185a2b |
1095 | is not valid due to parenthesis incorrect use",filter->expression); |
1096 | return FALSE; |
0cdc2470 |
1097 | } |
1098 | |
1099 | if(tree_stack->len != 1) /* only root tree should remain */ |
5f185a2b |
1100 | return FALSE; |
1601b365 |
1101 | |
410c83da |
1102 | /* processing last element of expression */ |
410c83da |
1103 | t1 = g_ptr_array_index(tree_stack,tree_stack->len-1); |
2a734d8e |
1104 | while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t; |
410c83da |
1105 | if(subtree != NULL) { /* add the subtree */ |
1106 | t1->right = LTTV_TREE_NODE; |
0cdc2470 |
1107 | t1->r_child.t = subtree; |
410c83da |
1108 | subtree = NULL; |
1109 | } else { /* add a leaf */ |
0cdc2470 |
1110 | a_simple_expression->value = a_field_component->str; |
410c83da |
1111 | a_field_component = g_string_new(""); |
1112 | t1->right = LTTV_TREE_LEAF; |
0cdc2470 |
1113 | t1->r_child.leaf = a_simple_expression; |
2ea36caf |
1114 | /* |
1115 | * FIXME: is it really necessary to reallocate |
1116 | * LttvSimpleExpression at this point ?? |
1117 | */ |
389ba50e |
1118 | a_simple_expression = lttv_simple_expression_new(); |
410c83da |
1119 | } |
1120 | |
1121 | g_assert(tree != NULL); |
1122 | g_assert(subtree == NULL); |
a4c292d4 |
1123 | |
5f185a2b |
1124 | return TRUE; |
1125 | // return filter; |
410c83da |
1126 | |
31452f49 |
1127 | } |
1128 | |
8c89f5a8 |
1129 | /** |
1130 | * Destroy the current LttvFilter |
1131 | * @param filter pointer to the current LttvFilter |
1132 | */ |
1da1525d |
1133 | void |
2ea36caf |
1134 | lttv_filter_destroy(LttvFilter* filter) { |
5f185a2b |
1135 | |
1136 | g_free(filter->expression); |
1137 | lttv_filter_tree_destroy(filter->head); |
1138 | g_free(filter); |
1139 | |
1da1525d |
1140 | } |
1141 | |
150f0d33 |
1142 | /** |
1143 | * Assign a new tree for the current expression |
1144 | * or sub expression |
1145 | * @return pointer of LttvFilterTree |
1146 | */ |
5f185a2b |
1147 | LttvFilterTree* |
1148 | lttv_filter_tree_new() { |
150f0d33 |
1149 | LttvFilterTree* tree; |
1150 | |
1151 | tree = g_new(LttvFilter,1); |
1152 | tree->node = 0; //g_new(lttv_expression,1); |
150f0d33 |
1153 | tree->left = LTTV_TREE_IDLE; |
1154 | tree->right = LTTV_TREE_IDLE; |
1155 | |
1156 | return tree; |
1157 | } |
1158 | |
1159 | /** |
1160 | * Destroys the tree and his sub-trees |
1161 | * @param tree Tree which must be destroyed |
1162 | */ |
5f185a2b |
1163 | void |
1164 | lttv_filter_tree_destroy(LttvFilterTree* tree) { |
150f0d33 |
1165 | |
1166 | if(tree == NULL) return; |
1167 | |
1168 | if(tree->left == LTTV_TREE_LEAF) g_free(tree->l_child.leaf); |
1169 | else if(tree->left == LTTV_TREE_NODE) lttv_filter_tree_destroy(tree->l_child.t); |
1170 | |
1171 | if(tree->right == LTTV_TREE_LEAF) g_free(tree->r_child.leaf); |
1172 | else if(tree->right == LTTV_TREE_NODE) lttv_filter_tree_destroy(tree->r_child.t); |
1173 | |
1174 | g_free(tree->node); |
1175 | g_free(tree); |
1176 | } |
1177 | |
1178 | |
84a333d6 |
1179 | /** |
1180 | * Apply the filter to a specific trace |
1181 | * @param filter the current filter applied |
1182 | * @param tracefile the trace to apply the filter to |
1183 | * @return success/failure of operation |
1184 | */ |
31452f49 |
1185 | gboolean |
2ea36caf |
1186 | lttv_filter_tracefile(LttvFilter *filter, LttTracefile *tracefile) { |
0769c82f |
1187 | |
5b729fcf |
1188 | LttvFilterTree* t = filter->head; |
1189 | |
1601b365 |
1190 | /* |
1191 | * Each tree is parsed in inorder. |
1192 | * This way, it's possible to apply the left filter of the |
1193 | * tree, then decide whether or not the right branch should |
1194 | * be parsed depending on the linking logical operator |
1195 | * |
1196 | * As for the filtering structure, since we are trying |
1197 | * to remove elements from the trace, it might be better |
1198 | * managing an array of all items to be removed .. |
1199 | */ |
0769c82f |
1200 | |
5f185a2b |
1201 | ///////////////////////////////////////////////////////////////////////////// |
1202 | // TEST // |
1203 | ///////////////////////////////////////////////////////////////////////////// |
5b729fcf |
1204 | g_print("node:%p lchild:%p rchild:%p\n",t,t->l_child.t,t->r_child.t); |
1205 | g_print("node type%i\n",t->node); |
1206 | if(t->left == LTTV_TREE_NODE) lttv_filter_tracefile(t->l_child.t,NULL); |
1207 | else if(t->left == LTTV_TREE_LEAF) { |
1208 | g_assert(t->l_child.leaf->value != NULL); |
1209 | g_print("%p: left is qqch %i %s\n",t,t->l_child.leaf->op,t->l_child.leaf->value); |
0cdc2470 |
1210 | } |
5b729fcf |
1211 | if(t->right == LTTV_TREE_NODE) lttv_filter_tracefile(t->r_child.t,NULL); |
1212 | else if(t->right == LTTV_TREE_LEAF) { |
1213 | g_assert(t->r_child.leaf->value != NULL); |
1214 | g_print("%p: right is qqch %i %s\n",t,t->r_child.leaf->op,t->r_child.leaf->value); |
0cdc2470 |
1215 | } |
5f185a2b |
1216 | ///////////////////////////////////////////////////////////////////////////// |
1217 | |
1218 | |
1219 | |
0769c82f |
1220 | |
1221 | /* test */ |
1222 | /* int i, nb; |
1223 | char *f_name, *e_name; |
31452f49 |
1224 | |
0769c82f |
1225 | char* field = "cpu"; |
1226 | |
1227 | LttvTraceHook h; |
1228 | |
1229 | LttEventType *et; |
1230 | |
1231 | LttType *t; |
1232 | |
1233 | GString *fe_name = g_string_new(""); |
1234 | |
1235 | nb = ltt_trace_eventtype_number(tcs->parent.t); |
1236 | g_print("NB:%i\n",nb); |
1237 | for(i = 0 ; i < nb ; i++) { |
1238 | et = ltt_trace_eventtype_get(tcs->parent.t, i); |
1239 | e_name = ltt_eventtype_name(et); |
1240 | f_name = ltt_facility_name(ltt_eventtype_facility(et)); |
1241 | g_string_printf(fe_name, "%s.%s", f_name, e_name); |
1242 | g_print("facility:%s and event:%s\n",f_name,e_name); |
1243 | } |
1244 | */ |
31452f49 |
1245 | } |
1246 | |
1a7fa682 |
1247 | gboolean |
2ea36caf |
1248 | lttv_filter_tracestate(LttvFilter *filter, LttvTraceState *tracestate) { |
341aa948 |
1249 | |
1250 | } |
1a7fa682 |
1251 | |
84a333d6 |
1252 | /** |
1253 | * Apply the filter to a specific event |
1254 | * @param filter the current filter applied |
1255 | * @param event the event to apply the filter to |
1256 | * @return success/failure of operation |
1257 | */ |
31452f49 |
1258 | gboolean |
2ea36caf |
1259 | lttv_filter_event(LttvFilter *filter, LttEvent *event) { |
31452f49 |
1260 | |
1261 | } |
1a7fa682 |
1262 | |
91ad3f0a |
1263 | /** |
1264 | * Initializes the filter module and specific values |
1265 | */ |
1a7fa682 |
1266 | static void module_init() |
1267 | { |
91ad3f0a |
1268 | |
1269 | /* |
1270 | * Quarks initialization |
1271 | * for hardcoded filtering options |
1272 | * |
1273 | * TODO: traceset has no yet been defined |
1274 | */ |
1275 | |
1276 | /* top fields */ |
5b729fcf |
1277 | // LTTV_FILTER_EVENT = g_quark_from_string("event"); |
1278 | // LTTV_FILTER_TRACE = g_quark_from_string("trace"); |
1279 | // LTTV_FILTER_TRACESET = g_quark_from_string("traceset"); |
1280 | // LTTV_FILTER_STATE = g_quark_from_string("state"); |
1281 | // LTTV_FILTER_TRACEFILE = g_quark_from_string("tracefile"); |
1a7fa682 |
1282 | |
91ad3f0a |
1283 | /* event.name, tracefile.name, trace.name */ |
5b729fcf |
1284 | // LTTV_FILTER_NAME = g_quark_from_string("name"); |
91ad3f0a |
1285 | |
1286 | /* event sub fields */ |
5b729fcf |
1287 | // LTTV_FILTER_CATEGORY = g_quark_from_string("category"); |
1288 | // LTTV_FILTER_TIME = g_quark_from_string("time"); |
1289 | // LTTV_FILTER_TSC = g_quark_from_string("tsc"); |
91ad3f0a |
1290 | |
1291 | /* state sub fields */ |
5b729fcf |
1292 | // LTTV_FILTER_PID = g_quark_from_string("pid"); |
1293 | // LTTV_FILTER_PPID = g_quark_from_string("ppid"); |
1294 | // LTTV_FILTER_C_TIME = g_quark_from_string("creation_time"); |
1295 | // LTTV_FILTER_I_TIME = g_quark_from_string("insertion_time"); |
1296 | // LTTV_FILTER_P_NAME = g_quark_from_string("process_name"); |
1297 | // LTTV_FILTER_EX_MODE = g_quark_from_string("execution_mode"); |
1298 | // LTTV_FILTER_EX_SUBMODE = g_quark_from_string("execution_submode"); |
1299 | // LTTV_FILTER_P_STATUS = g_quark_from_string("process_status"); |
1300 | // LTTV_FILTER_CPU = g_quark_from_string("cpu"); |
91ad3f0a |
1301 | |
1a7fa682 |
1302 | } |
1303 | |
91ad3f0a |
1304 | /** |
1305 | * Destroys the filter module and specific values |
1306 | */ |
1a7fa682 |
1307 | static void module_destroy() |
1308 | { |
1309 | } |
1310 | |
1311 | |
91ad3f0a |
1312 | LTTV_MODULE("filter", "Filters traceset and events", \ |
1313 | "Filters traceset and events specifically to user input", \ |
1a7fa682 |
1314 | module_init, module_destroy) |
1315 | |
1316 | |
1317 | |