similar to: [LLVMdev] DSA - LocalDataStructures pass does not create DSGraphs

Hi, I believe shouldHaveNodeForValue() should return false for ConstantPointerNullValue. Fixed in r121707. Arushi On Mon, Dec 13, 2010 at 12:10 PM, Kevin Streit <kevin.streit at googlemail.com>wrote: > I'm using BUDataStructures... But I tried LocalDatastructures and it didn't > work either... > On Dec 13, 2010 6:52 PM, "Arushi Aggarwal" <arushi987 at

Hi, all: Recently I am debugging the DSA and want to learn how it work, and now I am checking the local datastructure analysis. I use the following command to print the graph: (gdb) p g.dump() digraph DataStructures { label="Function addG"; Node0xe1f3a0 [shape=record,shape=Mrecord,label="{ i32: MRE\n|{<g0>}}"]; Node0xe1f4d0

Hi all, I just ran into a strange problem. When using the Equivalence-class Bottom-up Data Structure Analysis pass and pool allocation, I noticed some objects using different pool descriptors where I expected them to be in the same pool. We use svn revision 66285 of the DSA. The following 2 programs expose the problem. First the version that runs correctly, ie. producing a single DSNode.

On Wed, Apr 23, 2008 at 11:59 PM, John Criswell <criswell at cs.uiuc.edu> wrote: > Dear Tianwei, > > You can use the -analyze option to the opt tool to tell the DSA passes > to store their results in files. When you use the -analyze option, the > DSA passes will create a separate file for each function (and possible > one file to hold the globals graph). For this reason,

Dear Tianwei, You can use the -analyze option to the opt tool to tell the DSA passes to store their results in files. When you use the -analyze option, the DSA passes will create a separate file for each function (and possible one file to hold the globals graph). For this reason, I recommend running opt in a special empty directory because DSA will generate *a lot* of files. Second, to

Tianwei wrote: > On Wed, Apr 23, 2008 at 11:59 PM, John Criswell <criswell at cs.uiuc.edu<mailto:criswell at cs.uiuc.edu>> wrote: > Dear Tianwei, > > You can use the -analyze option to the opt tool to tell the DSA passes > to store their results in files. When you use the -analyze option, the > DSA passes will create a separate file for each function (and possible

Trying to build asterisk 1.6.0-rc3, it fails with this message: make[2]: Entering directory `/home/fhimpe/rpm/BUILD/asterisk-1.6.1.0-rc3/ main/editline' /bin/sh makelist -h common.c > common.h /bin/sh makelist -h emacs.c> emacs.h /bin/sh makelist -h vi.c > vi.h /bin/sh makelist -fh common.h emacs.h vi.h > fcns.h /bin/sh makelist -fc common.h emacs.h vi.h > fcns.c if uname -s |

Has anyone done any comparisons of bitcode vs native code (.o) in terms of size? TIA. Reed

On Friday, December 13, 2013 23:15:45 reed kotler wrote: > Has anyone done any comparisons of bitcode vs native code (.o) in terms > of size? > > TIA. > > Reed > > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev maybe

[Q.] How to create an array of lists, or structures the most elegant way? There have been questions in the past but none too recently...I want to know if the following looks OK to you guys or if there is a better way to create an array of lists: # PREAMBLE ... JUST TO GET THINGS GOING makeList<- function(data, anythingElse) { rval <- list( data = data, anythingElse =

Hi, I'm using DSAnalysis in order to get some points to information. In my particular case for a CallSite. Everything is working well except for some special cases. Consider the following example code: // ====================== void m(short *s) { return; } int main() { m(0); } // ====================== The call to method m in the main method is translated to

On 12/14/2013 04:06 AM, sebald.ziegler.maillist at ikolus.de wrote: > On Friday, December 13, 2013 23:15:45 reed kotler wrote: >> Has anyone done any comparisons of bitcode vs native code (.o) in terms >> of size? >> >> TIA. >> >> Reed >> >> >> _______________________________________________ >> LLVM Developers mailing list >>

Thanks for the answer I am trying to test the PA with a program very similar to the one used as an example in the paper located here: http://llvm.cs.uiuc.edu/pubs/2003-04-29-DataStructureAnalysisTR.html The program is as follows: ========================== struct list { struct list *Next; }; struct list *makeList (int Num) { struct list *New = malloc ( sizeof ( struct list ) );

Hi, I'm trying to run the pool allocation pass through opt, and I'm running into problems. It segfaults frequently; for example, it does this when the input is a simple Hello World program: [simmon12 at apoc testcases]$ opt -load /home/vadve/simmon12/llvm/llvm/projects/llvm-poolalloc/Debug/lib/libLLVMDataStructure.so -load

I have checked in a directory called test/DSGraphs, with one subdirectory for each of the test cases in test/Programs/{Single,Multi}Source/. Running gmake in test/DSGraphs will generate DS graphs for each of the programs for which the bytecode for the original program exists. This includes graphs for a number of large benchmarks, such as the SPEC codes that currently have bytecode available.

A note to people working on DSGraph related projects: I just checked in a bunch of fixes and minor changes that affect how the DSGraphs are built, and some minor representational fixes. With these changes, the DSGraph interface is pretty much frozen from my end. There are two big caveats though: 1. Bugs still exist. There are a couple of asserts that may be triggered for unimplemented

I've been trying to merge DSGraphs from different Functions, but i'm not going anywhere. For a Function F and DSGraph G, I tried this (assumming no SCC in the callgraph): vector<DSCallSite> CSV = G->getAuxFunctionCalls(); for (vector<DSCallSite>::iterator I = CSV.begin(), E = CSV.end(); I != E; I++) { Value *V = I->getCallInst().getOperand(0); Function &SF

I use the following code to do the depth first search on the DSGraph. And I always got this error message. Couldn't figure out what's wrong. Could you please let me know? Besides, I really have no idea about what those functions do. Is there any documentation about DSGraph functions besides the pool allocation paper? Thanks, xiaodong Code: for( df_iterator<DSNode*> I =

>Message: 11 >Date: Sun, 28 Aug 2005 11:46:29 +0800 >From: "chris" <chris@fivestartel.com> >Subject: [Asterisk-Users] error compiling on solaris 10 >To: "Asterisk Users Mailing List - Non-Commercial Discussion" <asterisk-users@lists.digium.com> >Message-ID: <003a01c5ab83$149a9e30$650fa8c0@acid> >Content-Type: text/plain;

This fixes a long standing issue where it was not possible to do "make usr/klibc/arch/x86_64/longjmp.o" in the kernel. The principle is that all .o files to be part of klibc are listed with klib-y. For each directory a klib.list file is made that specify all .o file and the final AR then adds all .o files to create libc.a. This patch introduce the infrastructure and converts x86_64 to