edsk.py 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488
  1. # greaseweazle/image/edsk.py
  2. #
  3. # Some of the code here is heavily inspired by Simon Owen's SAMdisk:
  4. # https://simonowen.com/samdisk/
  5. #
  6. # Written & released by Keir Fraser <keir.xen@gmail.com>
  7. #
  8. # This is free and unencumbered software released into the public domain.
  9. # See the file COPYING for more details, or visit <http://unlicense.org>.
  10. import binascii, math, struct
  11. import itertools as it
  12. from bitarray import bitarray
  13. from greaseweazle import error
  14. from greaseweazle.codec.ibm import mfm
  15. from greaseweazle.track import MasterTrack, RawTrack
  16. from .image import Image
  17. class SR1:
  18. SUCCESS = 0x00
  19. CANNOT_FIND_ID_ADDRESS = 0x01
  20. WRITE_PROTECT_DETECTED = 0x02
  21. CANNOT_FIND_SECTOR_ID = 0x04
  22. RESERVED1 = 0x08
  23. OVERRUN = 0x10
  24. CRC_ERROR = 0x20
  25. RESERVED2 = 0x40
  26. END_OF_CYLINDER = 0x80
  27. class SR2:
  28. SUCCESS = 0x00
  29. MISSING_ADDRESS_MARK = 0x01
  30. BAD_CYLINDER = 0x02
  31. SCAN_COMMAND_FAILED = 0x04
  32. SCAN_COMMAND_EQUAL = 0x08
  33. WRONG_CYLINDER_DETECTED = 0x10
  34. CRC_ERROR_IN_SECTOR_DATA = 0x20
  35. SECTOR_WITH_DELETED_DATA = 0x40
  36. RESERVED = 0x80
  37. class SectorErrors:
  38. def __init__(self, sr1, sr2):
  39. self.id_crc_error = (sr1 & SR1.CRC_ERROR) != 0
  40. self.data_not_found = (sr2 & SR2.MISSING_ADDRESS_MARK) != 0
  41. self.data_crc_error = (sr2 & SR2.CRC_ERROR_IN_SECTOR_DATA) != 0
  42. self.deleted_dam = (sr2 & SR2.SECTOR_WITH_DELETED_DATA) != 0
  43. if self.data_crc_error:
  44. # uPD765 sets both id and data flags for data CRC errors
  45. self.id_crc_error = False
  46. if (# normal data
  47. (sr1 == SR1.SUCCESS and sr2 == SR2.SUCCESS) or
  48. # deleted data
  49. (sr1 == SR1.SUCCESS and sr2 == SR2.SECTOR_WITH_DELETED_DATA) or
  50. # end of track
  51. (sr1 == SR1.END_OF_CYLINDER and sr2 == SR2.SUCCESS) or
  52. # id crc error
  53. (sr1 == SR1.CRC_ERROR and sr2 == SR2.SUCCESS) or
  54. # normal data crc error
  55. (sr1 == SR1.CRC_ERROR and sr2 == SR2.CRC_ERROR_IN_SECTOR_DATA) or
  56. # deleted data crc error
  57. (sr1 == SR1.CRC_ERROR and sr2 == (SR2.CRC_ERROR_IN_SECTOR_DATA |
  58. SR2.SECTOR_WITH_DELETED_DATA)) or
  59. # data field missing (some FDCs set AM in ST1)
  60. (sr1 == SR1.CANNOT_FIND_ID_ADDRESS
  61. and sr2 == SR2.MISSING_ADDRESS_MARK) or
  62. # data field missing (some FDCs don't)
  63. (sr1 == SR1.SUCCESS and sr2 == SR2.MISSING_ADDRESS_MARK) or
  64. # CHRN mismatch
  65. (sr1 == SR1.CANNOT_FIND_SECTOR_ID and sr2 == SR2.SUCCESS) or
  66. # CHRN mismatch, including wrong cylinder
  67. (sr1 == SR1.CANNOT_FIND_SECTOR_ID
  68. and sr2 == SR2.WRONG_CYLINDER_DETECTED)):
  69. pass
  70. else:
  71. print('Unusual status flags (ST1=%02X ST2=%02X)' % (sr1, sr2))
  72. class EDSKTrack:
  73. gap_presync = 12
  74. gap_4a = 80 # Post-Index
  75. gap_1 = 50 # Post-IAM
  76. gap_2 = 22 # Post-IDAM
  77. gapbyte = 0x4e
  78. def __init__(self):
  79. self.time_per_rev = 0.2
  80. self.clock = 2e-6
  81. self.bits, self.weak, self.bytes = [], [], bytearray()
  82. def raw_track(self):
  83. track = MasterTrack(
  84. bits = self.bits,
  85. time_per_rev = self.time_per_rev,
  86. weak = self.weak)
  87. track.verify = self
  88. track.verify_revs = 1
  89. return track
  90. def _find_sync(self, bits, sync, start):
  91. for offs in bits.itersearch(sync):
  92. if offs >= start:
  93. return offs
  94. return None
  95. def verify_track(self, flux):
  96. flux.cue_at_index()
  97. raw = RawTrack(clock = self.clock, data = flux)
  98. bits, _ = raw.get_all_data()
  99. weak_iter = it.chain(self.weak, [(self.verify_len+1,1)])
  100. weak = next(weak_iter)
  101. # Start checking from the IAM sync
  102. dump_start = self._find_sync(bits, mfm.iam_sync, 0)
  103. self_start = self._find_sync(self.bits, mfm.iam_sync, 0)
  104. # Include the IAM pre-sync header
  105. if dump_start is None:
  106. return False
  107. dump_start -= self.gap_presync * 16
  108. self_start -= self.gap_presync * 16
  109. while self_start is not None and dump_start is not None:
  110. # Find the weak areas immediately before and after the current
  111. # region to be checked.
  112. s,n = None,None
  113. while self_start > weak[0]:
  114. s,n = weak
  115. weak = next(weak_iter)
  116. # If there is a weak area preceding us, move the start point to
  117. # immediately follow the weak area.
  118. if s is not None:
  119. delta = self_start - (s + n + 16)
  120. self_start -= delta
  121. dump_start -= delta
  122. # Truncate the region at the next weak area, or the last sector.
  123. self_end = max(self_start, min(weak[0], self.verify_len+1))
  124. dump_end = dump_start + self_end - self_start
  125. # Extract the corresponding areas from the pristine track and
  126. # from the dump, and check that they match.
  127. if bits[dump_start:dump_end] != self.bits[self_start:self_end]:
  128. return False
  129. # Find the next A1A1A1 sync pattern
  130. dump_start = self._find_sync(bits, mfm.sync, dump_end)
  131. self_start = self._find_sync(self.bits, mfm.sync, self_end)
  132. # Did we verify all regions in the pristine track?
  133. return self_start is None
  134. class EDSK(Image):
  135. read_only = True
  136. def __init__(self):
  137. self.to_track = dict()
  138. # Find all weak ranges in the given sector data copies.
  139. @staticmethod
  140. def find_weak_ranges(dat, size):
  141. orig = dat[:size]
  142. s, w = size, []
  143. # Find first mismatching byte across all copies
  144. for i in range(1, len(dat)//size):
  145. diff = [x^y for x, y in zip(orig, dat[size*i:size*(i+1)])]
  146. weak = [idx for idx, val in enumerate(diff) if val != 0]
  147. if weak:
  148. s = min(s, weak[0])
  149. # Look for runs of filler
  150. i = s
  151. while i < size:
  152. j, x = i, orig[i]
  153. while j < size and orig[j] == x:
  154. j += 1
  155. if j-i >= 16:
  156. w.append((s,i-s))
  157. s = j
  158. i = j
  159. # Append final weak area if any.
  160. if s < size:
  161. w.append((s,size-s))
  162. return w
  163. @staticmethod
  164. def _build_8k_track(sectors):
  165. if len(sectors) != 1:
  166. return None
  167. c,h,r,n,errs,data = sectors[0]
  168. if n != 6:
  169. return None
  170. if errs.id_crc_error or errs.data_not_found or not errs.data_crc_error:
  171. return None
  172. # Magic longtrack value is for Coin-Op Hits. Taken from SAMdisk.
  173. if len(data) > 6307:
  174. data = data[:6307]
  175. track = EDSKTrack()
  176. t = track.bytes
  177. # Post-index gap
  178. t += mfm.encode(bytes([track.gapbyte] * 16))
  179. # IAM
  180. t += mfm.encode(bytes(track.gap_presync))
  181. t += mfm.iam_sync_bytes
  182. t += mfm.encode(bytes([mfm.IBM_MFM.IAM]))
  183. t += mfm.encode(bytes([track.gapbyte] * 16))
  184. # IDAM
  185. t += mfm.encode(bytes(track.gap_presync))
  186. t += mfm.sync_bytes
  187. am = bytes([0xa1, 0xa1, 0xa1, mfm.IBM_MFM.IDAM, c, h, r, n])
  188. crc = mfm.crc16.new(am).crcValue
  189. am += struct.pack('>H', crc)
  190. t += mfm.encode(am[3:])
  191. t += mfm.encode(bytes([track.gapbyte] * track.gap_2))
  192. # DAM
  193. t += mfm.encode(bytes(track.gap_presync))
  194. t += mfm.sync_bytes
  195. dmark = (mfm.IBM_MFM.DDAM if errs.deleted_dam
  196. else mfm.IBM_MFM.DAM)
  197. am = bytes([0xa1, 0xa1, 0xa1, dmark]) + data
  198. t += mfm.encode(am[3:])
  199. return track
  200. @staticmethod
  201. def _build_kbi19_track(sectors):
  202. ids = [0,1,4,7,10,13,16,2,5,8,11,14,17,3,6,9,12,15,18]
  203. if len(sectors) != len(ids):
  204. return None
  205. for s,id in zip(sectors,ids):
  206. c,h,r,n,_,_ = s
  207. if r != id or n != 2:
  208. return None
  209. def addcrc(t,n):
  210. crc = mfm.crc16.new(mfm.decode(t[-n*2:])).crcValue
  211. t += mfm.encode(struct.pack('>H', crc))
  212. track = EDSKTrack()
  213. t = track.bytes
  214. # Post-index gap
  215. t += mfm.encode(bytes([track.gapbyte] * 64))
  216. # IAM
  217. t += mfm.encode(bytes(track.gap_presync))
  218. t += mfm.iam_sync_bytes
  219. t += mfm.encode(bytes([mfm.IBM_MFM.IAM]))
  220. t += mfm.encode(bytes([track.gapbyte] * 50))
  221. for idx, s in enumerate(sectors):
  222. c,h,r,n,errs,data = s
  223. # IDAM
  224. t += mfm.encode(bytes(track.gap_presync))
  225. t += mfm.sync_bytes
  226. t += mfm.encode(bytes([mfm.IBM_MFM.IDAM, c, h, r, n]))
  227. addcrc(t, 8)
  228. if r == 0:
  229. t += mfm.encode(bytes([track.gapbyte] * 17))
  230. t += mfm.encode(b' KBI ')
  231. else:
  232. t += mfm.encode(bytes([track.gapbyte] * 8))
  233. t += mfm.encode(b' KBI ')
  234. t += mfm.encode(bytes([track.gapbyte] * 9))
  235. # DAM
  236. t += mfm.encode(bytes(track.gap_presync))
  237. t += mfm.sync_bytes
  238. dmark = (mfm.IBM_MFM.DDAM if errs.deleted_dam
  239. else mfm.IBM_MFM.DAM)
  240. t += mfm.encode(bytes([dmark]))
  241. if idx%3 != 0:
  242. t += mfm.encode(data[:61])
  243. elif r == 0:
  244. t += mfm.encode(data[:512])
  245. addcrc(t,516)
  246. else:
  247. t += mfm.encode(data[0:0x10e])
  248. addcrc(t,516)
  249. t += mfm.encode(data[0x110:0x187])
  250. addcrc(t,516)
  251. t += mfm.encode(data[0x189:0x200])
  252. addcrc(t,516)
  253. t += mfm.encode(bytes([track.gapbyte] * 80))
  254. return track
  255. @classmethod
  256. def from_file(cls, name):
  257. with open(name, "rb") as f:
  258. dat = f.read()
  259. edsk = cls()
  260. sig, creator, ncyls, nsides, track_sz = struct.unpack(
  261. '<34s14s2BH', dat[:52])
  262. if sig[:8] == b'MV - CPC':
  263. extended = False
  264. elif sig[:16] == b'EXTENDED CPC DSK':
  265. extended = True
  266. else:
  267. raise error.Fatal('Unrecognised CPC DSK file: bad signature')
  268. if extended:
  269. track_sizes = list(dat[52:52+ncyls*nsides])
  270. track_sizes = list(map(lambda x: x*256, track_sizes))
  271. else:
  272. track_sizes = [track_sz] * (ncyls * nsides)
  273. o = 256 # skip disk header and track-size table
  274. for track_size in track_sizes:
  275. if track_size == 0:
  276. continue
  277. sig, cyl, head, sec_sz, nsecs, gap_3, filler = struct.unpack(
  278. '<12s4x2B2x4B', dat[o:o+24])
  279. error.check(sig == b'Track-Info\r\n',
  280. 'EDSK: Missing track header')
  281. error.check((cyl, head) not in edsk.to_track,
  282. 'EDSK: Track specified twice')
  283. bad_crc_clip_data = False
  284. while True:
  285. track = EDSKTrack()
  286. t = track.bytes
  287. # Post-index gap
  288. t += mfm.encode(bytes([track.gapbyte] * track.gap_4a))
  289. # IAM
  290. t += mfm.encode(bytes(track.gap_presync))
  291. t += mfm.iam_sync_bytes
  292. t += mfm.encode(bytes([mfm.IBM_MFM.IAM]))
  293. t += mfm.encode(bytes([track.gapbyte] * track.gap_1))
  294. sh = dat[o+24:o+24+8*nsecs]
  295. data_pos = o + 256 # skip track header and sector-info table
  296. clippable, ngap3, sectors, idam_included = 0, 0, [], False
  297. while sh:
  298. c, h, r, n, stat1, stat2, data_size = struct.unpack(
  299. '<6BH', sh[:8])
  300. sh = sh[8:]
  301. native_size = mfm.sec_sz(n)
  302. weak = []
  303. errs = SectorErrors(stat1, stat2)
  304. num_copies = 0 if errs.data_not_found else 1
  305. if not extended:
  306. data_size = mfm.sec_sz(sec_sz)
  307. sec_data = dat[data_pos:data_pos+data_size]
  308. data_pos += data_size
  309. if (extended
  310. and data_size > native_size
  311. and errs.data_crc_error
  312. and (data_size % native_size == 0
  313. or data_size == 49152)):
  314. num_copies = (3 if data_size == 49152
  315. else data_size // native_size)
  316. data_size //= num_copies
  317. weak = cls().find_weak_ranges(sec_data, data_size)
  318. sec_data = sec_data[:data_size]
  319. sectors.append((c,h,r,n,errs,sec_data))
  320. # IDAM
  321. if not idam_included:
  322. t += mfm.encode(bytes(track.gap_presync))
  323. t += mfm.sync_bytes
  324. am = bytes([0xa1, 0xa1, 0xa1, mfm.IBM_MFM.IDAM,
  325. c, h, r, n])
  326. crc = mfm.crc16.new(am).crcValue
  327. if errs.id_crc_error:
  328. crc ^= 0x5555
  329. am += struct.pack('>H', crc)
  330. t += mfm.encode(am[3:])
  331. t += mfm.encode(bytes([track.gapbyte] * track.gap_2))
  332. # DAM
  333. gap_included, idam_included = False, False
  334. if errs.id_crc_error or errs.data_not_found:
  335. continue
  336. t += mfm.encode(bytes(track.gap_presync))
  337. t += mfm.sync_bytes
  338. track.weak += [((s+len(t)//2+1)*16, n*16) for s,n in weak]
  339. dmark = (mfm.IBM_MFM.DDAM if errs.deleted_dam
  340. else mfm.IBM_MFM.DAM)
  341. if errs.data_crc_error:
  342. if sh:
  343. # Look for next IDAM
  344. idam = bytes([0]*12 + [0xa1]*3
  345. + [mfm.IBM_MFM.IDAM])
  346. idx = sec_data.find(idam)
  347. else:
  348. # Last sector: Look for GAP3
  349. idx = sec_data.find(bytes([track.gapbyte]*8))
  350. if idx > 0:
  351. # 2 + gap_3 = CRC + GAP3 (because gap_included)
  352. clippable += data_size - idx + 2 + gap_3
  353. if bad_crc_clip_data:
  354. data_size = idx
  355. sec_data = sec_data[:data_size]
  356. gap_included = True
  357. elif data_size < native_size:
  358. # Pad short data
  359. sec_data += bytes(native_size - data_size)
  360. elif data_size > native_size:
  361. # Clip long data if it includes pre-sync 00 bytes
  362. if (sec_data[-13] != 0
  363. and all([v==0 for v in sec_data[-12:]])):
  364. # Includes next pre-sync: Clip it.
  365. sec_data = sec_data[:-12]
  366. if sh:
  367. # Look for next IDAM
  368. idam = bytes([0]*12 + [0xa1]*3 + [mfm.IBM_MFM.IDAM]
  369. + list(sh[:4]))
  370. idx = sec_data.find(idam)
  371. if idx > native_size:
  372. # Sector data includes next IDAM. Output it
  373. # here and skip it on next iteration.
  374. t += mfm.encode(bytes([dmark]))
  375. t += mfm.encode(sec_data[:idx+12])
  376. t += mfm.sync_bytes
  377. t += mfm.encode(sec_data[idx+12+3:])
  378. idam_included = True
  379. continue
  380. # Long data includes CRC and GAP
  381. gap_included = True
  382. if gap_included:
  383. t += mfm.encode(bytes([dmark]))
  384. t += mfm.encode(sec_data)
  385. continue
  386. am = bytes([0xa1, 0xa1, 0xa1, dmark]) + sec_data
  387. crc = mfm.crc16.new(am).crcValue
  388. if errs.data_crc_error:
  389. crc ^= 0x5555
  390. am += struct.pack('>H', crc)
  391. t += mfm.encode(am[3:])
  392. if sh:
  393. # GAP3 for all but last sector
  394. t += mfm.encode(bytes([track.gapbyte] * gap_3))
  395. ngap3 += 1
  396. # Special track handlers
  397. special_track = cls()._build_8k_track(sectors)
  398. if special_track is None:
  399. special_track = cls()._build_kbi19_track(sectors)
  400. if special_track is not None:
  401. track = special_track
  402. break
  403. # The track may be too long to fit: Check for overhang.
  404. tracklen = int((track.time_per_rev / track.clock) / 16)
  405. overhang = int(len(t)//2 - tracklen*0.99)
  406. if overhang <= 0:
  407. break
  408. # Some EDSK tracks with Bad CRC contain a raw dump following
  409. # the DAM. This can usually be clipped.
  410. if clippable and not bad_crc_clip_data:
  411. bad_crc_clip_data = True
  412. continue
  413. # Some EDSK images have bogus GAP3 values. Shrink it if
  414. # necessary.
  415. new_gap_3 = -1
  416. if ngap3 != 0:
  417. new_gap_3 = gap_3 - math.ceil(overhang / ngap3)
  418. error.check(new_gap_3 >= 0,
  419. 'EDSK: Track %d.%d is too long '
  420. '(%d bits @ GAP3=%d; %d bits @ GAP3=0)'
  421. % (cyl, head, len(t)*8, gap_3,
  422. (len(t)//2-gap_3*ngap3)*16))
  423. #print('EDSK: GAP3 reduced (%d -> %d)' % (gap_3, new_gap_3))
  424. gap_3 = new_gap_3
  425. # Pre-index gap
  426. track.verify_len = len(track.bytes)*8
  427. tracklen = int((track.time_per_rev / track.clock) / 16)
  428. gap = max(40, tracklen - len(t)//2)
  429. track.bytes += mfm.encode(bytes([track.gapbyte] * gap))
  430. # Add the clock buts
  431. track.bits = bitarray(endian='big')
  432. track.bits.frombytes(mfm.mfm_encode(track.bytes))
  433. # Register the track
  434. edsk.to_track[cyl,head] = track
  435. o += track_size
  436. return edsk
  437. def get_track(self, cyl, side):
  438. if (cyl,side) not in self.to_track:
  439. return None
  440. return self.to_track[cyl,side].raw_track()
  441. # Local variables:
  442. # python-indent: 4
  443. # End: