search for: lian

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 Oracle Labs in Brisbane Australia. > > We have developed a precise and highl...

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...

...e compilation time in both cases are quite small. Remind that the compilation time is reported by running our analysis over individual files, the compilation time overhead will be larger if we link all individual compilation units together and run the analysis over the whole application. Regards, Lian On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> wrote: > > 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 c...

...ompilation time overhead will be larger > > if > > we link all individual compilation units together and run the > > analysis over the whole application. > > Yes, LTO tests would be interesting too. > > Thanks again, > Hal > > > > > Regards, > > Lian > > > > On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> > > wrote: > > > > > > On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > > > > > >> Thanks, Chris. > > >> > > >&...

...ient algorithm to solve Dyck-CFL-reachability problem in bidirectional graphs. However, precise pointer analysis cannot be formulated as a Dyck-CFL-reachability problem. The alias analysis presented in that paper is an over approximation. Hence the time bound from our paper still applies. Regards, Lian On Fri, Oct 18, 2013 at 4:39 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > 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 line...

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...

...y running our analysis > over individual files, the compilation time overhead will be larger > if > we link all individual compilation units together and run the > analysis over the whole application. Yes, LTO tests would be interesting too. Thanks again, Hal > > Regards, > Lian > > On Sat, Oct 19, 2013 at 7:56 AM, Evan Cheng <evan.cheng at apple.com> > wrote: > > > > On Oct 17, 2013, at 10:51 PM, lian li <lianli at gmail.com> wrote: > > > >> Thanks, Chris. > >> > >> We are interested in contributing it to...

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 an...

...and sendmail, both with more than 100,000 LOC. For some benchmarks, it is time-consuming: the analysis time for GCC is close to 45 minutes. But if you run the analysis over individual files (as in your normal compilation process), there is no observable overhead in terms of compile time. Regards, Lian On Fri, Oct 18, 2013 at 12:15 PM, Hal Finkel <hfinkel at anl.gov> wrote: > 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? > >...

...lysis is generally more expensive as it has O(L^3 N^3) complexity [29], where L is the size of the grammar and N is the size of the graph." should now been reduced to O(n + m 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...

...ze,...), and for each optimization we rerun our analysis so that its result can be used by the optimization pass. The biggest performance improvement we observed is close to 3%, but for some benchmarks we also have a slow down of 2%. The overall performance improvement is less than 0.5%. Regards, Lian > >> >> >> > The biggest overhead is observed in >> > "SingleSource/Benchmarks/Misc/flops-5", where we are 5 times slower: >> > 0.07s (with our analysis) compared to 0.0133s(default). >> > This may not be accurate as the compilation ti...

...s more specific > than "Re: Contents of LLVMdev digest..." > > > Today's Topics: > > 1. Fwd: Re: [lldb-dev] Has Fast register allocation been > finished in 3.3 version? (??? (Yonggang Luo)) > 2. Re: Contribute a new precise pointer analysis to LLVM (lian li) > 3. Re: Feature request for include llvm-mc in llvm.org/builds > (??? (Yonggang Luo)) > 4. How to use clang -intergrated-as to compile cross-(os/target) > assembly file. (??? (Yonggang Luo)) > 5. Size limitations in MCJIT / ELF Dynamic Linker/ ELF codegen? >...

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 d...

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 A...

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

...doing pointer analysis. > > > For at least some published AA algorithms, there may be some > uncertainty about software patents and/or copyright. > > At one point I was interested in the status of this AA implementation > <https://dl.acm.org/citation.cfm?id=2466483> by Lian Li et al. IIRC, > when I contacted Lian to ask if there was any chance of getting it > into LLVM, IIRC she said that her employer wouldn't promise to > relinquish all possible claims it had on that algorithm's IP. So > unfortunately, at least in the U.S., an algorithm bein...

...ue where TRUE/FALSE needed" I have to admit I don't really understand what this error is telling me - has anyone else ever used this code and would you mind letting me know what I need to do to run it? thanks everyone so much in advance for your help! all the best and a happy new year! Lian -- View this message in context: http://r.789695.n4.nabble.com/Bayesian-estimate-of-prevalence-with-an-imperfect-test-tp4265595p4265595.html Sent from the R help mailing list archive at Nabble.com.

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 attac...

...86, mingw32 status major 2 minor 13.1 year 2011 month 07 day 08 svn rev 56322 language R version.string R version 2.13.1 (2011-07-08) The class of x is data frame, but when I use is.list, I also get a TRUE result. Why does this happen? Lian Peng [[alternative HTML version deleted]]