inpsymt.c

ngspice又一个电子CAD仿真软件代码.功能更全

/**********
Copyright 1990 Regents of the University of California.  All rights reserved.
Author: 1985 Wayne A. Christopher, U. C. Berkeley CAD Group
**********/

/*
 * Stuff for the terminal and node symbol tables.
 * Defined: INPtabInit, INPinsert, INPtermInsert, INPtabEnd
 */
/* MW. Special INPinsertNofree for routines from spiceif.c and outif.c */

#include "ngspice.h"
#include <stdio.h>		/* Take this out soon. */
#include "ifsim.h"
#include "iferrmsg.h"
#include "inpdefs.h"
#include "cpstd.h"
#include "fteext.h"
#include "inp.h"


static int hash(char *name, int tsize);

/* Initialize the symbol tables. */

INPtables *INPtabInit(int numlines)
{
    INPtables *tab;

    tab = (INPtables *) tmalloc(sizeof(INPtables));
    tab->INPsymtab = (struct INPtab **) tmalloc((numlines / 4 + 1) *
						sizeof(struct INPtab *));
    ZERO(tab->INPsymtab, (numlines / 4 + 1) * sizeof(struct INPtab *));
    tab->INPtermsymtab = (struct INPnTab **) tmalloc(numlines *
						     sizeof(struct INPnTab
							    *));
    ZERO(tab->INPtermsymtab, numlines * sizeof(struct INPnTab *));
    tab->INPsize = numlines / 4 + 1;
    tab->INPtermsize = numlines;
    return (tab);
}

/* insert 'token' into the terminal symbol table */
/* create a NEW NODE and return a pointer to it in *node */

int INPtermInsert(void *ckt, char **token, INPtables * tab, void **node)
{
    int key;
    int error;
    struct INPnTab *t;

    key = hash(*token, tab->INPtermsize);
    for (t = tab->INPtermsymtab[key]; t; t = t->t_next) {
	if (!strcmp(*token, t->t_ent)) {
	    FREE(*token);
	    *token = t->t_ent;
	    if (node)
		*node = t->t_node;
	    return (E_EXISTS);
	}
    }
    t = (struct INPnTab *) tmalloc(sizeof(struct INPnTab));
    if (t == (struct INPnTab *) NULL)
	return (E_NOMEM);
    ZERO(t, struct INPnTab);
    error = (*(ft_sim->newNode)) (ckt, &t->t_node, *token);
    if (error)
	return (error);
    if (node)
	*node = t->t_node;
    t->t_ent = *token;
    t->t_next = tab->INPtermsymtab[key];
    tab->INPtermsymtab[key] = t;
    return (OK);
}


/* insert 'token' into the terminal symbol table */
/* USE node as the node pointer */


int INPmkTerm(void *ckt, char **token, INPtables * tab, void **node)
{
    int key;
    struct INPnTab *t;

    key = hash(*token, tab->INPtermsize);
    for (t = tab->INPtermsymtab[key]; t; t = t->t_next) {
	if (!strcmp(*token, t->t_ent)) {
	    FREE(*token);
	    *token = t->t_ent;
	    if (node)
		*node = t->t_node;
	    return (E_EXISTS);
	}
    }
    t = (struct INPnTab *) tmalloc(sizeof(struct INPnTab));
    if (t == (struct INPnTab *) NULL)
	return (E_NOMEM);
    ZERO(t, struct INPnTab);
    t->t_node = *node;
    t->t_ent = *token;
    t->t_next = tab->INPtermsymtab[key];
    tab->INPtermsymtab[key] = t;
    return (OK);
}

/* insert 'token' into the terminal symbol table as a name for ground*/

int INPgndInsert(void *ckt, char **token, INPtables * tab, void **node)
{
    int key;
    int error;
    struct INPnTab *t;

    key = hash(*token, tab->INPtermsize);
    for (t = tab->INPtermsymtab[key]; t; t = t->t_next) {
	if (!strcmp(*token, t->t_ent)) {
	    FREE(*token);
	    *token = t->t_ent;
	    if (node)
		*node = t->t_node;
	    return (E_EXISTS);
	}
    }
    t = (struct INPnTab *) tmalloc(sizeof(struct INPnTab));
    if (t == (struct INPnTab *) NULL)
	return (E_NOMEM);
    ZERO(t, struct INPnTab);
    error = (*(ft_sim->groundNode)) (ckt, &t->t_node, *token);
    if (error)
	return (error);
    if (node)
	*node = t->t_node;
    t->t_ent = *token;
    t->t_next = tab->INPtermsymtab[key];
    tab->INPtermsymtab[key] = t;
    return (OK);
}

/* retrieve 'token' from the symbol table */

int INPretrieve(char **token, INPtables * tab)
{
    struct INPtab *t;
    int key;

    key = hash(*token, tab->INPsize);
    for (t = tab->INPsymtab[key]; t; t = t->t_next)
	if (!strcmp(*token, t->t_ent)) {
	    *token = t->t_ent;
	    return (OK);
	}
    return (E_BADPARM);
}


/* insert 'token' into the symbol table */

int INPinsert(char **token, INPtables * tab)
{
    struct INPtab *t;
    int key;

    key = hash(*token, tab->INPsize);
    for (t = tab->INPsymtab[key]; t; t = t->t_next)
	if (!strcmp(*token, t->t_ent)) {
	    FREE(*token);
	    *token = t->t_ent;
	    return (E_EXISTS);
	}
    t = (struct INPtab *) tmalloc(sizeof(struct INPtab));
    if (t == (struct INPtab *) NULL)
	return (E_NOMEM);
    ZERO(t, struct INPtab);
    t->t_ent = *token;
    t->t_next = tab->INPsymtab[key];
    tab->INPsymtab[key] = t;
    return (OK);
}


/* MW. insert 'token' into the symbol table but no free() token pointer.
*	Calling routine should take care for this */

int INPinsertNofree(char **token, INPtables * tab)
{
    struct INPtab *t;
    int key;

    key = hash(*token, tab->INPsize);
    for (t = tab->INPsymtab[key]; t; t = t->t_next)
	if (!strcmp(*token, t->t_ent)) {

	    /* MW. We can't touch memory pointed by token now */
	    *token = t->t_ent;
	    return (E_EXISTS);
	}
    t = (struct INPtab *) tmalloc(sizeof(struct INPtab));
    if (t == (struct INPtab *) NULL)
	return (E_NOMEM);
    ZERO(t, struct INPtab);
    t->t_ent = *token;
    t->t_next = tab->INPsymtab[key];
    tab->INPsymtab[key] = t;
    return (OK);
}

/* remove 'token' from the symbol table */
int INPremove(char *token, INPtables * tab)
{
    struct INPtab *t, **prevp;
    int key;

    key = hash(token, tab->INPsize);
    prevp = &tab->INPsymtab[key];
    for (t = *prevp; t && token != t->t_ent; t = t->t_next)
	prevp = &t->t_next;
    if (!t)
	return OK;

    *prevp = t->t_next;
    tfree(t->t_ent);
    tfree(t);

    return OK;
}

/* remove 'token' from the symbol table */
int INPremTerm(char *token, INPtables * tab)
{
    struct INPnTab *t, **prevp;
    int key;

    key = hash(token, tab->INPtermsize);
    prevp = &tab->INPtermsymtab[key];
    for (t = *prevp; t && token != t->t_ent; t = t->t_next)
	prevp = &t->t_next;
    if (!t)
	return OK;

    *prevp = t->t_next;
    tfree(t->t_ent);
    tfree(t);

    return OK;
}

/* Free the space used by the symbol tables. */

void INPtabEnd(INPtables * tab)
{
    struct INPtab *t, *lt;
    struct INPnTab *n, *ln;
    int i;

    for (i = 0; i < tab->INPsize; i++)
	for (t = tab->INPsymtab[i]; t; t = lt) {
	    lt = t->t_next;
	    FREE(t);		/* But not t_ent ! */
	}
    FREE(tab->INPsymtab);
    for (i = 0; i < tab->INPtermsize; i++)
	for (n = tab->INPtermsymtab[i]; n; n = ln) {
	    ln = n->t_next;
	    FREE(n);		/* But not t_ent ! */
	}
    FREE(tab->INPtermsymtab);
    FREE(tab);
    return;
}

static int hash(char *name, int tsize)
{
    char *s;
    register int i = 0;

    for (s = name; *s; s++)
	i += *s;
    return (i % tsize);
}