search for: ernani

Displaying 18 results from an estimated 18 matches for "ernani".

2013 Oct 29
1
[LLVMdev] Non-deterministic behavior when using LoopInfo pass in LLVM
...oopInfo.isLoopHeader(BB) is true). I've picked one of the programs in the LLVM test suite benchmarks and in three consecutive tests the number of loop headers was different. Does anybody know if this behavior is correct? If so, I would like to know the logic behind this pass. Thanks, Raphael Ernani P.S.: Here is the output (a similar variation occurs when I run my pass without -mem2reg, -instnamer, and -break-crit-edges): raphael at ubuntu:~/llvm-3.3/projects/test-suite/SingleSource/Benchmarks/Stanford/Output$ opt -mem2reg -instnamer -break-crit-edges -load MyModule.so -my-counter -stats O...
2012 May 23
0
[LLVMdev] LLVM test a pass
...st suite. You can also run some programs after you use your pass, to verify if your pass don't affect the behavior of the compiled program. You can do it with the test suite, too. You just have to put the instructions to run the compiled program in the Makefile of your test. Regards, Raphael Ernani 2012/5/23 Rinaldini Julien <julien.rinaldini at heig-vd.ch>: > Hi, > > I'm currently developping a pass for LLVM and I was wondering what's the best way to test if it work correctly. > > Right now to test my pass, I'm compiling libtomcrypt with LLVM and an other t...
2003 Nov 11
1
Call indicators for Brazil and other countries
Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: This is a digitally signed message part Url : http://lists.digium.com/pipermail/asterisk-users/attachments/20031111/8683cced/attachment.pgp
2012 May 23
3
[LLVMdev] LLVM test a pass
Hi, I'm currently developping a pass for LLVM and I was wondering what's the best way to test if it work correctly. Right now to test my pass, I'm compiling libtomcrypt with LLVM and an other time LLVM+my pass. After that I run the test framework of libtomcrypt and compare the result. Is there a best way to do that? Maybe using the test suite from LLVM is better (I tought it used
2012 Mar 30
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. > One particular idea, in your &qu...
2012 Aug 06
0
[LLVMdev] Partial Redundancy Elimination
Dear llvmers, I've noticed that since the version 2.7 we don't have a pass named gnvpre anymore. Is there any pass that does PRE in the current version of LLVM? Regards, Raphael Ernani
2013 Feb 28
0
[LLVMdev] Problem linking class to a pass in a loadable module
Check out the bug report at http://llvm.org/bugs/show_bug.cgi?id=13144 and try adding KEEP_SYMBOLS := 1 to tools/opt/Makefile like the OP suggests. Good luck. ----- Original Message ----- From: Raphael Ernani Rodrigues Sent: 02/28/13 05:59 PM To: LLVM Developers Mailing List Subject: Problem linking class to a pass in a loadable module Dear LLVMers, I have a class X that represents a set of Value* in a specific way. That class is stored in two files: X.cpp and X.h The class X works perfectly in a pass...
2003 Jun 27
1
Channel for virtual modem
Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: This is a digitally signed message part Url : http://lists.digium.com/pipermail/asterisk-users/attachments/20030628/f15a3654/attachment.pgp
2012 Mar 30
4
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
Dear LLVMers, My name is Raphael Ernani, and I am doing my MsC at the Federal University of Minas Gerais, Brazil. I have been using LLVM for a while, and I would like to participate in this year's Summer of Code. One particular idea, in your "open projects" page caught my eye, and I decided to write a proposal about it. The...
2012 Apr 05
1
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
On 4/3/12 9:54 AM, Raphael Ernani Rodrigues wrote: > Dear LLVMers, > > I wrote a new proposal, to improve the static array bounds checking in > SAFEcode, as follows: > > > > Improving static array bounds checking in SAFEcode > ================================================== > > > Objective &gt...
2012 Aug 06
3
[LLVMdev] How to call some transformation passes (LoopRotate and LoopUnroll) from my own pass
Hello, I wrote my own pass which needs to do some loop unrolling. I can perform loop unrolling via opt: opt -mem2reg -loops -loop-simplify -loop-rotate -lcssa -loop-unroll -unroll-count=50 mytest.bc -o mytest.bc This command works perfectly. However, what I really want is to produce the **same behavior** but from my own pass (i.e., I don't want to use opt). I wrote a Module pass which
2012 Mar 31
0
[LLVMdev] GSoC - Range Analysis
...p/range-analysis/wiki/HowToUseRangeAnalysisInAnotherPass > about how to use our range analysis. I'd like to look into that, but my schedule to date hasn't permitted me to do so. We have a new person, though, that might be able to look into that in the coming months. It seems Raphael Ernani Rodrigues may be interested in working on it, too. > > > The idea of integrating your pass as a lazy value pass sounds good. The > > question I have is what optimizations benefit from LazyInfo? I only see > > one or two transforms that use it in LLVM 3.0. > > Yes, I d...
2012 Apr 03
3
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
On Fri, Mar 30, 2012 at 11:49 AM, John Criswell <criswell at illinois.edu>wrote: > On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. > One particular idea, in you...
2012 Mar 30
3
[LLVMdev] GSoC - Range Analysis
> What version of LLVM does your analysis use currently? We are working with LLVM 3.0 (stable release) > It sounds like your analysis is fast. Can you show results on how fast it > is on various programs? Do you have measurements on how much memory it > uses? How large is the largest program you've compiled with it? Yes, we have a very extensive report about it. Take a look
2012 Apr 03
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
Dear LLVMers, I wrote a new proposal, to improve the static array bounds checking in SAFEcode, as follows: Improving static array bounds checking in SAFEcode ================================================== Objective --------- the main objective of this project is to improve the static array bounds checking engine used in SAFECode. It was written after the open project at
2012 Aug 02
0
[LLVMdev] Problem to generate an executable file of 403.gcc (SPEC2006)
Dear llvmers, I decided to write my own scripts to compile the SPEC programs, and they work fine, except with 403.gcc. Basically, I take the file 403.gcc.linked.rbc from the ...\Output folder that the LLVM test suite produces. Then I use this linked.rbc file to generate an executable file via the following commands: llc 403.gcc.linked.rbc -o 403.gcc.linked.s clang 403.gcc.linked.s -o
2013 Feb 28
0
[LLVMdev] Problem linking class to a pass in a loadable module
Dear LLVMers, I have a class X that represents a set of Value* in a specific way. That class is stored in two files: X.cpp and X.h The class X works perfectly in a pass that I already have. However, I need to use that class in some other passes, but I don't want to have a copy of X.cpp and X.h in every pass folder. I've tried to do the following: - put X.h in the folder
2012 Apr 02
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
Dear John,     in the last e-mail we'd exchanged I forgot to CC the llvmdev list, so I am copying the e-mail back to the list. > One thing I should point out is that SAFECode and SoftBound (ideally) should be using a static array bounds checking algorithm that is sound with respect to integer overflow.  For example, x < x+5 is always true if x is an integer, but it's not always