Displaying 20 results from an estimated 20000 matches similar to: "[LLVMdev] QUERY"
2007 May 18
0
[LLVMdev] QUERY
Hi All,
I have a query regarding LLVM,Can LLVM IR can restore high level
information of base language.
Thanks and Regards,
Manish
On 5/18/07, manish <manishagg22 at gmail.com> wrote:
>
>
2018 Aug 07
4
Generating a loop from llvm bitcode
Hello
I am developing a backend that generates OpenCL from llvm bitcode. I start with a revived fork of the original LLVM C-Backend and have been modifying it. One thing that the backend lacked was generating proper loop structures; instead it relied on labels and goto statements. Therefore, I am trying to find a way to identify the loop structure and print it out in the backend. So far, the main
2008 Jun 12
6
Session Best Practices
Hi All- I am still trying to figure out the best way to handle facebook session for my users. Here is my current flow:
in my "external accounts controller"
1) before_filter :ensure_authenticated_to_facebook, :only => [:authenticate_facebook, :edit_facebook]
2) when the user links into facebook, facebooker authenticates and redirects back to my application
3) i detect the
2016 Feb 18
2
query regarding domstats option with virsh
Hi,
I am looking for the information w.r.t domstats command line option of virsh tool.
1> This command line option is available with which version of libvirt.
2> How to get Guest's disk related information in case storage pool does not exist on host.
Thanks and Regards,
Manish
2009 Mar 16
6
[LLVMdev] n00b question: From module/bitcode to Mach-O dylib file directly?
> Aaah. Wasn't quite sure what you were doing here. I'm not positive
> what llvm can emit via the writers (there's support for all parts of
> the file format), but it could be extended to write one out. I'm just
> not quite sure why :)
>
> -eric
Well, ultimately I'm curious about what it would take to port a JVM
based language (http://openquark.org) to
2011 May 03
3
[LLVMdev] Loop-Unroll optimization
Hi,
You might want to try running -loops -loop-simplify before loop unroll.
>From loop simplify.cpp
This pass performs several transformations to transform natural loops
into a00011 // simpler form, which makes subsequent analyses and
transformations simpler and00012 // more effective.
Arushi
On Tue, May 3, 2011 at 2:17 PM, Manish Gupta <mgupta.iitr at gmail.com> wrote:
> You
2007 Dec 13
1
[LLVMdev] ocaml binding question
On Wednesday 12 December 2007 23:30, Gordon Henriksen wrote:
> Hi Jon,
>
> In this direction, PyPy and Reid's HLVM projects may be of interest to
> you.
Yes. I've had a look at both of those but they only seem to cater for
dynamically-typed languages.
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/products/?e
2011 May 03
0
[LLVMdev] Loop-Unroll optimization
Even after all the sequence of commands below bit-code is not showing any
effect of loop-unrolling
*manish at manish:~/Test2$ llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc*
*manish at manish:~/Test2$ opt-2.8 -loops Hello.bc -o Hello1.bc*
*manish at manish:~/Test2$ opt-2.8 -loopsimplify Hello1.bc -o Hello2.bc*
*manish at manish:~/Test2$ opt-2.8 -indvars Hello2.bc -o Hello3.bc*
*manish at
2011 May 04
1
[LLVMdev] Loop-Unroll optimization
1. You should run the passes in the same opt command, for passes like loops
which is an analysis pass provides results to the following passes.
2. You can pass a -debug flag to opt to see the some debugging info.
3. I tried this
opt -mem2reg -loops -loopsimplify -loop-unroll -unroll-count=3 -debug
loop.o -o tt.bc
and got this message.
Loop Size = 14
Can't unroll; loop not terminated by
2006 Apr 26
1
[LLVMdev] Newbie questions
On Wed, 2006-04-26 at 09:01 -0500, Archie Cobbs wrote:
> Requoting myself:
>
> > I.e., my question is the more general one:
> > how do optimizations that are specific to the front-end language get
> > done? How does the front-end "secret knowledge" get passed through
> > somehow so it can be used for optimization purposes?
>
> -Archie
Archie,
2012 Oct 26
3
[LLVMdev] Using LLVM to serialize object state -- and performance
I have a legacy C++ application that constructs a tree of C++ objects (an iterator tree to implement a query language). I am trying to use LLVM to "serialize" the state of this tree to disk for later loading and execution (or "compile" it to disk, if you prefer).
Each of the C++ iterator objects now has a codegen() member function that adds to the LLVM code of an
2011 May 03
2
[LLVMdev] Loop-Unroll optimization
Hi, you need to run some optimization passes first. (like -O2)
2011/5/3 Manish Gupta <mgupta.iitr at gmail.com>
> I just want to try loop-unroll and see corresponding changes in the bitcode
> file. For that any loop will do. Have you been able to test llvm loop-unroll
> successfully?
>
>
> On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote:
>
2013 Jan 21
2
[LLVMdev] [llvm-commits] [llvm] r172534 - /llvm/trunk/test/Transforms/LoopStrengthReduce/post-inc-icmpzero.ll
On Jan 21, 2013, at 12:37 PM, Chandler Carruth <chandlerc at google.com> wrote:
> On Mon, Jan 21, 2013 at 11:49 AM, Andrew Trick <atrick at apple.com> wrote:
> Moving to llvmdev...
>
> On Jan 21, 2013, at 11:37 AM, Nadav Rotem <nrotem at apple.com> wrote:
>
> > Hi Manish,
> >
> > Thank you for looking at this. Recently opt started using the
2009 Jun 24
2
[LLVMdev] Garbage collection implementation
Jon Harrop wrote:
> The simplest way is surely to reuse HLVM because it provides
everything you
> need and is even written in the right language! ;-)
Is there a web page with HLVM docs? There's a README.txt in the
subversion repository:
https://llvm.org/svn/llvm-project/hlvm/trunk/README.txt
which says:
HLVM comes with documentation in HTML format. These are provided in
2009 Nov 21
2
[LLVMdev] -O0 compile time speed (was: Go)
On Nov 19, 2009, at 1:04 PM, Bob Wilson wrote:
>> I've tested it and LLVM is indeed 2x slower to compile, although it
>> generates
>> code that is 2x faster to run...
>>
>>> Compared to a compiler in the same category as PCC, whose pinnacle of
>>> optimization is doing register allocation? I'm not surprised at all.
>>
>> What else
2009 Nov 19
6
[LLVMdev] Google's Go
On Nov 19, 2009, at 2:10 PM, Jon Harrop wrote:
> On Thursday 19 November 2009 19:48:18 Owen Anderson wrote:
>> On Nov 19, 2009, at 10:25 AM, Jon Harrop wrote:
>>>> In this case, the assertion that LLVM is slow is correct: it's
>>>> definitely slower than a non-optimizing compiler.
>>>
>>> I'm *very* surprised by this and will test it
2009 Jan 04
3
[LLVMdev] HLVM
What happened to the HLVM project? I understand it was intended to be a
high-level VM specifically for dynamic languages and this post indicates that
it was integrated into the LLVM project last year:
http://www.nabble.com/NEWS:-HLVM-merges-with-LLVM-td9627113.html
But I cannot find any code in LLVM that looks like it would have come from
HLVM.
--
Dr Jon Harrop, Flying Frog Consultancy
2008 Jun 02
3
[LLVMdev] The first two lines of llvm tutorial don't compile.
I took the first two lines of the sample program in the tutorial:
hendrik at lovesong:~/dv/lang/hlvm$ cat broken.cpp
#include "llvm/DerivedTypes.h"
#include "llvm/Module.h"
hendrik at lovesong:~/dv/lang/hlvm$
and tried to compile them using the llvm-dev in Debian testing:
hendrik at lovesong:~/dv/lang/hlvm$ g++ -o broken.o -c broken.cpp
In file included from
2009 Jun 16
2
[LLVMdev] ML types in LLVM
>On Sunday 14 June 2009 14:09:33 Wesley W. Terpstra wrote:
>> On Sun, Jun 14, 2009 at 10:50 AM, Florian Weimer<fw at deneb.enyo.de> wrote:
>> > Is this really a problem for MLton? I think you only get less precise
>> > alias analysis, and that's it.
>>
>> Correct. However, I want a fair comparison between LLVM performance
>> and the native x86
2009 Mar 10
2
[LLVMdev] Stack smashing
Someone is trying to work on HLVM with me but they're hitting a problem that
we have not been able to resolve. Specifically, GCC seems to be performing
some kind of sanity check for "stack smashing" and is calling abort because
it is unhappy with something that the code is doing. However, I am not sure
what and cannot reproduce the problem.
The stack trace they have given me is: