search for: shaved

...geLog +shave +shave-libtool diff --git a/acinclude.m4 b/acinclude.m4 new file mode 100644 index 0000000..0a3509e --- /dev/null +++ b/acinclude.m4 @@ -0,0 +1,77 @@ +dnl Make automake/libtool output more friendly to humans +dnl Damien Lespiau <damien.lespiau at gmail.com> +dnl +dnl SHAVE_INIT([shavedir],[default_mode]) +dnl +dnl shavedir: the directory where the shave scripts are, it defaults to +dnl $(top_builddir) +dnl default_mode: (enable|disable) default shave mode. This parameter +dnl controls shave's behaviour when no option has been +dnl given...

Does anyone know if Hastie's gene shaving method is implemented in R Thanks, Aimin

Hi LLVM Dev, I have an old problem that I've wanted to clean-up for some time. Our chip has gone through a number of iterations in the past few years, but with each revision there have been changes to some of the mnemonics for instructions. These are mostly very simple, for example we had a 32-bit load from memory instruction named 'LD32' in one version of the chip, but for a

...BeginX; } }; ``` In the past I used something more like: ``` template <class T, size_t SmallCapacity> struct SmallVector2 { unsigned Size; unsigned Capacity; union { T Small[SmallCapacity]; T *Large; }; bool isSmall() const { return Capacity == SmallCapacity; } // Or a bit shaved off of Capacity. T *begin() { return isSmall() ? Small : Large; } T *end() { return begin() + Size; } size_t size() const { return Size; } size_t capacity() const { return Capacity; } }; ``` I'm curious whether this scheme would be really be slower in practice (as a complete replacemen...

As I’m sure many of you have noticed, I no longer have the time to be a proper code owner for SelectionDAG. In the interest of the project and to keep development running smoothly, I am resigning my code ownership. Justin Bogner has graciously volunteered to take it up. He has a strong history of LLVM contributions, a demonstrated commitment to good community development practices, and has

Hi LLVM-Devs, When I try to configure LLVM v6.0 RC2 (SVN Rev #324869) on Windows (I haven't yet had a chance to try on Linux), I get a series of errors such as this: CMake Error at cmake/modules/AddLLVM.cmake:1333 (add_dependencies): The dependency target "(" of target "check-all" does not exist. Call Stack (most recent call first): CMakeLists.txt:937

Thanks for the quick answer Bruce. So far as I can tell (from a quick read), this is really for integrated assemblers/disassemblers - but we use an external assembler. When invoking clang we would provide ‘-mcpu=chip_v1’ or ‘-mcpu=chip_v2’, and the mnemonic ‘LD32’ is only valid when compiling for ‘chip_v1’, while ‘LD.32’ is only valid when compiling for ‘chip_v2’. But I will study the

Maybe it's caused by the space after the X86 argument? Can you try removing all the -D flags, and see if that works? Then add them one by one to see which is the culprit? -Dimitry > On 17 Feb 2018, at 23:11, Martin J. O'Riordan via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Hi LLVM-Devs, > > When I try to configure LLVM v6.0 RC2 (SVN Rev #324869) on Windows

I'm sure there must be various peak-finding algorithms out there. Not knowing of any, I have written one myself*, but I thought I'd ask to see what's out there. Basically, I have a 2-dimensional data set and I want to identify local peaks in the data, while ignoring "trivial" peaks. My naive algorithm first identifies every peak and valley (point of inflection change

On May 3, 2011, at 4:08 PM, David A. Greene wrote: >> >> It's just that an REX prefix is required on some instructions when >> %xmm8 is used. Is it worth it to undo LICM just for that? In this >> case, probably. In general, no. > > Ah, so you're saying the regression is due to the inner loop icache > footprint increasing. Ok, that makes total sense to

Hello list, I have two data frames, X (48469,2) and Y (79771,5). X[,1] contains distinct values of Y[,2]. I want to match values in X[,1] and Y[,2], then take the corresponding value in [X,2] and place it in Y[,4]. So far I have been doing it like so: for(i in 1:48469) { y[which(x[i,1]==y[,3]),4]<-x[i,2] } But it chunks along so very slowly that I can't help but wonder if there's a

I have been able to adapt the main LLVM sources to work with vectors of 16 x FP16 values and I have introduced the 'v16f16' data type to CLang and LLVM, but I am stumped on how to get TableGen to recognise this type. At the moment I am trying to optimise the calling convention code, and whenever I refer to 'v16f16' I get a crash in TableGen (unrecognised type). Unfortunately I

> On 2014 Oct 16, at 22:09, Sean Silva <chisophugis at gmail.com> wrote: > > Dig into this first! This isn't the right forum for digging into ld64. > In the OP you are talking about essentially a pure "optimization" (in the programmer-wisdom "beware of it" sense), to "save" 2GB of peak memory. But from your analysis it's not clear that

I''ve been having a mess of a time using this module, which stinks because its behavior is EXACTLY what I am looking for... whenever I bootstrap new rabbitMQ nodes I want to add them to our HAProxy instance. Here''s my relevant site.pp entries: node /^rabbit.*/ inherits basenode { @@haproxy::balancermember { $fqdn: listening_service => ''messaging00'',

...ate <class T, size_t SmallCapacity> >> struct SmallVector2 { >> unsigned Size; >> unsigned Capacity; >> union { >> T Small[SmallCapacity]; >> T *Large; >> }; >> >> bool isSmall() const { return Capacity == SmallCapacity; } // Or a bit shaved off of Capacity. >> T *begin() { return isSmall() ? Small : Large; } >> T *end() { return begin() + Size; } >> size_t size() const { return Size; } >> size_t capacity() const { return Capacity; } >> }; >> ``` >> >> I'm curious whether this scheme...

I am trying to implement stack probes for our SHAVE target, and I see that the compiler injects references to '__stack_chk_guard' and '__stack_chk_fail'. The code that gets generated is horribly wrong, but in order to understand how to fix it I was wondering if there is a clear statement of how the mechanism is supposed to work? The variable '__stack_chk_guard' appears

On Sat, Feb 18, 2012 at 3:20 AM, Chris Lattner <clattner at apple.com> wrote: > My advise is to check in when you have to make forward progress. If > people want to reshave your yak into another hairdo, then then can do that > at some later time. No reason to block your progress as long as the API is > good. I was trying to give feedback on the API, and specifically suggest

This shaves about 20% off the compile time for the daemon subdirectory. See also: https://rwmj.wordpress.com/2015/09/30/make-and-queuing-theory/#content --- daemon/Makefile.am | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/daemon/Makefile.am b/daemon/Makefile.am index 1d29a0f..4ea3c88 100644 --- a/daemon/Makefile.am +++ b/daemon/Makefile.am @@ -76,7 +76,11 @@ else

For some reason all documentation lists the max rice partition order to be 16, while the maximum is 15. This fixes thee HTML online documentation --- documentation_tools_flac.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/documentation_tools_flac.html b/documentation_tools_flac.html index bc1f2b8..5100cb4 100644 --- a/documentation_tools_flac.html +++

Hi, I noticed recently that require ''rspec'' on my machine was taking close to half a second. That''s not a huge amount of time, but it is still the single slowest part of my test suite. It boils down to Ruby 1.9''s rather slow require. I''m using 1.9.3, but I''d still like to shave off some of the require time. As an experiment, I went into