similar to: Pool allocator + safecode

Thanks for the fast response John. On Thu, Oct 1, 2015, at 04:51 PM, John Criswell wrote: > Dear Ed, > > First, someone has updated the DSA code in the poolalloc project to LLVM > 3.7, and a Master's student worked for me over the summer to update a > large chunk of SAFECode to LLVM 3.7. However, the update to LLVM 3.7 > isn't finished (we need to finish integrating

Hi, I am wondering if anyone could run ArrayBoundChecks located in SafeCode-llvm37 (https://github.com/jtcriswell/safecode-llvm37) on llvm-3.8? Thanks. Syed -- Rafi

Hello, I am Abhinav Tripathi, B.Tech 3rd Year student from IIT Indore, India. I was looking on the projects ideas page of llvm and saw that I could also propose to work on the SAFECode Open projects. As I found no mailing list on their site, I am sending this message here. Please redirect me to some other list, if required. . I found most of the projects quite alluring as I have been working on a

I hope this is the correct avenue to contact the poolalloc developers. I'm trying to use an alias analysis from the poolalloc repository and can't get it to compile with the latest LLVM. CMake is now required for LLVM, I'm pretty sure at least, but poolalloc does not seem to use it correctly. The README in the project refers to the old Makefiles. I corrected a minor CMake error and a

Hi all, Can anyone give me advice about an appropriate way for extracting number of functions from module recursively (starting from entry point). Actually it may be more than one entry point so all dependent functions and global values must be extracted. I've tried llvm-extract tool but it can't do work recursively. Maybe it would be good to write some Call Graph pass or something. Any

On 10/27/16 11:18 AM, Aliaksei Zasenka via llvm-dev wrote: > Hi all, > Can anyone give me advice about an appropriate way for extracting > number of functions from module recursively (starting from entry > point). Actually it may be more than one entry point so all dependent > functions and global values must be extracted. > > I've tried llvm-extract tool but it

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

Hi, everyone. I'm a senior at Swarthmore College and would love to work with LLVM this summer. I'm interested in systems languages and security, and I'll start a PhD on these topics this fall. I also do a good deal of open source development and auditing with OpenBSD and a variety of other projects. I spent last year's GSoC doing security auditing for Pidgin/libpurple. GSoC seems

John Criswell wrote: > If you're interested in SAFECode, the first step is to get SAFECode > working with a newer version of LLVM. A Master's student did some > work on this last summer with LLVM 3.7 but didn't finish. It would > now need to be updated to LLVM 3.8 (though I suppose a completed LLVM > 3.7 port would be fine with me). > > After that, there are

(Note to self: learn to scan the full digest for later messages in a thread before replying to an earlier message.) Ed, Your reply to John answered some of my questions, but not all, and raised a new one: > Maybe I should have been a bit clearer; we're really interested in full > memory and type safety. We want to harden the system against memory > corruption vulnerabilities.

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

Devang Patel wrote: > On Jul 25, 2008, at 12:58 PM, Marc de Kruijf wrote: > > I'd like to write a pass that does both: implements a code transformation and saves information that can be accessed by subsequent passes. > > Ideally, we want to use two separate pass. However, it is quiet possible that your requirement is unique. Would it be possible to provide more info. on what

Hello All, I am looking at exploring what benefits SAFECode has to offer over clang S.A and llvm's instrumentation tools like memory sanitizer and address sanitizer. I could come up with the following that are not provided in ASAN/MSAN/Clang S.A -> dangling pointer error and detection -> crashes in system libraries due to security vulnerabilities. In the process, I wanted to run the

Hi, On Linux I observed [root at localhost poolalloc]# find . -name *.a ./Release+Asserts/lib/LLVMDataStructure.a ./Release+Asserts/lib/poolalloc.a ./Release+Asserts/lib/AssistDS.a ./Release+Asserts/lib/libpoolalloc_fl_rt.a ./Release+Asserts/lib/libpoolalloc_rt.a ./Release+Asserts/lib/libpa_pre_rt.a ./Release+Asserts/lib/libcount.a On cygwin I observed kpawar at KPAWAR-LT

I don't really have a specific question, but, as I've been looking through pool allocation and the DS graphs extensively, I wanted to verify that my understanding of the representations used is correct. Therefore, I'm summarizing my understanding below (which, if it's correct, may hopefully be helpful to others). I would appreciate if someone who understands pool allocation

Thank you, and I apologize for conflating the two passes. My main remaining concern is about what happens when there is a node in a function's DSGraph that points to a pool (or pools, if there are multiple callers) that is not in the DSGraph of that function. For example, on page 3 of the 2005 PLDI paper, the DSGraph given for createnode(), Data is pointing to an unlabeled node in the

On 2/26/15 9:54 AM, Jyoti Rajendra Allur wrote: > Hello All, > I am looking at exploring what benefits SAFECode has to offer over clang S.A and llvm's instrumentation tools like memory sanitizer and address sanitizer. Are you looking for an off-the-shelf tool, or are you looking for approaches to use in your own tool? > I could come up with the following that are not provided in

Hi John, That worked for me. I am using llvm 3.2 only and following http://safecode.cs.illinois.edu/docs/Install.html So for I am able to make inside llvm/projects/poolalloc by doing such cosmetic changes. Now, when I tried to make inside llvm/projects/safecode, I see another error. kpawar at KPAWAR-LT ~/SAFECode/LLVM_SRC/llvm/projects/safecode $ /usr/bin/clang -cc1 -triple

Patrick Alexander Simmons wrote: > I don't really have a specific question, but, as I've been looking > through pool allocation and the DS graphs extensively, I wanted to > verify that my understanding of the representations used is correct. > Therefore, I'm summarizing my understanding below (which, if it's > correct, may hopefully be helpful to others). I

Dear Michael, If you're interested in SAFECode, the first step is to get SAFECode working with a newer version of LLVM. A Master's student did some work on this last summer with LLVM 3.7 but didn't finish. It would now need to be updated to LLVM 3.8 (though I suppose a completed LLVM 3.7 port would be fine with me). After that, there are some interesting projects on which to