amigados.py 4.5 KB

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