+LttvFilter*
+lttv_filter_new() {
+
+ LttvFilter* filter = g_new(LttvFilter,1);
+ filter->expression = NULL;
+ filter->head = NULL;
+
+}
+
+/**
+ * Updates the current LttvFilter by building
+ * its tree based upon the expression string
+ * @param filter pointer to the current LttvFilter
+ * @return Failure/Success of operation
+ */
+gboolean
+lttv_filter_update(LttvFilter* filter) {
+
+ g_print("filter::lttv_filter_new()\n"); /* debug */
+
+ if(filter->expression == NULL) return FALSE;
+
+ unsigned
+ i,
+ p_nesting=0, /* parenthesis nesting value */
+ b=0; /* current breakpoint in expression string */
+
+ /* trees */
+ LttvFilterTree
+ *tree = lttv_filter_tree_new(), /* main tree */
+ *subtree = NULL, /* buffer for subtrees */
+ *t1, /* buffer #1 */
+ *t2; /* buffer #2 */
+
+ /*
+ * the filter
+ * If the tree already exists,
+ * destroy it and build a new one
+ */
+ if(filter->head != NULL) lttv_filter_tree_destroy(filter->head);
+ filter->head = tree;
+
+ /*
+ * Tree Stack
+ * each element of the list
+ * is a sub tree created
+ * by the use of parenthesis in the
+ * global expression. The final tree
+ * will be the one left at the root of
+ * the list
+ */
+ GPtrArray *tree_stack = g_ptr_array_new();
+ g_ptr_array_add( tree_stack,(gpointer) tree );
+
+ /* temporary values */
+ GString *a_field_component = g_string_new("");
+ GPtrArray *a_field_path = NULL;
+
+ LttvSimpleExpression* a_simple_expression = lttv_simple_expression_new();
+
+ /*
+ * Parse entire expression and construct
+ * the binary tree. There are two steps
+ * in browsing that string
+ * 1. finding boolean ops " &,|,^,! " and parenthesis " {,(,[,],),} "
+ * 2. finding simple expressions
+ * - field path ( separated by dots )
+ * - op ( >, <, =, >=, <=, !=)
+ * - value ( integer, string ... )
+ * To spare computing time, the whole
+ * string is parsed in this loop for a
+ * O(n) complexity order.
+ *
+ * When encountering logical op &,|,^
+ * 1. parse the last value if any
+ * 2. create a new tree
+ * 3. add the expression (simple exp, or exp (subtree)) to the tree
+ * 4. concatenate this tree with the current tree on top of the stack
+ * When encountering math ops >,>=,<,<=,=,!=
+ * 1. add to op to the simple expression
+ * 2. concatenate last field component to field path
+ * When encountering concatening ops .
+ * 1. concatenate last field component to field path
+ * When encountering opening parenthesis (,{,[
+ * 1. create a new subtree on top of tree stack
+ * When encountering closing parenthesis ),},]
+ * 1. add the expression on right child of the current tree
+ * 2. the subtree is completed, allocate a new subtree
+ * 3. pop the tree value from the tree stack
+ */
+
+ a_field_path = g_ptr_array_new();
+// g_ptr_array_set_size(a_field_path,2); /* by default, recording 2 field expressions */
+
+
+ for(i=0;i<strlen(filter->expression);i++) {
+ // debug
+ int t;
+// for(t=0;t<a_field_path->len;t++) {
+// GString* t3 = g_ptr_array_index(a_field_path,t);
+// g_print("%i=%s ",t,t3->str);
+// }
+ g_print("%c ",filter->expression[i]);
+ switch(filter->expression[i]) {
+ /*
+ * logical operators
+ */
+ case '&': /* and */
+
+ t1 = (LttvFilterTree*)g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t;
+ t2 = lttv_filter_tree_new();
+ t2->node = LTTV_LOGICAL_AND;
+ if(subtree != NULL) { /* append subtree to current tree */
+ t2->left = LTTV_TREE_NODE;
+ t2->l_child.t = subtree;
+ subtree = NULL;
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ } else { /* append a simple expression */
+ a_simple_expression->value = a_field_component->str;
+ a_field_component = g_string_new("");
+ t2->left = LTTV_TREE_LEAF;
+ t2->l_child.leaf = a_simple_expression;
+ a_simple_expression = lttv_simple_expression_new();
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ }
+ break;
+
+ case '|': /* or */
+
+ t1 = (LttvFilter*)g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t;
+ t2 = lttv_filter_tree_new();
+ t2->node = LTTV_LOGICAL_OR;
+ if(subtree != NULL) { /* append subtree to current tree */
+ t2->left = LTTV_TREE_NODE;
+ t2->l_child.t = subtree;
+ subtree = NULL;
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ } else { /* append a simple expression */
+ a_simple_expression->value = a_field_component->str;
+ a_field_component = g_string_new("");
+ t2->left = LTTV_TREE_LEAF;
+ t2->l_child.leaf = a_simple_expression;
+ a_simple_expression = lttv_simple_expression_new();
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ }
+ break;
+
+ case '^': /* xor */
+
+ t1 = (LttvFilter*)g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t;
+ t2 = lttv_filter_tree_new();
+ t2->node = LTTV_LOGICAL_XOR;
+ if(subtree != NULL) { /* append subtree to current tree */
+ t2->left = LTTV_TREE_NODE;
+ t2->l_child.t = subtree;
+ subtree = NULL;
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ } else { /* append a simple expression */
+ a_simple_expression->value = a_field_component->str;
+ a_field_component = g_string_new("");
+ t2->left = LTTV_TREE_LEAF;
+ t2->l_child.leaf = a_simple_expression;
+ a_simple_expression = lttv_simple_expression_new();
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ }
+ break;
+
+ case '!': /* not, or not equal (math op) */
+
+ if(filter->expression[i+1] == '=') { /* != */
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ parse_field_path(a_field_path,a_simple_expression);
+ a_field_component = g_string_new("");
+ assign_operator(a_simple_expression,LTTV_FIELD_NE);
+ i++;
+ } else { /* ! */
+ // g_print("%s\n",a_field_component);
+ // a_field_component = g_string_new("");
+ t1 = (LttvFilter*)g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t;
+ t2 = lttv_filter_tree_new();
+ t2->node = LTTV_LOGICAL_NOT;
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = t2;
+ }
+ break;
+
+ case '(': /* start of parenthesis */
+ case '[':
+ case '{':
+
+ p_nesting++; /* incrementing parenthesis nesting value */
+ t1 = lttv_filter_tree_new();
+ g_ptr_array_add( tree_stack,(gpointer) t1 );
+ break;
+
+ case ')': /* end of parenthesis */
+ case ']':
+ case '}':
+
+ p_nesting--; /* decrementing parenthesis nesting value */
+ if(p_nesting<0 || tree_stack->len<2) {
+ g_warning("Wrong filtering options, the string\n\"%s\"\n\
+ is not valid due to parenthesis incorrect use",filter->expression);
+ return FALSE;
+ }
+
+ g_assert(tree_stack->len>0);
+ if(subtree != NULL) { /* append subtree to current tree */
+ t1 = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE && t1->right != LTTV_TREE_LEAF) {
+ g_assert(t1!=NULL && t1->r_child.t != NULL);
+ t1 = t1->r_child.t;
+ }
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = subtree;
+ subtree = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ g_ptr_array_remove_index(tree_stack,tree_stack->len-1);
+ } else { /* assign subtree as current tree */
+ a_simple_expression->value = a_field_component->str;
+ a_field_component = g_string_new("");
+ t1 = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t;
+ t1->right = LTTV_TREE_LEAF;
+ t1->r_child.leaf = a_simple_expression;
+ a_simple_expression = lttv_simple_expression_new();
+ subtree = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ g_assert(subtree != NULL);
+ g_ptr_array_remove_index(tree_stack,tree_stack->len-1);
+ }
+ break;
+
+ /*
+ * mathematic operators
+ */
+ case '<': /* lower, lower or equal */
+
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ parse_field_path(a_field_path,a_simple_expression);
+ a_field_component = g_string_new("");
+ if(filter->expression[i+1] == '=') { /* <= */
+ i++;
+ assign_operator(a_simple_expression,LTTV_FIELD_LE);
+ } else assign_operator(a_simple_expression,LTTV_FIELD_LT);
+ break;
+
+ case '>': /* higher, higher or equal */
+
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ parse_field_path(a_field_path,a_simple_expression);
+ a_field_component = g_string_new("");
+ if(filter->expression[i+1] == '=') { /* >= */
+ i++;
+ assign_operator(a_simple_expression,LTTV_FIELD_GE);
+ } else assign_operator(a_simple_expression,LTTV_FIELD_GT);
+ break;
+
+ case '=': /* equal */
+
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ parse_field_path(a_field_path,a_simple_expression);
+ a_field_component = g_string_new("");
+ assign_operator(a_simple_expression,LTTV_FIELD_EQ);
+ break;
+
+ /*
+ * Field concatening caracter
+ */
+ case '.': /* dot */
+
+ /*
+ * divide field expression into elements
+ * in a_field_path array.
+ */
+// if(a_simple_expression->op == NULL) {
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ a_field_component = g_string_new("");
+// }
+ break;
+
+ default: /* concatening current string */
+ g_string_append_c(a_field_component,filter->expression[i]);
+ }
+ }
+
+ g_print("subtree:%p, tree:%p, t1:%p, t2:%p\n",subtree,tree,t1,t2);
+ g_print("stack size: %i\n",tree_stack->len);
+
+ /*
+ * Preliminary check to see
+ * if tree was constructed correctly
+ */
+ if( p_nesting>0 ) {
+ g_warning("Wrong filtering options, the string\n\"%s\"\n\
+ is not valid due to parenthesis incorrect use",filter->expression);
+ return FALSE;
+ }
+
+ if(tree_stack->len != 1) /* only root tree should remain */
+ return FALSE;
+
+ /* processing last element of expression */
+ t1 = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_IDLE) t1 = t1->r_child.t;
+ if(subtree != NULL) { /* add the subtree */
+ t1->right = LTTV_TREE_NODE;
+ t1->r_child.t = subtree;
+ subtree = NULL;
+ } else { /* add a leaf */
+ a_simple_expression->value = a_field_component->str;
+ a_field_component = g_string_new("");
+ t1->right = LTTV_TREE_LEAF;
+ t1->r_child.leaf = a_simple_expression;
+ /*
+ * FIXME: is it really necessary to reallocate
+ * LttvSimpleExpression at this point ??
+ */
+ a_simple_expression = lttv_simple_expression_new();
+ }
+
+ g_assert(tree != NULL);
+ g_assert(subtree == NULL);
+
+ lttv_print_tree(filter->head) ;
+
+ g_print("ended update tree!\n");
+ return TRUE;
+
+// return filter;
+
+}
+
+/**
+ * Destroy the current LttvFilter
+ * @param filter pointer to the current LttvFilter
+ */
+void
+lttv_filter_destroy(LttvFilter* filter) {
+
+ g_free(filter->expression);
+ lttv_filter_tree_destroy(filter->head);
+ g_free(filter);
+
+}
+
+/**
+ * Assign a new tree for the current expression
+ * or sub expression
+ * @return pointer of LttvFilterTree
+ */
+LttvFilterTree*
+lttv_filter_tree_new() {
+ LttvFilterTree* tree;
+
+ tree = g_new(LttvFilter,1);
+ tree->node = 0; //g_new(lttv_expression,1);
+ tree->left = LTTV_TREE_IDLE;
+ tree->right = LTTV_TREE_IDLE;
+
+ return tree;
+}
+
+/**
+ * Append a new expression to the expression
+ * defined in the current filter
+ * @param filter pointer to the current LttvFilter
+ * @param expression string that must be appended
+ */
+void lttv_filter_append_expression(LttvFilter* filter, char *expression) {
+
+ if(expression == NULL) return;
+ if(filter == NULL) {
+ filter = lttv_filter_new();
+ filter->expression = expression;
+ } else if(filter->expression == NULL) {
+ filter->expression = expression;
+ } else {
+ filter->expression = g_strconcat(filter->expression,"&",expression);
+ }
+
+ lttv_filter_update(filter);
+
+}
+
+/**
+ * Clear the filter expression from the
+ * current filter and sets its pointer to NULL
+ * @param filter pointer to the current LttvFilter
+ */
+void lttv_filter_clear_expression(LttvFilter* filter) {
+
+ if(filter->expression != NULL) {
+ g_free(filter->expression);
+ filter->expression = NULL;
+ }
+
+}
+
+/**
+ * Destroys the tree and his sub-trees
+ * @param tree Tree which must be destroyed
+ */
+void
+lttv_filter_tree_destroy(LttvFilterTree* tree) {
+
+ if(tree == NULL) return;
+
+ if(tree->left == LTTV_TREE_LEAF) g_free(tree->l_child.leaf);
+ else if(tree->left == LTTV_TREE_NODE) lttv_filter_tree_destroy(tree->l_child.t);
+
+ if(tree->right == LTTV_TREE_LEAF) g_free(tree->r_child.leaf);
+ else if(tree->right == LTTV_TREE_NODE) lttv_filter_tree_destroy(tree->r_child.t);
+
+ g_free(tree->node);
+ g_free(tree);
+}
+
+/**
+ * Global parsing function for the current
+ * LttvFilterTree
+ * @param tree pointer to the current LttvFilterTree
+ * @param event current LttEvent, NULL if not used
+ * @param tracefile current LttTracefile, NULL if not used
+ * @param trace current LttTrace, NULL if not used
+ * @param state current LttvProcessState, NULL if not used
+ */
+gboolean
+lttv_filter_tree_parse(
+ LttvFilterTree* t,
+ LttEvent* event,
+ LttTracefile* tracefile,
+ LttTrace* trace,
+ LttvProcessState* state
+ /*,...*/)
+{
+
+ /*
+ * Each tree is parsed in inorder.
+ * This way, it's possible to apply the left filter of the
+ * tree, then decide whether or not the right branch should
+ * be parsed depending on the linking logical operator
+ *
+ * Each node consists in a
+ * 1. logical operator
+ * 2. left child ( node or simple expression )
+ * 3. right child ( node or simple expression )
+ *
+ * When the child is a simple expression, we must
+ * before all determine if the expression refers to
+ * a structure which is whithin observation ( not NULL ).
+ * -If so, the expression is evaluated.
+ * -If not, the result is set to TRUE since this particular
+ * operation does not interfere with the lttv structure
+ *
+ * The result of each simple expression will directly
+ * affect the next branch. This way, depending on
+ * the linking logical operator, the parser will decide
+ * to explore or not the next branch.
+ * 1. AND OPERATOR
+ * -If result of left branch is 0 / FALSE
+ * then don't explore right branch and return 0;
+ * -If result of left branch is 1 / TRUE then explore
+ * 2. OR OPERATOR
+ * -If result of left branch is 1 / TRUE
+ * then don't explore right branch and return 1;
+ * -If result of left branch is 0 / FALSE then explore
+ * 3. XOR OPERATOR
+ * -Result of left branchwill not affect exploration of
+ * right branch
+ */
+
+ gboolean lresult = FALSE, rresult = FALSE;
+
+ /*
+ * Parse left branch
+ */
+ if(t->left == LTTV_TREE_NODE) lresult = lttv_filter_tree_parse(t->l_child.t,event,tracefile,trace,state);
+ else if(t->left == LTTV_TREE_LEAF) {
+ //g_print("%p: left is %i %p %s\n",t,t->l_child.leaf->field,t->l_child.leaf->op,t->l_child.leaf->value);
+ char* v;
+ g_assert(v = t->l_child.leaf->value);
+ switch(t->l_child.leaf->field) {
+
+ case LTTV_FILTER_TRACE_NAME:
+ if(trace == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)ltt_trace_name(trace),v);
+ break;
+ case LTTV_FILTER_TRACEFILE_NAME:
+ if(tracefile == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)ltt_tracefile_name(tracefile),v);
+ break;
+ case LTTV_FILTER_STATE_PID:
+ if(state == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)&state->pid,v);
+ break;
+ case LTTV_FILTER_STATE_PPID:
+ if(state == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)&state->ppid,v);
+ break;
+ case LTTV_FILTER_STATE_CT:
+ if(state == NULL) lresult = TRUE;
+ else {
+ double val = ltt_time_to_double(state->creation_time);
+ lresult = t->l_child.leaf->op((gpointer)&val,v);
+ }
+ break;
+ case LTTV_FILTER_STATE_IT:
+ if(state == NULL) lresult = TRUE;
+ else {
+ double val = ltt_time_to_double(state->insertion_time);
+ lresult = t->l_child.leaf->op((gpointer)&val,v);
+ }
+ break;
+ case LTTV_FILTER_STATE_P_NAME:
+ /*
+ * FIXME: Yet to be done ( I think ? )
+ */
+ lresult = TRUE;
+ break;
+ case LTTV_FILTER_STATE_EX_MODE:
+ if(state == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)&state->state->t,v);
+ break;
+ case LTTV_FILTER_STATE_EX_SUBMODE:
+ if(state == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)&state->state->n,v);
+ break;
+ case LTTV_FILTER_STATE_P_STATUS:
+ if(state == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)&state->state->s,v);
+ break;
+ case LTTV_FILTER_STATE_CPU:
+ /*
+ * FIXME: What is the comparison value ?
+ */
+ lresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_NAME:
+ if(event == NULL) lresult = TRUE;
+ else lresult = t->l_child.leaf->op((gpointer)ltt_event_eventtype(event),v);
+ break;
+
+ case LTTV_FILTER_EVENT_CATEGORY:
+ /*
+ * FIXME: Not yet implemented
+ */
+ lresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_TIME:
+// if(event == NULL) lresult = TRUE;
+// else {
+// double val = ltt_time_to_double(event->event_time);
+// lresult = t->l_child.leaf->op((gpointer)&val,v);
+// }
+ lresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_TSC:
+// if(event == NULL) lresult = TRUE;
+// else {
+// double val = ltt_time_to_double(event->event_time);
+// lresult = t->l_child.leaf->op((gpointer)&val,v);
+// }
+ /*
+ * FIXME: Where is event.tsc
+ */
+ lresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_FIELD:
+ /*
+ * TODO: Use the offset to
+ * find the dynamic field
+ * in the event struct
+ */
+ lresult = TRUE;
+ default:
+ /*
+ * This case should never be
+ * parsed, if so, the whole
+ * filtering is cancelled
+ */
+ g_warning("Error while parsing the filter tree");
+ return TRUE;
+ }
+ }
+
+ /*
+ * Parse linking operator
+ * make a cutoff if possible
+ */
+ if((t->node & LTTV_LOGICAL_OR) && lresult == TRUE) return TRUE;
+ if((t->node & LTTV_LOGICAL_AND) && lresult == FALSE) return FALSE;
+
+ /*
+ * Parse right branch
+ */
+ if(t->right == LTTV_TREE_NODE) rresult = lttv_filter_tree_parse(t->r_child.t,event,tracefile,trace,state);
+ else if(t->right == LTTV_TREE_LEAF) {
+ //g_print("%p: right is %i %p %s\n",t,t->r_child.leaf->field,t->r_child.leaf->op,t->r_child.leaf->value);
+ char* v;
+ g_assert(v = t->r_child.leaf->value);
+ switch(t->r_child.leaf->field) {
+
+ case LTTV_FILTER_TRACE_NAME:
+ if(trace == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)ltt_trace_name(trace),v);
+ break;
+ case LTTV_FILTER_TRACEFILE_NAME:
+ if(tracefile == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)ltt_tracefile_name(tracefile),v);
+ break;
+ case LTTV_FILTER_STATE_PID:
+ if(state == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)&state->pid,v);
+ break;
+ case LTTV_FILTER_STATE_PPID:
+ if(state == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)&state->ppid,v);
+ break;
+ case LTTV_FILTER_STATE_CT:
+ if(state == NULL) rresult = TRUE;
+ else {
+ double val = ltt_time_to_double(state->creation_time);
+ rresult = t->r_child.leaf->op((gpointer)&val,v);
+ }
+ break;
+ case LTTV_FILTER_STATE_IT:
+ if(state == NULL) rresult = TRUE;
+ else {
+ double val = ltt_time_to_double(state->insertion_time);
+ rresult = t->r_child.leaf->op((gpointer)&val,v);
+ }
+ break;
+ case LTTV_FILTER_STATE_P_NAME:
+ /*
+ * FIXME: Yet to be done ( I think ? )
+ */
+ rresult = TRUE;
+ break;
+ case LTTV_FILTER_STATE_EX_MODE:
+ if(state == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)&state->state->t,v);
+ break;
+ case LTTV_FILTER_STATE_EX_SUBMODE:
+ if(state == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)&state->state->n,v);
+ break;
+ case LTTV_FILTER_STATE_P_STATUS:
+ if(state == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)&state->state->s,v);
+ break;
+ case LTTV_FILTER_STATE_CPU:
+ /*
+ * FIXME: What is the comparison value ?
+ */
+ rresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_NAME:
+ if(event == NULL) rresult = TRUE;
+ else rresult = t->r_child.leaf->op((gpointer)ltt_event_eventtype(event),v);
+ break;
+
+ case LTTV_FILTER_EVENT_CATEGORY:
+ /*
+ * FIXME: Not yet implemented
+ */
+ rresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_TIME:
+// if(event == NULL) rresult = TRUE;
+// else {
+// double val = ltt_time_to_double(event->event_time);
+// rresult = t->r_child.leaf->op((gpointer)&val,v);
+// }
+ rresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_TSC:
+// if(event == NULL) rresult = TRUE;
+// else {
+// double val = ltt_time_to_double(event->event_time);
+// rresult = t->r_child.leaf->op((gpointer)&val,v);
+// }
+ /*
+ * FIXME: Where is event.tsc
+ */
+ rresult = TRUE;
+ break;
+ case LTTV_FILTER_EVENT_FIELD:
+ /*
+ * TODO: Use the offset to
+ * find the dynamic field
+ * in the event struct
+ */
+ rresult = TRUE;
+ default:
+ /*
+ * This case should never be
+ * parsed, if so, this subtree
+ * is cancelled !
+ */
+ g_warning("Error while parsing the filter tree");
+ return TRUE;
+ }
+ }
+
+ /*
+ * Apply and return the
+ * logical link between the
+ * two operation
+ */
+ switch(t->node) {
+ case LTTV_LOGICAL_OR: return (lresult | rresult);
+ case LTTV_LOGICAL_AND: return (lresult & rresult);
+ case LTTV_LOGICAL_NOT: return (!rresult);
+ case LTTV_LOGICAL_XOR: return (lresult ^ rresult);
+ default:
+ /*
+ * This case should never be
+ * parsed, if so, this subtree
+ * is cancelled !
+ */
+ return TRUE;
+ }
+
+}
+
+/**
+ * Debug
+ */
+void
+lttv_print_tree(LttvFilterTree* t) {
+
+ g_print("node:%p lchild:%p rchild:%p\n",t,
+ (t->left==LTTV_TREE_NODE)?t->l_child.t:NULL,
+ (t->right==LTTV_TREE_NODE)?t->r_child.t:NULL);
+ g_print("node type: %i / [left] %i / [right] %i\n",t->node,t->left,t->right);
+ if(t->left == LTTV_TREE_NODE) lttv_print_tree(t->l_child.t);
+ else if(t->left == LTTV_TREE_LEAF) {
+ g_assert(t->l_child.leaf->value != NULL);
+ g_print("%p: left is %i %p %s\n",t,t->l_child.leaf->field,t->l_child.leaf->op,t->l_child.leaf->value);
+ }
+ g_print("1\n");
+ if(t->right == LTTV_TREE_NODE) lttv_print_tree(t->r_child.t);
+ else if(t->right == LTTV_TREE_LEAF) {
+ g_assert(t->r_child.leaf->value != NULL);
+ g_print("%p: right is %i %p %s\n",t,t->r_child.leaf->field,t->r_child.leaf->op,t->r_child.leaf->value);
+ }
+ g_print("end\n");
+