Use read{16,32,64}{le,be}() instead of *reinterpret_cast<u{little,big}{16,32,64}_t>().

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@231016 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Rui Ueyama 2015-03-02 21:19:12 +00:00
parent 3ad0e2cd45
commit 4d1d4bad13
4 changed files with 31 additions and 44 deletions

View File

@ -510,7 +510,7 @@ uint64_t DIEHash::computeDIEODRSignature(const DIE &Die) {
// ... take the least significant 8 bytes and return those. Our MD5 // ... take the least significant 8 bytes and return those. Our MD5
// implementation always returns its results in little endian, swap bytes // implementation always returns its results in little endian, swap bytes
// appropriately. // appropriately.
return *reinterpret_cast<support::ulittle64_t *>(Result + 8); return support::endian::read64le(Result + 8);
} }
/// This is based on the type signature computation given in section 7.27 of the /// This is based on the type signature computation given in section 7.27 of the
@ -531,7 +531,7 @@ uint64_t DIEHash::computeCUSignature(const DIE &Die) {
// ... take the least significant 8 bytes and return those. Our MD5 // ... take the least significant 8 bytes and return those. Our MD5
// implementation always returns its results in little endian, swap bytes // implementation always returns its results in little endian, swap bytes
// appropriately. // appropriately.
return *reinterpret_cast<support::ulittle64_t *>(Result + 8); return support::endian::read64le(Result + 8);
} }
/// This is based on the type signature computation given in section 7.27 of the /// This is based on the type signature computation given in section 7.27 of the
@ -555,5 +555,5 @@ uint64_t DIEHash::computeTypeSignature(const DIE &Die) {
// ... take the least significant 8 bytes and return those. Our MD5 // ... take the least significant 8 bytes and return those. Our MD5
// implementation always returns its results in little endian, swap bytes // implementation always returns its results in little endian, swap bytes
// appropriately. // appropriately.
return *reinterpret_cast<support::ulittle64_t *>(Result + 8); return support::endian::read64le(Result + 8);
} }

View File

@ -2058,7 +2058,7 @@ static uint64_t makeTypeSignature(StringRef Identifier) {
// appropriately. // appropriately.
MD5::MD5Result Result; MD5::MD5Result Result;
Hash.final(Result); Hash.final(Result);
return *reinterpret_cast<support::ulittle64_t *>(Result + 8); return support::endian::read64le(Result + 8);
} }
void DwarfDebug::addDwarfTypeUnitType(DwarfCompileUnit &CU, void DwarfDebug::addDwarfTypeUnitType(DwarfCompileUnit &CU,

View File

@ -20,6 +20,7 @@
using namespace llvm; using namespace llvm;
using namespace object; using namespace object;
using namespace llvm::support::endian;
static const char *const Magic = "!<arch>\n"; static const char *const Magic = "!<arch>\n";
static const char *const ThinMagic = "!<thin>\n"; static const char *const ThinMagic = "!<thin>\n";
@ -363,11 +364,9 @@ ErrorOr<Archive::child_iterator> Archive::Symbol::getMember() const {
Offsets += sizeof(uint32_t); Offsets += sizeof(uint32_t);
uint32_t Offset = 0; uint32_t Offset = 0;
if (Parent->kind() == K_GNU) { if (Parent->kind() == K_GNU) {
Offset = Offset = read32be(Offsets + SymbolIndex * 4);
*(reinterpret_cast<const support::ubig32_t *>(Offsets) + SymbolIndex);
} else if (Parent->kind() == K_MIPS64) { } else if (Parent->kind() == K_MIPS64) {
Offset = Offset = read64be(Offsets + SymbolIndex * 8);
*(reinterpret_cast<const support::ubig64_t *>(Offsets) + SymbolIndex);
} else if (Parent->kind() == K_BSD) { } else if (Parent->kind() == K_BSD) {
// The SymbolIndex is an index into the ranlib structs that start at // The SymbolIndex is an index into the ranlib structs that start at
// Offsets (the first uint32_t is the number of bytes of the ranlib // Offsets (the first uint32_t is the number of bytes of the ranlib
@ -375,36 +374,29 @@ ErrorOr<Archive::child_iterator> Archive::Symbol::getMember() const {
// being a string table offset and the second being the offset into // being a string table offset and the second being the offset into
// the archive of the member that defines the symbol. Which is what // the archive of the member that defines the symbol. Which is what
// is needed here. // is needed here.
Offset = *(reinterpret_cast<const support::ulittle32_t *>(Offsets) + Offset = read32le(Offsets + SymbolIndex * 8 + 4);
(SymbolIndex * 2) + 1);
} else { } else {
uint32_t MemberCount = *reinterpret_cast<const support::ulittle32_t*>(Buf);
// Skip offsets. // Skip offsets.
Buf += sizeof(support::ulittle32_t) + uint32_t MemberCount = read32le(Buf);
(MemberCount * sizeof(support::ulittle32_t)); Buf += MemberCount * 4 + 4;
uint32_t SymbolCount = *reinterpret_cast<const support::ulittle32_t*>(Buf);
uint32_t SymbolCount = read32le(Buf);
if (SymbolIndex >= SymbolCount) if (SymbolIndex >= SymbolCount)
return object_error::parse_failed; return object_error::parse_failed;
// Skip SymbolCount to get to the indices table. // Skip SymbolCount to get to the indices table.
const char *Indices = Buf + sizeof(support::ulittle32_t); const char *Indices = Buf + 4;
// Get the index of the offset in the file member offset table for this // Get the index of the offset in the file member offset table for this
// symbol. // symbol.
uint16_t OffsetIndex = uint16_t OffsetIndex = read16le(Indices + SymbolIndex * 2);
*(reinterpret_cast<const support::ulittle16_t*>(Indices)
+ SymbolIndex);
// Subtract 1 since OffsetIndex is 1 based. // Subtract 1 since OffsetIndex is 1 based.
--OffsetIndex; --OffsetIndex;
if (OffsetIndex >= MemberCount) if (OffsetIndex >= MemberCount)
return object_error::parse_failed; return object_error::parse_failed;
Offset = *(reinterpret_cast<const support::ulittle32_t*>(Offsets) Offset = read32le(Offsets + OffsetIndex * 4);
+ OffsetIndex);
} }
const char *Loc = Parent->getData().begin() + Offset; const char *Loc = Parent->getData().begin() + Offset;
@ -430,8 +422,7 @@ Archive::Symbol Archive::Symbol::getNext() const {
// the string table followed by the string table. // the string table followed by the string table.
const char *Buf = Parent->SymbolTable->getBuffer().begin(); const char *Buf = Parent->SymbolTable->getBuffer().begin();
uint32_t RanlibCount = 0; uint32_t RanlibCount = 0;
RanlibCount = (*reinterpret_cast<const support::ulittle32_t *>(Buf)) / RanlibCount = read32le(Buf) / 8;
(sizeof(uint32_t) * 2);
// If t.SymbolIndex + 1 will be past the count of symbols (the RanlibCount) // If t.SymbolIndex + 1 will be past the count of symbols (the RanlibCount)
// don't change the t.StringIndex as we don't want to reference a ranlib // don't change the t.StringIndex as we don't want to reference a ranlib
// past RanlibCount. // past RanlibCount.
@ -439,10 +430,8 @@ Archive::Symbol Archive::Symbol::getNext() const {
const char *Ranlibs = Buf + 4; const char *Ranlibs = Buf + 4;
uint32_t CurRanStrx = 0; uint32_t CurRanStrx = 0;
uint32_t NextRanStrx = 0; uint32_t NextRanStrx = 0;
CurRanStrx = *(reinterpret_cast<const support::ulittle32_t *>(Ranlibs) + CurRanStrx = read32le(Ranlibs + t.SymbolIndex * 8);
(t.SymbolIndex * 2)); NextRanStrx = read32le(Ranlibs + (t.SymbolIndex + 1) * 8);
NextRanStrx = *(reinterpret_cast<const support::ulittle32_t *>(Ranlibs) +
((t.SymbolIndex + 1) * 2));
t.StringIndex -= CurRanStrx; t.StringIndex -= CurRanStrx;
t.StringIndex += NextRanStrx; t.StringIndex += NextRanStrx;
} }
@ -462,10 +451,10 @@ Archive::symbol_iterator Archive::symbol_begin() const {
const char *buf = SymbolTable->getBuffer().begin(); const char *buf = SymbolTable->getBuffer().begin();
if (kind() == K_GNU) { if (kind() == K_GNU) {
uint32_t symbol_count = 0; uint32_t symbol_count = 0;
symbol_count = *reinterpret_cast<const support::ubig32_t*>(buf); symbol_count = read32be(buf);
buf += sizeof(uint32_t) + (symbol_count * (sizeof(uint32_t))); buf += sizeof(uint32_t) + (symbol_count * (sizeof(uint32_t)));
} else if (kind() == K_MIPS64) { } else if (kind() == K_MIPS64) {
uint64_t symbol_count = *reinterpret_cast<const support::ubig64_t *>(buf); uint64_t symbol_count = read64be(buf);
buf += sizeof(uint64_t) + (symbol_count * (sizeof(uint64_t))); buf += sizeof(uint64_t) + (symbol_count * (sizeof(uint64_t)));
} else if (kind() == K_BSD) { } else if (kind() == K_BSD) {
// The __.SYMDEF or "__.SYMDEF SORTED" member starts with a uint32_t // The __.SYMDEF or "__.SYMDEF SORTED" member starts with a uint32_t
@ -475,11 +464,10 @@ Archive::symbol_iterator Archive::symbol_begin() const {
// define the symbol. After that the next uint32_t is the byte count of // define the symbol. After that the next uint32_t is the byte count of
// the string table followed by the string table. // the string table followed by the string table.
uint32_t ranlib_count = 0; uint32_t ranlib_count = 0;
ranlib_count = (*reinterpret_cast<const support::ulittle32_t *>(buf)) / ranlib_count = read32le(buf) / 8;
(sizeof(uint32_t) * 2);
const char *ranlibs = buf + 4; const char *ranlibs = buf + 4;
uint32_t ran_strx = 0; uint32_t ran_strx = 0;
ran_strx = *(reinterpret_cast<const support::ulittle32_t *>(ranlibs)); ran_strx = read32le(ranlibs);
buf += sizeof(uint32_t) + (ranlib_count * (2 * (sizeof(uint32_t)))); buf += sizeof(uint32_t) + (ranlib_count * (2 * (sizeof(uint32_t))));
// Skip the byte count of the string table. // Skip the byte count of the string table.
buf += sizeof(uint32_t); buf += sizeof(uint32_t);
@ -487,9 +475,9 @@ Archive::symbol_iterator Archive::symbol_begin() const {
} else { } else {
uint32_t member_count = 0; uint32_t member_count = 0;
uint32_t symbol_count = 0; uint32_t symbol_count = 0;
member_count = *reinterpret_cast<const support::ulittle32_t*>(buf); member_count = read32le(buf);
buf += 4 + (member_count * 4); // Skip offsets. buf += 4 + (member_count * 4); // Skip offsets.
symbol_count = *reinterpret_cast<const support::ulittle32_t*>(buf); symbol_count = read32le(buf);
buf += 4 + (symbol_count * 2); // Skip indices. buf += 4 + (symbol_count * 2); // Skip indices.
} }
uint32_t string_start_offset = buf - SymbolTable->getBuffer().begin(); uint32_t string_start_offset = buf - SymbolTable->getBuffer().begin();
@ -503,17 +491,16 @@ Archive::symbol_iterator Archive::symbol_end() const {
const char *buf = SymbolTable->getBuffer().begin(); const char *buf = SymbolTable->getBuffer().begin();
uint32_t symbol_count = 0; uint32_t symbol_count = 0;
if (kind() == K_GNU) { if (kind() == K_GNU) {
symbol_count = *reinterpret_cast<const support::ubig32_t*>(buf); symbol_count = read32be(buf);
} else if (kind() == K_MIPS64) { } else if (kind() == K_MIPS64) {
symbol_count = *reinterpret_cast<const support::ubig64_t*>(buf); symbol_count = read64be(buf);
} else if (kind() == K_BSD) { } else if (kind() == K_BSD) {
symbol_count = (*reinterpret_cast<const support::ulittle32_t *>(buf)) / symbol_count = read32le(buf) / 8;
(sizeof(uint32_t) * 2);
} else { } else {
uint32_t member_count = 0; uint32_t member_count = 0;
member_count = *reinterpret_cast<const support::ulittle32_t*>(buf); member_count = read32le(buf);
buf += 4 + (member_count * 4); // Skip offsets. buf += 4 + (member_count * 4); // Skip offsets.
symbol_count = *reinterpret_cast<const support::ulittle32_t*>(buf); symbol_count = read32le(buf);
} }
return symbol_iterator(Symbol(this, symbol_count, 0)); return symbol_iterator(Symbol(this, symbol_count, 0));
} }

View File

@ -30,6 +30,7 @@
#endif #endif
using namespace llvm; using namespace llvm;
using namespace llvm::support::endian;
namespace { namespace {
using llvm::StringRef; using llvm::StringRef;
@ -917,7 +918,7 @@ file_magic identify_magic(StringRef Magic) {
if (Magic.size() < MinSize) if (Magic.size() < MinSize)
return file_magic::coff_import_library; return file_magic::coff_import_library;
int BigObjVersion = *reinterpret_cast<const support::ulittle16_t*>( int BigObjVersion = read16le(
Magic.data() + offsetof(COFF::BigObjHeader, Version)); Magic.data() + offsetof(COFF::BigObjHeader, Version));
if (BigObjVersion < COFF::BigObjHeader::MinBigObjectVersion) if (BigObjVersion < COFF::BigObjHeader::MinBigObjectVersion)
return file_magic::coff_import_library; return file_magic::coff_import_library;
@ -1034,8 +1035,7 @@ file_magic identify_magic(StringRef Magic) {
case 'M': // Possible MS-DOS stub on Windows PE file case 'M': // Possible MS-DOS stub on Windows PE file
if (Magic[1] == 'Z') { if (Magic[1] == 'Z') {
uint32_t off = uint32_t off = read32le(Magic.data() + 0x3c);
*reinterpret_cast<const support::ulittle32_t*>(Magic.data() + 0x3c);
// PE/COFF file, either EXE or DLL. // PE/COFF file, either EXE or DLL.
if (off < Magic.size() && if (off < Magic.size() &&
memcmp(Magic.data()+off, COFF::PEMagic, sizeof(COFF::PEMagic)) == 0) memcmp(Magic.data()+off, COFF::PEMagic, sizeof(COFF::PEMagic)) == 0)