1
0
Files
2022-09-29 17:59:04 +03:00

102 lines
2.3 KiB
C

/* Copyright (c) 1990, 1991 UNIX System Laboratories, Inc. */
/* Copyright (c) 1988 AT&T */
/* All Rights Reserved */
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF */
/* UNIX System Laboratories, Inc. */
/* The copyright notice above does not evidence any */
/* actual or intended publication of such source code. */
/* #ident "@(#)sccs:lib/comobj/dolist.c 6.3" */
#ident "$Revision: 1.5 $"
# include "../../hdr/defines.h"
static char br[] = "bad range (co12)";
static char *getasid();
void
dolist(pkt,list,ch)
struct packet *pkt;
register char *list;
char ch;
{
void enter();
int sidtoser(), fatal();
struct sid lowsid, highsid, sid;
int n;
while (*list) {
list = getasid(list,&lowsid);
if (*list == '-') {
++list;
list = getasid(list,&highsid);
if (lowsid.s_br == 0) {
if ((highsid.s_br || highsid.s_seq ||
highsid.s_rel < lowsid.s_rel ||
(highsid.s_rel == lowsid.s_rel &&
highsid.s_lev < lowsid.s_lev)))
fatal(br);
sid.s_br = sid.s_seq = 0;
for (sid.s_rel = lowsid.s_rel; sid.s_rel <= highsid.s_rel; sid.s_rel++) {
sid.s_lev = (sid.s_rel == lowsid.s_rel ? lowsid.s_lev : 1);
if (lowsid.s_rel == highsid.s_rel){
while ((sid.s_lev <= highsid.s_lev) && (n = sidtoser(&sid, pkt))){
enter(pkt, ch, n, &sid);
sid.s_lev++;
}
}
else {
for ( ; n = sidtoser(&sid,pkt); sid.s_lev++)
enter(pkt,ch,n,&sid);
}
}
}
else {
if (!(highsid.s_rel == lowsid.s_rel &&
highsid.s_lev == lowsid.s_lev &&
highsid.s_br == lowsid.s_br &&
highsid.s_seq >= lowsid.s_seq))
fatal(br);
for (; lowsid.s_seq <= highsid.s_seq &&
(n = sidtoser(&lowsid,pkt)); lowsid.s_seq++)
enter(pkt,ch,n,&lowsid);
}
}
else {
if (n = sidtoser(&lowsid,pkt))
enter(pkt,ch,n,&lowsid);
}
if (*list == ',')
++list;
}
}
static char dls[] = "delta list syntax (co13)";
static char *
getasid(p,sp)
register char *p;
register struct sid *sp;
{
register char *old;
char *sid_ab();
p = sid_ab(old = p,sp);
if (old == p || sp->s_rel == 0)
fatal(dls);
if (sp->s_lev == 0) {
sp->s_lev = MAX;
if (sp->s_br || sp->s_seq)
fatal(dls);
}
else if (sp->s_br) {
if (sp->s_seq == 0)
sp->s_seq = MAX;
}
else if (sp->s_seq)
fatal(dls);
return(p);
}