mfm.py 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460
  1. # greaseweazle/codec/ibm/mfm.py
  2. #
  3. # Written & released by Keir Fraser <keir.xen@gmail.com>
  4. #
  5. # This is free and unencumbered software released into the public domain.
  6. # See the file COPYING for more details, or visit <http://unlicense.org>.
  7. import copy, heapq, struct, functools
  8. import itertools as it
  9. from bitarray import bitarray
  10. import crcmod.predefined
  11. from greaseweazle.track import MasterTrack, RawTrack
  12. default_revs = 2
  13. iam_sync_bytes = b'\x52\x24' * 3
  14. iam_sync = bitarray(endian='big')
  15. iam_sync.frombytes(iam_sync_bytes)
  16. sync_bytes = b'\x44\x89' * 3
  17. sync = bitarray(endian='big')
  18. sync.frombytes(sync_bytes)
  19. crc16 = crcmod.predefined.Crc('crc-ccitt-false')
  20. def sec_sz(n):
  21. return 128 << n if n <= 7 else 128 << 8
  22. class TrackArea:
  23. def __init__(self, start, end, crc=None):
  24. self.start = start
  25. self.end = end
  26. self.crc = crc
  27. def delta(self, delta):
  28. self.start -= delta
  29. self.end -= delta
  30. def __eq__(self, x):
  31. return (isinstance(x, type(self))
  32. and self.start == x.start
  33. and self.end == x.end
  34. and self.crc == x.crc)
  35. class IDAM(TrackArea):
  36. def __init__(self, start, end, crc, c, h, r, n):
  37. super().__init__(start, end, crc)
  38. self.c = c
  39. self.h = h
  40. self.r = r
  41. self.n = n
  42. def __str__(self):
  43. return ("IDAM:%6d-%6d c=%02x h=%02x r=%02x n=%02x CRC:%04x"
  44. % (self.start, self.end, self.c, self.h, self.r, self.n,
  45. self.crc))
  46. def __eq__(self, x):
  47. return (super().__eq__(x)
  48. and self.c == x.c and self.h == x.h
  49. and self.r == x.r and self.n == x.n)
  50. def __copy__(self):
  51. return IDAM(self.start, self.end, self.crc,
  52. self.c, self.h, self.r, self.n)
  53. class DAM(TrackArea):
  54. def __init__(self, start, end, crc, mark, data=None):
  55. super().__init__(start, end, crc)
  56. self.mark = mark
  57. self.data = data
  58. def __str__(self):
  59. return "DAM: %6d-%6d mark=%02x" % (self.start, self.end, self.mark)
  60. def __eq__(self, x):
  61. return (super().__eq__(x)
  62. and self.mark == x.mark
  63. and self.data == x.data)
  64. def __copy__(self):
  65. return DAM(self.start, self.end, self.crc, self.mark, self.data)
  66. class Sector(TrackArea):
  67. def __init__(self, idam, dam):
  68. super().__init__(idam.start, dam.end, idam.crc | dam.crc)
  69. self.idam = idam
  70. self.dam = dam
  71. def __str__(self):
  72. s = "Sec: %6d-%6d CRC:%04x\n" % (self.start, self.end, self.crc)
  73. s += " " + str(self.idam) + "\n"
  74. s += " " + str(self.dam)
  75. return s
  76. def delta(self, delta):
  77. super().delta(delta)
  78. self.idam.delta(delta)
  79. self.dam.delta(delta)
  80. def __eq__(self, x):
  81. return (super().__eq__(x)
  82. and self.idam == x.idam
  83. and self.dam == x.dam)
  84. class IAM(TrackArea):
  85. def __str__(self):
  86. return "IAM: %6d-%6d" % (self.start, self.end)
  87. def __copy__(self):
  88. return IAM(self.start, self.end)
  89. class IBM_MFM:
  90. IAM = 0xfc
  91. IDAM = 0xfe
  92. DAM = 0xfb
  93. DDAM = 0xf8
  94. gap_presync = 12
  95. gapbyte = 0x4e
  96. def __init__(self, cyl, head):
  97. self.cyl, self.head = cyl, head
  98. self.sectors = []
  99. self.iams = []
  100. def summary_string(self):
  101. nsec, nbad = len(self.sectors), self.nr_missing()
  102. s = "IBM MFM (%d/%d sectors)" % (nsec - nbad, nsec)
  103. if nbad != 0:
  104. s += " - %d sectors missing" % nbad
  105. return s
  106. def has_sec(self, sec_id):
  107. return self.sectors[sec_id].crc == 0
  108. def nr_missing(self):
  109. return len(list(filter(lambda x: x.crc != 0, self.sectors)))
  110. def flux_for_writeout(self, *args, **kwargs):
  111. return self.raw_track().flux_for_writeout(args, kwargs)
  112. def flux(self, *args, **kwargs):
  113. return self.raw_track().flux(args, kwargs)
  114. def decode_raw(self, track):
  115. track.cue_at_index()
  116. raw = RawTrack(clock = self.clock, data = track)
  117. bits, _ = raw.get_all_data()
  118. areas = []
  119. idam = None
  120. ## 1. Calculate offsets within dump
  121. for offs in bits.itersearch(iam_sync):
  122. mark = decode(bits[offs+3*16:offs+4*16].tobytes())[0]
  123. if mark == IBM_MFM.IAM:
  124. areas.append(IAM(offs, offs+4*16))
  125. self.has_iam = True
  126. for offs in bits.itersearch(sync):
  127. mark = decode(bits[offs+3*16:offs+4*16].tobytes())[0]
  128. if mark == IBM_MFM.IDAM:
  129. s, e = offs, offs+10*16
  130. b = decode(bits[s:e].tobytes())
  131. c,h,r,n = struct.unpack(">4x4B2x", b)
  132. crc = crc16.new(b).crcValue
  133. if idam is not None:
  134. areas.append(idam)
  135. idam = IDAM(s, e, crc, c=c, h=h, r=r, n=n)
  136. elif mark == IBM_MFM.DAM or mark == IBM_MFM.DDAM:
  137. if idam is None or idam.end - offs > 1000:
  138. areas.append(DAM(offs, offs+4*16, 0xffff, mark=mark))
  139. else:
  140. sz = 128 << idam.n
  141. s, e = offs, offs+(4+sz+2)*16
  142. b = decode(bits[s:e].tobytes())
  143. crc = crc16.new(b).crcValue
  144. dam = DAM(s, e, crc, mark=mark, data=b[4:-2])
  145. areas.append(Sector(idam, dam))
  146. idam = None
  147. else:
  148. pass #print("Unknown mark %02x" % mark)
  149. if idam is not None:
  150. areas.append(idam)
  151. # Convert to offsets within track
  152. areas.sort(key=lambda x:x.start)
  153. index = iter(raw.revolutions)
  154. p, n = 0, next(index)
  155. for a in areas:
  156. if a.start >= n:
  157. p = n
  158. try:
  159. n = next(index)
  160. except StopIteration:
  161. n = float('inf')
  162. a.delta(p)
  163. areas.sort(key=lambda x:x.start)
  164. # Add to the deduped lists
  165. for a in areas:
  166. match = False
  167. if isinstance(a, IAM):
  168. list = self.iams
  169. elif isinstance(a, Sector):
  170. list = self.sectors
  171. else:
  172. continue
  173. for s in list:
  174. if abs(s.start - a.start) < 1000:
  175. match = True
  176. break
  177. if match and isinstance(a, Sector) and s.crc != 0 and a.crc == 0:
  178. self.sectors = [x for x in self.sectors if x != a]
  179. match = False
  180. if not match:
  181. list.append(a)
  182. def raw_track(self):
  183. areas = heapq.merge(self.iams, self.sectors, key=lambda x:x.start)
  184. t = bytes()
  185. for a in areas:
  186. start = a.start//16 - self.gap_presync
  187. gap = max(start - len(t)//2, 0)
  188. t += encode(bytes([self.gapbyte] * gap))
  189. t += encode(bytes(self.gap_presync))
  190. if isinstance(a, IAM):
  191. t += iam_sync_bytes
  192. t += encode(bytes([self.IAM]))
  193. elif isinstance(a, Sector):
  194. t += sync_bytes
  195. idam = bytes([0xa1, 0xa1, 0xa1, self.IDAM,
  196. a.idam.c, a.idam.h, a.idam.r, a.idam.n])
  197. idam += struct.pack('>H', crc16.new(idam).crcValue)
  198. t += encode(idam[3:])
  199. start = a.dam.start//16 - self.gap_presync
  200. gap = max(start - len(t)//2, 0)
  201. t += encode(bytes([self.gapbyte] * gap))
  202. t += encode(bytes(self.gap_presync))
  203. t += sync_bytes
  204. dam = bytes([0xa1, 0xa1, 0xa1, a.dam.mark]) + a.dam.data
  205. dam += struct.pack('>H', crc16.new(dam).crcValue)
  206. t += encode(dam[3:])
  207. # Add the pre-index gap.
  208. tlen = int((self.time_per_rev / self.clock) // 16)
  209. gap = max(tlen - len(t)//2, 0)
  210. t += encode(bytes([self.gapbyte] * gap))
  211. track = MasterTrack(
  212. bits = mfm_encode(t),
  213. time_per_rev = self.time_per_rev)
  214. track.verify = self
  215. track.verify_revs = default_revs
  216. return track
  217. class IBM_MFM_Formatted(IBM_MFM):
  218. gap_4a = 80 # Post-Index
  219. gap_1 = 50 # Post-IAM
  220. gap_2 = 22 # Post-IDAM
  221. def __init__(self, cyl, head):
  222. super().__init__(cyl, head)
  223. self.raw_iams, self.raw_sectors = [], []
  224. def decode_raw(self, track):
  225. iams, sectors = self.iams, self.sectors
  226. self.iams, self.sectors = self.raw_iams, self.raw_sectors
  227. super().decode_raw(track)
  228. self.iams, self.sectors = iams, sectors
  229. for r in self.raw_sectors:
  230. if r.idam.crc != 0:
  231. continue
  232. for s in self.sectors:
  233. if (s.idam.c == r.idam.c and
  234. s.idam.h == r.idam.h and
  235. s.idam.r == r.idam.r and
  236. s.idam.n == r.idam.n):
  237. s.idam.crc = 0
  238. if r.dam.crc == 0 and s.dam.crc != 0:
  239. s.dam.crc = s.crc = 0
  240. s.dam.data = r.dam.data
  241. def set_img_track(self, tdat):
  242. pos = 0
  243. self.sectors.sort(key = lambda x: x.idam.r)
  244. totsize = functools.reduce(lambda x, y: x + (128<<y.idam.n),
  245. self.sectors, 0)
  246. if len(tdat) < totsize:
  247. tdat += bytes(totsize - len(tdat))
  248. for s in self.sectors:
  249. s.crc = s.idam.crc = s.dam.crc = 0
  250. size = 128 << s.idam.n
  251. s.dam.data = tdat[pos:pos+size]
  252. pos += size
  253. self.sectors.sort(key = lambda x: x.start)
  254. return totsize
  255. def get_img_track(self):
  256. tdat = bytearray()
  257. sectors = self.sectors.copy()
  258. sectors.sort(key = lambda x: x.idam.r)
  259. for s in sectors:
  260. tdat += s.dam.data
  261. return tdat
  262. def verify_track(self, flux):
  263. readback_track = IBM_MFM_Formatted(self.cyl, self.head)
  264. readback_track.clock = self.clock
  265. readback_track.time_per_rev = self.time_per_rev
  266. for x in self.iams:
  267. readback_track.iams.append(copy.copy(x))
  268. for x in self.sectors:
  269. idam, dam = copy.copy(x.idam), copy.copy(x.dam)
  270. idam.crc, dam.crc = 0xffff, 0xffff
  271. readback_track.sectors.append(Sector(idam, dam))
  272. readback_track.decode_raw(flux)
  273. if readback_track.nr_missing() != 0:
  274. return False
  275. return self.sectors == readback_track.sectors
  276. class IBM_MFM_Predefined(IBM_MFM_Formatted):
  277. cskew = 0
  278. hskew = 0
  279. interleave = 1
  280. def __init__(self, cyl, head):
  281. super().__init__(cyl, head)
  282. # Create logical sector map in rotational order
  283. sec_map = [-1] * self.nsec
  284. pos = (cyl*self.cskew + head*self.hskew) % self.nsec
  285. for i in range(self.nsec):
  286. while sec_map[pos] != -1:
  287. pos = (pos + 1) % self.nsec
  288. sec_map[pos] = i
  289. pos = (pos + self.interleave) % self.nsec
  290. pos = self.gap_4a
  291. if self.gap_1 is not None:
  292. self.iams = [IAM(pos*16,(pos+4)*16)]
  293. pos += 4 + self.gap_1
  294. for i in range(self.nsec):
  295. pos += self.gap_presync
  296. idam = IDAM(pos*16, (pos+10)*16, 0xffff,
  297. c=cyl, h=head, r=self.id0+sec_map[i], n = self.sz)
  298. pos += 10 + self.gap_2 + self.gap_presync
  299. size = 128 << self.sz
  300. dam = DAM(pos*16, (pos+4+size+2)*16, 0xffff,
  301. mark=self.DAM, data=bytes(size))
  302. self.sectors.append(Sector(idam, dam))
  303. pos += 4 + size + 2 + self.gap_3
  304. @classmethod
  305. def decode_track(cls, cyl, head, track):
  306. mfm = cls(cyl, head)
  307. mfm.decode_raw(track)
  308. return mfm
  309. class IBM_MFM_1M44(IBM_MFM_Predefined):
  310. time_per_rev = 0.2
  311. clock = 1e-6
  312. gap_3 = 84 # Post-DAM
  313. nsec = 18
  314. id0 = 1
  315. sz = 2
  316. class IBM_MFM_720(IBM_MFM_Predefined):
  317. time_per_rev = 0.2
  318. clock = 2e-6
  319. gap_3 = 84 # Post-DAM
  320. nsec = 9
  321. id0 = 1
  322. sz = 2
  323. class IBM_MFM_800(IBM_MFM_720):
  324. gap_3 = 30
  325. nsec = 10
  326. class AtariST_SS_9SPT(IBM_MFM_720):
  327. gap_1 = None
  328. cskew = 2
  329. class AtariST_DS_9SPT(IBM_MFM_720):
  330. gap_1 = None
  331. cskew = 4
  332. hskew = 2
  333. class AtariST_10SPT(IBM_MFM_720):
  334. gap_1 = None
  335. gap_3 = 30
  336. nsec = 10
  337. class AtariST_11SPT(IBM_MFM_720):
  338. clock = 2e-6 * 0.96 # long track
  339. gap_1 = None
  340. gap_3 = 3
  341. nsec = 11
  342. def mfm_encode(dat):
  343. y = 0
  344. out = bytearray()
  345. for x in dat:
  346. y = (y<<8) | x
  347. if (x & 0xaa) == 0:
  348. y |= ~((y>>1)|(y<<1)) & 0xaaaa
  349. y &= 255
  350. out.append(y)
  351. return bytes(out)
  352. encode_list = []
  353. for x in range(256):
  354. y = 0
  355. for i in range(8):
  356. y <<= 2
  357. y |= (x >> (7-i)) & 1
  358. encode_list.append(y)
  359. def encode(dat):
  360. out = bytearray()
  361. for x in dat:
  362. out += struct.pack('>H', encode_list[x])
  363. return bytes(out)
  364. decode_list = bytearray()
  365. for x in range(0x5555+1):
  366. y = 0
  367. for i in range(16):
  368. if x&(1<<(i*2)):
  369. y |= 1<<i
  370. decode_list.append(y)
  371. def decode(dat):
  372. out = bytearray()
  373. for x,y in zip(dat[::2], dat[1::2]):
  374. out.append(decode_list[((x<<8)|y)&0x5555])
  375. return bytes(out)
  376. # Local variables:
  377. # python-indent: 4
  378. # End: