With an interest of playing with LLVM based just in time compiling I made a clone of the [expr] family of objects that parses, compiles and then executes the compiled code versions of the expressions you provide it.
It could still use a little cleanup but I believe it has all of the features of the cloned objects now, plus a [print( message to print out the generated LLVM assembly. I'm curious if anyone has some CPU intensive expr~ or fexpr~ examples that I could try to benchmark these against? Also, does anyone have a good benchmarking solution for pd? Anyways, if you're interested in checking it out the source is here: https://github.com/x37v/jit-expr I'll submit a deken package once its been tested enough, I resolve a couple questions I have about potential memory leaks and finalize the licensing. -Alex
_______________________________________________ Pd-list@lists.iem.at mailing list UNSUBSCRIBE and account-management -> https://lists.puredata.info/listinfo/pd-list
