Sean O'Rourke <[EMAIL PROTECTED]> wrote: > [EMAIL PROTECTED] (Leopold Toetsch) writes: >> The interference_graph size is n_symbols * n_symbols * >> sizeof(a_pointer). This might already be too much. >> >> 2) There is a note in the source code that the interference graph could >> be done without the N x N graph array. Any hints welcome (Angel Faus!).
> It looks like the way things are used in the code, you can use an > adjacency list instead of the current adjacency matrix for the graph. Yeah. Or a bitmap. Or still better, create the interference graph per basic block. Should be much smaller then. > /s leo
