d0p1/ack
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

ANSI C conversion.

Browse source
This commit is contained in:
carl 2019-05-11 01:18:01 +08:00
parent 21e15965cc
commit 53d2894ed1
1 changed files with 40 additions and 34 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

74
util/topgen/symtab.c
View file

@ -8,7 +8,7 @@
* Contains the routine findident, which builds the symbol table and
* searches identifiers
*/
#include <stdlib.h>
#include <string.h>
#include "symtab.h"
@ -17,40 +17,46 @@ struct symtab *idtable, *deftable;
extern void error(char *s, char* s1);
struct symtab *
findident(s, mode, table) char *s; struct symtab **table; {
/*
* Look for identifier s in the symboltable referred to by *table.
* If mode = LOOKING, no new entry's will be made.
* If mode = ENTERING, a new entry will be made if s is not in the
* table yet, otherwise an error results
*/
register struct symtab *p;
register int n;
if (!*table) { /* No entry for this symbol */
if (mode == LOOKING) return (struct symtab *) 0;
struct symtab * findident(char *s, int mode, struct symtab **table)
{
/*
* Make new entry
* Look for identifier s in the symboltable referred to by *table.
* If mode = LOOKING, no new entry's will be made.
* If mode = ENTERING, a new entry will be made if s is not in the
* table yet, otherwise an error results
*/
p = (struct symtab *) malloc(sizeof *p);
p->s_left = p->s_right = (struct symtab *) 0;
p->s_name = malloc( (unsigned) (strlen(s) + 1));
strcpy(p->s_name,s);
*table = p;
return p;
}
else {
p = *table;
if ((n = strcmp(p->s_name,s)) == 0) { /* This is it! */
if (mode == ENTERING) {
error("Identifier %s redefined",s);
}
return p;
register struct symtab *p;
register int n;
if (!*table)
{ /* No entry for this symbol */
if (mode == LOOKING)
return (struct symtab *) 0;
/*
* Make new entry
*/
p = (struct symtab *) malloc(sizeof *p);
p->s_left = p->s_right = (struct symtab *) 0;
p->s_name = malloc((unsigned) (strlen(s) + 1));
strcpy(p->s_name, s);
*table = p;
return p;
}
/* Binary tree ..... */
if (n < 0) return findident(s,mode,&(p->s_left));
return findident(s,mode,&(p->s_right));
}
/* NOTREACHED */
else
{
p = *table;
if ((n = strcmp(p->s_name, s)) == 0)
{ /* This is it! */
if (mode == ENTERING)
{
error("Identifier %s redefined", s);
}
return p;
}
/* Binary tree ..... */
if (n < 0)
return findident(s, mode, &(p->s_left));
return findident(s, mode, &(p->s_right));
}
/* NOTREACHED */
}