clist
} clist[] = {
for (cp = &clist[0]; cp->name; cp++)
struct clist *cl;
struct clist q;
struct clist sc_q;
struct clist tq;
struct clist *qp;
struct clist tq;
q_to_b(struct clist *clp, u_char *cp, int count)
ndqb(struct clist *clp, int flag)
ndflush(struct clist *clp, int count)
putc(int c, struct clist *clp)
b_to_q(u_char *cp, int count, struct clist *clp)
nextc(struct clist *clp, u_char *cp, int *c, int *ccp)
firstc(struct clist *clp, int *c, int *ccp)
unputc(struct clist *clp)
catq(struct clist *from, struct clist *to)
struct clist tmp;
clalloc(struct clist *clp, int size, int quot)
clfree(struct clist *clp)
getc(struct clist *clp)
struct clist t_rawq; /* Device raw input queue. */
struct clist t_canq; /* Device canonical queue. */
struct clist t_outq; /* Device output queue. */
int b_to_q(u_char *cp, int cc, struct clist *q);
void catq(struct clist *from, struct clist *to);
int getc(struct clist *q);
void ndflush(struct clist *q, int cc);
int ndqb(struct clist *q, int flag);
u_char *firstc(struct clist *clp, int *c, int *cc);
u_char *nextc(struct clist *q, u_char *cp, int *c, int *cc);
int putc(int c, struct clist *q);
int q_to_b(struct clist *q, u_char *cp, int cc);
int unputc(struct clist *q);
void clalloc(struct clist *, int, int);
void clfree(struct clist *);
static struct cand *clist; /* merely a free storage pot for candidates */
clist = xcalloc(clistlen, sizeof(*clist));
free(clist);
if (y <= clist[oldc].y)
if (clist[c[l]].y <= y)
clist = xreallocarray(clist, clistlen, sizeof(*clist));
q = clist + clen;
if (clist[c[k]].y < y) /* quick look for typical case */
t = clist[c[l]].y;
for (q = clist + p; q->y != 0; q = clist + q->pred)
static struct cand *clist; /* merely a free storage pot for candidates */
clist = xcalloc(clistlen, sizeof(*clist));
free(clist);
if (y <= clist[oldc].y)
if (clist[c[l]].y <= y)
clist = xreallocarray(clist, clistlen, sizeof(*clist));
q = clist + clen;
if (clist[c[k]].y < y) /* quick look for typical case */
t = clist[c[l]].y;
for (q = clist + p; q->y != 0; q = clist + q->pred)
static struct cand *clist; /* merely a free storage pot for candidates */
clist = xcalloc(clistlen, sizeof(*clist));
free(clist);
if (y <= clist[oldc].y)
if (clist[c[l]].y <= y)
clist = xreallocarray(clist, clistlen, sizeof(*clist));
q = clist + clen;
if (clist[c[k]].y < y) /* quick look for typical case */
t = clist[c[l]].y;
for (q = clist + p; q->y != 0; q = clist + q->pred)