starting to work on lttv filter

[lttv.git] / ltt / branches / poly / lttv / lttv / filter.c

diff --git a/ltt/branches/poly/lttv/lttv/filter.c b/ltt/branches/poly/lttv/lttv/filter.c
index 74cd30e15a9cb0664e987522d8aa152d0a4e7a8c..a5185ae489db1dab2c0da1fb67db733db4920f75 100644 (file)
--- a/ltt/branches/poly/lttv/lttv/filter.c
+++ b/ltt/branches/poly/lttv/lttv/filter.c
@@ -16,12 +16,14 @@
  * 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. */
 
+#include <lttv/filter.h>
+
 typedef enum _lttv_expression_op
 { LTTV_FIELD_EQ,
   LTTV_FIELD_NE,
@@ -31,46 +33,80 @@ typedef enum _lttv_expression_op
   LTTV_FIELD_GE
 } lttv_expression_op;
 
-typedef _lttv_simple_expression
-{ lttv_expression_op op;
+typedef enum _lttv_expression_type
+{ 
+  LTTV_EXPRESSION,
+  LTTV_SIMPLE_EXPRESSION
+} lttv_expression_type;
+
+typedef struct _lttv_simple_expression
+{ 
+  lttv_expression_op op;
   char *field_name;
   char *value;
 } lttv_simple_expression;
 
-typedef _lttv_expression_type
-{ LTTV_EXPRESSION,
-  LTTV_SIMPLE_EXPRESSION
-
-}
 typedef struct _lttv_expression 
-{ bool or;
-  bool not;
-  bool simple_expression;
-  union 
-  { lttv_expression *e;
-    lttv_field_relation *se;
-  } e;
+{ 
+  gboolean or;
+  gboolean not;
+  gboolean simple_expression;
+//  union e 
+//  { 
+//     lttv_expression *e;
+//     lttv_field_relation *se;
+//  };
 } lttv_expression;
 
-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
+*/
+
+/**
+ *     create a new lttv_filter
+ *     @param expression filtering options string
+ *     @param t pointer to the current LttvTrace
+ *     @return the current lttv_filter
+ */
+lttv_filter*
+lttv_filter_new(char *expression, LttvTrace *t) {
 
+       g_print("filter::lttv_filter_new()\n");         /* debug */
 
+       /*
+        *      1. parse expression
+        *      2. construct binary tree
+        *      3. return corresponding filter
+        */
+
+       
+}
+
+gboolean
+lttv_filter_tracefile(lttv_filter *filter, void *tracefile) {
+
+}
+
+gboolean
+lttv_filter_event(lttv_filter *filter, void *event) {
+
+}