similar to: [LLVMdev] Graph Coloring RA

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

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

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.

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

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:

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 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:

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!

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. >

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

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

Dear LLVM Community, I'm a Computer Science master student at UFMG, Brasil. I'm interested in taking part on Google Summer of Codes 2009. My idea is not on the LLVM list, but I have written a project description to make my intentions clear. My project is attached as a pdf file. Regards, -- Andre Tavares Master Student in Computer Science - UFMG - Brasil http://dcc.ufmg.br/~andrelct

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 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. Something like

Hello, in the description of SimplifyCFG, it says that it can "Eliminates PHI nodes for basic blocks with a single predecessor." I tested this pass with a program that has phi nodes with a single predecessor and it did not remove it. I also looked in the code and found nothing to remove it. I'm I missing something, or it does not remove phis with a single predecessor? My

Nicolas Geoffray wrote: > Andrew Haley wrote: > >> I should have asked a better question. By "does it work" I meant something >> like >> >> for (int i = 0; i < a.length; i++) >> System.out.println(a[i]); >> >> > > OK, so no :) VMKit does not know that a[i] is related to a.length. I > believe Andre's

2009/3/27 Andre Tavares <andrelct at dcc.ufmg.br> > I'm a Computer Science master student at UFMG, Brasil. I'm interested in > taking part on Google Summer of Codes 2009. My idea is not on the LLVM list, > but I have written a project description to make my intentions clear. My > project is attached as a pdf file. By changing LLVM IR from SSA to SSI, you propose to

Nicolas Geoffray wrote: > Hi Andre? > > Andre Tavares wrote: > >> Thanks for all answers. I will consider them all before I start coding. >> >> I have another discussion that I would like to hear from you. >> >> I can implement SSI in two different ways. Analysis or Transformation Pass. >> >> As an Analysis Pass, I would create a SSI

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