/* 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
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. */
+ larger or equal to a specified value.
+*/
+
+/*
+ * YET TO BE ANSWERED
+ * - should the filter be implemented as a module
+ * - should all the structures and field types be associated with GQuarks
+ */
#include <lttv/filter.h>
/*
- read_token
+ read_token
- read_expression
- ( read expr )
- simple expr [ op expr ]
+ read_expression
+ ( read expr )
+ simple expr [ op expr ]
- read_simple_expression
- read_field_path [ rel value ]
+ read_simple_expression
+ read_field_path [ rel value ]
- read_field_path
- read_field_component [. field path]
+ read_field_path
+ read_field_component [. field path]
- read_field_component
- name [ \[ value \] ]
+ read_field_component
+ name [ \[ value \] ]
- data struct:
- and/or(left/right)
- not(child)
- op(left/right)
- path(component...) -> field
+ data struct:
+ and/or(left/right)
+ not(child)
+ op(left/right)
+ path(component...) -> field
*/
+/**
+ * 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(GList* fp) {
+
+ GString* f = g_list_first(fp)->data;
+
+ switch(g_quark_try_string(f->str)) {
+// case LTTV_FILTER_TRACE:
+
+// break;
+// case LTTV_FILTER_TRACEFILE:
+
+// break;
+// case LTTV_FILTER_TRACESET:
+
+// break;
+// case LTTV_FILTER_STATE:
+
+// break;
+// case LTTV_FILTER_EVENT:
+
+// break;
+ default: /* Quark value unrecognized or equal to 0 */
+ 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
unsigned i;
- for(i=0;i<strlen(expression);i++) {
+
+
- }
}
/**
* @return the current lttv_filter or NULL if error
*/
lttv_filter*
-lttv_filter_new(char *expression, LttvTrace *t) {
+lttv_filter_new(char *expression, LttvTraceState *tcs) {
- unsigned
- i,
- p=0, /* parenthesis nesting value */
- b=0; /* current breakpoint in expression string */
-
- gpointer tree;
-
- GString *current_option = g_string_new("");
- lttv_simple_expression current_expression;
-
- g_print("filter::lttv_filter_new()\n"); /* debug */
-
- /*
- * 1. parse expression
- * 2. construct binary tree
- * 3. return corresponding filter
- */
-
- /*
- * Binary tree memory allocation
- * - based upon a preliminary block size
- */
- gulong size = (strlen(expression)/6) * 1.5;
- tree = g_malloc(size*sizeof(lttv_filter_tree));
+ g_print("filter::lttv_filter_new()\n"); /* debug */
+
+ unsigned
+ i,
+ p=0, /* parenthesis nesting value */
+ b=0; /* current breakpoint in expression string */
- /*
- * Parse entire expression and construct
- * the binary tree. There are two steps
+ 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");
+
+ gpointer tree = NULL;
+
+ /* temporary values */
+ GString *a_field_component = g_string_new("");
+ GList *a_field_path = NULL;
+ lttv_simple_expression a_simple_expression;
+
+ /*
+ * 1. parse expression
+ * 2. construct binary tree
+ * 3. return corresponding filter
+ */
+
+ /*
+ * Binary tree memory allocation
+ * - based upon a preliminary block size
+ */
+ gulong size = (strlen(expression)/AVERAGE_EXPRESSION_LENGTH)*MAX_FACTOR;
+ tree = g_malloc(size*sizeof(lttv_filter_tree));
+
+ /*
+ * 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
+ * - field path ( separated by dots )
* - op ( >, <, =, >=, <=, !=)
- * - value
- */
- for(i=0;i<strlen(expression);i++) {
- switch(expression[i]) {
+ * - value ( integer, string ... )
+ * To spare computing time, the whole
+ * string is parsed in this loop for a
+ * O(n) complexity order.
+ */
+ for(i=0;i<strlen(expression);i++) {
+ g_print("%s\n",a_field_component->str);
+ switch(expression[i]) {
/*
- * boolean operators
+ * logical operators
*/
- case '&': /* and */
- parse_simple_expression(currentOption);
- g_print("%s\n",¤tOption);
- currentOption = g_string_new("");
- break;
- case '|': /* or */
- g_print("%s\n",currentOption);
- currentOption = g_string_new("");
- break;
- case '^': /* xor */
- g_print("%s\n",currentOption);
- currentOption = g_string_new("");
- break;
- case '!': /* not, or not equal (math op) */
+ case '&': /* and */
+ case '|': /* or */
+ case '^': /* xor */
+ g_list_append( a_field_path, a_field_component );
+ a_field_component = g_string_new("");
+ break;
+ case '!': /* not, or not equal (math op) */
if(expression[i+1] == '=') { /* != */
- current_expression.op = LTTV_FIELD_NE;
+ a_simple_expression.op = LTTV_FIELD_NE;
i++;
} else { /* ! */
- g_print("%s\n",currentOption);
- currentOption = g_string_new("");
+ g_print("%s\n",a_field_component);
+ current_option = g_string_new("");
}
break;
- case '(': /* start of parenthesis */
- p++;
- break;
- case ')': /* end of parenthesis */
- p--;
- break;
- /*
- * mathematic operators
+ case '(': /* start of parenthesis */
+ p++; /* incrementing parenthesis nesting value */
+ break;
+ case ')': /* end of parenthesis */
+ p--; /* decrementing parenthesis nesting value */
+ break;
+
+ /*
+ * mathematic operators
*/
case '<': /* lower, lower or equal */
if(expression[i+1] == '=') { /* <= */
i++;
- current_expression.op = LTTV_FIELD_LE;
- } else current_expression.op = LTTV_FIELD_LT;
+ a_simple_expression.op = LTTV_FIELD_LE;
+ } else a_simple_expression.op = LTTV_FIELD_LT;
break;
case '>': /* higher, higher or equal */
- if(expression[i+1] == '=') { /* >= */
+ if(expression[i+1] == '=') { /* >= */
i++;
- current_expression.op = LTTV_FIELD_GE;
- } else current_expression.op = LTTV_FIELD_GT;
+ a_simple_expression.op = LTTV_FIELD_GE;
+ } else a_simple_expression.op = LTTV_FIELD_GT;
break;
case '=': /* equal */
- current_expression.op = LTTV_FIELD_EQ;
+ a_simple_expression.op = LTTV_FIELD_EQ;
break;
- case
- default: /* concatening current string */
- g_string_append_c(currentOption,expression[i]);
- }
-
-
- }
-
- if( p>0 ) {
- g_warning("Wrong filtering options, the string\n\"%s\"\n\
- is not valid due to parenthesis incorrect use",expression);
- return NULL;
- }
+ /*
+ * Field concatening caracter
+ */
+ case '.': /* dot */
+ g_list_append( a_field_path, a_field_component );
+ a_field_component = g_string_new("");
+ break;
+ default: /* concatening current string */
+ g_string_append_c(current_option,expression[i]);
+ }
+ }
+
+
+
+ if( p>0 ) {
+ g_warning("Wrong filtering options, the string\n\"%s\"\n\
+ is not valid due to parenthesis incorrect use",expression);
+ return NULL;
+ }
}
/**
* @return success/failure of operation
*/
gboolean
-lttv_filter_tracefile(lttv_filter *filter, void *tracefile) {
+lttv_filter_tracefile(lttv_filter *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);
+ }
+ */
}
/**
* @return success/failure of operation
*/
gboolean
-lttv_filter_event(lttv_filter *filter, void *event) {
+lttv_filter_event(lttv_filter *filter, LttEvent *event) {
}
projects / lttv.git / blobdiff