/*
* thread to combine salvager child logs
* back into the main salvageserver log
*/
static void *
SalvageLogCleanupThread(void * arg)
{
struct log_cleanup_node * cleanup;
MUTEX_ENTER(&worker_lock);
while (1) {
while (queue_IsEmpty(&log_cleanup_queue)) {
CV_WAIT(&log_cleanup_queue.queue_change_cv, &worker_lock);
}
while (queue_IsNotEmpty(&log_cleanup_queue)) {
cleanup = queue_First(&log_cleanup_queue, log_cleanup_node);
queue_Remove(cleanup);
MUTEX_EXIT(&worker_lock);
SalvageLogCleanup(cleanup->pid);
free(cleanup);
MUTEX_ENTER(&worker_lock);
}
}
MUTEX_EXIT(&worker_lock);
return NULL;
}
/*
* thread to combine salvager child logs
* back into the main salvageserver log
*/
static void *
SalvageLogCleanupThread(void * arg)
{
struct log_cleanup_node * cleanup;
assert(pthread_mutex_lock(&worker_lock) == 0);
while (1) {
while (queue_IsEmpty(&log_cleanup_queue)) {
assert(pthread_cond_wait(&log_cleanup_queue.queue_change_cv, &worker_lock) == 0);
}
while (queue_IsNotEmpty(&log_cleanup_queue)) {
cleanup = queue_First(&log_cleanup_queue, log_cleanup_node);
queue_Remove(cleanup);
assert(pthread_mutex_unlock(&worker_lock) == 0);
SalvageLogCleanup(cleanup->pid);
free(cleanup);
assert(pthread_mutex_lock(&worker_lock) == 0);
}
}
assert(pthread_mutex_unlock(&worker_lock) == 0);
return NULL;
}
/*
* Process all events that have expired relative to the current clock time
* (which is not re-evaluated unless clock_NewTime has been called).
* The relative time to the next event is returned in the output parameter
* next and the function returns 1. If there are is no next event,
* the function returns 0.
*/
int
rxevent_RaiseEvents(struct clock * next)
{
struct rxevent *qe;
struct clock now;
#ifdef RXDEBUG
if (Log)
fprintf(Log, "rxevent_RaiseEvents(%ld.%ld)\n", now.sec, now.usec);
#endif
/*
* Events are sorted by time, so only scan until an event is found that
* has not yet timed out
*/
while (queue_IsNotEmpty(&rxevent_queue)) {
clock_GetTime(&now);
qe = queue_First(&rxevent_queue, rxevent);
if (clock_Lt(&now, &qe->eventTime)) {
*next = qe->eventTime;
clock_Sub(next, &now);
return 1;
}
queue_Remove(qe);
rxevent_nPosted--;
qe->func(qe, qe->arg, qe->arg1);
queue_Append(&rxevent_free, qe);
rxevent_nFree++;
}
return 0;
}
/**
* destroy a node list object.
*
* @param[in] list list object
*
* @return operation status
* @retval 0 success
* @retval AFS_WQ_ERROR list not empty
*
* @internal
*/
static int
_afs_wq_node_list_destroy(struct afs_work_queue_node_list * list)
{
int ret = 0;
if (queue_IsNotEmpty(&list->list)) {
ret = AFS_WQ_ERROR;
goto error;
}
MUTEX_DESTROY(&list->lock);
CV_DESTROY(&list->cv);
error:
return ret;
}
/* Optimization for marshalling 32 bit arguments */
int
rx_WriteProc32(struct rx_call *call, afs_int32 * value)
{
int bytes;
int tcurlen;
int tnFree;
char *tcurpos;
SPLVAR;
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
/*
* Most common case: all of the data fits in the current iovec.
* We are relying on nFree being zero unless the call is in send mode.
*/
tcurlen = call->curlen;
tnFree = call->nFree;
if (!call->error && tcurlen >= sizeof(afs_int32)
&& tnFree >= sizeof(afs_int32)) {
tcurpos = call->curpos;
if (!((size_t)tcurpos & (sizeof(afs_int32) - 1))) {
*((afs_int32 *) (tcurpos)) = *value;
} else {
memcpy(tcurpos, (char *)value, sizeof(afs_int32));
}
call->curpos = tcurpos + sizeof(afs_int32);
call->curlen = (u_short)(tcurlen - sizeof(afs_int32));
call->nFree = (u_short)(tnFree - sizeof(afs_int32));
return sizeof(afs_int32);
}
NETPRI;
bytes = rxi_WriteProc(call, (char *)value, sizeof(afs_int32));
USERPRI;
return bytes;
}
int
rx_WriteProc(struct rx_call *call, char *buf, int nbytes)
{
int bytes;
int tcurlen;
int tnFree;
char *tcurpos;
SPLVAR;
/* Free any packets from the last call to ReadvProc/WritevProc */
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
/*
* Most common case: all of the data fits in the current iovec.
* We are relying on nFree being zero unless the call is in send mode.
*/
tcurlen = (int)call->curlen;
tnFree = (int)call->nFree;
if (!call->error && tcurlen >= nbytes && tnFree >= nbytes) {
tcurpos = call->curpos;
memcpy(tcurpos, buf, nbytes);
call->curpos = tcurpos + nbytes;
call->curlen = (u_short)(tcurlen - nbytes);
call->nFree = (u_short)(tnFree - nbytes);
return nbytes;
}
NETPRI;
bytes = rxi_WriteProc(call, buf, nbytes);
USERPRI;
return bytes;
}
/**
* Thread to look for SalvageLog.$pid files that are not from our child
* worker salvagers, and notify SalvageLogCleanupThread to clean them
* up. This can happen if we restart during salvages, or the
* salvageserver crashes or something.
*
* @param arg unused
*
* @return always NULL
*/
static void *
SalvageLogScanningThread(void * arg)
{
struct rx_queue log_watch_queue;
queue_Init(&log_watch_queue);
{
DIR *dp;
struct dirent *dirp;
char prefix[AFSDIR_PATH_MAX];
size_t prefix_len;
afs_snprintf(prefix, sizeof(prefix), "%s.", AFSDIR_SLVGLOG_FILE);
prefix_len = strlen(prefix);
dp = opendir(AFSDIR_LOGS_DIR);
assert(dp);
while ((dirp = readdir(dp)) != NULL) {
pid_t pid;
struct log_cleanup_node *cleanup;
int i;
if (strncmp(dirp->d_name, prefix, prefix_len) != 0) {
/* not a salvage logfile; skip */
continue;
}
errno = 0;
pid = strtol(dirp->d_name + prefix_len, NULL, 10);
if (errno != 0) {
/* file is SalvageLog.<something> but <something> isn't
* a pid, so skip */
continue;
}
VOL_LOCK;
for (i = 0; i < Parallel; ++i) {
if (pid == child_slot[i]) {
break;
}
}
VOL_UNLOCK;
if (i < Parallel) {
/* this pid is one of our children, so the reaper thread
* will take care of it; skip */
continue;
}
cleanup =
(struct log_cleanup_node *) malloc(sizeof(struct log_cleanup_node));
cleanup->pid = pid;
queue_Append(&log_watch_queue, cleanup);
}
closedir(dp);
}
ScanLogs(&log_watch_queue);
while (queue_IsNotEmpty(&log_watch_queue)) {
sleep(SALVAGE_SCAN_POLL_INTERVAL);
ScanLogs(&log_watch_queue);
}
return NULL;
}
/* rxi_ReadProc -- internal version.
*
* LOCKS USED -- called at netpri
*/
int
rxi_ReadProc(struct rx_call *call, char *buf,
int nbytes)
{
struct rx_packet *cp = call->currentPacket;
struct rx_packet *rp;
int requestCount;
unsigned int t;
/* XXXX took out clock_NewTime from here. Was it needed? */
requestCount = nbytes;
/* Free any packets from the last call to ReadvProc/WritevProc */
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
do {
if (call->nLeft == 0) {
/* Get next packet */
MUTEX_ENTER(&call->lock);
for (;;) {
if (call->error || (call->mode != RX_MODE_RECEIVING)) {
if (call->error) {
call->mode = RX_MODE_ERROR;
MUTEX_EXIT(&call->lock);
return 0;
}
if (call->mode == RX_MODE_SENDING) {
MUTEX_EXIT(&call->lock);
rxi_FlushWrite(call);
MUTEX_ENTER(&call->lock);
continue;
}
}
if (queue_IsNotEmpty(&call->rq)) {
/* Check that next packet available is next in sequence */
rp = queue_First(&call->rq, rx_packet);
if (rp->header.seq == call->rnext) {
afs_int32 error;
struct rx_connection *conn = call->conn;
queue_Remove(rp);
#ifdef RX_TRACK_PACKETS
rp->flags &= ~RX_PKTFLAG_RQ;
#endif
#ifdef RXDEBUG_PACKET
call->rqc--;
#endif /* RXDEBUG_PACKET */
/* RXS_CheckPacket called to undo RXS_PreparePacket's
* work. It may reduce the length of the packet by up
* to conn->maxTrailerSize, to reflect the length of the
* data + the header. */
if ((error =
RXS_CheckPacket(conn->securityObject, call,
rp))) {
/* Used to merely shut down the call, but now we
* shut down the whole connection since this may
* indicate an attempt to hijack it */
MUTEX_EXIT(&call->lock);
rxi_ConnectionError(conn, error);
MUTEX_ENTER(&conn->conn_data_lock);
rp = rxi_SendConnectionAbort(conn, rp, 0, 0);
MUTEX_EXIT(&conn->conn_data_lock);
rxi_FreePacket(rp);
return 0;
}
call->rnext++;
cp = call->currentPacket = rp;
#ifdef RX_TRACK_PACKETS
call->currentPacket->flags |= RX_PKTFLAG_CP;
#endif
call->curvec = 1; /* 0th vec is always header */
/* begin at the beginning [ more or less ], continue
* on until the end, then stop. */
call->curpos =
(char *)cp->wirevec[1].iov_base +
call->conn->securityHeaderSize;
call->curlen =
cp->wirevec[1].iov_len -
call->conn->securityHeaderSize;
/* Notice that this code works correctly if the data
* size is 0 (which it may be--no reply arguments from
* server, for example). This relies heavily on the
* fact that the code below immediately frees the packet
* (no yields, etc.). If it didn't, this would be a
* problem because a value of zero for call->nLeft
* normally means that there is no read packet */
call->nLeft = cp->length;
hadd32(call->bytesRcvd, cp->length);
/* Send a hard ack for every rxi_HardAckRate+1 packets
* consumed. Otherwise schedule an event to send
* the hard ack later on.
*/
call->nHardAcks++;
if (!(call->flags & RX_CALL_RECEIVE_DONE)) {
if (call->nHardAcks > (u_short) rxi_HardAckRate) {
rxevent_Cancel(call->delayedAckEvent, call,
RX_CALL_REFCOUNT_DELAY);
rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
} else {
struct clock when, now;
clock_GetTime(&now);
when = now;
/* Delay to consolidate ack packets */
clock_Add(&when, &rx_hardAckDelay);
if (!call->delayedAckEvent
|| clock_Gt(&call->delayedAckEvent->
eventTime, &when)) {
rxevent_Cancel(call->delayedAckEvent,
call,
RX_CALL_REFCOUNT_DELAY);
MUTEX_ENTER(&rx_refcnt_mutex);
CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
MUTEX_EXIT(&rx_refcnt_mutex);
call->delayedAckEvent =
rxevent_PostNow(&when, &now,
rxi_SendDelayedAck, call,
0);
}
}
}
break;
}
}
/*
* If we reach this point either we have no packets in the
* receive queue or the next packet in the queue is not the
* one we are looking for. There is nothing else for us to
* do but wait for another packet to arrive.
*/
/* Are there ever going to be any more packets? */
if (call->flags & RX_CALL_RECEIVE_DONE) {
MUTEX_EXIT(&call->lock);
return requestCount - nbytes;
}
/* Wait for in-sequence packet */
call->flags |= RX_CALL_READER_WAIT;
clock_NewTime();
call->startWait = clock_Sec();
while (call->flags & RX_CALL_READER_WAIT) {
#ifdef RX_ENABLE_LOCKS
CV_WAIT(&call->cv_rq, &call->lock);
#else
osi_rxSleep(&call->rq);
#endif
}
cp = call->currentPacket;
call->startWait = 0;
#ifdef RX_ENABLE_LOCKS
if (call->error) {
MUTEX_EXIT(&call->lock);
return 0;
}
#endif /* RX_ENABLE_LOCKS */
}
MUTEX_EXIT(&call->lock);
} else
/* osi_Assert(cp); */
/* MTUXXX this should be replaced by some error-recovery code before shipping */
/* yes, the following block is allowed to be the ELSE clause (or not) */
/* It's possible for call->nLeft to be smaller than any particular
* iov_len. Usually, recvmsg doesn't change the iov_len, since it
* reflects the size of the buffer. We have to keep track of the
* number of bytes read in the length field of the packet struct. On
* the final portion of a received packet, it's almost certain that
* call->nLeft will be smaller than the final buffer. */
while (nbytes && cp) {
t = MIN((int)call->curlen, nbytes);
t = MIN(t, (int)call->nLeft);
memcpy(buf, call->curpos, t);
buf += t;
nbytes -= t;
call->curpos += t;
call->curlen -= t;
call->nLeft -= t;
if (!call->nLeft) {
/* out of packet. Get another one. */
#ifdef RX_TRACK_PACKETS
call->currentPacket->flags &= ~RX_PKTFLAG_CP;
#endif
rxi_FreePacket(cp);
cp = call->currentPacket = (struct rx_packet *)0;
} else if (!call->curlen) {
/* need to get another struct iov */
if (++call->curvec >= cp->niovecs) {
/* current packet is exhausted, get ready for another */
/* don't worry about curvec and stuff, they get set somewhere else */
#ifdef RX_TRACK_PACKETS
call->currentPacket->flags &= ~RX_PKTFLAG_CP;
#endif
rxi_FreePacket(cp);
cp = call->currentPacket = (struct rx_packet *)0;
call->nLeft = 0;
} else {
call->curpos =
(char *)cp->wirevec[call->curvec].iov_base;
call->curlen = cp->wirevec[call->curvec].iov_len;
}
}
}
if (!nbytes) {
/* user buffer is full, return */
return requestCount;
}
} while (nbytes);
return requestCount;
}
int
rxi_WritevAlloc(struct rx_call *call, struct iovec *iov, int *nio, int maxio,
int nbytes)
{
struct rx_connection *conn = call->conn;
struct rx_packet *cp = call->currentPacket;
int requestCount;
int nextio;
/* Temporary values, real work is done in rxi_WritevProc */
int tnFree;
unsigned int tcurvec;
char *tcurpos;
int tcurlen;
requestCount = nbytes;
nextio = 0;
/* Free any packets from the last call to ReadvProc/WritevProc */
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
if (call->mode != RX_MODE_SENDING) {
if ((conn->type == RX_SERVER_CONNECTION)
&& (call->mode == RX_MODE_RECEIVING)) {
call->mode = RX_MODE_SENDING;
if (cp) {
#ifdef RX_TRACK_PACKETS
cp->flags &= ~RX_PKTFLAG_CP;
#endif
rxi_FreePacket(cp);
cp = call->currentPacket = (struct rx_packet *)0;
call->nLeft = 0;
call->nFree = 0;
}
} else {
return 0;
}
}
/* Set up the iovec to point to data in packet buffers. */
tnFree = call->nFree;
tcurvec = call->curvec;
tcurpos = call->curpos;
tcurlen = call->curlen;
do {
int t;
if (tnFree == 0) {
/* current packet is full, allocate a new one */
MUTEX_ENTER(&call->lock);
cp = rxi_AllocSendPacket(call, nbytes);
MUTEX_EXIT(&call->lock);
if (cp == NULL) {
/* out of space, return what we have */
*nio = nextio;
return requestCount - nbytes;
}
#ifdef RX_TRACK_PACKETS
cp->flags |= RX_PKTFLAG_IOVQ;
#endif
queue_Append(&call->iovq, cp);
#ifdef RXDEBUG_PACKET
call->iovqc++;
#endif /* RXDEBUG_PACKET */
tnFree = cp->length;
tcurvec = 1;
tcurpos =
(char *)cp->wirevec[1].iov_base +
call->conn->securityHeaderSize;
tcurlen = cp->wirevec[1].iov_len - call->conn->securityHeaderSize;
}
if (tnFree < nbytes) {
/* try to extend the current packet */
int len, mud;
len = cp->length;
mud = rx_MaxUserDataSize(call);
if (mud > len) {
int want;
want = MIN(nbytes - tnFree, mud - len);
rxi_AllocDataBuf(cp, want, RX_PACKET_CLASS_SEND_CBUF);
if (cp->length > (unsigned)mud)
cp->length = mud;
tnFree += (cp->length - len);
if (cp == call->currentPacket) {
call->nFree += (cp->length - len);
}
}
}
/* fill in the next entry in the iovec */
t = MIN(tcurlen, nbytes);
t = MIN(tnFree, t);
iov[nextio].iov_base = tcurpos;
iov[nextio].iov_len = t;
nbytes -= t;
tcurpos += t;
tcurlen -= t;
tnFree -= t;
nextio++;
if (!tcurlen) {
/* need to get another struct iov */
if (++tcurvec >= cp->niovecs) {
/* current packet is full, extend it or move on to next packet */
tnFree = 0;
} else {
tcurpos = (char *)cp->wirevec[tcurvec].iov_base;
tcurlen = cp->wirevec[tcurvec].iov_len;
}
}
} while (nbytes && nextio < maxio);
*nio = nextio;
return requestCount - nbytes;
}
int
rxi_WriteProc(struct rx_call *call, char *buf,
int nbytes)
{
struct rx_connection *conn = call->conn;
struct rx_packet *cp = call->currentPacket;
unsigned int t;
int requestCount = nbytes;
/* Free any packets from the last call to ReadvProc/WritevProc */
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
if (call->mode != RX_MODE_SENDING) {
if ((conn->type == RX_SERVER_CONNECTION)
&& (call->mode == RX_MODE_RECEIVING)) {
call->mode = RX_MODE_SENDING;
if (cp) {
#ifdef RX_TRACK_PACKETS
cp->flags &= ~RX_PKTFLAG_CP;
#endif
rxi_FreePacket(cp);
cp = call->currentPacket = (struct rx_packet *)0;
call->nLeft = 0;
call->nFree = 0;
}
} else {
return 0;
}
}
/* Loop condition is checked at end, so that a write of 0 bytes
* will force a packet to be created--specially for the case where
* there are 0 bytes on the stream, but we must send a packet
* anyway. */
do {
if (call->nFree == 0) {
MUTEX_ENTER(&call->lock);
#ifdef AFS_GLOBAL_RXLOCK_KERNEL
rxi_WaitforTQBusy(call);
#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
cp = call->currentPacket;
if (call->error)
call->mode = RX_MODE_ERROR;
if (!call->error && cp) {
/* Clear the current packet now so that if
* we are forced to wait and drop the lock
* the packet we are planning on using
* cannot be freed.
*/
#ifdef RX_TRACK_PACKETS
cp->flags &= ~RX_PKTFLAG_CP;
#endif
call->currentPacket = (struct rx_packet *)0;
clock_NewTime(); /* Bogus: need new time package */
/* The 0, below, specifies that it is not the last packet:
* there will be others. PrepareSendPacket may
* alter the packet length by up to
* conn->securityMaxTrailerSize */
hadd32(call->bytesSent, cp->length);
rxi_PrepareSendPacket(call, cp, 0);
#ifdef RX_TRACK_PACKETS
cp->flags |= RX_PKTFLAG_TQ;
#endif
queue_Append(&call->tq, cp);
#ifdef RXDEBUG_PACKET
call->tqc++;
#endif /* RXDEBUG_PACKET */
cp = (struct rx_packet *)0;
if (!
(call->
flags & (RX_CALL_FAST_RECOVER |
RX_CALL_FAST_RECOVER_WAIT))) {
rxi_Start(0, call, 0, 0);
}
} else if (cp) {
#ifdef RX_TRACK_PACKETS
cp->flags &= ~RX_PKTFLAG_CP;
#endif
rxi_FreePacket(cp);
cp = call->currentPacket = (struct rx_packet *)0;
}
/* Wait for transmit window to open up */
while (!call->error
&& call->tnext + 1 > call->tfirst + (2 * call->twind)) {
clock_NewTime();
call->startWait = clock_Sec();
#ifdef RX_ENABLE_LOCKS
CV_WAIT(&call->cv_twind, &call->lock);
#else
call->flags |= RX_CALL_WAIT_WINDOW_ALLOC;
osi_rxSleep(&call->twind);
#endif
call->startWait = 0;
#ifdef RX_ENABLE_LOCKS
if (call->error) {
call->mode = RX_MODE_ERROR;
MUTEX_EXIT(&call->lock);
return 0;
}
#endif /* RX_ENABLE_LOCKS */
}
if ((cp = rxi_AllocSendPacket(call, nbytes))) {
#ifdef RX_TRACK_PACKETS
cp->flags |= RX_PKTFLAG_CP;
#endif
call->currentPacket = cp;
call->nFree = cp->length;
call->curvec = 1; /* 0th vec is always header */
/* begin at the beginning [ more or less ], continue
* on until the end, then stop. */
call->curpos =
(char *)cp->wirevec[1].iov_base +
call->conn->securityHeaderSize;
call->curlen =
cp->wirevec[1].iov_len - call->conn->securityHeaderSize;
}
if (call->error) {
call->mode = RX_MODE_ERROR;
if (cp) {
#ifdef RX_TRACK_PACKETS
cp->flags &= ~RX_PKTFLAG_CP;
#endif
rxi_FreePacket(cp);
call->currentPacket = NULL;
}
MUTEX_EXIT(&call->lock);
return 0;
}
MUTEX_EXIT(&call->lock);
}
if (cp && (int)call->nFree < nbytes) {
/* Try to extend the current buffer */
int len, mud;
len = cp->length;
mud = rx_MaxUserDataSize(call);
if (mud > len) {
int want;
want = MIN(nbytes - (int)call->nFree, mud - len);
rxi_AllocDataBuf(cp, want, RX_PACKET_CLASS_SEND_CBUF);
if (cp->length > (unsigned)mud)
cp->length = mud;
call->nFree += (cp->length - len);
}
}
/* If the remaining bytes fit in the buffer, then store them
* and return. Don't ship a buffer that's full immediately to
* the peer--we don't know if it's the last buffer yet */
if (!cp) {
call->nFree = 0;
}
while (nbytes && call->nFree) {
t = MIN((int)call->curlen, nbytes);
t = MIN((int)call->nFree, t);
memcpy(call->curpos, buf, t);
buf += t;
nbytes -= t;
call->curpos += t;
call->curlen -= (u_short)t;
call->nFree -= (u_short)t;
if (!call->curlen) {
/* need to get another struct iov */
if (++call->curvec >= cp->niovecs) {
/* current packet is full, extend or send it */
call->nFree = 0;
} else {
call->curpos = (char *)cp->wirevec[call->curvec].iov_base;
call->curlen = cp->wirevec[call->curvec].iov_len;
}
}
} /* while bytes to send and room to send them */
/* might be out of space now */
if (!nbytes) {
return requestCount;
} else; /* more data to send, so get another packet and keep going */
} while (nbytes);
return requestCount - nbytes;
}
/* rxi_ReadvProc -- internal version.
*
* Fills in an iovec with pointers to the packet buffers. All packets
* except the last packet (new current packet) are moved to the iovq
* while the application is processing the data.
*
* LOCKS USED -- called at netpri.
*/
int
rxi_ReadvProc(struct rx_call *call, struct iovec *iov, int *nio, int maxio,
int nbytes)
{
int bytes;
/* Free any packets from the last call to ReadvProc/WritevProc */
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
if (call->mode == RX_MODE_SENDING) {
rxi_FlushWrite(call);
}
MUTEX_ENTER(&call->lock);
if (call->error)
goto error;
/* Get whatever data is currently available in the receive queue.
* If rxi_FillReadVec sends an ack packet then it is possible
* that we will receive more data while we drop the call lock
* to send the packet. Set the RX_CALL_IOVEC_WAIT flag
* here to avoid a race with the receive thread if we send
* hard acks in rxi_FillReadVec. */
call->flags |= RX_CALL_IOVEC_WAIT;
call->iovNBytes = nbytes;
call->iovMax = maxio;
call->iovNext = 0;
call->iov = iov;
rxi_FillReadVec(call, 0);
/* if we need more data then sleep until the receive thread has
* filled in the rest. */
if (!call->error && call->iovNBytes && call->iovNext < call->iovMax
&& !(call->flags & RX_CALL_RECEIVE_DONE)) {
call->flags |= RX_CALL_READER_WAIT;
clock_NewTime();
call->startWait = clock_Sec();
while (call->flags & RX_CALL_READER_WAIT) {
#ifdef RX_ENABLE_LOCKS
CV_WAIT(&call->cv_rq, &call->lock);
#else
osi_rxSleep(&call->rq);
#endif
}
call->startWait = 0;
}
call->flags &= ~RX_CALL_IOVEC_WAIT;
if (call->error)
goto error;
call->iov = NULL;
*nio = call->iovNext;
bytes = nbytes - call->iovNBytes;
MUTEX_EXIT(&call->lock);
return bytes;
error:
MUTEX_EXIT(&call->lock);
call->mode = RX_MODE_ERROR;
return 0;
}
/* rxi_FillReadVec
*
* Uses packets in the receive queue to fill in as much of the
* current iovec as possible. Does not block if it runs out
* of packets to complete the iovec. Return true if an ack packet
* was sent, otherwise return false */
int
rxi_FillReadVec(struct rx_call *call, afs_uint32 serial)
{
int didConsume = 0;
int didHardAck = 0;
unsigned int t;
struct rx_packet *rp;
struct rx_packet *curp;
struct iovec *call_iov;
struct iovec *cur_iov = NULL;
curp = call->currentPacket;
if (curp) {
cur_iov = &curp->wirevec[call->curvec];
}
call_iov = &call->iov[call->iovNext];
while (!call->error && call->iovNBytes && call->iovNext < call->iovMax) {
if (call->nLeft == 0) {
/* Get next packet */
if (queue_IsNotEmpty(&call->rq)) {
/* Check that next packet available is next in sequence */
rp = queue_First(&call->rq, rx_packet);
if (rp->header.seq == call->rnext) {
afs_int32 error;
struct rx_connection *conn = call->conn;
queue_Remove(rp);
#ifdef RX_TRACK_PACKETS
rp->flags &= ~RX_PKTFLAG_RQ;
#endif
#ifdef RXDEBUG_PACKET
call->rqc--;
#endif /* RXDEBUG_PACKET */
/* RXS_CheckPacket called to undo RXS_PreparePacket's
* work. It may reduce the length of the packet by up
* to conn->maxTrailerSize, to reflect the length of the
* data + the header. */
if ((error =
RXS_CheckPacket(conn->securityObject, call, rp))) {
/* Used to merely shut down the call, but now we
* shut down the whole connection since this may
* indicate an attempt to hijack it */
MUTEX_EXIT(&call->lock);
rxi_ConnectionError(conn, error);
MUTEX_ENTER(&conn->conn_data_lock);
rp = rxi_SendConnectionAbort(conn, rp, 0, 0);
MUTEX_EXIT(&conn->conn_data_lock);
rxi_FreePacket(rp);
MUTEX_ENTER(&call->lock);
return 1;
}
call->rnext++;
curp = call->currentPacket = rp;
#ifdef RX_TRACK_PACKETS
call->currentPacket->flags |= RX_PKTFLAG_CP;
#endif
call->curvec = 1; /* 0th vec is always header */
cur_iov = &curp->wirevec[1];
/* begin at the beginning [ more or less ], continue
* on until the end, then stop. */
call->curpos =
(char *)curp->wirevec[1].iov_base +
call->conn->securityHeaderSize;
call->curlen =
curp->wirevec[1].iov_len -
call->conn->securityHeaderSize;
/* Notice that this code works correctly if the data
* size is 0 (which it may be--no reply arguments from
* server, for example). This relies heavily on the
* fact that the code below immediately frees the packet
* (no yields, etc.). If it didn't, this would be a
* problem because a value of zero for call->nLeft
* normally means that there is no read packet */
call->nLeft = curp->length;
hadd32(call->bytesRcvd, curp->length);
/* Send a hard ack for every rxi_HardAckRate+1 packets
* consumed. Otherwise schedule an event to send
* the hard ack later on.
*/
call->nHardAcks++;
didConsume = 1;
continue;
}
}
break;
}
/* It's possible for call->nLeft to be smaller than any particular
* iov_len. Usually, recvmsg doesn't change the iov_len, since it
* reflects the size of the buffer. We have to keep track of the
* number of bytes read in the length field of the packet struct. On
* the final portion of a received packet, it's almost certain that
* call->nLeft will be smaller than the final buffer. */
while (call->iovNBytes && call->iovNext < call->iovMax && curp) {
t = MIN((int)call->curlen, call->iovNBytes);
t = MIN(t, (int)call->nLeft);
call_iov->iov_base = call->curpos;
call_iov->iov_len = t;
call_iov++;
call->iovNext++;
call->iovNBytes -= t;
call->curpos += t;
call->curlen -= t;
call->nLeft -= t;
if (!call->nLeft) {
/* out of packet. Get another one. */
#ifdef RX_TRACK_PACKETS
curp->flags &= ~RX_PKTFLAG_CP;
curp->flags |= RX_PKTFLAG_IOVQ;
#endif
queue_Append(&call->iovq, curp);
#ifdef RXDEBUG_PACKET
call->iovqc++;
#endif /* RXDEBUG_PACKET */
curp = call->currentPacket = (struct rx_packet *)0;
} else if (!call->curlen) {
/* need to get another struct iov */
if (++call->curvec >= curp->niovecs) {
/* current packet is exhausted, get ready for another */
/* don't worry about curvec and stuff, they get set somewhere else */
#ifdef RX_TRACK_PACKETS
curp->flags &= ~RX_PKTFLAG_CP;
curp->flags |= RX_PKTFLAG_IOVQ;
#endif
queue_Append(&call->iovq, curp);
#ifdef RXDEBUG_PACKET
call->iovqc++;
#endif /* RXDEBUG_PACKET */
curp = call->currentPacket = (struct rx_packet *)0;
call->nLeft = 0;
} else {
cur_iov++;
call->curpos = (char *)cur_iov->iov_base;
call->curlen = cur_iov->iov_len;
}
}
}
}
/* If we consumed any packets then check whether we need to
* send a hard ack. */
if (didConsume && (!(call->flags & RX_CALL_RECEIVE_DONE))) {
if (call->nHardAcks > (u_short) rxi_HardAckRate) {
rxevent_Cancel(call->delayedAckEvent, call,
RX_CALL_REFCOUNT_DELAY);
rxi_SendAck(call, 0, serial, RX_ACK_DELAY, 0);
didHardAck = 1;
} else {
struct clock when, now;
clock_GetTime(&now);
when = now;
/* Delay to consolidate ack packets */
clock_Add(&when, &rx_hardAckDelay);
if (!call->delayedAckEvent
|| clock_Gt(&call->delayedAckEvent->eventTime, &when)) {
rxevent_Cancel(call->delayedAckEvent, call,
RX_CALL_REFCOUNT_DELAY);
MUTEX_ENTER(&rx_refcnt_mutex);
CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
MUTEX_EXIT(&rx_refcnt_mutex);
call->delayedAckEvent =
rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
}
}
}
return didHardAck;
}
/* Flush any buffered data to the stream, switch to read mode
* (clients) or to EOF mode (servers)
*
* LOCKS HELD: called at netpri.
*/
void
rxi_FlushWrite(struct rx_call *call)
{
struct rx_packet *cp = NULL;
/* Free any packets from the last call to ReadvProc/WritevProc */
if (queue_IsNotEmpty(&call->iovq)) {
#ifdef RXDEBUG_PACKET
call->iovqc -=
#endif /* RXDEBUG_PACKET */
rxi_FreePackets(0, &call->iovq);
}
if (call->mode == RX_MODE_SENDING) {
call->mode =
(call->conn->type ==
RX_CLIENT_CONNECTION ? RX_MODE_RECEIVING : RX_MODE_EOF);
#ifdef RX_KERNEL_TRACE
{
int glockOwner = ISAFS_GLOCK();
if (!glockOwner)
AFS_GLOCK();
afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
__FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
call);
if (!glockOwner)
AFS_GUNLOCK();
}
#endif
MUTEX_ENTER(&call->lock);
#ifdef AFS_GLOBAL_RXLOCK_KERNEL
rxi_WaitforTQBusy(call);
#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
if (call->error)
call->mode = RX_MODE_ERROR;
cp = call->currentPacket;
if (cp) {
/* cp->length is only supposed to be the user's data */
/* cp->length was already set to (then-current)
* MaxUserDataSize or less. */
#ifdef RX_TRACK_PACKETS
cp->flags &= ~RX_PKTFLAG_CP;
#endif
cp->length -= call->nFree;
call->currentPacket = (struct rx_packet *)0;
call->nFree = 0;
} else {
cp = rxi_AllocSendPacket(call, 0);
if (!cp) {
/* Mode can no longer be MODE_SENDING */
return;
}
cp->length = 0;
cp->niovecs = 2; /* header + space for rxkad stuff */
call->nFree = 0;
}
/* The 1 specifies that this is the last packet */
hadd32(call->bytesSent, cp->length);
rxi_PrepareSendPacket(call, cp, 1);
#ifdef RX_TRACK_PACKETS
cp->flags |= RX_PKTFLAG_TQ;
#endif
queue_Append(&call->tq, cp);
#ifdef RXDEBUG_PACKET
call->tqc++;
#endif /* RXDEBUG_PACKET */
if (!
(call->
flags & (RX_CALL_FAST_RECOVER | RX_CALL_FAST_RECOVER_WAIT))) {
rxi_Start(0, call, 0, 0);
}
MUTEX_EXIT(&call->lock);
}
}
