search for: sbcl

Yes, indeed! The SBCL lisp compiler (not llvm based) used to emit functions which would return either via ret to the usual instruction after the call, or else load the return-address from the stack, then jump 2 bytes later (which would skip over either a nop or a short jmp at original target location). Which one it used...

...ch as R or matlab? Almost not at all, though there are a few holdouts. On a related note, I've been doing some interesting things with a branch of LispStat for CommonLisp. It'll be more interesting when R gets embedded (now it's back on topic). Rumor has it that R is embedded within SBCL, which makes for an interesting distributed computing environment. It's a nice system, it still works, it's got some reasonable (though old) tools, numerically it needs a good bit of work and updating, but for a 17-year old program, it works quite nicely. Dynamic graphics are comparable t...

With regard to Bartlett-style collectors, they are also used in CMUCL/SBCL, OpenDylan, and various products based on Ravenbrook's Memory Pool System. Also, while Mono doesn't use a Bartlett-style collector, it does support pinning objects referenced from ambiguous stack roots, in an otherwise copying collector. While ITA has expressed concerns with SBCL's GC,...

Hi, This is just to report about the "alignment check: 0000 [#1] SMP" kernel messages in one of my build system (domU) running Scientific Linux 6.1. I am compiling/rpm package for sbcl (http://sbcl.sourceforge.net/) in my build system (domU) and hit the following kernel messages although the domU in question still running and compilation still in progress. I have done some searching about this and it is all related to domU kernels 2.6.32 such as: http://kerneltrap.org/mailarchiv...

In working on an LLVM backend for SBCL (a lisp compiler), there are certain sequences of code that must be atomic with regards to async signals. So, for example, on x86, a single SUB on a memory location should be used, not a load/sub/store sequence. LLVM's IR doesn't currently have any way to express this kind of constr...

On 7/23/19 8:42 PM, John McCall via llvm-dev wrote: > > On 21 Jul 2019, at 12:29, James Y Knight via llvm-dev wrote: > > Yes, indeed! > > The SBCL lisp compiler (not llvm based) used to emit functions > which would > return either via ret to the usual instruction after the call, or > else load > the return-address from the stack, then jump 2 bytes later (which > would > skip over either a nop or a sho...

thomas weidner wrote: > Hello, > > i want to implement a common lisp subset using llvm for fun. Out of curiousity, for which CL implementation is this targeted? sbcl? Or something you're rolling? The reason why I ask is that I expressed an outrageous opinion at Supercomputing back in November, to wit, that CL is probably the best language suited for today's multicore problems... but I don't have the time to hack one of the current implementations t...

...isps as well (CLISP), using svn version 37840 (this morning, Seattle time) for R-2-3-patches. I've not tried Thomas' suggested fixes, as I'm hesistant to go down the road of fixing R in such a way that would require constant patching. (so for those counting, neither CLISP, CMUCL, nor SBCL can embed R-2-3-patches using CFFI on (2 distros of) i386 Linux; all abort and offer to dump core nearly instantly after initialization). All work with R-2-2-patches. For me, this is a serious bug. I suppose other people can define it in other ways, using terms such as "feature" or &...

Responding to the original email... On Sun, Jan 3, 2010 at 10:10 PM, James Y Knight <foom at fuhm.net> wrote: > In working on an LLVM backend for SBCL (a lisp compiler), there are > certain sequences of code that must be atomic with regards to async > signals. Can you define exactly what 'atomic with regards to async signals' this entails? Your descriptions led me to think you may mean something other than the POSIX definition, but...

On Jan 4, 2010, at 4:35 AM, Chandler Carruth wrote: > Responding to the original email... > > On Sun, Jan 3, 2010 at 10:10 PM, James Y Knight <foom at fuhm.net> wrote: >> In working on an LLVM backend for SBCL (a lisp compiler), there are >> certain sequences of code that must be atomic with regards to async >> signals. > > Can you define exactly what 'atomic with regards to async signals' > this entails? Your descriptions led me to think you may mean something > other tha...

...News and articles from around the web LLVM has been [accepted](http://blog.llvm.org/2018/02/llvm-accepted-to-2018-google-summer-of.html) to Google Summer of Code 2018. Student applications open on March 12th. Martin Cracauer has written a blog post on [LLVM's garbage collection facilities and SBCL's generational GC](https://medium.com/@MartinCracauer/llvms-garbage-collection-facilities-and-sbcl-s-generational-gc-a13eedfb1b31). The paper [Crellvm: Verified Credible Compilation for LLVM](http://sf.snu.ac.kr/crellvm/) has been accepted for PLDI 2018, and may be of interest to many LLVM Wee...

Hello! I'm interested in using LLVM as a target for a compiler I've written in common lisp (SBCL). While I looked at perhaps wrapping the LLVM C++ interface, wrapping C++ in, well, anything not C++ is a pain. Someone on IRC mentioned that they didn't think I'd miss out on any functionality by directly emitting IR, but suggested I query the list. Do I miss out on any optimizations or...

On Jan 3, 2010, at 10:10 PM, James Y Knight wrote: > In working on an LLVM backend for SBCL (a lisp compiler), there are > certain sequences of code that must be atomic with regards to async > signals. So, for example, on x86, a single SUB on a memory location > should be used, not a load/sub/store sequence. LLVM's IR doesn't > currently have any way to express...

Hello, i want to implement a common lisp subset using llvm for fun. This requires the use of a garbage collector. I read the docs, but many things are still unclear to me. 1. how are collectors supposed to find all living objects? there is llvm.gcroot for marking objects on the stack,but how do collectors crawl heap objects? I did not see a way to provide custom mark functions. Are

...it does not share the stack frame, etc. I'd describe this more as two threads of mutually exclusive execution or some such. I'm not familiar with what synchronization occurs as part of the interrupt process, but I'd verify it before making too many assumptions. > This sequence that SBCL does today with its internal codegen is basically > like: > MOV <pseudo_atomic>, 1 > [[do allocation, fill in object, etc]] > XOR <pseudo_atomic>, 1 > JEQ continue > <<call do_pending_interrupt>> > continue: > ... > > The important things here a...

...is a list of packages that fails: audio/libofa databases/akonadi devel/binutils devel/kBuild devel/libftdi devel/libplist devel/qca devel/qt4-qdbusviewer devel/qt4-script emulators/qemu-devel graphics/cairo graphics/graphite2 graphics/libfpx graphics/opencv-core graphics/podofo graphics/vigra lang/sbcl math/cln net-im/libmsn net-p2p/libtorrent net/hupnp net/ns3 net/xmlrpc-c-devel science/openbabel security/pinentry sysutils/fusefs-kmod sysutils/synergy textproc/clucene x11/nvidia-driver where at least ns3 can be ignored ( I created that port myself ). I think nvidia-driver and fusefs-kmod now fa...

Hello! I'm interested in using LLVM as a target for a compiler I've written in common lisp (SBCL). While I looked at perhaps wrapping the LLVM C++ interface, wrapping C++ in, well, anything not C++ is a pain. Someone on IRC mentioned that they didn't think I'd miss out on any functionality by directly emitting IR, but suggested I query the list. Do I miss out on any optimizations or...

I''m looking to write a javascript heavy clientside program with a something serverside backend that connects to the free maxima math program. I have extensive knowledge of ruby on rails, so I would prefer to call Maxima with ruby, but I don''t know if this is even possible. Its fairly easy to call Maxima (with a lisp implementation) using ANSI C, it is a little less easy to

Playing around with calling conventions naked functions and epilogue/prologue... Is it possible/expressible/feasible to alter the return address the function will return to? For example, when a function may return an Int8 or a Float64, depending on some external state (user, or random variable), instead of checking the returned type in the calling function, is it possible to pass 2 potential

On Feb 22, 2008, at 11:11, Eric Jonas wrote: > Hello! I'm interested in using LLVM as a target for a compiler I've > written in common lisp (SBCL). While I looked at perhaps wrapping > the LLVM C++ interface, wrapping C++ in, well, anything not C++ is a > pain. Someone on IRC mentioned that they didn't think I'd miss out > on any functionality by directly emitting IR, but suggested I query > the list. > > Do...