similar to: [LLVMdev] GSoC project questions.

Hi, 2013/4/12 Alex L <arphaman at gmail.com> > Hello everyone, I have a couple of questions about good project ideas for > GSoC because I'm kind of stuck thinking what I should do. > > First of all, allow me to introduce myself - I'm Alex Lorenz, a Comp Sci > student from Ireland. I would like to participate in GSoC this year, and I > would love to do something

2013/4/12 Matthieu Brucher <matthieu.brucher at gmail.com> > Hi, > > > 2013/4/12 Alex L <arphaman at gmail.com> > >> Hello everyone, I have a couple of questions about good project ideas for >> GSoC because I'm kind of stuck thinking what I should do. >> >> First of all, allow me to introduce myself - I'm Alex Lorenz, a Comp Sci >>

2013/4/24 Alex L <arphaman at gmail.com> > You may want to check the later versions of the standard also to check if >> some of your proposal is not deprecated there. >> > I had a quick check with 2008 standard, and I'm pretty sure that all of > the stuff that I chose is there, although a lot of it has various additions > and changes. > The EQUIVALENCE

----- Original Message ----- > From: "Matthieu Brucher" <matthieu.brucher at gmail.com> > To: "Alex L" <arphaman at gmail.com> > Cc: "LLVM Developers Mailing List" <llvmdev at cs.uiuc.edu> > Sent: Wednesday, April 24, 2013 12:55:44 PM > Subject: Re: [LLVMdev] GSoC project questions. > > > > > > > > >

Hi Alex, You may want to check the later versions of the standard also to check if some of your proposal is not deprecated there. The most important thing in the Fortran standard is the array support and it is a big task by itself. In my opinion, the I/O part is not the most important thing yet it is an enormous task. Usually, the Fortran routines are used externally in other computation and I/O

Hi, I don't know much about this issue, but this malloc error won't be solved by a change to delete[] or free. In fact, if you use the incorrect one for simple types, you may not notice it. The error you have seems to me like a memory corruption because you went out of bound and corrupted the memory somewhere, Valgrind may help you figure out what is going on. Cheers, Matthieu

> > You may want to check the later versions of the standard also to check if > some of your proposal is not deprecated there. > I had a quick check with 2008 standard, and I'm pretty sure that all of the stuff that I chose is there, although a lot of it has various additions and changes. The most important thing in the Fortran standard is the array support and > it is a big

On Wed, Apr 24, 2013 at 6:05 PM, Alex L <arphaman at gmail.com> wrote: > So I had a go at choosing the useful subset of > Fortran on which I would like to work on - my update proposal can be viewed > at https://gist.github.com/hyp/5434845 . Are expression parsing and AST implemented? What about type representation? Dmitri --

Hi, When I test "matmul" in the polly directory, I get the following performance data: //=============================== --> 12. Compare the runtime of the executables time ./matmul.normalopt.exe 0:23.53 real, 23.48 user, 0.00 sys time ./matmul.polly.interchanged.exe 0:22.86 real, 22.82 user, 0.01 sys time ./matmul.polly.interchanged+tiled.exe 0:22.87 real, 22.83 user, 0.00 sys

Hi all, I'm trying to build passes with the PassBuilder to optimize the result of MCJIT (I assume, this is a requirement for performance). So I do this: llvm::PassBuilder passBuilder; llvm::ModulePassManager modulePassManager = passBuilder.buildPerModuleDefaultPipeline(llvm::PassBuilder::OptimizationLevel::O3); llvm::ModuleAnalysisManager moduleAnalysisManager;

Hi again. I've though more about the full standard being too ambitious, and now I fully agree with that. So I had a go at choosing the useful subset of Fortran on which I would like to work on - my update proposal can be viewed at https://gist.github.com/hyp/5434845 . Focusing on less should also improve my productivity and lead to a better summer of code project by drastically reducing the

> Indeed, dragonegg supports Fortran, but through a gfortran bridge. The > really interesting part in Fortran is in fact arrays! > > Anyway, it's just my opinion, I'm a simple user ;) Fortran has its own standard library and it's damn big. Also, the Fortran grammar is not the simplest (or, rather - straightforward one). So this certainly looks too big for GSoC. Though, it

Thanks for the responses! > I might be wrong (I'd love to be wrong here!) but I think this is a bit > too ambitious > You might be right about it being too ambitious, it would certainly be wise to aim for less. A more polished, but less broad product is definitely better than a buggy standard compliant one, and I think that it would go better with the general philosophy of GSoC. I

As an update, it is a memory problem which I don't know how to fix. I tried to skip the problematic piece of code when in the case when the loop hangs. So I did something like : if( instr ) { LLVMContext& C = instr->getContext(); Value* values[cnt]; errs()<<"\ngy: \n"; if(!(desters==7)){ // this

> > If you are going to work on improvements in this area, then it would > help to add them to the proposal (maybe that will move other, not so > important, features out of scope). > That would be a good idea indeed. > The EQUIVALENCE keyword is deprecated, still I don't know if it is still > widely used in F77 code. I think one of the main resaons it was deprecated >

> > I had a quick read through the Fortran 90 specification, and I must say I > would be able to write a frontend for it, although arrays and io would make > it harder. But isn't Fortran already supported with dragonegg? > Indeed, dragonegg supports Fortran, but through a gfortran bridge. The really interesting part in Fortran is in fact arrays! Anyway, it's just my

Hello everyone, I was able to get all the execution paths between 2 points (basic blocks) in my program (with the condition to traverse a loop only once). I mapped all the basic blocks to integers and created a correspondent directed graph. I was able to get all the paths (a path is represented by an integer identifier). For my target program I have 72 paths, but the program hangs unexpectedly

----- Original Message ----- > From: "Anton Korobeynikov" <anton at korobeynikov.info> > To: "Matthieu Brucher" <matthieu.brucher at gmail.com> > Cc: "Bill Wendling" <isanbard at gmail.com>, "LLVM Developers Mailing List" <llvmdev at cs.uiuc.edu> > Sent: Friday, April 12, 2013 9:04:22 AM > Subject: Re: [LLVMdev] GSoC

Hello Rubyists, I''m in the position of being given the job to design and build a mission-critical web facing application for a small but growing enterprise. It is to be used by customers as needed, numbering in the tens up to the hundreds. It will collect operational data, particularly in a table around 50 columns wide, and potentially millions of rows deep, most fields being numerical.

I'm trying to write a small function (below) to compute Box & Cox transformations of x for arbitrary values of lambda. I'd like to specify a range of values for lamba (min,max,step) and am having trouble getting the for loop to work. Suggestions? Any pointers to resources for learning to write functions in R for neophyte programmers? Thanks. --Dale boxcox <-