|
| 1 | +package drive64 |
| 2 | + |
| 3 | +import ( |
| 4 | + "encoding/binary" |
| 5 | +) |
| 6 | + |
| 7 | +const MAGIC_NUMBER = 0x6c078965 |
| 8 | + |
| 9 | +type ReadCallback func(uint32) uint32 |
| 10 | + |
| 11 | +type CheckSumInfo struct { |
| 12 | + Input []byte |
| 13 | + Buffer [16]uint32 |
| 14 | + ChecksumLow uint32 |
| 15 | + ChecksumHigh uint32 |
| 16 | +} |
| 17 | + |
| 18 | +func checksumFunction(a0, a1, a2 uint32) uint32 { |
| 19 | + var prod uint64 |
| 20 | + var hi, lo, diff, res uint32 |
| 21 | + |
| 22 | + if a1 == 0 { |
| 23 | + a1 = a2 |
| 24 | + } |
| 25 | + |
| 26 | + prod = uint64(a0) * uint64(a1) |
| 27 | + hi = uint32(prod >> 32) |
| 28 | + lo = uint32(prod) |
| 29 | + diff = hi - lo |
| 30 | + if diff == 0 { |
| 31 | + res = a0 |
| 32 | + } else { |
| 33 | + res = diff |
| 34 | + } |
| 35 | + return res |
| 36 | +} |
| 37 | + |
| 38 | +func initializeChecksum(seed uint8, input []byte) *CheckSumInfo { |
| 39 | + var init, data uint32 |
| 40 | + var info CheckSumInfo |
| 41 | + |
| 42 | + info.Input = input |
| 43 | + |
| 44 | + init = MAGIC_NUMBER*uint32(seed) + 1 |
| 45 | + data = binary.BigEndian.Uint32(input[0:4]) |
| 46 | + init ^= data |
| 47 | + |
| 48 | + for loop := 0; loop < 16; loop++ { |
| 49 | + info.Buffer[loop] = init |
| 50 | + } |
| 51 | + |
| 52 | + return &info |
| 53 | +} |
| 54 | + |
| 55 | +func calculateChecksum(info *CheckSumInfo) { |
| 56 | + var sum, dataIndex, loop, shift, dataShiftedRight, dataShiftedLeft, s2Tmp, s5Tmp, a3Tmp uint32 |
| 57 | + var data, dataNext, dataLast uint32 |
| 58 | + |
| 59 | + if info == nil { |
| 60 | + return |
| 61 | + } |
| 62 | + |
| 63 | + dataIndex = 0 |
| 64 | + loop = 0 |
| 65 | + data = binary.BigEndian.Uint32(info.Input[0:4]) |
| 66 | + for { |
| 67 | + loop++ |
| 68 | + dataLast = data |
| 69 | + data = binary.BigEndian.Uint32(info.Input[dataIndex : dataIndex+4]) |
| 70 | + |
| 71 | + sum = checksumFunction(1007-loop, data, loop) |
| 72 | + info.Buffer[0] += sum |
| 73 | + |
| 74 | + sum = checksumFunction(info.Buffer[1], data, loop) |
| 75 | + info.Buffer[1] = sum |
| 76 | + info.Buffer[2] ^= data |
| 77 | + |
| 78 | + sum = checksumFunction(data+5, MAGIC_NUMBER, loop) |
| 79 | + info.Buffer[3] += sum |
| 80 | + |
| 81 | + if dataLast < data { |
| 82 | + sum = checksumFunction(info.Buffer[9], data, loop) |
| 83 | + info.Buffer[9] = sum |
| 84 | + } else { |
| 85 | + info.Buffer[9] += data |
| 86 | + } |
| 87 | + |
| 88 | + shift = dataLast & 0x1f |
| 89 | + dataShiftedRight = data >> shift |
| 90 | + dataShiftedLeft = data << (32 - shift) |
| 91 | + s5Tmp = dataShiftedRight | dataShiftedLeft |
| 92 | + info.Buffer[4] += s5Tmp |
| 93 | + |
| 94 | + dataShiftedLeft = data << shift |
| 95 | + dataShiftedRight = data >> (32 - shift) |
| 96 | + |
| 97 | + sum = checksumFunction(info.Buffer[7], dataShiftedLeft|dataShiftedRight, loop) |
| 98 | + info.Buffer[7] = sum |
| 99 | + |
| 100 | + if data < info.Buffer[6] { |
| 101 | + info.Buffer[6] = (info.Buffer[3] + info.Buffer[6]) ^ (data + loop) |
| 102 | + } else { |
| 103 | + info.Buffer[6] = (info.Buffer[4] + data) ^ info.Buffer[6] |
| 104 | + } |
| 105 | + |
| 106 | + shift = dataLast >> 27 |
| 107 | + dataShiftedRight = data >> (32 - shift) |
| 108 | + dataShiftedLeft = data << shift |
| 109 | + s2Tmp = dataShiftedLeft | dataShiftedRight |
| 110 | + info.Buffer[5] += s2Tmp |
| 111 | + |
| 112 | + dataShiftedLeft = data << (32 - shift) |
| 113 | + dataShiftedRight = data >> shift |
| 114 | + |
| 115 | + sum = checksumFunction(info.Buffer[8], dataShiftedRight|dataShiftedLeft, loop) |
| 116 | + info.Buffer[8] = sum |
| 117 | + |
| 118 | + if loop == 1008 { |
| 119 | + break |
| 120 | + } |
| 121 | + |
| 122 | + dataIndex += 4 |
| 123 | + dataNext = binary.BigEndian.Uint32(info.Input[dataIndex : dataIndex+4]) |
| 124 | + |
| 125 | + sum = checksumFunction(info.Buffer[15], s2Tmp, loop) |
| 126 | + |
| 127 | + shift = data >> 27 |
| 128 | + dataShiftedLeft = dataNext << shift |
| 129 | + dataShiftedRight = dataNext >> (32 - shift) |
| 130 | + |
| 131 | + sum = checksumFunction(sum, dataShiftedLeft|dataShiftedRight, loop) |
| 132 | + info.Buffer[15] = sum |
| 133 | + |
| 134 | + sum = checksumFunction(info.Buffer[14], s5Tmp, loop) |
| 135 | + |
| 136 | + shift = data & 0x1f |
| 137 | + s2Tmp = shift |
| 138 | + dataShiftedLeft = dataNext << (32 - shift) |
| 139 | + dataShiftedRight = dataNext >> shift |
| 140 | + |
| 141 | + sum = checksumFunction(sum, dataShiftedRight|dataShiftedLeft, loop) |
| 142 | + info.Buffer[14] = sum |
| 143 | + |
| 144 | + dataShiftedRight = data >> s2Tmp |
| 145 | + dataShiftedLeft = data << (32 - s2Tmp) |
| 146 | + a3Tmp = dataShiftedRight | dataShiftedLeft |
| 147 | + |
| 148 | + shift = dataNext & 0x1f |
| 149 | + dataShiftedRight = dataNext >> shift |
| 150 | + dataShiftedLeft = dataNext << (32 - shift) |
| 151 | + |
| 152 | + info.Buffer[13] += a3Tmp + (dataShiftedRight | dataShiftedLeft) |
| 153 | + |
| 154 | + sum = checksumFunction(info.Buffer[10]+data, dataNext, loop) |
| 155 | + info.Buffer[10] = sum |
| 156 | + |
| 157 | + sum = checksumFunction(info.Buffer[11]^data, dataNext, loop) |
| 158 | + info.Buffer[11] = sum |
| 159 | + |
| 160 | + info.Buffer[12] += info.Buffer[8] ^ data |
| 161 | + } |
| 162 | +} |
| 163 | + |
| 164 | +func finalizeChecksum(info *CheckSumInfo) { |
| 165 | + var buf [4]uint32 |
| 166 | + var checksum uint64 |
| 167 | + var sum, loop, tmp, s2Tmp, shift, dataShiftedRight, dataShiftedLeft uint32 |
| 168 | + |
| 169 | + if info == nil { |
| 170 | + return |
| 171 | + } |
| 172 | + |
| 173 | + data := info.Buffer[0] |
| 174 | + buf[0] = data |
| 175 | + buf[1] = data |
| 176 | + buf[2] = data |
| 177 | + buf[3] = data |
| 178 | + |
| 179 | + for loop = 0; loop < 16; loop++ { |
| 180 | + data = info.Buffer[loop] |
| 181 | + |
| 182 | + shift = data & 0x1f |
| 183 | + dataShiftedLeft = data << (32 - shift) |
| 184 | + dataShiftedRight = data >> shift |
| 185 | + tmp = buf[0] + (dataShiftedRight | dataShiftedLeft) |
| 186 | + buf[0] = tmp |
| 187 | + |
| 188 | + if data < tmp { |
| 189 | + buf[1] += data |
| 190 | + } else { |
| 191 | + sum = checksumFunction(buf[1], data, loop) |
| 192 | + buf[1] = sum |
| 193 | + } |
| 194 | + |
| 195 | + tmp = (data & 0x02) >> 1 |
| 196 | + s2Tmp = data & 0x01 |
| 197 | + |
| 198 | + if tmp == s2Tmp { |
| 199 | + buf[2] += data |
| 200 | + } else { |
| 201 | + sum = checksumFunction(buf[2], data, loop) |
| 202 | + buf[2] = sum |
| 203 | + } |
| 204 | + |
| 205 | + if s2Tmp == 1 { |
| 206 | + buf[3] ^= data |
| 207 | + } else { |
| 208 | + sum = checksumFunction(buf[3], data, loop) |
| 209 | + buf[3] = sum |
| 210 | + } |
| 211 | + } |
| 212 | + |
| 213 | + // 0xa4001510 |
| 214 | + sum = checksumFunction(buf[0], buf[1], 16) |
| 215 | + tmp = buf[3] ^ buf[2] |
| 216 | + |
| 217 | + checksum = uint64(sum) << 32 |
| 218 | + checksum |= uint64(tmp) |
| 219 | + checksum &= 0xffffffffffff |
| 220 | + |
| 221 | + info.ChecksumLow = uint32(checksum) |
| 222 | + info.ChecksumHigh = uint32(checksum >> 32) |
| 223 | +} |
| 224 | + |
| 225 | +func IPL2Checksum(input []byte, seed uint8) uint64 { |
| 226 | + info := initializeChecksum(seed, input) |
| 227 | + calculateChecksum(info) |
| 228 | + finalizeChecksum(info) |
| 229 | + return uint64(info.ChecksumHigh)<<32 | uint64(info.ChecksumLow) |
| 230 | +} |
0 commit comments