search for: rerturning

...m=mysql. but it gives back an error: sswitch/wb_common.c: In function winbind_named_pipe_sock': nsswitch/wb_common.c:136: storage size of `sunaddr' isn't known make: *** [nsswitch/wb_common.o] Error 1 mysql is working fine so no probs there.. even without-winbind compilation it keeps rerturning... got a idea ?? Collen

Thanks David! I understand that std::sort doesn't exist without types especially at bytecode layer. What I was thinking was something like the following: Compile std::sort with a thunk function Compare(void*, void*) {rerturn false} into bytecode with an option say noinline and always make the function call or even a simple unoptimized bytecode which guarantees that Compare exists as a

Thanks David! I am not clear on how to achieve this though. Could you give more info on this? I expect something like this: sort.cc file: bool Compare(void* a, void* b) { return false; } void SortFunc(void* arr, int len) { std::sort(arr, len, &Compare) } $MAGIC_COMMAND sort.cc -o a.llvm a.llvm is a bytecode which can be loaded at runtime in my JIT module and write some code to

On Mon, Jul 8, 2019 at 4:39 PM David Blaikie <dblaikie at gmail.com> wrote: > There isn't any magic command for this - you'd have to write some C++ > code/a custom LLVM optimization pass. > > Though, that said - perhaps it should just be a runtime parameter where > you rely on LLVM to inline/optimize things away? You could do some > relatively smaller code

Do you have some pointers on how to do it? Take a file like sort.cc above and generate a JIT module. Does llc <https://llvm.org/docs/CommandGuide/llc.html> help with this? What library function can we use to load an existing IR module file into my JIT runtime module to compile them together? On Tue, Jul 9, 2019 at 4:17 PM David Blaikie <dblaikie at gmail.com> wrote: > Ah, no, sort

Hi LLVM devs, The performance of C++ std::sort comes from being able to inline the comparator. For a JIT generated data type, using the comparator as a function call from std::sort may not be ideal. So, i was wondering how can we make a JIT-sort which is as good as statically compiled std::sort with comparator inlined. What is the recommended way to pass a an existing function like std::sort into