March 2001 - Cvs-nhc98

New implementation of System library, amenable to tracing.
by malcolm＠sparud.net 29 Mar '01

29 Mar '01

malcolm: Thu Mar 29 22:38:06 CEST 2001 Update of /usr/src/master/nhc/src/runtime/Builtin In directory hinken:/tmp/cvs-serv18594/src/runtime/Builtin Modified Files: cGetArgs.c cGetEnv.c cGetProgName.c Log Message: New implementation of System library, amenable to tracing.

1 0

New implementation of System library, amenable to tracing.
by malcolm＠sparud.net 29 Mar '01

29 Mar '01

malcolm: Thu Mar 29 22:38:04 CEST 2001 Update of /usr/src/master/nhc/include In directory hinken:/tmp/cvs-serv18594/include Modified Files: System.T.hi System.hi Log Message: New implementation of System library, amenable to tracing.

1 0

New implementation of System library, amenable to tracing.
by malcolm＠sparud.net 29 Mar '01

29 Mar '01

malcolm: Thu Mar 29 22:38:05 CEST 2001 Update of /usr/src/master/nhc/src/prelude/LowB In directory hinken:/tmp/cvs-serv18594/src/prelude/LowB Modified Files: LowSystem.hs Makefile PrimSystem.hs Log Message: New implementation of System library, amenable to tracing.

1 0

New implementation of System library, amenable to tracing.
by malcolm＠sparud.net 29 Mar '01

29 Mar '01

malcolm: Thu Mar 29 22:38:05 CEST 2001 Update of /usr/src/master/nhc/src/prelude/LowT In directory hinken:/tmp/cvs-serv18594/src/prelude/LowT Modified Files: LowSystem.hs Makefile PrimExitWith.hs PrimHGetChar.hs Log Message: New implementation of System library, amenable to tracing.

1 0

Improve infix notation in hat-stack output.
by malcolm＠sparud.net 29 Mar '01

29 Mar '01

malcolm: Thu Mar 29 19:43:01 CEST 2001 Update of /usr/src/master/nhc/src/tracer/hat In directory hinken:/tmp/cvs-serv18193 Modified Files: hat-stack.c utils.c utils.h Log Message: Improve infix notation in hat-stack output.

1 0

Minor tidy-up to columns in hat-check output.
by malcolm＠sparud.net 29 Mar '01

29 Mar '01

malcolm: Thu Mar 29 19:42:31 CEST 2001 Update of /usr/src/master/nhc/src/tracer/hat In directory hinken:/tmp/cvs-serv18173 Modified Files: hat-check.c Log Message: Minor tidy-up to columns in hat-check output.

1 0

Modified combinators and also slightly the transformation.
by olaf＠sparud.net 28 Mar '01

28 Mar '01

olaf: Wed Mar 28 20:33:58 CEST 2001 Update of /usr/src/master/nhc/src/prelude/PreludeDebug In directory hinken:/tmp/cvs-serv11925/src/prelude/PreludeDebug Modified Files: PreludeDebug.hs Log Message: Modified combinators and also slightly the transformation. Moved introduction of Sat's from functions side (fun?, prim?) to application side (ap?, rap?). - Removes previous bug that transformed program was too eager, e.g. in (True || h True) the application of h was evaluated. - Creation of Sat and App? trace nodes now next to each other. Integration of writing a Sat and an App? now straightforward. - Subsequent RHS-optimisation possible. Corrected bug in transformation of let. Expression after in is only in projective context if whole let is in projective context. This bug could lead to missing Hidden node in trusted code and too eager evaluation when the RHS-optimisation is used. Introduced separate combinator trif for if in projective context. The use of original tif could lead to too eager evaluation (never observed) and this would have become worse with the RHS-optimisation. RHS-optimisation: If an application (or if) is in projective context, then it doesn't need a Sat, because the application node only serves as a parent, but is never pointed to from an App? as an argument. So modified rap? and trif to not produce Sats. This halfs the number of SatCs and reduces runtime by ~10%.

1 0

Modified combinators and also slightly the transformation.
by olaf＠sparud.net 28 Mar '01

28 Mar '01

olaf: Wed Mar 28 20:33:57 CEST 2001 Update of /usr/src/master/nhc/src/compiler98 In directory hinken:/tmp/cvs-serv11925/src/compiler98 Modified Files: DbgId.hs DbgTrans.hs Log Message: Modified combinators and also slightly the transformation. Moved introduction of Sat's from functions side (fun?, prim?) to application side (ap?, rap?). - Removes previous bug that transformed program was too eager, e.g. in (True || h True) the application of h was evaluated. - Creation of Sat and App? trace nodes now next to each other. Integration of writing a Sat and an App? now straightforward. - Subsequent RHS-optimisation possible. Corrected bug in transformation of let. Expression after in is only in projective context if whole let is in projective context. This bug could lead to missing Hidden node in trusted code and too eager evaluation when the RHS-optimisation is used. Introduced separate combinator trif for if in projective context. The use of original tif could lead to too eager evaluation (never observed) and this would have become worse with the RHS-optimisation. RHS-optimisation: If an application (or if) is in projective context, then it doesn't need a Sat, because the application node only serves as a parent, but is never pointed to from an App? as an argument. So modified rap? and trif to not produce Sats. This halfs the number of SatCs and reduces runtime by ~10%.

1 0

Modified combinators and also slightly the transformation.
by olaf＠sparud.net 28 Mar '01

28 Mar '01

olaf: Wed Mar 28 20:33:56 CEST 2001 Update of /usr/src/master/nhc/include In directory hinken:/tmp/cvs-serv11925/include Modified Files: Prelude.T.hi Log Message: Modified combinators and also slightly the transformation. Moved introduction of Sat's from functions side (fun?, prim?) to application side (ap?, rap?). - Removes previous bug that transformed program was too eager, e.g. in (True || h True) the application of h was evaluated. - Creation of Sat and App? trace nodes now next to each other. Integration of writing a Sat and an App? now straightforward. - Subsequent RHS-optimisation possible. Corrected bug in transformation of let. Expression after in is only in projective context if whole let is in projective context. This bug could lead to missing Hidden node in trusted code and too eager evaluation when the RHS-optimisation is used. Introduced separate combinator trif for if in projective context. The use of original tif could lead to too eager evaluation (never observed) and this would have become worse with the RHS-optimisation. RHS-optimisation: If an application (or if) is in projective context, then it doesn't need a Sat, because the application node only serves as a parent, but is never pointed to from an App? as an argument. So modified rap? and trif to not produce Sats. This halfs the number of SatCs and reduces runtime by ~10%.

1 0

No log message
by colin＠sparud.net 28 Mar '01

28 Mar '01

colin: Wed Mar 28 18:58:07 CEST 2001 Update of /usr/src/master/nhc/src/tracer/hat In directory hinken:/tmp/cvs-serv11797 Modified Files: hat-check.c Log Message: Added -r option to report statistics about reachable nodes.

1 0