amigados.py 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. # greaseweazle/codec/amiga/amigados.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 struct
  8. import itertools as it
  9. from bitarray import bitarray
  10. from greaseweazle.track import MasterTrack, RawTrack
  11. default_revs = 1.1
  12. sync_bytes = b'\x44\x89\x44\x89'
  13. sync = bitarray(endian='big')
  14. sync.frombytes(sync_bytes)
  15. bad_sector = b'-=[BAD SECTOR]=-' * 32
  16. class AmigaDOS:
  17. DDSEC = 11
  18. def __init__(self, tracknr, nsec=DDSEC):
  19. self.tracknr = tracknr
  20. self.nsec = nsec
  21. self.sector = [None] * nsec
  22. self.map = [None] * nsec
  23. def summary_string(self):
  24. nsec, nbad = self.nsec, self.nr_missing()
  25. s = "AmigaDOS (%d/%d sectors)" % (nsec - nbad, nsec)
  26. if nbad != 0:
  27. s += " - %d sectors missing" % nbad
  28. return s
  29. # private
  30. def exists(self, sec_id, togo):
  31. return ((self.sector[sec_id] is not None)
  32. or (self.map[self.nsec-togo] is not None))
  33. # private
  34. def add(self, sec_id, togo, label, data):
  35. assert not self.exists(sec_id, togo)
  36. self.sector[sec_id] = label, data
  37. self.map[self.nsec-togo] = sec_id
  38. def has_sec(self, sec_id):
  39. return self.sector[sec_id] is not None
  40. def nr_missing(self):
  41. return len([sec for sec in self.sector if sec is None])
  42. def get_adf_track(self):
  43. tdat = bytearray()
  44. for sec in self.sector:
  45. tdat += sec[1] if sec is not None else bad_sector
  46. return tdat
  47. def set_adf_track(self, tdat):
  48. self.map = list(range(self.nsec))
  49. for sec in self.map:
  50. self.sector[sec] = bytes(16), tdat[sec*512:(sec+1)*512]
  51. def flux_for_writeout(self, *args, **kwargs):
  52. return self.raw_track().flux_for_writeout(args, kwargs)
  53. def flux(self, *args, **kwargs):
  54. return self.raw_track().flux(args, kwargs)
  55. def decode_raw(self, track):
  56. raw = RawTrack(clock = 2e-6, data = track)
  57. bits, _ = raw.get_all_data()
  58. for offs in bits.itersearch(sync):
  59. if self.nr_missing() == 0:
  60. break
  61. sec = bits[offs:offs+544*16].tobytes()
  62. if len(sec) != 1088:
  63. continue
  64. header = decode(sec[4:12])
  65. format, track, sec_id, togo = tuple(header)
  66. if format != 0xff or track != self.tracknr \
  67. or not(sec_id < self.nsec and 0 < togo <= self.nsec) \
  68. or self.exists(sec_id, togo):
  69. continue
  70. label = decode(sec[12:44])
  71. hsum, = struct.unpack('>I', decode(sec[44:52]))
  72. if hsum != checksum(header + label):
  73. continue
  74. dsum, = struct.unpack('>I', decode(sec[52:60]))
  75. data = decode(sec[60:1084])
  76. gap = decode(sec[1084:1088])
  77. if dsum != checksum(data):
  78. continue;
  79. self.add(sec_id, togo, label, data)
  80. def raw_track(self):
  81. # List of sector IDs missing from the sector map:
  82. missing = iter([x for x in range(self.nsec) if not x in self.map])
  83. # Sector map with the missing entries filled in:
  84. full_map = [next(missing) if x is None else x for x in self.map]
  85. # Post-index track gap.
  86. t = encode(bytes(128 * (self.nsec//11)))
  87. for nr, sec_id in zip(range(self.nsec), full_map):
  88. sector = self.sector[sec_id]
  89. label, data = (bytes(16), bad_sector) if sector is None else sector
  90. header = bytes([0xff, self.tracknr, sec_id, self.nsec-nr])
  91. t += sync_bytes
  92. t += encode(header)
  93. t += encode(label)
  94. t += encode(struct.pack('>I', checksum(header + label)))
  95. t += encode(struct.pack('>I', checksum(data)))
  96. t += encode(data)
  97. t += encode(bytes(2))
  98. # Add the pre-index gap.
  99. tlen = 101376 * (self.nsec//11)
  100. t += bytes(tlen//8-len(t))
  101. track = MasterTrack(
  102. bits = mfm_encode(t),
  103. time_per_rev = 0.2)
  104. track.verify = self
  105. track.verify_revs = default_revs
  106. return track
  107. def verify_track(self, flux):
  108. cyl = self.tracknr // 2
  109. head = self.tracknr & 1
  110. readback_track = decode_track(cyl, head, flux)
  111. return (readback_track.nr_missing() == 0
  112. and self.sector == readback_track.sector)
  113. def mfm_encode(dat):
  114. y = 0
  115. out = bytearray()
  116. for x in dat:
  117. y = (y<<8) | x
  118. if (x & 0xaa) == 0:
  119. y |= ~((y>>1)|(y<<1)) & 0xaaaa
  120. y &= 255
  121. out.append(y)
  122. return bytes(out)
  123. def encode(dat):
  124. return bytes(it.chain(map(lambda x: (x >> 1) & 0x55, dat),
  125. map(lambda x: x & 0x55, dat)))
  126. def decode(dat):
  127. length = len(dat)//2
  128. return bytes(map(lambda x, y: (x << 1 & 0xaa) | (y & 0x55),
  129. it.islice(dat, 0, length),
  130. it.islice(dat, length, None)))
  131. def checksum(dat):
  132. csum = 0
  133. for i in range(0, len(dat), 4):
  134. csum ^= struct.unpack('>I', dat[i:i+4])[0]
  135. return (csum ^ (csum>>1)) & 0x55555555
  136. def decode_track(cyl, head, track):
  137. ados = AmigaDOS(cyl*2 + head)
  138. ados.decode_raw(track)
  139. return ados
  140. # Local variables:
  141. # python-indent: 4
  142. # End: