similar to: [LLVMdev] Questions on using LLVM to build a VM

Hi - I've read the FAQ, and done a few preliminary searches on google, so apologies if this question has been answered before. I'm new to WINE - at least, I don't use it - a friend does. However, I have developed an app (a screensaver) which he would like to run. It does perfectly in all areas but sound. When using the Playsound() API call and a Delphi 5 TMemoryStream, I get absolutly

Hi John, I noticed the values after decode is very much different from the values of the original PCM samples. For cases when the PCM sample values are constant (because no one is speaking), the decoded values fluctuate too. These fluatuations are causing the background noise. Is my observation expected? Thanks, Carine ----- Original Message ---- From: John Miles <jmiles@pop.net> To:

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 do >> not exist in my llvm-2.3 code. Both from opt -help and the lib/Analysis. >> And then I go to download the llvm-2.5 version, there is still no

Hi, I've changed the m_waveFormatEx.wBitsPerSample for both record buffer and playSound buffer, changed my array from char to short and I'm still getting the same constant background noise. I notice that when I talk into the mike, I will get a slightly louder noise, can't hear any clear speech... Any idea what's wrong? Regards, Carine ----- Original Message ---- From: John Miles

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]; > > } > > > > then the access

Thanks for your reply. Probably I did not explain clearly. 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.

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 LLVM intrinsics or ``special function calls'' so that I am able to leverage the power of things like InstVisitor. However, it

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 = add i8 %x, %neg ret i8 %sum } $ llvm-as < x.ll | opt -analyze

Hi all, The current repository (revision 56968.) does not compile on my Linux box (with GCC 3.4.6): X86TargetAsmInfo.cpp:41: error: duplicate explicit instantiation of `bool llvm::X86TargetAsmInfo<BaseTAI>::ExpandInlineAsm(llvm::CallInst*) const [with BaseTAI = llvm::TargetAsmInfo]' X86TargetAsmInfo.cpp:43: error: duplicate explicit instantiation of `bool

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.

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

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!

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! It's a pity that it's not written in the >> tutorial. >> >> Also

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 >

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

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 bound. I implemented a prototype using the Scalar Evolution pass. Here are the pseudo-code of the implementation: const SCEV * offset =

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 +0200, Nicolas Geoffray wrote: > >> Dear Andre, >> >> That's

For a LL(1) parser, 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

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

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 do >>> not exist in my llvm-2.3 code. Both from