[commit: packages/hoopl] master, pr/coverage: Remove unused files (6aa3938)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/hoopl

On branches: master,pr/coverage
Link       : http://git.haskell.org/packages/hoopl.git/commitdiff/6aa393880e4a5d9997d92c528d102ae18ce447de

>---------------------------------------------------------------

commit 6aa393880e4a5d9997d92c528d102ae18ce447de
Author: Jan Stolarek <jan.stolarek at p.lodz.pl>
Date:   Mon Jan 18 17:37:34 2016 +0100

    Remove unused files


>---------------------------------------------------------------

6aa393880e4a5d9997d92c528d102ae18ce447de
 src/LOOPS     | 45 ---------------------------------------------
 src/mkfile    | 55 -------------------------------------------------------
 src/subdir.mk | 11 -----------
 3 files changed, 111 deletions(-)

diff --git a/src/LOOPS b/src/LOOPS
deleted file mode 100644
index ba72bf0..0000000
--- a/src/LOOPS
+++ /dev/null
@@ -1,45 +0,0 @@
-Thoughts about loop-based analyses
-==================================
-
-A loop analysis will want to have certain inputs, perhaps including
-
-  - A set of loop headers
-  - The dominance relation
-  - The reachability relation
-
-Let's assume
-
-  type Header  = Label
-  type Headers = LabelSet
-
-We can imagine doing loop analyses as follows:
-
-  - The dataflow fact is `Map Header f` where `f` is a lattice of
-    facts.
-
-  - If at a given point (edge) in the flow graph, header `H` is a key in the
-    map, then that point is reachable from `H`, and the fact stored in
-    the map is true on all paths that originate at `H` and terminate
-    at that point.
-
-  - If a given point (edge) in the flow graph cannot reach `H`, it is
-    safe (but not necessary) to delete `H` from the map.  It is
-    probably worth deleting `H` if possible, because if nothing else
-    it will keep the program from allocating one thunk per node `N`
-    that is reachable from `H` but does not reach `H`.
-
-  - If at a given point in the flow graph, `H` is not a key in the map,
-    then we expect either the point is not reachable from `H` or it
-    does not reach `H`.  That is, we want `H` to be a key at exactly
-    those points that are in a loop containing `H`.
-
-  - If a join function gets two maps and `H` is a key in just one of
-    them, the map without `H` can be ignored, since that edge is not
-    yet known to be reachable from `H`.  We can therefore use the
-    empty map as a bottom element.
-
-  - If `join` is the join function on `f`, the join function on maps
-    can *almost* be defined using `Data.Map.unionWithKey f`, but
-    unfortunately not, because of the beastly `ChangeFlag`.
-    A person like Chris Rice should explore a suitable higher-order
-    function for lifting joins into finite maps.
diff --git a/src/mkfile b/src/mkfile
deleted file mode 100644
index 01e2543..0000000
--- a/src/mkfile
+++ /dev/null
@@ -1,55 +0,0 @@
-PKG=hoopl
-SRC=Graph Label GraphUtil Fuel MkGraph Dataflow
-VERSION=`awk '$1 == "Version:" { print $2 }' $PKG.cabal`
-HOOPL=Compiler/Hoopl
-HS=${SRC:%=$HOOPL/%.hs}
-O=${SRC:%=$HOOPL/%.o}
-CABAL=hoopl
-CONFIG=.config.$CABAL
-
-all:V: $O hoopl.pdf
-
-dist:V: hoopl.pdf
-	cabal sdist
-
-hoopl.pdf: ../paper/dfopt.pdf
-	cp -a -v $prereq $target
-
-test:V: 
-	cabal install --enable-documentation
-	(cd ../testing && mk test)
-
-install:V: $CONFIG
-	cabal install --enable-documentation
-
-build:V: $CONFIG
-	cabal build
-
-check:V: $CONFIG
-	cabal check
-
-upload:V: hoopl.pdf $CONFIG
-	cabal build
-	cabal sdist
-	cabal upload dist/$PKG-$VERSION.tar.gz
-
-config:V: $CONFIG
-
-.config.&:D: &.cabal
-	cabal configure --user > $target
-
-clean:V:
-	rm -f `find [A-Z]* ../testing -name '*.o' -o '*.hi'`
-
-%.pdf: %.tex
-	(cd `dirname $prereq`; mk `basename $target`)
-
-
-%.o: %.hs
-	ghc --make -c $prereq
-
-
-clean:V:
-	rm -f $HOOPL/*.o
-	rm -f $HOOPL/*.hi
-	rm -f *~ $HOOPL/*~
diff --git a/src/subdir.mk b/src/subdir.mk
deleted file mode 100644
index 04b65b6..0000000
--- a/src/subdir.mk
+++ /dev/null
@@ -1,11 +0,0 @@
-
-all:V: obj
-
-obj:V:
-	ghc -i$TOP --make *.hs
-
-clean:V:
-	rm -f *.o *.hi *~
-
-test install build check:V:
-	(cd $TOP && mk $target)