mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-24 04:09:45 +00:00
Whitespace cleanup
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178454 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
2691fe98a7
commit
ef7964c1b7
@ -126,7 +126,7 @@ public:
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
|
||||
/// BitstreamEntry - When advancing through a bitstream cursor, each advance can
|
||||
/// discover a few different kinds of entries:
|
||||
/// Error - Malformed bitcode was found.
|
||||
@ -142,7 +142,7 @@ struct BitstreamEntry {
|
||||
SubBlock,
|
||||
Record
|
||||
} Kind;
|
||||
|
||||
|
||||
unsigned ID;
|
||||
|
||||
static BitstreamEntry getError() {
|
||||
@ -170,7 +170,7 @@ class BitstreamCursor {
|
||||
BitstreamReader *BitStream;
|
||||
size_t NextChar;
|
||||
|
||||
|
||||
|
||||
/// CurWord/word_t - This is the current data we have pulled from the stream
|
||||
/// but have not returned to the client. This is specifically and
|
||||
/// intentionally defined to follow the word size of the host machine for
|
||||
@ -199,7 +199,7 @@ class BitstreamCursor {
|
||||
/// BlockScope - This tracks the codesize of parent blocks.
|
||||
SmallVector<Block, 8> BlockScope;
|
||||
|
||||
|
||||
|
||||
public:
|
||||
BitstreamCursor() : BitStream(0), NextChar(0) {
|
||||
}
|
||||
@ -231,7 +231,7 @@ public:
|
||||
void operator=(const BitstreamCursor &RHS);
|
||||
|
||||
void freeState();
|
||||
|
||||
|
||||
bool isEndPos(size_t pos) {
|
||||
return BitStream->getBitcodeBytes().isObjectEnd(static_cast<uint64_t>(pos));
|
||||
}
|
||||
@ -278,7 +278,7 @@ public:
|
||||
/// returned just like normal records.
|
||||
AF_DontAutoprocessAbbrevs = 2
|
||||
};
|
||||
|
||||
|
||||
/// advance - Advance the current bitstream, returning the next entry in the
|
||||
/// stream.
|
||||
BitstreamEntry advance(unsigned Flags = 0) {
|
||||
@ -290,10 +290,10 @@ public:
|
||||
return BitstreamEntry::getError();
|
||||
return BitstreamEntry::getEndBlock();
|
||||
}
|
||||
|
||||
|
||||
if (Code == bitc::ENTER_SUBBLOCK)
|
||||
return BitstreamEntry::getSubBlock(ReadSubBlockID());
|
||||
|
||||
|
||||
if (Code == bitc::DEFINE_ABBREV &&
|
||||
!(Flags & AF_DontAutoprocessAbbrevs)) {
|
||||
// We read and accumulate abbrev's, the client can't do anything with
|
||||
@ -314,7 +314,7 @@ public:
|
||||
BitstreamEntry Entry = advance(Flags);
|
||||
if (Entry.Kind != BitstreamEntry::SubBlock)
|
||||
return Entry;
|
||||
|
||||
|
||||
// If we found a sub-block, just skip over it and check the next entry.
|
||||
if (SkipBlock())
|
||||
return BitstreamEntry::getError();
|
||||
@ -345,7 +345,7 @@ public:
|
||||
uint32_t Read(unsigned NumBits) {
|
||||
assert(NumBits && NumBits <= 32 &&
|
||||
"Cannot return zero or more than 32 bits!");
|
||||
|
||||
|
||||
// If the field is fully contained by CurWord, return it quickly.
|
||||
if (BitsInCurWord >= NumBits) {
|
||||
uint32_t R = uint32_t(CurWord) & (~0U >> (32-NumBits));
|
||||
@ -365,15 +365,15 @@ public:
|
||||
|
||||
// Read the next word from the stream.
|
||||
uint8_t Array[sizeof(word_t)] = {0};
|
||||
|
||||
|
||||
BitStream->getBitcodeBytes().readBytes(NextChar, sizeof(Array),
|
||||
Array, NULL);
|
||||
|
||||
|
||||
// Handle big-endian byte-swapping if necessary.
|
||||
support::detail::packed_endian_specific_integral
|
||||
<word_t, support::little, support::unaligned> EndianValue;
|
||||
memcpy(&EndianValue, Array, sizeof(Array));
|
||||
|
||||
|
||||
CurWord = EndianValue;
|
||||
|
||||
NextChar += sizeof(word_t);
|
||||
@ -450,7 +450,7 @@ private:
|
||||
BitsInCurWord = 32;
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
BitsInCurWord = 0;
|
||||
CurWord = 0;
|
||||
}
|
||||
@ -493,7 +493,7 @@ public:
|
||||
/// EnterSubBlock - Having read the ENTER_SUBBLOCK abbrevid, enter
|
||||
/// the block, and return true if the block has an error.
|
||||
bool EnterSubBlock(unsigned BlockID, unsigned *NumWordsP = 0);
|
||||
|
||||
|
||||
bool ReadBlockEnd() {
|
||||
if (BlockScope.empty()) return true;
|
||||
|
||||
@ -529,7 +529,7 @@ private:
|
||||
void readAbbreviatedField(const BitCodeAbbrevOp &Op,
|
||||
SmallVectorImpl<uint64_t> &Vals);
|
||||
void skipAbbreviatedField(const BitCodeAbbrevOp &Op);
|
||||
|
||||
|
||||
public:
|
||||
|
||||
/// getAbbrev - Return the abbreviation for the specified AbbrevId.
|
||||
@ -541,7 +541,7 @@ public:
|
||||
|
||||
/// skipRecord - Read the current record and discard it.
|
||||
void skipRecord(unsigned AbbrevID);
|
||||
|
||||
|
||||
unsigned readRecord(unsigned AbbrevID, SmallVectorImpl<uint64_t> &Vals,
|
||||
StringRef *Blob = 0);
|
||||
|
||||
@ -549,7 +549,7 @@ public:
|
||||
// Abbrev Processing
|
||||
//===--------------------------------------------------------------------===//
|
||||
void ReadAbbrevRecord();
|
||||
|
||||
|
||||
bool ReadBlockInfoBlock();
|
||||
};
|
||||
|
||||
|
@ -458,7 +458,7 @@ public:
|
||||
template<typename uintty>
|
||||
void EmitRecordWithArray(unsigned Abbrev, SmallVectorImpl<uintty> &Vals,
|
||||
const char *ArrayData, unsigned ArrayLen) {
|
||||
return EmitRecordWithAbbrevImpl(Abbrev, Vals, StringRef(ArrayData,
|
||||
return EmitRecordWithAbbrevImpl(Abbrev, Vals, StringRef(ArrayData,
|
||||
ArrayLen));
|
||||
}
|
||||
|
||||
|
@ -292,7 +292,7 @@ void BitstreamCursor::ReadAbbrevRecord() {
|
||||
Abbv->Add(BitCodeAbbrevOp(0));
|
||||
continue;
|
||||
}
|
||||
|
||||
|
||||
Abbv->Add(BitCodeAbbrevOp(E, Data));
|
||||
} else
|
||||
Abbv->Add(BitCodeAbbrevOp(E));
|
||||
|
@ -60,7 +60,7 @@ ValueEnumerator::ValueEnumerator(const Module *M) {
|
||||
I != E; ++I)
|
||||
EnumerateValue(I->getAliasee());
|
||||
|
||||
// Insert constants and metadata that are named at module level into the slot
|
||||
// Insert constants and metadata that are named at module level into the slot
|
||||
// pool so that the module symbol table can refer to them...
|
||||
EnumerateValueSymbolTable(M->getValueSymbolTable());
|
||||
EnumerateNamedMetadata(M);
|
||||
|
Loading…
Reference in New Issue
Block a user