Fixed spelling and grammar.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8489 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Misha Brukman
2003-09-11 22:34:13 +00:00
parent 515c97c230
commit 37f92e2568
14 changed files with 57 additions and 57 deletions

View File

@ -130,7 +130,7 @@ static bool ReadArchiveBuffer(const std::string &Filename,
}
// ReadArchiveFile - Read bytecode files from the specfied .a file, returning
// ReadArchiveFile - Read bytecode files from the specified .a file, returning
// true on error, or false on success. This does not support reading files from
// standard input.
//

View File

@ -130,7 +130,7 @@ static bool ReadArchiveBuffer(const std::string &Filename,
}
// ReadArchiveFile - Read bytecode files from the specfied .a file, returning
// ReadArchiveFile - Read bytecode files from the specified .a file, returning
// true on error, or false on success. This does not support reading files from
// standard input.
//

View File

@ -4,7 +4,7 @@
// constant pools.
//
// Note that this library should be as fast as possible, reentrant, and
// threadsafe!!
// thread-safe!!
//
//===----------------------------------------------------------------------===//
@ -113,12 +113,12 @@ void BytecodeParser::refineAbstractType(const DerivedType *OldType,
// parseTypeConstants - We have to use this wierd code to handle recursive
// parseTypeConstants - We have to use this weird code to handle recursive
// types. We know that recursive types will only reference the current slab of
// values in the type plane, but they can forward reference types before they
// have been read. For example, Type #0 might be '{ Ty#1 }' and Type #1 might
// be 'Ty#0*'. When reading Type #0, type number one doesn't exist. To fix
// this ugly problem, we pesimistically insert an opaque type for each type we
// this ugly problem, we pessimistically insert an opaque type for each type we
// are about to read. This means that forward references will resolve to
// something and when we reread the type later, we can replace the opaque type
// with a new resolved concrete type.
@ -327,7 +327,7 @@ bool BytecodeParser::parseConstantValue(const unsigned char *&Buf,
if (!(GV = dyn_cast<GlobalValue>(Val))) return true;
BCR_TRACE(5, "Value Found in ValueTable!\n");
} else if (RevisionNum > 0) {
// Revision #0 could have forward references to globals that were wierd.
// Revision #0 could have forward references to globals that were weird.
// We got rid of this in subsequent revs.
return true;
} else { // Nope... find or create a forward ref. for it

View File

@ -204,7 +204,7 @@ bool BytecodeParser::ParseInstruction(const unsigned char *&Buf,
new SwitchInst(getValue(Raw.Ty, Raw.Arg1),
cast<BasicBlock>(getValue(Type::LabelTy, Raw.Arg2)));
Res = I;
if (Raw.NumOperands < 3) return false; // No destinations? Wierd.
if (Raw.NumOperands < 3) return false; // No destinations? Weird.
if (Raw.NumOperands == 3 || Raw.VarArgs->size() & 1) {
std::cerr << "Switch statement with odd number of arguments!\n";

View File

@ -436,7 +436,7 @@ bool BytecodeParser::ParseModuleGlobalInfo(const unsigned char *&Buf,
BCR_TRACE(2, "Global Variable of type: " << *Ty << "\n");
ResolveReferencesToValue(GV, (unsigned)DestSlot);
if (VarType & 2) { // Does it have an initalizer?
if (VarType & 2) { // Does it have an initializer?
unsigned InitSlot;
if (read_vbr(Buf, End, InitSlot)) return true;
GlobalInits.push_back(std::make_pair(GV, InitSlot));

View File

@ -52,7 +52,7 @@ static void outputInstructionFormat0(const Instruction *I, unsigned Opcode,
}
// outputInstrVarArgsCall - Output the obsurdly annoying varargs function calls.
// outputInstrVarArgsCall - Output the absurdly annoying varargs function calls.
// This are more annoying than most because the signature of the call does not
// tell us anything about the types of the arguments in the varargs portion.
// Because of this, we encode (as type 0) all of the argument types explicitly
@ -271,6 +271,6 @@ void BytecodeWriter::processInstruction(const Instruction &I) {
}
// If we weren't handled before here, we either have a large number of
// operands or a large operand index that we are refering to.
// operands or a large operand index that we are referring to.
outputInstructionFormat0(&I, Opcode, Table, Type, Out);
}

View File

@ -3,7 +3,7 @@
// This library implements the functionality defined in llvm/Bytecode/Writer.h
//
// Note that this file uses an unusual technique of outputting all the bytecode
// to a deque of unsigned char's, then copies the deque to an ostream. The
// to a deque of unsigned chare, then copies the deque to an ostream. The
// reason for this is that we must do "seeking" in the stream to do back-
// patching, and some very important ostreams that we want to support (like
// pipes) do not support seeking. :( :( :(
@ -143,7 +143,7 @@ void BytecodeWriter::outputConstants(bool isFunction) {
const std::vector<const Value*> &Plane = Table.getPlane(pno);
if (!Plane.empty()) { // Skip empty type planes...
unsigned ValNo = 0;
if (isFunction) // Don't reemit module constants
if (isFunction) // Don't re-emit module constants
ValNo += Table.getModuleLevel(pno);
if (pno >= Type::FirstDerivedTyID) {