[prev in list] [next in list] [prev in thread] [next in thread] 

List:       nhc-cvs
Subject:    [cvs-nhc98] cvs commit: hat/src/hattools hat-check.c
From:       olaf () haskell ! org
Date:       2004-10-15 15:41:50
Message-ID: 200410151541.i9FFfoPu012889 () glass ! cse ! ogi ! edu
[Download RAW message or body]

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


[prev in list] [next in list] [prev in thread] [next in thread]