## Process this file with automake to produce Makefile.in
-# $Id: Makefile.am 618 2003-11-13 09:39:28Z stefan $
+# $Id: Makefile.am 1141 2004-06-05 23:19:24Z twisti $
-INCLUDES = -I$(top_srcdir)/jit/@ARCH_DIR@ -I$(top_srcdir)/jit
+INCLUDES = -I$(top_srcdir) -I$(top_srcdir)/jit/@ARCH_DIR@
EXTRA_DIST = \
graph.c \
bounds are never violated. The function to call is
optimize_loops().
- $Id: analyze.c 1067 2004-05-18 10:25:51Z stefan $
+ $Id: analyze.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
-#include "analyze.h"
+#include "jit/loop/analyze.h"
#include "jit/jit.h"
-#include "loop.h"
-#include "graph.h"
-#include "tracing.h"
+#include "jit/loop/loop.h"
+#include "jit/loop/graph.h"
+#include "jit/loop/tracing.h"
#include "toolbox/logging.h"
#include "toolbox/memory.h"
Contains the functions which build a list, that represents the
control flow graph of the procedure, that is being analyzed.
- $Id: graph.c 576 2003-11-09 17:31:38Z twisti $
+ $Id: graph.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdio.h>
-#include "graph.h"
-#include "loop.h"
-#include "jit.h"
+#include "jit/jit.h"
+#include "jit/loop/graph.h"
+#include "jit/loop/loop.h"
#include "toolbox/memory.h"
algorithm that uses dominator trees (found eg. in modern compiler
implementation by a.w. appel)
- $Id: loop.c 1067 2004-05-18 10:25:51Z stefan $
+ $Id: loop.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdlib.h>
#include "global.h"
#include "jit/jit.h"
-#include "loop.h"
-#include "graph.h"
-#include "tracing.h"
+#include "jit/loop/loop.h"
+#include "jit/loop/graph.h"
+#include "jit/loop/tracing.h"
#include "toolbox/logging.h"
#include "toolbox/memory.h"
instruction. For more details see function tracing(basicblock, int,
int) below.
- $Id: tracing.c 576 2003-11-09 17:31:38Z twisti $
+ $Id: tracing.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdio.h>
-#include "tracing.h"
-#include "loop.h"
+#include "jit/loop/tracing.h"
+#include "jit/loop/loop.h"
#include "toolbox/memory.h"
Authors: Christian Thalinger
- $Id: tracing.h 665 2003-11-21 18:36:43Z jowenn $
+ $Id: tracing.h 1141 2004-06-05 23:19:24Z twisti $
*/
#ifndef _TRACING_H
#define _TRACING_H
-#include "jit.h"
+#include "jit/jit.h"
/*
This struct is needed to record the source of operands of intermediate code
Authors: Reinhard Grafl
- $Id: memory.c 1067 2004-05-18 10:25:51Z stefan $
+ $Id: memory.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <unistd.h>
#include "global.h"
-#include "logging.h"
-#include "memory.h"
+#include "toolbox/logging.h"
+#include "toolbox/memory.h"
/********* general types, variables and auxiliary functions *********/
## Process this file with automake to produce Makefile.in
-# $Id: Makefile.am 1067 2004-05-18 10:25:51Z stefan $
+# $Id: Makefile.am 1141 2004-06-05 23:19:24Z twisti $
noinst_LIBRARIES = libtoolbox.a
list.c \
list.h
-INCLUDES = -I$(top_srcdir) -I$(top_srcdir)/jit -I$(top_srcdir)/jit/@ARCH_DIR@
+INCLUDES = -I$(top_srcdir) -I$(top_srcdir)/jit/@ARCH_DIR@
## Local variables:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
-#include "avl.h"
+#include "toolbox/avl.h"
/* Creates and returns a new table
with comparison function |compare| using parameter |param|
Authors: Reinhard Grafl
- $Id: chain.c 684 2003-12-02 16:50:17Z twisti $
+ $Id: chain.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <assert.h>
#include "global.h"
-#include "memory.h"
-#include "chain.h"
+#include "toolbox/memory.h"
+#include "toolbox/chain.h"
chain *chain_new()
Authors: Reinhard Grafl
- $Id: list.c 684 2003-12-02 16:50:17Z twisti $
+ $Id: list.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <assert.h>
#include "global.h"
-#include "list.h"
+#include "toolbox/list.h"
void list_init(list *l, int nodeoffset)
Authors: Reinhard Grafl
- $Id: tree.c 684 2003-12-02 16:50:17Z twisti $
+ $Id: tree.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <assert.h>
#include "global.h"
-#include "memory.h"
-#include "tree.h"
+#include "toolbox/memory.h"
+#include "toolbox/tree.h"
tree *tree_new(treeelementcomperator comperator)
## Process this file with automake to produce Makefile.in
-# $Id: Makefile.am 618 2003-11-13 09:39:28Z stefan $
+# $Id: Makefile.am 1141 2004-06-05 23:19:24Z twisti $
-INCLUDES = -I$(top_srcdir)/jit/@ARCH_DIR@ -I$(top_srcdir)/jit
+INCLUDES = -I$(top_srcdir) -I$(top_srcdir)/jit/@ARCH_DIR@
EXTRA_DIST = \
graph.c \
bounds are never violated. The function to call is
optimize_loops().
- $Id: analyze.c 1067 2004-05-18 10:25:51Z stefan $
+ $Id: analyze.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
-#include "analyze.h"
+#include "jit/loop/analyze.h"
#include "jit/jit.h"
-#include "loop.h"
-#include "graph.h"
-#include "tracing.h"
+#include "jit/loop/loop.h"
+#include "jit/loop/graph.h"
+#include "jit/loop/tracing.h"
#include "toolbox/logging.h"
#include "toolbox/memory.h"
Contains the functions which build a list, that represents the
control flow graph of the procedure, that is being analyzed.
- $Id: graph.c 576 2003-11-09 17:31:38Z twisti $
+ $Id: graph.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdio.h>
-#include "graph.h"
-#include "loop.h"
-#include "jit.h"
+#include "jit/jit.h"
+#include "jit/loop/graph.h"
+#include "jit/loop/loop.h"
#include "toolbox/memory.h"
algorithm that uses dominator trees (found eg. in modern compiler
implementation by a.w. appel)
- $Id: loop.c 1067 2004-05-18 10:25:51Z stefan $
+ $Id: loop.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdlib.h>
#include "global.h"
#include "jit/jit.h"
-#include "loop.h"
-#include "graph.h"
-#include "tracing.h"
+#include "jit/loop/loop.h"
+#include "jit/loop/graph.h"
+#include "jit/loop/tracing.h"
#include "toolbox/logging.h"
#include "toolbox/memory.h"
instruction. For more details see function tracing(basicblock, int,
int) below.
- $Id: tracing.c 576 2003-11-09 17:31:38Z twisti $
+ $Id: tracing.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <stdio.h>
-#include "tracing.h"
-#include "loop.h"
+#include "jit/loop/tracing.h"
+#include "jit/loop/loop.h"
#include "toolbox/memory.h"
Authors: Christian Thalinger
- $Id: tracing.h 665 2003-11-21 18:36:43Z jowenn $
+ $Id: tracing.h 1141 2004-06-05 23:19:24Z twisti $
*/
#ifndef _TRACING_H
#define _TRACING_H
-#include "jit.h"
+#include "jit/jit.h"
/*
This struct is needed to record the source of operands of intermediate code
## Process this file with automake to produce Makefile.in
-# $Id: Makefile.am 1067 2004-05-18 10:25:51Z stefan $
+# $Id: Makefile.am 1141 2004-06-05 23:19:24Z twisti $
noinst_LIBRARIES = libtoolbox.a
list.c \
list.h
-INCLUDES = -I$(top_srcdir) -I$(top_srcdir)/jit -I$(top_srcdir)/jit/@ARCH_DIR@
+INCLUDES = -I$(top_srcdir) -I$(top_srcdir)/jit/@ARCH_DIR@
## Local variables:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
-#include "avl.h"
+#include "toolbox/avl.h"
/* Creates and returns a new table
with comparison function |compare| using parameter |param|
Authors: Reinhard Grafl
- $Id: chain.c 684 2003-12-02 16:50:17Z twisti $
+ $Id: chain.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <assert.h>
#include "global.h"
-#include "memory.h"
-#include "chain.h"
+#include "toolbox/memory.h"
+#include "toolbox/chain.h"
chain *chain_new()
Authors: Reinhard Grafl
- $Id: list.c 684 2003-12-02 16:50:17Z twisti $
+ $Id: list.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <assert.h>
#include "global.h"
-#include "list.h"
+#include "toolbox/list.h"
void list_init(list *l, int nodeoffset)
Authors: Reinhard Grafl
- $Id: memory.c 1067 2004-05-18 10:25:51Z stefan $
+ $Id: memory.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <unistd.h>
#include "global.h"
-#include "logging.h"
-#include "memory.h"
+#include "toolbox/logging.h"
+#include "toolbox/memory.h"
/********* general types, variables and auxiliary functions *********/
Authors: Reinhard Grafl
- $Id: tree.c 684 2003-12-02 16:50:17Z twisti $
+ $Id: tree.c 1141 2004-06-05 23:19:24Z twisti $
*/
#include <assert.h>
#include "global.h"
-#include "memory.h"
-#include "tree.h"
+#include "toolbox/memory.h"
+#include "toolbox/tree.h"
tree *tree_new(treeelementcomperator comperator)