view lwcc/symbol.c @ 314:a3e277c58df9 ccdev

Checkpoint parser development for lwcc Beginning of lemon based parser for C including all the infrastructure for calling the lemon generated parser. This requires a translation layer from the preprocessor token numbers to the lemon parser token numbers due to the fact that lemon wants to control the token numbers. Eventually when the lemon parser gets replaced with a hand crafted recursive descent parser, this translation will no longer be required. However, in the interest of getting things working sooner rather than later, using something like lemon is beneficial.
author William Astle <lost@l-w.ca>
date Sun, 17 Nov 2013 11:59:36 -0700
parents 54f213c8fb81
children
line wrap: on
line source

/*
lwcc/symbol.c

Copyright © 2013 William Astle

This file is part of LWTOOLS.

LWTOOLS is free software: you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation, either version 3 of the License, or (at your option) any later
version.

This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
more details.

You should have received a copy of the GNU General Public License along with
this program. If not, see <http://www.gnu.org/licenses/>.
*/

#include <string.h>

#include <lw_alloc.h>
#include <lw_string.h>

#include "cpp.h"
#include "symbol.h"
#include "token.h"

void symbol_free(struct symtab_e *s)
{
	int i;

	lw_free(s -> name);
	
	for (i = 0; i < s -> nargs; i++)
		lw_free(s -> params[i]);
	lw_free(s -> params);
	token_list_destroy(s -> tl);
}

struct symtab_e *symtab_find(struct preproc_info *pp, char *name)
{
	struct symtab_e *s;
	
	for (s = pp -> sh; s; s = s -> next)
	{
		if (strcmp(s -> name, name) == 0)
		{
			return s;
		}
	}
	return NULL;
}

void symtab_undef(struct preproc_info *pp, char *name)
{
	struct symtab_e *s, **p;
	
	p = &(pp -> sh);
	for (s = pp -> sh; s; s = s -> next)
	{
		if (strcmp(s -> name, name) == 0)
		{
			(*p) -> next = s -> next;
			symbol_free(s);
			return;
		}
		p = &((*p) -> next);
	}
}

void symtab_define(struct preproc_info *pp, char *name, struct token_list *def, int nargs, char **params, int vargs)
{
	struct symtab_e *s;
	int i;
		
	s = lw_alloc(sizeof(struct symtab_e));
	s -> name = lw_strdup(name);
	s -> tl = def;
	s -> nargs = nargs;
	s -> params = NULL;
	if (params)
	{
		s -> params = lw_alloc(sizeof(char *) * nargs);
		for (i = 0; i < nargs; i++)
			s -> params[i] = lw_strdup(params[i]);
	}
	s -> vargs = vargs;
	s -> next = pp -> sh;
	pp -> sh = s;
}

void symtab_dump(struct preproc_info *pp)
{
	struct symtab_e *s;
	struct token *t;
	int i;
		
	for (s = pp -> sh; s; s = s -> next)
	{
		printf("%s", s -> name);
		if (s -> nargs >= 0)
		{
			printf("(");
			for (i = 0; i < s -> nargs; i++)
			{
				if (i)
					printf(",");
				printf("%s", s -> params[i]);
			}
			if (s -> vargs)
			{
				if (s -> nargs)
					printf(",");
				printf("...");
			}
			printf(")");
		}
		printf(" => ");
		if (s -> tl)
		{
			for (t = s -> tl -> head; t; t = t -> next)
			{
				token_print(t, stdout);
			}
		}
		printf("\n");
	}
}