linktodefs ()
{
register int rule, alt, afx;
newtop ();
alt = SON (root);
afx = AFFIXDEF (alt);
if ((afx == nil) || (NODENAME (afx) != derived) || (BROTHER (afx) != nil))
{
error = true;
if (input_from_partlist)
fprintf (stderr, "In %s:\n", PART (root));
fprintf (stderr, "line %ld: start rule should have at most ONE derived affix\n", LINE (root));
}
for (rule = root; rule != laststdpred; rule = BROTHER (rule))
{
int alt = SON (rule);
check_affix_def (rule);
multiple_defined (rule);
for (; alt != nil; alt = BROTHER (alt))
{
lhs_affixes_defined (alt, rule);
rhs_members_affixes_defined (alt, rule);
}
}
delete_multiple_defined_hyperrules ();
if (error)
if (!tree_flag)
exit (10);
}
/*
* Find the longest match of name in the table.
* If match is found return ISC_TRUE. prefix, suffix and offset are updated.
* If no match is found return ISC_FALSE.
*/
isc_boolean_t
dns_compress_findglobal(dns_compress_t *cctx, const dns_name_t *name,
dns_name_t *prefix, isc_uint16_t *offset)
{
dns_name_t tname, nname;
dns_compressnode_t *node = NULL;
unsigned int labels, hash, n;
REQUIRE(VALID_CCTX(cctx));
REQUIRE(dns_name_isabsolute(name) == ISC_TRUE);
REQUIRE(offset != NULL);
if (cctx->count == 0)
return (ISC_FALSE);
labels = dns_name_countlabels(name);
INSIST(labels > 0);
dns_name_init(&tname, NULL);
dns_name_init(&nname, NULL);
for (n = 0; n < labels - 1; n++) {
dns_name_getlabelsequence(name, n, labels - n, &tname);
hash = dns_name_hash(&tname, ISC_FALSE) %
DNS_COMPRESS_TABLESIZE;
for (node = cctx->table[hash]; node != NULL; node = node->next)
{
NODENAME(node, &nname);
if ((cctx->allowed & DNS_COMPRESS_CASESENSITIVE) != 0) {
if (dns_name_caseequal(&nname, &tname))
break;
} else {
if (dns_name_equal(&nname, &tname))
break;
}
}
if (node != NULL)
break;
}
/*
* If node == NULL, we found no match at all.
*/
if (node == NULL)
return (ISC_FALSE);
if (n == 0)
dns_name_reset(prefix);
else
dns_name_getlabelsequence(name, 0, n, prefix);
*offset = node->offset;
return (ISC_TRUE);
}
newtop ()
{
if (AFFIXDEF (SON (root)) == nil)
{
int root_mem = nil;
if (root != laststdpred)
{
newdefnode (ntnode, nil, nil, root, REPR (root));
root_mem = brother;
}
newnode (affixtm, nil, nil, "");
newnode (derived, nil, brother, "(nil)");
newnode (brother, nil, root_mem, "(nil)");
newrulenode (NODENAME (root), root, brother, 0, PART (root), "newroot");
OLDSUM (brother) = OLDSUM (root);
root = brother;
}
}
///<param name = "*ckt"> Circuit to operate on </param>
///<param name = "maxIter"> Maximum number of iterations to attempt </param>
int NIiter(register CKTcircuit *ckt, int maxIter)
{
int iterno;
int ipass;
int error;
int i, j; /* temporaries for finding error location */
char *message; /* temporary message buffer */
double *temp;
double startTime;
static char *msg = "Too many iterations without convergence";
iterno = 0;
ipass = 0;
if ((ckt->CKTmode & MODETRANOP) && (ckt->CKTmode & MODEUIC))
{
temp = ckt->CKTrhsOld;
ckt->CKTrhsOld = ckt->CKTrhs;
ckt->CKTrhs = temp;
error = CKTload(ckt);
if (error)
{
return(error);
}
return(OK);
}
#ifdef HAS_SENSE2
if (ckt->CKTsenInfo)
{
error = NIsenReinit(ckt);
if (error)
return(error);
}
#endif
if (ckt->CKTniState & NIUNINITIALIZED)
{
error = NIreinit(ckt);
if (error)
{
#ifdef STEPDEBUG
printf("re-init returned error \n");
#endif
return(error);
}
}
while (1)
{
ckt->CKTnoncon = 0;
#ifdef NEWPRED
if (!(ckt->CKTmode & MODEINITPRED))
{
#else /* NEWPRED */
if (1)
{ /* } */
#endif /* NEWPRED */
error = CKTload(ckt);
/*printf("loaded, noncon is %d\n",ckt->CKTnoncon);*/
/*fflush(stdout);*/
iterno++;
if (error)
{
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("load returned error \n");
#endif
return(error);
}
/*printf("after loading, before solving\n");*/
/*CKTdump(ckt);*/
if (!(ckt->CKTniState & NIDIDPREORDER))
{
error = SMPpreOrder(ckt->CKTmatrix);
if (error)
{
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("pre-order returned error \n");
#endif
return(error); /* badly formed matrix */
}
ckt->CKTniState |= NIDIDPREORDER;
}
if ((ckt->CKTmode & MODEINITJCT) || ((ckt->CKTmode & MODEINITTRAN) && (iterno == 1)))
{
ckt->CKTniState |= NISHOULDREORDER;
}
if (ckt->CKTniState & NISHOULDREORDER)
{
startTime = (*(SPfrontEnd->IFseconds))();
error = SMPreorder(ckt->CKTmatrix, ckt->CKTpivotAbsTol, ckt->CKTpivotRelTol, ckt->CKTdiagGmin);
ckt->CKTstat->STATreorderTime += (*(SPfrontEnd->IFseconds))() - startTime;
if (error)
{
/* new feature - we can now find out something about what is
* wrong - so we ask for the troublesome entry
*/
SMPgetError(ckt->CKTmatrix, &i, &j);
message = (char *)MALLOC(1000); /* should be enough */
(void)sprintf(message, "singular matrix: check nodes %s and %s\n", NODENAME(ckt, i), NODENAME(ckt, j));
(*(SPfrontEnd->IFerror))(ERR_WARNING, message, (IFuid *)NULL);
FREE(message);
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("reorder returned error \n");
#endif
return(error); /* can't handle these errors - pass up! */
}
ckt->CKTniState &= ~NISHOULDREORDER;
}
else
{
startTime = (*(SPfrontEnd->IFseconds))();
error = SMPluFac(ckt->CKTmatrix, ckt->CKTpivotAbsTol, ckt->CKTdiagGmin);
ckt->CKTstat->STATdecompTime += (*(SPfrontEnd->IFseconds))() - startTime;
if (error)
{
if (error == E_SINGULAR)
{
ckt->CKTniState |= NISHOULDREORDER;
DEBUGMSG(" forced reordering....\n");
continue;
}
/*CKTload(ckt);*/
/*SMPprint(ckt->CKTmatrix,stdout);*/
/* seems to be singular - pass the bad news up */
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("lufac returned error \n");
#endif
return(error);
}
}
startTime = (*(SPfrontEnd->IFseconds))();
SMPsolve(ckt->CKTmatrix, ckt->CKTrhs, ckt->CKTrhsSpare);
ckt->CKTstat->STATsolveTime += (*(SPfrontEnd->IFseconds))() - startTime;
#ifdef STEPDEBUG
/*XXXX*/
if (*ckt->CKTrhs != 0.0)
printf("NIiter: CKTrhs[0] = %g\n", *ckt->CKTrhs);
if (*ckt->CKTrhsSpare != 0.0)
printf("NIiter: CKTrhsSpare[0] = %g\n", *ckt->CKTrhsSpare);
if (*ckt->CKTrhsOld != 0.0)
printf("NIiter: CKTrhsOld[0] = %g\n", *ckt->CKTrhsOld);
/*XXXX*/
#endif
*ckt->CKTrhs = 0;
*ckt->CKTrhsSpare = 0;
*ckt->CKTrhsOld = 0;
if (iterno > maxIter)
{
/*printf("too many iterations without convergence: %d iter's\n",
iterno);*/
ckt->CKTstat->STATnumIter += iterno;
errMsg = MALLOC(strlen(msg) + 1);
strcpy(errMsg, msg);
#ifdef STEPDEBUG
printf("iterlim exceeded \n");
#endif
return(E_ITERLIM);
}
if (ckt->CKTnoncon == 0 && iterno != 1)
{
ckt->CKTnoncon = NIconvTest(ckt);
}
else
{
ckt->CKTnoncon = 1;
}
}
if (ckt->CKTmode & MODEINITFLOAT)
{
if ((ckt->CKTmode & MODEDC) && (ckt->CKThadNodeset))
{
if (ipass)
{
ckt->CKTnoncon = ipass;
}
ipass = 0;
}
if (ckt->CKTnoncon == 0)
{
ckt->CKTstat->STATnumIter += iterno;
return(OK);
}
}
else if (ckt->CKTmode & MODEINITJCT)
{
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFIX;
ckt->CKTniState |= NISHOULDREORDER;
}
else if (ckt->CKTmode & MODEINITFIX)
{
if (ckt->CKTnoncon == 0)
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
ipass = 1;
}
else if (ckt->CKTmode & MODEINITSMSIG)
{
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
}
else if (ckt->CKTmode & MODEINITTRAN)
{
if (iterno <= 1)
ckt->CKTniState |= NISHOULDREORDER;
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
}
else if (ckt->CKTmode & MODEINITPRED)
{
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
}
else
{
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("bad initf state \n");
#endif
return(E_INTERN);
/* impossible - no such INITF flag! */
}
/* build up the lvnim1 array from the lvn array */
temp = ckt->CKTrhsOld;
ckt->CKTrhsOld = ckt->CKTrhs;
ckt->CKTrhs = temp;
/*printf("after loading, after solving\n");*/
/*CKTdump(ckt);*/
}
/*NOTREACHED*/
}
