- Cvs-nhc98 - Haskell.org

patch applied (hat): Don' t crash if a list of fieldname/value pairs is empty.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu Nov 25 09:52:55 PST 2004 malcolm * Don't crash if a list of fieldname/value pairs is empty. M ./src/hattools/SExp.hs +1

1 0

patch applied (hat): Robustify ghc detection on MacOS X and Cygwin.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu Nov 25 05:16:20 PST 2004 malcolm * Robustify ghc detection on MacOS X and Cygwin. M ./script/confhc-hat -3 +4

1 0

patch applied (hat): When counting function applications, include over-saturated apps in the count.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri Nov 19 08:04:19 PST 2004 malcolm * When counting function applications, include over-saturated apps in the count. M ./src/hattools/hat-names.c -3 +3

1 0

patch applied (hat): Extended hat-explore: if the computation aborted with a run-time error, then hat-explore starts now by default at the reduction causing the error, not the reduction of main.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu Nov 4 11:50:38 PST 2004 olaf * Extended hat-explore: if the computation aborted with a run-time error, then hat-explore starts now by default at the reduction causing the error, not the reduction of main. Thus hat-explore covers hat-trail. M ./src/hattools/HatExplore.hs -7 +11

1 0

patch applied (hat): Numerous small changes and bugfixes.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Thu Nov 4 11:41:31 PST 2004 olaf * Numerous small changes and bugfixes. Now all tools (execpt hat-anim) can call hat-explore and vice versa. Hat-explore always shows the full stack, even if started with specific redex. (So it nearly includes hat-trail.) Stack elements are numbered for better orientation in deep stack. M ./src/hattools/CommonUI.hs -1 +4 M ./src/hattools/HatDetect.hs -2 +15 M ./src/hattools/HatExplore.hs -67 +135 M ./src/hattools/HatObserve.hs -4 +18 M ./src/hattools/HatTrail.hs -1 +6

1 0

patch applied (hat): Prototype for mkListCons.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Tue Oct 19 01:40:24 PDT 2004 malcolm * Prototype for mkListCons. M ./src/hatlib/hat-c.h +4

1 0

patch applied (hat): Renamed hat-source -> hat-explore.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri Oct 15 11:03:14 PDT 2004 olaf * Renamed hat-source -> hat-explore. M ./configure -1 +1 M ./src/hattools/HatExplore.hs -1 +1 M ./src/hattools/Makefile -5 +5

1 0

patch applied (hat): Now hat-source uses new information about children of Hidden nodes.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri Oct 15 10:42:35 PDT 2004 olaf * 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. M ./src/hattools/HatExplore.hs -14 +23 M ./src/hattools/LowLevel.hs +10 M ./src/hattools/artutils.c -1 +12

1 0

patch applied (hat): Extended tracing to write extended fileformat, i.e. children of Hidden nodes.
by Malcolm Wallace 10 Oct '06

10 Oct '06

Fri Oct 15 08:41:49 PDT 2004 olaf * 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. M ./src/hatlib/Hat/Hat.hs -15 +33 M ./src/hatlib/hat-c.c -7 +109 M ./src/hatlib/hat-c.h +3 M ./src/hattools/hat-check.c -3 +3

1 0

patch applied (hat): Extended fileformat:
by Malcolm Wallace 10 Oct '06

10 Oct '06

Wed Oct 13 12:19:43 PDT 2004 olaf * Extended fileformat: New node ListCons has to fields: the element pointer and the tail pointer. Extended Hidden node with an extra child pointer, that shall point to a ListCons or is NULL. Modified basic libraries and tools, so that they deal with changes. New nodes currently ignored by all tools, except hat-check (but no particular new check). For the moment a bogus ListCons is written with every Hidden node, to test if tools can deal with the node. Has to be removed later again. Otherwise ListCons and additional Hidden node field are not written yet while tracing. M ./include/art.h +2 M ./src/hatlib/hat-c.c -1 +17 M ./src/hattools/LowLevel.hs +4 M ./src/hattools/artutils.c -1 +5 M ./src/hattools/hat-check.c -8 +23

1 0