| commit | 386e4a5a86c7b02ab8d546771233b47a5d9d2a65 | |
| author | Nikodemus Siivola <nikodemus@random-state.net> | |
| Thu, 28 Jun 2007 23:13:45 +0000 (28 23:13 +0000) | ||
| committer | Nikodemus Siivola <nikodemus@random-state.net> | |
| Thu, 28 Jun 2007 23:13:45 +0000 (28 23:13 +0000) | ||
| tree | 06010111d64dce52c382bfdb80fb9cb20e0cd4a2 | treesnapshot (tar.gz zip) |
| parent | 65cccbb44b03207ce2fb73b29424a91a7d315189 | commitdiff |
1.0.7.3: non-consing GETHASH and (SETF GETHASH)
* Add a BLOCK for RETURN-FROM inside WITH-SPINLOCK-AND-WITHOUT-GCING,
so that the compiler will not need to generate code to verify the
tag existence at runtime -- which causes value-cell allocation.
(Performance regression since new WITHOUT-INTERRUPTS implementation.)
* Add a test-case to make sure basic hash-table functionality is non-consing.
* Add a BLOCK for RETURN-FROM inside WITH-SPINLOCK-AND-WITHOUT-GCING,
so that the compiler will not need to generate code to verify the
tag existence at runtime -- which causes value-cell allocation.
(Performance regression since new WITHOUT-INTERRUPTS implementation.)
* Add a test-case to make sure basic hash-table functionality is non-consing.
| NEWS | diffblobblamehistory | |
| src/code/target-hash-table.lisp | diffblobblamehistory | |
| tests/dynamic-extent.impure.lisp | diffblobblamehistory | |
| version.lisp-expr | diffblobblamehistory |