summaryrefslogtreecommitdiff
path: root/rdoff/symtab.c
blob: c0ff3e562a12fbe93cb1b367b12522f101e60d99 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/* symtab.c	Routines to maintain and manipulate a symbol table
 *
 * 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.
 */
#include <stdio.h>
#include <stdlib.h>

#include "symtab.h"

/* TODO: Implement a hash table, not this stupid implementation which
   is too slow to be of practical use */

/* Private data types */

typedef struct tagSymtab {
  symtabEnt		ent;
  struct tagSymtab	* next;
} symtabList;

typedef symtabList *	_symtab;

void *symtabNew(void)
{
  void *p = malloc(sizeof(_symtab));
  if (p == NULL) {
    fprintf(stderr,"symtab: out of memory\n");
    exit(3);
  }
  *(_symtab *)p = NULL;

  return p;
}

void symtabDone(void *symtab)
{
  /* DO SOMETHING HERE! */
}

void symtabInsert(void *symtab,symtabEnt *ent)
{
  symtabList	*l = malloc(sizeof(symtabList));

  if (l == NULL) {
    fprintf(stderr,"symtab: out of memory\n");
    exit(3);
  }

  l->ent = *ent;
  l->next = *(_symtab *)symtab;
  *(_symtab *)symtab = l;
}

symtabEnt *symtabFind(void *symtab,char *name)
{
  symtabList	*l = *(_symtab *)symtab;

  while (l) {
    if (!strcmp(l->ent.name,name)) {
      return &(l->ent);
    }
    l = l->next;
  }
  return NULL;
}

void symtabDump(void *symtab,FILE *of)
{
  symtabList	*l = *(_symtab *)symtab;

  while(l) {
    fprintf(of,"%32s %s:%08lx (%ld)\n",l->ent.name,
	    l->ent.segment ? "data" : "code" ,
	    l->ent.offset, l->ent.flags);
    l = l->next;
  }
}