search for: specint2006

Hi Hal, Thanks for your interest. We tested with the following existing compiler optimizations in LLVM with SPECINT2006 benchmarks: -dse (dead store elimination), -gvn (global value numbering), -licm (loop invariant code motion), -bb-vectorize (basic block vectorization), -memcpyopt (memcpy optimization), -sink (code sinking), -loop-idom (recognize loop idioms), -argpromotion (argument promotion). As far as I know,...

...log m) time, assuming you are using a standard balanced parentheses formulation. On Thu, Oct 17, 2013 at 9:51 PM, lian li <lianli at gmail.com> wrote: > Hi Hal, > > Thanks for your interest. > > We tested with the following existing compiler optimizations in LLVM > with SPECINT2006 benchmarks: > -dse (dead store elimination), > -gvn (global value numbering), > -licm (loop invariant code motion), > -bb-vectorize (basic block vectorization), > -memcpyopt (memcpy optimization), > -sink (code sinking), > -loop-idom (recognize loop idioms), > -argpromotion...

...rd balanced parentheses formulation. > > > > > On Thu, Oct 17, 2013 at 9:51 PM, lian li <lianli at gmail.com> wrote: >> Hi Hal, >> >> Thanks for your interest. >> >> We tested with the following existing compiler optimizations in LLVM >> with SPECINT2006 benchmarks: >> -dse (dead store elimination), >> -gvn (global value numbering), >> -licm (loop invariant code motion), >> -bb-vectorize (basic block vectorization), >> -memcpyopt (memcpy optimization), >> -sink (code sinking), >> -loop-idom (recognize loop...

...; > > > > > > On Thu, Oct 17, 2013 at 9:51 PM, lian li <lianli at gmail.com> wrote: > >> Hi Hal, > >> > >> Thanks for your interest. > >> > >> We tested with the following existing compiler optimizations in LLVM > >> with SPECINT2006 benchmarks: > >> -dse (dead store elimination), > >> -gvn (global value numbering), > >> -licm (loop invariant code motion), > >> -bb-vectorize (basic block vectorization), > >> -memcpyopt (memcpy optimization), > >> -sink (code sinking), > &...

Hi Lian, I am certainly interested in seeing this; do you have performance numbers (compile time)? Also, can you share more information about the promising optimization results you mentioned? Thanks, Hal ----- Original Message ----- > Hi All, > > This is Lian Li from Oracle Labs in Brisbane Australia. > > We have developed a precise and highly efficient pointer analysis >

Hi All, This is Lian Li from Oracle Labs in Brisbane Australia. We have developed a precise and highly efficient pointer analysis framework on top of LLVM, The approach is flow, context, and field sensitive, details are described in the two papers below: "Boosting the performance of flow-sensitive points-to analysis using value flow" (in ESEC-FSE 2011), and "Precise and