1 /* This file is part of the Linux Trace Toolkit viewer
2 * Copyright (C) 2003-2005 Michel Dagenais
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;
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.
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,
24 simple expr [ op expr ]
26 read_simple_expression
27 read_field_path [ rel value ]
30 read_field_component [. field path]
39 path(component...) -> field
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.
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
57 * * clear the field_path array after use
60 #include <lttv/filter.h>
66 LTTV_FILTER_TRACEFILE,
79 LTTV_FILTER_EX_SUBMODE,
85 * Constructor for LttvSimpleExpression
86 * @return pointer to new LttvSimpleExpression
89 lttv_simple_expression_new() {
91 LttvSimpleExpression
* se
= g_new(LttvSimpleExpression
,1);
93 se
->field
= LTTV_FILTER_UNDEFINED
;
101 * add a node to the current tree
102 * FIXME: Might be used to lower coding in lttv_filter_new switch expression
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
108 lttv_filter_tree_add_node(GPtrArray
* stack
, LttvFilterTree
* subtree
, LttvLogicalOp op
) {
110 LttvFilterTree
* t1
= NULL
;
111 LttvFilterTree
* t2
= NULL
;
113 t1
= (LttvFilterTree
*)g_ptr_array_index(stack
,stack
->len
-1);
114 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
115 t2
= lttv_filter_tree_new();
117 if(subtree
!= NULL
) {
118 t2
->left
= LTTV_TREE_NODE
;
119 t2
->l_child
.t
= subtree
;
121 t1
->right
= LTTV_TREE_NODE
;
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
;
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
140 * @param se current simple expression
141 * @return success/failure of operation
144 parse_field_path(GPtrArray
* fp
, LttvSimpleExpression
* se
) {
147 if(fp
->len
< 2) return FALSE
;
148 g_assert(f
=g_ptr_array_index(fp
,0)); //list_first(fp)->data;
151 * Parse through the specified
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
163 if(g_strcasecmp(f
->str
,"trace") ) {
168 f
=g_ptr_array_index(fp
,1);
169 if(g_strcasecmp(f
->str
,"name")) {
170 se
->field
= LTTV_FILTER_TRACE_NAME
;
173 } else if(g_strcasecmp(f
->str
,"traceset") ) {
175 * FIXME: not yet implemented !
177 } else if(g_strcasecmp(f
->str
,"tracefile") ) {
182 f
=g_ptr_array_index(fp
,1);
183 if(g_strcasecmp(f
->str
,"name")) {
184 se
->field
= LTTV_FILTER_TRACEFILE_NAME
;
187 } else if(g_strcasecmp(f
->str
,"state") ) {
192 * state.creation_time
193 * state.insertion_time
195 * state.execution_mode
196 * state.execution_submode
197 * state.process_status
200 f
=g_ptr_array_index(fp
,1);
201 if(g_strcasecmp(f
->str
,"pid") ) {
202 se
->field
= LTTV_FILTER_STATE_PID
;
204 else if(g_strcasecmp(f
->str
,"ppid") ) {
205 se
->field
= LTTV_FILTER_STATE_PPID
;
207 else if(g_strcasecmp(f
->str
,"creation_time") ) {
208 se
->field
= LTTV_FILTER_STATE_CT
;
210 else if(g_strcasecmp(f
->str
,"insertion_time") ) {
211 se
->field
= LTTV_FILTER_STATE_IT
;
213 else if(g_strcasecmp(f
->str
,"process_name") ) {
214 se
->field
= LTTV_FILTER_STATE_P_NAME
;
216 else if(g_strcasecmp(f
->str
,"execution_mode") ) {
217 se
->field
= LTTV_FILTER_STATE_EX_MODE
;
219 else if(g_strcasecmp(f
->str
,"execution_submode") ) {
220 se
->field
= LTTV_FILTER_STATE_EX_SUBMODE
;
222 else if(g_strcasecmp(f
->str
,"process_status") ) {
223 se
->field
= LTTV_FILTER_STATE_P_STATUS
;
225 else if(g_strcasecmp(f
->str
,"cpu") ) {
226 se
->field
= LTTV_FILTER_STATE_CPU
;
229 } else if(g_strcasecmp(f
->str
,"event") ) {
237 f
=g_ptr_array_index(fp
,1);
238 if(g_strcasecmp(f
->str
,"name") ) {
239 se
->field
= LTTV_FILTER_EVENT_NAME
;
241 else if(g_strcasecmp(f
->str
,"category") ) {
243 * FIXME: Category not yet functional in lttv
245 se
->field
= LTTV_FILTER_EVENT_CATEGORY
;
247 else if(g_strcasecmp(f
->str
,"time") ) {
248 se
->field
= LTTV_FILTER_EVENT_TIME
;
249 // offset = &((LttEvent*)NULL)->event_time);
251 else if(g_strcasecmp(f
->str
,"tsc") ) {
252 se
->field
= LTTV_FILTER_EVENT_TSC
;
253 // offset = &((LttEvent*)NULL)->event_cycle_count);
255 else { /* core.xml specified options */
256 se
->field
= LTTV_FILTER_EVENT_FIELD
;
257 //se->offset = (...);
260 g_warning("Unrecognized field in filter string");
264 /* free the pointer array */
265 g_ptr_array_free(fp
,FALSE
);
271 * Sets the function pointer for the current
273 * @param se current simple expression
274 * @return success/failure of operation
276 gboolean
assign_operator(LttvSimpleExpression
* se
, LttvExpressionOp op
) {
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
:
286 se
->op
= lttv_apply_op_eq_string
;
289 se
->op
= lttv_apply_op_eq_string
;
292 g_warning("Error encountered in operator assignment");
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
:
303 se
->op
= lttv_apply_op_eq_uint64
;
306 se
->op
= lttv_apply_op_ne_uint64
;
309 se
->op
= lttv_apply_op_lt_uint64
;
312 se
->op
= lttv_apply_op_le_uint64
;
315 se
->op
= lttv_apply_op_gt_uint64
;
318 se
->op
= lttv_apply_op_ge_uint64
;
321 g_warning("Error encountered in operator assignment");
325 case LTTV_FILTER_STATE_CT
:
326 case LTTV_FILTER_STATE_IT
:
327 case LTTV_FILTER_EVENT_TIME
:
328 case LTTV_FILTER_EVENT_TSC
:
331 se
->op
= lttv_apply_op_eq_double
;
334 se
->op
= lttv_apply_op_ne_double
;
337 se
->op
= lttv_apply_op_lt_double
;
340 se
->op
= lttv_apply_op_le_double
;
343 se
->op
= lttv_apply_op_gt_double
;
346 se
->op
= lttv_apply_op_ge_double
;
349 g_warning("Error encountered in operator assignment");
354 g_warning("Error encountered in operator assignment");
361 * Add an filtering option to the current tree
362 * @param expression Current expression to parse
363 * @return success/failure of operation
366 parse_simple_expression(GString
* expression
) {
376 * Applies the 'equal' operator to the
377 * specified structure and value
378 * @param v1 left member of comparison
379 * @param v2 right member of comparison
380 * @return success/failure of operation
382 gboolean
lttv_apply_op_eq_uint64(gpointer v1
, char* v2
) {}
385 * Applies the 'equal' operator to the
386 * specified structure and value
387 * @param v1 left member of comparison
388 * @param v2 right member of comparison
389 * @return success/failure of operation
391 gboolean
lttv_apply_op_eq_uint32(gpointer v1
, char* v2
) {}
394 * Applies the 'equal' operator to the
395 * specified structure and value
396 * @param v1 left member of comparison
397 * @param v2 right member of comparison
398 * @return success/failure of operation
400 gboolean
lttv_apply_op_eq_uint16(gpointer v1
, char* v2
) {}
403 * Applies the 'equal' operator to the
404 * specified structure and value
405 * @param v1 left member of comparison
406 * @param v2 right member of comparison
407 * @return success/failure of operation
409 gboolean
lttv_apply_op_eq_double(gpointer v1
, char* v2
) {}
412 * Applies the 'equal' operator to the
413 * specified structure and value
414 * @param v1 left member of comparison
415 * @param v2 right member of comparison
416 * @return success/failure of operation
418 gboolean
lttv_apply_op_eq_string(gpointer v1
, char* v2
) {}
421 * Applies the 'not equal' operator to the
422 * specified structure and value
423 * @param v1 left member of comparison
424 * @param v2 right member of comparison
425 * @return success/failure of operation
427 gboolean
lttv_apply_op_ne_uint64(gpointer v1
, char* v2
) {}
430 * Applies the 'not equal' operator to the
431 * specified structure and value
432 * @param v1 left member of comparison
433 * @param v2 right member of comparison
434 * @return success/failure of operation
436 gboolean
lttv_apply_op_ne_uint32(gpointer v1
, char* v2
) {}
439 * Applies the 'not equal' operator to the
440 * specified structure and value
441 * @param v1 left member of comparison
442 * @param v2 right member of comparison
443 * @return success/failure of operation
445 gboolean
lttv_apply_op_ne_uint16(gpointer v1
, char* v2
) {}
448 * Applies the 'not equal' operator to the
449 * specified structure and value
450 * @param v1 left member of comparison
451 * @param v2 right member of comparison
452 * @return success/failure of operation
454 gboolean
lttv_apply_op_ne_double(gpointer v1
, char* v2
) {}
457 * Applies the 'not equal' operator to the
458 * specified structure and value
459 * @param v1 left member of comparison
460 * @param v2 right member of comparison
461 * @return success/failure of operation
463 gboolean
lttv_apply_op_ne_string(gpointer v1
, char* v2
) {}
466 * Applies the 'lower than' operator to the
467 * specified structure and value
468 * @param v1 left member of comparison
469 * @param v2 right member of comparison
470 * @return success/failure of operation
472 gboolean
lttv_apply_op_lt_uint64(gpointer v1
, char* v2
) {}
475 * Applies the 'lower than' operator to the
476 * specified structure and value
477 * @param v1 left member of comparison
478 * @param v2 right member of comparison
479 * @return success/failure of operation
481 gboolean
lttv_apply_op_lt_uint32(gpointer v1
, char* v2
) {}
484 * Applies the 'lower than' operator to the
485 * specified structure and value
486 * @param v1 left member of comparison
487 * @param v2 right member of comparison
488 * @return success/failure of operation
490 gboolean
lttv_apply_op_lt_uint16(gpointer v1
, char* v2
) {}
493 * Applies the 'lower than' operator to the
494 * specified structure and value
495 * @param v1 left member of comparison
496 * @param v2 right member of comparison
497 * @return success/failure of operation
499 gboolean
lttv_apply_op_lt_double(gpointer v1
, char* v2
) {}
502 * Applies the 'lower than' operator to the
503 * specified structure and value
504 * @param v1 left member of comparison
505 * @param v2 right member of comparison
506 * @return success/failure of operation
508 gboolean
lttv_apply_op_le_uint64(gpointer v1
, char* v2
) {}
511 * Applies the 'lower or equal' operator to the
512 * specified structure and value
513 * @param v1 left member of comparison
514 * @param v2 right member of comparison
515 * @return success/failure of operation
517 gboolean
lttv_apply_op_le_uint32(gpointer v1
, char* v2
) {}
520 * Applies the 'lower or equal' operator to the
521 * specified structure and value
522 * @param v1 left member of comparison
523 * @param v2 right member of comparison
524 * @return success/failure of operation
526 gboolean
lttv_apply_op_le_uint16(gpointer v1
, char* v2
) {}
529 * Applies the 'lower or equal' operator to the
530 * specified structure and value
531 * @param v1 left member of comparison
532 * @param v2 right member of comparison
533 * @return success/failure of operation
535 gboolean
lttv_apply_op_le_double(gpointer v1
, char* v2
) {}
538 * Applies the 'lower or equal' operator to the
539 * specified structure and value
540 * @param v1 left member of comparison
541 * @param v2 right member of comparison
542 * @return success/failure of operation
544 gboolean
lttv_apply_op_gt_uint64(gpointer v1
, char* v2
) {}
547 * Applies the 'greater than' operator to the
548 * specified structure and value
549 * @param v1 left member of comparison
550 * @param v2 right member of comparison
551 * @return success/failure of operation
553 gboolean
lttv_apply_op_gt_uint32(gpointer v1
, char* v2
) {}
556 * Applies the 'greater than' operator to the
557 * specified structure and value
558 * @param v1 left member of comparison
559 * @param v2 right member of comparison
560 * @return success/failure of operation
562 gboolean
lttv_apply_op_gt_uint16(gpointer v1
, char* v2
) {}
565 * Applies the 'greater than' operator to the
566 * specified structure and value
567 * @param v1 left member of comparison
568 * @param v2 right member of comparison
569 * @return success/failure of operation
571 gboolean
lttv_apply_op_gt_double(gpointer v1
, char* v2
) {}
574 * Applies the 'greater than' operator to the
575 * specified structure and value
576 * @param v1 left member of comparison
577 * @param v2 right member of comparison
578 * @return success/failure of operation
580 gboolean
lttv_apply_op_ge_uint64(gpointer v1
, char* v2
) {}
583 * Applies the 'greater or equal' operator to the
584 * specified structure and value
585 * @param v1 left member of comparison
586 * @param v2 right member of comparison
587 * @return success/failure of operation
589 gboolean
lttv_apply_op_ge_uint32(gpointer v1
, char* v2
) {}
592 * Applies the 'greater or equal' operator to the
593 * specified structure and value
594 * @param v1 left member of comparison
595 * @param v2 right member of comparison
596 * @return success/failure of operation
598 gboolean
lttv_apply_op_ge_uint16(gpointer v1
, char* v2
) {}
601 * Applies the 'greater or equal' operator to the
602 * specified structure and value
603 * @param v1 left member of comparison
604 * @param v2 right member of comparison
605 * @return success/failure of operation
607 gboolean
lttv_apply_op_ge_double(gpointer v1
, char* v2
) {}
611 * Makes a copy of the current filter tree
612 * @param tree pointer to the current tree
613 * @return new copy of the filter tree
616 lttv_filter_tree_clone(LttvFilterTree
* tree
) {
623 * Makes a copy of the current filter
624 * @param filter pointer to the current filter
625 * @return new copy of the filter
628 lttv_filter_clone(LttvFilter
* filter
) {
631 LttvFilter
* newfilter
= g_new(LttvFilter
,1);
633 // newfilter->expression = g_new(char,1)
634 strcpy(newfilter
->expression
,filter
->expression
);
636 newfilter
->head
= lttv_filter_tree_clone(filter
->head
);
644 * Creates a new lttv_filter
645 * @param expression filtering options string
646 * @param t pointer to the current LttvTrace
647 * @return the current lttv_filter or NULL if error
650 lttv_filter_new(char *expression
, LttvTraceState
*tcs
) {
652 g_print("filter::lttv_filter_new()\n"); /* debug */
656 p_nesting
=0, /* parenthesis nesting value */
657 b
=0; /* current breakpoint in expression string */
661 *tree
= lttv_filter_tree_new(), /* main tree */
662 *subtree
= NULL
, /* buffer for subtrees */
668 * each element of the list
669 * is a sub tree created
670 * by the use of parenthesis in the
671 * global expression. The final tree
672 * will be the one left at the root of
675 GPtrArray
*tree_stack
= g_ptr_array_new();
676 g_ptr_array_add( tree_stack
,(gpointer
) tree
);
678 /* temporary values */
679 GString
*a_field_component
= g_string_new("");
680 GPtrArray
*a_field_path
= NULL
;
682 LttvSimpleExpression
* a_simple_expression
= lttv_simple_expression_new();
685 * Parse entire expression and construct
686 * the binary tree. There are two steps
687 * in browsing that string
688 * 1. finding boolean ops " &,|,^,! " and parenthesis " {,(,[,],),} "
689 * 2. finding simple expressions
690 * - field path ( separated by dots )
691 * - op ( >, <, =, >=, <=, !=)
692 * - value ( integer, string ... )
693 * To spare computing time, the whole
694 * string is parsed in this loop for a
695 * O(n) complexity order.
697 * When encountering logical op &,|,^
698 * 1. parse the last value if any
699 * 2. create a new tree
700 * 3. add the expression (simple exp, or exp (subtree)) to the tree
701 * 4. concatenate this tree with the current tree on top of the stack
702 * When encountering math ops >,>=,<,<=,=,!=
703 * 1. add to op to the simple expression
704 * 2. concatenate last field component to field path
705 * When encountering concatening ops .
706 * 1. concatenate last field component to field path
707 * When encountering opening parenthesis (,{,[
708 * 1. create a new subtree on top of tree stack
709 * When encountering closing parenthesis ),},]
710 * 1. add the expression on right child of the current tree
711 * 2. the subtree is completed, allocate a new subtree
712 * 3. pop the tree value from the tree stack
715 a_field_path
= g_ptr_array_new();
716 g_ptr_array_set_size(a_field_path
,2); /* by default, recording 2 field expressions */
719 for(i
=0;i
<strlen(expression
);i
++) {
720 // g_print("%s\n",a_field_component->str);
721 g_print("%c ",expression
[i
]);
722 // g_print("switch:%c -->subtree:%p\n",expression[i],subtree);
723 switch(expression
[i
]) {
728 t1
= (LttvFilterTree
*)g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
729 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
730 t2
= lttv_filter_tree_new();
731 t2
->node
= LTTV_LOGICAL_AND
;
732 if(subtree
!= NULL
) { /* append subtree to current tree */
733 t2
->left
= LTTV_TREE_NODE
;
734 t2
->l_child
.t
= subtree
;
736 t1
->right
= LTTV_TREE_NODE
;
738 } else { /* append a simple expression */
739 a_simple_expression
->value
= a_field_component
->str
;
740 a_field_component
= g_string_new("");
741 t2
->left
= LTTV_TREE_LEAF
;
742 t2
->l_child
.leaf
= a_simple_expression
;
743 a_simple_expression
= lttv_simple_expression_new();
744 t1
->right
= LTTV_TREE_NODE
;
750 t1
= (LttvFilter
*)g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
751 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
752 t2
= lttv_filter_tree_new();
753 t2
->node
= LTTV_LOGICAL_OR
;
754 if(subtree
!= NULL
) { /* append subtree to current tree */
755 t2
->left
= LTTV_TREE_NODE
;
756 t2
->l_child
.t
= subtree
;
758 t1
->right
= LTTV_TREE_NODE
;
760 } else { /* append a simple expression */
761 a_simple_expression
->value
= a_field_component
->str
;
762 a_field_component
= g_string_new("");
763 t2
->left
= LTTV_TREE_LEAF
;
764 t2
->l_child
.leaf
= a_simple_expression
;
765 a_simple_expression
= lttv_simple_expression_new();
766 t1
->right
= LTTV_TREE_NODE
;
771 t1
= (LttvFilter
*)g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
772 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
773 t2
= lttv_filter_tree_new();
774 t2
->node
= LTTV_LOGICAL_XOR
;
775 if(subtree
!= NULL
) { /* append subtree to current tree */
776 t2
->left
= LTTV_TREE_NODE
;
777 t2
->l_child
.t
= subtree
;
779 t1
->right
= LTTV_TREE_NODE
;
781 } else { /* append a simple expression */
782 a_simple_expression
->value
= a_field_component
->str
;
783 a_field_component
= g_string_new("");
784 t2
->left
= LTTV_TREE_LEAF
;
785 t2
->l_child
.leaf
= a_simple_expression
;
786 a_simple_expression
= lttv_simple_expression_new();
787 t1
->right
= LTTV_TREE_NODE
;
791 case '!': /* not, or not equal (math op) */
792 if(expression
[i
+1] == '=') { /* != */
793 assign_operator(a_simple_expression
,LTTV_FIELD_NE
);
795 g_ptr_array_add( a_field_path
,(gpointer
) a_field_component
);
796 parse_field_path(a_field_path
,a_simple_expression
);
797 a_field_component
= g_string_new("");
799 // g_print("%s\n",a_field_component);
800 // a_field_component = g_string_new("");
801 t1
= (LttvFilter
*)g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
802 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
803 t2
= lttv_filter_tree_new();
804 t2
->node
= LTTV_LOGICAL_NOT
;
805 t1
->right
= LTTV_TREE_NODE
;
809 case '(': /* start of parenthesis */
812 p_nesting
++; /* incrementing parenthesis nesting value */
813 t1
= lttv_filter_tree_new();
814 g_ptr_array_add( tree_stack
,(gpointer
) t1
);
816 case ')': /* end of parenthesis */
819 p_nesting
--; /* decrementing parenthesis nesting value */
820 if(p_nesting
<0 || tree_stack
->len
<2) {
821 g_warning("Wrong filtering options, the string\n\"%s\"\n\
822 is not valid due to parenthesis incorrect use",expression
);
826 g_assert(tree_stack
->len
>0);
827 if(subtree
!= NULL
) { /* append subtree to current tree */
828 t1
= g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
829 while(t1
->right
!= LTTV_TREE_IDLE
&& t1
->right
!= LTTV_TREE_LEAF
) {
830 g_assert(t1
!=NULL
&& t1
->r_child
.t
!= NULL
);
833 t1
->right
= LTTV_TREE_NODE
;
834 t1
->r_child
.t
= subtree
;
835 subtree
= g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
836 g_ptr_array_remove_index(tree_stack
,tree_stack
->len
-1);
837 } else { /* assign subtree as current tree */
838 a_simple_expression
->value
= a_field_component
->str
;
839 a_field_component
= g_string_new("");
840 t1
= g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
841 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
842 t1
->right
= LTTV_TREE_LEAF
;
843 t1
->r_child
.leaf
= a_simple_expression
;
844 a_simple_expression
= lttv_simple_expression_new();
845 subtree
= g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
846 g_assert(subtree
!= NULL
);
847 g_ptr_array_remove_index(tree_stack
,tree_stack
->len
-1);
852 * mathematic operators
854 case '<': /* lower, lower or equal */
855 if(expression
[i
+1] == '=') { /* <= */
857 assign_operator(a_simple_expression
,LTTV_FIELD_LE
);
858 } else assign_operator(a_simple_expression
,LTTV_FIELD_LT
);
859 g_ptr_array_add( a_field_path
,(gpointer
) a_field_component
);
860 parse_field_path(a_field_path
,a_simple_expression
);
861 a_field_component
= g_string_new("");
863 case '>': /* higher, higher or equal */
864 if(expression
[i
+1] == '=') { /* >= */
866 assign_operator(a_simple_expression
,LTTV_FIELD_GE
);
867 } else assign_operator(a_simple_expression
,LTTV_FIELD_GT
);
868 g_ptr_array_add( a_field_path
,(gpointer
) a_field_component
);
869 parse_field_path(a_field_path
,a_simple_expression
);
870 a_field_component
= g_string_new("");
872 case '=': /* equal */
873 assign_operator(a_simple_expression
,LTTV_FIELD_EQ
);
874 g_ptr_array_add( a_field_path
,(gpointer
) a_field_component
);
875 parse_field_path(a_field_path
,a_simple_expression
);
876 a_field_component
= g_string_new("");
879 * Field concatening caracter
883 * divide field expression into elements
884 * in a_field_path array.
886 if(a_simple_expression
->op
!= NULL
) {
887 g_ptr_array_add( a_field_path
,(gpointer
) a_field_component
);
888 a_field_component
= g_string_new("");
891 default: /* concatening current string */
892 g_string_append_c(a_field_component
,expression
[i
]);
896 g_print("subtree:%p, tree:%p, t1:%p, t2:%p\n",subtree
,tree
,t1
,t2
);
897 g_print("stack size: %i\n",tree_stack
->len
);
900 * Preliminary check to see
901 * if tree was constructed correctly
904 g_warning("Wrong filtering options, the string\n\"%s\"\n\
905 is not valid due to parenthesis incorrect use",expression
);
909 if(tree_stack
->len
!= 1) /* only root tree should remain */
912 /* processing last element of expression */
913 t1
= g_ptr_array_index(tree_stack
,tree_stack
->len
-1);
914 while(t1
->right
!= LTTV_TREE_IDLE
) t1
= t1
->r_child
.t
;
915 if(subtree
!= NULL
) { /* add the subtree */
916 t1
->right
= LTTV_TREE_NODE
;
917 t1
->r_child
.t
= subtree
;
919 } else { /* add a leaf */
920 a_simple_expression
->value
= a_field_component
->str
;
921 a_field_component
= g_string_new("");
922 t1
->right
= LTTV_TREE_LEAF
;
923 t1
->r_child
.leaf
= a_simple_expression
;
925 * FIXME: is it really necessary to reallocate
926 * LttvSimpleExpression at this point ??
928 a_simple_expression
= lttv_simple_expression_new();
931 g_assert(tree
!= NULL
);
932 g_assert(subtree
== NULL
);
934 lttv_filter_tracefile(tree
,NULL
);
941 lttv_filter_destroy(LttvFilter
* filter
) {
946 * Assign a new tree for the current expression
948 * @return pointer of LttvFilterTree
950 LttvFilterTree
* lttv_filter_tree_new() {
951 LttvFilterTree
* tree
;
953 tree
= g_new(LttvFilter
,1);
954 tree
->node
= 0; //g_new(lttv_expression,1);
955 // tree->node->type = LTTV_UNDEFINED_EXPRESSION;
956 tree
->left
= LTTV_TREE_IDLE
;
957 tree
->right
= LTTV_TREE_IDLE
;
963 * Destroys the tree and his sub-trees
964 * @param tree Tree which must be destroyed
966 void lttv_filter_tree_destroy(LttvFilterTree
* tree
) {
968 if(tree
== NULL
) return;
970 if(tree
->left
== LTTV_TREE_LEAF
) g_free(tree
->l_child
.leaf
);
971 else if(tree
->left
== LTTV_TREE_NODE
) lttv_filter_tree_destroy(tree
->l_child
.t
);
973 if(tree
->right
== LTTV_TREE_LEAF
) g_free(tree
->r_child
.leaf
);
974 else if(tree
->right
== LTTV_TREE_NODE
) lttv_filter_tree_destroy(tree
->r_child
.t
);
982 * Apply the filter to a specific trace
983 * @param filter the current filter applied
984 * @param tracefile the trace to apply the filter to
985 * @return success/failure of operation
988 lttv_filter_tracefile(LttvFilter
*filter
, LttTracefile
*tracefile
) {
990 LttvFilterTree
* t
= filter
->head
;
993 * Each tree is parsed in inorder.
994 * This way, it's possible to apply the left filter of the
995 * tree, then decide whether or not the right branch should
996 * be parsed depending on the linking logical operator
998 * As for the filtering structure, since we are trying
999 * to remove elements from the trace, it might be better
1000 * managing an array of all items to be removed ..
1003 g_print("node:%p lchild:%p rchild:%p\n",t
,t
->l_child
.t
,t
->r_child
.t
);
1004 g_print("node type%i\n",t
->node
);
1005 if(t
->left
== LTTV_TREE_NODE
) lttv_filter_tracefile(t
->l_child
.t
,NULL
);
1006 else if(t
->left
== LTTV_TREE_LEAF
) {
1007 g_assert(t
->l_child
.leaf
->value
!= NULL
);
1008 g_print("%p: left is qqch %i %s\n",t
,t
->l_child
.leaf
->op
,t
->l_child
.leaf
->value
);
1010 if(t
->right
== LTTV_TREE_NODE
) lttv_filter_tracefile(t
->r_child
.t
,NULL
);
1011 else if(t
->right
== LTTV_TREE_LEAF
) {
1012 g_assert(t
->r_child
.leaf
->value
!= NULL
);
1013 g_print("%p: right is qqch %i %s\n",t
,t
->r_child
.leaf
->op
,t
->r_child
.leaf
->value
);
1018 char *f_name, *e_name;
1020 char* field = "cpu";
1028 GString *fe_name = g_string_new("");
1030 nb = ltt_trace_eventtype_number(tcs->parent.t);
1031 g_print("NB:%i\n",nb);
1032 for(i = 0 ; i < nb ; i++) {
1033 et = ltt_trace_eventtype_get(tcs->parent.t, i);
1034 e_name = ltt_eventtype_name(et);
1035 f_name = ltt_facility_name(ltt_eventtype_facility(et));
1036 g_string_printf(fe_name, "%s.%s", f_name, e_name);
1037 g_print("facility:%s and event:%s\n",f_name,e_name);
1043 lttv_filter_tracestate(LttvFilter
*filter
, LttvTraceState
*tracestate
) {
1048 * Apply the filter to a specific event
1049 * @param filter the current filter applied
1050 * @param event the event to apply the filter to
1051 * @return success/failure of operation
1054 lttv_filter_event(LttvFilter
*filter
, LttEvent
*event
) {
1059 * Initializes the filter module and specific values
1061 static void module_init()
1065 * Quarks initialization
1066 * for hardcoded filtering options
1068 * TODO: traceset has no yet been defined
1072 // LTTV_FILTER_EVENT = g_quark_from_string("event");
1073 // LTTV_FILTER_TRACE = g_quark_from_string("trace");
1074 // LTTV_FILTER_TRACESET = g_quark_from_string("traceset");
1075 // LTTV_FILTER_STATE = g_quark_from_string("state");
1076 // LTTV_FILTER_TRACEFILE = g_quark_from_string("tracefile");
1078 /* event.name, tracefile.name, trace.name */
1079 // LTTV_FILTER_NAME = g_quark_from_string("name");
1081 /* event sub fields */
1082 // LTTV_FILTER_CATEGORY = g_quark_from_string("category");
1083 // LTTV_FILTER_TIME = g_quark_from_string("time");
1084 // LTTV_FILTER_TSC = g_quark_from_string("tsc");
1086 /* state sub fields */
1087 // LTTV_FILTER_PID = g_quark_from_string("pid");
1088 // LTTV_FILTER_PPID = g_quark_from_string("ppid");
1089 // LTTV_FILTER_C_TIME = g_quark_from_string("creation_time");
1090 // LTTV_FILTER_I_TIME = g_quark_from_string("insertion_time");
1091 // LTTV_FILTER_P_NAME = g_quark_from_string("process_name");
1092 // LTTV_FILTER_EX_MODE = g_quark_from_string("execution_mode");
1093 // LTTV_FILTER_EX_SUBMODE = g_quark_from_string("execution_submode");
1094 // LTTV_FILTER_P_STATUS = g_quark_from_string("process_status");
1095 // LTTV_FILTER_CPU = g_quark_from_string("cpu");
1100 * Destroys the filter module and specific values
1102 static void module_destroy()
1107 LTTV_MODULE("filter", "Filters traceset and events", \
1108 "Filters traceset and events specifically to user input", \
1109 module_init
, module_destroy
)