common-lisp/sbcl.sbcl

Fork 0

mirror of git://git.code.sf.net/p/sbcl/sbcl synced 2026-09-10 07:26:40 -04:00

Commit graph

Author	SHA1	Message	Date
Douglas Katzman	0c802a9a98	x86-64: shorten code size for a few word-sized math vops * Adjust register lifetimes to possibly eliminate a physical move * Call out to an asm routine for consing new bignums * Never overallocate the bignum; use the exact request size * Insert allocation profiler instrumentation as needed * Add a vop for word x word -> integer	2023-03-06 00:25:54 -05:00
Stas Boukarev	9f926c257f	Make a test 32-bit compatible.	2022-04-30 20:35:35 +03:00
Douglas Katzman	0ece86aa87	Heap walk safely around */signed vop result In general any cons with most-positive-word in the car. I do like the idea of using -1 because it is unambiguously a filler where (0 . 0) is possibly a real cons.	2022-04-30 10:59:07 -04:00

Author

SHA1

Message

Date

Douglas Katzman

0c802a9a98

x86-64: shorten code size for a few word-sized math vops

* Adjust register lifetimes to possibly eliminate a physical move
* Call out to an asm routine for consing new bignums
* Never overallocate the bignum; use the exact request size
* Insert allocation profiler instrumentation as needed
* Add a vop for word x word -> integer

2023-03-06 00:25:54 -05:00

Stas Boukarev

9f926c257f

Make a test 32-bit compatible.

2022-04-30 20:35:35 +03:00

Douglas Katzman

0ece86aa87

Heap walk safely around */signed vop result

In general any cons with most-positive-word in the car.
I do like the idea of using -1 because it is unambiguously a filler
where (0 . 0) is possibly a real cons.

2022-04-30 10:59:07 -04:00

3 commits