On Mon, Nov 3, 2008 at 5:00 PM, Bingfeng Mei <[EMAIL PROTECTED]> wrote:
> Hello,
> I found current modulo pipelining very inefficient for many loops. One reason
> is primitive cross-iteration memory dependency analysis. The
> add_inter_loop_mem_dep function in ddg.c just draws true dependency bet
On Sun, Nov 9, 2008 at 06:38, Steven Bosscher <[EMAIL PROTECTED]> wrote:
> Wasn't there a GSoC project for this last year? And this year?
>
> It'd be interesting to hear if anything came out of that...
Nothing came of that, unfortunately.
Diego.
Zhang Le wrote:
>
> The other would be make sure the destination register is different from
> source registers.
> I have read some docs, but still not sure how to do it.
That's just an earlyclobber. Search for that.
Andrew.
Diego Novillo wrote:
On Sun, Nov 9, 2008 at 06:38, Steven Bosscher <[EMAIL PROTECTED]> wrote:
Wasn't there a GSoC project for this last year? And this year?
It'd be interesting to hear if anything came out of that...
Nothing came of that, unfortunately.
There are two patches, actually. The
Hi, all,
First of all, a little background on loongson2e/2f integer insn.
This new set of insns has 3 operands. Like:
div.g d,s,t
This is a real machine insn, not a macro.
And it delivers the result very fast.
This is the user guide if you are interested in more details:
http://www.gentoo
For anyone interested, LLVM 2.4 was just released:
http://lists.cs.uiuc.edu/pipermail/llvm-announce/2008-November/30.html
http://llvm.org/releases/2.4/docs/ReleaseNotes.html
It has a number of new features, but the most user visible one is that
it compiles about 30% faster than LLVM 2.3 at
> So I think one of the possible solution would be to reverse the div.g and teq
> insn.
> And I think this is not hard to do, just modify mips_output_division()
> function.
> Also I think this is a better solution, since we can save a register.
Do you mean the modification like this?
+
+
+/* Us
