search for: harmen

Harmen, your suggestion of inverting the mapping almost worked (and Andrew was correct that the function I need is the same as the one in which poolinit appears). Unfortunately, it appears that this mapping only considers the original function and not any of its clones. Since the pool descriptor in...

...apping will not have my pool descriptor in it because my pool descriptor only existed in the clone. I'm fine with the DSNode being the original function's DSNode -- in fact, I need that -- but I'm really at a loss as to how to get out of this catch-22. --Patrick On 03/19/10 04:10, Harmen van der Spek wrote: > Hi Patrick, > > That's right. DSNodes are coupled to the original function. For function clones, you first need > to get the original function, and then use the DSNode from that function. FuncInfo > contains the information if a function is a clone and what...

...in which the clones are generated (which should be internal functions) and then, instead of maintaining all these mappings, just rerun Top-Down DSA on that result. In that case, it would be much easier to find DSNodes. Anyway, this was just a thought, I've not really tried anything like that. Harmen On Mar 19, 2010, at 9:14 AM, Patrick Alexander Simmons wrote: > Harmen, your suggestion of inverting the mapping almost worked (and Andrew was correct that the function I need is the same as the one in which poolinit appears). Unfortunately, it appears that this mapping only considers the or...

...t;VectorType>(Ty)) && "Cannot create an aggregate zero of non-aggregate type!"), function get, file lib/VMCore/Constants.cpp, line 859. Changing it to Value *ArgVal = Constant::getNullValue(PoolAllocate::PoolDescPtrTy); which was used in revision 72001, fixes the problem. Harmen -------------- next part -------------- A non-text attachment was scrubbed... Name: constaggr.bc Type: application/octet-stream Size: 704 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20091113/65b3e730/attachment.obj>

I figure (hopefully correctly) that I can iterate over all pool descriptors in a program by iterating over all users of poolinit and looking at the first argument. However, once I have a pool descriptor, I need to get its corresponding DSNode in the function in which it is complete (or in the global graph if it is a global). How do I do this? Thanks, --Patrick

...originate from a complete DSNode somewhere higher in the call chain. Per function, a pool-allocated version can be generated. After that, function calls are rewritten to call the pool allocated version. This is done in TransformFunctionBody.cpp. by calling TransformBody from PoolAllocate.cpp. Harmen Patrick Alexander Simmons wrote: > I figure (hopefully correctly) that I can iterate over all pool > descriptors in a program by iterating over all users of poolinit and > looking at the first argument. However, once I have a pool descriptor, > I need to get its corresponding DSN...

...riptor in it > because my pool descriptor only existed in the clone. I'm fine with the > DSNode being the original function's DSNode -- in fact, I need that -- > but I'm really at a loss as to how to get out of this catch-22. > > --Patrick > > On 03/19/10 04:10, Harmen van der Spek wrote: > >> Hi Patrick, >> >> That's right. DSNodes are coupled to the original function. For function clones, you first need >> to get the original function, and then use the DSNode from that function. FuncInfo >> contains the information if a f...

...lue of dsa_pass_to_use, either EquivBUDataStructures or EQTDDataStructures is used. In the case that the top-down DSA is used, information is pushed down to nodes in callees. However, if bottom-up DSA is used, information has only been merged upwards and the nodes are not necessarily equivalent. Harmen Andrew Lenharth wrote: > On Tue, Mar 16, 2010 at 3:46 PM, Patrick Alexander Simmons > <simmon12 at cs.uiuc.edu> wrote: >> I figure (hopefully correctly) that I can iterate over all pool >> descriptors in a program by iterating over all users of poolinit and >> looking...

...t be updated. However, if this root is also stored in an IR register, then this pointer should be updated as well. Is there support for identifying and updating such references in the GC framework, or should we generate code ourselves to reload the updated references from the stack. Thanks, Harmen

...rresponding DSGraph here: http://www.liacs.nl/~hvdspek/images/dsgraph_2nodes.png Though one of the 2 nodes doesn't have the R flag, this is not the problem. Adding a printf statement does add the R flag, but still we get 2 nodes. Does anybody have an idea why these nodes are not merged? Harmen

It runs fine on my Snow Leopard installation. I do recall though that LLVM did not build in 64-bit mode automatically. I configured LLVM as follows to get a 64-bit build. ./configure --build=x86_64-apple-darwin10 --host=x86_64-apple-darwin10 --target=x86_64-apple-darwin1 Harmen Tommy Chheng wrote: > Hi, > Learning the ropes of LLVM. I have this simple LLVM assembly snippet > which compiles/runs fine in Ubuntu but won't work on snow leopard. > Somehow related to 64-bit? Anyone else experience this? > > llvm-as if.ll > llc -f if.bc > gcc -o...

Hi, Learning the ropes of LLVM. I have this simple LLVM assembly snippet which compiles/runs fine in Ubuntu but won't work on snow leopard. Somehow related to 64-bit? Anyone else experience this? llvm-as if.ll llc -f if.bc gcc -o if if.s ld: 32-bit pointer out of range in _main from /var/folders/TY/TYHT2tSJEcaVdUEWeuX5P++++TI/-Tmp-//cck44HlB.o collect2: ld returned 1 exit status --------

On 2009-03-20, at 05:09, Harmen van der Spek wrote: > The problem is that we want to implement some sort of copying > garbage collector. In this case, the roots on the stack must be > updated. However, if this root is also stored in an IR register, > then this pointer should be updated as well. Is there support...

...here both bb2 and bb3 have bb4 as their exit block. This loop corresponds to the following common pattern found in C code: while( c1 <bb2> && c2 <bb3> ) bb1; bb4; In this case, bb4 occurs twice in the result vector. Is this behavior intended, or should duplicates be avoided. Harmen

Harmen, thanks for the additional details, it wasn't exactly clear what this is about. Ivan's post didn't mention that the issue here is the caching, not the path replacement which you are apparently already doing, now it makes more sense. I still think it is dangerous as you have no way of...

...t/spack/opt/spack/linux-ubuntu18.04-x86_64_v3/gcc-7.5.0/r-4.3.0-eqteloqhjzix6ta373ruzt5imvvbcesc Unfortunately, Spack packages are expected to get relocated, changing the path prefix and invalidating stored paths, including the path to `which`: <https://github.com/spack/spack/issues/41953>. Harmen Stoppels, who is not subscribed to R-devel but interested in making R work in Spack, currently creates a symlink to `which` <https://github.com/r-devel/r-svn/pull/151> as part of a patch to R. What would be the minimally disruptive way to avoid this dependency or at least make it easier to f...

...or signaling a collector thread)? My impression is that this has to be done in the front-end for now since there is no support for doing this at the safe points at the moment. Is this correct? Regards, Mattias On 20 Mar 2009, at 13:09, Gordon Henriksen wrote: > On 2009-03-20, at 05:09, Harmen van der Spek wrote: > >> The problem is that we want to implement some sort of copying >> garbage collector. In this case, the roots on the stack must be >> updated. However, if this root is also stored in an IR register, >> then this pointer should be updated as well. Is...

*What would be the recommended way to debug LLVM opt pass? Is there any way to perform source level debugging on a particular opt pass? * *-- UGR* -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100110/e250208a/attachment.html>

Hi, I am new to the LLVM project, and from what I have heard It can be used to performed static analysis on a source code. I would like to know if it is possible to extract the different function call through function pointer (find the caller function and the callee function) in a program. I could find the kind of information in the website so it would be really helpful if you could tell me if

On Tue, Mar 16, 2010 at 3:46 PM, Patrick Alexander Simmons <simmon12 at cs.uiuc.edu> wrote: > I figure (hopefully correctly) that I can iterate over all pool > descriptors in a program by iterating over all users of poolinit and > looking at the first argument.  However, once I have a pool descriptor, > I need to get its corresponding DSNode in the function in which it is >