// Successors - List of BasicBlocks that are reachable directly from nodes in
// this interval, but are not in the interval themselves.
- // These nodes neccesarily must be header nodes for other intervals.
+ // These nodes necessarily must be header nodes for other intervals.
//
std::vector<BasicBlock*> Successors;
/// implemented in terms of the name that is registered by one of the
/// Registration templates, but can be overloaded directly, and if nothing
/// else is available, C++ RTTI will be consulted to get a SOMEWHAT
- /// intelligable name for the pass.
+ /// intelligible name for the pass.
///
virtual const char *getPassName() const;
return dyn_cast<Function>(getCalledValue());
}
- /// setCalledFunction - Set the callee to the specied value...
+ /// setCalledFunction - Set the callee to the specified value...
///
void setCalledFunction(Value *V) {
I->setOperand(0, V);
if (const StructType *STy = dyn_cast<StructType>(Ty)) {
const StructLayout *SLO = TD.getStructLayout(STy);
- // Indicies must be ubyte constants...
+ // Indices must be ubyte constants...
const ConstantUInt *CPU = cast<ConstantUInt>(*I);
assert(CPU->getType() == Type::UByteTy);
unsigned Index = CPU->getValue();
TheInterpreter = this;
// Do a lookup to see if the function is in our cache... this should just be a
- // defered annotation!
+ // deferred annotation!
std::map<const Function *, ExFunc>::iterator FI = Functions.find(M);
ExFunc Fn = (FI == Functions.end()) ? lookupFunction(M) : FI->second;
if (Fn == 0) {