search for: liliejay

...f it is still widely used in F77 code. I think one of the main resaons it was deprecated is that it voids all type checking (especially in modules). Matthieu -- Information System Engineer, Ph.D. Blog: http://matt.eifelle.com LinkedIn: http://www.linkedin.com/in/matthieubrucher Music band: http://liliejay.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130424/315115a1/attachment.html>

...at cs.uiuc.edu http://llvm.cs.uiuc.edu >> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev >> >> > > > -- > Information System Engineer, Ph.D. > Blog: http://matt.eifelle.com > LinkedIn: http://www.linkedin.com/in/matthieubrucher > Music band: http://liliejay.com/ > 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? -------------- next part -------------- An HTML attachment was scrubbed...

...how to support these various things, but only actually do it up front if it is in BLAS. -Hal > > > > Matthieu > > -- > Information System Engineer, Ph.D. > Blog: http://matt.eifelle.com > LinkedIn: http://www.linkedin.com/in/matthieubrucher > Music band: http://liliejay.com/ > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev >

...t; LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > > -- Information System Engineer, Ph.D. Blog: http://matt.eifelle.com LinkedIn: http://www.linkedin.com/in/matthieubrucher Music band: http://liliejay.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130412/bf17b854/attachment.html>

...t; LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > > -- Information System Engineer, Ph.D. Blog: http://matt.eifelle.com LinkedIn: http://www.linkedin.com/in/matthieubrucher Music band: http://liliejay.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130528/aabaf601/attachment.html>

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 for LLVM, because it's a great project. I am familiar with LLVM api, as last

...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 ;) -- Information System Engineer, Ph.D. Blog: http://matt.eifelle.com LinkedIn: http://www.linkedin.com/in/matthieubrucher Music band: http://liliejay.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130412/1697b961/attachment.html>

...t; LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > > -- Information System Engineer, Ph.D. Blog: http://matt.eifelle.com LinkedIn: http://www.linkedin.com/in/matthieubrucher Music band: http://liliejay.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130424/b082bc23/attachment.html>

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

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

...front > if it is in BLAS. > > -Hal > > > > > > > > > Matthieu > > > > -- > > Information System Engineer, Ph.D. > > Blog: http://matt.eifelle.com > > LinkedIn: http://www.linkedin.com/in/matthieubrucher > > Music band: http://liliejay.com/ > > > > _______________________________________________ > > LLVM Developers mailing list > > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > > > -------------- next part -------------- An HTML...

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

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

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

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