luke
/
netgen
mirror of https://github.com/RTimothyEdwards/netgen.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
netgen/base/netgen.c

3688 lines
106 KiB
C
Raw Blame History

/* "NETGEN", a netlist-specification tool for VLSI
Copyright (C) 1989, 1990 Massimo A. Sivilotti
Author's address: mass@csvax.cs.caltech.edu;
Caltech 256-80, Pasadena CA 91125.
This program 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 (any 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; see the file copying. If not, write to
the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
/* netgen.c -- most of the netlist manipulation routines and
embedded-language specification routines.
*/
#include "config.h"
#include <stdio.h>
#include <stdlib.h> /* for strtof() */
#include <stdarg.h>
#include <ctype.h> /* toupper() */
#ifdef IBMPC
#include <alloc.h>
#endif
#ifdef TCL_NETGEN
#include <tcl.h>
#endif
#include "netgen.h"
#include "hash.h"
#include "objlist.h"
#include "netfile.h"
#include "print.h"
#include "netcmp.h"
int Debug = 0;
int VerboseOutput = 1; /* by default, we get verbose output */
int IgnoreRC = 0;
int NextNode;
int Composition = NONE;
int QuickSearch = 0;
int GlobalParallelNone = FALSE;
int AddToExistingDefinition = 0; /* default: overwrite cell when reopened */
extern int errno; /* Defined in stdlib.h */
#define MAX_STATIC_STRINGS 5
static char staticstrings[MAX_STATIC_STRINGS][200];
static int laststring;
extern struct hashdict spiceparams; /* From spice.c */
char *Str(char *format, ...)
{
va_list ap;
laststring++;
laststring = laststring % MAX_STATIC_STRINGS;
va_start(ap, format);
vsprintf(staticstrings[laststring], format, ap);
va_end(ap);
return(staticstrings[laststring]);
}
/*--------------------------------------------------------------*/
/* Push a token on to the expression stack */
/*--------------------------------------------------------------*/
void PushTok(int toktype, void *tval, struct tokstack **top)
{
struct tokstack *newstack;
double dval;
char *string;
newstack = (struct tokstack *)CALLOC(1, sizeof(struct tokstack));
newstack->toktype = toktype;
switch (toktype) {
case TOK_DOUBLE:
newstack->data.dvalue = *((double *)tval);
break;
case TOK_STRING:
newstack->data.string = strsave((char *)tval);
break;
case TOK_SGL_QUOTE:
case TOK_DBL_QUOTE:
case TOK_FUNC_OPEN:
case TOK_FUNC_CLOSE:
case TOK_GROUP_OPEN:
case TOK_GROUP_CLOSE:
case TOK_FUNC_IF:
case TOK_FUNC_THEN:
case TOK_FUNC_ELSE:
newstack->data.dvalue = 0.0;
break;
default:
newstack->data.string = NULL;
break;
}
newstack->last = NULL;
newstack->next = *top;
if (*top != NULL)
(*top)->last = newstack;
*top = newstack;
}
/*--------------------------------------------------------------*/
/* Pop a token off of the expression stack, freeing the memory */
/* associated with it. */
/*--------------------------------------------------------------*/
void PopTok(struct tokstack **top)
{
struct tokstack *stackptr;
stackptr = *top;
if (!stackptr) return;
*top = stackptr->next;
(*top)->last = NULL;
/* Free the memory allocated to the popped entry */
if (stackptr->toktype == TOK_STRING)
FREE(stackptr->data.string);
FREE(stackptr);
}
/*--------------------------------------------------------------*/
/* Make a copy of an expression */
/*--------------------------------------------------------------*/
struct tokstack *CopyTokStack(struct tokstack *stack)
{
struct tokstack *stackptr, *newstack, *newptr;
newptr = NULL;
if (stack == NULL) return NULL; /* Shouldn't happen. . . */
for (stackptr = stack; stackptr->next; stackptr = stackptr->next);
for (; stackptr; stackptr = stackptr->last) {
newstack = (struct tokstack *)CALLOC(1, sizeof(struct tokstack));
newstack->last = NULL;
newstack->toktype = stackptr->toktype;
switch (stackptr->toktype) {
case TOK_STRING:
newstack->data.string = strsave(stackptr->data.string);
break;
default:
newstack->data.dvalue = stackptr->data.dvalue;
break;
}
newstack->next = newptr;
if (newptr) newptr->last = newstack;
newptr = newstack;
}
return newptr;
}
/*--------------------------------------------------------------*/
/* Get a value from a token by converting a string, potentially */
/* using unit suffixes, into a double floating-point value. */
/* Return the value in "dval", and return a result of 1 if the */
/* value was successfully converted, 0 if there was no value to */
/* convert (empty string), and -1 if unable to convert the */
/* string to a value (e.g., unknown parameter name). */
/* */
/* Inheritance is taken from "parprops" (instanced property */
/* values) if available, and from parent->propdict if not, or */
/* if the property is not instanced. */
/*--------------------------------------------------------------*/
int TokGetValue(char *estr, struct nlist *parent, struct objlist *parprops,
int glob, double *dval)
{
struct property *kl = NULL;
struct valuelist *kv;
int i, result;
if (*estr == '\0') return 0;
/* Grab the last numerical value */
if (StringIsValue(estr)) {
result = ConvertStringToFloat(estr, dval);
if (result == 1) return 1;
}
/* No numerical value found. Try substituting parameters */
if (glob == TRUE) {
/* Check global parameters */
kl = (struct property *)HashLookup(estr, &spiceparams);
if (kl != NULL) {
result = ConvertStringToFloat(kl->pdefault.string, dval);
return ((result == 0) ? -1 : 1);
}
}
/* Check local instanced parameters */
result = 0;
if ((parprops != NULL) && (parprops->type == PROPERTY)) {
for (i = 0; ; i++) {
kv = &(parprops->instance.props[i]);
if (kv->type == PROP_ENDLIST) break;
else if ((*matchfunc)(estr, kv->key)) {
switch (kv->type) {
case PROP_STRING:
result = ConvertStringToFloat(kv->value.string, dval);
break;
case PROP_DOUBLE:
case PROP_VALUE:
*dval = kv->value.dval;
result = 1;
break;
case PROP_INTEGER:
*dval = (double)kv->value.ival;
result = 1;
break;
}
break;
}
}
}
/* Check local parent parameters */
if (result == 0) {
kl = (struct property *)HashLookup(estr, &(parent->propdict));
if (kl != NULL) {
switch(kl->type) {
case PROP_STRING:
result = ConvertStringToFloat(kl->pdefault.string, dval);
break;
case PROP_DOUBLE:
case PROP_VALUE:
*dval = kl->pdefault.dval;
result = 1;
break;
case PROP_INTEGER:
*dval = (double)kl->pdefault.ival;
result = 1;
break;
}
}
}
return ((result == 0) ? -1 : 1);
}
/*--------------------------------------------------------------*/
/* Work through the property list of an instance, looking for */
/* properties that are marked as expressions. For each */
/* expression, parse and attempt to reduce to a simpler */
/* expression, preferably a single value. "glob" is TRUE when */
/* reading in a netlist, and substitutions should be made from */
/* the global parameter list. "glob" is FALSE when elaborating */
/* the netlist, and substitutions should be made from the */
/* property list of the parent. If an expression resolves to a */
/* single value, then replace the property type. */
/*--------------------------------------------------------------*/
int ReduceExpressions(struct objlist *instprop, struct objlist *parprops,
struct nlist *parent, int glob) {
struct tokstack *expstack, *stackptr, *lptr, *nptr;
struct valuelist *kv;
struct property *kl = NULL;
char *estr, *tstr, *sstr;
int toktype, functype, i, result, modified, numlast, savetok;
double dval;
if (instprop == NULL) return 0; // Nothing to do
if (instprop->type != PROPERTY) return -1; // Shouldn't happen
for (i = 0;; i++) {
kv = &(instprop->instance.props[i]);
switch (kv->type) {
case PROP_ENDLIST:
break;
case PROP_INTEGER:
case PROP_DOUBLE:
case PROP_VALUE:
continue;
case PROP_EXPRESSION:
expstack = kv->value.stack;
break;
case PROP_STRING:
expstack = NULL;
estr = kv->value.string;
tstr = estr;
numlast = 0;
while (*tstr != '\0') {
switch(*tstr) {
case '+':
if (numlast == 0) {
/* This is part of a number */
dval = strtod(estr, &sstr);
if (sstr > estr && sstr > tstr) {
tstr = sstr - 1;
numlast = 1;
}
break;
}
/* Not a number, so must be arithmetic */
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_PLUS, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '-':
if (numlast == 0) {
/* This is part of a number */
dval = strtod(estr, &sstr);
if (sstr > estr && sstr > tstr) {
tstr = sstr - 1;
numlast = 1;
}
break;
}
/* Not a number, so must be arithmetic */
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_MINUS, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '1': case '2': case '3': case '4': case '5':
case '6': case '7': case '8': case '9': case '0':
/* Numerical value. Use strtod() to capture */
if (numlast == 1) break;
dval = strtod(estr, &sstr);
if (sstr > estr && sstr > tstr) {
tstr = sstr - 1;
numlast = 1;
}
break;
case '/':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_DIVIDE, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '*':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_MULTIPLY, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '(':
*tstr = '\0';
/* Check for predefined function keywords */
if (!strcmp(estr, "IF")) {
PushTok(TOK_FUNC_IF, NULL, &expstack);
}
else {
/* Treat as a parenthetical grouping */
result = TokGetValue(estr, parent, parprops,
glob, &dval);
if (result == 1)
PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1)
PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_FUNC_OPEN, NULL, &expstack);
}
estr = tstr + 1;
numlast = 0;
break;
case ')':
*tstr = '\0';
if (expstack == NULL) break;
savetok = expstack->toktype;
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
switch (savetok) {
case TOK_FUNC_THEN:
PushTok(TOK_FUNC_ELSE, NULL, &expstack);
break;
default:
PushTok(TOK_FUNC_CLOSE, NULL, &expstack);
break;
}
numlast = 1;
estr = tstr + 1;
break;
case '\'':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_SGL_QUOTE, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '"':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_DBL_QUOTE, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '{':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_GROUP_OPEN, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '}':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
PushTok(TOK_GROUP_CLOSE, NULL, &expstack);
estr = tstr + 1;
numlast = 1;
break;
case '!':
if (*(tstr + 1) == '=') {
*tstr = '\0';
result = TokGetValue(estr, parent, parprops,
glob, &dval);
if (result == 1)
PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1)
PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_NE, NULL, &expstack);
}
numlast = 0;
break;
case '=':
if (*(tstr + 1) == '=') {
*tstr = '\0';
result = TokGetValue(estr, parent, parprops,
glob, &dval);
if (result == 1)
PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1)
PushTok(TOK_STRING, estr, &expstack);
PushTok(TOK_EQ, NULL, &expstack);
numlast = 0;
}
break;
case '>':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
if (*(tstr + 1) == '=') {
PushTok(TOK_GE, NULL, &expstack);
tstr++;
}
else
PushTok(TOK_GT, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case '<':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
if (*(tstr + 1) == '=') {
PushTok(TOK_LE, NULL, &expstack);
tstr++;
}
else
PushTok(TOK_LT, NULL, &expstack);
estr = tstr + 1;
numlast = 0;
break;
case ',':
*tstr = '\0';
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
if (expstack == NULL) break;
lptr = expstack;
while (lptr->next) {
lptr = lptr->next;
if (lptr->toktype == TOK_FUNC_THEN) {
PushTok(TOK_FUNC_ELSE, NULL, &expstack);
break;
}
else if (lptr->toktype == TOK_FUNC_IF) {
PushTok(TOK_FUNC_THEN, NULL, &expstack);
break;
}
}
estr = tstr + 1;
numlast = 0;
break;
default:
break;
}
tstr++;
}
result = TokGetValue(estr, parent, parprops, glob, &dval);
if (result == 1) PushTok(TOK_DOUBLE, &dval, &expstack);
else if (result == -1) PushTok(TOK_STRING, estr, &expstack);
FREE(kv->value.string);
kv->value.stack = expstack;
kv->type = PROP_EXPRESSION;
break;
}
// Find the beginning of the expression, which is the bottom of
// the stack.
for (stackptr = kv->value.stack; stackptr != NULL &&
stackptr->next != NULL; stackptr = stackptr->next);
// For each pass, start at the bottom and work forward
expstack = stackptr;
modified = 1;
while (modified) {
double dval1, dval2;
modified = 0;
// Reduce conditionals
for (stackptr = expstack; stackptr != NULL; stackptr = stackptr->last) {
switch (stackptr->toktype) {
case TOK_LE:
case TOK_LT:
case TOK_GE:
case TOK_GT:
case TOK_EQ:
case TOK_NE:
lptr = stackptr->last;
nptr = stackptr->next;
if (lptr && nptr && (lptr->toktype == TOK_DOUBLE) &&
(nptr->toktype == TOK_DOUBLE)) {
switch (stackptr->toktype) {
case TOK_LE:
if (nptr->data.dvalue <= lptr->data.dvalue) {
stackptr->data.dvalue = 1.0;
}
else {
stackptr->data.dvalue = 0.0;
}
break;
case TOK_LT:
if (nptr->data.dvalue < lptr->data.dvalue) {
stackptr->data.dvalue = 1.0;
}
else {
stackptr->data.dvalue = 0.0;
}
break;
case TOK_GE:
if (nptr->data.dvalue >= lptr->data.dvalue) {
stackptr->data.dvalue = 1.0;
}
else {
stackptr->data.dvalue = 0.0;
}
break;
case TOK_GT:
if (nptr->data.dvalue > lptr->data.dvalue) {
stackptr->data.dvalue = 1.0;
}
else {
stackptr->data.dvalue = 0.0;
}
break;
case TOK_EQ:
if (nptr->data.dvalue == lptr->data.dvalue) {
stackptr->data.dvalue = 1.0;
}
else {
stackptr->data.dvalue = 0.0;
}
break;
case TOK_NE:
if (nptr->data.dvalue != lptr->data.dvalue) {
stackptr->data.dvalue = 1.0;
}
else {
stackptr->data.dvalue = 0.0;
}
break;
}
modified = 1;
stackptr->toktype = TOK_DOUBLE;
stackptr->last = lptr->last;
if (lptr->last) lptr->last->next = stackptr;
else kv->value.stack = stackptr;
stackptr->next = nptr->next;
if (nptr->next) nptr->next->last = stackptr;
if (expstack == nptr) expstack = stackptr;
FREE(nptr);
FREE(lptr);
}
}
}
// Reduce IF(a,b,c)
for (stackptr = expstack; stackptr != NULL; stackptr = stackptr->last) {
struct tokstack *ifptr, *thenptr;
if (stackptr->toktype == TOK_FUNC_IF) {
ifptr = stackptr->last;
if (ifptr->toktype == TOK_DOUBLE) {
stackptr->toktype = TOK_FUNC_OPEN;
if (ifptr->data.dvalue == 0.0) {
/* Keep ELSE value, remove IF and THEN */
for (thenptr = ifptr; thenptr->toktype !=
TOK_FUNC_ELSE; ) {
lptr = thenptr->last;
nptr = thenptr->next;
lptr->next = nptr;
nptr->last = lptr;
if (thenptr->toktype == TOK_STRING)
FREE(thenptr->data.string);
FREE(thenptr);
thenptr = lptr;
}
/* Free the TOK_FUNC_ELSE record */
lptr = thenptr->last;
nptr = thenptr->next;
lptr->next = nptr;
nptr->last = lptr;
FREE(thenptr);
modified = 1;
}
else {
/* Keep THEN value, remove IF and ELSE */
/* Free the conditional result value record */
lptr = ifptr->last;
nptr = ifptr->next;
lptr->next = nptr;
nptr->last = lptr;
FREE(ifptr);
thenptr = nptr;
/* Free the TOK_FUNC_THEN record */
lptr = thenptr->last;
nptr = thenptr->next;
lptr->next = nptr;
nptr->last = lptr;
FREE(thenptr);
/* Free to end of IF block */
for (thenptr = nptr->last; thenptr->toktype !=
TOK_FUNC_CLOSE; ) {
lptr = thenptr->last;
nptr = thenptr->next;
lptr->next = nptr;
nptr->last = lptr;
if (thenptr->toktype == TOK_STRING)
FREE(thenptr->data.string);
FREE(thenptr);
thenptr = lptr;
}
modified = 1;
}
}
}
}
// Reduce (value) * (value) and (value) / (value)
for (stackptr = expstack; stackptr != NULL; stackptr = stackptr->last) {
switch (stackptr->toktype) {
case TOK_MULTIPLY:
case TOK_DIVIDE:
lptr = stackptr->last;
nptr = stackptr->next;
if (lptr && nptr && (lptr->toktype == TOK_DOUBLE) &&
(nptr->toktype == TOK_DOUBLE)) {
if (stackptr->toktype == TOK_MULTIPLY)
stackptr->data.dvalue = nptr->data.dvalue *
lptr->data.dvalue;
else
stackptr->data.dvalue = nptr->data.dvalue /
lptr->data.dvalue;
modified = 1;
stackptr->toktype = TOK_DOUBLE;
stackptr->last = lptr->last;
if (lptr->last) lptr->last->next = stackptr;
else kv->value.stack = stackptr;
stackptr->next = nptr->next;
if (nptr->next) nptr->next->last = stackptr;
if (expstack == nptr) expstack = stackptr;
FREE(nptr);
FREE(lptr);
}
}
}
// Reduce (value) + (value) and (value) - (value)
for (stackptr = expstack; stackptr != NULL; stackptr = stackptr->last) {
switch (stackptr->toktype) {
case TOK_PLUS:
case TOK_MINUS:
lptr = stackptr->last;
nptr = stackptr->next;
if (lptr && nptr && (lptr->toktype == TOK_DOUBLE) &&
(nptr->toktype == TOK_DOUBLE)) {
if (stackptr->toktype == TOK_PLUS)
stackptr->data.dvalue = nptr->data.dvalue +
lptr->data.dvalue;
else
stackptr->data.dvalue = nptr->data.dvalue -
lptr->data.dvalue;
modified = 1;
stackptr->toktype = TOK_DOUBLE;
stackptr->last = lptr->last;
if (lptr->last) lptr->last->next = stackptr;
else kv->value.stack = stackptr;
stackptr->next = nptr->next;
if (nptr->next) nptr->next->last = stackptr;
if (expstack == nptr) expstack = stackptr;
FREE(nptr);
FREE(lptr);
}
}
}
// Reduce {value}, (value), and 'value'
for (stackptr = expstack; stackptr != NULL; stackptr = stackptr->last) {
switch (stackptr->toktype) {
case TOK_DOUBLE:
lptr = stackptr->last;
nptr = stackptr->next;
if (lptr && nptr &&
(((nptr->toktype == TOK_FUNC_OPEN) &&
(lptr->toktype == TOK_FUNC_CLOSE)) ||
((nptr->toktype == TOK_GROUP_OPEN) &&
(lptr->toktype == TOK_GROUP_CLOSE)) ||
((nptr->toktype == TOK_DBL_QUOTE) &&
(lptr->toktype == TOK_DBL_QUOTE)) ||
((nptr->toktype == TOK_SGL_QUOTE) &&
(lptr->toktype == TOK_SGL_QUOTE)))) {
modified = 1;
stackptr->last = lptr->last;
if (lptr->last) lptr->last->next = stackptr;
else kv->value.stack = stackptr;
stackptr->next = nptr->next;
if (nptr->next) nptr->next->last = stackptr;
if (expstack == nptr) expstack = stackptr;
FREE(nptr);
FREE(lptr);
}
break;
}
}
// Replace value if string can be substituted with a number
for (stackptr = expstack; stackptr != NULL; stackptr = stackptr->last) {
switch (stackptr->toktype) {
case TOK_STRING:
result = TokGetValue(stackptr->data.string, parent,
parprops, glob, &dval);
if (result == 1) {
stackptr->toktype = TOK_DOUBLE;
FREE(stackptr->data.string);
stackptr->data.dvalue = dval;
modified = 1;
}
break;
}
}
}
// Replace the expression with the reduced expression or
// value.
expstack = kv->value.stack; // Now pointing at the end
if (expstack && expstack->next == NULL) {
if (expstack->toktype == TOK_DOUBLE) {
kv->type = PROP_DOUBLE;
kv->value.dval = expstack->data.dvalue;
}
else if (expstack->toktype == TOK_STRING) {
kv->type = PROP_STRING;
kv->value.string = strsave(expstack->data.string);
}
}
else {
// Still an expression; do nothing
}
// Free up the stack if it's not being used
if (kv->type != PROP_EXPRESSION)
{
while (expstack != NULL) {
nptr = expstack->next;
if (expstack->toktype == TOK_STRING)
FREE(expstack->data.string);
FREE(expstack);
expstack = nptr;
}
}
if (kv->type == PROP_ENDLIST)
break;
}
return 0;
}
/*----------------------------------------------------------------------*/
/* Set/clear the flag bit COMB_NO_PARALLEL on all cells. Note that the */
/* function is called with value for enabling combine parallel, so */
/* value TRUE means clear bit, value FALSE means set bit. */
/*----------------------------------------------------------------------*/
struct nlist *SetParallelCombineFlag(struct hashlist *p, void *clientdata)
{
struct nlist *ptr;
int *value = (int *)clientdata;
ptr = (struct nlist *)(p->ptr);
if (*value == TRUE)
ptr->flags &= (~COMB_NO_PARALLEL);
else
ptr->flags |= COMB_NO_PARALLEL;
return NULL; /* NULL keeps search alive */
}
void SetParallelCombine(int value)
{
ClearDumpedList();
RecurseCellHashTable2(SetParallelCombineFlag, (void *)(&value));
}
/*----------------------------------------------------------------------*/
/* Same as above, for series (here for symmetry, although "property */
/* series all" would be an odd command to issue, and "property series */
/* none" is the default, so not needed). */
/*----------------------------------------------------------------------*/
struct nlist *SetSeriesCombineFlag(struct hashlist *p, void *clientdata)
{
struct nlist *ptr;
int *value = (int *)clientdata;
ptr = (struct nlist *)(p->ptr);
if (*value == TRUE)
ptr->flags &= (~COMB_SERIES);
else
ptr->flags |= COMB_SERIES;
return NULL; /* NULL keeps search alive */
}
void SetSeriesCombine(int value)
{
ClearDumpedList();
RecurseCellHashTable2(SetSeriesCombineFlag, (void *)(&value));
}
/*----------------------------------------------------------------------*/
/* Delete a property from the master cell record. */
/*----------------------------------------------------------------------*/
int
PropertyDelete(char *name, int fnum, char *key)
{
struct property *kl = NULL;
struct nlist *tc;
int result;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
result = PropertyDelete(name, Circuit1->file, key);
result = PropertyDelete(name, Circuit2->file, key);
return result;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL) {
Printf("No device %s found for PropertyDelete()\n", name);
return -1;
}
else if (key == NULL) {
/* key == NULL means delete all properties. */
RecurseHashTable(&(tc->propdict), freeprop);
HashKill(&(tc->propdict));
InitializeHashTable(&(tc->propdict), OBJHASHSIZE);
}
else {
kl = (struct property *)HashLookup(key, &(tc->propdict));
if (kl != NULL) {
if (kl->type == PROP_STRING || kl->type == PROP_EXPRESSION)
FREE(kl->pdefault.string);
FREE(kl->key);
HashDelete(key, &(tc->propdict));
}
else {
Printf("No property %s found for device %s\n", key, name);
return -1;
}
}
return 0;
}
/*----------------------------------------------------------------------*/
/* Set the tolerance of a property in the master cell record. */
/*----------------------------------------------------------------------*/
int
PropertyTolerance(char *name, int fnum, char *key, int ival, double dval)
{
struct property *kl = NULL;
struct nlist *tc;
int result;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
result = PropertyTolerance(name, Circuit1->file, key, ival, dval);
result = PropertyTolerance(name, Circuit2->file, key, ival, dval);
return result;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL) {
Printf("No device %s found for PropertyTolerance()\n", name);
return -1;
}
kl = (struct property *)HashLookup(key, &(tc->propdict));
if (kl == NULL) {
Printf("No property %s found for device %s\n", key, name);
return -1;
}
else {
switch (kl->type) {
case PROP_DOUBLE:
case PROP_VALUE:
case PROP_STRING:
kl->slop.dval = dval;
break;
case PROP_INTEGER:
case PROP_EXPRESSION:
kl->slop.ival = ival;
break;
}
}
return 0;
}
/*----------------------------------------------------------------------*/
/* Set the merge type of a property in the master cell record. */
/*----------------------------------------------------------------------*/
int
PropertyMerge(char *name, int fnum, char *key, int merge_type, int merge_mask)
{
struct property *kl = NULL;
struct nlist *tc;
int result;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
result = PropertyMerge(name, Circuit1->file, key, merge_type, merge_mask);
result = PropertyMerge(name, Circuit2->file, key, merge_type, merge_mask);
return result;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL) {
Printf("No device %s found for PropertyTolerance()\n", name);
return -1;
}
kl = (struct property *)HashLookup(key, &(tc->propdict));
if (kl == NULL) {
Printf("No property %s found for device %s\n", key, name);
return -1;
}
else {
kl->merge &= ~merge_mask;
kl->merge |= merge_type;
}
return 0;
}
/*----------------------------------------------------------------------*/
/* Add a new value property to the indicated cell */
/* Value properties are used for resistors and capacitors in SPICE */
/* netlists where the value is not syntactically like other properties. */
/* For the purpose of netgen, it is treated like a PROP_DOUBLE except */
/* when reading and writing netlist files. */
/*----------------------------------------------------------------------*/
struct property *PropertyValue(char *name, int fnum, char *key,
double slop, double pdefault)
{
struct property *kl = NULL;
struct nlist *tc;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
PropertyValue(name, Circuit1->file, key, slop, pdefault);
PropertyValue(name, Circuit2->file, key, slop, pdefault);
return NULL;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL)
Printf("No device %s found for PropertyValue()\n", name);
else if ((kl = (struct property *)HashLookup(key, &(tc->propdict))) != NULL) {
Printf("Device %s already has property named \"%s\"\n", name, key);
}
else {
kl = NewProperty();
kl->key = strsave(key);
kl->idx = 0;
kl->merge = MERGE_NONE;
kl->type = PROP_VALUE;
kl->slop.dval = slop;
kl->pdefault.dval = pdefault;
HashPtrInstall(kl->key, kl, &(tc->propdict));
}
return kl;
}
/*----------------------------------------------------------------------*/
/* Add a new double-valued property key to the current cell */
/*----------------------------------------------------------------------*/
struct property *PropertyDouble(char *name, int fnum, char *key,
double slop, double pdefault)
{
struct property *kl = NULL;
struct nlist *tc;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
PropertyDouble(name, Circuit1->file, key, slop, pdefault);
PropertyDouble(name, Circuit2->file, key, slop, pdefault);
return NULL;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL)
Printf("No device %s found for PropertyDouble()\n", name);
else if ((kl = (struct property *)HashLookup(key, &(tc->propdict))) != NULL) {
Printf("Device %s already has property named \"%s\"\n", name, key);
}
else {
kl = NewProperty();
kl->key = strsave(key);
kl->idx = 0;
kl->merge = MERGE_NONE;
kl->type = PROP_DOUBLE;
kl->slop.dval = slop;
kl->pdefault.dval = pdefault;
HashPtrInstall(kl->key, kl, &(tc->propdict));
}
return kl;
}
/*----------------------------------------------------------------------*/
struct property *PropertyInteger(char *name, int fnum, char *key,
int slop, int pdefault)
{
struct property *kl = NULL;
struct nlist *tc;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
PropertyInteger(name, Circuit1->file, key, slop, pdefault);
PropertyInteger(name, Circuit2->file, key, slop, pdefault);
return NULL;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL)
Printf("No device %s found for PropertyInteger()\n", name);
else if ((kl = (struct property *)HashLookup(key, &(tc->propdict))) != NULL) {
Printf("Device %s already has property named \"%s\"\n", name, key);
}
else {
kl = NewProperty();
kl->key = strsave(key);
kl->idx = 0;
kl->merge = MERGE_NONE;
kl->type = PROP_INTEGER;
kl->slop.ival = slop;
kl->pdefault.ival = pdefault;
HashPtrInstall(kl->key, kl, &(tc->propdict));
}
return kl;
}
/*----------------------------------------------------------------------*/
struct property *PropertyString(char *name, int fnum, char *key, double dval,
char *pdefault)
{
struct property *kl = NULL;
struct nlist *tc;
if ((fnum == -1) && (Circuit1 != NULL) && (Circuit2 != NULL)) {
PropertyString(name, Circuit1->file, key, dval, pdefault);
PropertyString(name, Circuit2->file, key, dval, pdefault);
return NULL;
}
tc = LookupCellFile(name, fnum);
if (tc == NULL)
Printf("No device %s found for PropertyString()\n", name);
else if ((kl = (struct property *)HashLookup(key, &(tc->propdict))) != NULL) {
Printf("Device %s already has property named \"%s\"\n", name, key);
}
else {
kl = NewProperty();
kl->key = strsave(key);
kl->idx = 0;
kl->merge = MERGE_NONE;
kl->type = PROP_STRING;
kl->slop.dval = dval;
if (pdefault != NULL)
kl->pdefault.string = strsave(pdefault);
else
kl->pdefault.string = NULL;
HashPtrInstall(kl->key, kl, &(tc->propdict));
}
return kl;
}
/*----------------------------------------------------------------------*/
/* Declare the element class of the current cell */
/*----------------------------------------------------------------------*/
void SetClass(unsigned char class)
{
if (CurrentCell == NULL)
Printf("No current cell for SetClass()\n");
else
CurrentCell->class = class;
}
/*----------------------------------------------------------------------*/
void ReopenCellDef(char *name, int fnum)
{
struct objlist *ob;
if (Debug) Printf("Reopening cell definition: %s\n",name);
GarbageCollect();
if ((CurrentCell = LookupCellFile(name, fnum)) == NULL) {
Printf("Undefined cell: %s\n", name);
return;
}
/* cell exists, so append to the end of it */
NextNode = 1;
CurrentTail = CurrentCell->cell;
for (ob = CurrentTail; ob != NULL; ob = ob->next) {
CurrentTail = ob;
if (ob->node >= NextNode) NextNode = ob->node + 1;
}
}
/*----------------------------------------------------------------------*/
void CellDef(char *name, int fnum)
{
struct nlist *np;
if (Debug) Printf("Defining cell: %s\n",name);
GarbageCollect();
if ((CurrentCell = LookupCellFile(name, fnum)) != NULL) {
if (AddToExistingDefinition) {
ReopenCellDef(name, fnum);
return ;
}
else {
Printf("Cell: %s exists already, and will be overwritten.\n", name);
CellDelete(name, fnum);
}
}
/* install a new cell in lookup table (hashed) */
np = InstallInCellHashTable(name, fnum);
CurrentCell = LookupCellFile(name, fnum);
CurrentCell->class = CLASS_SUBCKT; /* default */
CurrentCell->flags = (GlobalParallelNone) ? COMB_NO_PARALLEL : 0;
LastPlaced = NULL;
CurrentTail = NULL;
FreeNodeNames(CurrentCell);
NextNode = 1;
// Mark cell as case insensitive if case insensitivity is in effect
if (matchfunc == matchnocase) CurrentCell->flags |= CELL_NOCASE;
}
/*----------------------------------------------------------------------*/
/* Return 0 if class 'name' is not being ignored (per the 'ignore' */
/* command); 1 if it is ignored, and 2 if shorted instances should be */
/* ignored. */
/*----------------------------------------------------------------------*/
int IsIgnored(char *name, int file)
{
struct IgnoreList *ilist;
char *nptr = name;
for (ilist = ClassIgnore; ilist; ilist = ilist->next)
{
if ((file == -1) || (ilist->file == -1) || (file == ilist->file))
if ((*matchfunc)(ilist->class, nptr))
return ilist->type; /* IGNORE_CLASS or IGNORE_SHORTED */
}
return 0;
}
/*----------------------------------------------------------------------*/
void Port(char *name)
{
struct objlist *tp;
if (Debug) Printf(" Defining port: %s\n",name);
if ((tp = GetObject()) == NULL) {
perror("Failed GetObject in Port");
return;
}
tp->type = PORT; /* port type */
if (name == NULL) {
// Name becomes "no pins" and shows up in the pin matching
// output for both devices.
tp->name = strsave("(no pins)");
tp->model.port = PROXY;
}
else {
tp->name = strsave(name);
tp->model.port = PORT;
}
tp->instance.name = NULL;
tp->node = -1; /* null node */
tp->next = NULL;
AddToCurrentCell (tp);
}
/*----------------------------------------------------------------------*/
int CountPorts(char *name, int fnum)
{
struct nlist *tc;
struct objlist *ob;
int ports = 0;
tc = LookupCellFile(name, fnum);
if (tc != NULL) {
for (ob = tc->cell; ob; ob = ob->next) {
if (ob->type != PORT) break;
ports++;
}
}
return ports;
}
/*----------------------------------------------------------------------*/
void Node(char *name)
{
struct objlist *tp;
if (Debug) Printf(" Defining internal node: %s\n",name);
if ((tp = GetObject()) == NULL) {
perror("Failed GetObject in Node");
return;
}
tp->name = strsave(name);
tp->type = NODE; /* internal node type */
tp->model.class = NULL;
tp->instance.name = NULL;
tp->node = -1; /* null node */
tp->next = NULL;
AddToCurrentCell (tp);
}
/*----------------------------------------------------------------------*/
void Global(char *name)
{
struct objlist *tp;
// Check if "name" is already in the current cell as a global node
// or a port. If it is, then we're done. Otherwise, add "name" as
// a new global in CurrentCell.
for (tp = CurrentCell->cell; tp; tp = tp->next)
if (tp->type == GLOBAL || tp->type == UNIQUEGLOBAL || tp->type == PORT)
if ((*matchfunc)(tp->name, name))
return;
if (Debug) Printf(" Defining global node: %s\n",name);
if ((tp = GetObject()) == NULL) {
perror("Failed GetObject in Global");
return;
}
tp->name = strsave(name);
tp->type = GLOBAL; /* internal node type */
tp->model.class = NULL;
tp->instance.name = NULL;
tp->node = -1; /* null node */
tp->next = NULL;
AddToCurrentCell (tp);
}
/*----------------------------------------------------------------------*/
void UniqueGlobal(char *name)
{
struct objlist *tp;
if (Debug) Printf(" Defining unique global node: %s\n",name);
if ((tp = GetObject()) == NULL) {
perror("Failed GetObject in UniqueGlobal");
return;
}
tp->name = strsave(name);
tp->type = UNIQUEGLOBAL; /* internal node type */
tp->model.class = NULL;
tp->instance.name = NULL;
tp->node = -1; /* null node */
tp->next = NULL;
AddToCurrentCell (tp);
}
/*----------------------------------------------------------------------*/
void Instance(char *model, char *instancename)
{
struct objlist *tp, *tp2;
struct nlist *instanced_cell;
int portnum;
char tmpname[512], tmpname2[512];
int firstobj, fnum;
if (Debug) Printf(" Instance: %s of class: %s\n",
instancename, model);
if (CurrentCell == NULL) {
Printf("No current cell for Instance(%s,%s)\n", model,instancename);
return;
}
fnum = CurrentCell->file;
instanced_cell = LookupCellFile(model, fnum);
if (instanced_cell == NULL) {
Printf("Attempt to instance undefined model '%s'\n", model);
return;
}
/* class exists */
instanced_cell->number++; /* one more allocated */
portnum = 1;
firstobj = 1;
for (tp2 = instanced_cell->cell; tp2 != NULL; tp2 = tp2->next)
if (IsPort(tp2)) {
/* it is a port */
tp = GetObject();
if (tp == NULL) {
perror("Failed GetObject in Instance()");
return;
}
strcpy(tmpname,instancename);
strcat(tmpname,SEPARATOR);
strcat(tmpname,tp2->name);
tp->name = strsave(tmpname);
tp->model.class = strsave(model);
tp->instance.name = strsave(instancename);
tp->type = portnum++; /* instance type */
tp->node = -1; /* null node */
tp->next = NULL;
AddToCurrentCell (tp);
if (firstobj) {
AddInstanceToCurrentCell(tp);
firstobj = 0;
}
}
/* now run through list of new objects, processing global ports */
for (tp2 = instanced_cell->cell; tp2 != NULL; tp2 = tp2->next) {
/* check to see if it is a global port */
if (tp2->type == GLOBAL) {
if (Debug) Printf(" processing global port: %s\n",
tp2->name);
strcpy(tmpname,instancename);
strcat(tmpname,SEPARATOR);
strcat(tmpname,tp2->name);
/* see if element already exists */
if (LookupObject(tp2->name,CurrentCell) != NULL)
join(tp2->name, tmpname);
else {
/* define global node if not already there */
Global(tp2->name);
join(tp2->name, tmpname);
}
}
else if (tp2->type == UNIQUEGLOBAL) {
if (Debug) Printf(" processing unique global port: %s\n",
tp2->name);
strcpy(tmpname,CurrentCell->name);
strcat(tmpname,INSTANCE_DELIMITER);
strcat(tmpname,instancename);
strcat(tmpname,SEPARATOR);
strcat(tmpname,tp2->name);
/* make this element UniqueGlobal */
UniqueGlobal(tmpname);
strcpy(tmpname2,instancename);
strcat(tmpname2,SEPARATOR);
strcat(tmpname2,tp2->name);
Connect(tmpname,tmpname2);
}
}
/* now run through list of new objects, checking for shorted ports */
for (tp2 = instanced_cell->cell; tp2 != NULL; tp2 = tp2->next) {
/* check to see if it is a unique port */
/* remember to NOT consider unconnected ports (node = -1)
as being shorted out */
if (IsPort(tp2)) {
struct objlist *ob;
ob = LookupObject(tp2->name, instanced_cell);
if (ob->node != -1 && !(*matchfunc)(tp2->name,
NodeAlias(instanced_cell, ob))) {
if (Debug) Printf("shorted ports found on Instance\n");
strcpy(tmpname,instancename);
strcat(tmpname,SEPARATOR);
strcat(tmpname,tp2->name);
strcpy(tmpname2,instancename);
strcat(tmpname2,SEPARATOR);
strcat(tmpname2, NodeAlias(instanced_cell, ob));
join(tmpname,tmpname2);
}
}
}
}
/*----------------------------------------------------------------------*/
char *Next(char *name)
{
int filenum = CurrentCell->file;
/* generate a unique instance name with 'name') */
char buffer[1024];
int n;
n = 0;
if (QuickSearch) {
struct nlist *tp;
tp = LookupCellFile(name, filenum);
if (tp != NULL)
n = tp->number; /* was +1, but would miss #2 */
}
do {
n++;
sprintf(buffer, "%s%d", name, n);
} while (LookupInstance(buffer,CurrentCell) != NULL);
return (strsave(buffer));
}
/*
*---------------------------------------------------------------------
* This procedure provides a versatile interface to Instance/Connect.
* Cell() accepts a variable length list of arguments, in either of
* two forms: (i) named arguments -- take the form "port=something"
* (ii) unnamed arguments, which are bound to ports in the order they
* appear. Arguments are read until all cell ports have been connected,
* or until a NULL is encountered.
*
* Returns the name of the instance, which remains valid at least
* until the next call to Cell().
*---------------------------------------------------------------------
*/
char *Cell(char *inststr, char *model, ...)
{
va_list ap;
char *nodelist;
char tmpname[512];
struct nlist *instanced_cell;
struct objlist *head, *tp, *tp2;
struct objlist *namedporthead, *namedportp, *namedlisthead, *namedlistp;
int portnum, portlist, done;
char namedport[512]; /* tmp buffers */
int filenum, itype, samenode;
static char *instancename = NULL;
char *instnameptr;
if (CurrentCell == NULL) {
Printf("No current cell defined for call to Cell().\n");
return NULL;
}
else
filenum = CurrentCell->file;
if (Debug) Printf(" calling cell: %s\n",model);
if ((itype = IsIgnored(model, filenum)) == IGNORE_CLASS) {
Printf("Class '%s' instanced in input but is being ignored.\n", model);
return NULL;
}
instanced_cell = LookupCellFile(model, filenum);
if (instanced_cell == NULL) {
Printf("Attempt to instance undefined class '%s'\n", model);
return NULL;
}
/* class exists */
tp2 = instanced_cell->cell;
portnum = 0;
while (tp2 != NULL) {
if (IsPort(tp2)) portnum++;
tp2 = tp2->next;
}
/* now generate lists of nodes using variable length parameter list */
va_start(ap, model);
head = NULL;
namedporthead = namedlisthead = NULL;
done = 0;
portlist = 0;
while (!done && portlist < portnum) {
struct objlist *tmp;
char *equals;
nodelist = va_arg(ap, char *);
if (nodelist == NULL) break; /* out of while loop */
if (strchr(nodelist,'=') != NULL) {
/* we have a named element */
struct objlist *tmpport, *tmpname;
struct nlist *oldCurCell;
int ports;
strcpy(namedport, nodelist);
equals = strchr(namedport, '=');
*equals = '\0';
equals++; /* point to first char of node */
/* need to get list out of cell: 'model' */
oldCurCell = CurrentCell;
CurrentCell = instanced_cell;
tmpport = List(namedport);
CurrentCell = oldCurCell;
tmpname = List(equals);
if ((ports = ListLen(tmpport)) != ListLen(tmpname)) {
Printf("List %s has %d elements, list %s has %d\n",
namedport, ListLen(tmpport), equals, ListLen(tmpname));
done = 1;
}
else if (tmpport == NULL) {
Printf("List %s has no elements\n", namedport);
done = 1;
}
else if (tmpname == NULL) {
Printf("List %s has no elements\n", equals);
done = 1;
}
else {
portlist += ports;
namedporthead = ListCat(namedporthead, tmpport);
namedlisthead = ListCat(namedlisthead, tmpname);
}
}
else {
/* unnamed element, so add it to the list */
tmp = List(nodelist);
if (tmp == NULL) {
Printf("No such pin '%s' in Cell(%s); Current cell = %s\n",
nodelist, model, CurrentCell->name);
done = 1;
}
else {
portlist += ListLen(tmp);
head = ListCat(head, tmp);
}
}
}
va_end(ap);
/* Check for shorted pins */
if ((itype == IGNORE_SHORTED) && (head != NULL)) {
unsigned char shorted = (unsigned char)1;
for (tp = head->next; tp; tp = tp->next) {
if (strcasecmp(head->name, tp->name))
shorted = (unsigned char)0;
break;
}
if (shorted == (unsigned char)1) {
Printf("Instance of '%s' is shorted, ignoring.\n", model);
FreeObject(head);
return NULL;
}
}
if (inststr == NULL) {
if (instancename != NULL)
FreeString(instancename);
QuickSearch = 1;
instancename = Next(model);
QuickSearch = 0;
instnameptr = instancename;
}
else
instnameptr = inststr;
Instance(model, instnameptr);
tp = head;
for (tp2 = instanced_cell->cell; tp2 != NULL; tp2 = tp2->next) {
if (IsPort(tp2)) {
strcpy(tmpname, instnameptr);
strcat(tmpname, SEPARATOR);
strcat(tmpname, tp2->name);
namedlistp = namedlisthead;
namedportp = namedporthead;
while (namedportp != NULL) {
if ((*matchfunc)(namedportp->name, tp2->name)) {
join(namedlistp->name, tmpname);
break; /* out of while loop */
}
namedlistp = namedlistp->next;
namedportp = namedportp->next;
}
if (namedportp == NULL) {
/* port was NOT a named port, so connect to unnamed list */
if (tp == NULL) {
Printf( "Not enough ports in Cell().\n");
break; /* out of for loop */
}
else {
join(tp->name, tmpname);
tp = tp->next;
}
}
}
}
return instnameptr;
}
/*----------------------------------------------------------------------*/
/* These default classes correspond to .sim file format types and other */
/* basic classes, and may be used by any netlist-reading routine to */
/* define basic types. The classes are only defined when called (in */
/* contrast to netgen v. 1.3 and earlier, where they were pre-defined) */
/*----------------------------------------------------------------------*/
char *P(char *fname, char *inststr, char *gate, char *drain, char *source)
{
int fnum = CurrentCell->file;
if (LookupCellFile("p", fnum) == NULL) {
CellDef("p", fnum);
Port("drain");
Port("gate");
Port("source");
PropertyDouble("p", fnum, "length", 0.01, 0.0);
PropertyDouble("p", fnum, "width", 0.01, 0.0);
SetClass(CLASS_PMOS);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "p", drain, gate, source);
}
/*----------------------------------------------------------------------*/
char *P4(char *fname, char *inststr, char *drain, char *gate, char *source, char *bulk)
{
int fnum = CurrentCell->file;
if (LookupCellFile("p4", fnum) == NULL) {
CellDef("p4", fnum);
Port("drain");
Port("gate");
Port("source");
Port("well");
PropertyDouble("p4", fnum, "length", 0.01, 0.0);
PropertyDouble("p4", fnum, "width", 0.01, 0.0);
SetClass(CLASS_PMOS4);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "p4", drain, gate, source, bulk);
}
/*----------------------------------------------------------------------*/
char *N(char *fname, char *inststr, char *gate, char *drain, char *source)
{
int fnum = CurrentCell->file;
if (LookupCellFile("n", fnum) == NULL) {
CellDef("n", fnum);
Port("drain");
Port("gate");
Port("source");
PropertyDouble("n", fnum, "length", 0.01, 0.0);
PropertyDouble("n", fnum, "width", 0.01, 0.0);
SetClass(CLASS_NMOS);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "n", drain, gate, source);
}
/*----------------------------------------------------------------------*/
char *N4(char *fname, char *inststr, char *drain, char *gate, char *source, char *bulk)
{
int fnum = CurrentCell->file;
if (LookupCellFile("n4", fnum) == NULL) {
CellDef("n4", fnum);
Port("drain");
Port("gate");
Port("source");
Port("bulk");
PropertyDouble("n4", fnum, "length", 0.01, 0.0);
PropertyDouble("n4", fnum, "width", 0.01, 0.0);
SetClass(CLASS_NMOS4);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "n4", drain, gate, source, bulk);
}
/*----------------------------------------------------------------------*/
char *E(char *fname, char *inststr, char *top, char *bottom_a, char *bottom_b)
{
int fnum = CurrentCell->file;
if (LookupCellFile("e", fnum) == NULL) {
CellDef("e", fnum);
Port("top");
Port("bottom_a");
Port("bottom_b");
PropertyDouble("e", fnum, "length", 0.01, 0.0);
PropertyDouble("e", fnum, "width", 0.01, 0.0);
SetClass(CLASS_ECAP);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "e", top, bottom_a, bottom_b);
}
/*----------------------------------------------------------------------*/
char *B(char *fname, char *inststr, char *collector, char *base, char *emitter)
{
int fnum = CurrentCell->file;
if (LookupCellFile("b", fnum) == NULL) {
CellDef("b", fnum);
Port("collector");
Port("base");
Port("emitter");
SetClass(CLASS_NPN);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "b", collector, base, emitter);
}
/*----------------------------------------------------------------------*/
char *Res(char *fname, char *inststr, char *end_a, char *end_b)
{
int fnum = CurrentCell->file;
if (LookupCellFile("r", fnum) == NULL) {
CellDef("r", fnum);
Port("end_a");
Port("end_b");
PropertyDouble("r", fnum, "value", 0.01, 0.0);
SetClass(CLASS_RES);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "r", end_a, end_b);
}
/*----------------------------------------------------------------------*/
char *Res3(char *fname, char *inststr, char *rdummy, char *end_a, char *end_b)
{
int fnum = CurrentCell->file;
if (LookupCellFile("r3", fnum) == NULL) {
CellDef("r3", fnum);
Port("dummy");
Port("end_a");
Port("end_b");
PropertyDouble("r3", fnum, "value", 0.01, 0.0);
SetClass(CLASS_RES3);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "r3", rdummy, end_a, end_b);
}
/*----------------------------------------------------------------------*/
char *XLine(char *fname, char *inststr, char *node1, char *node2,
char *node3, char *node4)
{
int fnum = CurrentCell->file;
if (LookupCellFile("t", fnum) == NULL) {
CellDef("t", fnum);
Port("node1");
Port("node2");
Port("node3");
Port("node4");
SetClass(CLASS_XLINE);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "t", node1, node2, node3, node4);
}
/*----------------------------------------------------------------------*/
char *Cap(char *fname, char *inststr, char *top, char *bottom)
{
int fnum = CurrentCell->file;
if (LookupCellFile("c", fnum) == NULL) {
CellDef("c", fnum);
Port("top");
Port("bottom");
PropertyDouble("c", fnum, "value", 0.01, 0.0);
SetClass(CLASS_CAP);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "c", top, bottom);
}
/*----------------------------------------------------------------------*/
char *Cap3(char *fname, char *inststr, char *top, char *bottom, char *cdummy)
{
int fnum = CurrentCell->file;
if (LookupCellFile("c3", fnum) == NULL) {
CellDef("c3", fnum);
Port("top");
Port("bottom");
Port("dummy");
PropertyDouble("c3", fnum, "value", 0.01, 0.0);
SetClass(CLASS_CAP3);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "c3", top, bottom, cdummy);
}
/*----------------------------------------------------------------------*/
char *Inductor(char *fname, char *inststr, char *end_a, char *end_b)
{
int fnum = CurrentCell->file;
if (LookupCellFile("l", fnum) == NULL) {
CellDef("l", fnum);
Port("end_a");
Port("end_b");
PropertyDouble("l", fnum, "value", 0.01, 0.0);
SetClass(CLASS_INDUCTOR);
EndCell();
if (fname) ReopenCellDef(fname, fnum); /* Reopen */
}
return Cell(inststr, "l", end_a, end_b);
}
/*----------------------------------------------------------------------*/
/* Determine if two property keys are matching strings */
/* Return 1 on match, 0 on failure to match */
/*----------------------------------------------------------------------*/
int PropertyKeyMatch(char *key1, char *key2)
{
/* For now, an unsophisticated direct string match */
if (!strcasecmp(key1, key2)) return 1;
return 0;
}
/*----------------------------------------------------------------------*/
/* Determine if two property values are matching. */
/* Return 1 on match, 0 on failure to match */
/*----------------------------------------------------------------------*/
int PropertyValueMatch(char *value1, char *value2)
{
/* For now, an unsophisticated direct string match */
if (!strcasecmp(value1, value2)) return 1;
return 0;
}
/*----------------------------------------------------------------------*/
/* Add a key:value property pair to the list of property pairs */
/*----------------------------------------------------------------------*/
void AddProperty(struct keyvalue **topptr, char *key, char *value)
{
struct keyvalue *kv;
if (Debug) Printf(" Defining key:value property pair: %s:%s\n", key, value);
if ((kv = NewKeyValue()) == NULL) {
perror("Failed NewKeyValue in Property");
return;
}
kv->key = strsave(key);
kv->value = strsave(value);
kv->next = *topptr;
*topptr = kv;
}
/*----------------------------------------------------------------------*/
/*----------------------------------------------------------------------*/
void AddScaledProperty(struct keyvalue **topptr, char *key, char *value, double scale)
{
struct keyvalue *kv;
if (Debug) Printf(" Defining key:value property pair: %s:%s\n", key, value);
if ((kv = NewKeyValue()) == NULL) {
perror("Failed NewKeyValue in Property");
return;
}
kv->key = strsave(key);
kv->value = strsave(value);
kv->next = *topptr;
*topptr = kv;
}
/*----------------------------------------------------------------------*/
/* Free up a property list */
/*----------------------------------------------------------------------*/
void DeleteProperties(struct keyvalue **topptr)
{
struct keyvalue *kv, *nextkv;
kv = *topptr;
while (kv != NULL)
{
nextkv = kv->next;
FreeString(kv->key);
FreeString(kv->value);
FREE(kv);
kv = nextkv;
}
*topptr = NULL;
}
/*----------------------------------------------------------------------*/
/* LinkProperties() --- */
/* */
/* Add a list of properties to the current cell (instance). */
/* This just keeps a record of key:value pairs; it does not attempt */
/* to relate them to the cell that is being instanced. Because this */
/* is used to link the same properties multiple times for parallel */
/* devices, copy the list (a refcount would work better. . .) */
/*----------------------------------------------------------------------*/
struct objlist *LinkProperties(char *model, struct keyvalue *topptr)
{
int filenum = -1;
struct nlist *cell;
struct objlist *tp;
struct keyvalue *kv;
struct valuelist *newkv;
int entries;
if (topptr == NULL) return NULL;
if (CurrentCell == NULL) {
Printf("LinkProperties() called with no current cell.\n");
return NULL;
}
else
filenum = CurrentCell->file;
if (IsIgnored(model, filenum) == IGNORE_CLASS) {
Printf("Class '%s' instanced in input but is being ignored.\n", model);
return NULL;
}
cell = LookupCellFile(model, filenum);
tp = GetObject();
tp->type = PROPERTY;
tp->name = strsave("properties");
tp->node = -2; /* Don't report as disconnected node */
tp->next = NULL;
tp->model.class = strsave(model);
/* Save a copy of the key:value pairs in tp->instance.props */
for (entries = 0, kv = topptr; kv != NULL; kv = kv->next, entries++);
tp->instance.props = NewPropValue(entries + 1);
for (entries = 0, kv = topptr; kv != NULL; kv = kv->next, entries++)
{
newkv = &(tp->instance.props[entries]);
newkv->key = strsave(kv->key);
/* No promotion to types other than string at this point */
newkv->type = PROP_STRING;
newkv->value.string = strsave(kv->value);
if (cell != NULL) {
struct property *kl = NULL;
/* If there is a matching cell, make sure that the property */
/* key exists. If not, create it and flag a warning. */
kl = (struct property *)HashLookup(newkv->key, &(cell->propdict));
if (kl == NULL) {
/* Ideally, for devices, one should check against all */
/* known standard properties. That's a pain, so */
/* instead just assume that the property is correct. */
if (cell->class == CLASS_SUBCKT)
Fprintf(stderr, "Warning: Property %s passed to cell %s which "
"does not define a default.\n",
newkv->key, cell->name);
kl = NewProperty();
kl->key = strsave(newkv->key);
kl->idx = 0;
kl->merge = MERGE_NONE;
kl->type = PROP_STRING;
kl->slop.dval = 0.0;
kl->pdefault.string = NULL;
HashPtrInstall(kl->key, kl, &(cell->propdict));
}
}
}
/* Final entry marks the end of the list */
newkv = &(tp->instance.props[entries]);
newkv->key = NULL;
newkv->type = PROP_ENDLIST;
newkv->value.ival = 0;
AddToCurrentCellNoHash(tp);
return tp;
}
/*----------------------------------------------------------------------*/
/* SetPropertyDefault() --- */
/* */
/* If a cell does not set property defaults, but an instance of that */
/* cell passes a property to it, then there will be a default value */
/* with a string type and a NULL value. Set the default to be equal */
/* to the instance type and value. */
/*----------------------------------------------------------------------*/
int SetPropertyDefault(struct property *prop, struct valuelist *vl)
{
if (prop == NULL || vl == NULL) return -1;
if (prop->type != PROP_STRING || prop->pdefault.string != NULL) return 1;
prop->type = vl->type;
switch (vl->type) {
case PROP_STRING:
prop->pdefault.string = strsave(vl->value.string);
break;
case PROP_INTEGER:
prop->pdefault.ival = vl->value.ival;
break;
case PROP_DOUBLE:
case PROP_VALUE:
prop->pdefault.dval = vl->value.dval;
break;
case PROP_EXPRESSION:
prop->pdefault.stack = CopyTokStack(vl->value.stack);
break;
}
return 1;
}
/*----------------------------------------------------------------------*/
/* PromoteProperty() --- */
/* */
/* Instances have all properties recorded as strings. If the cell */
/* record has an integer or double type, then attempt to convert the */
/* instance record into that type. */
/* */
/* Do not attempt to promote properties that cannot be promoted */
/* without altering the content. Fractional values cannot be converted */
/* to integers, and strings that are not numbers must be left as */
/* strings. Return 1 if the property was promoted successfully, and 0 */
/* if no promotion was possible, and -1 if passed a bad argument. */
/*----------------------------------------------------------------------*/
int PromoteProperty(struct property *prop, struct valuelist *vl)
{
char tstr[256];
int ival, result;
double dval;
if (prop == NULL || vl == NULL) return -1;
if (prop->type == vl->type) return 1; /* Nothing to do */
result = 0;
switch (prop->type) {
case PROP_STRING:
switch (vl->type) {
case PROP_INTEGER:
vl->type = PROP_STRING;
sprintf(tstr, "%d", vl->value.ival);
vl->value.string = strsave(tstr);
result = 1;
break;
case PROP_DOUBLE:
case PROP_VALUE:
vl->type = PROP_STRING;
sprintf(tstr, "%g", vl->value.dval);
vl->value.string = strsave(tstr);
result = 1;
break;
}
break;
case PROP_INTEGER:
switch (vl->type) {
case PROP_STRING:
if (StringIsValue(vl->value.string)) {
result = ConvertStringToFloat(vl->value.string, &dval);
if (result != 0) {
if ((double)((int)dval) == dval) {
vl->type = PROP_INTEGER;
FREE(vl->value.string);
vl->value.ival = (int)dval;
result = 1;
}
}
}
break;
case PROP_DOUBLE:
case PROP_VALUE:
vl->type = PROP_INTEGER;
dval = vl->value.dval;
if ((double)((int)dval) == dval) {
vl->value.ival = (int)dval;
result = 1;
}
break;
}
break;
case PROP_DOUBLE:
case PROP_VALUE:
switch (vl->type) {
case PROP_STRING:
if (StringIsValue(vl->value.string)) {
result = ConvertStringToFloat(vl->value.string, &dval);
if (result != 0) {
vl->type = PROP_DOUBLE;
FREE(vl->value.string);
vl->value.dval = dval;
result = 1;
}
}
break;
case PROP_INTEGER:
vl->type = PROP_DOUBLE;
vl->value.dval = (double)vl->value.ival;
result = 1;
break;
}
break;
}
return result;
}
/*----------------------------------------------------------------------*/
/* Structure used by resolveprops() */
/*----------------------------------------------------------------------*/
typedef struct _propdata {
struct nlist *cell;
int entries;
} PropData;
/*----------------------------------------------------------------------*/
/* resolveprops() --- */
/* */
/* Match instance property lists to the cell it's an instance of */
/*----------------------------------------------------------------------*/
struct nlist *resolveprops(struct hashlist *p, void *clientdata)
{
struct nlist *ptr, *pmod;
struct objlist *ob;
struct valuelist *vl, vtemp, *vlnew;
struct property *prop;
struct nlist *tc;
int entries, i, j;
PropData *pdp = (PropData *)clientdata;
tc = pdp->cell;
entries = pdp->entries;
ptr = (struct nlist *)(p->ptr);
if (ptr->file != tc->file) return NULL;
for (ob = ptr->cell; ob; ob = ob->next) {
if (ob->type == PROPERTY) {
if ((*matchfunc)(ob->model.class, tc->name)) {
/* Check length of the record, resize if necessary */
for (i = 0;; i++) {
vl = &(ob->instance.props[i]);
if (vl->type == PROP_ENDLIST) break;
}
if (i > entries) {
Printf("Warning: Instance defines more properties than cell.\n");
Printf("This shouldn't happen.\n");
}
/* Create new structure in the correct order, and replace */
/* the old property structure with it. */
vlnew = NewPropValue(entries + 1);
for (i = 0;; i++) {
vl = &(ob->instance.props[i]);
if (vl->type == PROP_ENDLIST) break;
prop = (struct property *)HashLookup(vl->key, &(tc->propdict));
/* Warning: prop should never be null, but condition */
/* should be handled. */
if (prop != NULL) {
j = prop->idx;
vlnew[j].key = vl->key;
vlnew[j].type = vl->type;
vlnew[j].value = vl->value;
}
}
vlnew[entries].key = NULL;
vlnew[entries].type = PROP_ENDLIST;
vlnew[entries].value.ival = 0;
FREE(ob->instance.props);
ob->instance.props = vlnew;
}
}
}
return ptr;
}
/*----------------------------------------------------------------------*/
/* ResolveProperties() --- */
/* */
/* This routine does the greatest part of the work for the property- */
/* handling mechanism. It determines which properties are common to */
/* two models, and arranges the lists of properties in both models */
/* such that the lists are in the same order. Properties that exist in */
/* one cell but not the other are floated to the end of the list. All */
/* instances of both models are checked and their property lists also */
/* arranged in order. */
/*----------------------------------------------------------------------*/
void ResolveProperties(char *name1, int file1, char *name2, int file2)
{
PropData pdp;
struct property *kl1, *kl2;
struct nlist *tp1, *tp2;
int i;
struct valuelist *kv, *newkv;
struct valuelist *vl, *lastvl;
int isnum, filenum;
if ((tp1 = LookupCellFile(name1, file1)) == NULL) return;
if ((tp2 = LookupCellFile(name2, file2)) == NULL) return;
/* Find all properties defined in the cell tp1, and index them in */
/* numerical order. For each property, find the equivalent */
/* property in the cell to be matched, and give them both the same */
/* index. If the property does not exist in the second cell, then */
/* create it. */
kl1 = (struct property *)HashFirst(&(tp1->propdict));
/* If indexes are not zero, then properties have already been matched. */
if (kl1 == NULL) return; /* Cell has no properties */
if (kl1->idx != 0) return;
i = 1;
while (kl1 != NULL) {
kl1->idx = i;
kl2 = (struct property *)HashLookup(kl1->key, &(tp2->propdict));
if (kl2 == NULL) {
/* No such property in tp2 */
switch (kl1->type) {
case PROP_STRING:
kl2 = PropertyString(tp2->name, tp2->file, kl1->key,
kl1->slop.dval, kl1->pdefault.string);
break;
case PROP_INTEGER:
kl2 = PropertyInteger(tp2->name, tp2->file, kl1->key,
kl1->slop.ival, kl1->pdefault.ival);
break;
case PROP_DOUBLE:
kl2 = PropertyDouble(tp2->name, tp2->file, kl1->key,
kl1->slop.dval, kl1->pdefault.dval);
break;
case PROP_VALUE:
kl2 = PropertyValue(tp2->name, tp2->file, kl1->key,
kl1->slop.dval, kl1->pdefault.dval);
break;
}
}
if (kl2 != NULL) kl2->idx = i;
kl1 = (struct property *)HashNext(&(tp1->propdict));
i++;
}
/* Now check tp2 for properties not in tp1 */
kl2 = (struct property *)HashFirst(&(tp2->propdict));
while (kl2 != NULL) {
kl1 = (struct property *)HashLookup(kl2->key, &(tp1->propdict));
if (kl1 == NULL) {
/* No such property in tp1 */
switch (kl2->type) {
case PROP_STRING:
kl1 = PropertyString(tp1->name, tp1->file, kl2->key,
kl2->slop.dval, kl2->pdefault.string);
break;
case PROP_INTEGER:
kl1 = PropertyInteger(tp1->name, tp1->file, kl2->key,
kl2->slop.ival, kl2->pdefault.ival);
break;
case PROP_DOUBLE:
kl1 = PropertyDouble(tp1->name, tp1->file, kl2->key,
kl2->slop.dval, kl2->pdefault.dval);
break;
case PROP_VALUE:
kl1 = PropertyValue(tp1->name, tp1->file, kl2->key,
kl2->slop.dval, kl2->pdefault.dval);
break;
}
}
if (kl1 != NULL) kl1->idx = i;
kl2 = (struct property *)HashNext(&(tp1->propdict));
i++;
}
/* Now that the properties of the two cells are ordered, find all */
/* instances of both cells, and order their properties to match. */
pdp.cell = tp1;
pdp.entries = i;
RecurseCellHashTable2(resolveprops, (void *)(&pdp));
pdp.cell = tp2;
RecurseCellHashTable2(resolveprops, (void *)(&pdp));
}
/*--------------------------------------------------------------*/
/* Copy properties from one object to another (used when */
/* flattening cells). */
/*--------------------------------------------------------------*/
void CopyProperties(struct objlist *obj_to, struct objlist *obj_from)
{
int i;
struct valuelist *kv, *kvcopy, *kvcur;
if (obj_from->instance.props != NULL) {
for (i = 0;; i++) {
kv = &(obj_from->instance.props[i]);
if (kv->type == PROP_ENDLIST)
break;
}
kvcopy = NewPropValue(i + 1);
for (i = 0;; i++) {
kv = &(obj_from->instance.props[i]);
kvcur = &(kvcopy[i]);
kvcur->type = kv->type;
if (kv->type == PROP_ENDLIST) break;
kvcur->key = strsave(kv->key);
switch (kvcur->type) {
case PROP_STRING:
kvcur->value.string = strsave(kv->value.string);
break;
case PROP_INTEGER:
kvcur->value.ival = kv->value.ival;
break;
case PROP_DOUBLE:
case PROP_VALUE:
kvcur->value.dval = kv->value.dval;
break;
case PROP_EXPRESSION:
kvcur->value.stack = CopyTokStack(kv->value.stack);
break;
}
}
kvcur->key = NULL;
kvcur->value.ival = 0;
obj_to->instance.props = kvcopy;
if (obj_from->model.class)
obj_to->model.class = strsave(obj_from->model.class);
}
}
/*--------------------------------------------------------------*/
/* Convert a string to an integer. */
/* At the moment, we do nothing with error conditions. */
/*--------------------------------------------------------------*/
int ConvertStringToInteger(char *string, int *ival)
{
long lval;
char *eptr = NULL;
lval = strtol(string, &eptr, 10);
if (eptr > string) {
*ival = (int)lval;
return 1;
}
else return 0; /* No conversion */
}
/*--------------------------------------------------------------*/
/* Check if a string is a valid number (with optional metric */
/* unit suffix). */
/* Returns 1 if the string is a proper value, 0 if not. */
/*--------------------------------------------------------------*/
int StringIsValue(char *string)
{
double fval;
char *eptr = NULL;
fval = strtod(string, &eptr);
if (eptr > string)
{
while (isspace(*eptr)) eptr++;
switch (tolower(*eptr)) {
case 'g': /* giga */
case 'k': /* kilo */
case 'c': /* centi */
case 'm': /* milli */
case 'u': /* micro */
case 'n': /* nano */
case 'p': /* pico */
case 'f': /* femto */
case 'a': /* atto */
case '\0': /* no units */
return 1;
}
}
return 0;
}
/*--------------------------------------------------------------*/
/* Convert a string with possible metric notation into a float. */
/* This follows SPICE notation with case-insensitive prefixes, */
/* using "meg" to distinguish 1x10^6 from "m" 1x10^-3 */
/* */
/* Put the result in "dval". Return 1 if successful, 0 if */
/* unsuccessful. */
/*--------------------------------------------------------------*/
int ConvertStringToFloat(char *string, double *dval)
{
long double fval;
char *eptr = NULL;
fval = strtold(string, &eptr);
if (eptr > string)
{
while (isspace(*eptr)) eptr++;
switch (tolower(*eptr)) {
case 'g': /* giga */
fval *= 1.0e9L;
eptr++;
break;
case 'k': /* kilo */
fval *= 1.0e3L;
eptr++;
break;
case 'c': /* centi */
fval *= 1.0e-2L;
eptr++;
break;
case 'm': /* milli */
if (tolower(*(eptr + 1)) == 'e' &&
tolower(*(eptr + 2)) == 'g') {
fval *= 1.0e6L;
eptr += 2;
}
else
fval *= 1.0e-3L;
eptr++;
break;
case 'u': /* micro */
fval *= 1.0e-6L;
eptr++;
break;
case 'n': /* nano */
fval *= 1.0e-9L;
eptr++;
break;
case 'p': /* pico */
fval *= 1.0e-12L;
eptr++;
break;
case 'f': /* femto */
fval *= 1.0e-15L;
eptr++;
break;
case 'a': /* atto */
fval *= 1.0e-18L;
eptr++;
break;
default:
break; /* No units, no adjustment */
}
if (*eptr != '\0') {
switch (tolower(*eptr)) {
case 'f': /* Farads */
if (!strncasecmp(eptr, "farad", 5)) {
eptr += 5;
if (tolower(*eptr) == 's') eptr++;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
case 'm': /* Meters */
if (!strncasecmp(eptr, "meter", 5)) {
eptr += 5;
if (tolower(*eptr) == 's') eptr++;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
case 'h': /* Henrys */
if (!strncasecmp(eptr, "henr", 4)) {
eptr += 4;
if (tolower(*eptr) == 'y') {
eptr++;
if (*eptr == 's') eptr++;
}
else if (!strncasecmp(eptr, "ies", 3))
eptr += 3;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
case 's': /* Seconds */
if (!strncasecmp(eptr, "second", 6)) {
eptr += 6;
if (tolower(*eptr) == 's') eptr++;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
case 'o': /* Ohms */
if (!strncasecmp(eptr, "ohm", 3)) {
eptr += 3;
if (tolower(*eptr) == 's') eptr++;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
case 'v': /* Volts */
if (!strncasecmp(eptr, "volt", 4)) {
eptr += 4;
if (tolower(*eptr) == 's') eptr++;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
case 'a': /* Amps */
if (!strncasecmp(eptr, "amp", 3)) {
eptr += 3;
if (tolower(*eptr) == 's') eptr++;
}
else eptr++;
if (*eptr != '\0') return 0; /* Unknown units */
break;
default:
return 0; /* Unknown units; no conversion */
}
}
}
else if (eptr == string) return 0; /* No conversion */
*dval = (double)fval;
return 1;
}
/*--------------------------------------------------------------*/
/* Convert a string into a double, scale it, and pass it back */
/* as another string value. */
/*--------------------------------------------------------------*/
char *ScaleStringFloatValue(char *vstr, double scale)
{
static char newstr[32];
double fval, afval;
int result;
result = ConvertStringToFloat(vstr, &fval);
if (result == 1) {
fval *= scale;
snprintf(newstr, 31, "%g", fval);
return newstr;
}
else
return vstr;
}
/*----------------------------------------------------------------------*/
/* Workhorse subroutine for the Connect() function */
/*----------------------------------------------------------------------*/
void join(char *node1, char *node2)
{
struct objlist *tp1, *tp2, *tp3;
int nodenum, oldnode;
if (CurrentCell == NULL) {
Printf( "No current cell for join(%s,%s)\n",
node1,node2);
return;
}
tp1 = LookupObject(node1, CurrentCell);
if (tp1 == NULL) {
Printf("No node '%s' found in current cell '%s'\n",
node1, CurrentCell->name);
return;
}
tp2 = LookupObject(node2, CurrentCell);
if (tp2 == NULL) {
Printf("No node '%s' found in current cell '%s'\n",
node2, CurrentCell->name);
return;
}
if (Debug) Printf(" joining: %s == %s (",
tp1->name,tp2->name);
/* see if either node has an assigned node number */
if ((tp1->node == -1) && (tp2->node == -1)) {
tp1->node = NextNode;
tp2->node = NextNode++;
if (Debug) Printf("New ");
}
else if (tp1->node == -1) tp1->node = tp2->node;
else if (tp2->node == -1) tp2->node = tp1->node;
else {
if (tp1->node < tp2->node) {
nodenum = tp1->node;
oldnode = tp2->node;
} else {
nodenum = tp2->node;
oldnode = tp1->node;
}
/* now search through entire list, updating nodes as needed */
for (tp3 = CurrentCell->cell; tp3 != NULL; tp3 = tp3->next)
if (tp3->node == oldnode) tp3->node = nodenum;
}
if (Debug) Printf("Node = %d)\n",tp1->node);
}
/*----------------------------------------------------------------------*/
/*----------------------------------------------------------------------*/
void Connect(char *tplt1, char *tplt2)
{
struct objlist *list1, *list2;
int n1, n2; /* lengths of two lists */
if (Debug) Printf(" Connect(%s,%s)\n",tplt1,tplt2);
if (CurrentCell == NULL) {
Printf( "No current cell for Connect(%s,%s)\n",
tplt1,tplt2);
return;
}
list1 = List(tplt1);
n1 = ListLen(list1);
list2 = List(tplt2);
n2 = ListLen(list2);
if (n1==n2) {
while (list1 != NULL) {
join(list1->name,list2->name);
list1 = list1->next;
list2 = list2->next;
}
}
else if (n1==1 && n2>0) {
while (list2 != NULL) {
join(list1->name,list2->name);
list2 = list2->next;
}
}
else if (n2==1 && n1>0) {
while (list1 != NULL) {
join(list1->name,list2->name);
list1 = list1->next;
}
}
else Printf("Unequal element lists: '%s' has %d, '%s' has %d.\n",
tplt1,n1,tplt2,n2);
}
/*----------------------------------------------------------------------*/
/*----------------------------------------------------------------------*/
void PortList(char *prefix, char *list_template)
{
struct objlist *list;
char buffer[1024];
int buflen;
int i;
for (list = List(list_template); list != NULL; list = list->next) {
strcpy(buffer,prefix);
strcat(buffer,list->name);
buflen = strlen(buffer);
for (i=0; i < buflen; i++)
if (buffer[i] == SEPARATOR[0]) buffer[i] = PORT_DELIMITER[0];
Port(buffer);
join(buffer,list->name);
}
}
/*----------------------------------------------------------------------*/
/*----------------------------------------------------------------------*/
void Place(char *name)
{
char *freename;
char buffer1[1024], buffer2[1024];
char prefix[20];
QuickSearch = (LastPlaced != NULL);
freename = Next(name);
Instance(name,freename);
if (Composition == HORIZONTAL) {
sprintf(buffer2,"%s%s%s%s%s", freename, SEPARATOR, "W", PORT_DELIMITER, "*");
if (LastPlaced != NULL) {
sprintf(buffer1,"%s%s%s%s%s",
LastPlaced->instance.name, SEPARATOR, "E", PORT_DELIMITER, "*");
Connect (buffer1,buffer2);
}
else { /* promote left-hand ports */
sprintf(prefix,"%s%s","W", PORT_DELIMITER);
PortList(prefix,buffer2);
}
buffer2[strlen(buffer2)-3] = 'N';
sprintf(prefix,"%s%s", "N", PORT_DELIMITER);
PortList(prefix,buffer2);
buffer2[strlen(buffer2)-3] = 'S';
sprintf(prefix,"%s%s", "S", PORT_DELIMITER);
PortList(prefix,buffer2);
}
else if (Composition == VERTICAL) {
sprintf(buffer2,"%s%s%s%s%s",
freename, SEPARATOR, "S", PORT_DELIMITER, "*");
if (LastPlaced != NULL) {
sprintf(buffer1,"%s%s%s%s%s",
LastPlaced->instance.name, SEPARATOR, "N", PORT_DELIMITER, "*");
Connect (buffer1,buffer2);
}
else { /* promote bottom ports */
sprintf(prefix,"%s%s","S", PORT_DELIMITER);
PortList(prefix,buffer2);
}
buffer2[strlen(buffer2)-3] = 'E';
sprintf(prefix,"%s%s", "E", PORT_DELIMITER);
PortList(prefix,buffer2);
buffer2[strlen(buffer2)-3] = 'W';
sprintf(prefix,"%s%s", "W", PORT_DELIMITER);
PortList(prefix,buffer2);
}
LastPlaced = LookupInstance(freename,CurrentCell);
QuickSearch = 0;
FreeString(freename);
}
/*----------------------------------------------------------------------*/
/*----------------------------------------------------------------------*/
void Array(char *Cell, int num)
{
int i;
for (i=0; i<num; i++) {
if (Debug) Printf(".");
Place(Cell);
}
}
/* if TRUE, always connect all nodes upon EndCell() */
int NoDisconnectedNodes = 0;
/*----------------------------------------------------------------------*/
/* Within the definition of 'model', traverse the object list */
/* and connect all the otherwise disconnected nodes (i.e., those */
/* with node==-1) to unique node numbers */
/*----------------------------------------------------------------------*/
void ConnectAllNodes(char *model, int file)
{
int nodenum;
struct nlist *tp;
struct objlist *ob;
if ((tp = LookupCellFile(model, file)) == NULL) {
Printf("Cell: %s does not exist.\n", model);
return;
}
nodenum = 0;
for (ob = tp->cell; ob != NULL; ob = ob->next)
if (ob->node >= nodenum) nodenum = ob->node + 1;
for (ob = tp->cell; ob != NULL; ob = ob->next)
if (ob->node == -1) ob->node = nodenum++;
}
/*----------------------------------------------------------------------*/
/* Series and Parallel combination: */
/* All devices of the same type that exist in series and parallel */
/* combinations will be treated as a single device in a network. */
/* Series connections are only allowed for resistors and inductors. */
/* Any device may be connected in parallel. For combinations of series */
/* and parallel, as in a resistor network, there is a set of rules: */
/* */
/* Running parallel and series checks: */
/* 1. Run parallel once. If a repeat run and no devices are merged, */
/* then go to 4. */
/* 2. Run series until no devices are merged. */
/* 3. If series ran more than once, then go to 1. */
/* 4. End merge */
/* */
/* Each merge procedure, when it finds two devices that can be merged, */
/* removes the second device from the netlist and adds its properties */
/* to the first device. If a series merge, then the nodes are adjusted */
/* appropriately. Where A is the property list of the first device and */
/* B is the property list of the second device, the first and last */
/* properties of A and the first property of B may require a marker to */
/* indicate the topology of the network, as follows (in order): */
/* */
/* For a parallel merge: */
/* 1) If A has series components then tag first property of A with */
/* "open" and tag first property of B with "close". */
/* 2) If B has series components then tag first property of B with */
/* "open". */
/* */
/* For a series merge: */
/* 1) If A has unbalanced "opens", then add "close" to first */
/* property of B to balance the "opens". */
/* 2) Always tag B with "series". */
/* */
/* Tags are indicated by a property named "_tag" which has a string */
/* value of ordered characters, "+" for series, "(" for open, and ")" */
/* for close. A device with only one property record has no "_tag" */
/* record. A device which is in parallel with the device(s) in front */
/* of it is implicitly parallel by not having an "+" tag, and may not */
/* have a tag at all. */
/* */
/* The property check routine is responsible for comparing device */
/* series/parallel networks against each other. Otherwise, each */
/* series/parallel network is considered topologically as a single */
/* device, and any differences in the series/parallel networks between */
/* two circuits being matched will be treated as a property error. */
/*----------------------------------------------------------------------*/
/* add_prop_tag --- add the tag character tagc to the property list of */
/* obr. obr points to the first property record. */
int add_prop_tag(struct objlist *obr, char tagc)
{
struct objlist *nob;
int i, k, l;
struct valuelist *kv, *kv2;
int hastag;
char *tmpstr;
hastag = FALSE;
for (nob = obr; nob; nob = nob->next) {
if (nob->type != PROPERTY) break;
for (i = 0; ; i++) {
kv = &(nob->instance.props[i]);
if (kv->type == PROP_ENDLIST) break;
if (kv->type == PROP_STRING) {
if (!strcmp(kv->key, "_tag")) {
hastag = TRUE;
break;
}
}
}
}
if (hastag) {
if (nob == obr) {
// If _tag was first in the list, then just prepend tagc to the tag value
tmpstr = kv->value.string;
kv->value.string = (char *)MALLOC(strlen(tmpstr) + 2);
sprintf(kv->value.string, "%c%s", tagc, tmpstr);
FREE(tmpstr);
}
else {
// Add a _tag key to the first property list and set value to tagc
kv = &(obr->instance.props[i]);
k = 0;
for (k = 0; ; k++) {
kv = &(obr->instance.props[k]);
if (kv->type == PROP_ENDLIST)
break;
}
kv2 = (struct valuelist *)MALLOC((k + 2) * sizeof(struct valuelist));
kv2->key = strsave("_tag");
kv2->type = PROP_STRING;
/* Value is set to tagc */
kv2->value.string = (char *)MALLOC(2);
sprintf(kv2->value.string, "%c", tagc);
for (l = 0; l <= k; l++)
kv2[l + 1] = obr->instance.props[l];
FREE(obr->instance.props);
obr->instance.props = kv2;
}
}
return hastag;
}
/* add_balancing_close --- find the number of unbalanced 'open' */
/* records in ob1's property list, and prepend the correct number of */
/* 'C' closures to the property list of ob2. */
void add_balancing_close(struct objlist *ob1, struct objlist *ob2)
{
struct objlist *nob;
int i, k, l;
struct valuelist *kv, *kv2;
int opentags;
char *tmpstr, *tag;
/* Find the first property record in ob1. */
for (nob = ob1->next; nob && nob->type != FIRSTPIN; nob = nob->next)
if (nob->type == PROPERTY)
break;
if (nob->type != PROPERTY) return; // shouldn't happen
opentags = 0;
for (; nob->next && nob->next->type == PROPERTY; nob = nob->next) {
for (i = 0; ; i++) {
kv = &(nob->instance.props[i]);
if (kv->type == PROP_ENDLIST) break;
if (kv->type == PROP_STRING) {
if (!strcmp(kv->key, "_tag")) {
for (tag = kv->value.string; *tag != '\0'; tag++) {
if (*tag == '(') opentags++;
else if (*tag == ')') opentags--;
}
break;
}
}
}
}
if (opentags == 0) return;
/* Find the first property record in ob2. */
for (nob = ob2->next; nob && nob->type != FIRSTPIN; nob = nob->next)
if (nob->type == PROPERTY)
break;
if (nob->type != PROPERTY) return; // shouldn't happen
// This is slow but it's the easiest way to do it
while (opentags-- > 0) add_prop_tag(nob, ')');
}
/* Remove unneeded group tags, when device merging has removed all but */
/* one, or all but parallel devices inside a group. For simplicity, */
/* handle only one group at a time. Return 1 if a group was removed */
/* and 0 if not. The caller should run repeatedly until the routine */
/* returns 0. */
int remove_group_tags(struct objlist *ob)
{
struct objlist *nob, *sob;
int i, si, stags;
struct valuelist *kv;
char *tag;
/* Find the first property record in ob. */
for (nob = ob->next; nob && nob->type != FIRSTPIN; nob = nob->next)
if (nob->type == PROPERTY)
break;
if (nob->type != PROPERTY) return 0; // shouldn't happen
for (sob = NULL; nob && nob->type == PROPERTY; nob = nob->next) {
for (i = 0; ; i++) {
kv = &(nob->instance.props[i]);
if (kv->type == PROP_ENDLIST) break;
if (kv->type == PROP_STRING) {
if (!strcmp(kv->key, "_tag")) {
for (tag = kv->value.string; *tag != '\0'; tag++) {
if (*tag == '(') {
sob = nob; /* Save position of open group */
si = i; /* Save index of open group */
stags = 0; /* Check for series tags */
}
else if (*tag == '+')
stags++;
else if (*tag == ')') {
if (stags == 0) {
/* Remove close tag */
for (++i; ; i++) {
nob->instance.props[i - 1] = nob->instance.props[i];
if (nob->instance.props[i].type == PROP_ENDLIST) break;
}
/* Remove open tag */
for (i = si + 1; ; i++) {
sob->instance.props[i - 1] = sob->instance.props[i];
if (sob->instance.props[i].type == PROP_ENDLIST) break;
}
return 1;
}
sob = NULL;
stags = 0;
}
}
}
}
}
}
if (sob != NULL) {
/* Implicit close tag at end */
if (stags == 0) {
/* Remove open tag */
for (i = si + 1; ; i++) {
sob->instance.props[i - 1] = sob->instance.props[i];
if (sob->instance.props[i].type == PROP_ENDLIST) break;
}
return 1;
}
}
return 0;
}
/*----------------------------------------------------------------------*/
/* Find all devices that are of the same class and check for parallel */
/* combinations, and combine them where found, adjusting property "M" */
/* as needed. */
/* */
/* Procedure: Hash each cell by the model name and a space-separated */
/* list of node numbers connected to each pin, and the value of the */
/* property that affects number of devices (if any). The hash stores */
/* the instance record and property record (if any) of the first cell. */
/* If there is a hash match, then the cell instance gets deleted and */
/* the property M of the instance pointed to in the hash gets */
/* incremented. If it has no property M, one is created and the value */
/* set to 2. */
/* */
/* If the device has permutable pins, then duplicate hashes are made */
/* for each permutation. */
/* */
/* Return the number of devices merged. */
/*----------------------------------------------------------------------*/
int CombineParallel(char *model, int file)
{
struct nlist *tp, *tsub;
struct objlist *ob, *ob2, *nextob;
struct objlist *sob, *lob, *nob, *pob, *obr;
struct objlist *propfirst, *proplast, *spropfirst, *sproplast;
struct hashdict devdict;
struct Permutation *perm;
size_t pcnt;
int i, dcnt = 0, hastag;
char *pstr, *p2str, *pptr;
struct valuelist *kv;
if ((tp = LookupCellFile(model, file)) == NULL) {
Printf("Cell: %s does not exist.\n", model);
return -1;
}
InitializeHashTable(&devdict, OBJHASHSIZE);
lob = NULL;
for (ob = tp->cell; ob; ) {
if (ob->type == FIRSTPIN) {
/* Watch for devices prohibited from parallel combination. */
/* All devices allow parallel combination by default. */
tsub = LookupCellFile(ob->model.class, file);
if ((tsub != NULL) && (tsub->flags & COMB_NO_PARALLEL)) {
lob = ob;
ob = ob->next;
continue;
}
/* ------------------------------------*/
/* Generate hash key from pins */
/* Handle pin permuations */
/* ------------------------------------*/
if ((tsub != NULL) && (tsub->permutes != NULL))
perm = tsub->permutes;
else
perm = NULL; /* Device has no pin permutations */
pcnt = strlen(ob->model.class) + 2;
pptr = (char *)pcnt;
propfirst = proplast = NULL;
for (ob2 = ob; ob2 && (ob2->type > FIRSTPIN || ob2 == ob); ob2 = ob2->next) {
pob = ob2;
pcnt += 10;
}
if (ob2 && (ob2->type == PROPERTY)) propfirst = ob2;
/* Find last record in device and first record in next object */
while (ob2 && ob2->type == PROPERTY) {
proplast = ob2;
ob2 = ob2->next;
}
nextob = ob2;
pstr = (char *)MALLOC(pcnt);
sprintf(pstr, "%s", ob->model.class);
pptr += pstr - (char *)2;
for (ob2 = ob; ob2 && (ob2->type > FIRSTPIN || ob2 == ob); ob2 = ob2->next) {
sprintf(pptr, "_%d", ob2->node);
pptr += strlen(pptr);
}
/* Now check the hash table for any similar instance */
sob = (struct objlist *)HashLookup(pstr, &devdict);
if (sob == NULL) {
/* Generate hash entry */
HashPtrInstall(pstr, ob, &devdict);
/* If pins are permutable, generate alternative hash entries */
if (perm != NULL) {
char *pname;
struct objlist *pob1, *pob2;
/* NOTE: This is only set up for a single permutation */
/* per cell and needs to be expanded to the general */
/* case, which requires one nested loop per permute */
/* pair */
p2str = (char *)MALLOC(pcnt);
sprintf(p2str, "%s", ob->model.class);
pptr = p2str + strlen(ob->model.class);
for (ob2 = ob; ob2 && (ob2->type > FIRSTPIN || ob2 == ob);
ob2 = ob2->next) {
pname = ob2->name + strlen(ob2->instance.name) + 1;
if ((*matchfunc)(perm->pin1, pname))
pob1 = ob2;
else if ((*matchfunc)(perm->pin2, pname))
pob2 = ob2;
}
for (ob2 = ob; ob2 && (ob2->type > FIRSTPIN || ob2 == ob);
ob2 = ob2->next) {
if (ob2 == pob1)
sprintf(pptr, "_%d", pob2->node);
else if (ob2 == pob2)
sprintf(pptr, "_%d", pob1->node);
else
sprintf(pptr, "_%d", ob2->node);
pptr += strlen(pptr);
}
HashPtrInstall(p2str, ob, &devdict);
FREE((char *)p2str);
}
/* Move last object marker to end of sob record */
if (proplast != NULL)
lob = proplast;
else
lob = pob;
}
else {
/* Find parallel device "ob" and append properties of */
/* "sob" to it. If "ob" does not have properties, then */
/* create a property record and set property "M" to 2. */
/* Find last non-property record of sob ( = pob) */
/* Find first property record of sob ( = spropfirst) */
/* Find last property record of sob ( = sproplast) */
spropfirst = sproplast = NULL;
for (ob2 = sob; ob2->type > FIRSTPIN || ob2 == sob; ob2 = ob2->next)
pob = ob2;
if (ob2->type == PROPERTY) spropfirst = ob2;
for (; ob2->type == PROPERTY; ob2 = ob2->next)
sproplast = ob2;
if (spropfirst == NULL) {
/* Create new property instance record if one doesn't exist */
nob = GetObject();
nob->type = PROPERTY;
nob->name = strsave("properties");
nob->node = -2; /* Don't report as disconnected node */
nob->model.class = strsave(sob->model.class);
nob->instance.props = NewPropValue(2);
/* Create property record for property "M" and set to 1 */
kv = &(nob->instance.props[0]);
kv->key = strsave("M");
kv->type = PROP_INTEGER;
kv->value.ival = 1;
/* End of property list */
kv = &(nob->instance.props[1]);
kv->key = NULL;
kv->type = PROP_ENDLIST;
kv->value.ival = 0;
nob->next = pob->next;
pob->next = nob;
if (lob == pob) lob = nob;
spropfirst = sproplast = nob;
}
if (propfirst == NULL) {
/* Create new property instance record if one doesn't exist */
nob = GetObject();
nob->type = PROPERTY;
nob->name = strsave("properties");
nob->node = -2; /* Don't report as disconnected node */
nob->model.class = strsave(ob->model.class);
nob->instance.props = NewPropValue(2);
/* Create property record for property "M" and set to 1 */
kv = &(nob->instance.props[0]);
kv->key = strsave("M");
kv->type = PROP_INTEGER;
kv->value.ival = 1;
/* End of property list */
kv = &(nob->instance.props[1]);
kv->key = NULL;
kv->type = PROP_ENDLIST;
kv->value.ival = 0;
/* Append to sob's property list */
nob->next = sproplast->next;
sproplast->next = nob;
if (lob == sproplast) lob = nob;
}
if (propfirst != NULL) {
// Series/Parallel logic:
// If propfirst has _tag in properties,
// then add an "open" tag at propfirst
add_prop_tag(propfirst, '(');
// if spropfirst has _tag in properties then add an "open" tag
// to spropfirst and a "close" tag to propfirst
if (add_prop_tag(spropfirst, '(')) add_prop_tag(propfirst, ')');
/* Append ob's property list to sob */
proplast->next = sproplast->next;
sproplast->next = propfirst;
if (lob == sproplast) lob = proplast;
}
/* Link up around object to be removed */
lob->next = nextob;
/* Remove the object */
for (obr = ob; obr != propfirst && obr != nextob; ) {
nob = obr->next;
FreeObjectAndHash(obr, tp);
obr = nob;
}
dcnt++;
}
FREE((char *)pstr);
}
else {
lob = ob;
nextob = ob->next;
}
ob = nextob;
}
HashKill(&devdict);
if (dcnt > 0) {
Fprintf(stdout, "Class %s: Merged %d devices.\n", model, dcnt);
}
return dcnt;
}
/*----------------------------------------------------------------------*/
/* For the purposes of series connection checking, find if all pins */
/* of two instances after the first two pins are connected to the name */
/* nodes. This depends on the definition of a series device as having */
/* two ports, but any additional ports (such as a substrate connection) */
/* must be the same for all devices in series. */
/*----------------------------------------------------------------------*/
int check_pin_nodes(struct objlist *ob1, struct objlist *ob2)
{
struct objlist *nob, *pob;
/* A dummy device may have both terminals connected to the same */
/* point, triggering a false check for a series device. */
if (ob1 == ob2) return FALSE;
for (nob = ob1->next; nob && nob->type != FIRSTPIN; nob = nob->next)
if (nob->type == 3) break;
for (pob = ob2->next; pob && pob->type != FIRSTPIN; pob = pob->next)
if (pob->type == 3) break;
while (nob && pob && nob->type > FIRSTPIN && pob->type > FIRSTPIN) {
if (nob->node != pob->node)
return FALSE;
nob = nob->next;
pob = pob->next;
}
if (nob && pob && (nob->type > FIRSTPIN || pob->type > FIRSTPIN))
return FALSE;
return TRUE;
}
/*----------------------------------------------------------------------*/
/* Find all nodes that are connected to exactly two devices of the same */
/* class. Where found, if the device is allowed to combine serially */
/* (check properties), then remove the node and merge the devices into */
/* one. */
/* */
/* This routine depends on CombineParallel() being run first so that no */
/* parallel devices are reported as series. */
/* */
/* Return the number of devices merged. */
/*----------------------------------------------------------------------*/
int CombineSeries(char *model, int file)
{
struct nlist *tp, *tp2;
struct objlist ***instlist;
struct objlist *ob, *ob2, *obs, *obp, *obn;
int i, j, scnt = 0;
struct valuelist *kv;
if ((tp = LookupCellFile(model, file)) == NULL) {
Printf("Cell: %s does not exist.\n", model);
return -1;
}
/* Diagnostic */
/* Printf("CombineSeries start model = %s file = %d\n", model, file); */
instlist = (struct objlist ***)CALLOC((tp->nodename_cache_maxnodenum + 1),
sizeof(struct objlist **));
for (ob = tp->cell; ob; ob = ob->next) {
if ((ob->type >= FIRSTPIN) && (ob->node >= 0)) {
if (ob->type == FIRSTPIN)
obp = ob; // Save pointer to first pin of device
if (instlist[ob->node] == NULL) {
/* Node has not been seen before, so add it to list */
instlist[ob->node] = (struct objlist **)CALLOC(2,
sizeof(struct objlist *));
/* Device must be marked as able to be combined in series. */
/* Note that devices with more than two pins are expected */
/* to series connect along the first two pins, and the */
/* remaining pins must all connect to the same nodes. By */
/* default, CLASS_RES, CLASS_RES3, and CLASS_INDUCTOR are */
/* all allowed to combine in series. All other devices */
/* must have series combination explicitly enabled. */
/* NOTE: Arbitrarily, the first two pins of a device are */
/* assumed to be the ones that make series connections. */
/* Additional pins, if any, do not. */
tp2 = LookupCellFile(ob->model.class, file);
if ((tp2->flags & COMB_SERIES) && (ob->type <= 2)) {
instlist[ob->node][0] = obp;
/* Node may not be a port of the subcircuit */
for (obn = tp->cell; obn && obn->type == PORT; obn = obn->next) {
if (obn->node == ob->node) {
/* invalidate node */
instlist[ob->node][0] = NULL;
break;
}
}
}
else
/* invalidate node */
instlist[ob->node][0] = NULL;
}
else if (instlist[ob->node][0] == NULL) {
/* Node is not valid for series connection */
}
else if (instlist[ob->node][1] == NULL) {
/* Check if first instance is the same type */
if ((*matchfunc)(instlist[ob->node][0]->model.class, ob->model.class)) {
if (check_pin_nodes(instlist[ob->node][0], obp))
instlist[ob->node][1] = obp;
else
/* invalidate node */
instlist[ob->node][0] = NULL;
}
else
/* invalidate node */
instlist[ob->node][0] = NULL;
}
else {
/* More than two devices connect here, so invalidate */
instlist[ob->node][0] = NULL;
}
}
}
for (i = 0; i <= tp->nodename_cache_maxnodenum; i++) {
if (instlist[i] != NULL) {
if ((instlist[i][0] != NULL) && (instlist[i][1] != NULL)) {
int k, l;
struct valuelist *kv2;
/* Diagnostic */
/* Fprintf(stdout, "Found series instances %s and %s\n",
instlist[i][0]->instance.name,
instlist[i][1]->instance.name); */
scnt++;
/* To maintain knowledge of the topology, 2nd device gets */
/* a parameter '_tag', string value set to "+". */
for (obn = instlist[i][1]; obn->next &&
obn->next->type > FIRSTPIN; obn = obn->next);
obp = obn->next;
if (obp == NULL || obp->type != PROPERTY) {
struct objlist *nob;
/* No property record, so insert one */
nob = GetObject();
nob->type = PROPERTY;
nob->name = strsave("properties");
nob->node = -2; /* Don't report as disconnected node */
nob->model.class = (obp->model.class == NULL) ? NULL :
strsave(obp->model.class);
nob->instance.props = NewPropValue(2);
/* Create property record for property "_tag" */
kv = &(nob->instance.props[0]);
kv->key = strsave("_tag");
kv->type = PROP_STRING;
/* Value is set to "+" */
kv->value.string = (char *)MALLOC(2);
sprintf(kv->value.string, "+");
/* End of property list */
kv = &(nob->instance.props[1]);
kv->key = NULL;
kv->type = PROP_ENDLIST;
kv->value.ival = 0;
nob->next = obp;
obn->next = nob;
}
else if (obp->type == PROPERTY) {
/* Add to properties */
k = 0;
for (k = 0; ; k++) {
kv = &(obp->instance.props[k]);
if (kv->type == PROP_ENDLIST) {
kv2 = (struct valuelist *)MALLOC((k + 2) *
sizeof(struct valuelist));
kv2->key = strsave("_tag");
kv2->type = PROP_STRING;
/* Value is set to "+" */
kv2->value.string = (char *)MALLOC(2);
sprintf(kv2->value.string, "+");
for (l = 0; l <= k; l++)
kv2[l + 1] = obp->instance.props[l];
FREE(obp->instance.props);
obp->instance.props = kv2;
break;
}
else if (!strcmp(kv->key, "_tag")) {
int l = strlen(kv->value.string);
char *newstr = (char *)MALLOC(l + 2);
sprintf(newstr, "S%s", kv->value.string);
FREE(kv->value.string);
kv->value.string = newstr;
break;
}
}
}
/* Combine these two instances and remove node i */
for (ob2 = instlist[i][0]; ob2; ob2 = ob2->next) {
if (ob2->node == i)
break;
}
for (obs = instlist[i][1]; obs; obs = obs->next) {
if (obs->node != i) {
ob2->node = obs->node;
break;
}
}
/* Excise the 2nd instance. instlist[i][1] remains as the */
/* only pointer to it. */
for (obp = instlist[i][0]; obp->next && (obp->next->type > FIRSTPIN ||
obp->next->type == PROPERTY); obp = obp->next);
for (ob2 = obp; ob2 && ob2->next != instlist[i][1]; ob2 = ob2->next);
/* Device may have been moved by the above code. If so, look for */
/* it from the beginning of the list. */
if (ob2 == NULL)
for (ob2 = tp->cell; ob2->next != instlist[i][1]; ob2 = ob2->next);
for (obs = ob2->next; obs->next && (obs->next->type > FIRSTPIN
|| obs->next->type == PROPERTY); obs = obs->next);
ob2->next = obs->next;
if (obs->next) obs->next = NULL; // Terminate 2nd instance record
/* If 1st device has unbalanced 'open' records, then add 'close' */
/* records to the 2nd device to balance. */
add_balancing_close(instlist[i][0], instlist[i][1]);
/* Move property record(s) of the 2nd device to the first */
for (obs = instlist[i][1]; obs && obs->type != PROPERTY; obs = obs->next);
while (obs && (obs->type == PROPERTY)) {
obn = obs->next;
obs->next = obp->next;
obp->next = obs;
obs = obn;
}
/* If 2nd device appears anywhere else in the series device */
/* list, replace it with the 1st device. */
for (j = i + 1; j <= tp->nodename_cache_maxnodenum; j++) {
if (instlist[j] == NULL) continue;
if (instlist[j][0] == instlist[i][1])
instlist[j][0] = instlist[i][0];
if (instlist[j][1] == instlist[i][1])
instlist[j][1] = instlist[i][0];
/* If instlist[j]'s two entries point to the same device */
/* then invalidate it. */
if (instlist[j][0] == instlist[j][1]) {
FREE(instlist[j]);
instlist[j] = NULL;
}
}
/* Free 2nd device's object */
for (obs = instlist[i][1]; obs && obs->type != PROPERTY; ) {
obn = obs->next;
FreeObjectAndHash(obs, tp);
obs = obn;
}
/* Free node i and remove from object hash */
for (obp = tp->cell; obp->next; obp = obp->next) {
if ((obp->next->type == NODE) && (obp->next->node == i)) {
obn = obp->next;
obp->next = obp->next->next;
FreeObjectAndHash(obn, tp);
break;
}
}
}
FREE(instlist[i]);
}
}
FREE(instlist);
return scnt;
}
/*----------------------------------------------------------------------*/
/*----------------------------------------------------------------------*/
void EndCell(void)
{
char buffer1[1024];
char prefix[10];
if (CurrentCell == NULL) return;
if (Composition == HORIZONTAL) {
if (LastPlaced != NULL) {
sprintf(buffer1,"%s%s%s%s%s",
LastPlaced->instance.name, SEPARATOR, "E", PORT_DELIMITER, "*");
sprintf(prefix,"%s%s", "E", PORT_DELIMITER);
PortList(prefix,buffer1);
}
}
else if (Composition == VERTICAL) { /* vcomposing */
if (LastPlaced != NULL) {
sprintf(buffer1,"%s%s%s%s%s",
LastPlaced->instance.name, SEPARATOR, "N", PORT_DELIMITER, "*");
sprintf(prefix,"%s%s", "N", PORT_DELIMITER);
PortList(prefix,buffer1);
}
}
LastPlaced = NULL;
CacheNodeNames(CurrentCell);
if (NoDisconnectedNodes) ConnectAllNodes(CurrentCell->name, CurrentCell->file);
CurrentCell = NULL;
CurrentTail = NULL;
}
Reference in New Issue View Git Blame Copy Permalink