search for: workmap

...@@ /// with other intervals. BitVector JoinedLIs; + /// didWork - Tell whether we have run on this function already. + /// This allows the coalescer to either run independently or from + /// within a register allocator. + typedef std::map<const MachineFunction *, bool> WorkMap; + WorkMap didWork; + void doWork(MachineFunction &mf); + public: static char ID; // Pass identifcation, replacement for typeid SimpleRegisterCoalescing() : MachineFunctionPass((intptr_t)&ID) {}; + const char *getPassName() const{ + return "Simple Register...

On Jul 11, 2007, at 11:39 AM, David Greene wrote: > On Wednesday 11 July 2007 12:41, Tanya M. Lattner wrote: > >> I think the coalescer should be flexible enough to be run >> independent of >> the register allocator. For example, you may want to expose the >> copies >> induced by transforming out of SSA to the scheduler. If the >> scheduler is

...numerical methods both to visualization objects (with resulting changes to visualization) as well as to subsets of the data extracted from various points of the visualization pipeline. I'm rambling, but in a sense, I'm thinking of a possibly cyclic graph in the sense of the original ViSta workmaps, which would provide some form of audit-trail and reproducibility as needed. > The distinction becomes relevant if a function does "multiple dispatch"; > that is, defining methods that depend on more than one argument. (In > that sense, S3 methods made no use of the functional...