search for: rerturn

...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 function without any inlining. At run time implement a new Compare function for your type and replace the Compare function with the new...

...mail.com> wrote: > >> 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 function without any inlining. >> >> At run time implement a new Compare function for your type a...

...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 function without any inlining. >>>> >>>> At run time implemen...

...es >>>>>> 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 function without any inlining. >>>>>> >>>>>> At ru...

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