projects / sbcl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 5896b1f) | patch
Smarter FIND-CONSTRAINT during constraint propagation
authorPaul Khuong <pvk@pvk.ca>
Sun, 12 Jun 2011 03:43:28 +0000 (23:43 -0400)
committerPaul Khuong <pvk@pvk.ca>
Sat, 18 Jun 2011 16:58:25 +0000 (12:58 -0400)
commitd2e1e27f0d424a22926bcfa1d831641529073bc3
tree817f4e4d3c47b72d46d3946b7dbae88f8728c4f4tree | snapshot
parent5896b1fd29648a6cc4beef194ab3c3d075983c66commit | diff
Smarter FIND-CONSTRAINT during constraint propagation

 Use hash tables instead of pure linear search for hash
 consing of constraints. Significantly reduces the pressure
 on conset iteration performance, and improves compilation
 speed of large functions.

 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