search for: srikumar

...retty bizzare and left me scratching my head in disbelief, especially since there are no assert failures in either my code or LLVM's. I reiterate that the only difference between these "constant" results and correct behaviour is my eraseFromParent() call. Any tips anyone? Regards, -Srikumar BTW: I'm using Function::Create() and not module->getOrInsertFunction ().

My understanding is that it is legal to have allocas in any basic block. However, the mem2reg pass only recognizes allocas in the entry block of a function as candidate for conversion into registers. So if you're hoping to use mem2reg, it won't work if you place your allocas elsewhere. -Srikumar

...t;02105f14>] do_notify_resume+0x28/0x38 kernel: Code: 1c 8b 53 04 8b 03 89 50 04 89 02 31 d2 2b 4b 0c c7 03 00 01 10 00 c7 43 04 00 02 20 00 89 c8 f7 b6 b0 00 00 00 89 c1 0f b7 43 14 <66> 89 44 4b 18 8b 43 10 66 89 4b 14 48 85 c0 89 43 10 75 41 8b ------ KP End ------ Thanks in Advance Srikumar -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://listman.redhat.com/archives/ext3-users/attachments/20060426/443777db/attachment.htm>

...inks. When it comes to soft liks, it deletes only the original file but not the link itself. Can anyone please give information on how to delele the softlink itself from a windows client? I am using samba version '3.0.8pre1-0.pre1.3' under Redhat FC 3 Please CC me in your reply. Thanks, Srikumar

...else fact(n-1,result *n) is converted into a loop correctly. However the following mutually recursive pair - define even(n) if n == 0 then true else odd(n-1) define odd(n) if n==0 then false else even(n-1) doesn't get to run in constant stack space. Is that possible with llvm? -Srikumar -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080803/ee73eeb3/attachment.html>

...else fact(n-1,result *n) is converted into a loop correctly. However the following mutually recursive pair - define even(n) if n == 0 then true else odd(n-1) define odd(n) if n==0 then false else even(n-1) doesn't get to run in constant stack space. Is that possible with llvm? -Srikumar

Thanks Chris. That works. -Srikumar On 04 Aug 2008, at 12:12 PM, llvmdev-request at cs.uiuc.edu wrote: >> Hi, >> >> createTailCallEliminationPass() is able to turn recursive >> functions into loops when the functions are written >> in tail recursive form. However, I'm unable to get it >> to c...

...helm Hasselbring Decision Making in Autonomic Computing Systems: Comparison of Different Approaches and Techniques Martina Maggio; Henry Hoffmann; Marco D. Santambrogio; Anant Agarwal; Alberto Leva Using Reinforcement Learning for Controlling an Elastic Web Application Hosting Platform Han Li; Srikumar Venugopal Bootstrapped Migration for Linux OS Jui-Hao Chiang; Maohua Lu; Tzi-cker Chiueh Autonomous Multi-Processor--SoC Optimization with Distributed Learning Classifier Systems XCS Andreas Bernauer; Gunnar Arndt; Oliver Bringmann; Wolfgang Rosenstiel A Control Theory Based Approach for Self-H...

...helm Hasselbring Decision Making in Autonomic Computing Systems: Comparison of Different Approaches and Techniques Martina Maggio; Henry Hoffmann; Marco D. Santambrogio; Anant Agarwal; Alberto Leva Using Reinforcement Learning for Controlling an Elastic Web Application Hosting Platform Han Li; Srikumar Venugopal Bootstrapped Migration for Linux OS Jui-Hao Chiang; Maohua Lu; Tzi-cker Chiueh Autonomous Multi-Processor--SoC Optimization with Distributed Learning Classifier Systems XCS Andreas Bernauer; Gunnar Arndt; Oliver Bringmann; Wolfgang Rosenstiel A Control Theory Based Approach for Self-H...