This is the mail archive of the
mailing list for the GCC project.
Re: [tree-ssa]: Implementing unimodular and non-singular loop transforms
On Tue, Jan 06, 2004 at 12:54:19PM -0500, Daniel Berlin wrote:
> I didn't mention option #3, which is
> Write our own matrix math package, and rewrite the lambda algorithms
> because i really have a hard time believing there is no matrix math
> package we can use.
Not sure what kind of matrix math you want, but surely the fallback
would be BLAS. I expect some of that would start to get used by
gfortran anyway, for various high-level constructs.