Re: Pitfalls in interference graph ?

Rayiner Hashem <rayiner@gmail.com>
Mon, 01 Oct 2007 23:48:37 -0700

          From comp.compilers

Related articles
Pitfalls in interference graph ? shafitvm@gmail.com (Mohamed Shafi) (2007-09-28)
Re: Pitfalls in interference graph ? SidTouati@inria.fr (ST) (2007-10-01)
Re: Pitfalls in interference graph ? torbenm@app-1.diku.dk (2007-10-01)
Re: Pitfalls in interference graph ? johnl@iecc.com (2007-10-01)
Re: Pitfalls in interference graph ? bergner@vnet.ibm.com (Peter Bergner) (2007-10-01)
Re: Pitfalls in interference graph ? marcov@stack.nl (Marco van de Voort) (2007-10-01)
Re: Pitfalls in interference graph ? rayiner@gmail.com (Rayiner Hashem) (2007-10-01)
Re: Pitfalls in interference graph ? rayiner@gmail.com (Rayiner Hashem) (2007-10-01)
Re: Pitfalls in interference graph ? jeremy.wright@microfocus.com (Jeremy Wright) (2007-10-02)
Re: Pitfalls in interference graph ? shafitvm@gmail.com (shafi) (2007-10-15)
Re: Pitfalls in interference graph ? torbenm@app-6.diku.dk (2007-10-17)
Re: Pitfalls in interference graph ? SidTouati@inria.fr (ST) (2007-10-18)
Re: Pitfalls in interference graph ? rayiner@gmail.com (Rayiner Hashem) (2007-10-21)
[2 later articles]
| List of all articles for this month |

From: Rayiner Hashem <rayiner@gmail.com>
Newsgroups: comp.compilers
Date: Mon, 01 Oct 2007 23:48:37 -0700
Organization: Compilers Central
References: 07-09-10407-10-007 07-10-010 07-10-017
Keywords: registers, optimize



> How do you specify an affinity that is not 100% necessary? Like older i386
> arch CPU's having a preference for EBX as index register ?


I don't know if there are other ways to do this, but there is a 2002
paper called "Preference Directed Graph Coloring", which describes a
systematic way to address this issue, by trying to globally optimize
the fulfillment of register preferences.



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.