Skip to content

Latest commit

 

History

History
930 lines (836 loc) · 41.5 KB

lx_dump.c

File metadata and controls

930 lines (836 loc) · 41.5 KB
 
Feb 26, 2018
Feb 26, 2018
1
2
3
4
5
6
7
8
/**
* 2ine; an OS/2 emulator for Linux.
*
* Please see the file LICENSE.txt in the source's root directory.
*
* This file written by Ryan C. Gordon.
*/
9
10
11
12
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
Feb 28, 2018
Feb 28, 2018
13
14
#include "lib2ine.h"
15
16
17
// !!! FIXME: some cut-and-paste with lx_loader.c ...
Jun 6, 2018
Jun 6, 2018
18
static int sanityCheckLxExe(const uint8 *exe, const uint32 exelen)
19
{
Jun 6, 2018
Jun 6, 2018
20
21
22
23
24
if (sizeof (LxHeader) >= exelen) {
fprintf(stderr, "not an OS/2 EXE\n");
return 0;
}
Mar 7, 2018
Mar 7, 2018
25
const LxHeader *lx = (const LxHeader *) exe;
26
27
28
29
30
31
if ((lx->byte_order != 0) || (lx->word_order != 0)) {
fprintf(stderr, "Program is not little-endian!\n");
return 0;
}
if (lx->lx_version != 0) {
Sep 30, 2016
Sep 30, 2016
32
fprintf(stderr, "Program is unknown LX EXE version (%u)\n", (uint) lx->lx_version);
33
34
35
36
return 0;
}
if (lx->cpu_type > 3) { // 1==286, 2==386, 3==486
Sep 30, 2016
Sep 30, 2016
37
fprintf(stderr, "Program needs unknown CPU type (%u)\n", (uint) lx->cpu_type);
38
39
40
41
return 0;
}
if (lx->os_type != 1) { // 1==OS/2, others: dos4, windows, win386, unknown.
Sep 30, 2016
Sep 30, 2016
42
fprintf(stderr, "Program needs unknown OS type (%u)\n", (uint) lx->os_type);
43
44
45
46
return 0;
}
if (lx->page_size != 4096) {
Sep 30, 2016
Sep 30, 2016
47
fprintf(stderr, "Program page size isn't 4096 (%u)\n", (uint) lx->page_size);
48
49
50
51
return 0;
}
return 1;
Mar 7, 2018
Mar 7, 2018
52
} // sanityCheckLxExe
53
Jun 6, 2018
Jun 6, 2018
54
static int sanityCheckNeExe(const uint8 *exe, const uint32 exelen)
Mar 7, 2018
Mar 7, 2018
55
{
Jun 6, 2018
Jun 6, 2018
56
57
58
59
60
if (sizeof (NeHeader) >= exelen) {
fprintf(stderr, "not an OS/2 EXE\n");
return 0;
}
Mar 7, 2018
Mar 7, 2018
61
const NeHeader *ne = (const NeHeader *) exe;
Jun 17, 2018
Jun 17, 2018
62
if (ne->exe_type > 1) {
Mar 7, 2018
Mar 7, 2018
63
64
65
fprintf(stderr, "Not an OS/2 NE EXE file (exe_type is %d, not 1)\n", (int) ne->exe_type);
return 0;
}
66
Mar 7, 2018
Mar 7, 2018
67
68
69
70
return 1;
} // sanityCheckNeExe
static int sanityCheckExe(uint8 **_exe, uint32 *_exelen, int *_is_lx)
71
{
Jun 6, 2018
Jun 6, 2018
72
if (*_exelen < 62) {
Mar 7, 2018
Mar 7, 2018
73
74
75
76
77
fprintf(stderr, "not an OS/2 EXE\n");
return 0;
}
const uint32 header_offset = *((uint32 *) (*_exe + 0x3C));
//printf("header offset is %u\n", (uint) header_offset);
78
Mar 7, 2018
Mar 7, 2018
79
80
81
82
*_exe += header_offset; // skip the DOS stub, etc.
*_exelen -= header_offset;
const uint8 *magic = *_exe;
83
Mar 7, 2018
Mar 7, 2018
84
85
if ((magic[0] == 'L') && (magic[1] == 'X')) {
*_is_lx = 1;
Jun 6, 2018
Jun 6, 2018
86
return sanityCheckLxExe(*_exe, *_exelen);
Mar 7, 2018
Mar 7, 2018
87
88
} else if ((magic[0] == 'N') && (magic[1] == 'E')) {
*_is_lx = 0;
Jun 6, 2018
Jun 6, 2018
89
return sanityCheckNeExe(*_exe, *_exelen);
Mar 7, 2018
Mar 7, 2018
90
91
92
93
94
95
96
97
}
fprintf(stderr, "not an OS/2 EXE\n");
return 0;
} // sanityCheckExe
static int parseLxExe(const uint8 *origexe, const uint8 *exe)
{
98
const LxHeader *lx = (const LxHeader *) exe;
Mar 7, 2018
Mar 7, 2018
99
printf("LX (32-bit) executable.\n");
Sep 30, 2016
Sep 30, 2016
100
printf("module version: %u\n", (uint) lx->module_version);
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
printf("module flags:");
if (lx->module_flags & 0x4) printf(" LIBINIT");
if (lx->module_flags & 0x10) printf(" INTERNALFIXUPS");
if (lx->module_flags & 0x20) printf(" EXTERNALFIXUPS");
if (lx->module_flags & 0x100) printf(" PMINCOMPAT");
if (lx->module_flags & 0x200) printf(" PMCOMPAT");
if (lx->module_flags & 0x300) printf(" USESPM");
if (lx->module_flags & 0x2000) printf(" NOTLOADABLE");
if (lx->module_flags & 0x8000) printf(" LIBRARYMODULE");
if (lx->module_flags & 0x18000) printf(" PROTMEMLIBRARYMODULE");
if (lx->module_flags & 0x20000) printf(" PHYSDRIVERMODULE");
if (lx->module_flags & 0x28000) printf(" VIRTDRIVERMODULE");
if (lx->module_flags & 0x40000000) printf(" LIBTERM");
printf("\n");
Sep 30, 2016
Sep 30, 2016
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
printf("Number of pages in module: %u\n", (uint) lx->module_num_pages);
printf("EIP Object number: %u\n", (uint) lx->eip_object);
printf("EIP: 0x%X\n", (uint) lx->eip);
printf("ESP Object number: %u\n", (uint) lx->esp_object);
printf("ESP: 0x%X\n", (uint) lx->esp);
printf("Page size: %u\n", (uint) lx->page_size);
printf("Page offset shift: %u\n", (uint) lx->page_offset_shift);
printf("Fixup section size: %u\n", (uint) lx->fixup_section_size);
printf("Fixup section checksum: 0x%X\n", (uint) lx->fixup_section_checksum);
printf("Loader section size: %u\n", (uint) lx->loader_section_size);
printf("Loader section checksum: 0x%X\n", (uint) lx->loader_section_checksum);
printf("Object table offset: %u\n", (uint) lx->object_table_offset);
printf("Number of objects in module: %u\n", (uint) lx->module_num_objects);
printf("Object page table offset: %u\n", (uint) lx->object_page_table_offset);
printf("Object iterated pages offset: %u\n", (uint) lx->object_iter_pages_offset);
printf("Resource table offset: %u\n", (uint) lx->resource_table_offset);
printf("Number of resource table entries: %u\n", (uint) lx->num_resource_table_entries);
printf("Resident name table offset: %u\n", (uint) lx->resident_name_table_offset);
printf("Entry table offset: %u\n", (uint) lx->entry_table_offset);
printf("Module directives offset: %u\n", (uint) lx->module_directives_offset);
printf("Number of module directives: %u\n", (uint) lx->num_module_directives);
printf("Fixup page table offset: %u\n", (uint) lx->fixup_page_table_offset);
printf("Fixup record table offset: %u\n", (uint) lx->fixup_record_table_offset);
printf("Import module table offset: %u\n", (uint) lx->import_module_table_offset);
printf("Number of inport module entries: %u\n", (uint) lx->num_import_mod_entries);
printf("Import procedure name table offset: %u\n", (uint) lx->import_proc_table_offset);
printf("Per-page checksum offset: %u\n", (uint) lx->per_page_checksum_offset);
printf("Data pages offset: %u\n", (uint) lx->data_pages_offset);
printf("Number of preload pages: %u\n", (uint) lx->num_preload_pages);
printf("Non-resident name table offset: %u\n", (uint) lx->non_resident_name_table_offset);
printf("Non-resident name table length: %u\n", (uint) lx->non_resident_name_table_len);
printf("Non-resident name table checksum: 0x%X\n", (uint) lx->non_resident_name_table_checksum);
printf("Auto data segment object number: %u\n", (uint) lx->auto_ds_object_num);
printf("Debug info offset: %u\n", (uint) lx->debug_info_offset);
printf("Debug info length: %u\n", (uint) lx->debug_info_len);
printf("Number of instance pages in preload section: %u\n", (uint) lx->num_instance_preload);
printf("Number of instance pages in demand section: %u\n", (uint) lx->num_instance_demand);
printf("Heap size: %u\n", (uint) lx->heapsize);
155
156
157
158
159
160
161
162
/* This is apparently a requirement as of OS/2 2.0, according to lxexe.txt. */
if ((lx->object_iter_pages_offset != 0) && (lx->object_iter_pages_offset != lx->data_pages_offset)) {
fprintf(stderr, "Object iterator pages offset must be 0 or equal to Data pages offset\n");
}
// when an LX file says "object" it's probably more like "section" or "segment" ...?
printf("\n");
Sep 30, 2016
Sep 30, 2016
163
printf("Object table (%u entries):\n", (uint) lx->module_num_objects);
164
165
for (uint32 i = 0; i < lx->module_num_objects; i++) {
const LxObjectTableEntry *obj = ((const LxObjectTableEntry *) (exe + lx->object_table_offset)) + i;
Sep 30, 2016
Sep 30, 2016
166
167
168
printf("Object #%u:\n", (uint) i+1);
printf("Virtual size: %u\n", (uint) obj->virtual_size);
printf("Relocation base address: 0x%X\n", (uint) obj->reloc_base_addr);
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
printf("Object flags:");
if (obj->object_flags & 0x1) printf(" READ");
if (obj->object_flags & 0x2) printf(" WRITE");
if (obj->object_flags & 0x4) printf(" EXEC");
if (obj->object_flags & 0x8) printf(" RESOURCE");
if (obj->object_flags & 0x10) printf(" DISCARD");
if (obj->object_flags & 0x20) printf(" SHARED");
if (obj->object_flags & 0x40) printf(" PRELOAD");
if (obj->object_flags & 0x80) printf(" INVALID");
if (obj->object_flags & 0x100) printf(" ZEROFILL");
if (obj->object_flags & 0x200) printf(" RESIDENT");
if (obj->object_flags & 0x300) printf(" RESIDENT+CONTIG");
if (obj->object_flags & 0x400) printf(" RESIDENT+LONGLOCK");
if (obj->object_flags & 0x800) printf(" SYSRESERVED");
if (obj->object_flags & 0x1000) printf(" 16:16");
if (obj->object_flags & 0x2000) printf(" BIG");
if (obj->object_flags & 0x4000) printf(" CONFORM");
if (obj->object_flags & 0x8000) printf(" IOPL");
printf("\n");
Sep 30, 2016
Sep 30, 2016
188
189
190
printf("Page table index: %u\n", (uint) obj->page_table_index);
printf("Number of page table entries: %u\n", (uint) obj->num_page_table_entries);
printf("System-reserved field: %u\n", (uint) obj->reserved);
191
192
193
194
printf("Object pages:\n");
const LxObjectPageTableEntry *objpage = ((const LxObjectPageTableEntry *) (exe + lx->object_page_table_offset)) + (obj->page_table_index - 1);
const uint32 *fixuppage = (((const uint32 *) (exe + lx->fixup_page_table_offset)) + (obj->page_table_index - 1));
Sep 25, 2016
Sep 25, 2016
195
for (uint32 i = 0; i < obj->num_page_table_entries; i++, objpage++, fixuppage++) {
Sep 30, 2016
Sep 30, 2016
196
197
198
199
printf("Object Page #%u:\n", (uint) (i + obj->page_table_index));
printf("Page data offset: 0x%X\n", (uint) objpage->page_data_offset);
printf("Page data size: %u\n", (uint) objpage->data_size);
printf("Page flags: (%u)", (uint) objpage->flags);
200
201
202
203
204
205
206
207
208
209
if (objpage->flags == 0x0) printf(" PHYSICAL");
else if (objpage->flags == 0x1) printf(" ITERATED");
else if (objpage->flags == 0x2) printf(" INVALID");
else if (objpage->flags == 0x3) printf(" ZEROFILL");
else if (objpage->flags == 0x4) printf(" RANGE");
else if (objpage->flags == 0x5) printf(" COMPRESSED");
else printf(" UNKNOWN");
printf("\n");
const uint32 fixupoffset = *fixuppage;
const uint32 fixuplen = fixuppage[1] - fixuppage[0];
Sep 30, 2016
Sep 30, 2016
210
211
printf("Page's fixup record offset: %u\n", (uint) fixupoffset);
printf("Page's fixup record size: %u\n", (uint) fixuplen);
212
213
214
215
printf("Fixup records:\n");
const uint8 *fixup = (exe + lx->fixup_record_table_offset) + fixupoffset;
const uint8 *fixupend = fixup + fixuplen;
for (uint32 i = 0; fixup < fixupend; i++) {
Sep 30, 2016
Sep 30, 2016
216
printf("Fixup Record #%u:\n", (uint) (i + 1));
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
printf("Source type: ");
const uint8 srctype = *(fixup++);
if (srctype & 0x10) printf("[FIXUPTOALIAS] ");
if (srctype & 0x20) printf("[SOURCELIST] ");
switch (srctype & 0xF) {
case 0x00: printf("Byte fixup"); break;
case 0x02: printf("16-bit selector fixup"); break;
case 0x03: printf("16:16 pointer fixup"); break;
case 0x05: printf("16-bit offset fixup"); break;
case 0x06: printf("16:32 pointer fixup"); break;
case 0x07: printf("32-bit offset fixup"); break;
case 0x08: printf("32-bit self-relative offset fixup"); break;
default: printf("(undefined fixup)"); break;
} // switch
printf("\n");
const uint8 fixupflags = *(fixup++);
printf("Target flags:");
switch (fixupflags & 0x3) {
case 0x0: printf(" INTERNAL"); break;
case 0x1: printf(" IMPORTBYORDINAL"); break;
case 0x2: printf(" IMPORTBYNAME"); break;
case 0x3: printf(" INTERNALVIAENTRY"); break;
} // switch
if (fixupflags & 0x4) printf(" ADDITIVE");
if (fixupflags & 0x8) printf(" INTERNALCHAINING");
if (fixupflags & 0x10) printf(" 32BITTARGETOFFSET");
if (fixupflags & 0x20) printf(" 32BITADDITIVE");
if (fixupflags & 0x40) printf(" 16BITORDINAL");
if (fixupflags & 0x80) printf(" 8BITORDINAL");
printf("\n");
uint8 srclist_count = 0;
if (srctype & 0x20) { // source list
srclist_count = *(fixup++);
Sep 30, 2016
Sep 30, 2016
253
printf("Source offset list count: %u\n", (uint) srclist_count);
254
} else {
Sep 25, 2016
Sep 25, 2016
255
256
const sint16 srcoffset = *((sint16 *) fixup); fixup += 2;
printf("Source offset: %d\n", (int) srcoffset);
257
258
259
260
261
262
263
264
} // else
printf("\n");
switch (fixupflags & 0x3) {
case 0x0:
printf("Internal fixup record:\n");
if (fixupflags & 0x40) { // 16 bit value
const uint16 val = *((uint16 *) fixup); fixup += 2;
Sep 30, 2016
Sep 30, 2016
265
printf("Object: %u\n", (uint) val);
266
267
} else {
const uint8 val = *(fixup++);
Sep 30, 2016
Sep 30, 2016
268
printf("Object: %u\n", (uint) val);
269
270
271
272
273
274
275
} // else
printf("Target offset: ");
if ((srctype & 0xF) == 0x2) { // 16-bit selector fixup
printf("[not used for 16-bit selector fixups]\n");
} else if (fixupflags & 0x10) { // 32-bit target offset
const uint32 val = *((uint32 *) fixup); fixup += 4;
Sep 30, 2016
Sep 30, 2016
276
printf("%u\n", (uint) val);
277
278
} else { // 16-bit target offset
const uint16 val = *((uint16 *) fixup); fixup += 2;
Sep 30, 2016
Sep 30, 2016
279
printf("%u\n", (uint) val);
280
281
282
283
284
285
286
} // else
break;
case 0x1:
printf("Import by ordinal fixup record:\n");
if (fixupflags & 0x40) { // 16 bit value
const uint16 val = *((uint16 *) fixup); fixup += 2;
Sep 30, 2016
Sep 30, 2016
287
printf("Module ordinal: %u\n", (uint) val);
288
289
} else {
const uint8 val = *(fixup++);
Sep 30, 2016
Sep 30, 2016
290
printf("Module ordinal: %u\n", (uint) val);
291
292
293
294
} // else
if (fixupflags & 0x80) { // 8 bit value
const uint8 val = *(fixup++);
Sep 30, 2016
Sep 30, 2016
295
printf("Import ordinal: %u\n", (uint) val);
296
297
} else if (fixupflags & 0x10) { // 32-bit value
const uint32 val = *((uint32 *) fixup); fixup += 4;
Sep 30, 2016
Sep 30, 2016
298
printf("Import ordinal: %u\n", (uint) val);
299
300
} else { // 16-bit value
const uint16 val = *((uint16 *) fixup); fixup += 2;
Sep 30, 2016
Sep 30, 2016
301
printf("Import ordinal: %u\n", (uint) val);
302
303
304
305
306
307
308
309
310
311
312
313
} // else
uint32 additive = 0;
if (fixupflags & 0x4) { // Has additive.
if (fixupflags & 0x20) { // 32-bit value
additive = *((uint32 *) fixup);
fixup += 4;
} else { // 16-bit value
additive = *((uint16 *) fixup);
fixup += 2;
} // else
} // if
Sep 30, 2016
Sep 30, 2016
314
printf("Additive: %u\n", (uint) additive);
315
316
break;
Oct 18, 2016
Oct 18, 2016
317
case 0x2: {
318
printf("Import by name fixup record:\n");
Oct 18, 2016
Oct 18, 2016
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
if (fixupflags & 0x40) { // 16 bit value
const uint16 val = *((uint16 *) fixup); fixup += 2;
printf("Module ordinal: %u\n", (uint) val);
} else {
const uint8 val = *(fixup++);
printf("Module ordinal: %u\n", (uint) val);
} // else
uint32 name_offset = 0;
if (fixupflags & 0x10) { // 32-bit value
name_offset = *((uint32 *) fixup); fixup += 4;
} else { // 16-bit value
name_offset = *((uint16 *) fixup); fixup += 2;
} // else
const uint8 *import_name = (exe + lx->import_proc_table_offset) + name_offset;
char name[128];
const uint8 namelen = *(import_name++) & 0x7F;
memcpy(name, import_name, namelen);
name[namelen] = '\0';
printf("Name offset: %u ('%s')\n", (uint) name_offset, name);
uint32 additive = 0;
if (fixupflags & 0x4) { // Has additive.
if (fixupflags & 0x20) { // 32-bit value
additive = *((uint32 *) fixup);
fixup += 4;
} else { // 16-bit value
additive = *((uint16 *) fixup);
fixup += 2;
} // else
} // if
printf("Additive: %u\n", (uint) additive);
353
break;
Oct 18, 2016
Oct 18, 2016
354
} // case
355
356
357
358
359
360
361
362
363
364
case 0x3:
printf("Internal entry table fixup record:\n");
printf("WRITE ME\n"); exit(1);
break;
} // switch
if (srctype & 0x20) { // source list
printf("Source offset list:");
for (uint8 i = 0; i < srclist_count; i++) {
Sep 25, 2016
Sep 25, 2016
365
366
const sint16 val = *((sint16 *) fixup); fixup += 2;
printf(" %d", (int) val);
367
368
369
370
371
372
373
374
375
376
377
} // for
} // if
printf("\n\n");
} // while
printf("\n");
} // for
} // for
printf("\n");
Sep 30, 2016
Sep 30, 2016
378
printf("Resource table (%u entries):\n", (uint) lx->num_resource_table_entries);
379
380
for (uint32 i = 0; i < lx->num_resource_table_entries; i++) {
const LxResourceTableEntry *rsrc = ((const LxResourceTableEntry *) (exe + lx->resource_table_offset)) + i;
Sep 30, 2016
Sep 30, 2016
381
382
383
384
385
386
printf("%u:\n", (uint) i);
printf("Type ID: %u\n", (uint) rsrc->type_id);
printf("Name ID: %u\n", (uint) rsrc->name_id);
printf("Resource size: %u\n", (uint) rsrc->resource_size);
printf("Object: %u\n", (uint) rsrc->object);
printf("Offset: 0x%X\n", (uint) rsrc->offset);
387
388
389
390
391
392
393
printf("\n");
} // for
printf("\n");
printf("Entry table:\n");
int bundleid = 1;
Sep 23, 2016
Sep 23, 2016
394
int ordinal = 1;
395
396
397
398
399
400
const uint8 *entryptr = exe + lx->entry_table_offset;
while (*entryptr) { /* end field has a value of zero. */
const uint8 numentries = *(entryptr++); /* number of entries in this bundle */
const uint8 bundletype = (*entryptr) & ~0x80;
const uint8 paramtypes = (*(entryptr++) & 0x80) ? 1 : 0;
Sep 30, 2016
Sep 30, 2016
401
printf("Bundle %d (%u entries): ", bundleid, (uint) numentries);
402
403
404
405
406
407
408
409
bundleid++;
if (paramtypes)
printf("[PARAMTYPES] ");
switch (bundletype) {
case 0x00:
printf("UNUSED\n");
Sep 30, 2016
Sep 30, 2016
410
printf(" %u unused entries.\n\n", (uint) numentries);
Sep 23, 2016
Sep 23, 2016
411
ordinal += numentries;
412
413
414
415
break;
case 0x01:
printf("16BIT\n");
Sep 30, 2016
Sep 30, 2016
416
printf(" Object number: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
417
for (uint8 i = 0; i < numentries; i++) {
Sep 23, 2016
Sep 23, 2016
418
printf(" %d:\n", ordinal++);
419
420
421
printf(" Flags:");
if (*entryptr & 0x1) printf(" EXPORTED");
printf("\n");
Sep 30, 2016
Sep 30, 2016
422
423
printf(" Parameter word count: %u\n", (uint) ((*entryptr & 0xF8) >> 3)); entryptr++;
printf(" Offset: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
424
425
426
427
428
429
printf("\n");
}
break;
case 0x02:
printf("286CALLGATE\n");
Sep 30, 2016
Sep 30, 2016
430
printf(" Object number: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
431
for (uint8 i = 0; i < numentries; i++) {
Sep 23, 2016
Sep 23, 2016
432
printf(" %d:\n", ordinal++);
433
434
435
printf(" Flags:");
if (*entryptr & 0x1) printf(" EXPORTED");
printf("\n");
Sep 30, 2016
Sep 30, 2016
436
437
438
printf(" Parameter word count: %u\n", (uint) ((*entryptr & 0xF8) >> 3)); entryptr++;
printf(" Offset: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
printf(" Callgate selector: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
439
440
441
442
443
printf("\n");
}
break;
case 0x03: printf("32BIT\n");
Sep 30, 2016
Sep 30, 2016
444
printf(" Object number: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
445
for (uint8 i = 0; i < numentries; i++) {
Sep 23, 2016
Sep 23, 2016
446
printf(" %d:\n", ordinal++);
447
448
449
printf(" Flags:");
if (*entryptr & 0x1) printf(" EXPORTED");
printf("\n");
Sep 30, 2016
Sep 30, 2016
450
451
printf(" Parameter word count: %u\n", (uint) ((*entryptr & 0xF8) >> 3)); entryptr++;
printf(" Offset: %u\n", (uint) *((const uint32 *) entryptr)); entryptr += 4;
452
453
454
455
456
printf("\n");
}
break;
case 0x04: printf("FORWARDER\n"); break;
Sep 30, 2016
Sep 30, 2016
457
printf(" Reserved field: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
458
for (uint8 i = 0; i < numentries; i++) {
Sep 23, 2016
Sep 23, 2016
459
printf(" %d:\n", ordinal++);
460
461
462
463
printf(" Flags:");
const int isordinal = (*entryptr & 0x1);
if (isordinal) printf(" IMPORTBYORDINAL");
printf("\n");
Sep 30, 2016
Sep 30, 2016
464
465
printf(" Reserved for future use: %u\n", (uint) ((*entryptr & 0xF8) >> 3)); entryptr++;
printf(" Module ordinal number: %u\n", (uint) *((const uint16 *) entryptr)); entryptr += 2;
466
if (isordinal) {
Sep 30, 2016
Sep 30, 2016
467
printf(" Import ordinal number: %u\n", (uint) *((const uint32 *) entryptr)); entryptr += 4;
468
} else {
Sep 30, 2016
Sep 30, 2016
469
printf(" Import name offset: %u\n", (uint) *((const uint32 *) entryptr)); entryptr += 4;
470
471
472
473
474
475
}
printf("\n");
}
break;
default:
Sep 30, 2016
Sep 30, 2016
476
printf("UNKNOWN (%u)\n\n", (uint) bundletype);
477
478
479
480
481
break; // !!! FIXME: what to do?
} // switch
} // while
printf("\n");
Sep 30, 2016
Sep 30, 2016
482
printf("Module directives (%u entries):\n", (uint) lx->num_module_directives);
483
484
const uint8 *dirptr = exe + lx->module_directives_offset;
for (uint32 i = 0; i < lx->num_module_directives; i++) {
Sep 30, 2016
Sep 30, 2016
485
486
487
488
printf("%u:\n", (uint) i+1);
printf("Directive ID: %u\n", (uint) *((const uint16 *) dirptr)); dirptr += 2;
printf("Data size: %u\n", (uint) *((const uint16 *) dirptr)); dirptr += 2;
printf("Data offset: %u\n", (uint) *((const uint32 *) dirptr)); dirptr += 4;
489
490
491
492
493
494
495
496
497
498
499
500
501
printf("\n");
// !!! FIXME: verify record directive table, etc, based on Directive ID
}
printf("\n");
if (lx->per_page_checksum_offset == 0) {
printf("No per-page checksums available.\n");
} else {
printf("!!! FIXME: look at per-page checksums!\n");
}
printf("\n");
Sep 30, 2016
Sep 30, 2016
502
printf("Import modules (%u entries):\n", (uint) lx->num_import_mod_entries);
503
504
505
506
507
508
509
510
const uint8 *import_modules_table = exe + lx->import_module_table_offset;
for (uint32 i = 0; i < lx->num_import_mod_entries; i++) {
char name[128];
const uint8 namelen = *(import_modules_table++);
// !!! FIXME: name can't be more than 127 chars, according to docs. Check this.
memcpy(name, import_modules_table, namelen);
import_modules_table += namelen;
name[namelen] = '\0';
Sep 30, 2016
Sep 30, 2016
511
printf("%u: %s\n", (uint) i+1, name);
512
513
}
Sep 21, 2016
Sep 21, 2016
514
515
516
517
518
519
520
521
522
523
524
const uint8 *name_table;
printf("Resident name table:\n");
name_table = exe + lx->resident_name_table_offset;
for (uint32 i = 0; *name_table; i++) {
const uint8 namelen = *(name_table++);
char name[256];
memcpy(name, name_table, namelen);
name[namelen] = '\0';
name_table += namelen;
const uint16 ordinal = *((const uint16 *) name_table); name_table += 2;
Sep 30, 2016
Sep 30, 2016
525
printf("%u: '%s' (ordinal %u)\n", (uint) i, name, (uint) ordinal);
Sep 21, 2016
Sep 21, 2016
526
527
528
529
530
531
532
533
534
535
536
537
} // for
printf("Non-resident name table:\n");
name_table = origexe + lx->non_resident_name_table_offset;
const uint8 *end_of_name_table = name_table + lx->non_resident_name_table_len;
for (uint32 i = 0; (name_table < end_of_name_table) && *name_table; i++) {
const uint8 namelen = *(name_table++);
char name[256];
memcpy(name, name_table, namelen);
name[namelen] = '\0';
name_table += namelen;
const uint16 ordinal = *((const uint16 *) name_table); name_table += 2;
Sep 30, 2016
Sep 30, 2016
538
printf("%u: '%s' (ordinal %u)\n", (uint) i, name, (uint) ordinal);
Sep 21, 2016
Sep 21, 2016
539
} // for
Mar 7, 2018
Mar 7, 2018
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
return 1;
} // parseLxExe
static int parseNeExe(const uint8 *origexe, const uint8 *exe)
{
const NeHeader *ne = (const NeHeader *) exe;
printf("NE (16-bit) executable.\n");
printf("Linker version: %u\n", (uint) ne->linker_version);
printf("Linker revision: %u\n", (uint) ne->linker_revision);
printf("Entry table offset: %u\n", (uint) ne->entry_table_offset);
printf("Entry table size: %u\n", (uint) ne->entry_table_size);
printf("CRC32: 0x%X\n", (uint) ne->crc32);
printf("Module flags:");
if (ne->module_flags == 0) printf(" NOAUTODATA");
if (ne->module_flags & 0x1) printf(" SINGLEDATA");
if (ne->module_flags & 0x2) printf(" MULTIPLEDATA");
Jun 13, 2018
Jun 13, 2018
557
if (ne->module_flags & 0x4) printf(" FAMILYAPI");
Mar 7, 2018
Mar 7, 2018
558
if (ne->module_flags & 0x2000) printf(" NOTLOADABLE");
Jun 13, 2018
Jun 13, 2018
559
if (ne->module_flags & 0x4000) printf(" NONCONFORMING");
Mar 7, 2018
Mar 7, 2018
560
561
if (ne->module_flags & 0x8000) printf(" LIBRARYMODULE");
printf("\n");
Jun 13, 2018
Jun 13, 2018
562
563
564
565
566
567
568
569
printf("Application type: ");
switch ((ne->module_flags >> 8) & 0x3) {
case 0x0: printf("CONSOLE"); break;
case 0x1: printf("FULLSCREEN"); break;
case 0x2: printf("WINPMCOMPAT"); break;
case 0x3: printf("WINPMUSES"); break;
} // switch
printf("\n");
Mar 7, 2018
Mar 7, 2018
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
printf("Automatic data segment: %u\n", (uint) ne->auto_data_segment);
printf("Dynamic heap size: %u\n", (uint) ne->dynamic_heap_size);
printf("Stack size: %u\n", (uint) ne->stack_size);
printf("Initial code address: %X:%X\n", (uint) ne->reg_cs, (uint) ne->reg_ip);
printf("Initial stack address: %X:%X\n", (uint) ne->reg_ss, (uint) ne->reg_sp);
printf("Number of segment table entries: %u\n", (uint) ne->num_segment_table_entries);
printf("Number of module reference table entries: %u\n", (uint) ne->num_module_ref_table_entries);
printf("Non-resident name table size: %u\n", (uint) ne->non_resident_name_table_size);
printf("Segment table offset: %u\n", (uint) ne->segment_table_offset);
printf("Resource table offset: %u\n", (uint) ne->resource_table_offset);
printf("Resident name table offset: %u\n", (uint) ne->resident_name_table_offset);
printf("Module reference table offset: %u\n", (uint) ne->module_reference_table_offset);
printf("Imported names table offset: %u\n", (uint) ne->imported_names_table_offset);
printf("Non-resident name table offset: %u\n", (uint) ne->non_resident_name_table_offset);
printf("Number of movable entries: %u\n", (uint) ne->num_movable_entries);
Jun 6, 2018
Jun 6, 2018
585
printf("Sector alignment shift count: %u\n", (uint) ne->sector_alignment_shift_count);
Mar 7, 2018
Mar 7, 2018
586
587
printf("Number of resource entries: %u\n", (uint) ne->num_resource_entries);
printf("Executable type: %u\n", (uint) ne->exe_type);
Jun 13, 2018
Jun 13, 2018
588
589
590
591
592
593
594
595
596
597
598
printf("OS/2 flags:");
if (ne->os2_exe_flags == 0) {
printf(" (none)");
} else {
if (ne->os2_exe_flags & (1 << 0)) printf(" LONGFILENAMES");
if (ne->os2_exe_flags & (1 << 1)) printf(" PROTECTEDMODE");
if (ne->os2_exe_flags & (1 << 2)) printf(" PROPORTIONALFONTS");
if (ne->os2_exe_flags & (1 << 3)) printf(" GANGLOADAREA");
}
printf("\n");
Mar 7, 2018
Mar 7, 2018
599
600
printf("\n");
Jun 6, 2018
Jun 6, 2018
601
const uint32 sector_shift = ne->sector_alignment_shift_count;
Mar 7, 2018
Mar 7, 2018
602
603
604
605
606
607
608
609
610
611
612
if (ne->num_segment_table_entries > 0) {
const uint32 total = (uint32) ne->num_segment_table_entries;
printf("Segment table (%u entries):\n", (uint) total);
const NeSegmentTableEntry *seg = (const NeSegmentTableEntry *) (exe + ne->segment_table_offset);
for (uint32 i = 0; i < total; i++, seg++) {
printf(" %u:\n", (uint) (i+1));
printf(" Logical-sector offset: %u", (uint) seg->offset);
if (seg->offset == 0) {
printf(" (no file data)\n");
} else {
Jun 6, 2018
Jun 6, 2018
613
printf(" (byte position %u)\n", (uint) (((uint32) seg->offset) << sector_shift));
Mar 7, 2018
Mar 7, 2018
614
615
616
}
printf(" Size: %u\n", (seg->size == 0) ? (uint) 0x10000 : (uint) seg->size);
printf(" Segment flags:");
Jun 13, 2018
Jun 13, 2018
617
switch (seg->segment_flags & 0x3) {
Mar 7, 2018
Mar 7, 2018
618
619
620
621
case 0: printf(" CODE"); break;
case 1: printf(" DATA"); break;
default: printf(" [UNKNOWN SEGMENT TYPE]"); break;
}
Jun 13, 2018
Jun 13, 2018
622
623
if (seg->segment_flags & 0x4) printf(" REALMODE");
if (seg->segment_flags & 0x8) printf(" ITERATED");
Mar 7, 2018
Mar 7, 2018
624
if (seg->segment_flags & 0x10) printf(" MOVABLE");
Jun 13, 2018
Jun 13, 2018
625
if (seg->segment_flags & 0x20) printf(" SHAREABLE");
Mar 7, 2018
Mar 7, 2018
626
if (seg->segment_flags & 0x40) printf(" PRELOAD");
Jun 13, 2018
Jun 13, 2018
627
if (seg->segment_flags & 0x80) printf(" READONLY");
Mar 7, 2018
Mar 7, 2018
628
if (seg->segment_flags & 0x100) printf(" RELOCINFO");
Jun 13, 2018
Jun 13, 2018
629
if (seg->segment_flags & 0x200) printf(" DEBUGINFO");
Mar 7, 2018
Mar 7, 2018
630
631
if (seg->segment_flags & 0xF000) printf(" DISCARD");
printf("\n");
Jun 13, 2018
Jun 13, 2018
632
633
printf(" Discard priority: %u\n", (uint) ((seg->segment_flags >> 13) & 0x7));
Mar 7, 2018
Mar 7, 2018
634
635
636
printf(" Minimum allocation: %u\n", (seg->minimum_allocation == 0) ? (uint) 0x10000 : (uint) seg->minimum_allocation);
if (seg->segment_flags & 0x100) { // has relocations (fixups)
Jun 6, 2018
Jun 6, 2018
637
const uint8 *segptr = origexe + (((uint32) seg->offset) << sector_shift);
Mar 7, 2018
Mar 7, 2018
638
639
640
641
642
643
644
const uint8 *fixupptr = segptr + (seg->size ? seg->size : 0xFFFF);
const uint32 num_fixups = (uint32) *((const uint16 *) fixupptr); fixupptr += 2;
printf(" Fixup records (%u entries):\n", (uint) num_fixups);
for (uint32 j = 0; j < num_fixups; j++) {
const uint8 srctype = *(fixupptr++);
const uint8 flags = *(fixupptr++);
uint32 srcchain_offset = (uint32) *((const uint16 *) fixupptr); fixupptr += 2;
May 28, 2018
May 28, 2018
645
646
const uint8 *targetptr = fixupptr; fixupptr += 4;
const int additive = (flags & 0x4) != 0;
Mar 7, 2018
Mar 7, 2018
647
648
649
650
651
652
653
654
655
656
printf(" %u:\n", (uint) j);
printf(" Source type: ");
switch (srctype & 0xF) {
case 0: printf("LOBYTE"); break;
case 2: printf("SEGMENT"); break;
case 3: printf("FAR_ADDR"); break;
case 5: printf("OFFSET"); break;
default: printf("[unknown type]"); break;
}
printf("\n");
May 28, 2018
May 28, 2018
657
658
printf(" Fixup type:");
if (additive) printf(" ADDITIVE");
Mar 7, 2018
Mar 7, 2018
659
switch (flags & 0x3) {
May 28, 2018
May 28, 2018
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
case 0: {
const uint8 segment = targetptr[0];
//const uint8 reserved = targetptr[1];
const uint16 offset = *((const uint16 *) &targetptr[2]);
printf(" INTERNALREF (");
if (segment == 0xFF)
printf("movable segment, ordinal %u)", (uint) offset);
else
printf("segment %u, offset %u)", (uint) segment, (uint) offset);
}
break;
case 1: {
const uint16 module = ((const uint16 *) targetptr)[0];
const uint16 ordinal = ((const uint16 *) targetptr)[1];
printf(" IMPORTORDINAL (module %u, ordinal %u)", (uint) module, (uint) ordinal);
}
break;
case 2: {
const uint16 module = ((const uint16 *) targetptr)[0];
const uint16 offset = ((const uint16 *) targetptr)[1];
printf(" IMPORTNAME (module %u, name offset %u)", (uint) module, (uint) offset);
}
break;
case 3: {
const uint16 type = ((const uint16 *) targetptr)[0];
printf(" OSFIXUP (type %u)", (uint) type);
}
break;
Mar 7, 2018
Mar 7, 2018
691
692
693
694
695
696
697
698
}
printf("\n");
if (additive) {
printf(" Additive source: %u", (uint) srcchain_offset);
} else {
printf(" Source chain:");
do {
Jun 6, 2018
Jun 6, 2018
699
printf(" %X", (uint) srcchain_offset);
Mar 7, 2018
Mar 7, 2018
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
srcchain_offset = *((const uint16 *) (segptr + srcchain_offset));
} while (srcchain_offset < seg->size);
}
printf("\n");
}
}
}
printf("\n");
}
if (ne->num_resource_entries > 0) {
const uint8 *ptr = exe + ne->resource_table_offset;
const uint32 total = (uint32) ne->num_resource_entries;
printf("Resources (%u entries):\n", (uint) total);
int idx = 0;
while (*((const uint16 *) ptr)) {
const uint16 typeid = *((const uint16 *) ptr); ptr += 2;
const uint32 num_resources = (uint32) *((const uint16 *) ptr); ptr += 2;
ptr += 4; // reserved.
for (uint32 j = 0; j < num_resources; j++) {
idx++;
printf(" %d:", idx);
printf(" Type ID: ");
if (typeid & 0x8000) {
printf("%u\n", (uint) (typeid & ~0x8000));
} else {
const uint8 *str = (exe + ne->resource_table_offset) + typeid;
const uint32 len = (uint32) *(str++);
printf("\"");
for (uint32 k = 0; k < len; k++, str++) {
printf("%c", (int) *str);
}
printf("\"\n");
}
const uint16 offset = *((const uint16 *) ptr); ptr += 2;
const uint16 size = *((const uint16 *) ptr); ptr += 2;
const uint16 flags = *((const uint16 *) ptr); ptr += 2;
const uint16 resourceid = *((const uint16 *) ptr); ptr += 2;
ptr += 4; // reserved.
printf(" Offset: %u\n", (uint) offset);
printf(" Size: %u\n", (uint) size);
printf(" Flags:");
if (flags & 0x10) printf(" MOVABLE");
if (flags & 0x20) printf(" PURE");
if (flags & 0x40) printf(" PRELOAD");
printf("\n");
printf(" Resource ID: ");
if (resourceid & 0x8000) {
printf("%u\n", (uint) (resourceid & ~0x8000));
} else {
const uint8 *str = (exe + ne->resource_table_offset) + resourceid;
const uint32 len = (uint32) *(str++);
printf("\"");
for (uint32 k = 0; k < len; k++, str++) {
printf("%c", (int) *str);
}
printf("\"\n");
}
}
}
printf("\n");
}
if (ne->resident_name_table_offset > 0) {
const uint8 *name_table = exe + ne->resident_name_table_offset;
if (*name_table) {
printf("Resident name table:\n");
for (uint32 i = 0; *name_table; i++) {
const uint8 namelen = *(name_table++);
char name[256];
memcpy(name, name_table, namelen);
name[namelen] = '\0';
name_table += namelen;
const uint16 ordinal = *((const uint16 *) name_table); name_table += 2;
printf(" %u: '%s' (ordinal %u)\n", (uint) i, name, (uint) ordinal);
}
printf("\n");
}
}
if (ne->non_resident_name_table_offset > 0) {
const uint8 *name_table = origexe + ne->non_resident_name_table_offset;
const uint8 *end_of_name_table = name_table + ne->non_resident_name_table_size;
if ((name_table < end_of_name_table) && *name_table) {
printf("Non-resident name table:\n");
for (uint32 i = 0; (name_table < end_of_name_table) && *name_table; i++) {
const uint8 namelen = *(name_table++);
char name[256];
memcpy(name, name_table, namelen);
name[namelen] = '\0';
name_table += namelen;
const uint16 ordinal = *((const uint16 *) name_table); name_table += 2;
printf(" %u: '%s' (ordinal %u)\n", (uint) i, name, (uint) ordinal);
}
printf("\n");
}
}
if (ne->num_module_ref_table_entries > 0) {
const uint32 total = (uint32) ne->num_module_ref_table_entries;
printf("Module reference table (%u entries):\n", (uint) total);
const uint16 *ptr = (const uint16 *) (exe + ne->module_reference_table_offset);
for (uint32 i = 0; i < total; i++, ptr++) {
const uint8 *name = (exe + ne->imported_names_table_offset) + *ptr;
const uint32 name_string_len = (uint32) *name;
name++;
May 28, 2018
May 28, 2018
807
printf(" %u: ", (uint) i+1);
Mar 7, 2018
Mar 7, 2018
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
for (uint32 j = 0; j < name_string_len; j++, name++) {
printf("%c", (int) *name);
}
printf("\n");
}
printf("\n");
}
if (ne->entry_table_size > 0) {
const uint8 *ptr = exe + ne->entry_table_offset;
if (*ptr) {
printf("Entry table:\n");
uint32 ordinal = 1;
while (1) {
const uint8 bundled = *(ptr++);
if (!bundled) {
break;
}
const uint8 bundletype = *(ptr++);
switch (bundletype) {
case 0x00: // unused entries, to skip ordinals.
ordinal += bundled;
break;
case 0xFF: // Moveable segment entries.
for (uint32 i = 0; i < bundled; i++, ordinal++) {
const uint8 flags = *(ptr++);
const uint16 int3f = *((const uint16 *) ptr); ptr += 2;
const uint8 segment = *(ptr++);
const uint16 offset = *((const uint16 *) ptr); ptr += 2;
printf(" %u:\n", (uint) ordinal);
printf(" Flags: MOVABLE");
if (flags & 0x1) printf(" EXPORTED");
if (flags & 0x2) printf(" GLOBAL");
printf("\n");
printf(" Int3f: %X\n", (uint) int3f);
printf(" Segment: %u\n", (uint) segment);
printf(" Offset: %u\n", (uint) offset);
}
break;
default:
for (uint32 i = 0; i < bundled; i++, ordinal++) {
const uint8 flags = *(ptr++);
const uint16 offset = *((const uint16 *) ptr); ptr += 2;
printf(" %u:\n", (uint) ordinal);
printf(" Flags: FIXED");
if (flags & 0x1) printf(" EXPORTED");
if (flags & 0x2) printf(" GLOBAL");
printf("\n");
printf(" Segment: %u\n", (uint) bundletype);
printf(" Offset: %u\n", (uint) offset);
}
break;
}
}
printf("\n");
}
}
return 1;
} // parseNeExe
static void parseExe(const char *exefname, uint8 *exe, uint32 exelen)
{
int is_lx = 0;
printf("%s\n", exefname);
const uint8 *origexe = exe;
if (!sanityCheckExe(&exe, &exelen, &is_lx))
return;
if (is_lx) {
parseLxExe(origexe, exe);
} else {
parseNeExe(origexe, exe);
}
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
} // parseExe
int main(int argc, char **argv)
{
if (argc != 2) {
fprintf(stderr, "USAGE: %s <program.exe>\n", argv[0]);
return 1;
}
const char *exefname = argv[1];
FILE *io = fopen(exefname, "rb");
if (!io) {
fprintf(stderr, "can't open '%s: %s'\n", exefname, strerror(errno));
return 2;
}
if (fseek(io, 0, SEEK_END) < 0) {
fprintf(stderr, "can't seek in '%s': %s\n", exefname, strerror(errno));
return 3;
}
const uint32 exelen = ftell(io);
uint8 *exe = (uint8 *) malloc(exelen);
if (!exe) {
fprintf(stderr, "Out of memory\n");
return 4;
}
rewind(io);
if (fread(exe, exelen, 1, io) != 1) {
fprintf(stderr, "read failure on '%s': %s\n", exefname, strerror(errno));
return 5;
}
fclose(io);
parseExe(exefname, exe, exelen);
free(exe);
return 0;
} // main
// end of lx_dump.c ...