[Libre-soc-bugs] [Bug 1044] SVP64 implementation of pow(x,y,z)

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=1044

--- Comment #36 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
(In reply to Jacob Lifshay from comment #35)

> I disagree,

that's because you're not familiar with SVP64.
https://bugs.libre-soc.org/show_bug.cgi?id=973#c5

> this algorithm isn't very suitable for vertical-first, because
> it has both operations in one and two loop nesting levels:

> this makes it not really work with rhombic REMAP.

one trick is to ave SVSTATE in a temporary SPR then put it back
and carry on.

> Therefore I'm planning on writing it to use horizontal-first with svoffset.

don't do that please. it will just need a rewrite to use vertical-first
after you have spent the time doing HF.

the purpose of the exercise here is not "get it done".
the purpose of the entire grant is to be *efficient* in the
ISA, to prove tht it is efficient, and if it is not then
*modify* the ISA to *make* it efficient.

if you have not listened to the primary designer of the ISA
who knows all of the tricks that make algoriths efficient,
thus meeting the criteria of the grant, instead doing something
that is *not* efficient, and therefore does not meet the criteria
of the grant, then how can i justify paying out the RFP?

this is as much a learning exercise for you, jacob. you are still
very unfamiliar with using REMAP. hell, everyone is as it is literally
a new computer science concept.

-- 
You are receiving this mail because:
You are on the CC list for the bug.