Skip to content

Instantly share code, notes, and snippets.

@awesie
Created November 20, 2013 03:34
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save awesie/7557248 to your computer and use it in GitHub Desktop.
Save awesie/7557248 to your computer and use it in GitHub Desktop.
Example decompression script for the Westwood NXZ file format.
#!/usr/bin/python
#
# Example decompression script for the NXZ file format
#
# Author:
# Andrew Wesie <awesie@gmail.com>
#
# Algorithm details:
# Huffman encoding + LZ77 (64K window)
# 274 symbols
# 0x00 - 0xFF (literal bytes)
# 0x100 - 0x107 (LZ77 with size 0 - 8)
# 0x108 - 0x10F (LZ77 with encoded size)
# 0x110 (rebuild Huffman codes)
# 0x111 (invalid)
#
# Implementation details:
# This implementation is written to be correct and easy to understand, not
# fast.
#
# The bit reading implementation is slow. It would be better to use a library
# like `bitarray' if you are using Python.
#
import struct
INITIAL_ALPHABET = [
0x100, 0x101, 0x102, 0x103, 0x104, 0x105, 0x106, 0x107, 0x108,
0x109, 0x10A, 0x10B, 0x10C, 0x10D, 0x10E, 0x10F, 0x0, 0x20, 0x30,
0x0FF, 0x1, 0x2, 0x3, 0x4, 0x5, 0x6, 0x7, 0x8, 0x9, 0x0A, 0x0B, 0x0C, 0x0D,
0x0E, 0x0F, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18,
0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x21, 0x22, 0x23, 0x24,
0x25, 0x26, 0x27, 0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F,
0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B,
0x3C, 0x3D, 0x3E, 0x3F, 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46,
0x47, 0x48, 0x49, 0x4A, 0x4B, 0x4C, 0x4D, 0x4E, 0x4F, 0x50, 0x51,
0x52, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58, 0x59, 0x5A, 0x5B, 0x5C,
0x5D, 0x5E, 0x5F, 0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
0x68, 0x69, 0x6A, 0x6B, 0x6C, 0x6D, 0x6E, 0x6F, 0x70, 0x71, 0x72,
0x73, 0x74, 0x75, 0x76, 0x77, 0x78, 0x79, 0x7A, 0x7B, 0x7C, 0x7D,
0x7E, 0x7F, 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88,
0x89, 0x8A, 0x8B, 0x8C, 0x8D, 0x8E, 0x8F, 0x90, 0x91, 0x92, 0x93,
0x94, 0x95, 0x96, 0x97, 0x98, 0x99, 0x9A, 0x9B, 0x9C, 0x9D, 0x9E,
0x9F, 0x0A0, 0x0A1, 0x0A2, 0x0A3, 0x0A4, 0x0A5, 0x0A6, 0x0A7,
0x0A8, 0x0A9, 0x0AA, 0x0AB, 0x0AC, 0x0AD, 0x0AE, 0x0AF, 0x0B0,
0x0B1, 0x0B2, 0x0B3, 0x0B4, 0x0B5, 0x0B6, 0x0B7, 0x0B8, 0x0B9,
0x0BA, 0x0BB, 0x0BC, 0x0BD, 0x0BE, 0x0BF, 0x0C0, 0x0C1, 0x0C2,
0x0C3, 0x0C4, 0x0C5, 0x0C6, 0x0C7, 0x0C8, 0x0C9, 0x0CA, 0x0CB,
0x0CC, 0x0CD, 0x0CE, 0x0CF, 0x0D0, 0x0D1, 0x0D2, 0x0D3, 0x0D4,
0x0D5, 0x0D6, 0x0D7, 0x0D8, 0x0D9, 0x0DA, 0x0DB, 0x0DC, 0x0DD,
0x0DE, 0x0DF, 0x0E0, 0x0E1, 0x0E2, 0x0E3, 0x0E4, 0x0E5, 0x0E6,
0x0E7, 0x0E8, 0x0E9, 0x0EA, 0x0EB, 0x0EC, 0x0ED, 0x0EE, 0x0EF,
0x0F0, 0x0F1, 0x0F2, 0x0F3, 0x0F4, 0x0F5, 0x0F6, 0x0F7, 0x0F8,
0x0F9, 0x0FA, 0x0FB, 0x0FC, 0x0FD, 0x0FE, 0x110, 0x111
]
INITIAL_HUFFMAN_TABLE = [
(2, 0x00), (3, 0x04), (3, 0x0C), (4, 0x14),
(4, 0x24), (4, 0x34), (4, 0x44), (4, 0x54),
(4, 0x64), (4, 0x74), (4, 0x84), (4, 0x94),
(4, 0xA4), (5, 0xB4), (5, 0xD4), (5, 0xF4)
]
LENGTH_HUFFMAN_TABLE = [
(1, 0x08), (2, 0x0A), (3, 0x0E), (4, 0x16),
(5, 0x26), (6, 0x46), (7, 0x86), (8, 0x106)
]
DISTANCE_HUFFMAN_TABLE = [
(0, 0x00), (0, 0x01), (1, 0x02), (2, 0x04),
(3, 0x08), (4, 0x10), (5, 0x20), (6, 0x40)
]
NUM_SYMBOLS = 0x112
WINDOW_SIZE = 0x10000
class NxzDecompress(object):
def __init__(self):
self.alphabet = INITIAL_ALPHABET
self.huffman = INITIAL_HUFFMAN_TABLE
self.symbol_counts = [0] * NUM_SYMBOLS
self.bits = 0
self.bits_size = 0
self.history = [0] * WINDOW_SIZE
self.history_idx = 0
def read_bit(self):
if self.bits_size == 0:
self.bits = ord(self.src[self.src_idx])
self.src_idx += 1
self.bits_size = 8
out = (self.bits & 0x80) >> 7
self.bits <<= 1
self.bits_size -= 1
return out
def read_bits(self, count):
# reads an N-bit number from self.bits / self.src
out = 0
for x in xrange(count):
out = (out << 1) | self.read_bit()
return out
def rebuild_alphabet(self):
# construct array of symbols sorted by self.symbol_counts
symbols = sorted(xrange(NUM_SYMBOLS), key=lambda x: (self.symbol_counts[x] << 16) + x, reverse=True)
self.alphabet = []
for x in symbols:
self.alphabet.append(x)
def decompress(self, src, dst_len):
self.src = src
self.src_idx = 0
dst = ''
while len(dst) < dst_len:
code = self.read_bits(4)
(bits, offset) = self.huffman[code]
idx = self.read_bits(bits) + offset
symbol = self.alphabet[idx]
self.symbol_counts[symbol] += 1
if symbol < 0x100:
# literal byte
# output byte
dst += chr(symbol)
# add to history
self.history[self.history_idx % WINDOW_SIZE] = symbol
self.history_idx += 1
elif symbol == 0x110:
# rebuild huffman codes
self.rebuild_alphabet()
# divide all counts by two
self.symbol_counts = map(lambda x: x / 2, self.symbol_counts)
# parse new huffman table
self.huffman = []
bits = 0
offset = 0
for x in xrange(16):
i = 0
while self.read_bit() == 0:
i += 1
bits += i
self.huffman.append((bits, offset))
offset += 1 << bits
elif symbol >= 0x111:
# error
raise Exception('Invalid symbol')
else:
# LZ77
length = 4
if symbol < 0x108:
length += symbol - 0x100
else:
(bits, offset) = LENGTH_HUFFMAN_TABLE[symbol - 0x108]
length += offset + self.read_bits(bits)
code = self.read_bits(3)
(bits, offset) = DISTANCE_HUFFMAN_TABLE[code]
distance = (offset << 9) + self.read_bits(bits + 9)
if len(dst) + length > dst_len:
raise Exception('Invalid LZ77 length')
idx = self.history_idx - distance
for x in xrange(length):
symbol = self.history[(idx + x) % WINDOW_SIZE]
# output byte
dst += chr(symbol)
# add to history
self.history[self.history_idx % WINDOW_SIZE] = symbol
self.history_idx += 1
return dst
if __name__ == '__main__':
f = open(r'Y:\X files\Nox\maps\Bunker\Bunker.nxz', 'rb')
outlen = struct.unpack('<I', f.read(4))[0]
src = f.read()
nxz = NxzDecompress()
out = nxz.decompress(src, outlen)
open(r'C:\out.map', 'wb').write(out)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment