similar to: [LLVMdev] How to generate 32 Bit executable ?

I completely agree with you. The source code I wrote here has the main function and is a complete code. That's why I was expecting load/store analysis could have been incorporated across the module. Thanks. On Fri, Jan 4, 2013 at 10:43 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > I'm not sure what you mean by "use" check. > If you compile this with LTO and

Hello, I have just started using llvm. I was trying to debug how *clang* generates IR for very simple C testcases (few assignments and if-condsitions). To get a hold on the basic functions, I put some break points on following functions but debugger *didn't stop*: llvm::BasicBlock::Create llvm::BinaryOperator::CreateAdd (design has binary op) llvm::Value::Value llvm::BranchInst::Create

Thanks for your reply. So, we don't do any "use" check (for globals variables) beyond a module scope. If so, it answers my question. On Fri, Jan 4, 2013 at 6:53 PM, Justin Holewinski < justin.holewinski at gmail.com> wrote: > Since a, b, and c are globals, how does the optimize *know* they are not > used elsewhere (e.g. another module)? > -------------- next part

Hello, I am facing an issue with a small test where there is a chance that sign-extension is not introduced as expected - #include <stdio.h> void func( long x ) { printf(" %ld \n", x); } int main() { char c = -1; func ( c ); // c is zero extended to x return 0; } generated IR - define i32 @main() #0 { ........ store i8 -1, i8* %c, align 1 %2 = load i8,

I'm not sure what you mean by "use" check. If you compile this with LTO and multiple modules, and guarantee that you have the main function, yes, you could optimize this. In all other cases, it's not possible to eliminate any of the remaining loads or stores you see, because you have no guarantee about what else could read it. Heck, a conforming implementation of printf could

Hello, I was trying to run few testcases and see how llvm optmizes different scenarios. I have a small testcase like: #include <stdio.h> int a, b, c; int main() { a = b + c; c = a; if (a == b) b = c; else b = a; printf( " a = %d \n ", a ); return 0; } The corresponding llvm IR is ( clang test.c -S -emit-llvm -o -

Greetings, I have a dialplan that calls the dictate application, but I want to do some post-processing on the RAW file created. The post processing is working fine as long as the dictation application exits gracefully, but fails when the user simply hangs up. How can I make sure the system() command is run regardless? Example: [test-dictation] exten => 123,1,Dictate(/tmp/dictate) exten

Hello One and All, I am a Linux admin, new to asterisk. I have been assigned the task of setting up a dictation server for the company I work for. Our company is into transcription. Currently we are using dictation server, which is provided by another company. Now we have decided to have our own dictation server. I have installed asterisk and have gone through many documentation and

[[apologies if this is a dupe. gmane is a bit odd sometimes]] I need some help on a handicap accessibility project. It's really great for people like me that naturally speaking is working in wine (mostly). One important shortcoming is getting our dictated text into linux. Today, in order to copy text from the wine environment and place it in the Linux environment, we need to dictate into

Hello Members, Sorry for hijacking the earlier thread and asking the question last time. Is anyone aware about a solution to call incoming number and dictate the files by using Dictate feature of Asterisk used for Medical Transcription industry. Thanks & Regards, Amit Mehta -------------- next part -------------- An HTML attachment was scrubbed... URL:

Since a, b, and c are globals, how does the optimize *know* they are not used elsewhere (e.g. another module)? On Fri, Jan 4, 2013 at 7:49 AM, Somenath Chakraborty <some.chak at gmail.com>wrote: > Hello, > > I was trying to run few testcases and see how llvm optmizes different > scenarios. I have a small testcase like: > > > #include <stdio.h> > > >

Hi, How do I access the loop variables in a loop. for(i = 0; i < N; i++) for(j = 0; j < M; j++) A[i][j+k] = i + j; Is there anyway for me to know that in A[i][j+k], i & j are loop variables whereas k is not! Regards, Prasenjit Chakraborty Performance Modeling and Analysis IBM Systems & Technology Lab

Hello, I am having problems getting one xlite clients to communicate through asterisk. I am getting an error message: chan_sip.c:15593 handle_request_register: Registration from '"chinmay chakraborty"<sip:1234 at 10.44.32.193 <sip%3A1234 at 10.44.32.193>>' failed for '10.44.32.193' - No matching peer found sip show peers Name/username Host

Hi, I sent an email to Mark Fisheh of Oracle Corp. & posted this issue at OTN under Linux thread this morning. I hope that someone among you might have experienced this and can help. On that basis, I am sending this to you too. I am stuck & will really appreciate if you can shed some light on this. Thanks. Anjan

I tried googling and searching the forums here but was unable to locate an answer, please forgive if this has been covered. Is there any way to provide formatting guidelines to dictate how parsed comments are displayed in the resulting html? In the simplest example, is there a way to specify a linebreak (break tag)? Thanks, Andy -- Posted via http://www.ruby-forum.com/.

On Sat, Dec 4, 2010 at 5:14 AM, Chris Lattner <clattner at apple.com> wrote: > Thiago, > > The coding standards (which have been finalized and comitted) don't dictate names for local variables. > Do you like the fact that local variables start with capital letter? Following the same convention used to name classes? It's a very strange adoption. I like the way that

On Oct 12, 2009, at 3:46 AM, Prasenjit Chakraborty wrote: > > Hi, > How do I access the loop variables in a loop. > > for(i = 0; i < N; i++) > for(j = 0; j < M; j++) > A[i][j+k] = i + j; > > Is there anyway for me to know that in A[i][j+k], i & j are loop > variables > whereas k is not! The ScalarEvolution analysis can help here.

Hi, We have implemented the rsqrt instruction generation for X86 target architecture. We have introduced a flag -fp-rsqrt flag which controls the generatation of X86 rsqrt instruction generation. We have observed minor effects on precision due to rsqrt and hence has put these transformations under the mentioned flag. Note that -fp-rsqrt is only enabled with -enable-unsafe-fp-math flag presently.

On Wed, Nov 14, 2012 at 10:43 PM, Chakraborty, Soham <Soham.Chakraborty at amd.com> wrote: > Hi, > > > > We have implemented the rsqrt instruction generation for X86 target > architecture. We have introduced a flag -fp-rsqrt flag which controls the > generatation of X86 rsqrt instruction generation. > > We have observed minor effects on precision due to rsqrt and

Driver init call graph under baremetal: driver_init-> msix_capability_init-> msix_program_entries-> msix_mask_irq-> entry->masked = 1 request_irq-> __setup_irq-> irq_startup-> unmask_msi_irq-> msix_mask_irq-> entry->masked = 0 So