similar to: [LLVMdev] ACATS

Dear Community, I'm working on a project for Google Summer of Code, to implement the ABCD and Bitwidth analysis in LLVM. I'm not going to extend the description of the project here, this link shows my proposal http://homepages.dcc.ufmg.br/~andrelct/projects/gsoc_2009/proposal. I have been in some discussions on this list about Ada and SSI that helped on my decisions up to this

Mai, Haohui wrote: > Dear Nicolas, > > I'm curious why you are using ABCD in vmkit. Do you need any features > from static array bounds checking? As far as I know, SAFECode has a > number of implementation for that. > > Thanks. > > Haohui > > On Thu, 2009-06-04 at 20:48 +0200, Nicolas Geoffray wrote: > >> Dear Andre, >> >> That's

Andre Tavares wrote: > Can someone tell me how to use ACATS? I have searched for documentation, > but found none. The ACATS is here: http://www.ada-auth.org/acats.html including various documentation. It stands for "Ada Conformity Assessment Test Suite". - Bob

By static array bounds checking, I mean eliminating array bounds checking which can be proved ``safe'' at compile-time. Well, even though there are a lot of approaches of doing this, I believe that having an implementation of ABCD would very useful. It would be even more useful if LLVM can have a general framework for doing static array bounds checking -- just like the aliasing framework.

Dear Nicolas, I'm curious why you are using ABCD in vmkit. Do you need any features from static array bounds checking? As far as I know, SAFECode has a number of implementation for that. Thanks. Haohui On Thu, 2009-06-04 at 20:48 +0200, Nicolas Geoffray wrote: > Dear Andre, > > That's great! Thanks for the blog. I am really looking forward into > using ABCD in vmkit!

Dear Andre, That's great! Thanks for the blog. I am really looking forward into using ABCD in vmkit! Cheers, Nicolas Andre Tavares wrote: > Dear Community, > > I'm working on a project for Google Summer of Code, to implement the > ABCD and Bitwidth analysis in LLVM. I'm not going to extend the > description of the project here, this link shows my proposal >

Hello, I'm working on a project to remove unnecessary array bound checks in Java. For this purpose I will need to use llvm-java. What is the state of llvm-java? Can someone explain how to build and use it? I saw some old emails on the list, and some about a SoC 2008 on Java, but I didn't find anything regarding its current state and documentation. Regards, -- Andre Tavares Master

Duncan Sands wrote: > Hi Andre, > > >> In file included from ../../gcc/llvm-backend.cpp:23: >> ../../gcc/llvm-internal.h:31: fatal error: vector: No such file or directory >> compilation terminated. >> > > line 31 of llvm-internal.h is: > > #include <vector> > > so if that's failing then your C++ compiler is somehow borked. >

Vikram S. Adve wrote: > On Jun 5, 2009, at 9:26 AM, Mai, Haohui wrote: > > >> By static array bounds checking, I mean eliminating array bounds >> checking >> which can be proved ``safe'' at compile-time. >> > > Even though SAFECode does have such a pass, there are some tradeoffs > with the current version: > > 1. It uses an

I'm developing the ABCD algorithm for LLVM, and I will need to store some information as a digraph. I was thinking of a list of adjacency, implemented with a map<Instruction, Set<Node>>. The node would have an Instruction and a value. I opted for map and set, because I will create the graph once and will search on it a bunch of times, and will never remove a node. Is there

Andr? Tavares wrote: > Thanks for the link Duff. You're welcome. > I downloaded ACATS, but could not run it on LLVM. Could not find any > instructions that could lead me to do so. Do you know how can do it? Compiler vendors are expected to write their own scripts, which is not a trivial task. The "B Tests" have deliberate errors, marked with "-- ERROR:"

Duncan Sands wrote: > Hi Andre, > >> my g++ is broken, but I used g++-4.3 and it worked. Unfortunately there >> is another problem. If I compile with llvm-gcc the ali file resulting >> says V "GNAT Lib v4.2" on the first line. > > yes, that's because llvm-gcc is based on gcc 4.2. > > So it compiled version 4.2 and >> so gnatbind and gnatlink

Duncan Sands wrote: > Hi Andre, > > >> I'm trying to build LLVM-gcc to compile Ada. >> > > excellent! > > But I'm having a few problems. > > Oops :( > > >> Now when I ran make I get an error that for me it seams very weird. >> >> ../../gcc/c-format.c: In function 'set_Wformat': >> ../../gcc/c-format.c:48: error:

Hello, I'm trying to build LLVM-gcc to compile Ada. But I'm having a few problems. First thing I did was install gnat 2007. In the bin directory there is a gcc version 4.1. So I think that these versions are good for Ada. Now when I ran make I get an error that for me it seams very weird. ../../gcc/c-format.c: In function 'set_Wformat': ../../gcc/c-format.c:48: error:

Duncan Sands wrote: > Hi Eric, > > >> I'm having problems building llvm-gcc for Ada, which may or may not be >> similar to the trouble Andre was having recently. I'm trying to build >> it on Fedora 10 (32-bit), using the instructions on the web site. The >> make terminates with a gnatbind error: >> >> gcc -c -g -O2 -gnatpg -gnata

Hello, LLVM-Java has been rendered obsolete by http://vmkit.llvm.org/ so look into using VMKit instead. --Sam ----- Original Message ---- > From: Andre Tavares <andrelct at dcc.ufmg.br> > To: LLVMdev at cs.uiuc.edu > Sent: Monday, May 18, 2009 10:09:42 AM > Subject: [LLVMdev] llvm-java > > Hello, > > I'm working on a project to remove unnecessary array

Dear Duncan, Everything worked out with your help. Thanks. I'm now looking at bound checks that an Ada program has, so I can remove all possible. It seams that Ada already does some optimization to remove bound checks. Do you know how are they done, and where? I tested two codes (below) and the first code did not produce any bound check and the second produced two bound checks. -- -- Simple

Dear LLVM Community, I am one of the summer of coders working on LLVM this year. My project is to implement the ABCD algorithm for array bounds checking, and also a bitwidth analysis that maps variables to an approximation of its size in bits. To implement this, I will have to simulate a intermediate representation called SSI (Static Single Information) form on top of LLVM SSA

I tried to make 5 separate patches, but as they are constructive, they had information from the last one. So I will post one by one as it gets on the tree. 1. We had a function isUsedInTerminator that tested if a comparator was used in the terminator of its parent BasicBlock. This is wrong because a comparator can be created in a BasicBlock and used in the terminator of other BasicBlock, and

Why not use SmallPtrSet instead of std::vector? Isn't there something in LLVM I can use? Eli Friedman wrote: > On Mon, Jul 6, 2009 at 12:32 PM, Andre Tavares<andrelct at dcc.ufmg.br> wrote: > >> I was thinking of a list of adjacency, implemented with a >> map<Instruction, Set<Node>>. The node would have an Instruction and a >> value. I opted for