Fix apostrophos.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81856 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman
2009-09-15 15:08:33 +00:00
parent 59136251f3
commit 75144f93eb
7 changed files with 8 additions and 8 deletions

View File

@@ -30,7 +30,7 @@ namespace llvm {
template <typename T, unsigned N> template <typename T, unsigned N>
class SmallSet { class SmallSet {
/// Use a SmallVector to hold the elements here (even though it will never /// Use a SmallVector to hold the elements here (even though it will never
/// reach it's 'large' stage) to avoid calling the default ctors of elements /// reach its 'large' stage) to avoid calling the default ctors of elements
/// we will never use. /// we will never use.
SmallVector<T, N> Vector; SmallVector<T, N> Vector;
std::set<T> Set; std::set<T> Set;

View File

@@ -65,7 +65,7 @@ public:
const Type *NewTy) = 0; const Type *NewTy) = 0;
/// The other case which AbstractTypeUsers must be aware of is when a type /// The other case which AbstractTypeUsers must be aware of is when a type
/// makes the transition from being abstract (where it has clients on it's /// makes the transition from being abstract (where it has clients on its
/// AbstractTypeUsers list) to concrete (where it does not). This method /// AbstractTypeUsers list) to concrete (where it does not). This method
/// notifies ATU's when this occurs for a type. /// notifies ATU's when this occurs for a type.
/// ///

View File

@@ -732,7 +732,7 @@ public:
for (typename InvBlockTraits::ChildIteratorType I = for (typename InvBlockTraits::ChildIteratorType I =
InvBlockTraits::child_begin(BB), E = InvBlockTraits::child_end(BB); InvBlockTraits::child_begin(BB), E = InvBlockTraits::child_end(BB);
I != E; ++I) I != E; ++I)
if (DT.dominates(BB, *I)) // If BB dominates it's predecessor... if (DT.dominates(BB, *I)) // If BB dominates its predecessor...
TodoStack.push_back(*I); TodoStack.push_back(*I);
if (TodoStack.empty()) return 0; // No backedges to this block... if (TodoStack.empty()) return 0; // No backedges to this block...
@@ -758,7 +758,7 @@ public:
if (LoopT *SubLoop = if (LoopT *SubLoop =
const_cast<LoopT *>(getLoopFor(X))) const_cast<LoopT *>(getLoopFor(X)))
if (SubLoop->getHeader() == X && isNotAlreadyContainedIn(SubLoop, L)){ if (SubLoop->getHeader() == X && isNotAlreadyContainedIn(SubLoop, L)){
// Remove the subloop from it's current parent... // Remove the subloop from its current parent...
assert(SubLoop->ParentLoop && SubLoop->ParentLoop != L); assert(SubLoop->ParentLoop && SubLoop->ParentLoop != L);
LoopT *SLP = SubLoop->ParentLoop; // SubLoopParent LoopT *SLP = SubLoop->ParentLoop; // SubLoopParent
typename std::vector<LoopT *>::iterator I = typename std::vector<LoopT *>::iterator I =

View File

@@ -575,7 +575,7 @@ namespace llvm {
//===--------------------------------------------------------------------===// //===--------------------------------------------------------------------===//
/// SCEVUnknown - This means that we are dealing with an entirely unknown SCEV /// SCEVUnknown - This means that we are dealing with an entirely unknown SCEV
/// value, and only represent it as it's LLVM Value. This is the "bottom" /// value, and only represent it as its LLVM Value. This is the "bottom"
/// value for the analysis. /// value for the analysis.
/// ///
class SCEVUnknown : public SCEV { class SCEVUnknown : public SCEV {

View File

@@ -155,7 +155,7 @@ private: // Intermediate data structures
MachineInstr *FindLastPartialDef(unsigned Reg, unsigned &PartDefReg); MachineInstr *FindLastPartialDef(unsigned Reg, unsigned &PartDefReg);
/// hasRegisterUseBelow - Return true if the specified register is used after /// hasRegisterUseBelow - Return true if the specified register is used after
/// the current instruction and before it's next definition. /// the current instruction and before its next definition.
bool hasRegisterUseBelow(unsigned Reg, MachineBasicBlock::iterator I, bool hasRegisterUseBelow(unsigned Reg, MachineBasicBlock::iterator I,
MachineBasicBlock *MBB); MachineBasicBlock *MBB);

View File

@@ -27,7 +27,7 @@ class TimerGroup;
class raw_ostream; class raw_ostream;
/// Timer - This class is used to track the amount of time spent between /// Timer - This class is used to track the amount of time spent between
/// invocations of it's startTimer()/stopTimer() methods. Given appropriate OS /// invocations of its startTimer()/stopTimer() methods. Given appropriate OS
/// support it can also keep track of the RSS of the program at various points. /// support it can also keep track of the RSS of the program at various points.
/// By default, the Timer will print the amount of time it has captured to /// By default, the Timer will print the amount of time it has captured to
/// standard error when the laster timer is destroyed, otherwise it is printed /// standard error when the laster timer is destroyed, otherwise it is printed

View File

@@ -60,7 +60,7 @@ def NoItinerary : InstrItinClass;
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// Instruction itinerary data - These values provide a runtime map of an // Instruction itinerary data - These values provide a runtime map of an
// instruction itinerary class (name) to it's itinerary data. // instruction itinerary class (name) to its itinerary data.
// //
class InstrItinData<InstrItinClass Class, list<InstrStage> stages, class InstrItinData<InstrItinClass Class, list<InstrStage> stages,
list<int> operandcycles = []> { list<int> operandcycles = []> {