- struct io *io;
- int len;
- s_char *ptr;
- int avail;
-
- /* determine if any space is left */
- io = (struct io *)ioq->list.queue.q_back;
- avail = io->size - io->nbytes;
- if (avail > 0) {
- /* append to existing buffer */
- len = cc > avail ? avail : cc;
- bcopy(buf, io->data + io->nbytes, len);
- io->nbytes += len;
- ioq->cc += len;
- if (avail < cc)
- appendcc(ioq, buf + len, cc - len);
- } else {
- /* create a new buffer, minimum bufsize bytes */
- len = cc > ioq->bufsize ? cc : ioq->bufsize;
- ptr = malloc(len);
- bcopy(buf, ptr, cc);
- io = (struct io *) malloc(sizeof(struct io));
- io->nbytes = cc;
- io->size = len;
- io->offset = 0;
- io->data = ptr;
- emp_insque(&io->queue, ioq->list.queue.q_back);
- ioq->cc += cc;
- }
- return cc;
+ struct io *io;
+ int len;
+ s_char *ptr;
+ int avail;
+
+ /* determine if any space is left */
+ io = (struct io *)ioq->list.queue.q_back;
+ avail = io->size - io->nbytes;
+ if (avail > 0) {
+ /* append to existing buffer */
+ len = cc > avail ? avail : cc;
+ bcopy(buf, io->data + io->nbytes, len);
+ io->nbytes += len;
+ ioq->cc += len;
+ if (avail < cc)
+ appendcc(ioq, buf + len, cc - len);
+ } else {
+ /* create a new buffer, minimum bufsize bytes */
+ len = cc > ioq->bufsize ? cc : ioq->bufsize;
+ ptr = malloc(len);
+ bcopy(buf, ptr, cc);
+ io = (struct io *)malloc(sizeof(struct io));
+ io->nbytes = cc;
+ io->size = len;
+ io->offset = 0;
+ io->data = ptr;
+ emp_insque(&io->queue, ioq->list.queue.q_back);
+ ioq->cc += cc;
+ }
+ return cc;