search for: rekha

...ms-linkedin/* for using linked gem and API for getting profile and other stuff But at the end I am getting this error: => Booting WEBrick => Rails 3.2.13 application starting in development on http://0.0.0.0:3000 => Call with -d to detach => Ctrl-C to shutdown server Exiting /Users/rekha/.rvm/gems/ruby-1.9.2-p320/gems/actionpack-3.2.13/lib/action_dispatch/routing/mapper.rb:179:in `default_controller_and_action'': missing :action (ArgumentError) from /Users/rekha/.rvm/gems/ruby-1.9.2-p320/gems/actionpack-3.2.13/lib/action_dispatch/routing/mapper.rb:72:in `normalize_option...

...-855(338-0710) || outlook technical support number / (1 855)338+0710 outlook customer service Number Outlook Tech Support Number (KAKI KAKA PASS 1-855(338-0710) || outlook technical support number / (1 855)338+0710 outlook customer service Number Outlook Tech Support Number)RAJA HAi tera OR RANi KA REKHA +++_Happy Diwali RAJA || outlook technical support number / (1 855)338.0710 outlook customer service Number Outlook Tech Support Number+_+_KAKI KAKA PASS 1-855(338-0710) || outlook technical support number / (1 855)338+0710 outlook customer service Number Outlook Tech Support Number (KAKI KAKA PASS...

Thank you David for prompt reply. I tried with SmallVector. I inserted elements with push_back(). But when I retrieve elements using pop_back_val the elements are returned in reverse order of insertion (I mean like LIFO order). I need this to be FIFO order. How to achieve that? Regards, Rekha On Sun, Nov 3, 2013 at 8:31 PM, David Blaikie <dblaikie at gmail.com> wrote: > If you don't care about efficiency you can push (or at least insert) at > the front of a(small or otherwise) vector. > On Nov 3, 2013 3:32 AM, "Rekha R" <rekharamapai at nitc.ac.in>...

On Sun, Nov 3, 2013 at 7:38 AM, Rekha R <rekharamapai at nitc.ac.in> wrote: > Thank you David for prompt reply. > > I tried with SmallVector. I inserted elements with push_back(). > But when I retrieve elements using pop_back_val the elements are returned > in reverse order of insertion (I mean like LIFO order). &...

Hi, I plan to implement an algorithm which requires BasicBlocks to have at most two predecessors. simplifycfg pass is not a choice since it doesn't do what I want, going by its description. Could someone point me to an existing pass which does this job? Thanks, -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20140923/7133c972/attachment.html>

On Wed, Jul 23, 2014 at 4:06 PM, Rekha R <rekharamapai at nitc.ac.in> wrote: > Ok. Got it. > > If *add nsw* overflows, this results in undefined value. > But then *add* on same arguments results in well-defined value. > > Hence treating first one as redundant based on the second is acceptable. > But vice vers...

...llVector (and similar others) and found out this is working in LIFO order when I use the functions push_back and pop_back_val to insert and delete elements in the worklist. Can someone suggest an appropriate DS to implement my worklist. Note: I am not concerned about efficiency here. -- Regards, Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131103/ca057e61/attachment.html>

> -----Original Message----- > From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On > Behalf Of "C. Bergström" > Sent: Tuesday, July 15, 2014 7:39 AM > To: Rekha R > Cc: LLVM Developers Mailing List > Subject: Re: [LLVMdev] on compiling FORTRAN programs > > On 07/15/14 09:29 PM, Rekha R wrote: > > Hi, > > > > I am stuck on compiling SPEC benchmark programs. > > I could successfully compile and run my pass on SPEC CPU2006...

Hi, Would like to know the parsing strategy used in LLVM - top-down, bottom-up, or any other? -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130926/329f7027/attachment.html>

Hi, Thank you David. My question was from a machine independent code analyzer/optimizer perspective where types are of less importance. Hence I felt difficult to understand the IR with the types. Rekha On Mon, Oct 27, 2014 at 6:44 PM, David Chisnall <David.Chisnall at cl.cam.ac.uk > wrote: > On 27 Oct 2014, at 12:46, Rekha R <rekharamapai at nitc.ac.in> wrote: > > > Why wasn't the C style of explicit declaration of variables (or values > in LLVM context) followed...

...ne, newpass.so will be created in /llvm-build/Debug+Asserts/lib directory. 5. The new pass can be loaded by modifying the command mentioned in the LLVM doc (for Writing a new pass) as opt -load /llvm-build/Debug+Asserts/lib/newpass.so -newpass < hello.bc > /dev/null Hope this helps. -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131004/7f55babb/attachment.html>

On 09/26/2013 10:51 AM, Rekha R wrote: > Hi, > > Would like to know the parsing strategy used in LLVM - top-down, > bottom-up, or any other? > > -- > Rekha > > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc...

If you don't care about efficiency you can push (or at least insert) at the front of a(small or otherwise) vector. On Nov 3, 2013 3:32 AM, "Rekha R" <rekharamapai at nitc.ac.in> wrote: > Hi, > > I am writing an analysis which requires creating worklist of basic blocks. > The worklist should be in FIFO order. I checked SmallVector (and similar > others) and found out this is working in LIFO order when I use the >...

...ever we want. If the "add nsw" overflows this would lead to undefined behaviour. Therefore we can assume that "add", with the same arguments will not overflow. On Wed, Jul 23, 2014 at 3:32 PM, Tim Northover <t.p.northover at gmail.com> wrote: > On 23 July 2014 06:25, Rekha R <rekharamapai at nitc.ac.in> wrote: > > Are the following instructions semantically same? > > %add2 = add nsw i32 %add, %add1 > > %add3 = add i32 %add, %add1 > > > > Based on my understanding from the Language Reference Manual, I think > they >...

Hi, I wrote a pass in LLVM and would like to test it on the programs in LLVM test-suite. To be specific, I would like to get the stats upon running my pass on these programs. What are the commands to run my pass on the test suite? -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20140626/b229ff49/attachment.html>

On Oct 3, 2013 11:47 PM, "Rekha R" <rekharamapai at nitc.ac.in> wrote: > > Hi, > > I was trying to write a sample optimization pass in LLVM, by following instructions in LLVM doc for Writing a New Pass. But then ran into make issues. The issue is with having separate source and build directories. The LLVM d...

...here? or may be even annotate the value (result of the Instruction) with type rather than annotating each operands on the Instruction? Just felt that by annotating each operand with types may make the Instruction 'complex' to understand. May be I am wrong. Thanks for any explanation, -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20141027/51ee72ed/attachment.html>

...suggest a simple optimization (simple in complexity on the lines of constant folding) to get started? My intention is to get used to the APIs in LLVM and not get cluttered by the optimization itself. (Hence I chose constant folding in the first place.) Any opinion will be appreciated :) Regards, Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131006/c31e4feb/attachment.html>

This sounds good. Similar to Constant folding. Noted :-) Rekha On Tue, Oct 8, 2013 at 1:33 PM, David Tweed <david.tweed at arm.com> wrote: > Hi,**** > > ** ** > > If you're looking for something incredibly simple to get started with it > might be fruitful to implement replacement of particular function calls of > constant argu...

...could successfully compile and run my pass on SPEC CPU2006 C and C++ programs. However, I couldn't compile SPEC CPU2006 FORTRAN programs. Note: I am using the *make *utility to run my pass on SPEC programs. Any idea on how to compile FORTRAN programs using *make *(instead of LNT)? Thanks, -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20140715/25909feb/attachment.html>