projects / sbcl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d2e1e27) | patch
Faster iteration through a variable's constraints during constraint propagation
authorPaul Khuong <pvk@pvk.ca>
Sat, 18 Jun 2011 03:18:01 +0000 (23:18 -0400)
committerPaul Khuong <pvk@pvk.ca>
Sat, 18 Jun 2011 16:59:07 +0000 (12:59 -0400)
commit8f31e3b32926c61b13240c447637d4bb9af10cdc
tree56933a855f039a098cb87fe2f8c37552e6a03e67tree | snapshot
parentd2e1e27f0d424a22926bcfa1d831641529073bc3commit | diff
Faster iteration through a variable's constraints during constraint propagation

 Store indices of constraints by usage.  Practically eliminates the dependence
 on conset intersection/iteration performance.  Improves compilation speeds,
 especially for large functions.

 Also improves lp#792363 and lp#394206.
src/compiler/constraint.lisp diff | blob | history
src/compiler/node.lisp diff | blob | history
Mirror of Steel Bank Common Lisp SBCL's official repository