search for: haohui

...5 version, there is still no these 2 >> options. Where are they? >> > http://llvm.org/svn/llvm-project/poolalloc/trunk/ . They're not part > of a normal checkout due to patent issues. > > I don't quite understand. You mean steensgaard / DSA are patented? Haohui > -Eli > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev >

...arly. Here is an example: call @check(%foo) %1 = load %foo Now I want to write optimization only focus on the function call @check, and it might have some additional information which does not need to appear at LLVM IR. So it seems that the annotation intrinsic does not fit the scenario. Haohui On Jan 21, 2009, at 8:01 PM, Tanya M. Lattner wrote: > > Does the llvm annotation intrinsic not work for what you are trying > to do? > > http://llvm.org/docs/LangRef.html#int_var_annotation > http://llvm.org/docs/LangRef.html#int_annotation > > -Tanya > > On Wed,...

On Tue, 2009-06-23 at 22:55 -0700, Nick Lewycky wrote: > Mai, Haohui wrote: > > Hi all, > > > > I'm working on a project which tries to prove an access to an array is > > safe. For example, > > > > int foo(int s) { > > int * p = malloc(s * sizeof int); > > ... > > int q = p[s - 2]; > > } > &g...

Mai, Haohui wrote: > Nick, > > It might be a little bit difficult to handle SMax correctly. But is it > possible to reduce A+(-A) to 0 in SAddExpr? Yes, it should already do that. Here's a quick test I wrote up: $ cat x.ll define i8 @test(i8 %x) { %neg = sub i8 0, %x %sum = a...

Nick, It might be a little bit difficult to handle SMax correctly. But is it possible to reduce A+(-A) to 0 in SAddExpr? Haohui On Wed, 2009-06-24 at 01:05 -0500, Mai, Haohui wrote: > On Tue, 2009-06-23 at 22:55 -0700, Nick Lewycky wrote: > > Mai, Haohui wrote: > > > Hi all, > > > > > > I'm working on a project which tries to prove an access to an array is > > > safe. For...

...only work on these special calls, say, I could save some information in the subclass of CallInst. I also notice that the access identifier of CallInst are changed after LLVM 2.0. I would be appreciated if you guys could explain the rationale behind the changes. Thank you very much. Best, Haohui

Haohui Mai <haohui.mai at gmail.com> writes: > I've already filed a bug report but nobody cares :-( > > Is it possible to fix the documentation? Because I think the tutorial > is really important to beginners, which should not be misleading. > >> Thanks, -rdynamic helps!...

...that there is a file missing at llvm/tools/llvmc2/ plugins. The Makefile in llvm/tools/llvmc2/plugins/Base says: LLVMC_PLUGIN = Base include ../Makefile.common In which ../Makefile.common is missing. I'd be very appreciated if somebody could fix these issues. Thank you very much! Best, Haohui

Does the llvm annotation intrinsic not work for what you are trying to do? http://llvm.org/docs/LangRef.html#int_var_annotation http://llvm.org/docs/LangRef.html#int_annotation -Tanya On Wed, 21 Jan 2009, Haohui Mai wrote: > Dear all, > > Currently I'm working on a project that add various checks into the > LLVM bitcode. For example, I insert function calls before every > load / store instructions to guarantee that these instructions are > safe. I really want to implement them as LL...

Dear Nicolas, I'm curious why you are using ABCD in vmkit. Do you need any features from static array bounds checking? As far as I know, SAFECode has a number of implementation for that. Thanks. Haohui On Thu, 2009-06-04 at 20:48 +0200, Nicolas Geoffray wrote: > Dear Andre, > > That's great! Thanks for the blog. I am really looking forward into > using ABCD in vmkit! > > Cheers, > Nicolas > > Andre Tavares wrote: > > Dear Community, > > > > I...

Mai, Haohui wrote: > Dear Nicolas, > > I'm curious why you are using ABCD in vmkit. Do you need any features > from static array bounds checking? As far as I know, SAFECode has a > number of implementation for that. > > Thanks. > > Haohui > > On Thu, 2009-06-04 at 20:48 +0...

Thanks, -rdynamic helps! It's a pity that it's not written in the tutorial. Also I'm interested how can I provide a mapping? 2008/9/25 srs <skaflotten at gmail.com>: > Link with -rdynamic or provide a mapping.

I've already filed a bug report but nobody cares :-( Is it possible to fix the documentation? Because I think the tutorial is really important to beginners, which should not be misleading. -- Haohui On Sep 25, 2008, at 9:42 AM, Andrii Vasyliev wrote: > Thanks, -rdynamic helps! It's a pity that it's not written in the > tutorial. > > Also I'm interested how can I provide a mapping? > > 2008/9/25 srs <skaflotten at gmail.com>: >> Link with -rdynamic...

On Wed, Sep 9, 2009 at 11:49 PM, Mai, Haohui <haohui.mai at gmail.com> wrote: > On 9/9/09 3:28 AM, Eli Friedman wrote: >> On Wed, Sep 9, 2009 at 12:50 AM, Lei Shang<shang1982 at gmail.com>  wrote: >> >>> Hi, >>> >>>     I just found -steens-aa and -ds-aa Alias Analysis listed in documents...

...s require sort of evaluating symbolic expression like this. For this case SMax(A, B) is equivalent to SMax(A-B,0) + B, instruction combining handles sophisticated expressions like (A+B)-B pretty well. It would be great if Scalar Evolution can support this. Any comments are appreciated. Cheers, Haohui

...39;' at compile-time. Well, even though there are a lot of approaches of doing this, I believe that having an implementation of ABCD would very useful. It would be even more useful if LLVM can have a general framework for doing static array bounds checking -- just like the aliasing framework. Haohui -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Andre Tavares Sent: Thursday, June 04, 2009 8:33 PM To: LLVM Developers Mailing List Subject: Re: [LLVMdev] SSI and ABCD for LLVM Mai, Haohui wrote: > Dear Nicolas, > > I&...

...it might be a little bit difficult to parse complex grammar like C++, but it might work. ANTLR worked great when other codes were written in Java, but it was a little bit painful when using other languages like python. I worked on it two years ago. I guess they might have some improvement now. Haohui On 07/11/2009 02:40 PM, Vikram S. Adve wrote: > We are looking for an open source C++ parser other than g++ if > possible. Clang would be great but its C++ support is still some way > away and we need something that works or nearly works now. Does > anyone have any experience with...

Mai, Haohui wrote: > Hi all, > > I'm working on a project which tries to prove an access to an array is > safe. For example, > > int foo(int s) { > int * p = malloc(s * sizeof int); > ... > int q = p[s - 2]; > } > > then the access of p[s - 2] always stays in bo...

...high level language support in LLVM? To my best knowledge, (1) there's a java class to llvm byte code translator in the SVN. (2) the VMKit project claims that it has a good JVM. I appreciate if you could give me some more information. Comments and suggestions are also appreciated. Thanks! ~Haohui

On Thursday 02 October 2008 12:42, David Greene wrote: > But let's say you _could_ write such a pattern (because I can). The input > DAG looks like this: > > 0x391a220: <multiple use> > 0x391c970: v2f64 = scalar_to_vector 0x391a220 srcLineNum= 10 > 0x391ac10: <multiple use> > 0x391c8b0: v2f64 = scalar_to_vector