* optimization: implemented multiplication as a modular
(UNSIGNED-BYTE 32) operation on the x86 backend.
* optimization: SEARCH on simple-base-strings can now be open-coded.
(see also contrib/compiler-extras.lisp for inspiration for
teaching the compiler about the Boyer-Moore algorithm).
* optimization: implemented multiplication as a modular
(UNSIGNED-BYTE 32) operation on the x86 backend.
* optimization: SEARCH on simple-base-strings can now be open-coded.
(see also contrib/compiler-extras.lisp for inspiration for
teaching the compiler about the Boyer-Moore algorithm).