similar to: [LLVMdev] Code documentation

On Thu, 8 Apr 2004, Vladimir Prus wrote: > is there any documentation for LLVM codebase other than produced by doxygen? Yes, most definitely: http://llvm.cs.uiuc.edu/Documentation.html > The reason I'm asking is that doxygen docs are > (1) not very complete at the moment, as lot of classes don't even have a > description > (2) is generally not the best way to get

Hi! When I go to http://llvm.cs.uiuc.edu/doxygen/annotated.html and click on link for, say, "llvm::Module", I've told that the target page does not exist. Same happens for llvm::Value, and in fact everything under "llvm" namespace. Any idea what's wrong? - Volodya

Hello, I am looking for a loop unfolding procedure implemented in LLVM that helps to transform a while-loop to n-layer If-statements. The transformation should be on IR, although the example below is illustrated on the source level. original loop: * WHILE (condition) DO action ENDWHILE* Expected unfolded loop (2-layer): * IF (condition) THEN* * action* * IF

Hi, right now many classes have comments that don't show up in Doxygen. Say, MachineConstantPool.h has a big file-level comment, but it does not show up when looking at the generated docs for MachineConstantPool. Are patches moving file comments to appear before relevant classes welcome? - Volodya

Hello, I've just downloaded the latest release of LLVM, and playing with the following simple example: int main() { int r(0); for (int i = 0; i < 100; ++i) r += i; ; return r; } I compile it and then run: analyze -indvars x.bc which prints: Printing analysis 'Induction Variable Analysis' for function 'main': and nothing else. It is a

Hello, I'm playing with alias analysis, using the following program: %i = external global int ; <int*> [#uses=2] implementation ; Functions: int %_Z3bari(int %p) { entry: %tmp.0 = load int* %i ; <int> [#uses=1] %tmp.1 = setgt int %tmp.0, 10 ; <bool> [#uses=1] br bool %tmp.1, label %then, label %UnifiedReturnBlock then:

Hello, I'm wondering what was the original motivaton for the 'select' instruction. Was it for convenience, or for some deep reason. I'm asking because it's causing me some problems (see below) and I'd like to know I understand the situation before working those problems around. I have the following function: int logsch(int ih,int nbh) { if(nbh < 0)

Hi, For one of our research projects, we are planning to use LLVM. We need the following features: 1. We need to aggressively fuse loops that have inter-loop dependencies. 2. We need to identify intrinsic functions and induction variables. 3. We need to detect few memory access patterns like copy, transpose-copy, stride-copy etc. 4. Lastly, auto-vectorization and

Hi I am trying to write up a transformation for the following code where instead of incrementing the loop variable by 1, I increment it by 2 ie. for (i=0; i < THRES; *i++*) { //do something } gets transformed to for (i=0; i < THRES; *i+=2*) { //do something } I am thinking of transforming the llvm bit-code in the following way. Iterate over the function for the original code till I

Chris Lattner wrote: > The select instruction is basically an SSA-form "conditional move", or a > very simple form of predication. Integer codes often have very complex > CFG's which are usually doing simple things. For example, it's not > uncommon to see something like this: > > if (blah) > X = 14; > > If the body of the if statement is simple

hi all, On 2010-1-7 0:11, John Mosby wrote: > In LLVM we could add support for generalized CFG regions and > RegionPasses. A region is a part of the CFG. The only information we > have is, that it has one entry and one exit, this it can be optimized > separately. > I think this is the best way to add region analysis. I must admit > this approach > helps me on another,

I appreciate your suggestions, some follow-up questions though.... >1) LLVM has the capabilities to do everything that you are trying to >re-implement. >2) Have you looked at the C backend? It recreates loops. It may not >create "for" loops but you can hack on it to do that. I wonder if you mean "goto elimination technique" by Ana Maria Erosa (

On Mon, 6 Mar 2006, Vladimir Prus wrote: > When I go to > http://llvm.cs.uiuc.edu/doxygen/annotated.html > > and click on link for, say, "llvm::Module", I've told that the target page > does not exist. Same happens for llvm::Value, and in fact everything under > "llvm" namespace. Zion, the machine that hosts that, has been running out of disk space.

On Mon, 6 Mar 2006, Vladimir Prus wrote: > When I go to > http://llvm.cs.uiuc.edu/doxygen/annotated.html > > and click on link for, say, "llvm::Module", I've told that the target page > does not exist. Same happens for llvm::Value, and in fact everything under > "llvm" namespace. Fixed, thanks! -Chris -- http://nondot.org/sabre/ http://llvm.org/

Hello! Suppose I have a code like this: %tmp.aux = cast bool %tmp.24 to int %tmp.x = xor int %tmp.aux, 1 ; negates tmp.24 %tmp.xx = cast int %tmp.x to bool %tmp.y = or bool %tmp.xx, %tmp.24 ; will be always true br bool %tmp.y, label %next6, label %next7 Is there an optimization in LLVM that will recognize that %tmp.y is

Malveeka, You can use the LoopInfo analysis to find the induction variable. http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c Cheers, Nadav From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Malveeka Tewari Sent: Thursday, May 05, 2011 14:51 To: llvmdev at cs.uiuc.edu Subject: [LLVMdev] Loop transformations

On 01/08/10 14:20, ether wrote: > sorry that i forgot to change the subjuect Hi ether, sounds interesting. Actually is/may be some kind of region. If you want you can have a look at the analysis, that I wrote. It is not yet finished, not completely documented and work in progress. However the first big comment might be interesting for you. Or seeing the results of opt -regions -analyze

Hi Ganesh, Please have a look at: These core parts of LLVM: http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c http://llvm.org/docs/Vectorizers.html These research projects based on LLVM: http://polly.llvm.org http://aesop.ece.umd.edu I'm not sure what you mean by "identify intrinsic functions". If you really mean LLVM intrinsics,

The docs for MachineFunction::create method have a couple of nits: // The next three methods are used to construct, destruct, and retrieve the // MachineFunction object for the given method. // // construct() -- Allocates and initializes for a given method and target // get() -- Returns a handle to the object. // This should not be called before

On May 5, 2011, at 5:11 AM, Rotem, Nadav wrote: > Malveeka, > > You can use the LoopInfo analysis to find the induction variable. > > http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c > > Cheers, > Nadav getCanonicalInductionVariable is a good example of finding IVs without iterating over instructions. But you may need to