similar to: [LLVMdev] llvm-java

Displaying 20 results from an estimated 10000 matches similar to: "[LLVMdev] llvm-java"

2009 May 18
0
[LLVMdev] llvm-java
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
2009 Jun 05
2
[LLVMdev] SSI and ABCD for LLVM
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!
2009 Jun 04
2
[LLVMdev] SSI and ABCD for LLVM
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
2009 Jun 05
0
[LLVMdev] SSI and ABCD for LLVM
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
2009 Aug 03
1
[LLVMdev] ACATS
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
2009 Jun 04
0
[LLVMdev] SSI and ABCD for LLVM
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 >
2009 May 25
2
[LLVMdev] LLVM-gcc for Ada
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:
2009 Jul 06
4
[LLVMdev] LLVM Graph Representation
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
2009 May 19
2
[LLVMdev] llvm-java
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 Jun 02
0
[LLVMdev] LLVM-gcc for Ada
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 -I- -I. -Iada > -I../../llvm-gcc-4.2/gcc/ada
2009 Jun 05
2
[LLVMdev] SSI and ABCD for LLVM
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.
2009 May 25
0
[LLVMdev] LLVM-gcc for Ada
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. How did you arrange to use the right gcc for the build? Maybe that's getting in the way of
2009 Jun 02
2
[LLVMdev] LLVM-gcc for Ada
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 -I- -I. -Iada -I../../llvm-gcc-4.2/gcc/ada ../../llvm-gcc-4.2/gcc/ada/gnat1drv.adb -o ada/gnat1drv.o
2009 Jul 06
0
[LLVMdev] LLVM Graph Representation
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
2009 Mar 27
2
[LLVMdev] GSoC 2009 application
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
2009 May 19
3
[LLVMdev] llvm-java
Nicolas Geoffray wrote: > Andrew Haley wrote: >> Right, so that part should be trivial. So, does the array bounds check >> elimination already work? If it does, that will considerably reduce >> the work that Andre needs to do. To say the least... >> >> > > Trivial bounds check elimination already work, such as tab[2] = 1; > tab[1] = 2 (the second
2009 Aug 03
1
[LLVMdev] ACATS
Hello, I have written a LLVM pass for strongly typed languages. My pass implements the ABCD algorithm. I'm not going to get into what is ABCD, since it has been discussed here. I would like to test it, and on my proposal Duncan Sands told me to use Ada ACATS. Can someone tell me how to use ACATS? I have searched for documentation, but found none. Thanks, -- Andre Tavares Master
2009 Jun 02
1
[LLVMdev] LLVM-gcc for Ada
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
2009 Jul 06
1
[LLVMdev] LLVM Graph Representation
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
2009 May 19
0
[LLVMdev] llvm-java
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 optimizations will take care of that. Nicolas