nasm/listing.c

292 lines
6.8 KiB
C
Raw Normal View History

2002-05-01 04:52:26 +08:00
/* listing.c listing file generator for the Netwide Assembler
*
* The Netwide Assembler is copyright (C) 1996 Simon Tatham and
* Julian Hall. All rights reserved. The software is
* redistributable under the licence given in the file "Licence"
* distributed in the NASM archive.
*
* initial version 2/vii/97 by Simon Tatham
*/
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <string.h>
#include <ctype.h>
#include <inttypes.h>
2002-05-01 04:52:26 +08:00
#include "nasm.h"
#include "nasmlib.h"
#include "listing.h"
2005-01-16 06:15:51 +08:00
#define LIST_MAX_LEN 216 /* something sensible */
2002-05-01 04:52:26 +08:00
#define LIST_INDENT 40
#define LIST_HEXBIT 18
typedef struct MacroInhibit MacroInhibit;
static struct MacroInhibit {
MacroInhibit *next;
int level;
int inhibiting;
} *mistack;
static char xdigit[] = "0123456789ABCDEF";
2002-05-01 04:52:26 +08:00
#define HEX(a,b) (*(a)=xdigit[((b)>>4)&15],(a)[1]=xdigit[(b)&15]);
static char listline[LIST_MAX_LEN];
2002-05-01 04:52:26 +08:00
static int listlinep;
static char listdata[2 * LIST_INDENT]; /* we need less than that actually */
static int32_t listoffset;
2002-05-01 04:52:26 +08:00
static int32_t listlineno;
2002-05-01 04:52:26 +08:00
static int32_t listp;
2002-05-01 04:52:26 +08:00
2005-01-16 06:15:51 +08:00
static int suppress; /* for INCBIN & TIMES special cases */
2002-05-01 04:52:26 +08:00
static int listlevel, listlevel_e;
static FILE *listfp;
2005-01-16 06:15:51 +08:00
static void list_emit(void)
2002-05-01 04:53:55 +08:00
{
2002-05-01 04:52:26 +08:00
if (!listlinep && !listdata[0])
2005-01-16 06:15:51 +08:00
return;
2002-05-01 04:53:55 +08:00
2007-04-14 08:10:59 +08:00
fprintf(listfp, "%6"PRId32" ", ++listlineno);
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
if (listdata[0])
2007-04-14 08:10:59 +08:00
fprintf(listfp, "%08"PRIX32" %-*s", listoffset, LIST_HEXBIT + 1,
2005-01-16 06:15:51 +08:00
listdata);
2002-05-01 04:52:26 +08:00
else
2005-01-16 06:15:51 +08:00
fprintf(listfp, "%*s", LIST_HEXBIT + 10, "");
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
if (listlevel_e)
2005-01-16 06:15:51 +08:00
fprintf(listfp, "%s<%d>", (listlevel < 10 ? " " : ""),
listlevel_e);
2002-05-01 04:52:26 +08:00
else if (listlinep)
2005-01-16 06:15:51 +08:00
fprintf(listfp, " ");
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
if (listlinep)
2005-01-16 06:15:51 +08:00
fprintf(listfp, " %s", listline);
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
fputc('\n', listfp);
listlinep = FALSE;
listdata[0] = '\0';
}
static void list_init(char *fname, efunc error)
2002-05-01 04:53:55 +08:00
{
2005-01-16 06:15:51 +08:00
listfp = fopen(fname, "w");
2002-05-01 04:52:26 +08:00
if (!listfp) {
2005-01-16 06:15:51 +08:00
error(ERR_NONFATAL, "unable to open listing file `%s'", fname);
return;
2002-05-01 04:52:26 +08:00
}
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
*listline = '\0';
listlineno = 0;
listp = TRUE;
listlevel = 0;
suppress = 0;
mistack = nasm_malloc(sizeof(MacroInhibit));
mistack->next = NULL;
mistack->level = 0;
mistack->inhibiting = TRUE;
}
2005-01-16 06:15:51 +08:00
static void list_cleanup(void)
2002-05-01 04:53:55 +08:00
{
2002-05-01 04:52:26 +08:00
if (!listp)
2005-01-16 06:15:51 +08:00
return;
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
while (mistack) {
2005-01-16 06:15:51 +08:00
MacroInhibit *temp = mistack;
mistack = temp->next;
nasm_free(temp);
2002-05-01 04:52:26 +08:00
}
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
list_emit();
2005-01-16 06:15:51 +08:00
fclose(listfp);
2002-05-01 04:52:26 +08:00
}
static void list_out(int32_t offset, char *str)
2002-05-01 04:53:55 +08:00
{
2002-05-01 04:52:26 +08:00
if (strlen(listdata) + strlen(str) > LIST_HEXBIT) {
2005-01-16 06:15:51 +08:00
strcat(listdata, "-");
list_emit();
2002-05-01 04:52:26 +08:00
}
if (!listdata[0])
2005-01-16 06:15:51 +08:00
listoffset = offset;
2002-05-01 04:52:26 +08:00
strcat(listdata, str);
}
static void list_output(int32_t offset, const void *data, uint32_t type)
2002-05-01 04:53:55 +08:00
{
uint32_t typ, size;
2002-05-01 04:52:26 +08:00
2005-01-16 06:15:51 +08:00
if (!listp || suppress || user_nolist) /* fbk - 9/2/00 */
return;
2002-05-01 04:52:26 +08:00
typ = type & OUT_TYPMASK;
size = type & OUT_SIZMASK;
2005-01-16 06:15:51 +08:00
if (typ == OUT_RAWDATA) {
uint8_t const *p = data;
char q[3];
2005-01-16 06:15:51 +08:00
while (size--) {
HEX(q, *p);
q[2] = '\0';
list_out(offset++, q);
p++;
}
} else if (typ == OUT_ADDRESS) {
uint64_t d = *(int64_t *)data;
char q[20];
uint8_t p[8], *r = p;
2005-01-16 06:15:51 +08:00
if (size == 4) {
q[0] = '[';
q[9] = ']';
q[10] = '\0';
WRITELONG(r, d);
HEX(q + 1, p[0]);
HEX(q + 3, p[1]);
HEX(q + 5, p[2]);
HEX(q + 7, p[3]);
list_out(offset, q);
} else if (size == 8) {
q[0] = '[';
q[17] = ']';
q[18] = '\0';
WRITEDLONG(r, d);
HEX(q + 1, p[0]);
HEX(q + 3, p[1]);
HEX(q + 5, p[2]);
HEX(q + 7, p[3]);
HEX(q + 9, p[4]);
HEX(q + 11, p[5]);
HEX(q + 13, p[6]);
HEX(q + 15, p[7]);
list_out(offset, q);
2005-01-16 06:15:51 +08:00
} else {
q[0] = '[';
q[5] = ']';
q[6] = '\0';
WRITESHORT(r, d);
HEX(q + 1, p[0]);
HEX(q + 3, p[1]);
list_out(offset, q);
}
} else if (typ == OUT_REL2ADR) {
uint32_t d = *(int32_t *)data;
char q[11];
uint8_t p[4], *r = p;
2005-01-16 06:15:51 +08:00
q[0] = '(';
q[5] = ')';
q[6] = '\0';
WRITESHORT(r, d);
HEX(q + 1, p[0]);
HEX(q + 3, p[1]);
list_out(offset, q);
} else if (typ == OUT_REL4ADR) {
uint32_t d = *(int32_t *)data;
char q[11];
uint8_t p[4], *r = p;
2005-01-16 06:15:51 +08:00
q[0] = '(';
q[9] = ')';
q[10] = '\0';
WRITELONG(r, d);
HEX(q + 1, p[0]);
HEX(q + 3, p[1]);
HEX(q + 5, p[2]);
HEX(q + 7, p[3]);
list_out(offset, q);
} else if (typ == OUT_RESERVE) {
char q[20];
2007-04-14 08:10:59 +08:00
snprintf(q, sizeof(q), "<res %08"PRIX32">", size);
2005-01-16 06:15:51 +08:00
list_out(offset, q);
2002-05-01 04:52:26 +08:00
}
}
static void list_line(int type, char *line)
2002-05-01 04:53:55 +08:00
{
2002-05-01 04:52:26 +08:00
if (!listp)
2005-01-16 06:15:51 +08:00
return;
if (user_nolist) { /* fbk - 9/2/00 */
2002-05-01 05:00:33 +08:00
listlineno++;
return;
}
2002-05-01 04:53:55 +08:00
2005-01-16 06:15:51 +08:00
if (mistack && mistack->inhibiting) {
if (type == LIST_MACRO)
return;
else { /* pop the m i stack */
MacroInhibit *temp = mistack;
mistack = temp->next;
nasm_free(temp);
}
2002-05-01 04:52:26 +08:00
}
list_emit();
listlinep = TRUE;
2005-01-16 06:15:51 +08:00
strncpy(listline, line, LIST_MAX_LEN - 1);
listline[LIST_MAX_LEN - 1] = '\0';
2002-05-01 04:52:26 +08:00
listlevel_e = listlevel;
}
2005-01-16 06:15:51 +08:00
static void list_uplevel(int type)
2002-05-01 04:53:55 +08:00
{
2002-05-01 04:52:26 +08:00
if (!listp)
2005-01-16 06:15:51 +08:00
return;
if (type == LIST_INCBIN || type == LIST_TIMES) {
suppress |= (type == LIST_INCBIN ? 1 : 2);
list_out(listoffset, type == LIST_INCBIN ? "<incbin>" : "<rept>");
return;
2002-05-01 04:52:26 +08:00
}
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
listlevel++;
2002-05-01 04:53:55 +08:00
2005-01-16 06:15:51 +08:00
if (mistack && mistack->inhibiting && type == LIST_INCLUDE) {
MacroInhibit *temp = nasm_malloc(sizeof(MacroInhibit));
temp->next = mistack;
temp->level = listlevel;
temp->inhibiting = FALSE;
mistack = temp;
} else if (type == LIST_MACRO_NOLIST) {
MacroInhibit *temp = nasm_malloc(sizeof(MacroInhibit));
temp->next = mistack;
temp->level = listlevel;
temp->inhibiting = TRUE;
mistack = temp;
2002-05-01 04:52:26 +08:00
}
}
2005-01-16 06:15:51 +08:00
static void list_downlevel(int type)
2002-05-01 04:53:55 +08:00
{
2002-05-01 04:52:26 +08:00
if (!listp)
2005-01-16 06:15:51 +08:00
return;
2002-05-01 04:53:55 +08:00
2005-01-16 06:15:51 +08:00
if (type == LIST_INCBIN || type == LIST_TIMES) {
suppress &= ~(type == LIST_INCBIN ? 1 : 2);
return;
2002-05-01 04:52:26 +08:00
}
2002-05-01 04:53:55 +08:00
2002-05-01 04:52:26 +08:00
listlevel--;
2005-01-16 06:15:51 +08:00
while (mistack && mistack->level > listlevel) {
MacroInhibit *temp = mistack;
mistack = temp->next;
nasm_free(temp);
2002-05-01 04:52:26 +08:00
}
}
ListGen nasmlist = {
list_init,
list_cleanup,
list_output,
list_line,
list_uplevel,
list_downlevel
};