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

42 x warning: suggest parentheses around assignment used as truth value 

EFbuild.c:466:9: warning: suggest parentheses around assignment used as truth value
EFbuild.c:662:20: warning: suggest parentheses around assignment used as truth value
EFbuild.c:682:24: warning: suggest parentheses around assignment used as truth value
EFbuild.c:690:24: warning: suggest parentheses around assignment used as truth value
EFbuild.c:1760:12: warning: suggest parentheses around assignment used as truth value
EFbuild.c:1973:9: warning: suggest parentheses around assignment used as truth value
EFbuild.c:2062:12: warning: suggest parentheses around assignment used as truth value
EFbuild.c:2063:13: warning: suggest parentheses around assignment used as truth value
EFbuild.c:2091:12: warning: suggest parentheses around assignment used as truth value
EFbuild.c:2134:12: warning: suggest parentheses around assignment used as truth value
EFbuild.c:2135:13: warning: suggest parentheses around assignment used as truth value
EFread.c:673:12: warning: suggest parentheses around assignment used as truth value
ExtArray.c:693:12: warning: suggest parentheses around assignment used as truth value
ExtArray.c:800:13: warning: suggest parentheses around assignment used as truth value
ExtBasic.c:4569:9: warning: suggest parentheses around assignment used as truth value
ExtBasic.c:4949:13: warning: suggest parentheses around assignment used as truth value
ExtBasic.c:5032:12: warning: suggest parentheses around assignment used as truth value
ExtCell.c:218:13: warning: suggest parentheses around assignment used as truth value
ExtCouple.c:222:12: warning: suggest parentheses around assignment used as truth value
ExtCouple.c:278:12: warning: suggest parentheses around assignment used as truth value
ExtCouple.c:467:9: warning: suggest parentheses around assignment used as truth value
ExtHard.c:379:12: warning: suggest parentheses around assignment used as truth value
ExtHard.c:458:12: warning: suggest parentheses around assignment used as truth value
ExtHier.c:740:16: warning: suggest parentheses around assignment used as truth value
ExtHier.c:831:12: warning: suggest parentheses around assignment used as truth value
ExtHier.c:841:13: warning: suggest parentheses around assignment used as truth value
ExtHier.c:851:17: warning: suggest parentheses around assignment used as truth value
ExtHier.c:865:34: warning: suggest parentheses around assignment used as truth value
ExtLength.c:264:12: warning: suggest parentheses around assignment used as truth value
ExtLength.c:276:12: warning: suggest parentheses around assignment used as truth value
ExtLength.c:878:9: warning: suggest parentheses around assignment used as truth value
ExtMain.c:499:12: warning: suggest parentheses around assignment used as truth value
ExtMain.c:970:12: warning: suggest parentheses around assignment used as truth value
ExtNghbors.c:298:13: warning: suggest parentheses around assignment used as truth value
ExtSubtree.c:683:12: warning: suggest parentheses around assignment used as truth value
ExtTest.c:457:21: warning: suggest parentheses around assignment used as truth value
ExtTest.c:466:21: warning: suggest parentheses around assignment used as truth value
ExtTimes.c:216:12: warning: suggest parentheses around assignment used as truth value
ExtTimes.c:226:12: warning: suggest parentheses around assignment used as truth value
ExtTimes.c:235:12: warning: suggest parentheses around assignment used as truth value
ExtYank.c:236:34: warning: suggest parentheses around assignment used as truth value
ExtYank.c:238:42: warning: suggest parentheses around assignment used as truth value

GCC14 -Wall cleanup series [-Wparentheses]
This commit is contained in:
Darryl L. Miles 2024-10-04 17:20:25 +01:00 committed by Tim Edwards
parent 6cdb9ad167
commit e3bfe8c59e
15 changed files with 42 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
extflat/EFbuild.c
View File

@ -463,7 +463,7 @@ efBuildDist(def, driver, receiver, min, max)
#endif /* notdef */ #endif /* notdef */
he = HashFind(&def->def_dists, (char *) &distKey); he = HashFind(&def->def_dists, (char *) &distKey);
if (dist = (Distance *) HashGetValue(he)) if ((dist = (Distance *) HashGetValue(he)))
{ {
/* /*
* There was already an entry in the table; update it * There was already an entry in the table; update it
@ -659,7 +659,7 @@ efBuildEquiv(def, nodeName1, nodeName2, resist, isspice)
* node that was just removed. * node that was just removed.
*/ */
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&def->def_devs, &hs)) while ((he = HashNext(&def->def_devs, &hs)))
{ {
Dev *dev; Dev *dev;
int n; int n;
@ -679,7 +679,7 @@ efBuildEquiv(def, nodeName1, nodeName2, resist, isspice)
{ {
nn2->efnn_refc += nn1->efnn_refc + 1; nn2->efnn_refc += nn1->efnn_refc + 1;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he1 = HashNext(&def->def_nodes, &hs)) while ((he1 = HashNext(&def->def_nodes, &hs)))
if ((EFNodeName *)HashGetValue(he1) == nn1) if ((EFNodeName *)HashGetValue(he1) == nn1)
HashSetValue(he1, (char *)nn2); HashSetValue(he1, (char *)nn2);
} }
@ -687,7 +687,7 @@ efBuildEquiv(def, nodeName1, nodeName2, resist, isspice)
{ {
nn1->efnn_refc += nn2->efnn_refc + 1; nn1->efnn_refc += nn2->efnn_refc + 1;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he2 = HashNext(&def->def_nodes, &hs)) while ((he2 = HashNext(&def->def_nodes, &hs)))
if ((EFNodeName *)HashGetValue(he2) == nn2) if ((EFNodeName *)HashGetValue(he2) == nn2)
HashSetValue(he2, (char *)nn1); HashSetValue(he2, (char *)nn1);
} }
@ -1757,7 +1757,7 @@ again:
*dstp++ = ']'; *dstp++ = ']';
/* Copy remainder of path */ /* Copy remainder of path */
while (*dstp++ = *cp++) while ((*dstp++ = *cp++))
/* Nothing */; /* Nothing */;
cnp->cn_name = StrDup((char **) NULL, newname); cnp->cn_name = StrDup((char **) NULL, newname);
@ -1970,7 +1970,7 @@ efNodeMerge(node1ptr, node2ptr)
keeping->efnode_num += removing->efnode_num; keeping->efnode_num += removing->efnode_num;
/* Merge attribute lists */ /* Merge attribute lists */
if (ap = removing->efnode_attrs) if ((ap = removing->efnode_attrs))
{ {
while (ap->efa_next) while (ap->efa_next)
ap = ap->efa_next; ap = ap->efa_next;
@ -2059,8 +2059,8 @@ efFreeUseTable(table)
EFNodeName *nn; EFNodeName *nn;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(table, &hs)) while ((he = HashNext(table, &hs)))
if (use = (Use *) HashGetValue(he)) if ((use = (Use *) HashGetValue(he)))
{ {
if (use->use_id != NULL) freeMagic((char *)use->use_id); if (use->use_id != NULL) freeMagic((char *)use->use_id);
freeMagic(use); freeMagic(use);
@ -2088,7 +2088,7 @@ efFreeDevTable(table)
int n; int n;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(table, &hs)) while ((he = HashNext(table, &hs)))
{ {
dev = (Dev *)HashGetValue(he); dev = (Dev *)HashGetValue(he);
for (n = 0; n < (int)dev->dev_nterm; n++) for (n = 0; n < (int)dev->dev_nterm; n++)
@ -2131,8 +2131,8 @@ efFreeNodeTable(table)
EFNodeName *nn; EFNodeName *nn;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(table, &hs)) while ((he = HashNext(table, &hs)))
if (nn = (EFNodeName *) HashGetValue(he)) if ((nn = (EFNodeName *) HashGetValue(he)))
{ {
for (hn = nn->efnn_hier; hn; hn = hn->hn_parent) for (hn = nn->efnn_hier; hn; hn = hn->hn_parent)
(void) HashFind(&efFreeHashTable, (char *) hn); (void) HashFind(&efFreeHashTable, (char *) hn);

2
extflat/EFread.c
View File

@ -670,7 +670,7 @@ resistChanged:
/* Read in each def that has not yet been read in */ /* Read in each def that has not yet been read in */
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&def->def_uses, &hs)) while ((he = HashNext(&def->def_uses, &hs)))
{ {
use = (Use *)HashGetValue(he); use = (Use *)HashGetValue(he);
if ((use->use_def->def_flags & DEF_AVAILABLE) == 0) if ((use->use_def->def_flags & DEF_AVAILABLE) == 0)

4
extract/ExtArray.c
View File

@ -690,7 +690,7 @@ extArrayAdjust(ha, et1, et2)
extHierAdjustments(ha, &ha->ha_cumFlat, et2, et2); extHierAdjustments(ha, &ha->ha_cumFlat, et2, et2);
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&ha->ha_cumFlat.et_coupleHash, &hs)) while ((he = HashNext(&ha->ha_cumFlat.et_coupleHash, &hs)))
{ {
cap = extGetCapValue(he) / ExtCurStyle->exts_capScale; cap = extGetCapValue(he) / ExtCurStyle->exts_capScale;
if (cap == 0) if (cap == 0)
@ -797,7 +797,7 @@ extArrayTileToNode(tp, pNum, et, ha, doHard)
} }
if (!DebugIsSet(extDebugID, extDebNoHard)) if (!DebugIsSet(extDebugID, extDebNoHard))
if (reg = (LabRegion *) extArrayHardNode(tp, pNum, def, ha)) if ((reg = (LabRegion *) extArrayHardNode(tp, pNum, def, ha)))
goto found; goto found;
/* Blew it */ /* Blew it */

6
extract/ExtBasic.c
View File

@ -4566,7 +4566,7 @@ extNodeAreaFunc(tile, arg)
} }
/* Compute the resistance for the previous region */ /* Compute the resistance for the previous region */
if (old = (NodeRegion *) arg->fra_region) if ((old = (NodeRegion *) arg->fra_region))
if (ExtOptions & EXT_DORESISTANCE) if (ExtOptions & EXT_DORESISTANCE)
extSetResist(old); extSetResist(old);
@ -4946,7 +4946,7 @@ donesides:
* 1-lambda halo to find everything it overlaps or touches * 1-lambda halo to find everything it overlaps or touches
* on the other plane. * on the other plane.
*/ */
if (pMask = DBAllConnPlanes[type]) if ((pMask = DBAllConnPlanes[type]))
{ {
Rect biggerArea; Rect biggerArea;
bool is_split = IsSplit(tile); bool is_split = IsSplit(tile);
@ -5029,7 +5029,7 @@ extCapHashKill(ht)
HashEntry *he; HashEntry *he;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(ht, &hs)) while ((he = HashNext(ht, &hs)))
{ {
if (HashGetValue(he) != NULL) if (HashGetValue(he) != NULL)
{ {

2
extract/ExtCell.c
View File

@ -215,7 +215,7 @@ extFileOpen(def, file, mode, prealfile)
name = def->cd_file; name = def->cd_file;
ends = strrchr(def->cd_file, '/'); ends = strrchr(def->cd_file, '/');
if (ends == NULL) ends = def->cd_file; if (ends == NULL) ends = def->cd_file;
if (endp = strrchr(ends + 1, '.')) if ((endp = strrchr(ends + 1, '.')))
{ {
name = namebuf; name = namebuf;
len = endp - def->cd_file; len = endp - def->cd_file;

6
extract/ExtCouple.c
View File

@ -219,7 +219,7 @@ extRelocateSubstrateCoupling(table, subsnode)
NodeRegion *rbp; NodeRegion *rbp;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(table, &hs)) while ((he = HashNext(table, &hs)))
{ {
cap = extGetCapValue(he); cap = extGetCapValue(he);
if (cap == 0) continue; if (cap == 0) continue;
@ -275,7 +275,7 @@ extOutputCoupling(table, outFile)
CapValue cap; /* value of capacitance. */ CapValue cap; /* value of capacitance. */
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(table, &hs)) while ((he = HashNext(table, &hs)))
{ {
cap = extGetCapValue(he) / ExtCurStyle->exts_capScale; cap = extGetCapValue(he) / ExtCurStyle->exts_capScale;
if (cap == 0) if (cap == 0)
@ -464,7 +464,7 @@ extAddOverlap(tbelow, ecpls)
* Deduct the area shielded from the area of the overlap, so we adjust * Deduct the area shielded from the area of the overlap, so we adjust
* the overlap capacitance correspondingly. * the overlap capacitance correspondingly.
*/ */
if (ov.o_pmask = ExtCurStyle->exts_overlapShieldPlanes[ta][tb]) if ((ov.o_pmask = ExtCurStyle->exts_overlapShieldPlanes[ta][tb]))
{ {
ov.o_tmask = ExtCurStyle->exts_overlapShieldTypes[ta][tb]; ov.o_tmask = ExtCurStyle->exts_overlapShieldTypes[ta][tb];
for (pNum = PL_TECHDEPBASE; pNum < DBNumPlanes; pNum++) for (pNum = PL_TECHDEPBASE; pNum < DBNumPlanes; pNum++)

4
extract/ExtHard.c
View File

@ -376,7 +376,7 @@ extHardSetLabel(scx, reg, arg)
do { *dstp++ = *srcp++; } while (--prefixlen > 0); do { *dstp++ = *srcp++; } while (--prefixlen > 0);
} }
srcp = text; srcp = text;
while (*dstp++ = *srcp++) /* Nothing */; while ((*dstp++ = *srcp++)) /* Nothing */;
arg->hw_label = newlab; arg->hw_label = newlab;
if (DebugIsSet(extDebugID, extDebHardWay)) if (DebugIsSet(extDebugID, extDebHardWay))
@ -455,7 +455,7 @@ extHardGenerateLabel(scx, reg, arg)
do { *dstp++ = *srcp++; } while (--prefixlen > 0); do { *dstp++ = *srcp++; } while (--prefixlen > 0);
} }
srcp = gen; srcp = gen;
while (*dstp++ = *srcp++) /* Nothing */; while ((*dstp++ = *srcp++)) /* Nothing */;
arg->hw_label = newlab; arg->hw_label = newlab;
if (DebugIsSet(extDebugID, extDebHardWay)) if (DebugIsSet(extDebugID, extDebHardWay))
TxPrintf("Hard way: generated label = \"%s\"\n", newlab->lab_text); TxPrintf("Hard way: generated label = \"%s\"\n", newlab->lab_text);

10
extract/ExtHier.c
View File

@ -737,7 +737,7 @@ extHierAdjustments(ha, cumFlat, oneFlat, lookFlat)
if (ExtOptions & EXT_DOCOUPLING) if (ExtOptions & EXT_DOCOUPLING)
{ {
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&oneFlat->et_coupleHash, &hs)) while ((he = HashNext(&oneFlat->et_coupleHash, &hs)))
{ {
ckpOne = ((CoupleKey *) he->h_key.h_words); ckpOne = ((CoupleKey *) he->h_key.h_words);
@ -828,7 +828,7 @@ extOutputConns(table, outf)
HashEntry *he; HashEntry *he;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(table, &hs)) while ((he = HashNext(table, &hs)))
{ {
nfirst = (NodeName *) HashGetValue(he); nfirst = (NodeName *) HashGetValue(he);
@ -838,7 +838,7 @@ extOutputConns(table, outf)
* for a node appearing earlier in the table. If so, we need * for a node appearing earlier in the table. If so, we need
* only free the NodeName without any further processing. * only free the NodeName without any further processing.
*/ */
if (node = nfirst->nn_node) if ((node = nfirst->nn_node))
{ {
/* /*
* If there are N names for this node, output N-1 merge lines. * If there are N names for this node, output N-1 merge lines.
@ -848,7 +848,7 @@ extOutputConns(table, outf)
/* Note 3/1/2017: Cap value no longer used */ /* Note 3/1/2017: Cap value no longer used */
c = (node->node_cap) / ExtCurStyle->exts_capScale; c = (node->node_cap) / ExtCurStyle->exts_capScale;
nn = node->node_names; nn = node->node_names;
if (nnext = nn->nn_next) if ((nnext = nn->nn_next))
{ {
/* First merge */ /* First merge */
fprintf(outf, "merge \"%s\" \"%s\" %lg", fprintf(outf, "merge \"%s\" \"%s\" %lg",
@ -862,7 +862,7 @@ extOutputConns(table, outf)
nn->nn_node = (Node *) NULL; /* Processed */ nn->nn_node = (Node *) NULL; /* Processed */
/* Subsequent merges */ /* Subsequent merges */
for (nn = nnext; nnext = nn->nn_next; nn = nnext) for (nn = nnext; (nnext = nn->nn_next); nn = nnext)
{ {
fprintf(outf, "merge \"%s\" \"%s\"\n", fprintf(outf, "merge \"%s\" \"%s\"\n",
nn->nn_name, nnext->nn_name); nn->nn_name, nnext->nn_name);

6
extract/ExtLength.c
View File

@ -261,7 +261,7 @@ extLength(rootUse, f)
* be from a single cell. * be from a single cell.
*/ */
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&extDriverHash, &hs)) while ((he = HashNext(&extDriverHash, &hs)))
{ {
dList = extPathLabel(rootUse, he->h_key.h_name); dList = extPathLabel(rootUse, he->h_key.h_name);
HashSetValue(he, (ClientData) dList); HashSetValue(he, (ClientData) dList);
@ -273,7 +273,7 @@ extLength(rootUse, f)
* then compute and output the distance to each. * then compute and output the distance to each.
*/ */
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&extDriverHash, &hs)) while ((he = HashNext(&extDriverHash, &hs)))
{ {
/* Ignore drivers whose labels couldn't be found */ /* Ignore drivers whose labels couldn't be found */
dList = (Label *) HashGetValue(he); dList = (Label *) HashGetValue(he);
@ -875,7 +875,7 @@ extPathFlood(tile, p, distance, epa)
* 1-lambda halo to find everything it overlaps or touches * 1-lambda halo to find everything it overlaps or touches
* on the other plane. * on the other plane.
*/ */
if (pMask = DBAllConnPlanes[type]) if ((pMask = DBAllConnPlanes[type]))
{ {
int saveplane = epa->epa_pNum; int saveplane = epa->epa_pNum;
struct extPathFloodArg epfa; struct extPathFloodArg epfa;

4
extract/ExtMain.c
View File

@ -496,7 +496,7 @@ ExtUnique(rootUse, option)
/* Now process all the cells we just found */ /* Now process all the cells we just found */
nwarn = 0; nwarn = 0;
while (def = (CellDef *) StackPop(extDefStack)) while ((def = (CellDef *) StackPop(extDefStack)))
{ {
/* EXT_UNIQ_NOTOPPORTS: Use EXT_UNIQ_ALL on all cells other than the top */ /* EXT_UNIQ_NOTOPPORTS: Use EXT_UNIQ_ALL on all cells other than the top */
if ((option == EXT_UNIQ_NOTOPPORTS) && if ((option == EXT_UNIQ_NOTOPPORTS) &&
@ -967,7 +967,7 @@ extExtractStack(stack, doExtract, rootDef)
CellDef *def; CellDef *def;
struct saveList *newsl, *sl = (struct saveList *)NULL; struct saveList *newsl, *sl = (struct saveList *)NULL;
while (def = (CellDef *) StackPop(stack)) while ((def = (CellDef *) StackPop(stack)))
{ {
def->cd_client = (ClientData) 0; def->cd_client = (ClientData) 0;
if (!SigInterruptPending) if (!SigInterruptPending)

2
extract/ExtNghbors.c
View File

@ -295,7 +295,7 @@ donesides:
* 1-lambda halo to find everything it overlaps or touches * 1-lambda halo to find everything it overlaps or touches
* on the other plane. * on the other plane.
*/ */
if (pMask = DBAllConnPlanes[type]) if ((pMask = DBAllConnPlanes[type]))
{ {
TITORECT(tile, &pla.area); TITORECT(tile, &pla.area);
GEO_EXPAND(&pla.area, 1, &biggerArea); GEO_EXPAND(&pla.area, 1, &biggerArea);

2
extract/ExtSubtree.c
View File

@ -680,7 +680,7 @@ extSubtreeOutputCoupling(ha)
char *name; char *name;
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&ha->ha_cumFlat.et_coupleHash, &hs)) while ((he = HashNext(&ha->ha_cumFlat.et_coupleHash, &hs)))
{ {
cap = extGetCapValue(he) / ExtCurStyle->exts_capScale; cap = extGetCapValue(he) / ExtCurStyle->exts_capScale;
if (cap == 0) if (cap == 0)

4
extract/ExtTest.c
View File

@ -454,7 +454,7 @@ extShowTech(name)
out); out);
fprintf(out, "\n"); fprintf(out, "\n");
} }
if (e = ExtCurStyle->exts_sideCoupleCap[s][t]) if ((e = ExtCurStyle->exts_sideCoupleCap[s][t]))
for ( ; e; e = e->ec_next) for ( ; e; e = e->ec_next)
{ {
fprintf(out, " COUPLE: "); fprintf(out, " COUPLE: ");
@ -463,7 +463,7 @@ extShowTech(name)
extShowMask(&e->ec_far, out); extShowMask(&e->ec_far, out);
fprintf(out, ": %lf\n", e->ec_cap); fprintf(out, ": %lf\n", e->ec_cap);
} }
if (e = ExtCurStyle->exts_sideOverlapCap[s][t]) if ((e = ExtCurStyle->exts_sideOverlapCap[s][t]))
for ( ; e; e = e->ec_next) for ( ; e; e = e->ec_next)
{ {
fprintf(out, " OVERLAP: "); fprintf(out, " OVERLAP: ");

6
extract/ExtTimes.c
View File

@ -213,7 +213,7 @@ ExtTimes(rootUse, f)
*/ */
TxPrintf("Computing individual cell statistics:\n"); TxFlush(); TxPrintf("Computing individual cell statistics:\n"); TxFlush();
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&cellStatsTable, &hs)) while ((he = HashNext(&cellStatsTable, &hs)))
extTimesCellFunc((struct cellStats *) HashGetValue(he)); extTimesCellFunc((struct cellStats *) HashGetValue(he));
/* /*
@ -223,7 +223,7 @@ ExtTimes(rootUse, f)
*/ */
TxPrintf("Computing hierarchical and incremental statistics:\n"); TxFlush(); TxPrintf("Computing hierarchical and incremental statistics:\n"); TxFlush();
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&cellStatsTable, &hs)) while ((he = HashNext(&cellStatsTable, &hs)))
extTimesIncrFunc((struct cellStats *) HashGetValue(he)); extTimesIncrFunc((struct cellStats *) HashGetValue(he));
/* /*
@ -232,7 +232,7 @@ ExtTimes(rootUse, f)
*/ */
TxPrintf("Computing summary statistics:\n"); TxFlush(); TxPrintf("Computing summary statistics:\n"); TxFlush();
HashStartSearch(&hs); HashStartSearch(&hs);
while (he = HashNext(&cellStatsTable, &hs)) while ((he = HashNext(&cellStatsTable, &hs)))
{ {
extTimesSummaryFunc((struct cellStats *) HashGetValue(he), f); extTimesSummaryFunc((struct cellStats *) HashGetValue(he), f);
freeMagic((char *) HashGetValue(he)); freeMagic((char *) HashGetValue(he));

4
extract/ExtYank.c
View File

@ -233,9 +233,9 @@ extHierLabelFunc(scx, label, tpath, targetDef)
newlab->lab_flags = label->lab_flags; newlab->lab_flags = label->lab_flags;
newlab->lab_port = label->lab_port; newlab->lab_port = label->lab_port;
dstp = newlab->lab_text; dstp = newlab->lab_text;
for (srcp = tpath->tp_first; *dstp++ = *srcp++; ) for (srcp = tpath->tp_first; (*dstp++ = *srcp++); )
/* Nothing */; /* Nothing */;
for (--dstp, srcp = label->lab_text; *dstp++ = *srcp++; ) for (--dstp, srcp = label->lab_text; (*dstp++ = *srcp++); )
/* Nothing */; /* Nothing */;
newlab->lab_next = targetDef->cd_labels; newlab->lab_next = targetDef->cd_labels;