similar to: [LLVMdev] LLVM Automatic Pool Allocation

MichaelFrerichs wrote: > My name is Michael Frerichs and I am a part of a research team led by Dr. Krishna Kavi at the University of North Texas. Our current work focuses on optimizing dynamic memory for multiprocessor systems. We are interested in the LLVM infrastructure and the Automatic Pool Allocation technique. We believe this tool could be useful to our research and wondered if we could

On Tuesday 23 June 2009 18:36:06 John Criswell wrote: > The Automatic Pool Allocation transform is publicly available (though > not as well publicized as LLVM). What exactly is it? (just curious!) -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e

https://bugzilla.mindrot.org/show_bug.cgi?id=2225 Bug ID: 2225 Summary: sshd core dumps when used in high scaled environments. Product: Portable OpenSSH Version: 6.2p1 Hardware: All OS: All Status: NEW Severity: major Priority: P5 Component: sshd Assignee: unassigned-bugs at

Patrick Alexander Simmons wrote: > I've been attempting to write my pass (which depends on DSA and pool > allocation) against the SVN trunk of LLVM and the llvm-poolalloc > project. However, I was thinking it might be better to use the latest > stable releases of these codebases. I know that this is the 2.5 branch > for LLVM, but are there any stable releases of pool

I've been attempting to write my pass (which depends on DSA and pool allocation) against the SVN trunk of LLVM and the llvm-poolalloc project. However, I was thinking it might be better to use the latest stable releases of these codebases. I know that this is the 2.5 branch for LLVM, but are there any stable releases of pool allocation? If so, would there be any disadvantage to my

Hi, I'm starting to code a pass which uses the analysis results of pool allocation, and I've run into a bit of a snag. Following the advice at [http://llvm.org/docs/WritingAnLLVMPass.html], I've put my new pass in the lib/Transforms subdirectory of the llvm checkout. I have the pool allocation transformation checked out in projects/llvm-poolalloc. My problem is that the pool

Not sure if anybody has noticed: The PoolAlloc release source code extracted from SVN won't even build. I tried it last night, on WinXP/Cygwin, for both the LLVM-2.5 release, as well as the latest LLVM, neither would build -- with compile-time errors. With that being said, I have no idea which LLVM release the current PoolAlloc trunk is checked in with. Could anybody point this out? Or, at

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

HI guys. I'm trying to build the poolalloc on llvm-2.0 but there exist some errors. Can you tell me which version of llvm is known to make the poolalloc build and install successful? Thanks. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20070710/4ab5e155/attachment.html>

Hello! I am very new to LLVM, and have downloaded, compiled and installed the compiler suite and read through a lot of documentation with the purpose of trying out the Pool Allocation optimization. However, I haven't been able to locate it yet: there is no mention on the website or in any of the documentation of how I may use this optimization. Reading through the mailing list archives from a

John, Thanks for the information. That comment in the source code confused me and I wanted to be sure that the installation of all the LLVM framework in the macintosh for testing the pool allocation was not going to be done in vain. The LLVM documentation states that gcc 3.4x is necessary for compiling the LLVM. On the other hand, Xtools 1.5 for Mac includes only gcc 3.3 and Xtools 2.0 includes

Patrick Alexander Simmons wrote: > 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: > Can you email me the bitcode file that is causing the problem? > [simmon12 at apoc testcases]$ opt -load >

Hi , This Is 'Suresh M' from AMD compiler team. 1) I obtained the source code of llvm and pool-alloc (relase_32 versions ) using the following commands, svn co http://llvm.org/svn/llvm-project/llvm/branches/release_32 llvm cd llvm/projects svn co http://llvm.org/svn/llvm-project/poolalloc/branches/release_32 poolalloc 2) Was able to build the binaries and libraries

John Criswell wrote: > You can use the -debug-pass=Arguments option to opt to print out which > DSA passes it is using. > > -- John T. > The argument list was this: -dsa-local -dsa-stdlib -dsa-bu -dsa-eqtd -poolalloc -preverify -domtree -verify So, the last DSA pass done would appear to have been "-dsa-eqtd". Does this mean pool allocation is using TDeq and not BUeq

Hello, I am trying to run a program optimized with the Pool Allocation, but I am receiving this error: ==================== libpoolalloc.so: undefined symbol: _ZTIN4llvm16EquivClassGraphsE -load request ignored. *** 4 DYNAMIC POOLS INITIALIZED *** *** 4 DYNAMIC POOLS ALLOCATED FROM *** MaxHeapSize = 0.062500KB HeapSizeAtExit = 0.062500KB NOTE: only valid if using Heuristic=AllPools and no

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 ) );

On Sat, 2 Apr 2005, Ricardo wrote: > Hello, > I am trying to run a program optimized with the Pool Allocation, but I am receiving this error: > > ==================== > > *** 4 DYNAMIC POOLS INITIALIZED *** > > *** 4 DYNAMIC POOLS ALLOCATED FROM *** > > MaxHeapSize = 0.062500KB HeapSizeAtExit = 0.062500KB NOTE: only valid if using > Heuristic=AllPools and no

On Sat, 2 Apr 2005, Ricardo wrote: > After applying the PA to it, the output is something like this: ... > My question is: why is this malloc necessary? > ltmp_2_5 = malloc(4u); > Shouldn't be the result a program with this malloc replaced by poolalloc? > Should I include a special flag to achieve this? Ah, sorry, my memory was wrong. The default is to perform the

OK, I give up and come grovelling, "Fork" was suggested at 18:23, it's now 22:20 and I have been through 4 different methods, all block with a 2 second delay before returning to dialplan. Here are just some of the examples I have tried, as as per the suggestions, I am closing all possible outputs in the forked process. https://docs.python.org/3.5/library/multiprocessing.html

Hi, I have installed Calibre using wine 1.3.22 . The program is not usable since adding/converting ebooks is not working. Running wine calibre-debug -g I get the following error: Exception in thread Thread-4: Traceback (most recent call last): File "threading.py", line 530, in __bootstrap_inner File "site-packages\calibre\utils\ipc\server.py", line 221, in run File