similar to: [LLVMdev] Conditional Predicate Extraction

Thanks cedric, I will look into the ways the debug information could be used. However, it seems like i would have to write a piece of code that would successively reduce the conditional predicate in terms of the local and global variables (of the code). I plan to do it like this. Since i am using a runonBasicblock pass, the context information between two basic blocks cannot be shared, since

Hi! as highlevel languages (like opencl) support operations with a vector on one side and a scalar on the other side (e.g. vector * scalar) it would be convenient if llvm ir would have a splat instruction that takes a scalar and produces a vector with all elements filled with the scalar. i assume that i'm not the first one who has this idea so what was the reason not to include such an

Hi, I am trying to print two strings using printf. I have tried various things, but keep getting this error: llc: printf.ll:4:11: error: '@printf' defined with type 'i32 (i8*, ...)*' %1 = call i32 @printf(i8* null, i8*, i8* null) The code is: declare i32 @printf(i8* nocapture readonly, ...) nounwind define i32 @main() nounwind { %1 = call i32

>> Hi! >> >> before InstCombine (llvm::createInstructionCombiningPass()) I have >> a trunc from i8 to i1 and then a select: >> >> %45 = load i8* @myGlobal, align 1 >> %tobool = trunc i8 %45 to i1 >> %cond = select i1 %tobool, float 1.000000e+00, float -1.000000e+00 >> >> after instCombine I have: >> >> %29 = load i8*

Hi, I just cvs the samba_2_2 branch with cvs -d :pserver:cvs@samba.org:/cvsroot co -r SAMBA_2_2 samba and i try to compile samba with gcc under solaris 8 (SUNultra10): # pwd /tmp/samba/source # ./configure --with-automount --with-nisplus-home loading cache ./config.cache checking for gcc... gcc checking whether the C compiler (gcc -O ) works... no configure: error: installation or configuration

>>>> Hi! >>>> >>>> The following thoughts about the llvm architecture I'd like to share >>>> with you >>>> (from the perspective of a user): >>>> >>>> - If a backend has no vector support, then I wonder why there is no >>>> de-vectorization >>>> pass that operates on indermediate

I just tried adding the cast but it didn't help. I have the feeling that I am overlooking something very obvious, but I can't seem to figure out what it is. Thanks for your suggestion, though. -- Mikael 2013/12/3 Eli Bendersky <eliben at google.com> > > > > On Tue, Dec 3, 2013 at 2:29 PM, Mikael Lyngvig <mikael at lyngvig.org> wrote: > >> Hi,

hi everyone, since about 10 days I've been working on an implementation of ogg vorbis *decoder* from scratch, and I've got a few constructive remarks about the specs and some questions. -------------------------- First a question: > 9.2.4. low_neighbor > > "low_neighbor(v,x)" finds the position n in vector [v] of the greatest > value scalar element for which

On Tue, Dec 3, 2013 at 2:29 PM, Mikael Lyngvig <mikael at lyngvig.org> wrote: > Hi, > > I am trying to print two strings using printf. I have tried various > things, but keep getting this error: > > llc: printf.ll:4:11: error: '@printf' defined with type 'i32 (i8*, > ...)*' > %1 = call i32 @printf(i8* null, i8*, i8* null) > > The

Hi, Well, yes i did try your suggestion but i keep on running into a compilation problem. The error is: llvm[0]: Compiling Hello.cpp for Release build (PIC) /home/saraswat/llvm/llvm-2.1/include/llvm/ADT/GraphTraits.h: In instantiation of `llvm::GraphTraits<llvm::ilist_iterator<llvm::BasicBlock> >': Hello.cpp:59: instantiated from here

Jochen Wilhelmy schrieb: >>>>> Hi! >>>>> >>>>> The following thoughts about the llvm architecture I'd like to share >>>>> with you >>>>> (from the perspective of a user): >>>>> >>>>> - If a backend has no vector support, then I wonder why there is no >>>>> de-vectorization

I think Chris is saying that the and is necessary because with your i1 trunc you're ignoring all of the high bits. The and implements that. If you don't want this behavior, don't generate the trunc in the first place and just compare the full width to zero. Reid On Wed, Dec 28, 2011 at 6:45 AM, Jochen Wilhelmy <j.wilhelmy at arcor.de>wrote: > > >> Hi! >

I am trying to determine how to best increase the number of routing tables available in linux 2.6 to more than 255. I realize this involves increasing the storage of some messages to and from the kernel in addition to kernel changes (from browsing the code), and was hopeful that someone might know what the correct solution would be or could point me in the right direction (like existing patches

Hi, list. I know this information won't be useful to most of you. I'm getting this error: preloader: Warning: failed to reserve range 00010000-00110000 err:dosmem:setup_dos_mem Cannot use first megabyte for DOS address space, please report I'm running wine 1.0.1 on a linux powerpc box. The error doesn't affect the applications I tried (winecfg, winemine, a flash PE binary...).

This code: declare i32 @printf(i8* nocapture readonly, ...) nounwind define i32 @bar(i8* %c, i32 %i) #0 { entry: %call = tail call i32 (i8*, ...)* @printf(i8* %c, i8* %c) ret i32 %call } Is accepted without complaints by close-to-trunk llc on my Ubuntu machine. Eli On Tue, Dec 3, 2013 at 2:58 PM, Mikael Lyngvig <mikael at lyngvig.org> wrote: > I just tried adding the cast but

Hi all, I am trying to extract the operands from an instruction, for that i am iterating over the operand list as defined by the user class. for (User::op_iterator O = i->op_begin() ;O != i->op_end(); ++O) { Value *v = *O; llvm::cout << v->getNameStr() ; } However, whenever there is a constant operand like a numerical value, it does not displays any value at all, i checked

Hi Pabhat, Have you checked out DepthFirstIterator? (include/llvm/ADT/ DepthFirstIterator.h). It provides an iterator abstraction to perform a forward/reverse DFS traversal of a graph. Many of the LLVM datatypes that represent graphs have a template specialization of the GraphTraits<> class which allows separate algorithms to treat them as graphs, walk them, etc. (Both BasicBlock

Hi, I am trying to extract the name of the variables passed as an Argument to a Function. I am using a runOnFunction Pass. For example in the following IR respresentation, define void @foo(i32 %limit) { entry: -- -- } I should be able to walk the IR and get '%limit' as the external variable passed to the function. Another question, Is it possible to create a basic symbol table (

Whoops... Seems I forgot the asterisk (*) after the cast. Or something. Because I did insert the cast and it didn't work. But NOW it works. Thank you for spending some time on this - and also for presenting the solution. -- Mikael 2013/12/4 Eli Bendersky <eliben at google.com> > This code: > > declare i32 @printf(i8* nocapture readonly, ...) nounwind > > define

Hi aditya, There are two ways to cound the number of predecessors for each basic block. You can generate the control flow graph using the CallGraphScc pass with the granularity of basic block and can simply traverse the graph bottom up till the root. The number of nodes encountered would be the number of predecessors. The second way would be to use the special ;preds marker in the llvm IR. Each