search for: simpification

...[ %next, %Entry ] %scevgep = getelementptr [8 x [8 x float]]* %sl8_5, i64 0, i64 %idx, i64 0 %next = add i64 %idx, 1 %exitcond = icmp eq i64 %next, 8 br i1 %exitcond, label %Exit, label %Entry Exit: ret void } (Sorry for the cluttered simpification: removing any of the call, getelementpointer or loop removes the llc crash)

I just changed the default register allocator for -O0 builds to the fast allocator. This means that the local register allocator is not used anymore, and since it does more or less the same as the fast allocator, there is no reason to keep it around. I am going to delete it in a week or two. If you are using the local register allocator, please try switching to the fast allocator and report any

...hoping Saleem, Eric or Jon (copied) knows a bit of history > as to why this is so (perhaps because the two projects evolved > independently ?). > They didnt really evolve independently, the version in LLVM was imported from libc++. However, we simplified it to make it more portable. The simpifications naturally led to the ability to remove the arena allocation routines. The copy in libc++ needs to retain a certain amount of flexibility due to the exporting of the interface into the user's address space (via the __cxa_demangle interface). However, making adjustments that improve performanc...

...I want to fix > this? I can file a PR if this is not in the SPU backend. In this case it was RegAllocFast making special assumptions, but in general -verify-machineinstrs and -debug-only=regalloc might help. And feel free to file PRs for the SPU backend as well. > (Sorry for the cluttered simpification: removing any of the call, > getelementpointer or loop removes the llc crash) Do you know about bugpoint? "bugpoint test.ll -run-llc -tool-args -O0 -march=cellspu" will reduce the test case for you. It is awesome. /jakob

...) { number.strata.range<-c(1:3) # set by CAR project.n.range <- seq(project.n.min, project.n.max, length.out=length.out) project.sd.range <- seq(project.sd.min, project.sd.max, length.out=length.out) # assume verification sd is the same as the project sd to simplify - seems a reasonable simpification number.verification.plots<- seq(number.verification.plots.min, number.verification.plots.max, length.out=length.out) verification.range <- seq(verification.mean.min, verification.mean.max, length.out=length.out) permut.grid<-expand.grid(number.strata.range, project.n.range, project.acre...

On Tue, Apr 25, 2017 at 8:36 PM, Vedant Kumar via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > > On Apr 25, 2017, at 12:24 PM, Scott Smith <scott.smith at purestorage.com> > wrote: > > > > well, top-of-branch lldb uses this code, that's how I found it. Do you > mean libc++'s demangler? > > Thanks for explaining, this is the first time