similar to: [LLVMdev] Program Slicing using LLVM?

Displaying 20 results from an estimated 1000 matches similar to: "[LLVMdev] Program Slicing using LLVM?"

2008 Jan 23
1
[LLVMdev] Walking all the predecessors for a basic block
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
2008 Jan 22
0
[LLVMdev] Walking all the predecessors for a basic block
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
2008 Jan 22
3
[LLVMdev] Walking all the predecessors for a basic block
Hi all, Is there a way to walk through ALL the predecessors of a basic block in a CFG. I tried to iterate over the preds using this method for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++I) { BasicBlock *PredBB = *PI; } but this only gives the immediate predecessors for a basic block. For example, in this sample control flow graph. entry -> bb1 -> bb2 -> bb4
2007 Dec 20
0
[LLVMdev] First time!
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
2008 Mar 11
1
[LLVMdev] Cloning a function with a changed return type
Hi all, I was working on writing a slicing pass which would remove the parts of the code which are not relevant from the control flow point of view (mainly, the repetitive computations in the body of the loops etc). I have been able to implement it successfully. From the POV of implementation, the pass locates the conditional branches, and then the conditions are identified, all the
2008 Mar 04
2
[LLVMdev] Register Allocation by Graph Coloring
Dear all, I was looking for to compile some benchmarks and generate code using different register allocation algorithms. As i can see, the built in options for register allocation in llvm are 1. Simple 2. Local 3. Linear Scan I want to compare the generating code also with a graph coloring based register allocation approach. Is this also built in by default by llvm. Are there some other
2008 Feb 05
1
[LLVMdev] Induction Variables vs Loop Control Variable
Hi all, I was wondering if its possible to identify loop control variables from the induction variables in a Loop using LLVM. Also, How does one can use the LoopInfo class to identify the natural loops from the IR. In other words how to use the class in the pass? Thanks, Regards Prabhat
2007 Dec 20
4
[LLVMdev] First time!
Hi! I want to know How to count the number of predecessors for each basic block? Thank You ____________________________________________________________________________________ Never miss a thing. Make Yahoo your home page. http://www.yahoo.com/r/hs
2012 Oct 30
1
[LLVMdev] Program Dependence Graph (PDG) in LLVM
Hi, Is there a way to use LLVM to build the visual representation of program dependence graph (PDG) of a routine/program? >From looking at https://llvm.org/svn/llvm-project/poolalloc/branches/release_14/lib/DSA/PgmDependenceGraph.cpp, it looks like there is an incomplete implementation of PDG in LLVM. However, when I search within LLVM3.0 package, I don't find the .cpp/h code. So, I also
2008 Jan 10
1
[LLVMdev] PDG (program dependence graph)
Hi Everyone, I am new to LLVM and I was wondering whether there is an implementation of PDG (program dependence graph) in the community. I do not want to re-invent the wheel :). Thanks. George -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080110/7b843c33/attachment.html>
2007 Dec 25
0
[LLVMdev] Using debug info in static analysis
On Dec 25, 2007, at 5:56 AM, Török Edwin wrote: > I was looking at how to use debug info to find out original > source:line > for a certain function/variable in the llvm bytecode. > > I read http://llvm.org/docs/SourceLevelDebugging.html, and then I have > looked in lib/Debugger/ProgramInfo.cpp. > getFunction() looks useful, however I am not sure how to call it. I >
2007 Dec 25
3
[LLVMdev] Using debug info in static analysis
Hi, I was looking at how to use debug info to find out original source:line for a certain function/variable in the llvm bytecode. I read http://llvm.org/docs/SourceLevelDebugging.html, and then I have looked in lib/Debugger/ProgramInfo.cpp. getFunction() looks useful, however I am not sure how to call it. I have a reference to a Function, however getFunction() takes a GlobalVariable. I tried
2020 Nov 18
1
samba / debian 10 / security=ads
Many Thanks Rowland to have read and respond to this very long mail Le 18/11/2020 ? 12:46, Rowland penny via samba a ?crit?: >>> NT_STATUS_NO_LOGON_SERVERS > Are the Unix clients joined to the domain and do they use a DC as their > first nameserver ? No linux clients aren't binded by any mean to the AD Their name servers in /etc/resolv.conf are standards bind resolvers
2015 Apr 29
2
[LLVMdev] AliasAnalysis calling failed in Pass interaction
Dear LLVM developers, I am Shen, a PhD student at Lehigh Univ. PA. Now I am implementing a Program Dependence Graph(PDG) on LLVM. I have 4 passes here: 1. ProgramDependenceGraph (a *ModulePass *on the highest level) 2. DataDependenceGraph (a Intermediate *FunctionPass*). 3. FlowDependenceAnalysis Pass (a intermediate *FunctionPass*) which uses llvm built-in AliasAnalysis (-basicaa) 4.
2011 Apr 20
3
[LLVMdev] Coarse-grained parallelism
Am 19.04.2011 um 16:44 schrieb John Criswell: > On 4/19/11 5:57 AM, Andreas Wilhelm wrote: >> >> Hello, >> >> I found some code within the pool allocation project to identify parallelizable function calls. >> Unfortunately the functionality isn't part of the current release of poolalloc (in release 14 it was). > > Can you tell me in what file(s) this
2020 Nov 18
2
samba / debian 10 / security=ads
Hi all I'm looking for some help on winbind/idmap for a new host The debian version is new on this host : debian 10 buster so samba is > root at homedir10:~# samba --version > Version 4.9.5-Debian We want to use security=ads so we join this host to the domain No problem for windows clients : they can mount shares that are accessible to their primary unix group and secondary unix
2011 Nov 15
2
xen-unstable/staging: qemu git file corrupt
Hi, when I try to build xen-unstable/staging (cs 24143) tools via make tools I get: ... got 1b6bfb99c2b55ff2e35ab61caf307dad3aebc82a got efd594c960330cc3eee44e65f5fee258c798e610 got ccc9677505c0dd2c6c5054e73a42cef2d25687b4 got 86a2a2a59a8b76117b221c712ba0a156d21441c9 error: File efd594c960330cc3eee44e65f5fee258c798e610
2001 Mar 07
5
rude
Concur ... I reckon that you need a bunch of how tos, that you can sent these rude people. I think that you are a victim of your own success. Samba has hit the mainstream, and now you are paying the price :-) Still ........ I prefer these messages to those filled with hypertext ... or worse.... 2 Meg of mime formatted drivel :-) Has anybody thanked you recently for providing so much help on
2024 Feb 18
1
Graceful shutdown doesn't stop all Gluster processes
Well, you prepare the host for shutdown, right ? So why don't you setup systemd to start the container and shut it down before the bricks ? Best Regards, Strahil Nikolov ? ?????, 16 ???????? 2024 ?. ? 18:48:36 ?. ???????+2, Anant Saraswat <anant.saraswat at techblue.co.uk> ??????: Hi Strahil, Yes, we mount the fuse to the physical host and then use bind mount to
2024 Feb 05
1
Challenges with Replicated Gluster volume after stopping Gluster on any node.
Hi, normally, when we shut down or reboot one of the (server) nodes, we call the "stop-all-gluster-processes.sh" script. But i think you did that, right? Best regards, Hubert Am Mo., 5. Feb. 2024 um 13:35 Uhr schrieb Anant Saraswat < anant.saraswat at techblue.co.uk>: > Hello Everyone, > > We have a replicated Gluster volume with three nodes, and we face a >