search for: anticipat

...lacements: 1. Try to use live intervals of CSRs that might be available when PEI runs. The idea here is that each CSR used in a function will have one or more defs which dominate one or more uses. Live intervals might lead me to the MBBs in which to place spills/restores. 2. Use "anticipatibility" (Antic{In,Out} sets) to find the points from which all outgoing paths contain defs or uses of a CSR, and use "availability" (Avail{In,Out} sets) to find the points such that all incoming paths contain defs or uses of a CSR. We place a spill for a CSR at the earlie...

Hi John, It looks pretty good. Thanks for working on this. Some comments: 1. Some of the functions that you introduced, e.g. stringifyCSRegSet probably ought to be "static" and ifdef'ed out when NDEBUG is defined. 2. + // DEBUG + if (! MBB->empty() && ! CSRUsed[MBB].intersects(restore)) { + MachineInstr* MI = BeforeI; + DOUT <<

...SRs that might be available when > PEI runs. > The idea here is that each CSR used in a function will have one > or more > defs which dominate one or more uses. Live intervals might lead > me to > the MBBs in which to place spills/restores. > > 2. Use "anticipatibility" (Antic{In,Out} sets) to find the points > from which all > outgoing paths contain defs or uses of a CSR, and use > "availability" > (Avail{In,Out} sets) to find the points such that all incoming > paths contain > defs or uses of a CSR. We p...

...to use live intervals of CSRs that might be available when PEI runs. >     The idea here is that each CSR used in a function will have one or more >     defs which dominate one or more uses. Live intervals might lead me to >     the MBBs in which to place spills/restores. > 2. Use "anticipatibility" (Antic{In,Out} sets) to find the points from which > all >     outgoing paths contain defs or uses of a CSR, and use "availability" >     (Avail{In,Out} sets) to find the points such that all incoming paths > contain >     defs or uses of a CSR. We place a spil...