October 2004 - Cvs-nhc98

cvs commit: nhc98/script nhc98.inst
by Malcolm Wallace 27 Oct '04

27 Oct '04

malcolm 2004/10/27 03:06:02 PDT Modified files: script nhc98.inst Log: Check for {-# OPTIONS_NHC98 ... #-} in addition to OPTIONS_COMPILE. Revision Changes Path 1.52 +2 -1 nhc98/script/nhc98.inst

1 0

cvs commit: cpphs cpphs.hugs
by Malcolm Wallace 27 Oct '04

27 Oct '04

malcolm 2004/10/27 02:57:29 PDT Modified files: . cpphs.hugs Log: Hugs doesn't understand #line droppings, so remove them. Revision Changes Path 1.3 +1 -1 cpphs/cpphs.hugs

1 0

cvs commit: hat/src/hatlib hat-c.h
by Malcolm Wallace 19 Oct '04

19 Oct '04

malcolm 2004/10/19 01:40:24 PDT Modified files: src/hatlib hat-c.h Log: Prototype for mkListCons. Revision Changes Path 1.21 +4 -0 hat/src/hatlib/hat-c.h

1 0

cvs commit: hat/src/hattools HatExplore.hs Makefile
by olaf＠haskell.org 15 Oct '04

15 Oct '04

olaf 2004/10/15 11:03:14 PDT Modified files: src/hattools HatExplore.hs Makefile Log: Renamed hat-source -> hat-explore. Revision Changes Path 1.16 +1 -1 hat/src/hattools/HatExplore.hs 1.71 +5 -5 hat/src/hattools/Makefile

1 0

cvs commit: hat configure
by olaf＠haskell.org 15 Oct '04

15 Oct '04

olaf 2004/10/15 11:03:12 PDT Modified files: . configure Log: Renamed hat-source -> hat-explore. Revision Changes Path 1.19 +1 -1 hat/configure

1 0

cvs commit: hat/src/hattools HatSource.hs LowLevel.hs artutils.c
by olaf＠haskell.org 15 Oct '04

15 Oct '04

olaf 2004/10/15 10:42:36 PDT Modified files: src/hattools HatSource.hs LowLevel.hs artutils.c Log: Now hat-source uses new information about children of Hidden nodes. So now all parts of the EDT can be reached with hat-source. When the current redex has no location information, but there is a parent, then that is highlighted in the source window. Important when stepping from trusted higher-order function to applications of suspected children, which do not have location info, because they are applied in body of trusted function. Revision Changes Path 1.15 +23 -14 hat/src/hattools/HatSource.hs 1.26 +10 -0 hat/src/hattools/LowLevel.hs 1.28 +12 -1 hat/src/hattools/artutils.c

1 0

cvs commit: hat/src/hattools hat-check.c
by olaf＠haskell.org 15 Oct '04

15 Oct '04

olaf 2004/10/15 08:41:50 PDT Modified files: src/hattools hat-check.c Log: Extended tracing to write extended fileformat, i.e. children of Hidden nodes. Nicely only a tiny change is needed in Hat.hs, calling the new recordChild function in fun_i combinators when the parent is hidden. So the additional child information only costs time when there are such children. Most changes in hat-c.c. New buffer for every Hidden node that has children (but not those that do not). This buffer enables simple reading and updating of the child pointer of a Hidden. The buffer is only written at termination time, so unfortunately the space requirements of a traced program are no longer proportional to that of an untraced one. However, I believe that in practise the buffer will never be large. The buffer is currently a linked list of arrays. A tree structure would allow faster lookup, but the existing FiniteMap is unsuitable (only for pointers). hat-check has been modified to make appropriate checks. Revision Changes Path 1.28 +3 -3 hat/src/hattools/hat-check.c

1 0

cvs commit: hat/src/hatlib/Hat Hat.hs
by olaf＠haskell.org 15 Oct '04

15 Oct '04

olaf 2004/10/15 08:41:49 PDT Modified files: src/hatlib/Hat Hat.hs Log: Extended tracing to write extended fileformat, i.e. children of Hidden nodes. Nicely only a tiny change is needed in Hat.hs, calling the new recordChild function in fun_i combinators when the parent is hidden. So the additional child information only costs time when there are such children. Most changes in hat-c.c. New buffer for every Hidden node that has children (but not those that do not). This buffer enables simple reading and updating of the child pointer of a Hidden. The buffer is only written at termination time, so unfortunately the space requirements of a traced program are no longer proportional to that of an untraced one. However, I believe that in practise the buffer will never be large. The buffer is currently a linked list of arrays. A tree structure would allow faster lookup, but the existing FiniteMap is unsuitable (only for pointers). hat-check has been modified to make appropriate checks. Revision Changes Path 1.13 +33 -15 hat/src/hatlib/Hat/Hat.hs

1 0

cvs commit: hat/src/hatlib hat-c.c hat-c.h
by olaf＠haskell.org 15 Oct '04

15 Oct '04

olaf 2004/10/15 08:41:47 PDT Modified files: src/hatlib hat-c.c hat-c.h Log: Extended tracing to write extended fileformat, i.e. children of Hidden nodes. Nicely only a tiny change is needed in Hat.hs, calling the new recordChild function in fun_i combinators when the parent is hidden. So the additional child information only costs time when there are such children. Most changes in hat-c.c. New buffer for every Hidden node that has children (but not those that do not). This buffer enables simple reading and updating of the child pointer of a Hidden. The buffer is only written at termination time, so unfortunately the space requirements of a traced program are no longer proportional to that of an untraced one. However, I believe that in practise the buffer will never be large. The buffer is currently a linked list of arrays. A tree structure would allow faster lookup, but the existing FiniteMap is unsuitable (only for pointers). hat-check has been modified to make appropriate checks. Revision Changes Path 1.39 +109 -7 hat/src/hatlib/hat-c.c 1.20 +3 -0 hat/src/hatlib/hat-c.h

1 0

cvs commit: cpphs Tokenise.hs
by Malcolm Wallace 14 Oct '04

14 Oct '04

malcolm 2004/10/14 06:48:20 PDT Modified files: . Tokenise.hs Log: Delete obsolete code. Revision Changes Path 1.14 +0 -48 cpphs/Tokenise.hs

1 0