2000-04-27 22:03:57 +02:00
|
|
|
/**********
|
|
|
|
|
Copyright 1990 Regents of the University of California. All rights reserved.
|
|
|
|
|
**********/
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* String functions
|
|
|
|
|
*/
|
|
|
|
|
|
2011-12-11 19:05:00 +01:00
|
|
|
#include "ngspice/ngspice.h"
|
2011-12-17 18:16:29 +01:00
|
|
|
#include "ngspice/stringutil.h"
|
2011-12-11 19:05:00 +01:00
|
|
|
#include "ngspice/dstring.h"
|
2000-04-27 22:03:57 +02:00
|
|
|
|
|
|
|
|
int
|
|
|
|
|
prefix(register char *p, register char *s)
|
|
|
|
|
{
|
|
|
|
|
while (*p && (*p == *s))
|
|
|
|
|
p++, s++;
|
|
|
|
|
if (!*p)
|
|
|
|
|
return (TRUE);
|
|
|
|
|
else
|
|
|
|
|
return (FALSE);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Create a copy of a string. */
|
|
|
|
|
|
|
|
|
|
char *
|
2010-04-11 10:49:05 +02:00
|
|
|
copy(const char *str)
|
2000-04-27 22:03:57 +02:00
|
|
|
{
|
|
|
|
|
char *p;
|
|
|
|
|
|
2010-11-19 19:52:44 +01:00
|
|
|
if ((p = TMALLOC(char, strlen(str) + 1)) != NULL)
|
2000-04-27 22:03:57 +02:00
|
|
|
(void) strcpy(p, str);
|
|
|
|
|
return(p);
|
|
|
|
|
}
|
|
|
|
|
|
2010-04-11 10:49:05 +02:00
|
|
|
char *
|
|
|
|
|
copy_substring(const char *str, const char *end)
|
|
|
|
|
{
|
2010-11-06 21:14:21 +01:00
|
|
|
size_t n = (size_t) (end - str);
|
2010-04-11 10:49:05 +02:00
|
|
|
char *p;
|
|
|
|
|
|
2010-11-19 19:52:44 +01:00
|
|
|
if ((p = TMALLOC(char, n + 1)) != NULL) {
|
2010-04-11 10:49:05 +02:00
|
|
|
(void) strncpy(p, str, n);
|
|
|
|
|
p[n] = '\0';
|
|
|
|
|
}
|
|
|
|
|
return(p);
|
|
|
|
|
}
|
|
|
|
|
|
2000-04-27 22:03:57 +02:00
|
|
|
/* Determine whether sub is a substring of str. */
|
|
|
|
|
/* Like strstr( ) XXX */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
substring(register char *sub, register char *str)
|
|
|
|
|
{
|
|
|
|
|
char *s, *t;
|
|
|
|
|
|
|
|
|
|
while (*str) {
|
|
|
|
|
if (*str == *sub) {
|
|
|
|
|
t = str;
|
|
|
|
|
for (s = sub; *s; s++) {
|
|
|
|
|
if (!*t || (*s != *t++))
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (*s == '\0')
|
|
|
|
|
return (TRUE);
|
|
|
|
|
}
|
|
|
|
|
str++;
|
|
|
|
|
}
|
|
|
|
|
return (FALSE);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Append one character to a string. Don't check for overflow. */
|
|
|
|
|
/* Almost like strcat( ) XXX */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
appendc(char *s, char c)
|
|
|
|
|
{
|
|
|
|
|
while (*s)
|
|
|
|
|
s++;
|
|
|
|
|
*s++ = c;
|
|
|
|
|
*s = '\0';
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Try to identify an integer that begins a string. Stop when a non-
|
|
|
|
|
* numeric character is reached.
|
|
|
|
|
*/
|
|
|
|
|
/* Like atoi( ) XXX */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
scannum(char *str)
|
|
|
|
|
{
|
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
|
|
while(isdigit(*str))
|
|
|
|
|
i = i * 10 + *(str++) - '0';
|
|
|
|
|
return(i);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Case insensitive str eq. */
|
|
|
|
|
/* Like strcasecmp( ) XXX */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
cieq(register char *p, register char *s)
|
|
|
|
|
{
|
|
|
|
|
while (*p) {
|
|
|
|
|
if ((isupper(*p) ? tolower(*p) : *p) !=
|
|
|
|
|
(isupper(*s) ? tolower(*s) : *s))
|
|
|
|
|
return(FALSE);
|
|
|
|
|
p++;
|
|
|
|
|
s++;
|
|
|
|
|
}
|
|
|
|
|
return (*s ? FALSE : TRUE);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Case insensitive prefix. */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
ciprefix(register char *p, register char *s)
|
|
|
|
|
{
|
|
|
|
|
while (*p) {
|
|
|
|
|
if ((isupper(*p) ? tolower(*p) : *p) !=
|
|
|
|
|
(isupper(*s) ? tolower(*s) : *s))
|
|
|
|
|
return(FALSE);
|
|
|
|
|
p++;
|
|
|
|
|
s++;
|
|
|
|
|
}
|
|
|
|
|
return (TRUE);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
strtolower(char *str)
|
|
|
|
|
{
|
|
|
|
|
if (str)
|
2010-11-04 21:01:46 +01:00
|
|
|
while (*str) {
|
|
|
|
|
if(isupper(*str))
|
|
|
|
|
*str = (char) tolower(*str);
|
|
|
|
|
str++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
strtoupper(char *str)
|
|
|
|
|
{
|
|
|
|
|
if (str)
|
|
|
|
|
while (*str) {
|
|
|
|
|
if(islower(*str))
|
|
|
|
|
*str = (char) toupper(*str);
|
|
|
|
|
str++;
|
|
|
|
|
}
|
2000-04-27 22:03:57 +02:00
|
|
|
}
|
|
|
|
|
|
2003-08-11 22:53:33 +02:00
|
|
|
#ifdef CIDER
|
|
|
|
|
/*
|
|
|
|
|
* Imported from cider file support/strmatch.c
|
|
|
|
|
* Original copyright notice:
|
|
|
|
|
* Author: 1991 David A. Gates, U. C. Berkeley CAD Group
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Case-insensitive test of whether p is a prefix of s and at least the
|
|
|
|
|
* first n characters are the same
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
int
|
2009-11-26 21:04:09 +01:00
|
|
|
cinprefix(
|
|
|
|
|
register char *p, register char *s,
|
|
|
|
|
register int n)
|
2003-08-11 22:53:33 +02:00
|
|
|
{
|
|
|
|
|
if (!p || !s) return( 0 );
|
|
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
|
if ((isupper(*p) ? tolower(*p) : *p) != (isupper(*s) ? tolower(*s) : *s))
|
|
|
|
|
return( 0 );
|
|
|
|
|
p++;
|
|
|
|
|
s++;
|
|
|
|
|
n--;
|
|
|
|
|
}
|
|
|
|
|
if (n > 0)
|
|
|
|
|
return( 0 );
|
|
|
|
|
else
|
|
|
|
|
return( 1 );
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Case-insensitive match of prefix string p against string s
|
|
|
|
|
* returns the number of matching characters
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
int
|
2009-11-26 21:04:09 +01:00
|
|
|
cimatch(
|
|
|
|
|
register char *p, register char *s)
|
2003-08-11 22:53:33 +02:00
|
|
|
{
|
|
|
|
|
register int n = 0;
|
|
|
|
|
|
|
|
|
|
if (!p || !s) return( 0 );
|
|
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
|
if ((isupper(*p) ? tolower(*p) : *p) != (isupper(*s) ? tolower(*s) : *s))
|
|
|
|
|
return( n );
|
|
|
|
|
p++;
|
|
|
|
|
s++;
|
|
|
|
|
n++;
|
|
|
|
|
}
|
|
|
|
|
return( n );
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* CIDER */
|
|
|
|
|
|
|
|
|
|
|
2004-01-10 22:39:36 +01:00
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* gettok skips over whitespace and returns the next token found. This is
|
|
|
|
|
* the original version. It does not "do the right thing" when you have
|
|
|
|
|
* parens or commas anywhere in the nodelist. Note that I left this unmodified
|
|
|
|
|
* since I didn't want to break any fcns which called it from elsewhere than
|
|
|
|
|
* subckt.c. -- SDB 12.3.2003.
|
|
|
|
|
*-------------------------------------------------------------------------*/
|
2000-04-27 22:03:57 +02:00
|
|
|
char *
|
|
|
|
|
gettok(char **s)
|
|
|
|
|
{
|
|
|
|
|
char c;
|
|
|
|
|
int paren;
|
2010-03-25 23:44:37 +01:00
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
2000-04-27 22:03:57 +02:00
|
|
|
|
|
|
|
|
paren = 0;
|
|
|
|
|
while (isspace(**s))
|
|
|
|
|
(*s)++;
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (NULL);
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_init(&buf) ;
|
2010-11-19 19:49:05 +01:00
|
|
|
while ((c = **s) != '\0' && !isspace(c)) {
|
2000-04-27 22:03:57 +02:00
|
|
|
if (c == '('/*)*/)
|
|
|
|
|
paren += 1;
|
|
|
|
|
else if (c == /*(*/')')
|
|
|
|
|
paren -= 1;
|
|
|
|
|
else if (c == ',' && paren < 1)
|
|
|
|
|
break;
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
2000-04-27 22:03:57 +02:00
|
|
|
}
|
|
|
|
|
while (isspace(**s) || **s == ',')
|
|
|
|
|
(*s)++;
|
2010-03-25 23:44:37 +01:00
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
2000-04-27 22:03:57 +02:00
|
|
|
}
|
|
|
|
|
|
2010-07-10 13:27:57 +02:00
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* gettok skips over whitespaces or '=' and returns the next token found,
|
|
|
|
|
* if the token is something like i(xxx), v(yyy), or v(xxx,yyy)
|
|
|
|
|
* -- h_vogt 10.07.2010.
|
|
|
|
|
*-------------------------------------------------------------------------*/
|
|
|
|
|
char *
|
|
|
|
|
gettok_iv(char **s)
|
|
|
|
|
{
|
|
|
|
|
char c;
|
|
|
|
|
int paren;
|
|
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
|
|
|
|
|
|
|
|
|
paren = 0;
|
|
|
|
|
while ((isspace(**s)) || (**s=='='))
|
|
|
|
|
(*s)++;
|
|
|
|
|
if ((!**s) || ((**s != 'v') && (**s != 'i') && (**s != 'V') && (**s != 'I')))
|
|
|
|
|
return (NULL);
|
|
|
|
|
// initialize string
|
|
|
|
|
spice_dstring_init(&buf);
|
|
|
|
|
// add v or i to buf
|
|
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
2010-07-24 20:51:06 +02:00
|
|
|
while ((c = **s) != '\0') {
|
2010-07-10 13:27:57 +02:00
|
|
|
if (c == '('/*)*/)
|
|
|
|
|
paren += 1;
|
|
|
|
|
else if (c == /*(*/')')
|
|
|
|
|
paren -= 1;
|
|
|
|
|
if (isspace(c))
|
2010-08-15 20:26:56 +02:00
|
|
|
(*s)++;
|
2010-07-10 13:27:57 +02:00
|
|
|
else {
|
|
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
|
|
|
|
if (paren == 0) break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
while (isspace(**s) || **s == ',')
|
|
|
|
|
(*s)++;
|
|
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2003-07-23 21:36:39 +02:00
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* gettok_noparens was added by SDB on 4.21.2003.
|
2004-01-10 22:39:36 +01:00
|
|
|
* It acts like gettok, except that it treats parens and commas like
|
|
|
|
|
* whitespace while looking for the POLY token. That is, it stops
|
|
|
|
|
* parsing and returns when it finds one of those chars. It is called from
|
|
|
|
|
* 'translate' (subckt.c).
|
2003-07-23 21:36:39 +02:00
|
|
|
*-------------------------------------------------------------------------*/
|
|
|
|
|
char *
|
|
|
|
|
gettok_noparens(char **s)
|
|
|
|
|
{
|
|
|
|
|
char c;
|
2010-03-25 23:44:37 +01:00
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
2003-07-23 21:36:39 +02:00
|
|
|
|
2004-01-10 22:39:36 +01:00
|
|
|
while ( isspace(**s) )
|
|
|
|
|
(*s)++; /* iterate over whitespace */
|
|
|
|
|
|
2003-07-23 21:36:39 +02:00
|
|
|
if (!**s)
|
2004-01-10 22:39:36 +01:00
|
|
|
return (NULL); /* return NULL if we come to end of line */
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_init(&buf) ;
|
2010-11-19 19:49:05 +01:00
|
|
|
while ((c = **s) != '\0' &&
|
2004-01-10 22:39:36 +01:00
|
|
|
!isspace(c) &&
|
|
|
|
|
( **s != '(' ) &&
|
|
|
|
|
( **s != ')' ) &&
|
|
|
|
|
( **s != ',')
|
|
|
|
|
) {
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
2003-07-23 21:36:39 +02:00
|
|
|
}
|
2004-01-10 22:39:36 +01:00
|
|
|
|
|
|
|
|
/* Now iterate up to next non-whitespace char */
|
|
|
|
|
while ( isspace(**s) )
|
|
|
|
|
(*s)++;
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
2004-01-10 22:39:36 +01:00
|
|
|
}
|
|
|
|
|
|
2007-12-29 22:13:23 +01:00
|
|
|
char *
|
|
|
|
|
gettok_instance(char **s)
|
|
|
|
|
{
|
|
|
|
|
char c;
|
2010-03-25 23:44:37 +01:00
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
2007-12-29 22:13:23 +01:00
|
|
|
|
|
|
|
|
while ( isspace(**s) )
|
|
|
|
|
(*s)++; /* iterate over whitespace */
|
|
|
|
|
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (NULL); /* return NULL if we come to end of line */
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_init(&buf) ;
|
2010-11-19 19:49:05 +01:00
|
|
|
while ((c = **s) != '\0' &&
|
2007-12-29 22:13:23 +01:00
|
|
|
!isspace(c) &&
|
|
|
|
|
( **s != '(' ) &&
|
|
|
|
|
( **s != ')' )
|
|
|
|
|
) {
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
2007-12-29 22:13:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Now iterate up to next non-whitespace char */
|
2011-12-21 22:33:47 +01:00
|
|
|
while ( isspace(**s) )
|
|
|
|
|
(*s)++;
|
|
|
|
|
|
|
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* get the next token starting at next non white spice, stopping
|
|
|
|
|
at p, if inc_p is true, then including p, else excluding p
|
|
|
|
|
*/
|
|
|
|
|
char *
|
|
|
|
|
gettok_char(char **s, char p, bool inc_p)
|
|
|
|
|
{
|
|
|
|
|
char c;
|
|
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
|
|
|
|
|
|
|
|
|
while ( isspace(**s) )
|
|
|
|
|
(*s)++; /* iterate over whitespace */
|
|
|
|
|
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (NULL); /* return NULL if we come to end of line */
|
|
|
|
|
|
|
|
|
|
spice_dstring_init(&buf) ;
|
|
|
|
|
while ((c = **s) != '\0' &&
|
|
|
|
|
( **s != p )
|
|
|
|
|
) {
|
|
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
|
|
|
|
}
|
|
|
|
|
if (inc_p)
|
|
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
|
|
|
|
|
|
|
|
|
/* Now iterate up to next non-whitespace char */
|
2007-12-29 22:13:23 +01:00
|
|
|
while ( isspace(**s) )
|
|
|
|
|
(*s)++;
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
2007-12-29 22:13:23 +01:00
|
|
|
}
|
|
|
|
|
|
2004-01-10 22:39:36 +01:00
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* gettok_node was added by SDB on 12.3.2003
|
|
|
|
|
* It acts like gettok, except that it treats parens and commas like
|
|
|
|
|
* whitespace (i.e. it ignores them). Use it when parsing through netnames
|
|
|
|
|
* (node names) since they may be grouped using ( , ).
|
|
|
|
|
*-------------------------------------------------------------------------*/
|
|
|
|
|
char *
|
|
|
|
|
gettok_node(char **s)
|
|
|
|
|
{
|
|
|
|
|
char c;
|
2010-03-25 23:44:37 +01:00
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
2004-01-10 22:39:36 +01:00
|
|
|
|
|
|
|
|
while (isspace(**s) ||
|
|
|
|
|
( **s == '(' ) ||
|
|
|
|
|
( **s == ')' ) ||
|
|
|
|
|
( **s == ',')
|
|
|
|
|
)
|
|
|
|
|
(*s)++; /* iterate over whitespace and ( , ) */
|
|
|
|
|
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (NULL); /* return NULL if we come to end of line */
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_init(&buf) ;
|
2010-11-19 19:49:05 +01:00
|
|
|
while ((c = **s) != '\0' &&
|
2004-01-10 22:39:36 +01:00
|
|
|
!isspace(c) &&
|
|
|
|
|
( **s != '(' ) &&
|
|
|
|
|
( **s != ')' ) &&
|
|
|
|
|
( **s != ',')
|
|
|
|
|
) { /* collect chars until whitespace or ( , ) */
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_append_char( &buf, *(*s)++ ) ;
|
2004-01-10 22:39:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Now iterate up to next non-whitespace char */
|
|
|
|
|
while (isspace(**s) ||
|
|
|
|
|
( **s == '(' ) ||
|
|
|
|
|
( **s == ')' ) ||
|
|
|
|
|
( **s == ',')
|
|
|
|
|
)
|
|
|
|
|
(*s)++; /* iterate over whitespace and ( , ) */
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
2003-07-23 21:36:39 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* get_l_paren iterates the pointer forward in a string until it hits
|
|
|
|
|
* the position after the next left paren "(". It returns 0 if it found a left
|
2004-01-10 22:39:36 +01:00
|
|
|
* paren, and 1 if no left paren is found. It is called from 'translate'
|
|
|
|
|
* (subckt.c).
|
2003-07-23 21:36:39 +02:00
|
|
|
*-------------------------------------------------------------------------*/
|
|
|
|
|
int
|
|
|
|
|
get_l_paren(char **s)
|
|
|
|
|
{
|
|
|
|
|
while (**s && ( **s != '(' ) )
|
|
|
|
|
(*s)++;
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (1);
|
|
|
|
|
|
|
|
|
|
(*s)++;
|
|
|
|
|
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (1);
|
|
|
|
|
else
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* get_r_paren iterates the pointer forward in a string until it hits
|
|
|
|
|
* the position after the next right paren ")". It returns 0 if it found a right
|
2004-01-10 22:39:36 +01:00
|
|
|
* paren, and 1 if no right paren is found. It is called from 'translate'
|
|
|
|
|
* (subckt.c).
|
2003-07-23 21:36:39 +02:00
|
|
|
*-------------------------------------------------------------------------*/
|
|
|
|
|
int
|
|
|
|
|
get_r_paren(char **s)
|
|
|
|
|
{
|
|
|
|
|
while (**s && ( **s != ')' ) )
|
|
|
|
|
(*s)++;
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (1);
|
|
|
|
|
|
|
|
|
|
(*s)++;
|
|
|
|
|
|
|
|
|
|
if (!**s)
|
|
|
|
|
return (1);
|
|
|
|
|
else
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2007-12-02 23:00:25 +01:00
|
|
|
/*-------------------------------------------------------------------------*
|
|
|
|
|
* this function strips all white space inside parens
|
|
|
|
|
* is needed in gettoks (dotcards.c) for right processing of expressions
|
|
|
|
|
* like ".plot v( 5,4) v(6)"
|
|
|
|
|
*-------------------------------------------------------------------------*/
|
|
|
|
|
char *
|
|
|
|
|
stripWhiteSpacesInsideParens(char *str)
|
|
|
|
|
{
|
2010-03-25 23:44:37 +01:00
|
|
|
char *token ; /* return token */
|
|
|
|
|
SPICE_DSTRING buf ; /* allow any length string */
|
|
|
|
|
int i = 0 ; /* index into string */
|
2007-12-02 23:00:25 +01:00
|
|
|
|
|
|
|
|
while ( (str[i] == ' ') || (str[i] == '\t') )
|
|
|
|
|
i++;
|
|
|
|
|
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_init(&buf) ;
|
2007-12-02 23:00:25 +01:00
|
|
|
for(i=i; str[i]!='\0'; i++)
|
|
|
|
|
{
|
|
|
|
|
if ( str[i] != '(' ) {
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_append_char( &buf, str[i] ) ;
|
2007-12-02 23:00:25 +01:00
|
|
|
} else {
|
2010-03-25 23:44:37 +01:00
|
|
|
spice_dstring_append_char( &buf, str[i] ) ;
|
2007-12-02 23:00:25 +01:00
|
|
|
while ( (str[i++] != ')') ) {
|
2010-03-25 23:44:37 +01:00
|
|
|
if ( str[i] != ' ' ) spice_dstring_append_char( &buf, str[i] ) ;
|
2007-12-02 23:00:25 +01:00
|
|
|
}
|
|
|
|
|
i--;
|
|
|
|
|
}
|
|
|
|
|
}
|
2010-03-25 23:44:37 +01:00
|
|
|
token = copy( spice_dstring_value(&buf) ) ;
|
|
|
|
|
spice_dstring_free(&buf) ;
|
|
|
|
|
return ( token ) ;
|
2007-12-02 23:00:25 +01:00
|
|
|
}
|
2000-04-27 22:03:57 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef HAVE_BCOPY
|
|
|
|
|
#ifndef bcopy
|
|
|
|
|
void
|
2003-08-06 20:37:51 +02:00
|
|
|
bcopy(const void *vfrom, void *vto, size_t num)
|
2000-04-27 22:03:57 +02:00
|
|
|
{
|
2003-08-06 20:37:51 +02:00
|
|
|
register const char *from=vfrom;
|
|
|
|
|
register char *to=vto;
|
2000-04-27 22:03:57 +02:00
|
|
|
while (num-- > 0)
|
|
|
|
|
*to++ = *from++;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
2009-10-18 15:46:09 +02:00
|
|
|
#endif
|
2000-04-27 22:03:57 +02:00
|
|
|
|
2009-10-18 15:46:09 +02:00
|
|
|
#ifndef HAVE_BZERO
|
2000-04-27 22:03:57 +02:00
|
|
|
#ifndef bzero
|
2003-08-06 20:37:51 +02:00
|
|
|
void
|
2003-07-23 21:36:39 +02:00
|
|
|
bzero(void *vptr, size_t num)
|
2000-04-27 22:03:57 +02:00
|
|
|
{
|
2003-07-23 21:36:39 +02:00
|
|
|
register char *ptr=vptr;
|
2000-04-27 22:03:57 +02:00
|
|
|
while (num-- > 0)
|
|
|
|
|
*ptr++ = '\0';
|
2003-07-23 21:36:39 +02:00
|
|
|
return;
|
2000-04-27 22:03:57 +02:00
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
2008-04-06 21:36:06 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
isquote( char ch )
|
|
|
|
|
{
|
|
|
|
|
return ( ch == '\'' || ch == '"' );
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
is_arith_char( char c )
|
|
|
|
|
{
|
|
|
|
|
if ( c == '+' || c == '-' || c == '*' || c == '/' || c == '(' || c == ')' || c == '<' ||
|
2009-12-12 18:40:20 +01:00
|
|
|
c == '>' || c == '?' || c == '|' || c == '&' || c == '^')
|
2008-04-06 21:36:06 +02:00
|
|
|
return TRUE;
|
|
|
|
|
else
|
|
|
|
|
return FALSE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
str_has_arith_char( char *s )
|
|
|
|
|
{
|
|
|
|
|
while ( *s && *s != '\0' ) {
|
|
|
|
|
if ( is_arith_char(*s) ) return TRUE;
|
|
|
|
|
s++;
|
|
|
|
|
}
|
|
|
|
|
return FALSE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
get_comma_separated_values( char *values[], char *str ) {
|
|
|
|
|
int count = 0;
|
|
|
|
|
char *ptr, *comma_ptr, keep;
|
|
|
|
|
|
2010-11-19 19:52:44 +01:00
|
|
|
while ( ( comma_ptr = strstr( str, "," ) ) != NULL ) {
|
2008-04-06 21:36:06 +02:00
|
|
|
ptr = comma_ptr - 1;
|
|
|
|
|
while ( isspace(*ptr) ) ptr--;
|
|
|
|
|
ptr++; keep = *ptr; *ptr = '\0';
|
|
|
|
|
values[count++] = strdup(str);
|
|
|
|
|
*ptr = keep;
|
|
|
|
|
str = comma_ptr + 1;
|
|
|
|
|
while ( isspace(*str) ) str++;
|
|
|
|
|
}
|
|
|
|
|
values[count++] = strdup(str);
|
|
|
|
|
return count;
|
|
|
|
|
}
|