similar to: [LLVMdev] Partial Redundancy Elimination

Hello, I'm having a little problem with passes that use LoopInfo. Their statistics aren't the same when I execute the same pass multiple times in the same program. After some investigation, I've found out that LoopInfo is the root of the problem. I wrote a little pass that counts the loop headers (number of basic blocks for which LoopInfo.isLoopHeader(BB) is true). I've picked

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

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 "open projects" page caught my eye, and I > decided to

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 > --------- > > the main objective of this project is to

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

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 line that I liked in the page was "Create an LLVM

Dear LLVMers, we have released a tool that uses LLVM to insert OpenACC or OpenMP 4.0 directives in programs. You can use the tool online here: http://cuda.dcc.ufmg.br/dawn/. Our tool, dawn-cc, analyzes the LLVM IR to infer the sizes of memory chunks, and to find dependences within loops. After that, we use debug information to translate the low-level information back into annotations that we

On 3/30/12 2:32 PM, Victor Campos wrote: > > 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

Dear LLVMers, we, at UFMG, have been building a large collection of compilable benchmarks. Today, we have one million C files, mined from open-source repositories, that compile into LLVM bytecodes (and from there to object files). To ensure compilation, we perform type inference on the C programs. Type inference lets us replace missing dependencies. The benchmarks are available at:

Hi, The LLVM has a good test suite. I recommend it. You can test your pass with single-source programs and multi-source programs. You can also configure the test-suite to run your test with external benchmarks within the LLVM test 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

Hi, > On Dec 31, 2016, at 8:33 AM, Fernando Magno Quintao Pereira via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Dear LLVMers, > > we have released a tool that uses LLVM to insert OpenACC or OpenMP > 4.0 directives in programs. You can use the tool online here: > http://cuda.dcc.ufmg.br/dawn/. Our tool, dawn-cc, analyzes the LLVM IR > to infer the sizes of

Hi Florian, we though about using UIUC, like in LLVM. Do you guys know if that could be a problem, given that we are mining the functions from github? > Have you thought about integrating the benchmarks as external tests into LLVM’s test-suite? That would make it very easy to play around with. We did not think about it actually. But we would be happy to do it, if the community accepts

Dear LLVMers, concerning a few points of the discussion about code-size reduction (Minutes available at https://docs.google.com/document/d/1kDsbFDtkWLceR-Y63ez04CBfvhbDN8RxWV3xXwaNUC0/edit?usp=sharing): > Do we need different levels like -Os1, -Os2, -Os3? Together with a colleague, Anderson Faustino, we spend some time finding optimization sequences that are good for code-size reduction.

> 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

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

Greetings LLVMers, I would like to add the licensed part of AnghaBench (http://cuda.dcc.ufmg.br/angha/) as an External Test in the LLVM test-suite. We have 128,411 files with their original licenses. (http://www.dcc.ufmg.br/~fernando/coisas/c_files_with_licenses.tar.gz) Each file is a single function, that compiles as is---no dependencies are needed. For instance, the commands below work for each

Dear Mehdi, I've changed your example a little bit: float saxpy(float a, float *x, float *y, int n) { int j = 0; for (int i = 0; i < n; ++i) { y[j] = a*x[i] + y[I]; // Change 'I' into 'j'? ++j; } } I get this code below, once I replace 'I' with 'j'. We are copying n positions of both arrays, 'x' and 'y': float saxpy(float a,

douglas at dcc.ufmg.br wrote: > Dear LLVMers, > > [snip] > Well, there are many other applications. In short, I would like to know if > the LLVM community would be interested in such a project. I have been > working on this for two months, and I am pretty confident I can implement > a good range analysis. I am basing my work on a paper by Zhendong and > Wagner: "A

Dear LLVMers, my name is Douglas, and I would like to participate in the Summer of Code this year. I am currently a Computer Science student at the Federal University of Minas Gerais, Brazil, and I work as a research assistant at the Programming Languages Lab, in that university. I work together with Andre Tavares and Andrei Rimsa, two summer of coders last year, and my advisor is Fernando

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