Commit 669ff14e by Bernd Schmidt Committed by Bernd Schmidt

Make hash values more random

From-SVN: r40931
parent 3553b09d
2001-03-28 Bernd Schmidt <bernds@redhat.com>
* cselib.c (hash_rtx): Don't do tail recursion elimination by hand.
2001-03-28 Richard Henderson <rth@redhat.com> 2001-03-28 Richard Henderson <rth@redhat.com>
* config/rs6000/rs6000.h (EPILOGUE_USES): Use TARGET_AIX, * config/rs6000/rs6000.h (EPILOGUE_USES): Use TARGET_AIX,
......
...@@ -566,8 +566,6 @@ hash_rtx (x, mode, create) ...@@ -566,8 +566,6 @@ hash_rtx (x, mode, create)
const char *fmt; const char *fmt;
unsigned int hash = 0; unsigned int hash = 0;
/* repeat is used to turn tail-recursion into iteration. */
repeat:
code = GET_CODE (x); code = GET_CODE (x);
hash += (unsigned) code + (unsigned) GET_MODE (x); hash += (unsigned) code + (unsigned) GET_MODE (x);
...@@ -637,18 +635,8 @@ hash_rtx (x, mode, create) ...@@ -637,18 +635,8 @@ hash_rtx (x, mode, create)
if (fmt[i] == 'e') if (fmt[i] == 'e')
{ {
rtx tem = XEXP (x, i); rtx tem = XEXP (x, i);
unsigned int tem_hash; unsigned int tem_hash = hash_rtx (tem, 0, create);
/* If we are about to do the last recursive call
needed at this level, change it into iteration.
This function is called enough to be worth it. */
if (i == 0)
{
x = tem;
goto repeat;
}
tem_hash = hash_rtx (tem, 0, create);
if (tem_hash == 0) if (tem_hash == 0)
return 0; return 0;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment