projects / mit-scheme.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 171faf3) | patch
Changed the cycle breaking code to use a hash-table to avoid
authorStephen Adams <edu/mit/csail/zurich/adams>
Wed, 6 Mar 1996 14:22:27 +0000 (14:22 +0000)
committerStephen Adams <edu/mit/csail/zurich/adams>
Wed, 6 Mar 1996 14:22:27 +0000 (14:22 +0000)
commit9bf29f0784972e5280e53595007c25cc5c95406c
tree9d7ec2d631e8a166eedaae1136ee5837979d7e6etree | snapshot
parent171faf389bb95ac94d72584fa92ef32ce59d0f74commit | diff
Changed the cycle breaking code to use a hash-table to avoid
quadratic behaviour.  The bulk of the problem was the code was both
slow and quadratic.  There was a higher order call to EQ?  in the
middle of a `map lookup', so 10-20% of SIMPLIFY's time was spent going
out of line to funcall EQ?

Added a comment on how to improve the cycle breaking code.
v8/src/compiler/midend/simplify.scm diff | blob | history
MIT/GNU Scheme, Pucked