|
|
1.1 ! root 1: .TH BITFILE 9.5 ! 2: .CT 1 comm_other ! 3: .SH NAME ! 4: bitfile \- format of bitmap file ! 5: .SH DESCRIPTION ! 6: Binary files produced by ! 7: .IR blitblt (9.1) ! 8: and other bitmap-generating programs ! 9: are formatted as follows: ! 10: .TP 12 ! 11: Byte no. ! 12: Description ! 13: .TP ! 14: 0, 1: ! 15: Zero. ! 16: .TP ! 17: 2, 3: ! 18: .IR x -coordinate ! 19: of the rectangle origin (low-order byte, high-order byte). ! 20: .TP ! 21: 4, 5: ! 22: .IR Y -coordinate ! 23: of the rectangle origin (low-order byte, high-order byte). ! 24: .TP ! 25: 6, 7: ! 26: .IR x -coordinate ! 27: of the rectangle corner (low-order byte, high-order byte). ! 28: .TP ! 29: 8, 9: ! 30: .IR Y -coordinate ! 31: of the rectangle corner (low-order byte, high-order byte). ! 32: .TP ! 33: remainder: ! 34: Compressed raster data. ! 35: Each raster is exclusive-or'd ! 36: with the previous one, and ! 37: zero-extended (if necessary) to a 16-bit boundary. ! 38: It is then encoded into ! 39: byte sequences, each of which consists of a control byte followed by ! 40: two or more data bytes: ! 41: .TP 12 ! 42: Control ! 43: Data ! 44: .TP ! 45: .IR n " (< 127)" ! 46: .RI 2\(mu n ! 47: bytes of raster data, running from left to right. ! 48: .TP ! 49: .BI "0x80+" n ! 50: 2 bytes of raster data, to be replicated from left to right ! 51: .I n ! 52: times. ! 53: .LP ! 54: There are also two ! 55: .SM ASCII ! 56: formats in current use. ! 57: Textures and 16\(mu16 icons, ! 58: as created by ! 59: .IR icon (9.1), ! 60: are encoded as a ! 61: .B Texture ! 62: declaration with initializer, ! 63: to be copied unchanged into C program source; see ! 64: .IR types (9.5). ! 65: Faces and other large icons ! 66: are without any surrounding C syntax. ! 67: In either case, each scan line of the ! 68: bitmap is a comma-separated list of C-style short ! 69: hexadecimal constants; scan lines are separated by newlines. ! 70: .SH "SEE ALSO" ! 71: .IR blitblt (9.1), ! 72: .IR icon (9.1), ! 73: .IR types (9.5), ! 74: .IR vismon (9.1)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.