Update of /cvsroot/monetdb/pathfinder/compiler/algebra/map
In directory sc8-pr-cvs16.sourceforge.net:/tmp/cvs-serv3432/algebra/map

Modified Files:
        intro_proxy.c intro_thetajoin.c map_ori_names.c 
        map_unq_names.c resolve_proxy.c 
Log Message:
-- Extracted defines for child node accesses (e.g. L(p), LRLR(p), ...)
   and placed them in a new file child_mnemonic.h.


Index: intro_proxy.c
===================================================================
RCS file: /cvsroot/monetdb/pathfinder/compiler/algebra/map/intro_proxy.c,v
retrieving revision 1.31
retrieving revision 1.32
diff -u -d -r1.31 -r1.32
--- intro_proxy.c       11 Jan 2008 10:46:57 -0000      1.31
+++ intro_proxy.c       15 Feb 2008 12:15:59 -0000      1.32
@@ -49,16 +49,8 @@
 #include "alg_dag.h"
 #include "algopt.h"
 
-/*
- * Easily access subtree-parts.
- */
-/** starting from p, make a step left */
-#define L(p) ((p)->child[0])
-/** starting from p, make a step right */
-#define R(p) ((p)->child[1])
-/** ... and so on */
-#define LL(p) (L(L(p)))
-#define RL(p) (L(R(p)))
+/* Easily access subtree-parts */
+#include "child_mnemonic.h"
 
 #define SEEN(p)  ((p)->bit_dag)
 #define pfIN(p)  ((p)->bit_in)

Index: intro_thetajoin.c
===================================================================
RCS file: /cvsroot/monetdb/pathfinder/compiler/algebra/map/intro_thetajoin.c,v
retrieving revision 1.15
retrieving revision 1.16
diff -u -d -r1.15 -r1.16
--- intro_thetajoin.c   6 Feb 2008 16:36:35 -0000       1.15
+++ intro_thetajoin.c   15 Feb 2008 12:16:00 -0000      1.16
@@ -59,13 +59,8 @@
 #include "oops.h"
 #include "alg_dag.h"
 
-/*
- * Easily access subtree-parts.
- */
-/** starting from p, make a step left */
-#define L(p) ((p)->child[0])
-/** starting from p, make a step right */
-#define R(p) ((p)->child[1])
+/* Easily access subtree-parts */
+#include "child_mnemonic.h"
 
 #define SEEN(n)       (n)->bit_dag
 #define EDGE(n)       (n)->state_label

Index: map_ori_names.c
===================================================================
RCS file: /cvsroot/monetdb/pathfinder/compiler/algebra/map/map_ori_names.c,v
retrieving revision 1.29
retrieving revision 1.30
diff -u -d -r1.29 -r1.30
--- map_ori_names.c     6 Feb 2008 16:36:36 -0000       1.29
+++ map_ori_names.c     15 Feb 2008 12:16:00 -0000      1.30
@@ -43,13 +43,8 @@
 /** mnemonic algebra constructors */
 #include "logical_mnemonic.h"
 
-/*
- * Easily access subtree-parts.
- */
-/** starting from p, make a step left */
-#define L(p) ((p)->child[0])
-/** starting from p, make a step right */
-#define R(p) ((p)->child[1])
+/* Easily access subtree-parts */
+#include "child_mnemonic.h"
 
 #define SEEN(p) ((p)->bit_dag)
 

Index: map_unq_names.c
===================================================================
RCS file: /cvsroot/monetdb/pathfinder/compiler/algebra/map/map_unq_names.c,v
retrieving revision 1.28
retrieving revision 1.29
diff -u -d -r1.28 -r1.29
--- map_unq_names.c     6 Feb 2008 16:36:36 -0000       1.28
+++ map_unq_names.c     15 Feb 2008 12:16:00 -0000      1.29
@@ -44,13 +44,8 @@
 /** mnemonic algebra constructors */
 #include "logical_mnemonic.h"
 
-/*
- * Easily access subtree-parts.
- */
-/** starting from p, make a step left */
-#define L(p) ((p)->child[0])
-/** starting from p, make a step right */
-#define R(p) ((p)->child[1])
+/* Easily access subtree-parts */
+#include "child_mnemonic.h"
 
 #define SEEN(p) ((p)->bit_dag)
 

Index: resolve_proxy.c
===================================================================
RCS file: /cvsroot/monetdb/pathfinder/compiler/algebra/map/resolve_proxy.c,v
retrieving revision 1.10
retrieving revision 1.11
diff -u -d -r1.10 -r1.11
--- resolve_proxy.c     11 Jan 2008 10:46:57 -0000      1.10
+++ resolve_proxy.c     15 Feb 2008 12:16:00 -0000      1.11
@@ -39,15 +39,10 @@
 #include "properties.h"
 #include "mem.h"
 
-#define SEEN(p) ((p)->bit_dag)
+/* Easily access subtree-parts */
+#include "child_mnemonic.h"
 
-/*
- * Easily access subtree-parts.
- */
-/** starting from p, make a step left */
-#define L(p) ((p)->child[0])
-/** starting from p, make a step right */
-#define R(p) ((p)->child[1])
+#define SEEN(p) ((p)->bit_dag)
 
 static void
 resolve_proxies (PFla_op_t *p)


-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Monetdb-pf-checkins mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/monetdb-pf-checkins

Reply via email to