search for: liane

Thanks, Chris. We are interested in contributing it to LLVM itself. Our manager agrees to commit resources for maintenance needs if it is accepted by the community. Regards, Lian On Fri, Oct 18, 2013 at 3:43 PM, Chris Lattner <clattner at apple.com> wrote: > > On Oct 17, 2013, at 5:20 PM, lian li <lianli at gmail.com> wrote: > > Hi All, > > This is Lian Li from

On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > Thanks, Chris. > > We are interested in contributing it to LLVM itself. Our manager > agrees to commit resources for maintenance needs if it is accepted by > the community. This is great. Please make sure Oracle legal sign off on explicitly granting LLVM the use of the patents associated with the work. On

Hi Evan, We did an experiment using the LLVM test suite: we compare the overhead of using our analysis to the LLVM default, both with -O2 option. The overall overhead of compiling the whole test suite using our analysis is 36.5%. The biggest overhead is observed in "SingleSource/Benchmarks/Misc/flops-5", where we are 5 times slower: 0.07s (with our analysis) compared to

On Tue, Oct 22, 2013 at 9:55 AM, Hal Finkel <hfinkel at anl.gov> wrote: > ----- Original Message ----- > > Hi Evan, > > > > We did an experiment using the LLVM test suite: we compare the > > overhead of using our analysis to the LLVM default, both with -O2 > > option. > > It might also be interesting to try with -O3; I don't know if we have any

Hi Daniel, I want to clarify that our analysis is not based on CFL-reachability. We apply CFL-reachability to matching context information where the exist from a function to a call-site must match the entry from the corresponding call-site. The problem is a simple balanced parentheses problem in CFL-reachability, and it can be computed efficiently. The paper you mentioned is a very nice paper

On Fri, Oct 18, 2013 at 7:27 AM, lian li <lianli at gmail.com> wrote: > Hi Daniel, > > I want to clarify that our analysis is not based on CFL-reachability. > We apply CFL-reachability to matching context information where the > exist from a function to a call-site must match > the entry from the corresponding call-site. Yes, sorry, I pulled the wrong quote, it was late.

----- Original Message ----- > Hi Evan, > > We did an experiment using the LLVM test suite: we compare the > overhead of using our analysis to the LLVM default, both with -O2 > option. It might also be interesting to try with -O3; I don't know if we have any significant vectorizable loops in the test suite with a large number of arrays, but if we do, this kind of 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

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

I notice you guys formulate your CFL reachability problem as a balanced parentheses problem. What algorithm do you use to solve it? Are you aware of recent work that comes up with linear time and n log n time algorithms to solve this class of problems: http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf In particular, the time bound from the paper: "However, if we need the precise

On Wed, Oct 23, 2013 at 3:07 AM, Chandler Carruth <chandlerc at google.com> wrote: > On Tue, Oct 22, 2013 at 9:55 AM, Hal Finkel <hfinkel at anl.gov> wrote: >> >> ----- Original Message ----- >> >> It might also be interesting to try with -O3; I don't know if we have any >> significant vectorizable loops in the test suite with a large number of

On Oct 22, 2013, at 1:29 PM, llvmdev-request at cs.uiuc.edu wrote: > Send LLVMdev mailing list submissions to > llvmdev at cs.uiuc.edu > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > or, via email, send a message with subject or body 'help' to > llvmdev-request at cs.uiuc.edu > > You can

On Oct 17, 2013, at 5:20 PM, lian li <lianli at gmail.com> wrote: > 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

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, was just wondering if there''s a way to create a local forge repositories to host our local modules? Has anyone done that? I found this post, http://projects.puppetlabs.com/issues/5033. that was one year ago. Wondering if there''s a way to do it now? Thanks. -- You received this message because you are subscribed to the Google Groups "Puppet Users" group. To

Hi Christian, Thank you so much for the reply! Please see my comments inline. On 03/21/2016 09:32 AM, Christian Convey wrote: > Hi Jia, > > If one looks at existing research literatures, there are even more > algorithm to consider for doing pointer analysis. > > > For at least some published AA algorithms, there may be some > uncertainty about software patents

Hi all! I'm new to this forum so please excuse me if I don't conform perfectly to the protocols on this board! I'm trying to get an estimate of true prevalence based upon results from an imperfect test. I have various estimates of se/sp which could inform my priors (at least upper and lower limits even if with a uniform distribution) and found the following code on this website..

Compilation error output is attached. Seems that G++ 3.4.5 fails to pick the right specialization version of getExprLocImpl() function in lib/AST/Expr.cpp. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: error URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110211/4a248936/attachment.ksh>

On Feb 11, 2011, at 3:48 AM, Lian Cheng wrote: > Compilation error output is attached. > > Seems that G++ 3.4.5 fails to pick the right specialization version of getExprLocImpl() function in lib/AST/Expr.cpp. http://llvm.org/docs/GettingStarted.html#brokengcc -eric -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi all I want to use function of is.list and is.data.frame in if-else statement, but I get a trouble. To replicate this trouble, I run codes like that: > set.seed(123) > x <- rnorm(100) > x <- data.frame(matrix(x, 10, 10)) > class(x) [1] "data.frame" > is.list(x) [1] TRUE > is.data.frame(x) [1] TRUE > version _ platform i386-pc-mingw32