search for: computecallsitetable

On Sep 17, 2009, at 6:03 PM, Duncan Sands wrote: > Hi Bill, > >>>> Yeah. The logic will need tweaking for sure. I'm also concerned >>>> about the >>>> _Unwind_resume() call. GCC emits a call site region for it in the >>>> exception >>>> table. We...kind of do that. It looks like it's being included in >>>>

...ion I can make that seem sensible. My thinking is that the "eh.actions" list can be transformed into a compact xdata table later, after we've done machine basic block layout. I think the algorithm will be something like 1. Input: already laid out MachineFunction 2. Call EHStreamer::computeCallSiteTable to populate a LandingPadInfo vector sorted by ascending PC values 4. Iterate the LandingPadInfos, comparing the action list of each landing pad with the previous landing pad, assuming an empty action list at function start and end. 5. Model the action list as a stack, and compute the common suffix...

Thanks, Reid. These are good points. So I guess that does take us back to something more like my original proposal. I like your suggestion of having some kind of “eh.actions” intrinsic to represent the outlining rather than the extension to landingpad that I had proposed. I was just working on something like that in conjunction with my second alternative idea. What I’d really like is to have

...at the "eh.actions" list can be transformed into a > compact xdata table later, after we've done machine basic block layout. > > > > I think the algorithm will be something like > > > > 1. Input: already laid out MachineFunction > > 2. Call EHStreamer::computeCallSiteTable to populate a LandingPadInfo > vector sorted by ascending PC values > > 4. Iterate the LandingPadInfos, comparing the action list of each landing > pad with the previous landing pad, assuming an empty action list at > function start and end. > > 5. Model the action list as a st...

...at the "eh.actions" list can be transformed into a > compact xdata table later, after we've done machine basic block layout. > > > > I think the algorithm will be something like > > > > 1. Input: already laid out MachineFunction > > 2. Call EHStreamer::computeCallSiteTable to populate a LandingPadInfo > vector sorted by ascending PC values > > 4. Iterate the LandingPadInfos, comparing the action list of each landing > pad with the previous landing pad, assuming an empty action list at > function start and end. > > 5. Model the action list as a st...

...ion I can make that seem sensible. My thinking is that the "eh.actions" list can be transformed into a compact xdata table later, after we've done machine basic block layout. I think the algorithm will be something like 1. Input: already laid out MachineFunction 2. Call EHStreamer::computeCallSiteTable to populate a LandingPadInfo vector sorted by ascending PC values 4. Iterate the LandingPadInfos, comparing the action list of each landing pad with the previous landing pad, assuming an empty action list at function start and end. 5. Model the action list as a stack, and compute the common suffix...