On Nov 24, 2007, "Richard Guenther" <[EMAIL PROTECTED]> wrote:
> No, hashing is fine, but doing walks over a hashtable when your algorithm > depends on ordering is not. Point. > I have patches to fix the instance of walking over all referenced > vars. Which is in the case of UIDs using bitmaps and a walk over a > bitmap (which ensures walks in UID order). Why is such memory and CPU overhead better than avoiding the divergence of UIDs in the first place? -- Alexandre Oliva http://www.lsd.ic.unicamp.br/~oliva/ FSF Latin America Board Member http://www.fsfla.org/ Red Hat Compiler Engineer [EMAIL PROTECTED], gcc.gnu.org} Free Software Evangelist [EMAIL PROTECTED], gnu.org}
