Т> GenBitMap *Т generates bitmap for the given image *Т the program requires two ROM images: ('Т the original (assembled at &8000) 2HТ the alternative (assembled >= &8100) used to check for differences ч bmbuff% &2000:Т 8K should be large enough for the bitmap dbend%=bmbuff%+&2000 n"bptr%=bend%:Т start at the end x: ┌#code%=&DEC0:Т bitmap identifier ▄dist%=&0000 √numbits%=&0000 ═address%=&8000-1 ╙: Є@Х "File containing ROM image assembled at &8000 => "realrom$ ЎEХ "File containing ROM image assembled for relocation => "altrom$ х: рrr%=▌(realrom$) э,Г rr%=0 ▄ Я "Could not open ";realrom$:Ю Ф: Пar%=▌(altrom$) З1Г ar%=0 ▄ Я "Could not open ";altrom$:ы#rz%:Ю : FТ -- the bitmap is stored in reverse order, with the bitmap header &Т -- information stored at the end "GТ -- the header contains a special identifier (CODE) and the length ,Т -- of the bitmap in bytes 6 bptr%=bptr%-2:Т step over ID @bptr%?&00=code% ┐ &0100 Jbptr%?&01=code% │ &0100 T'bptr%=bptr%-2:Т step over bit count ^bptr%?&00=&00 hbptr%?&01=&00 r9bcadr%=bptr%:Т but remember wheze we need to place it |: ├У ░: bptr%=bptr%-1 є val%=0 ў bc%=8 ╦: бУ л: ж v1%= #rr% Ю v2%= #ar% Йaddress%=address%+1 Т: Ч,Г ((v1% >= &7F) ─ (v1% <= &BF)) ▄ Рcheck : Щ (bc%=0) └ (е#rr% └ е#ar%) : &DТ check and see if the last byte in the bitmap table needs to be 0FТ padded (this is required due to the lo-address byte being stored :Т in the highest bit) D\Г (bc%=0) ▄ Рinsert ▀ Г (bc%>0 ─ bc%<8) ▄ Ц loop%=bc% ╦ 1 ┬ -1:val%=(val%*2)+0:М:Рinsert NГ bc%=8 ▄ bptr%=bptr%+1 X: b'Щ (е#rr% └ е#ar%) └ (bptr%Г bptr%" зГ bptr%>=bmbuff% ▄ Ъ(save$) Д: НЮ Ь: щРinsert :Т place a byte into the bitmap, and decrement pointers &bptr%?&00=val%:numbits%=numbits%+1 А *: 4щРcheck >(Т - check if a byte needs relocating HЙ d% RГ v1%=v2% ▄ Рaddbit(0):А \Т they are different f3Т check they are always the same distance apart pd%=v2%-v1% z\Г dist%<>0 ─ d%<>dist% ▄ Я"Fatal error - difference not constant" ▀ Г dist%=0 ▄ dist%=d% └: ▌Я "Diff at &";~address% ≤: ╒Рaddbit(1) ╛А І: ющРaddbit(v%) й,Т - add the bit given into the structure т?Т this is done by remembering the bit in the current byte чEТ bc% : global that holds the bit count within the current byte Х1Т val% : global that holds the current byte Р bc%=bc%-1 Эval%=(val%*2)+v% А Ъ