Re: LW compiler optimizations
"Yuri Davidovsky (as work at disclosure dot ie)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
> On 13 Jan 2025, at 21:19, Martin Simmons <[email protected]> wrote: > > Step 4 has to allocate an object for a type that is not immediate, so that can > make the immediate types faster. It all depends on the ratio of extracting > compared to wrapping. > > Also, step 1 for a heap allocated object might involve reading some type > information from heap as well as checking the tag bits. Very interesting. Never really thought before on how dynamic languages achieve their typeless nature, it gives a good perspective on what happens below the bonnet and why such languages tend to have notably lower performance. With that said, it is still quite remarkable that we have an option of typed arrays that helps to cut through these checks. I do not know of other dynamic languages where it is possible. _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html