4 commits

Author	SHA1	Message	Date
Roland Paterson-Jones	7a19de5cf4	Simplify int mul/udiv/urem of 2^N into shl/shr/and. ... Passes the "standard" test suite. (cproc bootstrap, hare[c] make test, roland units, linpack/coremark run) However linpack benchmark is now notably slower. Coremark is ~2% faster. As noticed before, linmark timing is dubious, and maybe my cheap (AMD) laptop prefers mul to shl.	2024-06-16 21:42:17 +02:00
Quentin Carbonneaux	26c1c30b7d	new blit instruction	2022-12-14 23:18:26 +01:00
Quentin Carbonneaux	2c2db15995	do sign/zero extensions removal in copy.c	2017-02-25 15:14:12 -05:00
Quentin Carbonneaux	df61decee5	start a new simplification pass	2017-02-24 15:52:56 -05:00