qbe

Internal scc patchset buffer for QBE
Log | Files | Refs | README | LICENSE

commit d6fb05a233e2ef22cd569418fe3714fc908a7b08
parent 3302e31534f2d2bbb4a5be7dcf9c49eede2cfd7a
Author: Quentin Carbonneaux <quentin.carbonneaux@yale.edu>
Date:   Fri, 27 Nov 2015 11:32:38 -0500

disable optimizations

Diffstat:
Mlisc/Makefile | 2+-
Mlisc/main.c | 2++
Mlisc/ssa.c | 4++++
3 files changed, 7 insertions(+), 1 deletion(-)

diff --git a/lisc/Makefile b/lisc/Makefile @@ -1,5 +1,5 @@ BIN = lisc -OBJ = main.o util.o parse.o mem.o ssa.o copy.o live.o isel.o spill.o rega.o emit.o +OBJ = main.o util.o parse.o ssa.o live.o isel.o spill.o rega.o emit.o CFLAGS = -Wall -Wextra -std=c99 -g -pedantic diff --git a/lisc/main.c b/lisc/main.c @@ -53,11 +53,13 @@ func(Fn *fn) fillrpo(fn); fillpreds(fn); filluse(fn); +#if 0 memopt(fn); ssa(fn); filluse(fn); copy(fn); filluse(fn); +#endif isel(fn); filllive(fn); fillcost(fn); diff --git a/lisc/ssa.c b/lisc/ssa.c @@ -166,6 +166,8 @@ fillrpo(Fn *f) } } +#if 0 + /* for dominators computation, read * "A Simple, Fast Dominance Algorithm" * by K. Cooper, T. Harvey, and K. Kennedy. @@ -507,3 +509,5 @@ ssa(Fn *fn) printfn(fn, stderr); } } + +#endif