/* This file is part of the Linux Trace Toolkit viewer
- * Copyright (C) 2003-2004 Michel Dagenais
+ * Copyright (C) 2003-2005 Michel Dagenais
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License Version 2 as
* MA 02111-1307, USA.
*/
-
+/*
consist in AND, OR and NOT nested expressions, forming a tree with
simple relations as leaves. The simple relations test is a field
in an event is equal, not equal, smaller, smaller or equal, larger, or
- larger or equal to a specified value. */
-
-typedef enum _lttv_expression_op
-{ LTTV_FIELD_EQ,
- LTTV_FIELD_NE,
- LTTV_FIELD_LT,
- LTTV_FIELD_LE,
- LTTV_FIELD_GT,
- LTTV_FIELD_GE
-} lttv_expression_op;
-
-typedef _lttv_simple_expression
-{ lttv_expression_op op;
- char *field_name;
- char *value;
-} lttv_simple_expression;
-
-typedef _lttv_expression_type
-{ LTTV_EXPRESSION,
- LTTV_SIMPLE_EXPRESSION
+ larger or equal to a specified value.
+*/
+
+/*
+ * YET TO BE ANSWERED
+ * - the exists an other lttv_filter which conflicts with this one
+ */
+
+#include <lttv/filter.h>
+
+/*
+ read_token
+
+ read_expression
+ ( read expr )
+ simple expr [ op expr ]
+
+ read_simple_expression
+ read_field_path [ rel value ]
+
+ read_field_path
+ read_field_component [. field path]
+
+ read_field_component
+ name [ \[ value \] ]
+
+ data struct:
+ and/or(left/right)
+ not(child)
+ op(left/right)
+ path(component...) -> field
+*/
+
+GQuark
+ LTTV_FILTER_TRACE,
+ LTTV_FILTER_TRACESET,
+ LTTV_FILTER_TRACEFILE,
+ LTTV_FILTER_STATE,
+ LTTV_FILTER_EVENT,
+ LTTV_FILTER_NAME,
+ LTTV_FILTER_CATEGORY,
+ LTTV_FILTER_TIME,
+ LTTV_FILTER_TSC,
+ LTTV_FILTER_PID,
+ LTTV_FILTER_PPID,
+ LTTV_FILTER_C_TIME,
+ LTTV_FILTER_I_TIME,
+ LTTV_FILTER_P_NAME,
+ LTTV_FILTER_EX_MODE,
+ LTTV_FILTER_EX_SUBMODE,
+ LTTV_FILTER_P_STATUS,
+ LTTV_FILTER_CPU;
+
+/**
+ * Assign a new tree for the current expression
+ * or sub expression
+ * @return pointer of lttv_filter_tree
+ */
+lttv_filter_tree* lttv_filter_tree_new() {
+ lttv_filter_tree* tree;
+
+ tree = g_new(lttv_filter_tree,1);
+ tree->node = g_new(lttv_expression,1);
+ tree->node->type = LTTV_UNDEFINED_EXPRESSION;
+ tree->left = LTTV_TREE_UNDEFINED;
+ tree->right = LTTV_TREE_UNDEFINED;
+
+ return tree;
+}
+
+/**
+ * Destroys the tree and his sub-trees
+ * @param tree Tree which must be destroyed
+ */
+void lttv_filter_tree_destroy(lttv_filter_tree* tree) {
+
+ 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);
+}
+
+/**
+ * Parse through filtering field hierarchy as specified
+ * by user. This function compares each value to
+ * predetermined quarks
+ * @param fp The field path list
+ * @return success/failure of operation
+ */
+gboolean
+parse_field_path(GPtrArray* fp) {
+
+ GString* f = NULL;
+ g_assert(f=g_ptr_array_index(fp,0)); //list_first(fp)->data;
+
+ if(g_quark_try_string(f->str) == LTTV_FILTER_EVENT) {
+// parse_subfield(fp, LTTV_FILTER_EVENT);
+
+ } else if(g_quark_try_string(f->str) == LTTV_FILTER_TRACEFILE) {
+
+ } else if(g_quark_try_string(f->str) == LTTV_FILTER_TRACE) {
+
+ } else if(g_quark_try_string(f->str) == LTTV_FILTER_STATE) {
+
+ } else {
+ g_warning("Unrecognized field in filter string");
+ return FALSE;
+ }
+ return TRUE;
+}
+
+/**
+ * Add an filtering option to the current tree
+ * @param expression Current expression to parse
+ * @return success/failure of operation
+ */
+gboolean
+parse_simple_expression(GString* expression) {
+
+ unsigned i;
+
+
+
+
+}
+
+/**
+ * Creates a new lttv_filter
+ * @param expression filtering options string
+ * @param t pointer to the current LttvTrace
+ * @return the current lttv_filter or NULL if error
+ */
+lttv_filter_tree*
+lttv_filter_new(char *expression, LttvTraceState *tcs) {
+ g_print("filter::lttv_filter_new()\n"); /* debug */
+
+ unsigned
+ i,
+ p_nesting=0, /* parenthesis nesting value */
+ b=0; /* current breakpoint in expression string */
+
+ /*
+ * Main tree & Tree concatening list
+ * 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 created at the root of
+ * the list
+ */
+ lttv_filter_tree* tree = lttv_filter_tree_new();
+ lttv_filter_tree* subtree = NULL;
+// lttv_filter_tree* current_tree = NULL;
+ 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;
+
+ lttv_simple_expression a_simple_expression;
+
+ /*
+ * 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 */
+
+ lttv_filter_tree *t1, *t2;
+
+ for(i=0;i<strlen(expression);i++) {
+// g_print("%s\n",a_field_component->str);
+ g_print("%c\n",expression[i]);
+ switch(expression[i]) {
+ /*
+ * logical operators
+ */
+ case '&': /* and */
+ t1 = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ while(t1->right != LTTV_TREE_UNDEFINED) t1 = t1->r_child.t;
+ t2 = lttv_filter_tree_new();
+ t2->node->type = LTTV_EXPRESSION_OP;
+ t2->node->e.op = LTTV_LOGICAL_AND;
+ if(subtree != NULL) {
+ t2->left = LTTV_TREE_NODE;
+ t2->l_child.t = subtree;
+ subtree = NULL;
+ t1->right = LTTV_TREE_NODE;
+ t1->l_child.t = t2;
+ } else {
+ a_simple_expression.value = a_field_component->str;
+ a_field_component = g_string_new("");
+ t2->left = LTTV_TREE_LEAF;
+ t2->l_child.leaf = g_new(lttv_simple_expression,1);
+ t1->right = LTTV_TREE_NODE;
+ t1->l_child.t = t2;
+ }
+
+ break;
+ case '|': /* or */
+ break;
+ case '^': /* xor */
+ break;
+ case '!': /* not, or not equal (math op) */
+ if(expression[i+1] == '=') { /* != */
+ a_simple_expression.op = LTTV_FIELD_NE;
+ i++;
+ } else { /* ! */
+ g_print("%s\n",a_field_component);
+ a_field_component = g_string_new("");
+ }
+ break;
+ case '(': /* start of parenthesis */
+ case '[':
+ case '{':
+ p_nesting++; /* incrementing parenthesis nesting value */
+ lttv_filter_tree* subtree = lttv_filter_tree_new();
+ g_ptr_array_add( tree_stack,(gpointer) subtree );
+ 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",expression);
+ return NULL;
+ }
+
+ g_assert(tree_stack->len>0);
+ if(subtree != NULL) {
+ t1 = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ /* FIXME ==> SEG FAULT */
+ while(t1->right != LTTV_TREE_UNDEFINED && 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 {
+ 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_UNDEFINED) t1 = t1->r_child.t;
+ t1->right = LTTV_TREE_LEAF;
+ t1->r_child.leaf = g_new(lttv_simple_expression,1);
+ subtree = g_ptr_array_index(tree_stack,tree_stack->len-1);
+ g_ptr_array_remove_index(tree_stack,tree_stack->len-1);
+ }
+ /* lttv_filter_tree *sub1 = g_ptr_array_index(tree_list,tree_list->len-1);
+ lttv_filter_tree *sub2 = g_ptr_array_index(tree_list,tree_list->len);
+ if(sub1->left == LTTV_TREE_UNDEFINED){
+ sub1->l_child.t = sub2;
+ sub1->left = LTTV_TREE_NODE;
+ } else if(sub1->right == LTTV_TREE_UNDEFINED){
+ sub1->r_child.t = sub2;
+ sub1->right = LTTV_TREE_NODE;
+ } else g_error("error during tree assignation");
+ g_ptr_array_remove_index(tree_list,tree_list->len);
+ break;
+ */
+ // subtree = g_ptr_array_index(tree_stack,tree_stack->len);
+ // g_ptr_array_remove_index(tree_stack,tree_stack->len);
+ break;
+
+ /*
+ * mathematic operators
+ */
+ case '<': /* lower, lower or equal */
+ if(expression[i+1] == '=') { /* <= */
+ i++;
+ a_simple_expression.op = LTTV_FIELD_LE;
+ } else a_simple_expression.op = LTTV_FIELD_LT;
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ a_field_component = g_string_new("");
+ break;
+ case '>': /* higher, higher or equal */
+ if(expression[i+1] == '=') { /* >= */
+ i++;
+ a_simple_expression.op = LTTV_FIELD_GE;
+ } else a_simple_expression.op = LTTV_FIELD_GT;
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ a_field_component = g_string_new("");
+ break;
+ case '=': /* equal */
+ a_simple_expression.op = LTTV_FIELD_EQ;
+ g_ptr_array_add( a_field_path,(gpointer) a_field_component );
+ a_field_component = g_string_new("");
+ break;
+ /*
+ * Field concatening caracter
+ */
+ case '.': /* dot */
+ 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,expression[i]);
+ }
+ }
+
+
+
+ if( p_nesting>0 ) {
+ g_warning("Wrong filtering options, the string\n\"%s\"\n\
+ is not valid due to parenthesis incorrect use",expression);
+ return NULL;
+ }
+}
+
+/**
+ * Apply the filter to a specific trace
+ * @param filter the current filter applied
+ * @param tracefile the trace to apply the filter to
+ * @return success/failure of operation
+ */
+gboolean
+lttv_filter_tracefile(lttv_filter_t *filter, LttTracefile *tracefile) {
+
+
+
+ /* test */
+/* int i, nb;
+ char *f_name, *e_name;
+
+ char* field = "cpu";
+
+ LttvTraceHook h;
+
+ LttEventType *et;
+
+ LttType *t;
+
+ GString *fe_name = g_string_new("");
+
+ nb = ltt_trace_eventtype_number(tcs->parent.t);
+ g_print("NB:%i\n",nb);
+ for(i = 0 ; i < nb ; i++) {
+ et = ltt_trace_eventtype_get(tcs->parent.t, i);
+ e_name = ltt_eventtype_name(et);
+ f_name = ltt_facility_name(ltt_eventtype_facility(et));
+ g_string_printf(fe_name, "%s.%s", f_name, e_name);
+ g_print("facility:%s and event:%s\n",f_name,e_name);
+ }
+ */
}
-typedef struct _lttv_expression
-{ bool or;
- bool not;
- bool simple_expression;
- union
- { lttv_expression *e;
- lttv_field_relation *se;
- } e;
-} lttv_expression;
-
-read_token
-
-read_expression
- ( read expr )
- simple expr [ op expr ]
-
-read_simple_expression
- read_field_path [ rel value ]
-
-read_field_path
- read_field_component [. field path]
-
-read_field_component
- name [ \[ value \] ]
-
-data struct:
-and/or(left/right)
-not(child)
-op(left/right)
-path(component...) -> field
+
+gboolean
+lttv_filter_tracestate(lttv_filter_t *filter, LttvTraceState *tracestate) {
+
+}
+
+/**
+ * Apply the filter to a specific event
+ * @param filter the current filter applied
+ * @param event the event to apply the filter to
+ * @return success/failure of operation
+ */
+gboolean
+lttv_filter_event(lttv_filter_t *filter, LttEvent *event) {
+
+}
+
+/**
+ * Initializes the filter module and specific values
+ */
+static void module_init()
+{
+
+ /*
+ * Quarks initialization
+ * for hardcoded filtering options
+ *
+ * TODO: traceset has no yet been defined
+ */
+
+ /* top fields */
+ LTTV_FILTER_EVENT = g_quark_from_string("event");
+ LTTV_FILTER_TRACE = g_quark_from_string("trace");
+ LTTV_FILTER_TRACESET = g_quark_from_string("traceset");
+ LTTV_FILTER_STATE = g_quark_from_string("state");
+ LTTV_FILTER_TRACEFILE = g_quark_from_string("tracefile");
+
+ /* event.name, tracefile.name, trace.name */
+ LTTV_FILTER_NAME = g_quark_from_string("name");
+
+ /* event sub fields */
+ LTTV_FILTER_CATEGORY = g_quark_from_string("category");
+ LTTV_FILTER_TIME = g_quark_from_string("time");
+ LTTV_FILTER_TSC = g_quark_from_string("tsc");
+
+ /* state sub fields */
+ LTTV_FILTER_PID = g_quark_from_string("pid");
+ LTTV_FILTER_PPID = g_quark_from_string("ppid");
+ LTTV_FILTER_C_TIME = g_quark_from_string("creation_time");
+ LTTV_FILTER_I_TIME = g_quark_from_string("insertion_time");
+ LTTV_FILTER_P_NAME = g_quark_from_string("process_name");
+ LTTV_FILTER_EX_MODE = g_quark_from_string("execution_mode");
+ LTTV_FILTER_EX_SUBMODE = g_quark_from_string("execution_submode");
+ LTTV_FILTER_P_STATUS = g_quark_from_string("process_status");
+ LTTV_FILTER_CPU = g_quark_from_string("cpu");
+
+}
+
+/**
+ * Destroys the filter module and specific values
+ */
+static void module_destroy()
+{
+}
+
+
+LTTV_MODULE("filter", "Filters traceset and events", \
+ "Filters traceset and events specifically to user input", \
+ module_init, module_destroy)
+
projects / lttv.git / blobdiff