328 lines
10 KiB
C
328 lines
10 KiB
C
/**********
|
|
Copyright 1990 Regents of the University of California. All rights reserved.
|
|
Author: 1985 Wayne A. Christopher, U. C. Berkeley CAD Group
|
|
Modified: 2001 Paolo Nenzi (printnum)
|
|
Patched: 2010/2012 by Bill Swartz (hash table for vectors)
|
|
**********/
|
|
|
|
/*
|
|
* Do a 'diff' of two plots.
|
|
*/
|
|
|
|
#include "ngspice/ngspice.h"
|
|
#include "ngspice/ftedefs.h"
|
|
#include "ngspice/dvec.h"
|
|
#include "ngspice/sim.h"
|
|
|
|
#include "diff.h"
|
|
#include <ngspice/hash.h>
|
|
#include <ngspice/dstring.h>
|
|
#include "variable.h"
|
|
|
|
|
|
static char *
|
|
cannonical_name(char *name, SPICE_DSTRINGPTR dbuf_p)
|
|
{
|
|
char *tmp; /* position in string */
|
|
char *ptr; /* current position in string */
|
|
|
|
spice_dstring_reinit(dbuf_p);
|
|
|
|
if (ciprefix("i(",name)) {
|
|
tmp = name;
|
|
while (*tmp != '(')
|
|
tmp++;
|
|
tmp++;
|
|
for (ptr = tmp; *ptr; ptr++)
|
|
if (isupper(*ptr))
|
|
tmp = spice_dstring_append_char(dbuf_p, (char)tolower(*ptr));
|
|
else
|
|
tmp = spice_dstring_append_char(dbuf_p, *ptr);
|
|
while (*tmp != ')')
|
|
tmp++;
|
|
*tmp = '\0';
|
|
tmp = spice_dstring_append(dbuf_p, "#branch", -1);
|
|
} else if (isdigit(*name)) {
|
|
spice_dstring_append(dbuf_p, "v(", -1);
|
|
spice_dstring_append(dbuf_p, name, -1);
|
|
tmp = spice_dstring_append_char(dbuf_p, ')');
|
|
} else {
|
|
tmp = spice_dstring_append(dbuf_p, name, -1);
|
|
}
|
|
|
|
return(tmp);
|
|
}
|
|
|
|
|
|
/* Determine if two vectors have the 'same' name. */
|
|
|
|
static bool
|
|
nameeq(char *n1, char *n2)
|
|
{
|
|
char buf1[BSIZE_SP], buf2[BSIZE_SP];
|
|
char *tmp;
|
|
|
|
if (eq(n1, n2))
|
|
return (TRUE);
|
|
|
|
/* n1 or n2 is in the form i(...) or I(...)
|
|
* This happens in the saved rawfile
|
|
*/
|
|
|
|
if (ciprefix("i(", n1)) {
|
|
tmp = n1;
|
|
while (*tmp != '(')
|
|
tmp++;
|
|
tmp++;
|
|
(void) strcpy(buf1, tmp);
|
|
tmp = buf1;
|
|
while (*tmp != ')')
|
|
tmp++;
|
|
*tmp = '\0';
|
|
(void) strcat(buf1, "#branch");
|
|
} else if (isdigit(*n1)) {
|
|
(void) sprintf(buf1, "v(%s)", n1);
|
|
} else {
|
|
(void) strcpy(buf1, n1);
|
|
}
|
|
|
|
if (ciprefix("i(", n2)) {
|
|
tmp = n2;
|
|
while (*tmp != '(')
|
|
tmp++;
|
|
tmp++;
|
|
(void) strcpy(buf2, tmp);
|
|
tmp = buf2;
|
|
while (*tmp != ')')
|
|
tmp++;
|
|
*tmp = '\0';
|
|
(void) strcat(buf2, "#branch");
|
|
} else if (isdigit(*n2)) {
|
|
(void) sprintf(buf2, "v(%s)", n2);
|
|
} else {
|
|
(void) strcpy(buf2, n2);
|
|
}
|
|
|
|
return (cieq(buf1, buf2) ? TRUE : FALSE);
|
|
}
|
|
|
|
|
|
void
|
|
com_diff(wordlist *wl)
|
|
{
|
|
double vntol, abstol, reltol, tol, cmax, cm1, cm2;
|
|
struct plot *p1, *p2 = NULL;
|
|
struct dvec *v1, *v2;
|
|
double d1, d2;
|
|
ngcomplex_t c1, c2, c3;
|
|
int i, j;
|
|
char *v1_name; /* cannonical v1 name */
|
|
char *v2_name; /* cannonical v2 name */
|
|
NGHASHPTR crossref_p; /* cross reference hash table */
|
|
SPICE_DSTRING ibuf; /* used to build cannonical name */
|
|
wordlist *tw;
|
|
char numbuf[BSIZE_SP], numbuf2[BSIZE_SP], numbuf3[BSIZE_SP], numbuf4[BSIZE_SP]; /* For printnum */
|
|
|
|
if (!cp_getvar("diff_vntol", CP_REAL, &vntol))
|
|
vntol = 1.0e-6;
|
|
if (!cp_getvar("diff_abstol", CP_REAL, &abstol))
|
|
abstol = 1.0e-12;
|
|
if (!cp_getvar("diff_reltol", CP_REAL, &reltol))
|
|
reltol = 0.001;
|
|
|
|
/* Let's try to be clever about defaults. This code is ugly. */
|
|
if (!wl || !wl->wl_next) {
|
|
if (plot_list && plot_list->pl_next && !plot_list->pl_next->pl_next) {
|
|
p1 = plot_list;
|
|
p2 = plot_list->pl_next;
|
|
if (wl && !eq(wl->wl_word, p1->pl_typename) &&
|
|
!eq(wl->wl_word, p2->pl_typename)) {
|
|
fprintf(cp_err, "Error: no such plot \"%s\"\n",
|
|
wl->wl_word);
|
|
return;
|
|
}
|
|
fprintf(cp_err, "Plots are \"%s\" and \"%s\"\n",
|
|
plot_list->pl_typename,
|
|
plot_list->pl_next->pl_typename);
|
|
if (wl)
|
|
wl = NULL;
|
|
} else {
|
|
fprintf(cp_err, "Error: plot names not given.\n");
|
|
return;
|
|
}
|
|
} else {
|
|
for (p1 = plot_list; p1; p1 = p1->pl_next)
|
|
if (eq(wl->wl_word, p1->pl_typename))
|
|
break;
|
|
if (!p1) {
|
|
fprintf(cp_err, "Error: no such plot %s\n", wl->wl_word);
|
|
return;
|
|
}
|
|
wl = wl->wl_next;
|
|
}
|
|
|
|
if (!p2) {
|
|
for (p2 = plot_list; p2; p2 = p2->pl_next)
|
|
if (eq(wl->wl_word, p2->pl_typename))
|
|
break;
|
|
if (!p2) {
|
|
fprintf(cp_err, "Error: no such plot %s\n", wl->wl_word);
|
|
return;
|
|
}
|
|
wl = wl->wl_next;
|
|
}
|
|
|
|
/* Now do some tests to make sure these plots are really the
|
|
* same type, etc.
|
|
*/
|
|
if (!eq(p1->pl_name, p2->pl_name))
|
|
fprintf(cp_err,
|
|
"Warning: plots %s and %s seem to be of different types\n",
|
|
p1->pl_typename, p2->pl_typename);
|
|
if (!eq(p1->pl_title, p2->pl_title))
|
|
fprintf(cp_err,
|
|
"Warning: plots %s and %s seem to be from different circuits\n",
|
|
p1->pl_typename, p2->pl_typename);
|
|
|
|
/* This may not be the best way to do this. It wasn't :). The original
|
|
* was O(n2) - not good. Now use a hash table to reduce it to O(n). */
|
|
for (v1 = p1->pl_dvecs; v1; v1 = v1->v_next)
|
|
v1->v_link2 = NULL;
|
|
|
|
spice_dstring_init(&ibuf);
|
|
crossref_p = nghash_init(NGHASH_MIN_SIZE);
|
|
nghash_unique(crossref_p, FALSE);
|
|
|
|
for (v2 = p2->pl_dvecs; v2; v2 = v2->v_next) {
|
|
v2->v_link2 = NULL;
|
|
v2_name = cannonical_name(v2->v_name, &ibuf);
|
|
nghash_insert(crossref_p, v2_name, v2);
|
|
}
|
|
|
|
for (v1 = p1->pl_dvecs; v1; v1 = v1->v_next) {
|
|
v1_name = cannonical_name(v1->v_name, &ibuf);
|
|
for (v2 = nghash_find(crossref_p, v1_name);
|
|
v2;
|
|
v2 = nghash_find_again(crossref_p, v1_name))
|
|
{
|
|
if (!v2->v_link2 &&
|
|
((v1->v_flags & (VF_REAL | VF_COMPLEX)) ==
|
|
(v2->v_flags & (VF_REAL | VF_COMPLEX))) &&
|
|
(v1->v_type == v2->v_type))
|
|
{
|
|
v1->v_link2 = v2;
|
|
v2->v_link2 = v1;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
spice_dstring_free(&ibuf);
|
|
nghash_free(crossref_p, NULL, NULL);
|
|
|
|
for (v1 = p1->pl_dvecs; v1; v1 = v1->v_next)
|
|
if (!v1->v_link2)
|
|
fprintf(cp_err,
|
|
">>> %s vector %s in %s not in %s, or of wrong type\n",
|
|
isreal(v1) ? "real" : "complex",
|
|
v1->v_name, p1->pl_typename, p2->pl_typename);
|
|
|
|
for (v2 = p2->pl_dvecs; v2; v2 = v2->v_next)
|
|
if (!v2->v_link2)
|
|
fprintf(cp_err,
|
|
">>> %s vector %s in %s not in %s, or of wrong type\n",
|
|
isreal(v2) ? "real" : "complex",
|
|
v2->v_name, p2->pl_typename, p1->pl_typename);
|
|
|
|
/* Throw out the ones that aren't in the arg list */
|
|
if (wl && !eq(wl->wl_word, "all")) { /* Just in case */
|
|
for (v1 = p1->pl_dvecs; v1; v1 = v1->v_next)
|
|
if (v1->v_link2) {
|
|
for (tw = wl; tw; tw = tw->wl_next)
|
|
if (nameeq(v1->v_name, tw->wl_word))
|
|
break;
|
|
if (!tw)
|
|
v1->v_link2 = NULL;
|
|
}
|
|
for (v2 = p2->pl_dvecs; v2; v2 = v2->v_next)
|
|
if (v2->v_link2) {
|
|
for (tw = wl; tw; tw = tw->wl_next)
|
|
if (nameeq(v2->v_name, tw->wl_word))
|
|
break;
|
|
if (!tw)
|
|
v2->v_link2 = NULL;
|
|
}
|
|
}
|
|
|
|
/* Now we have all the vectors linked to their twins. Travel
|
|
* down each one and print values that differ enough.
|
|
*/
|
|
for (v1 = p1->pl_dvecs; v1; v1 = v1->v_next) {
|
|
if (!v1->v_link2)
|
|
continue;
|
|
v2 = v1->v_link2;
|
|
if (v1->v_type == SV_VOLTAGE)
|
|
tol = vntol;
|
|
else
|
|
tol = abstol;
|
|
j = MAX(v1->v_length, v2->v_length);
|
|
for (i = 0; i < j; i++) {
|
|
if (v1->v_length <= i) {
|
|
fprintf(cp_out,
|
|
">>> %s is %d long in %s and %d long in %s\n",
|
|
v1->v_name, v1->v_length,
|
|
p1->pl_typename, v2->v_length, p2->pl_typename);
|
|
break;
|
|
} else if (v2->v_length <= i) {
|
|
fprintf(cp_out,
|
|
">>> %s is %d long in %s and %d long in %s\n",
|
|
v2->v_name, v2->v_length,
|
|
p2->pl_typename, v1->v_length, p1->pl_typename);
|
|
break;
|
|
} else {
|
|
if (isreal(v1)) {
|
|
d1 = v1->v_realdata[i];
|
|
d2 = v2->v_realdata[i];
|
|
if (MAX(fabs(d1), fabs(d2)) * reltol +
|
|
tol < fabs(d1 - d2)) {
|
|
printnum(numbuf, d1);
|
|
fprintf(cp_out,
|
|
"%s.%s[%d] = %-15s ",
|
|
p1->pl_typename, v1->v_name, i, numbuf);
|
|
printnum(numbuf, d2);
|
|
fprintf(cp_out,
|
|
"%s.%s[%d] = %s\n",
|
|
p2->pl_typename, v2->v_name, i, numbuf);
|
|
}
|
|
} else {
|
|
c1 = v1->v_compdata[i];
|
|
c2 = v2->v_compdata[i];
|
|
realpart(c3) = realpart(c1) - realpart(c2);
|
|
imagpart(c3) = imagpart(c1) - imagpart(c2);
|
|
/* Stupid evil PC compilers */
|
|
cm1 = cmag(c1);
|
|
cm2 = cmag(c2);
|
|
cmax = MAX(cm1, cm2);
|
|
if (cmax * reltol + tol < cmag(c3)) {
|
|
|
|
printnum(numbuf, realpart(c1));
|
|
printnum(numbuf2, imagpart(c1));
|
|
printnum(numbuf3, realpart(c2));
|
|
printnum(numbuf4, imagpart(c2));
|
|
|
|
fprintf(cp_out,
|
|
"%s.%s[%d] = %-10s, %-10s %s.%s[%d] = %-10s, %s\n",
|
|
p1->pl_typename, v1->v_name, i,
|
|
numbuf,
|
|
numbuf2,
|
|
p2->pl_typename, v2->v_name, i,
|
|
numbuf3,
|
|
numbuf4);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|