other. Ensure headers in include/ can be included in any order (except for econfig-spec.h, which is special). New header types.h to help avoid inclusion cycles. Sort include directives. Remove some superflous includes.
232 lines
4.7 KiB
C
232 lines
4.7 KiB
C
/*
|
|
* Empire - A multi-player, client/server Internet based war game.
|
|
* Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
|
|
* Ken Stevens, Steve McClure
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
* ---
|
|
*
|
|
* See files README, COPYING and CREDITS in the root of the source
|
|
* tree for related information and legal notices. It is expected
|
|
* that future projects/authors will amend these files as needed.
|
|
*
|
|
* ---
|
|
*
|
|
* ioqueue.c: Manage an i/o queue
|
|
*
|
|
* Known contributors to this file:
|
|
* Steve McClure, 1998
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "ioqueue.h"
|
|
#include "misc.h"
|
|
#include "queue.h"
|
|
|
|
static int ioqtobuf(struct ioqueue *ioq, char *buf, int cc);
|
|
static void enqueuecc(struct ioqueue *ioq, char *buf, int cc);
|
|
static int dequeuecc(struct ioqueue *ioq, int cc);
|
|
|
|
|
|
void
|
|
ioq_init(struct ioqueue *ioq, int bsize)
|
|
{
|
|
initque(&ioq->queue);
|
|
ioq->cc = 0;
|
|
ioq->bsize = bsize;
|
|
}
|
|
|
|
/*
|
|
* Copy the specified number of characters into the buffer
|
|
* provided, without actually dequeueing the data. Return
|
|
* number of bytes actually found.
|
|
*/
|
|
int
|
|
ioq_peek(struct ioqueue *ioq, char *buf, int cc)
|
|
{
|
|
return ioqtobuf(ioq, buf, cc);
|
|
}
|
|
|
|
int
|
|
ioq_dequeue(struct ioqueue *ioq, int cc)
|
|
{
|
|
if (dequeuecc(ioq, cc) != cc)
|
|
return 0;
|
|
return cc;
|
|
}
|
|
|
|
int
|
|
ioq_read(struct ioqueue *ioq, char *buf, int cc)
|
|
{
|
|
int n;
|
|
|
|
n = ioqtobuf(ioq, buf, cc);
|
|
if (n > 0)
|
|
dequeuecc(ioq, n);
|
|
return n;
|
|
}
|
|
|
|
void
|
|
ioq_write(struct ioqueue *ioq, char *buf, int cc)
|
|
{
|
|
enqueuecc(ioq, buf, cc);
|
|
}
|
|
|
|
int
|
|
ioq_qsize(struct ioqueue *ioq)
|
|
{
|
|
return ioq->cc;
|
|
}
|
|
|
|
void
|
|
ioq_drain(struct ioqueue *ioq)
|
|
{
|
|
struct io *io;
|
|
struct qelem *qp;
|
|
|
|
while ((qp = ioq->queue.q_forw) != &ioq->queue) {
|
|
io = (struct io *)qp;
|
|
free(io->data);
|
|
(void)remque(&io->queue);
|
|
(void)free(io);
|
|
}
|
|
ioq->cc = 0;
|
|
}
|
|
|
|
char *
|
|
ioq_gets(struct ioqueue *ioq, char *buf, int cc, int *eol)
|
|
{
|
|
char *p;
|
|
char *end;
|
|
int nbytes;
|
|
|
|
*eol = 0;
|
|
|
|
cc--;
|
|
|
|
nbytes = ioqtobuf(ioq, buf, cc);
|
|
end = &buf[nbytes];
|
|
for (p = buf; p < end && *p; p++) {
|
|
if (*p == '\n') {
|
|
*++p = '\0';
|
|
*eol = 1;
|
|
dequeuecc(ioq, p - buf);
|
|
return buf;
|
|
}
|
|
}
|
|
if (cc && (p - buf) == cc) {
|
|
dequeuecc(ioq, cc);
|
|
buf[cc] = '\0';
|
|
return buf;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* all the rest are local to this module
|
|
*/
|
|
|
|
|
|
/*
|
|
* copy cc bytes from ioq to buf.
|
|
* this routine doesn't free memory; this is
|
|
* left for a higher level.
|
|
*/
|
|
static int
|
|
ioqtobuf(struct ioqueue *ioq, char *buf, int cc)
|
|
{
|
|
struct io *io;
|
|
struct qelem *qp;
|
|
char *offset;
|
|
int nbytes;
|
|
int nleft;
|
|
|
|
nleft = cc;
|
|
offset = buf;
|
|
for (qp = ioq->queue.q_forw; qp != &ioq->queue; qp = qp->q_forw) {
|
|
io = (struct io *)qp;
|
|
if ((nbytes = io->nbytes - io->offset) < 0) {
|
|
fprintf(stderr, "ioqtobuf: offset %d nbytes %d\n",
|
|
io->offset, io->nbytes);
|
|
continue;
|
|
}
|
|
if (nbytes > 0) {
|
|
if (nleft < nbytes)
|
|
nbytes = nleft;
|
|
memcpy(offset, io->data + io->offset, nbytes);
|
|
offset += nbytes;
|
|
nleft -= nbytes;
|
|
}
|
|
}
|
|
return offset - buf;
|
|
}
|
|
|
|
/*
|
|
* append a buffer to the end of the ioq.
|
|
*/
|
|
static void
|
|
enqueuecc(struct ioqueue *ioq, char *buf, int cc)
|
|
{
|
|
struct io *io;
|
|
|
|
io = malloc(sizeof(*io));
|
|
io->nbytes = cc;
|
|
io->offset = 0;
|
|
io->data = buf;
|
|
insque(&io->queue, ioq->queue.q_back);
|
|
ioq->cc += cc;
|
|
}
|
|
|
|
/*
|
|
* remove cc bytes from ioqueue ioq
|
|
* free memory, dequeue io elements
|
|
* which are no longer used.
|
|
*/
|
|
static int
|
|
dequeuecc(struct ioqueue *ioq, int cc)
|
|
{
|
|
struct io *io;
|
|
struct qelem *qp;
|
|
int nbytes;
|
|
int there;
|
|
|
|
nbytes = 0;
|
|
while ((qp = ioq->queue.q_forw) != &ioq->queue) {
|
|
io = (struct io *)qp;
|
|
there = io->nbytes - io->offset;
|
|
if (there < 0) {
|
|
fprintf(stderr, "dequeuecc: nbytes %d, offset %d\n",
|
|
io->nbytes, io->offset);
|
|
continue;
|
|
}
|
|
if (cc > there) {
|
|
cc -= there;
|
|
nbytes += there;
|
|
(void)remque(&io->queue);
|
|
free(io->data);
|
|
} else {
|
|
io->offset += cc;
|
|
nbytes += cc;
|
|
break;
|
|
}
|
|
}
|
|
ioq->cc -= nbytes;
|
|
return nbytes;
|
|
}
|