llvm.org GIT mirror llvm / 3d58bd6
[MC] Add support for generating COFF CRCs COFF sections are accompanied with an auxiliary symbol which includes a checksum. This checksum used to be filled with just zero but this seems to upset LINK.exe when it is processing a /INCREMENTAL link job. Instead, fill the CheckSum field with the JamCRC of the section contents. This matches MSVC's behavior. This fixes PR19666. N.B. A rather simple implementation of JamCRC is given. It implements a byte-wise calculation using the method given by Sarwate. There are implementations with higher throughput like slice-by-eight and making use of PCLMULQDQ. We can switch to one of those techniques if it turns out to be a significant use of time. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@246590 91177308-0d34-0410-b5e6-96231b3b80d8 David Majnemer 5 years ago
8 changed file(s) with 181 addition(s) and 8 deletion(s). Raw diff Collapse all Expand all
0 //===-- llvm/Support/JamCRC.h - Cyclic Redundancy Check ---------*- C++ -*-===//
1 //
2 // The LLVM Compiler Infrastructure
3 //
4 // This file is distributed under the University of Illinois Open Source
5 // License. See LICENSE.TXT for details.
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file contains an implementation of JamCRC.
10 //
11 // We will use the "Rocksoft^tm Model CRC Algorithm" to describe the properties
12 // of this CRC:
13 // Width : 32
14 // Poly : 04C11DB7
15 // Init : FFFFFFFF
16 // RefIn : True
17 // RefOut : True
18 // XorOut : 00000000
19 // Check : 340BC6D9 (result of CRC for "123456789")
20 //
21 // N.B. We permit flexibility of the "Init" value. Some consumers of this need
22 // it to be zero.
23 //
24 //===----------------------------------------------------------------------===//
25
26 #ifndef LLVM_SUPPORT_JAMCRC_H
27 #define LLVM_SUPPORT_JAMCRC_H
28
29 #include "llvm/ADT/ArrayRef.h"
30 #include "llvm/Support/DataTypes.h"
31
32 namespace llvm {
33 class JamCRC {
34 public:
35 JamCRC(uint32_t Init = 0xFFFFFFFFU) : CRC(Init) {}
36
37 // \brief Update the CRC calculation with Data.
38 void update(ArrayRef Data);
39
40 uint32_t getCRC() const { return CRC; }
41
42 private:
43 uint32_t CRC;
44 };
45 } // End of namespace llvm
46
47 #endif
3131 #include "llvm/Support/Debug.h"
3232 #include "llvm/Support/Endian.h"
3333 #include "llvm/Support/ErrorHandling.h"
34 #include "llvm/Support/JamCRC.h"
3435 #include "llvm/Support/TimeValue.h"
3536 #include
3637
10281029 }
10291030 }
10301031
1032 SmallVector SectionContents;
10311033 for (i = Sections.begin(), ie = Sections.end(), j = Asm.begin(),
10321034 je = Asm.end();
10331035 (i != ie) && (j != je); ++i, ++j) {
10461048
10471049 WriteZeros(SectionDataPadding);
10481050
1051 // Save the contents of the section to a temporary buffer, we need this
1052 // to CRC the data before we dump it into the object file.
1053 SectionContents.clear();
1054 raw_svector_ostream VecOS(SectionContents);
1055 raw_pwrite_stream &OldStream = getStream();
1056 // Redirect the output stream to our buffer.
1057 setStream(VecOS);
1058 // Fill our buffer with the section data.
10491059 Asm.writeSectionData(&*j, Layout);
1060 // Reset the stream back to what it was before.
1061 setStream(OldStream);
1062
1063 // Calculate our CRC with an initial value of '0', this is not how
1064 // JamCRC is specified but it aligns with the expected output.
1065 JamCRC JC(/*Init=*/0x00000000U);
1066 JC.update(SectionContents);
1067
1068 // Write the section contents to the object file.
1069 getStream() << SectionContents;
1070
1071 // Update the section definition auxiliary symbol to record the CRC.
1072 COFFSection *Sec = SectionMap[&*j];
1073 COFFSymbol::AuxiliarySymbols &AuxSyms = Sec->Symbol->Aux;
1074 assert(AuxSyms.size() == 1 &&
1075 AuxSyms[0].AuxType == ATSectionDefinition);
1076 AuxSymbol &SecDef = AuxSyms[0];
1077 SecDef.Aux.SectionDefinition.CheckSum = JC.getCRC();
10501078 }
10511079
10521080 if ((*i)->Relocations.size() > 0) {
5858 IntEqClasses.cpp
5959 IntervalMap.cpp
6060 IntrusiveRefCntPtr.cpp
61 JamCRC.cpp
6162 LEB128.cpp
6263 LineIterator.cpp
6364 Locale.cpp
0 //===-- JamCRC.cpp - Cyclic Redundancy Check --------------------*- C++ -*-===//
1 //
2 // The LLVM Compiler Infrastructure
3 //
4 // This file is distributed under the University of Illinois Open Source
5 // License. See LICENSE.TXT for details.
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file contains an implementation of JamCRC.
10 //
11 //===----------------------------------------------------------------------===//
12 //
13 // The implementation technique is the one mentioned in:
14 // D. V. Sarwate. 1988. Computation of cyclic redundancy checks via table
15 // look-up. Commun. ACM 31, 8 (August 1988)
16 //
17 //===----------------------------------------------------------------------===//
18
19 #include "llvm/Support/JamCRC.h"
20
21 using namespace llvm;
22
23 static const uint32_t CRCTable[256] = {
24 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba,
25 0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3,
26 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
27 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91,
28 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,
29 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
30 0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec,
31 0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,
32 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
33 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,
34 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940,
35 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
36 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116,
37 0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f,
38 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
39 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d,
40 0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a,
41 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
42 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818,
43 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,
44 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
45 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457,
46 0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c,
47 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
48 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,
49 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb,
50 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
51 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,
52 0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086,
53 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
54 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4,
55 0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad,
56 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
57 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683,
58 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,
59 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
60 0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe,
61 0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,
62 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
63 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,
64 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252,
65 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
66 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60,
67 0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79,
68 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
69 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f,
70 0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04,
71 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
72 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a,
73 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,
74 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
75 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21,
76 0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e,
77 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
78 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,
79 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45,
80 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
81 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,
82 0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0,
83 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
84 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6,
85 0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf,
86 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
87 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
88 };
89
90 void JamCRC::update(ArrayRef Data) {
91 for (char Byte : Data) {
92 int TableIdx = (CRC ^ Byte) & 0xff;
93 CRC = CRCTable[TableIdx] ^ (CRC >> 8);
94 }
95 }
9292 // CHECK: Length: [[TextSize]]
9393 // CHECK: RelocationCount: 2
9494 // CHECK: LineNumberCount: 0
95 // CHECK: Checksum: 0x0
95 // CHECK: Checksum: 0x8E1B6D20
9696 // CHECK: Number: [[TextNum]]
9797 // CHECK: Selection: 0x0
9898 // CHECK: }
109109 // CHECK: Length: [[DataSize]]
110110 // CHECK: RelocationCount: 0
111111 // CHECK: LineNumberCount: 0
112 // CHECK: Checksum: 0x0
112 // CHECK: Checksum: 0x2B95CA92
113113 // CHECK: Number: [[DataNum]]
114114 // CHECK: Selection: 0x0
115115 // CHECK: }
9292 // CHECK: Length: 21
9393 // CHECK: RelocationCount: 2
9494 // CHECK: LineNumberCount: 0
95 // CHECK: Checksum: 0x0
95 // CHECK: Checksum: 0xC6461CBE
9696 // CHECK: Number: 1
9797 // CHECK: Selection: 0x0
9898 // CHECK: }
109109 // CHECK: Length: 12
110110 // CHECK: RelocationCount: 0
111111 // CHECK: LineNumberCount: 0
112 // CHECK: Checksum: 0x0
112 // CHECK: Checksum: 0x2B95CA92
113113 // CHECK: Number: 2
114114 // CHECK: Selection: 0x0
115115 // CHECK: }
113113 // CHECK: Length: 48
114114 // CHECK: RelocationCount: 6
115115 // CHECK: LineNumberCount: 0
116 // CHECK: Checksum: 0x0
116 // CHECK: Checksum: 0x7BD396E3
117117 // CHECK: Number: 1
118118 // CHECK: Selection: 0x0
119119 // CHECK: }
130130 // CHECK: Length: 35
131131 // CHECK: RelocationCount: 0
132132 // CHECK: LineNumberCount: 0
133 // CHECK: Checksum: 0x0
133 // CHECK: Checksum: 0xB0A4C21
134134 // CHECK: Number: 2
135135 // CHECK: Selection: 0x0
136136 // CHECK: }
113113 // CHECK: Length: 45
114114 // CHECK: RelocationCount: 6
115115 // CHECK: LineNumberCount: 0
116 // CHECK: Checksum: 0x0
116 // CHECK: Checksum: 0xDED1DC2
117117 // CHECK: Number: 1
118118 // CHECK: Selection: 0x0
119119 // CHECK: }
130130 // CHECK: Length: 35
131131 // CHECK: RelocationCount: 0
132132 // CHECK: LineNumberCount: 0
133 // CHECK: Checksum: 0x0
133 // CHECK: Checksum: 0xB0A4C21
134134 // CHECK: Number: 2
135135 // CHECK: Selection: 0x0
136136 // CHECK: }