/*
- * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
+ * Copyright (c) 2000-2006 Apple Computer, Inc. All rights reserved.
+ *
+ * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
*
- * @APPLE_LICENSE_HEADER_START@
- *
- * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
- *
* This file contains Original Code and/or Modifications of Original Code
* as defined in and that are subject to the Apple Public Source License
* Version 2.0 (the 'License'). You may not use this file except in
- * compliance with the License. Please obtain a copy of the License at
- * http://www.opensource.apple.com/apsl/ and read it before using this
- * file.
- *
+ * compliance with the License. The rights granted to you under the License
+ * may not be used to create, or enable the creation or redistribution of,
+ * unlawful or unlicensed copies of an Apple operating system, or to
+ * circumvent, violate, or enable the circumvention or violation of, any
+ * terms of an Apple operating system software license agreement.
+ *
+ * Please obtain a copy of the License at
+ * http://www.opensource.apple.com/apsl/ and read it before using this file.
+ *
* The Original Code and all software distributed under the License are
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
* Please see the License for the specific language governing rights and
* limitations under the License.
- *
- * @APPLE_LICENSE_HEADER_END@
+ *
+ * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
*/
/* Copyright (c) 1997 Apple Computer, Inc. All Rights Reserved */
/*
*
*/
-#ifdef NeXT
/*
* We use the NetBSD based clist system, it is much more efficient than the
* old style clist stuff used by free bsd.
#include <sys/param.h>
#include <sys/systm.h>
-#include <sys/buf.h>
#include <sys/ioctl.h>
#include <sys/tty.h>
#include <sys/malloc.h>
-#include <machine/spl.h>
/*
* At compile time, choose:
* defined we allocate an array of bits -- 1/8th as much memory but
* setbit(), clrbit(), and isset() take more cpu. If QBITS is
* undefined, we just use an array of bytes.
- *
+ *
* If TTY_QUOTE functionality isn't required by a line discipline,
* it can free c_cq and set it to NULL. This speeds things up,
* and also does not use any extra memory. This is useful for (say)
#define QBITS
#ifdef QBITS
-#define QMEM(n) ((((n)-1)/NBBY)+1)
+#define QMEM(n) ((((n)-1)/NBBY)+1)
#else
-#define QMEM(n) (n)
+#define QMEM(n) (n)
#endif
* Initialize clists.
*/
void
-cinit()
+cinit(void)
{
}
* of the specified length, with/without quoting support.
*/
int
-clalloc(clp, size, quot)
- struct clist *clp;
- int size;
- int quot;
+clalloc(struct clist *clp, int size, int quot)
{
-
MALLOC_ZONE(clp->c_cs, u_char *, size, M_TTYS, M_WAITOK);
- if (!clp->c_cs)
- return (-1);
+ if (!clp->c_cs) {
+ return -1;
+ }
bzero(clp->c_cs, size);
- if(quot) {
+ if (quot) {
MALLOC_ZONE(clp->c_cq, u_char *, QMEM(size), M_TTYS, M_WAITOK);
if (!clp->c_cq) {
FREE_ZONE(clp->c_cs, size, M_TTYS);
- return (-1);
+ return -1;
}
bzero(clp->c_cs, QMEM(size));
- } else
+ } else {
clp->c_cq = (u_char *)0;
+ }
clp->c_cf = clp->c_cl = (u_char *)0;
clp->c_ce = clp->c_cs + size;
clp->c_cn = size;
clp->c_cc = 0;
- return (0);
+ return 0;
}
void
-clfree(clp)
- struct clist *clp;
+clfree(struct clist *clp)
{
- if(clp->c_cs)
+ if (clp->c_cs) {
FREE_ZONE(clp->c_cs, clp->c_cn, M_TTYS);
- if(clp->c_cq)
+ }
+ if (clp->c_cq) {
FREE_ZONE(clp->c_cq, QMEM(clp->c_cn), M_TTYS);
+ }
clp->c_cs = clp->c_cq = (u_char *)0;
}
* Get a character from a clist.
*/
int
-getc(clp)
- struct clist *clp;
+getc(struct clist *clp)
{
- register int c = -1;
- int s;
+ int c = -1;
- s = spltty();
- if (clp->c_cc == 0)
+ if (clp->c_cc == 0) {
goto out;
+ }
c = *clp->c_cf & 0xff;
if (clp->c_cq) {
#ifdef QBITS
- if (isset(clp->c_cq, clp->c_cf - clp->c_cs) )
+ if (isset(clp->c_cq, clp->c_cf - clp->c_cs)) {
c |= TTY_QUOTE;
+ }
#else
- if (*(clp->c_cf - clp->c_cs + clp->c_cq))
+ if (*(clp->c_cf - clp->c_cs + clp->c_cq)) {
c |= TTY_QUOTE;
+ }
#endif
}
- if (++clp->c_cf == clp->c_ce)
+ if (++clp->c_cf == clp->c_ce) {
clp->c_cf = clp->c_cs;
- if (--clp->c_cc == 0)
+ }
+ if (--clp->c_cc == 0) {
clp->c_cf = clp->c_cl = (u_char *)0;
+ }
out:
- splx(s);
return c;
}
* Return number of bytes moved.
*/
int
-q_to_b(clp, cp, count)
- struct clist *clp;
- u_char *cp;
- int count;
+q_to_b(struct clist *clp, u_char *cp, int count)
{
- register int cc;
+ int cc;
u_char *p = cp;
- int s;
- s = spltty();
/* optimize this while loop */
while (count > 0 && clp->c_cc > 0) {
cc = clp->c_cl - clp->c_cf;
- if (clp->c_cf >= clp->c_cl)
+ if (clp->c_cf >= clp->c_cl) {
cc = clp->c_ce - clp->c_cf;
- if (cc > count)
+ }
+ if (cc > count) {
cc = count;
+ }
bcopy(clp->c_cf, p, cc);
count -= cc;
p += cc;
clp->c_cc -= cc;
clp->c_cf += cc;
- if (clp->c_cf == clp->c_ce)
+ if (clp->c_cf == clp->c_ce) {
clp->c_cf = clp->c_cs;
+ }
}
- if (clp->c_cc == 0)
+ if (clp->c_cc == 0) {
clp->c_cf = clp->c_cl = (u_char *)0;
- splx(s);
+ }
return p - cp;
}
* Stop counting if flag&character is non-null.
*/
int
-ndqb(clp, flag)
- struct clist *clp;
- int flag;
+ndqb(struct clist *clp, int flag)
{
int count = 0;
- register int i;
- register int cc;
- int s;
+ int i;
+ int cc;
- s = spltty();
- if ((cc = clp->c_cc) == 0)
+ if ((cc = clp->c_cc) == 0) {
goto out;
+ }
if (flag == 0) {
count = clp->c_cl - clp->c_cf;
- if (count <= 0)
+ if (count <= 0) {
count = clp->c_ce - clp->c_cf;
+ }
goto out;
}
while (cc-- > 0 && !(clp->c_cs[i++] & (flag & ~TTY_QUOTE) ||
isset(clp->c_cq, i))) {
count++;
- if (i == clp->c_cn)
+ if (i == clp->c_cn) {
break;
+ }
}
} else {
while (cc-- > 0 && !(clp->c_cs[i++] & flag)) {
count++;
- if (i == clp->c_cn)
+ if (i == clp->c_cn) {
break;
+ }
}
}
out:
- splx(s);
return count;
}
* Flush count bytes from clist.
*/
void
-ndflush(clp, count)
- struct clist *clp;
- int count;
+ndflush(struct clist *clp, int count)
{
- register int cc;
- int s;
+ int cc;
- s = spltty();
if (count == clp->c_cc) {
clp->c_cc = 0;
clp->c_cf = clp->c_cl = (u_char *)0;
- goto out;
+ return;
}
/* optimize this while loop */
while (count > 0 && clp->c_cc > 0) {
cc = clp->c_cl - clp->c_cf;
- if (clp->c_cf >= clp->c_cl)
+ if (clp->c_cf >= clp->c_cl) {
cc = clp->c_ce - clp->c_cf;
- if (cc > count)
+ }
+ if (cc > count) {
cc = count;
+ }
count -= cc;
clp->c_cc -= cc;
clp->c_cf += cc;
- if (clp->c_cf == clp->c_ce)
+ if (clp->c_cf == clp->c_ce) {
clp->c_cf = clp->c_cs;
+ }
}
- if (clp->c_cc == 0)
+ if (clp->c_cc == 0) {
clp->c_cf = clp->c_cl = (u_char *)0;
-out:
- splx(s);
+ }
}
/*
* Put a character into the output queue.
*/
int
-putc(c, clp)
- int c;
- struct clist *clp;
+putc(int c, struct clist *clp)
{
- register int i;
- int s;
+ int i;
- s = spltty();
if (clp->c_cc == 0) {
if (!clp->c_cs) {
#if DIAGNOSTIC
//printf("putc: required clalloc\n");
#endif
- if(clalloc(clp, 1024, 1)) {
+ if (clalloc(clp, 1024, 1)) {
out:
- splx(s);
return -1;
}
}
clp->c_cf = clp->c_cl = clp->c_cs;
}
- if (clp->c_cc == clp->c_cn)
+ if (clp->c_cc == clp->c_cn) {
goto out;
+ }
*clp->c_cl = c & 0xff;
i = clp->c_cl - clp->c_cs;
if (clp->c_cq) {
#ifdef QBITS
- if (c & TTY_QUOTE)
- setbit(clp->c_cq, i);
- else
+ if (c & TTY_QUOTE) {
+ setbit(clp->c_cq, i);
+ } else {
clrbit(clp->c_cq, i);
+ }
#else
q = clp->c_cq + i;
*q = (c & TTY_QUOTE) ? 1 : 0;
}
clp->c_cc++;
clp->c_cl++;
- if (clp->c_cl == clp->c_ce)
+ if (clp->c_cl == clp->c_ce) {
clp->c_cl = clp->c_cs;
- splx(s);
+ }
return 0;
}
* clrbit(cp, off + len);
*/
void
-clrbits(cp, off, len)
- u_char *cp;
- int off;
- int len;
+clrbits(u_char *cp, int off, int len)
{
int sby, sbi, eby, ebi;
- register int i;
+ int i;
u_char mask;
- if(len==1) {
+ if (len == 1) {
clrbit(cp, off);
return;
}
sby = off / NBBY;
sbi = off % NBBY;
- eby = (off+len) / NBBY;
- ebi = (off+len) % NBBY;
+ eby = (off + len) / NBBY;
+ ebi = (off + len) % NBBY;
if (sby == eby) {
mask = ((1 << (ebi - sbi)) - 1) << sbi;
cp[sby] &= ~mask;
} else {
- mask = (1<<sbi) - 1;
+ mask = (1 << sbi) - 1;
cp[sby++] &= mask;
- mask = (1<<ebi) - 1;
- cp[eby] &= ~mask;
+ mask = (1 << ebi) - 1;
+ /* handle remainder bits, if any, for a non-0 ebi value */
+ if (mask) {
+ cp[eby] &= ~mask;
+ }
- for (i = sby; i < eby; i++)
+ for (i = sby; i < eby; i++) {
cp[i] = 0x00;
+ }
}
}
#endif
* Return number of bytes not transfered.
*/
int
-b_to_q(cp, count, clp)
- u_char *cp;
- int count;
- struct clist *clp;
+b_to_q(const u_char *cp, int count, struct clist *clp)
{
- register int cc;
- register u_char *p = cp;
- int s;
+ int cc;
+ const u_char *p = cp;
- if (count <= 0)
+ if (count <= 0) {
return 0;
+ }
- s = spltty();
if (clp->c_cc == 0) {
if (!clp->c_cs) {
#if DIAGNOSTIC
printf("b_to_q: required clalloc\n");
#endif
- if(clalloc(clp, 1024, 1))
+ if (clalloc(clp, 1024, 1)) {
goto out;
+ }
}
clp->c_cf = clp->c_cl = clp->c_cs;
}
- if (clp->c_cc == clp->c_cn)
+ if (clp->c_cc == clp->c_cn) {
goto out;
+ }
/* optimize this while loop */
while (count > 0 && clp->c_cc < clp->c_cn) {
cc = clp->c_ce - clp->c_cl;
- if (clp->c_cf > clp->c_cl)
+ if (clp->c_cf > clp->c_cl) {
cc = clp->c_cf - clp->c_cl;
- if (cc > count)
+ }
+ if (cc > count) {
cc = count;
+ }
bcopy(p, clp->c_cl, cc);
if (clp->c_cq) {
#ifdef QBITS
count -= cc;
clp->c_cc += cc;
clp->c_cl += cc;
- if (clp->c_cl == clp->c_ce)
+ if (clp->c_cl == clp->c_ce) {
clp->c_cl = clp->c_cs;
+ }
}
out:
- splx(s);
return count;
}
* masked.
*/
u_char *
-nextc(clp, cp, c)
- struct clist *clp;
- register u_char *cp;
- int *c;
+nextc(struct clist *clp, u_char *cp, int *c)
{
-
if (clp->c_cf == cp) {
/*
* First time initialization.
*/
cc = clp->c_cc;
}
- if (cc == 0 || cp == NULL)
+ if (cc == 0 || cp == NULL) {
return NULL;
- if (--cc == 0)
+ }
+ if (--cc == 0) {
return NULL;
- if (++cp == clp->c_ce)
+ }
+ if (++cp == clp->c_ce) {
cp = clp->c_cs;
+ }
*c = *cp & 0xff;
if (clp->c_cq) {
#ifdef QBITS
- if (isset(clp->c_cq, cp - clp->c_cs))
+ if (isset(clp->c_cq, cp - clp->c_cs)) {
*c |= TTY_QUOTE;
+ }
#else
- if (*(clp->c_cf - clp->c_cs + clp->c_cq))
+ if (*(clp->c_cf - clp->c_cs + clp->c_cq)) {
*c |= TTY_QUOTE;
+ }
#endif
}
return cp;
* *c is set to the NEXT character
*/
u_char *
-firstc(clp, c)
- struct clist *clp;
- int *c;
+firstc(struct clist *clp, int *c)
{
- register u_char *cp;
+ u_char *cp;
cc = clp->c_cc;
- if (cc == 0)
+ if (cc == 0) {
return NULL;
+ }
cp = clp->c_cf;
*c = *cp & 0xff;
- if(clp->c_cq) {
+ if (clp->c_cq) {
#ifdef QBITS
- if (isset(clp->c_cq, cp - clp->c_cs))
+ if (isset(clp->c_cq, cp - clp->c_cs)) {
*c |= TTY_QUOTE;
+ }
#else
- if (*(cp - clp->c_cs + clp->c_cq))
+ if (*(cp - clp->c_cs + clp->c_cq)) {
*c |= TTY_QUOTE;
+ }
#endif
}
return clp->c_cf;
* Remove the last character in the clist and return it.
*/
int
-unputc(clp)
- struct clist *clp;
+unputc(struct clist *clp)
{
unsigned int c = -1;
- int s;
- s = spltty();
- if (clp->c_cc == 0)
+ if (clp->c_cc == 0) {
goto out;
+ }
- if (clp->c_cl == clp->c_cs)
+ if (clp->c_cl == clp->c_cs) {
clp->c_cl = clp->c_ce - 1;
- else
+ } else {
--clp->c_cl;
+ }
clp->c_cc--;
c = *clp->c_cl & 0xff;
if (clp->c_cq) {
#ifdef QBITS
- if (isset(clp->c_cq, clp->c_cl - clp->c_cs))
+ if (isset(clp->c_cq, clp->c_cl - clp->c_cs)) {
c |= TTY_QUOTE;
+ }
#else
- if (*(clp->c_cf - clp->c_cs + clp->c_cq))
+ if (*(clp->c_cf - clp->c_cs + clp->c_cq)) {
c |= TTY_QUOTE;
+ }
#endif
}
- if (clp->c_cc == 0)
+ if (clp->c_cc == 0) {
clp->c_cf = clp->c_cl = (u_char *)0;
+ }
out:
- splx(s);
return c;
}
* Put the chars in the from queue on the end of the to queue.
*/
void
-catq(from, to)
- struct clist *from, *to;
+catq(struct clist *from, struct clist *to)
{
int c;
- while ((c = getc(from)) != -1)
+ while ((c = getc(from)) != -1) {
putc(c, to);
+ }
}
-
-#endif /* NeXT */
projects / apple / xnu.git / blobdiff