Browse Source

beautify the code

pre-master-46
Holger Vogt 11 months ago
parent
commit
c3553396d9
  1. 33
      src/spicelib/analysis/cktdltn.c

33
src/spicelib/analysis/cktdltn.c

@ -12,15 +12,15 @@ Copyright 1992 Regents of the University of California. All rights reserved.
/* ARGSUSED */ /* ARGSUSED */
int int
CKTdltNod(CKTcircuit *ckt, CKTnode *node)
CKTdltNod(CKTcircuit* ckt, CKTnode* node)
{ {
return CKTdltNNum(ckt, node->number); return CKTdltNNum(ckt, node->number);
} }
int int
CKTdltNNum(CKTcircuit *ckt, int num)
CKTdltNNum(CKTcircuit* ckt, int num)
{ {
CKTnode *n, *prev, *node, *sprev;
CKTnode* n, * prev, * node, * sprev;
int error; int error;
if (!ckt->prev_CKTlastNode->number || num <= ckt->prev_CKTlastNode->number) { if (!ckt->prev_CKTlastNode->number || num <= ckt->prev_CKTlastNode->number) {
@ -28,32 +28,33 @@ CKTdltNNum(CKTcircuit *ckt, int num)
controlled_exit(EXIT_FAILURE); controlled_exit(EXIT_FAILURE);
} }
prev = NULL;
node = NULL;
prev = NULL;
node = NULL;
sprev = NULL; sprev = NULL;
for (n = ckt->CKTnodes; n; n = n->next) { for (n = ckt->CKTnodes; n; n = n->next) {
if (n->number == num) {
node = n;
sprev = prev;
}
prev = n;
if (n->number == num) {
node = n;
sprev = prev;
}
prev = n;
} }
if (!node) if (!node)
return OK;
return OK;
ckt->CKTmaxEqNum -= 1; ckt->CKTmaxEqNum -= 1;
if (!sprev) { if (!sprev) {
ckt->CKTnodes = node->next;
} else {
sprev->next = node->next;
ckt->CKTnodes = node->next;
}
else {
sprev->next = node->next;
} }
if (node == ckt->CKTlastNode) if (node == ckt->CKTlastNode)
ckt->CKTlastNode = sprev;
ckt->CKTlastNode = sprev;
error = SPfrontEnd->IFdelUid (ckt, node->name, UID_SIGNAL);
error = SPfrontEnd->IFdelUid(ckt, node->name, UID_SIGNAL);
tfree(node); tfree(node);
return error; return error;

Loading…
Cancel
Save