search for: fsplit

Hi DebugInfo folks, I have a question on using fsplit-dwarf-inlining option: "-fsplit-dwarf-inlining, -fno-split-dwarf-inlining Provide minimal debug info in the object/executable to facilitate online symbolication/stack traces in the absence of .dwo/.dwp files when using Split DWARF" i.e. it puts some debug info into compilation unit f...

...variable (in one column). The resulting new dataframes should be stored in a new variable. I tried to split the dataframe using split() and to store it using a FOR loop, but thats not working so far: df <- data.frame(A=c("A1","A1","A2","A2"),B=seq(1:4)) Fsplit <- function(x,y){ ls <- split(x,f=x$y) for (i in names(ls)){ i <- ls$i } } Fsplit(df,A) #1st argument is dataframe to split, 2nd argument grouping variable Any suggestions how to get that done? Best regards Johannes [[alternative HTML version deleted]]

...l block in the loop and indirectly increase vectorization opportunities. If we know that a loop has a conditional branch that is always true for one part of the iteration space and false for the other, then we can split such loop into two parts. As far as I check, GCC seems to handle this already (-fsplit-loops). For me, it seem possible to handle this as a special case of the loop-unswitch. Does anyone have any opinion about this transformation? Thanks, Jun

...l block in the loop and indirectly increase vectorization opportunities. If we know that a loop has a conditional branch that is always true for one part of the iteration space and false for the other, then we can split such loop into two parts. As far as I check, GCC seems to handle this already (-fsplit-loops). For me, it seem possible to handle this as a special case of the loop-unswitch. Does anyone have any opinion about this transformation? > > Thanks, > Jun Roman. > _______________________________________________ > LLVM Developers mailing list > llvm-dev at lists.llvm.org &...

Is -fsplit-stack option used anywhere? My wild guess is that with ld.bfd, the thinLTO link for the DSO does not bring in morestack.o from libgcc.a, but the hidden symbol is defined in lldb binary. David On Mon, Oct 3, 2016 at 1:54 PM, Teresa Johnson via llvm-dev < llvm-dev at lists.llvm.org> wrote: &...

...ase vectorization opportunities. If we know that a >> loop has a conditional branch that is always true for one part of the >> iteration space and false for the other, then we can split such loop >> into two parts. As far as I check, GCC seems to handle this already >> (-fsplit-loops). For me, it seem possible to handle this as a special >> case of the loop-unswitch. Does anyone have any opinion about this >> transformation? >> >> Thanks, >> Jun > Roman. > >> _______________________________________________ >> LLVM Develo...

...return (uint64_t)&__morestack; #endif #endif // __linux__ && __GLIBC__ On Mon, Oct 3, 2016 at 3:32 PM, Teresa Johnson <tejohnson at google.com> wrote: > > > On Mon, Oct 3, 2016 at 2:59 PM, Xinliang David Li <xinliangli at gmail.com> > wrote: > >> Is -fsplit-stack option used anywhere? My wild guess is that with ld.bfd, >> the thinLTO link for the DSO does not bring in morestack.o from libgcc.a, >> but the hidden symbol is defined in lldb binary. >> > > AFAICT, no - I had done "ninja -v" so I have all of the intermedia...

...t; >> >> On Mon, Oct 3, 2016 at 3:32 PM, Teresa Johnson <tejohnson at google.com> >> wrote: >> >>> >>> >>> On Mon, Oct 3, 2016 at 2:59 PM, Xinliang David Li <xinliangli at gmail.com> >>> wrote: >>> >>>> Is -fsplit-stack option used anywhere? My wild guess is that with >>>> ld.bfd, the thinLTO link for the DSO does not bring in morestack.o from >>>> libgcc.a, but the hidden symbol is defined in lldb binary. >>>> >>> >>> AFAICT, no - I had done "ninja...

...lar and thin LTO bitcode - it should do regular LTO on that subset and ThinLTO on the other. The other case this handles is when a bitcode object is split into regular and thin LTO halves - this is enabled for things like CFI but shouldn't be the default currently (you'd have to build with -fsplit-lto-unit to get it unless you are building with CFI). Whether the bitcode is added to the regular or Thin LTO partition is determined in LTO::addModule, and is based on a flag set when the bitcode is read which is based in turn on whether the bitcode has a summary block, and whether that is a thin...

...on <tejohnson at google.com> >>>> wrote: >>>> >>>>> >>>>> >>>>> On Mon, Oct 3, 2016 at 2:59 PM, Xinliang David Li < >>>>> xinliangli at gmail.com> wrote: >>>>> >>>>>> Is -fsplit-stack option used anywhere? My wild guess is that with >>>>>> ld.bfd, the thinLTO link for the DSO does not bring in morestack.o from >>>>>> libgcc.a, but the hidden symbol is defined in lldb binary. >>>>>> >>>>> >>>>&...

...e: >>>>>> >>>>>>> >>>>>>> >>>>>>> On Mon, Oct 3, 2016 at 2:59 PM, Xinliang David Li < >>>>>>> xinliangli at gmail.com> wrote: >>>>>>> >>>>>>>> Is -fsplit-stack option used anywhere? My wild guess is that with >>>>>>>> ld.bfd, the thinLTO link for the DSO does not bring in morestack.o from >>>>>>>> libgcc.a, but the hidden symbol is defined in lldb binary. >>>>>>>> >>>&g...

...eptions -ffunction-cse -fgcse-lm -fglobal-alloc-prefer-bytes -fident # -finline-functions-called-once -fivopts -fkeep-static-consts # -fleading-underscore -flocal-alloc -fmove-loop-invariants -fpeephole # -freg-struct-return -fsched-interblock -fsched-spec # -fsched-stalled-insns-dep -fshow-column -fsplit-ivs-in-unroller # -ftoplevel-reorder -ftree-loop-im -ftree-loop-ivcanon # -ftree-loop-optimize -ftree-vect-loop-version -funit-at-a-time # -fverbose-asm -fzero-initialized-in-bss -m128bit-long-double -m32 -m80387 # -maccumulate-outgoing-args -malign-stringops -matt-stubs # -mconstant-cfstrings -mfa...

Hi, I'm working on enabling thinLTO for our custom backend on LLVM-8 with lld to get code size benefits from dead symbol elimination. The code in LTO::run() of LTO.cpp confuses me that, even though thinLTO is specified, runRegularLTO() will be run first and its return value determines whether runThinLTO() will be executed. My question is if it's clearly known that thinLTO is used, is it

Hi, I am looking into Control-Flow Integrity for indirect function calls, implemented with jump tables. I want to step through the code that produces these jump tables in GDB. I have built clang and opt from source with debugging symbols. I believe this code lives in llvm/lib/Transforms/LowerTypeTests.cpp, but when I try to debug *opt* by running the command "run -lowertypetests cfi-icall.bc

On Mon, Oct 3, 2016 at 3:50 PM, Teresa Johnson <tejohnson at google.com> wrote: > > On Sun, Oct 2, 2016 at 4:02 AM, Carsten Mattner <carstenmattner at gmail.com> wrote: >> >> On Sun, Oct 2, 2016 at 6:41 AM, Teresa Johnson <tejohnson at google.com> wrote: > > > > > I use trunk, but it depends on how close to the bleeding edge you > > > are