search for: idx2mbbmap

...ruction index belongs to? All the required information is >> available in the >>> MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful >> to add a small function getMBBFromIndex() to this class? >> >> Sure there is a reverse map (actually just a vector) Idx2MBBMap. >> Justadd a query. > > Done. Please find a patch attached to this mail. > >>> As for (1) and (2), I could implement and provide patches for it, >>> if you think this is desirable. >> >> Yes, thanks. > > Here you are! > > -Roman > > &g...

...given > instruction index belongs to? All the required information is > available in the > > MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful > to add a small function getMBBFromIndex() to this class? > > Sure there is a reverse map (actually just a vector) Idx2MBBMap. > Justadd a query. Done. Please find a patch attached to this mail. > > As for (1) and (2), I could implement and provide patches for it, > > if you think this is desirable. > > Yes, thanks. Here you are! -Roman Lesen Sie Ihre E-Mails auf dem Handy. www.yahoo.de...

...All the required information is > >> available in the > >>> MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful > >> to add a small function getMBBFromIndex() to this class? > >> > >> Sure there is a reverse map (actually just a vector) Idx2MBBMap. > >> Justadd a query. > > > > Done. Please find a patch attached to this mail. > > > >>> As for (1) and (2), I could implement and provide patches for it, > >>> if you think this is desirable. > >> > >> Yes, thanks. > > &gt...

...ed information is >>>> available in the >>>>> MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful >>>> to add a small function getMBBFromIndex() to this class? >>>> >>>> Sure there is a reverse map (actually just a vector) Idx2MBBMap. >>>> Justadd a query. >>> >>> Done. Please find a patch attached to this mail. >>> >>>>> As for (1) and (2), I could implement and provide patches for it, >>>>> if you think this is desirable. >>>> >>>> Ye...

...ator for std::pairs, which compares the second element if the first elements are equal before making a final decision. In this case, it makes a lot of sense given that the second in the pair is just a pointer. In LiveIntervals::runOnMachineFunction, the map is sorted with this: std::sort(Idx2MBBMap.begin(), Idx2MBBMap.end(), Idx2MBBCompare()); Ok so far. Here is where the problem arises: std::lower_bound(Idx2MBBMap.begin(), Idx2MBBMap.end(), LR.start); By omitting the explicit comparator operator, the default is used which looks at second. Not a huge problem in general, s...

Hi I'm seeing something probably related to this. I'm getting an assert from the lower_bound in LiveIntervals::findLiveinMBBs (from a checking std:: VS2005 implementation). Idx2MBBMap has two elements in it, both of which have a .first of 0. (I believe because of an empty MBB in the function below, so StartIndex doesn't advance). scott On Wed, Apr 16, 2008 at 2:52 AM, Roman Levenstein <romixlev at yahoo.com> wrote: > Hi, > > In the LiveIntervalAnalysis::run...

...ut I'll take care of this soon. Evan On Apr 16, 2008, at 10:52 AM, Scott Graham wrote: > Hi > > I'm seeing something probably related to this. I'm getting an assert > from the lower_bound in LiveIntervals::findLiveinMBBs (from a checking > std:: VS2005 implementation). Idx2MBBMap has two elements in it, both > of which have a .first of 0. (I believe because of an empty MBB in the > function below, so StartIndex doesn't advance). > > scott > > On Wed, Apr 16, 2008 at 2:52 AM, Roman Levenstein > <romixlev at yahoo.com> wrote: >> Hi, >...

...tand which MBB a given instruction > index belongs to? All the required information is available in the > MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful to > add > a small function getMBBFromIndex() to this class? Sure there is a reverse map (actually just a vector) Idx2MBBMap. Just add a query. > > > 2) Is there any simple way to iterate over all instructions, where a > given live interval is live? This functionality is required by many > register allocation algorithms. I think having some special iterator > functions for that in the LiveIntervalAna...

Hi, In the LiveIntervalAnalysis::runOnMachineFunction, there is a code to compute the MBB2IdxMap, by remembering for each MBB its start and end instruction numbers: unsigned MIIndex = 0; for (MachineFunction::iterator MBB = mf_->begin(), E = mf_->end(); MBB != E; ++MBB) { unsigned StartIdx = MIIndex; for (MachineBasicBlock::iterator I = MBB->begin(), E =

Hi, I'm trying to sketch an LLVM-based implementation of the Extended Linear Scan algorithm, described in this Vivek Sarkar's paper: http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf Sarkar reports that this version of Linear Scan produces better code than graph-coloring regallocs and is also much faster (15x to 68x). I already started work on the implementation of this algorithm and have a few