2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 /* RX: Extended Remote Procedure Call */
12 #include <afsconfig.h>
13 #include <afs/param.h>
16 # include "afs/sysincludes.h"
17 # include "afsincludes.h"
22 # ifdef AFS_LINUX20_ENV
23 # include "h/socket.h"
25 # include "netinet/in.h"
27 # include "netinet/ip6.h"
28 # include "inet/common.h"
30 # include "inet/ip_ire.h"
32 # include "afs/afs_args.h"
33 # include "afs/afs_osi.h"
34 # ifdef RX_KERNEL_TRACE
35 # include "rx_kcommon.h"
37 # if defined(AFS_AIX_ENV)
41 # undef RXDEBUG /* turn off debugging */
43 # if defined(AFS_SGI_ENV)
44 # include "sys/debug.h"
47 # include "afs/sysincludes.h"
48 # include "afsincludes.h"
49 # endif /* !UKERNEL */
50 # include "afs/lock.h"
51 # include "rx_kmutex.h"
52 # include "rx_kernel.h"
53 # define AFSOP_STOP_RXCALLBACK 210 /* Stop CALLBACK process */
54 # define AFSOP_STOP_AFS 211 /* Stop AFS process */
55 # define AFSOP_STOP_BKG 212 /* Stop BKG process */
56 extern afs_int32 afs_termState;
58 # include "sys/lockl.h"
59 # include "sys/lock_def.h"
60 # endif /* AFS_AIX41_ENV */
61 # include "afs/rxgen_consts.h"
66 # include <afs/afsutil.h>
67 # include <WINNT\afsreg.h>
75 #include <opr/queue.h>
79 #include "rx_atomic.h"
80 #include "rx_globals.h"
82 #include "rx_internal.h"
89 #include "rx_packet.h"
90 #include "rx_server.h"
92 #include <afs/rxgen_consts.h>
95 #ifdef AFS_PTHREAD_ENV
97 int (*registerProgram) (pid_t, char *) = 0;
98 int (*swapNameProgram) (pid_t, const char *, char *) = 0;
101 int (*registerProgram) (PROCESS, char *) = 0;
102 int (*swapNameProgram) (PROCESS, const char *, char *) = 0;
106 /* Local static routines */
107 static void rxi_DestroyConnectionNoLock(struct rx_connection *conn);
108 static void rxi_ComputeRoundTripTime(struct rx_packet *, struct rx_ackPacket *,
109 struct rx_call *, struct rx_peer *,
111 static void rxi_Resend(struct rxevent *event, void *arg0, void *arg1,
113 static void rxi_SendDelayedAck(struct rxevent *event, void *call,
114 void *dummy, int dummy2);
115 static void rxi_SendDelayedCallAbort(struct rxevent *event, void *arg1,
116 void *dummy, int dummy2);
117 static void rxi_SendDelayedConnAbort(struct rxevent *event, void *arg1,
118 void *unused, int unused2);
119 static void rxi_ReapConnections(struct rxevent *unused, void *unused1,
120 void *unused2, int unused3);
121 static struct rx_packet *rxi_SendCallAbort(struct rx_call *call,
122 struct rx_packet *packet,
123 int istack, int force);
124 static void rxi_AckAll(struct rx_call *call);
125 static struct rx_connection
126 *rxi_FindConnection(osi_socket socket, afs_uint32 host, u_short port,
127 u_short serviceId, afs_uint32 cid,
128 afs_uint32 epoch, int type, u_int securityIndex,
129 int *unknownService);
130 static struct rx_packet
131 *rxi_ReceiveDataPacket(struct rx_call *call, struct rx_packet *np,
132 int istack, osi_socket socket,
133 afs_uint32 host, u_short port, int *tnop,
134 struct rx_call **newcallp);
135 static struct rx_packet
136 *rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
138 static struct rx_packet
139 *rxi_ReceiveResponsePacket(struct rx_connection *conn,
140 struct rx_packet *np, int istack);
141 static struct rx_packet
142 *rxi_ReceiveChallengePacket(struct rx_connection *conn,
143 struct rx_packet *np, int istack);
144 static void rxi_AttachServerProc(struct rx_call *call, osi_socket socket,
145 int *tnop, struct rx_call **newcallp);
146 static void rxi_ClearTransmitQueue(struct rx_call *call, int force);
147 static void rxi_ClearReceiveQueue(struct rx_call *call);
148 static void rxi_ResetCall(struct rx_call *call, int newcall);
149 static void rxi_ScheduleKeepAliveEvent(struct rx_call *call);
150 static void rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn);
151 static void rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs);
152 static void rxi_KeepAliveOn(struct rx_call *call);
153 static void rxi_GrowMTUOn(struct rx_call *call);
154 static void rxi_ChallengeOn(struct rx_connection *conn);
155 static int rxi_CheckCall(struct rx_call *call, int haveCTLock);
156 static void rxi_AckAllInTransmitQueue(struct rx_call *call);
157 static void rxi_CancelKeepAliveEvent(struct rx_call *call);
158 static void rxi_CancelDelayedAbortEvent(struct rx_call *call);
159 static void rxi_CancelGrowMTUEvent(struct rx_call *call);
161 #ifdef RX_ENABLE_LOCKS
163 rx_atomic_t rxi_start_aborted; /* rxi_start awoke after rxi_Send in error.*/
164 rx_atomic_t rxi_start_in_error;
166 #endif /* RX_ENABLE_LOCKS */
168 /* Constant delay time before sending an acknowledge of the last packet
169 * received. This is to avoid sending an extra acknowledge when the
170 * client is about to make another call, anyway, or the server is
173 * The lastAckDelay may not exceeed 400ms without causing peers to
174 * unecessarily timeout.
176 struct clock rx_lastAckDelay = {0, 400000};
178 /* Constant delay time before sending a soft ack when none was requested.
179 * This is to make sure we send soft acks before the sender times out,
180 * Normally we wait and send a hard ack when the receiver consumes the packet
182 * This value has been 100ms in all shipping versions of OpenAFS. Changing it
183 * will require changes to the peer's RTT calculations.
185 struct clock rx_softAckDelay = {0, 100000};
188 * rxi_rpc_peer_stat_cnt counts the total number of peer stat structures
189 * currently allocated within rx. This number is used to allocate the
190 * memory required to return the statistics when queried.
191 * Protected by the rx_rpc_stats mutex.
194 static unsigned int rxi_rpc_peer_stat_cnt;
197 * rxi_rpc_process_stat_cnt counts the total number of local process stat
198 * structures currently allocated within rx. The number is used to allocate
199 * the memory required to return the statistics when queried.
200 * Protected by the rx_rpc_stats mutex.
203 static unsigned int rxi_rpc_process_stat_cnt;
206 * rxi_busyChannelError is a boolean. It indicates whether or not RX_CALL_BUSY
207 * errors should be reported to the application when a call channel appears busy
208 * (inferred from the receipt of RX_PACKET_TYPE_BUSY packets on the channel),
209 * and there are other call channels in the connection that are not busy.
210 * If 0, we do not return errors upon receiving busy packets; we just keep
211 * trying on the same call channel until we hit a timeout.
213 static afs_int32 rxi_busyChannelError = 0;
215 rx_atomic_t rx_nWaiting = RX_ATOMIC_INIT(0);
216 rx_atomic_t rx_nWaited = RX_ATOMIC_INIT(0);
218 /* Incoming calls wait on this queue when there are no available
219 * server processes */
220 struct opr_queue rx_incomingCallQueue;
222 /* Server processes wait on this queue when there are no appropriate
223 * calls to process */
224 struct opr_queue rx_idleServerQueue;
226 #if !defined(offsetof)
227 #include <stddef.h> /* for definition of offsetof() */
230 #ifdef RX_ENABLE_LOCKS
231 afs_kmutex_t rx_atomic_mutex;
234 /* Forward prototypes */
235 static struct rx_call * rxi_NewCall(struct rx_connection *, int);
238 putConnection (struct rx_connection *conn) {
239 MUTEX_ENTER(&rx_refcnt_mutex);
241 MUTEX_EXIT(&rx_refcnt_mutex);
244 #ifdef AFS_PTHREAD_ENV
247 * Use procedural initialization of mutexes/condition variables
251 extern afs_kmutex_t rx_quota_mutex;
252 extern afs_kmutex_t rx_pthread_mutex;
253 extern afs_kmutex_t rx_packets_mutex;
254 extern afs_kmutex_t rx_refcnt_mutex;
255 extern afs_kmutex_t des_init_mutex;
256 extern afs_kmutex_t des_random_mutex;
257 extern afs_kmutex_t rx_clock_mutex;
258 extern afs_kmutex_t rxi_connCacheMutex;
259 extern afs_kmutex_t event_handler_mutex;
260 extern afs_kmutex_t listener_mutex;
261 extern afs_kmutex_t rx_if_init_mutex;
262 extern afs_kmutex_t rx_if_mutex;
264 extern afs_kcondvar_t rx_event_handler_cond;
265 extern afs_kcondvar_t rx_listener_cond;
267 static afs_kmutex_t epoch_mutex;
268 static afs_kmutex_t rx_init_mutex;
269 static afs_kmutex_t rx_debug_mutex;
270 static afs_kmutex_t rx_rpc_stats;
273 rxi_InitPthread(void)
275 MUTEX_INIT(&rx_clock_mutex, "clock", MUTEX_DEFAULT, 0);
276 MUTEX_INIT(&rx_stats_mutex, "stats", MUTEX_DEFAULT, 0);
277 MUTEX_INIT(&rx_atomic_mutex, "atomic", MUTEX_DEFAULT, 0);
278 MUTEX_INIT(&rx_quota_mutex, "quota", MUTEX_DEFAULT, 0);
279 MUTEX_INIT(&rx_pthread_mutex, "pthread", MUTEX_DEFAULT, 0);
280 MUTEX_INIT(&rx_packets_mutex, "packets", MUTEX_DEFAULT, 0);
281 MUTEX_INIT(&rx_refcnt_mutex, "refcnts", MUTEX_DEFAULT, 0);
282 MUTEX_INIT(&epoch_mutex, "epoch", MUTEX_DEFAULT, 0);
283 MUTEX_INIT(&rx_init_mutex, "init", MUTEX_DEFAULT, 0);
284 MUTEX_INIT(&event_handler_mutex, "event handler", MUTEX_DEFAULT, 0);
285 MUTEX_INIT(&rxi_connCacheMutex, "conn cache", MUTEX_DEFAULT, 0);
286 MUTEX_INIT(&listener_mutex, "listener", MUTEX_DEFAULT, 0);
287 MUTEX_INIT(&rx_if_init_mutex, "if init", MUTEX_DEFAULT, 0);
288 MUTEX_INIT(&rx_if_mutex, "if", MUTEX_DEFAULT, 0);
289 MUTEX_INIT(&rx_debug_mutex, "debug", MUTEX_DEFAULT, 0);
291 CV_INIT(&rx_event_handler_cond, "evhand", CV_DEFAULT, 0);
292 CV_INIT(&rx_listener_cond, "rxlisten", CV_DEFAULT, 0);
294 osi_Assert(pthread_key_create(&rx_thread_id_key, NULL) == 0);
295 osi_Assert(pthread_key_create(&rx_ts_info_key, NULL) == 0);
297 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
298 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
299 #ifdef RX_ENABLE_LOCKS
302 #endif /* RX_LOCKS_DB */
303 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
304 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
306 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
308 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
310 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
312 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
313 MUTEX_INIT(&rxi_keyCreate_lock, "rxi_keyCreate_lock", MUTEX_DEFAULT, 0);
314 #endif /* RX_ENABLE_LOCKS */
317 pthread_once_t rx_once_init = PTHREAD_ONCE_INIT;
318 #define INIT_PTHREAD_LOCKS osi_Assert(pthread_once(&rx_once_init, rxi_InitPthread)==0)
320 * The rx_stats_mutex mutex protects the following global variables:
321 * rxi_lowConnRefCount
322 * rxi_lowPeerRefCount
331 * The rx_quota_mutex mutex protects the following global variables:
339 * The rx_freePktQ_lock protects the following global variables:
344 * The rx_packets_mutex mutex protects the following global variables:
352 * The rx_pthread_mutex mutex protects the following global variables:
353 * rxi_fcfs_thread_num
356 #define INIT_PTHREAD_LOCKS
360 /* Variables for handling the minProcs implementation. availProcs gives the
361 * number of threads available in the pool at this moment (not counting dudes
362 * executing right now). totalMin gives the total number of procs required
363 * for handling all minProcs requests. minDeficit is a dynamic variable
364 * tracking the # of procs required to satisfy all of the remaining minProcs
366 * For fine grain locking to work, the quota check and the reservation of
367 * a server thread has to come while rxi_availProcs and rxi_minDeficit
368 * are locked. To this end, the code has been modified under #ifdef
369 * RX_ENABLE_LOCKS so that quota checks and reservation occur at the
370 * same time. A new function, ReturnToServerPool() returns the allocation.
372 * A call can be on several queue's (but only one at a time). When
373 * rxi_ResetCall wants to remove the call from a queue, it has to ensure
374 * that no one else is touching the queue. To this end, we store the address
375 * of the queue lock in the call structure (under the call lock) when we
376 * put the call on a queue, and we clear the call_queue_lock when the
377 * call is removed from a queue (once the call lock has been obtained).
378 * This allows rxi_ResetCall to safely synchronize with others wishing
379 * to manipulate the queue.
382 #if defined(RX_ENABLE_LOCKS)
383 static afs_kmutex_t rx_rpc_stats;
386 /* We keep a "last conn pointer" in rxi_FindConnection. The odds are
387 ** pretty good that the next packet coming in is from the same connection
388 ** as the last packet, since we're send multiple packets in a transmit window.
390 struct rx_connection *rxLastConn = 0;
392 #ifdef RX_ENABLE_LOCKS
393 /* The locking hierarchy for rx fine grain locking is composed of these
396 * rx_connHashTable_lock - synchronizes conn creation, rx_connHashTable access
397 * conn_call_lock - used to synchonize rx_EndCall and rx_NewCall
398 * call->lock - locks call data fields.
399 * These are independent of each other:
400 * rx_freeCallQueue_lock
405 * serverQueueEntry->lock
406 * rx_peerHashTable_lock - locked under rx_connHashTable_lock
408 * peer->lock - locks peer data fields.
409 * conn_data_lock - that more than one thread is not updating a conn data
410 * field at the same time.
421 * Do we need a lock to protect the peer field in the conn structure?
422 * conn->peer was previously a constant for all intents and so has no
423 * lock protecting this field. The multihomed client delta introduced
424 * a RX code change : change the peer field in the connection structure
425 * to that remote interface from which the last packet for this
426 * connection was sent out. This may become an issue if further changes
429 #define SET_CALL_QUEUE_LOCK(C, L) (C)->call_queue_lock = (L)
430 #define CLEAR_CALL_QUEUE_LOCK(C) (C)->call_queue_lock = NULL
432 /* rxdb_fileID is used to identify the lock location, along with line#. */
433 static int rxdb_fileID = RXDB_FILE_RX;
434 #endif /* RX_LOCKS_DB */
435 #else /* RX_ENABLE_LOCKS */
436 #define SET_CALL_QUEUE_LOCK(C, L)
437 #define CLEAR_CALL_QUEUE_LOCK(C)
438 #endif /* RX_ENABLE_LOCKS */
439 struct rx_serverQueueEntry *rx_waitForPacket = 0;
441 /* ------------Exported Interfaces------------- */
443 /* This function allows rxkad to set the epoch to a suitably random number
444 * which rx_NewConnection will use in the future. The principle purpose is to
445 * get rxnull connections to use the same epoch as the rxkad connections do, at
446 * least once the first rxkad connection is established. This is important now
447 * that the host/port addresses aren't used in FindConnection: the uniqueness
448 * of epoch/cid matters and the start time won't do. */
450 #ifdef AFS_PTHREAD_ENV
452 * This mutex protects the following global variables:
456 #define LOCK_EPOCH MUTEX_ENTER(&epoch_mutex)
457 #define UNLOCK_EPOCH MUTEX_EXIT(&epoch_mutex)
461 #endif /* AFS_PTHREAD_ENV */
464 rx_SetEpoch(afs_uint32 epoch)
471 /* Initialize rx. A port number may be mentioned, in which case this
472 * becomes the default port number for any service installed later.
473 * If 0 is provided for the port number, a random port will be chosen
474 * by the kernel. Whether this will ever overlap anything in
475 * /etc/services is anybody's guess... Returns 0 on success, -1 on
480 rx_atomic_t rxinit_status = RX_ATOMIC_INIT(1);
483 rx_InitHost(u_int host, u_int port)
490 char *htable, *ptable;
495 if (!rx_atomic_test_and_clear_bit(&rxinit_status, 0))
496 return 0; /* already started */
502 if (afs_winsockInit() < 0)
508 * Initialize anything necessary to provide a non-premptive threading
511 rxi_InitializeThreadSupport();
514 /* Allocate and initialize a socket for client and perhaps server
517 rx_socket = rxi_GetHostUDPSocket(host, (u_short) port);
518 if (rx_socket == OSI_NULLSOCKET) {
521 #if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
524 #endif /* RX_LOCKS_DB */
525 MUTEX_INIT(&rx_stats_mutex, "rx_stats_mutex", MUTEX_DEFAULT, 0);
526 MUTEX_INIT(&rx_quota_mutex, "rx_quota_mutex", MUTEX_DEFAULT, 0);
527 MUTEX_INIT(&rx_atomic_mutex, "rx_atomic_mutex", MUTEX_DEFAULT, 0);
528 MUTEX_INIT(&rx_pthread_mutex, "rx_pthread_mutex", MUTEX_DEFAULT, 0);
529 MUTEX_INIT(&rx_packets_mutex, "rx_packets_mutex", MUTEX_DEFAULT, 0);
530 MUTEX_INIT(&rx_refcnt_mutex, "rx_refcnt_mutex", MUTEX_DEFAULT, 0);
531 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
532 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
533 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
534 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
536 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
538 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
540 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
542 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
543 #if defined(AFS_HPUX110_ENV)
545 rx_sleepLock = alloc_spinlock(LAST_HELD_ORDER - 10, "rx_sleepLock");
546 #endif /* AFS_HPUX110_ENV */
547 #endif /* RX_ENABLE_LOCKS && KERNEL */
550 rx_connDeadTime = 12;
551 rx_tranquil = 0; /* reset flag */
552 rxi_ResetStatistics();
553 htable = osi_Alloc(rx_hashTableSize * sizeof(struct rx_connection *));
554 PIN(htable, rx_hashTableSize * sizeof(struct rx_connection *)); /* XXXXX */
555 memset(htable, 0, rx_hashTableSize * sizeof(struct rx_connection *));
556 ptable = osi_Alloc(rx_hashTableSize * sizeof(struct rx_peer *));
557 PIN(ptable, rx_hashTableSize * sizeof(struct rx_peer *)); /* XXXXX */
558 memset(ptable, 0, rx_hashTableSize * sizeof(struct rx_peer *));
560 /* Malloc up a bunch of packets & buffers */
562 opr_queue_Init(&rx_freePacketQueue);
563 rxi_NeedMorePackets = FALSE;
564 rx_nPackets = 0; /* rx_nPackets is managed by rxi_MorePackets* */
566 /* enforce a minimum number of allocated packets */
567 if (rx_extraPackets < rxi_nSendFrags * rx_maxSendWindow)
568 rx_extraPackets = rxi_nSendFrags * rx_maxSendWindow;
570 /* allocate the initial free packet pool */
571 #ifdef RX_ENABLE_TSFPQ
572 rxi_MorePacketsTSFPQ(rx_extraPackets + RX_MAX_QUOTA + 2, RX_TS_FPQ_FLUSH_GLOBAL, 0);
573 #else /* RX_ENABLE_TSFPQ */
574 rxi_MorePackets(rx_extraPackets + RX_MAX_QUOTA + 2); /* fudge */
575 #endif /* RX_ENABLE_TSFPQ */
582 #if defined(AFS_NT40_ENV) && !defined(AFS_PTHREAD_ENV)
583 tv.tv_sec = clock_now.sec;
584 tv.tv_usec = clock_now.usec;
585 srand((unsigned int)tv.tv_usec);
592 #if defined(KERNEL) && !defined(UKERNEL)
593 /* Really, this should never happen in a real kernel */
596 struct sockaddr_in addr;
598 int addrlen = sizeof(addr);
600 socklen_t addrlen = sizeof(addr);
602 if (getsockname((intptr_t)rx_socket, (struct sockaddr *)&addr, &addrlen)) {
604 osi_Free(htable, rx_hashTableSize * sizeof(struct rx_connection *));
607 rx_port = addr.sin_port;
610 rx_stats.minRtt.sec = 9999999;
612 rx_SetEpoch(tv.tv_sec | 0x80000000);
614 rx_SetEpoch(tv.tv_sec); /* Start time of this package, rxkad
615 * will provide a randomer value. */
617 MUTEX_ENTER(&rx_quota_mutex);
618 rxi_dataQuota += rx_extraQuota; /* + extra pkts caller asked to rsrv */
619 MUTEX_EXIT(&rx_quota_mutex);
620 /* *Slightly* random start time for the cid. This is just to help
621 * out with the hashing function at the peer */
622 rx_nextCid = ((tv.tv_sec ^ tv.tv_usec) << RX_CIDSHIFT);
623 rx_connHashTable = (struct rx_connection **)htable;
624 rx_peerHashTable = (struct rx_peer **)ptable;
626 rx_hardAckDelay.sec = 0;
627 rx_hardAckDelay.usec = 100000; /* 100 milliseconds */
629 rxevent_Init(20, rxi_ReScheduleEvents);
631 /* Initialize various global queues */
632 opr_queue_Init(&rx_idleServerQueue);
633 opr_queue_Init(&rx_incomingCallQueue);
634 opr_queue_Init(&rx_freeCallQueue);
636 #if defined(AFS_NT40_ENV) && !defined(KERNEL)
637 /* Initialize our list of usable IP addresses. */
641 /* Start listener process (exact function is dependent on the
642 * implementation environment--kernel or user space) */
646 rx_atomic_clear_bit(&rxinit_status, 0);
653 return rx_InitHost(htonl(INADDR_ANY), port);
659 * The rxi_rto functions implement a TCP (RFC2988) style algorithm for
660 * maintaing the round trip timer.
665 * Start a new RTT timer for a given call and packet.
667 * There must be no resendEvent already listed for this call, otherwise this
668 * will leak events - intended for internal use within the RTO code only
671 * the RX call to start the timer for
672 * @param[in] lastPacket
673 * a flag indicating whether the last packet has been sent or not
675 * @pre call must be locked before calling this function
679 rxi_rto_startTimer(struct rx_call *call, int lastPacket, int istack)
681 struct clock now, retryTime;
686 clock_Add(&retryTime, &call->rto);
688 /* If we're sending the last packet, and we're the client, then the server
689 * may wait for an additional 400ms before returning the ACK, wait for it
690 * rather than hitting a timeout */
691 if (lastPacket && call->conn->type == RX_CLIENT_CONNECTION)
692 clock_Addmsec(&retryTime, 400);
694 CALL_HOLD(call, RX_CALL_REFCOUNT_RESEND);
695 call->resendEvent = rxevent_Post(&retryTime, &now, rxi_Resend,
700 * Cancel an RTT timer for a given call.
704 * the RX call to cancel the timer for
706 * @pre call must be locked before calling this function
711 rxi_rto_cancel(struct rx_call *call)
713 rxevent_Cancel(&call->resendEvent);
714 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
718 * Tell the RTO timer that we have sent a packet.
720 * If the timer isn't already running, then start it. If the timer is running,
724 * the RX call that the packet has been sent on
725 * @param[in] lastPacket
726 * A flag which is true if this is the last packet for the call
728 * @pre The call must be locked before calling this function
733 rxi_rto_packet_sent(struct rx_call *call, int lastPacket, int istack)
735 if (call->resendEvent)
738 rxi_rto_startTimer(call, lastPacket, istack);
742 * Tell the RTO timer that we have received an new ACK message
744 * This function should be called whenever a call receives an ACK that
745 * acknowledges new packets. Whatever happens, we stop the current timer.
746 * If there are unacked packets in the queue which have been sent, then
747 * we restart the timer from now. Otherwise, we leave it stopped.
750 * the RX call that the ACK has been received on
754 rxi_rto_packet_acked(struct rx_call *call, int istack)
756 struct opr_queue *cursor;
758 rxi_rto_cancel(call);
760 if (opr_queue_IsEmpty(&call->tq))
763 for (opr_queue_Scan(&call->tq, cursor)) {
764 struct rx_packet *p = opr_queue_Entry(cursor, struct rx_packet, entry);
765 if (p->header.seq > call->tfirst + call->twind)
768 if (!(p->flags & RX_PKTFLAG_ACKED) && p->flags & RX_PKTFLAG_SENT) {
769 rxi_rto_startTimer(call, p->header.flags & RX_LAST_PACKET, istack);
777 * Set an initial round trip timeout for a peer connection
779 * @param[in] secs The timeout to set in seconds
783 rx_rto_setPeerTimeoutSecs(struct rx_peer *peer, int secs) {
784 peer->rtt = secs * 8000;
788 * Enables or disables the busy call channel error (RX_CALL_BUSY).
790 * @param[in] onoff Non-zero to enable busy call channel errors.
792 * @pre Neither rx_Init nor rx_InitHost have been called yet
795 rx_SetBusyChannelError(afs_int32 onoff)
797 osi_Assert(rx_atomic_test_bit(&rxinit_status, 0));
798 rxi_busyChannelError = onoff ? 1 : 0;
802 * Set a delayed ack event on the specified call for the given time
804 * @param[in] call - the call on which to set the event
805 * @param[in] offset - the delay from now after which the event fires
808 rxi_PostDelayedAckEvent(struct rx_call *call, struct clock *offset)
810 struct clock now, when;
814 clock_Add(&when, offset);
816 if (call->delayedAckEvent && clock_Gt(&call->delayedAckTime, &when)) {
817 /* The event we're cancelling already has a reference, so we don't
819 rxevent_Cancel(&call->delayedAckEvent);
820 call->delayedAckEvent = rxevent_Post(&when, &now, rxi_SendDelayedAck,
823 call->delayedAckTime = when;
824 } else if (!call->delayedAckEvent) {
825 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
826 call->delayedAckEvent = rxevent_Post(&when, &now,
829 call->delayedAckTime = when;
834 rxi_CancelDelayedAckEvent(struct rx_call *call)
836 if (call->delayedAckEvent) {
837 rxevent_Cancel(&call->delayedAckEvent);
838 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
842 /* called with unincremented nRequestsRunning to see if it is OK to start
843 * a new thread in this service. Could be "no" for two reasons: over the
844 * max quota, or would prevent others from reaching their min quota.
846 #ifdef RX_ENABLE_LOCKS
847 /* This verion of QuotaOK reserves quota if it's ok while the
848 * rx_serverPool_lock is held. Return quota using ReturnToServerPool().
851 QuotaOK(struct rx_service *aservice)
853 /* check if over max quota */
854 if (aservice->nRequestsRunning >= aservice->maxProcs) {
858 /* under min quota, we're OK */
859 /* otherwise, can use only if there are enough to allow everyone
860 * to go to their min quota after this guy starts.
863 MUTEX_ENTER(&rx_quota_mutex);
864 if ((aservice->nRequestsRunning < aservice->minProcs)
865 || (rxi_availProcs > rxi_minDeficit)) {
866 aservice->nRequestsRunning++;
867 /* just started call in minProcs pool, need fewer to maintain
869 if (aservice->nRequestsRunning <= aservice->minProcs)
872 MUTEX_EXIT(&rx_quota_mutex);
875 MUTEX_EXIT(&rx_quota_mutex);
881 ReturnToServerPool(struct rx_service *aservice)
883 aservice->nRequestsRunning--;
884 MUTEX_ENTER(&rx_quota_mutex);
885 if (aservice->nRequestsRunning < aservice->minProcs)
888 MUTEX_EXIT(&rx_quota_mutex);
891 #else /* RX_ENABLE_LOCKS */
893 QuotaOK(struct rx_service *aservice)
896 /* under min quota, we're OK */
897 if (aservice->nRequestsRunning < aservice->minProcs)
900 /* check if over max quota */
901 if (aservice->nRequestsRunning >= aservice->maxProcs)
904 /* otherwise, can use only if there are enough to allow everyone
905 * to go to their min quota after this guy starts.
907 MUTEX_ENTER(&rx_quota_mutex);
908 if (rxi_availProcs > rxi_minDeficit)
910 MUTEX_EXIT(&rx_quota_mutex);
913 #endif /* RX_ENABLE_LOCKS */
916 /* Called by rx_StartServer to start up lwp's to service calls.
917 NExistingProcs gives the number of procs already existing, and which
918 therefore needn't be created. */
920 rxi_StartServerProcs(int nExistingProcs)
922 struct rx_service *service;
927 /* For each service, reserve N processes, where N is the "minimum"
928 * number of processes that MUST be able to execute a request in parallel,
929 * at any time, for that process. Also compute the maximum difference
930 * between any service's maximum number of processes that can run
931 * (i.e. the maximum number that ever will be run, and a guarantee
932 * that this number will run if other services aren't running), and its
933 * minimum number. The result is the extra number of processes that
934 * we need in order to provide the latter guarantee */
935 for (i = 0; i < RX_MAX_SERVICES; i++) {
937 service = rx_services[i];
938 if (service == (struct rx_service *)0)
940 nProcs += service->minProcs;
941 diff = service->maxProcs - service->minProcs;
945 nProcs += maxdiff; /* Extra processes needed to allow max number requested to run in any given service, under good conditions */
946 nProcs -= nExistingProcs; /* Subtract the number of procs that were previously created for use as server procs */
947 for (i = 0; i < nProcs; i++) {
948 rxi_StartServerProc(rx_ServerProc, rx_stackSize);
954 /* This routine is only required on Windows */
956 rx_StartClientThread(void)
958 #ifdef AFS_PTHREAD_ENV
960 pid = pthread_self();
961 #endif /* AFS_PTHREAD_ENV */
963 #endif /* AFS_NT40_ENV */
965 /* This routine must be called if any services are exported. If the
966 * donateMe flag is set, the calling process is donated to the server
969 rx_StartServer(int donateMe)
971 struct rx_service *service;
977 /* Start server processes, if necessary (exact function is dependent
978 * on the implementation environment--kernel or user space). DonateMe
979 * will be 1 if there is 1 pre-existing proc, i.e. this one. In this
980 * case, one less new proc will be created rx_StartServerProcs.
982 rxi_StartServerProcs(donateMe);
984 /* count up the # of threads in minProcs, and add set the min deficit to
985 * be that value, too.
987 for (i = 0; i < RX_MAX_SERVICES; i++) {
988 service = rx_services[i];
989 if (service == (struct rx_service *)0)
991 MUTEX_ENTER(&rx_quota_mutex);
992 rxi_totalMin += service->minProcs;
993 /* below works even if a thread is running, since minDeficit would
994 * still have been decremented and later re-incremented.
996 rxi_minDeficit += service->minProcs;
997 MUTEX_EXIT(&rx_quota_mutex);
1000 /* Turn on reaping of idle server connections */
1001 rxi_ReapConnections(NULL, NULL, NULL, 0);
1006 #ifndef AFS_NT40_ENV
1010 #ifdef AFS_PTHREAD_ENV
1012 pid = afs_pointer_to_int(pthread_self());
1013 #else /* AFS_PTHREAD_ENV */
1015 LWP_CurrentProcess(&pid);
1016 #endif /* AFS_PTHREAD_ENV */
1018 sprintf(name, "srv_%d", ++nProcs);
1019 if (registerProgram)
1020 (*registerProgram) (pid, name);
1022 #endif /* AFS_NT40_ENV */
1023 rx_ServerProc(NULL); /* Never returns */
1025 #ifdef RX_ENABLE_TSFPQ
1026 /* no use leaving packets around in this thread's local queue if
1027 * it isn't getting donated to the server thread pool.
1029 rxi_FlushLocalPacketsTSFPQ();
1030 #endif /* RX_ENABLE_TSFPQ */
1034 /* Create a new client connection to the specified service, using the
1035 * specified security object to implement the security model for this
1037 struct rx_connection *
1038 rx_NewConnection(afs_uint32 shost, u_short sport, u_short sservice,
1039 struct rx_securityClass *securityObject,
1040 int serviceSecurityIndex)
1044 struct rx_connection *conn;
1049 dpf(("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
1050 "serviceSecurityIndex %d)\n",
1051 ntohl(shost), ntohs(sport), sservice, securityObject,
1052 serviceSecurityIndex));
1054 /* Vasilsi said: "NETPRI protects Cid and Alloc", but can this be true in
1055 * the case of kmem_alloc? */
1056 conn = rxi_AllocConnection();
1057 #ifdef RX_ENABLE_LOCKS
1058 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
1059 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
1060 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
1063 MUTEX_ENTER(&rx_connHashTable_lock);
1064 cid = (rx_nextCid += RX_MAXCALLS);
1065 conn->type = RX_CLIENT_CONNECTION;
1067 conn->epoch = rx_epoch;
1068 conn->peer = rxi_FindPeer(shost, sport, 1);
1069 conn->serviceId = sservice;
1070 conn->securityObject = securityObject;
1071 conn->securityData = (void *) 0;
1072 conn->securityIndex = serviceSecurityIndex;
1073 rx_SetConnDeadTime(conn, rx_connDeadTime);
1074 rx_SetConnSecondsUntilNatPing(conn, 0);
1075 conn->ackRate = RX_FAST_ACK_RATE;
1076 conn->nSpecific = 0;
1077 conn->specific = NULL;
1078 conn->challengeEvent = NULL;
1079 conn->delayedAbortEvent = NULL;
1080 conn->abortCount = 0;
1082 for (i = 0; i < RX_MAXCALLS; i++) {
1083 conn->twind[i] = rx_initSendWindow;
1084 conn->rwind[i] = rx_initReceiveWindow;
1085 conn->lastBusy[i] = 0;
1088 RXS_NewConnection(securityObject, conn);
1090 CONN_HASH(shost, sport, conn->cid, conn->epoch, RX_CLIENT_CONNECTION);
1092 conn->refCount++; /* no lock required since only this thread knows... */
1093 conn->next = rx_connHashTable[hashindex];
1094 rx_connHashTable[hashindex] = conn;
1095 if (rx_stats_active)
1096 rx_atomic_inc(&rx_stats.nClientConns);
1097 MUTEX_EXIT(&rx_connHashTable_lock);
1103 * Ensure a connection's timeout values are valid.
1105 * @param[in] conn The connection to check
1107 * @post conn->secondUntilDead <= conn->idleDeadTime <= conn->hardDeadTime,
1108 * unless idleDeadTime and/or hardDeadTime are not set
1112 rxi_CheckConnTimeouts(struct rx_connection *conn)
1114 /* a connection's timeouts must have the relationship
1115 * deadTime <= idleDeadTime <= hardDeadTime. Otherwise, for example, a
1116 * total loss of network to a peer may cause an idle timeout instead of a
1117 * dead timeout, simply because the idle timeout gets hit first. Also set
1118 * a minimum deadTime of 6, just to ensure it doesn't get set too low. */
1119 /* this logic is slightly complicated by the fact that
1120 * idleDeadTime/hardDeadTime may not be set at all, but it's not too bad.
1122 conn->secondsUntilDead = MAX(conn->secondsUntilDead, 6);
1123 if (conn->idleDeadTime) {
1124 conn->idleDeadTime = MAX(conn->idleDeadTime, conn->secondsUntilDead);
1126 if (conn->hardDeadTime) {
1127 if (conn->idleDeadTime) {
1128 conn->hardDeadTime = MAX(conn->idleDeadTime, conn->hardDeadTime);
1130 conn->hardDeadTime = MAX(conn->secondsUntilDead, conn->hardDeadTime);
1136 rx_SetConnDeadTime(struct rx_connection *conn, int seconds)
1138 /* The idea is to set the dead time to a value that allows several
1139 * keepalives to be dropped without timing out the connection. */
1140 conn->secondsUntilDead = seconds;
1141 rxi_CheckConnTimeouts(conn);
1142 conn->secondsUntilPing = conn->secondsUntilDead / 6;
1146 rx_SetConnHardDeadTime(struct rx_connection *conn, int seconds)
1148 conn->hardDeadTime = seconds;
1149 rxi_CheckConnTimeouts(conn);
1153 rx_SetConnIdleDeadTime(struct rx_connection *conn, int seconds)
1155 conn->idleDeadTime = seconds;
1156 conn->idleDeadDetection = (seconds ? 1 : 0);
1157 rxi_CheckConnTimeouts(conn);
1160 int rxi_lowPeerRefCount = 0;
1161 int rxi_lowConnRefCount = 0;
1164 * Cleanup a connection that was destroyed in rxi_DestroyConnectioNoLock.
1165 * NOTE: must not be called with rx_connHashTable_lock held.
1168 rxi_CleanupConnection(struct rx_connection *conn)
1170 /* Notify the service exporter, if requested, that this connection
1171 * is being destroyed */
1172 if (conn->type == RX_SERVER_CONNECTION && conn->service->destroyConnProc)
1173 (*conn->service->destroyConnProc) (conn);
1175 /* Notify the security module that this connection is being destroyed */
1176 RXS_DestroyConnection(conn->securityObject, conn);
1178 /* If this is the last connection using the rx_peer struct, set its
1179 * idle time to now. rxi_ReapConnections will reap it if it's still
1180 * idle (refCount == 0) after rx_idlePeerTime (60 seconds) have passed.
1182 MUTEX_ENTER(&rx_peerHashTable_lock);
1183 if (conn->peer->refCount < 2) {
1184 conn->peer->idleWhen = clock_Sec();
1185 if (conn->peer->refCount < 1) {
1186 conn->peer->refCount = 1;
1187 if (rx_stats_active) {
1188 MUTEX_ENTER(&rx_stats_mutex);
1189 rxi_lowPeerRefCount++;
1190 MUTEX_EXIT(&rx_stats_mutex);
1194 conn->peer->refCount--;
1195 MUTEX_EXIT(&rx_peerHashTable_lock);
1197 if (rx_stats_active)
1199 if (conn->type == RX_SERVER_CONNECTION)
1200 rx_atomic_dec(&rx_stats.nServerConns);
1202 rx_atomic_dec(&rx_stats.nClientConns);
1205 if (conn->specific) {
1207 for (i = 0; i < conn->nSpecific; i++) {
1208 if (conn->specific[i] && rxi_keyCreate_destructor[i])
1209 (*rxi_keyCreate_destructor[i]) (conn->specific[i]);
1210 conn->specific[i] = NULL;
1212 free(conn->specific);
1214 conn->specific = NULL;
1215 conn->nSpecific = 0;
1216 #endif /* !KERNEL */
1218 MUTEX_DESTROY(&conn->conn_call_lock);
1219 MUTEX_DESTROY(&conn->conn_data_lock);
1220 CV_DESTROY(&conn->conn_call_cv);
1222 rxi_FreeConnection(conn);
1225 /* Destroy the specified connection */
1227 rxi_DestroyConnection(struct rx_connection *conn)
1229 MUTEX_ENTER(&rx_connHashTable_lock);
1230 rxi_DestroyConnectionNoLock(conn);
1231 /* conn should be at the head of the cleanup list */
1232 if (conn == rx_connCleanup_list) {
1233 rx_connCleanup_list = rx_connCleanup_list->next;
1234 MUTEX_EXIT(&rx_connHashTable_lock);
1235 rxi_CleanupConnection(conn);
1237 #ifdef RX_ENABLE_LOCKS
1239 MUTEX_EXIT(&rx_connHashTable_lock);
1241 #endif /* RX_ENABLE_LOCKS */
1245 rxi_DestroyConnectionNoLock(struct rx_connection *conn)
1247 struct rx_connection **conn_ptr;
1249 struct rx_packet *packet;
1256 MUTEX_ENTER(&conn->conn_data_lock);
1257 MUTEX_ENTER(&rx_refcnt_mutex);
1258 if (conn->refCount > 0)
1261 if (rx_stats_active) {
1262 MUTEX_ENTER(&rx_stats_mutex);
1263 rxi_lowConnRefCount++;
1264 MUTEX_EXIT(&rx_stats_mutex);
1268 if ((conn->refCount > 0) || (conn->flags & RX_CONN_BUSY)) {
1269 /* Busy; wait till the last guy before proceeding */
1270 MUTEX_EXIT(&rx_refcnt_mutex);
1271 MUTEX_EXIT(&conn->conn_data_lock);
1276 /* If the client previously called rx_NewCall, but it is still
1277 * waiting, treat this as a running call, and wait to destroy the
1278 * connection later when the call completes. */
1279 if ((conn->type == RX_CLIENT_CONNECTION)
1280 && (conn->flags & (RX_CONN_MAKECALL_WAITING|RX_CONN_MAKECALL_ACTIVE))) {
1281 conn->flags |= RX_CONN_DESTROY_ME;
1282 MUTEX_EXIT(&conn->conn_data_lock);
1286 MUTEX_EXIT(&rx_refcnt_mutex);
1287 MUTEX_EXIT(&conn->conn_data_lock);
1289 /* Check for extant references to this connection */
1290 MUTEX_ENTER(&conn->conn_call_lock);
1291 for (i = 0; i < RX_MAXCALLS; i++) {
1292 struct rx_call *call = conn->call[i];
1295 if (conn->type == RX_CLIENT_CONNECTION) {
1296 MUTEX_ENTER(&call->lock);
1297 if (call->delayedAckEvent) {
1298 /* Push the final acknowledgment out now--there
1299 * won't be a subsequent call to acknowledge the
1300 * last reply packets */
1301 rxi_CancelDelayedAckEvent(call);
1302 if (call->state == RX_STATE_PRECALL
1303 || call->state == RX_STATE_ACTIVE) {
1304 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1309 MUTEX_EXIT(&call->lock);
1313 MUTEX_EXIT(&conn->conn_call_lock);
1315 #ifdef RX_ENABLE_LOCKS
1317 if (MUTEX_TRYENTER(&conn->conn_data_lock)) {
1318 MUTEX_EXIT(&conn->conn_data_lock);
1320 /* Someone is accessing a packet right now. */
1324 #endif /* RX_ENABLE_LOCKS */
1327 /* Don't destroy the connection if there are any call
1328 * structures still in use */
1329 MUTEX_ENTER(&conn->conn_data_lock);
1330 conn->flags |= RX_CONN_DESTROY_ME;
1331 MUTEX_EXIT(&conn->conn_data_lock);
1336 if (conn->natKeepAliveEvent) {
1337 rxi_NatKeepAliveOff(conn);
1340 if (conn->delayedAbortEvent) {
1341 rxevent_Cancel(&conn->delayedAbortEvent);
1342 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
1344 MUTEX_ENTER(&conn->conn_data_lock);
1345 rxi_SendConnectionAbort(conn, packet, 0, 1);
1346 MUTEX_EXIT(&conn->conn_data_lock);
1347 rxi_FreePacket(packet);
1351 /* Remove from connection hash table before proceeding */
1353 &rx_connHashTable[CONN_HASH
1354 (peer->host, peer->port, conn->cid, conn->epoch,
1356 for (; *conn_ptr; conn_ptr = &(*conn_ptr)->next) {
1357 if (*conn_ptr == conn) {
1358 *conn_ptr = conn->next;
1362 /* if the conn that we are destroying was the last connection, then we
1363 * clear rxLastConn as well */
1364 if (rxLastConn == conn)
1367 /* Make sure the connection is completely reset before deleting it. */
1368 /* get rid of pending events that could zap us later */
1369 rxevent_Cancel(&conn->challengeEvent);
1370 rxevent_Cancel(&conn->checkReachEvent);
1371 rxevent_Cancel(&conn->natKeepAliveEvent);
1373 /* Add the connection to the list of destroyed connections that
1374 * need to be cleaned up. This is necessary to avoid deadlocks
1375 * in the routines we call to inform others that this connection is
1376 * being destroyed. */
1377 conn->next = rx_connCleanup_list;
1378 rx_connCleanup_list = conn;
1381 /* Externally available version */
1383 rx_DestroyConnection(struct rx_connection *conn)
1388 rxi_DestroyConnection(conn);
1393 rx_GetConnection(struct rx_connection *conn)
1398 MUTEX_ENTER(&rx_refcnt_mutex);
1400 MUTEX_EXIT(&rx_refcnt_mutex);
1404 #ifdef RX_ENABLE_LOCKS
1405 /* Wait for the transmit queue to no longer be busy.
1406 * requires the call->lock to be held */
1408 rxi_WaitforTQBusy(struct rx_call *call) {
1409 while (!call->error && (call->flags & RX_CALL_TQ_BUSY)) {
1410 call->flags |= RX_CALL_TQ_WAIT;
1412 MUTEX_ASSERT(&call->lock);
1413 CV_WAIT(&call->cv_tq, &call->lock);
1415 if (call->tqWaiters == 0) {
1416 call->flags &= ~RX_CALL_TQ_WAIT;
1423 rxi_WakeUpTransmitQueue(struct rx_call *call)
1425 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
1426 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",
1427 call, call->tqWaiters, call->flags));
1428 #ifdef RX_ENABLE_LOCKS
1429 MUTEX_ASSERT(&call->lock);
1430 CV_BROADCAST(&call->cv_tq);
1431 #else /* RX_ENABLE_LOCKS */
1432 osi_rxWakeup(&call->tq);
1433 #endif /* RX_ENABLE_LOCKS */
1437 /* Start a new rx remote procedure call, on the specified connection.
1438 * If wait is set to 1, wait for a free call channel; otherwise return
1439 * 0. Maxtime gives the maximum number of seconds this call may take,
1440 * after rx_NewCall returns. After this time interval, a call to any
1441 * of rx_SendData, rx_ReadData, etc. will fail with RX_CALL_TIMEOUT.
1442 * For fine grain locking, we hold the conn_call_lock in order to
1443 * to ensure that we don't get signalle after we found a call in an active
1444 * state and before we go to sleep.
1447 rx_NewCall(struct rx_connection *conn)
1449 int i, wait, ignoreBusy = 1;
1450 struct rx_call *call;
1451 struct clock queueTime;
1452 afs_uint32 leastBusy = 0;
1456 dpf(("rx_NewCall(conn %"AFS_PTR_FMT")\n", conn));
1459 clock_GetTime(&queueTime);
1461 * Check if there are others waiting for a new call.
1462 * If so, let them go first to avoid starving them.
1463 * This is a fairly simple scheme, and might not be
1464 * a complete solution for large numbers of waiters.
1466 * makeCallWaiters keeps track of the number of
1467 * threads waiting to make calls and the
1468 * RX_CONN_MAKECALL_WAITING flag bit is used to
1469 * indicate that there are indeed calls waiting.
1470 * The flag is set when the waiter is incremented.
1471 * It is only cleared when makeCallWaiters is 0.
1472 * This prevents us from accidently destroying the
1473 * connection while it is potentially about to be used.
1475 MUTEX_ENTER(&conn->conn_call_lock);
1476 MUTEX_ENTER(&conn->conn_data_lock);
1477 while (conn->flags & RX_CONN_MAKECALL_ACTIVE) {
1478 conn->flags |= RX_CONN_MAKECALL_WAITING;
1479 conn->makeCallWaiters++;
1480 MUTEX_EXIT(&conn->conn_data_lock);
1482 #ifdef RX_ENABLE_LOCKS
1483 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1487 MUTEX_ENTER(&conn->conn_data_lock);
1488 conn->makeCallWaiters--;
1489 if (conn->makeCallWaiters == 0)
1490 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1493 /* We are now the active thread in rx_NewCall */
1494 conn->flags |= RX_CONN_MAKECALL_ACTIVE;
1495 MUTEX_EXIT(&conn->conn_data_lock);
1500 for (i = 0; i < RX_MAXCALLS; i++) {
1501 call = conn->call[i];
1503 if (!ignoreBusy && conn->lastBusy[i] != leastBusy) {
1504 /* we're not ignoring busy call slots; only look at the
1505 * call slot that is the "least" busy */
1509 if (call->state == RX_STATE_DALLY) {
1510 MUTEX_ENTER(&call->lock);
1511 if (call->state == RX_STATE_DALLY) {
1512 if (ignoreBusy && conn->lastBusy[i]) {
1513 /* if we're ignoring busy call slots, skip any ones that
1514 * have lastBusy set */
1515 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1516 leastBusy = conn->lastBusy[i];
1518 MUTEX_EXIT(&call->lock);
1523 * We are setting the state to RX_STATE_RESET to
1524 * ensure that no one else will attempt to use this
1525 * call once we drop the conn->conn_call_lock and
1526 * call->lock. We must drop the conn->conn_call_lock
1527 * before calling rxi_ResetCall because the process
1528 * of clearing the transmit queue can block for an
1529 * extended period of time. If we block while holding
1530 * the conn->conn_call_lock, then all rx_EndCall
1531 * processing will block as well. This has a detrimental
1532 * effect on overall system performance.
1534 call->state = RX_STATE_RESET;
1535 (*call->callNumber)++;
1536 MUTEX_EXIT(&conn->conn_call_lock);
1537 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1538 rxi_ResetCall(call, 0);
1539 if (MUTEX_TRYENTER(&conn->conn_call_lock))
1543 * If we failed to be able to safely obtain the
1544 * conn->conn_call_lock we will have to drop the
1545 * call->lock to avoid a deadlock. When the call->lock
1546 * is released the state of the call can change. If it
1547 * is no longer RX_STATE_RESET then some other thread is
1550 MUTEX_EXIT(&call->lock);
1551 MUTEX_ENTER(&conn->conn_call_lock);
1552 MUTEX_ENTER(&call->lock);
1554 if (call->state == RX_STATE_RESET)
1558 * If we get here it means that after dropping
1559 * the conn->conn_call_lock and call->lock that
1560 * the call is no longer ours. If we can't find
1561 * a free call in the remaining slots we should
1562 * not go immediately to RX_CONN_MAKECALL_WAITING
1563 * because by dropping the conn->conn_call_lock
1564 * we have given up synchronization with rx_EndCall.
1565 * Instead, cycle through one more time to see if
1566 * we can find a call that can call our own.
1568 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
1571 MUTEX_EXIT(&call->lock);
1574 if (ignoreBusy && conn->lastBusy[i]) {
1575 /* if we're ignoring busy call slots, skip any ones that
1576 * have lastBusy set */
1577 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1578 leastBusy = conn->lastBusy[i];
1583 /* rxi_NewCall returns with mutex locked */
1584 call = rxi_NewCall(conn, i);
1585 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1589 if (i < RX_MAXCALLS) {
1590 conn->lastBusy[i] = 0;
1591 call->flags &= ~RX_CALL_PEER_BUSY;
1596 if (leastBusy && ignoreBusy) {
1597 /* we didn't find a useable call slot, but we did see at least one
1598 * 'busy' slot; look again and only use a slot with the 'least
1604 MUTEX_ENTER(&conn->conn_data_lock);
1605 conn->flags |= RX_CONN_MAKECALL_WAITING;
1606 conn->makeCallWaiters++;
1607 MUTEX_EXIT(&conn->conn_data_lock);
1609 #ifdef RX_ENABLE_LOCKS
1610 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1614 MUTEX_ENTER(&conn->conn_data_lock);
1615 conn->makeCallWaiters--;
1616 if (conn->makeCallWaiters == 0)
1617 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1618 MUTEX_EXIT(&conn->conn_data_lock);
1620 /* Client is initially in send mode */
1621 call->state = RX_STATE_ACTIVE;
1622 call->error = conn->error;
1624 call->app.mode = RX_MODE_ERROR;
1626 call->app.mode = RX_MODE_SENDING;
1628 #ifdef AFS_RXERRQ_ENV
1629 /* remember how many network errors the peer has when we started, so if
1630 * more errors are encountered after the call starts, we know the other endpoint won't be
1631 * responding to us */
1632 call->neterr_gen = rx_atomic_read(&conn->peer->neterrs);
1635 /* remember start time for call in case we have hard dead time limit */
1636 call->queueTime = queueTime;
1637 clock_GetTime(&call->startTime);
1638 call->app.bytesSent = 0;
1639 call->app.bytesRcvd = 0;
1641 /* Turn on busy protocol. */
1642 rxi_KeepAliveOn(call);
1644 /* Attempt MTU discovery */
1645 rxi_GrowMTUOn(call);
1648 * We are no longer the active thread in rx_NewCall
1650 MUTEX_ENTER(&conn->conn_data_lock);
1651 conn->flags &= ~RX_CONN_MAKECALL_ACTIVE;
1652 MUTEX_EXIT(&conn->conn_data_lock);
1655 * Wake up anyone else who might be giving us a chance to
1656 * run (see code above that avoids resource starvation).
1658 #ifdef RX_ENABLE_LOCKS
1659 if (call->flags & (RX_CALL_TQ_BUSY | RX_CALL_TQ_CLEARME)) {
1660 osi_Panic("rx_NewCall call about to be used without an empty tq");
1663 CV_BROADCAST(&conn->conn_call_cv);
1667 MUTEX_EXIT(&conn->conn_call_lock);
1668 MUTEX_EXIT(&call->lock);
1671 dpf(("rx_NewCall(call %"AFS_PTR_FMT")\n", call));
1676 rxi_HasActiveCalls(struct rx_connection *aconn)
1679 struct rx_call *tcall;
1683 for (i = 0; i < RX_MAXCALLS; i++) {
1684 if ((tcall = aconn->call[i])) {
1685 if ((tcall->state == RX_STATE_ACTIVE)
1686 || (tcall->state == RX_STATE_PRECALL)) {
1697 rxi_GetCallNumberVector(struct rx_connection *aconn,
1698 afs_int32 * aint32s)
1701 struct rx_call *tcall;
1705 MUTEX_ENTER(&aconn->conn_call_lock);
1706 for (i = 0; i < RX_MAXCALLS; i++) {
1707 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1708 aint32s[i] = aconn->callNumber[i] + 1;
1710 aint32s[i] = aconn->callNumber[i];
1712 MUTEX_EXIT(&aconn->conn_call_lock);
1718 rxi_SetCallNumberVector(struct rx_connection *aconn,
1719 afs_int32 * aint32s)
1722 struct rx_call *tcall;
1726 MUTEX_ENTER(&aconn->conn_call_lock);
1727 for (i = 0; i < RX_MAXCALLS; i++) {
1728 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1729 aconn->callNumber[i] = aint32s[i] - 1;
1731 aconn->callNumber[i] = aint32s[i];
1733 MUTEX_EXIT(&aconn->conn_call_lock);
1738 /* Advertise a new service. A service is named locally by a UDP port
1739 * number plus a 16-bit service id. Returns (struct rx_service *) 0
1742 char *serviceName; Name for identification purposes (e.g. the
1743 service name might be used for probing for
1746 rx_NewServiceHost(afs_uint32 host, u_short port, u_short serviceId,
1747 char *serviceName, struct rx_securityClass **securityObjects,
1748 int nSecurityObjects,
1749 afs_int32(*serviceProc) (struct rx_call * acall))
1751 osi_socket socket = OSI_NULLSOCKET;
1752 struct rx_service *tservice;
1758 if (serviceId == 0) {
1760 "rx_NewService: service id for service %s is not non-zero.\n",
1767 "rx_NewService: A non-zero port must be specified on this call if a non-zero port was not provided at Rx initialization (service %s).\n",
1775 tservice = rxi_AllocService();
1778 MUTEX_INIT(&tservice->svc_data_lock, "svc data lock", MUTEX_DEFAULT, 0);
1780 for (i = 0; i < RX_MAX_SERVICES; i++) {
1781 struct rx_service *service = rx_services[i];
1783 if (port == service->servicePort && host == service->serviceHost) {
1784 if (service->serviceId == serviceId) {
1785 /* The identical service has already been
1786 * installed; if the caller was intending to
1787 * change the security classes used by this
1788 * service, he/she loses. */
1790 "rx_NewService: tried to install service %s with service id %d, which is already in use for service %s\n",
1791 serviceName, serviceId, service->serviceName);
1793 rxi_FreeService(tservice);
1796 /* Different service, same port: re-use the socket
1797 * which is bound to the same port */
1798 socket = service->socket;
1801 if (socket == OSI_NULLSOCKET) {
1802 /* If we don't already have a socket (from another
1803 * service on same port) get a new one */
1804 socket = rxi_GetHostUDPSocket(host, port);
1805 if (socket == OSI_NULLSOCKET) {
1807 rxi_FreeService(tservice);
1812 service->socket = socket;
1813 service->serviceHost = host;
1814 service->servicePort = port;
1815 service->serviceId = serviceId;
1816 service->serviceName = serviceName;
1817 service->nSecurityObjects = nSecurityObjects;
1818 service->securityObjects = securityObjects;
1819 service->minProcs = 0;
1820 service->maxProcs = 1;
1821 service->idleDeadTime = 60;
1822 service->idleDeadErr = 0;
1823 service->connDeadTime = rx_connDeadTime;
1824 service->executeRequestProc = serviceProc;
1825 service->checkReach = 0;
1826 service->nSpecific = 0;
1827 service->specific = NULL;
1828 rx_services[i] = service; /* not visible until now */
1834 rxi_FreeService(tservice);
1835 (osi_Msg "rx_NewService: cannot support > %d services\n",
1840 /* Set configuration options for all of a service's security objects */
1843 rx_SetSecurityConfiguration(struct rx_service *service,
1844 rx_securityConfigVariables type,
1848 for (i = 0; i<service->nSecurityObjects; i++) {
1849 if (service->securityObjects[i]) {
1850 RXS_SetConfiguration(service->securityObjects[i], NULL, type,
1858 rx_NewService(u_short port, u_short serviceId, char *serviceName,
1859 struct rx_securityClass **securityObjects, int nSecurityObjects,
1860 afs_int32(*serviceProc) (struct rx_call * acall))
1862 return rx_NewServiceHost(htonl(INADDR_ANY), port, serviceId, serviceName, securityObjects, nSecurityObjects, serviceProc);
1865 /* Generic request processing loop. This routine should be called
1866 * by the implementation dependent rx_ServerProc. If socketp is
1867 * non-null, it will be set to the file descriptor that this thread
1868 * is now listening on. If socketp is null, this routine will never
1871 rxi_ServerProc(int threadID, struct rx_call *newcall, osi_socket * socketp)
1873 struct rx_call *call;
1875 struct rx_service *tservice = NULL;
1882 call = rx_GetCall(threadID, tservice, socketp);
1883 if (socketp && *socketp != OSI_NULLSOCKET) {
1884 /* We are now a listener thread */
1890 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1891 #ifdef RX_ENABLE_LOCKS
1893 #endif /* RX_ENABLE_LOCKS */
1894 afs_termState = AFSOP_STOP_AFS;
1895 afs_osi_Wakeup(&afs_termState);
1896 #ifdef RX_ENABLE_LOCKS
1898 #endif /* RX_ENABLE_LOCKS */
1903 /* if server is restarting( typically smooth shutdown) then do not
1904 * allow any new calls.
1907 if (rx_tranquil && (call != NULL)) {
1911 MUTEX_ENTER(&call->lock);
1913 rxi_CallError(call, RX_RESTARTING);
1914 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1916 MUTEX_EXIT(&call->lock);
1921 tservice = call->conn->service;
1923 if (tservice->beforeProc)
1924 (*tservice->beforeProc) (call);
1926 code = tservice->executeRequestProc(call);
1928 if (tservice->afterProc)
1929 (*tservice->afterProc) (call, code);
1931 rx_EndCall(call, code);
1933 if (tservice->postProc)
1934 (*tservice->postProc) (code);
1936 if (rx_stats_active) {
1937 MUTEX_ENTER(&rx_stats_mutex);
1939 MUTEX_EXIT(&rx_stats_mutex);
1946 rx_WakeupServerProcs(void)
1948 struct rx_serverQueueEntry *np, *tqp;
1949 struct opr_queue *cursor;
1953 MUTEX_ENTER(&rx_serverPool_lock);
1955 #ifdef RX_ENABLE_LOCKS
1956 if (rx_waitForPacket)
1957 CV_BROADCAST(&rx_waitForPacket->cv);
1958 #else /* RX_ENABLE_LOCKS */
1959 if (rx_waitForPacket)
1960 osi_rxWakeup(rx_waitForPacket);
1961 #endif /* RX_ENABLE_LOCKS */
1962 MUTEX_ENTER(&freeSQEList_lock);
1963 for (np = rx_FreeSQEList; np; np = tqp) {
1964 tqp = *(struct rx_serverQueueEntry **)np;
1965 #ifdef RX_ENABLE_LOCKS
1966 CV_BROADCAST(&np->cv);
1967 #else /* RX_ENABLE_LOCKS */
1969 #endif /* RX_ENABLE_LOCKS */
1971 MUTEX_EXIT(&freeSQEList_lock);
1972 for (opr_queue_Scan(&rx_idleServerQueue, cursor)) {
1973 np = opr_queue_Entry(cursor, struct rx_serverQueueEntry, entry);
1974 #ifdef RX_ENABLE_LOCKS
1975 CV_BROADCAST(&np->cv);
1976 #else /* RX_ENABLE_LOCKS */
1978 #endif /* RX_ENABLE_LOCKS */
1980 MUTEX_EXIT(&rx_serverPool_lock);
1985 * One thing that seems to happen is that all the server threads get
1986 * tied up on some empty or slow call, and then a whole bunch of calls
1987 * arrive at once, using up the packet pool, so now there are more
1988 * empty calls. The most critical resources here are server threads
1989 * and the free packet pool. The "doreclaim" code seems to help in
1990 * general. I think that eventually we arrive in this state: there
1991 * are lots of pending calls which do have all their packets present,
1992 * so they won't be reclaimed, are multi-packet calls, so they won't
1993 * be scheduled until later, and thus are tying up most of the free
1994 * packet pool for a very long time.
1996 * 1. schedule multi-packet calls if all the packets are present.
1997 * Probably CPU-bound operation, useful to return packets to pool.
1998 * Do what if there is a full window, but the last packet isn't here?
1999 * 3. preserve one thread which *only* runs "best" calls, otherwise
2000 * it sleeps and waits for that type of call.
2001 * 4. Don't necessarily reserve a whole window for each thread. In fact,
2002 * the current dataquota business is badly broken. The quota isn't adjusted
2003 * to reflect how many packets are presently queued for a running call.
2004 * So, when we schedule a queued call with a full window of packets queued
2005 * up for it, that *should* free up a window full of packets for other 2d-class
2006 * calls to be able to use from the packet pool. But it doesn't.
2008 * NB. Most of the time, this code doesn't run -- since idle server threads
2009 * sit on the idle server queue and are assigned by "...ReceivePacket" as soon
2010 * as a new call arrives.
2012 /* Sleep until a call arrives. Returns a pointer to the call, ready
2013 * for an rx_Read. */
2014 #ifdef RX_ENABLE_LOCKS
2016 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2018 struct rx_serverQueueEntry *sq;
2019 struct rx_call *call = (struct rx_call *)0;
2020 struct rx_service *service = NULL;
2022 MUTEX_ENTER(&freeSQEList_lock);
2024 if ((sq = rx_FreeSQEList)) {
2025 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2026 MUTEX_EXIT(&freeSQEList_lock);
2027 } else { /* otherwise allocate a new one and return that */
2028 MUTEX_EXIT(&freeSQEList_lock);
2029 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2030 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2031 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2034 MUTEX_ENTER(&rx_serverPool_lock);
2035 if (cur_service != NULL) {
2036 ReturnToServerPool(cur_service);
2039 if (!opr_queue_IsEmpty(&rx_incomingCallQueue)) {
2040 struct rx_call *tcall, *choice2 = NULL;
2041 struct opr_queue *cursor;
2043 /* Scan for eligible incoming calls. A call is not eligible
2044 * if the maximum number of calls for its service type are
2045 * already executing */
2046 /* One thread will process calls FCFS (to prevent starvation),
2047 * while the other threads may run ahead looking for calls which
2048 * have all their input data available immediately. This helps
2049 * keep threads from blocking, waiting for data from the client. */
2050 for (opr_queue_Scan(&rx_incomingCallQueue, cursor)) {
2051 tcall = opr_queue_Entry(cursor, struct rx_call, entry);
2053 service = tcall->conn->service;
2054 if (!QuotaOK(service)) {
2057 MUTEX_ENTER(&rx_pthread_mutex);
2058 if (tno == rxi_fcfs_thread_num
2059 || opr_queue_IsEnd(&rx_incomingCallQueue, cursor)) {
2060 MUTEX_EXIT(&rx_pthread_mutex);
2061 /* If we're the fcfs thread , then we'll just use
2062 * this call. If we haven't been able to find an optimal
2063 * choice, and we're at the end of the list, then use a
2064 * 2d choice if one has been identified. Otherwise... */
2065 call = (choice2 ? choice2 : tcall);
2066 service = call->conn->service;
2068 MUTEX_EXIT(&rx_pthread_mutex);
2069 if (!opr_queue_IsEmpty(&tcall->rq)) {
2070 struct rx_packet *rp;
2071 rp = opr_queue_First(&tcall->rq, struct rx_packet,
2073 if (rp->header.seq == 1) {
2075 || (rp->header.flags & RX_LAST_PACKET)) {
2077 } else if (rxi_2dchoice && !choice2
2078 && !(tcall->flags & RX_CALL_CLEARED)
2079 && (tcall->rprev > rxi_HardAckRate)) {
2089 ReturnToServerPool(service);
2095 opr_queue_Remove(&call->entry);
2096 MUTEX_EXIT(&rx_serverPool_lock);
2097 MUTEX_ENTER(&call->lock);
2099 if (call->flags & RX_CALL_WAIT_PROC) {
2100 call->flags &= ~RX_CALL_WAIT_PROC;
2101 rx_atomic_dec(&rx_nWaiting);
2104 if (call->state != RX_STATE_PRECALL || call->error) {
2105 MUTEX_EXIT(&call->lock);
2106 MUTEX_ENTER(&rx_serverPool_lock);
2107 ReturnToServerPool(service);
2112 if (opr_queue_IsEmpty(&call->rq)
2113 || opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq != 1)
2114 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2116 CLEAR_CALL_QUEUE_LOCK(call);
2119 /* If there are no eligible incoming calls, add this process
2120 * to the idle server queue, to wait for one */
2124 *socketp = OSI_NULLSOCKET;
2126 sq->socketp = socketp;
2127 opr_queue_Append(&rx_idleServerQueue, &sq->entry);
2128 #ifndef AFS_AIX41_ENV
2129 rx_waitForPacket = sq;
2130 #endif /* AFS_AIX41_ENV */
2132 CV_WAIT(&sq->cv, &rx_serverPool_lock);
2134 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2135 MUTEX_EXIT(&rx_serverPool_lock);
2136 return (struct rx_call *)0;
2139 } while (!(call = sq->newcall)
2140 && !(socketp && *socketp != OSI_NULLSOCKET));
2141 MUTEX_EXIT(&rx_serverPool_lock);
2143 MUTEX_ENTER(&call->lock);
2149 MUTEX_ENTER(&freeSQEList_lock);
2150 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2151 rx_FreeSQEList = sq;
2152 MUTEX_EXIT(&freeSQEList_lock);
2155 clock_GetTime(&call->startTime);
2156 call->state = RX_STATE_ACTIVE;
2157 call->app.mode = RX_MODE_RECEIVING;
2158 #ifdef RX_KERNEL_TRACE
2159 if (ICL_SETACTIVE(afs_iclSetp)) {
2160 int glockOwner = ISAFS_GLOCK();
2163 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2164 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2171 rxi_calltrace(RX_CALL_START, call);
2172 dpf(("rx_GetCall(port=%d, service=%d) ==> call %"AFS_PTR_FMT"\n",
2173 call->conn->service->servicePort, call->conn->service->serviceId,
2176 MUTEX_EXIT(&call->lock);
2177 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
2179 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2184 #else /* RX_ENABLE_LOCKS */
2186 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2188 struct rx_serverQueueEntry *sq;
2189 struct rx_call *call = (struct rx_call *)0, *choice2;
2190 struct rx_service *service = NULL;
2194 MUTEX_ENTER(&freeSQEList_lock);
2196 if ((sq = rx_FreeSQEList)) {
2197 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2198 MUTEX_EXIT(&freeSQEList_lock);
2199 } else { /* otherwise allocate a new one and return that */
2200 MUTEX_EXIT(&freeSQEList_lock);
2201 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2202 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2203 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2205 MUTEX_ENTER(&sq->lock);
2207 if (cur_service != NULL) {
2208 cur_service->nRequestsRunning--;
2209 MUTEX_ENTER(&rx_quota_mutex);
2210 if (cur_service->nRequestsRunning < cur_service->minProcs)
2213 MUTEX_EXIT(&rx_quota_mutex);
2215 if (!opr_queue_IsEmpty(&rx_incomingCallQueue)) {
2216 struct rx_call *tcall;
2217 struct opr_queue *cursor;
2218 /* Scan for eligible incoming calls. A call is not eligible
2219 * if the maximum number of calls for its service type are
2220 * already executing */
2221 /* One thread will process calls FCFS (to prevent starvation),
2222 * while the other threads may run ahead looking for calls which
2223 * have all their input data available immediately. This helps
2224 * keep threads from blocking, waiting for data from the client. */
2225 choice2 = (struct rx_call *)0;
2226 for (opr_queue_Scan(&rx_incomingCallQueue, cursor)) {
2227 tcall = opr_queue_Entry(cursor, struct rx_call, entry);
2228 service = tcall->conn->service;
2229 if (QuotaOK(service)) {
2230 MUTEX_ENTER(&rx_pthread_mutex);
2231 /* XXX - If tcall->entry.next is NULL, then we're no longer
2232 * on a queue at all. This shouldn't happen. */
2233 if (tno == rxi_fcfs_thread_num || !tcall->entry.next) {
2234 MUTEX_EXIT(&rx_pthread_mutex);
2235 /* If we're the fcfs thread, then we'll just use
2236 * this call. If we haven't been able to find an optimal
2237 * choice, and we're at the end of the list, then use a
2238 * 2d choice if one has been identified. Otherwise... */
2239 call = (choice2 ? choice2 : tcall);
2240 service = call->conn->service;
2242 MUTEX_EXIT(&rx_pthread_mutex);
2243 if (!opr_queue_IsEmpty(&tcall->rq)) {
2244 struct rx_packet *rp;
2245 rp = opr_queue_First(&tcall->rq, struct rx_packet,
2247 if (rp->header.seq == 1
2249 || (rp->header.flags & RX_LAST_PACKET))) {
2251 } else if (rxi_2dchoice && !choice2
2252 && !(tcall->flags & RX_CALL_CLEARED)
2253 && (tcall->rprev > rxi_HardAckRate)) {
2266 opr_queue_Remove(&call->entry);
2267 /* we can't schedule a call if there's no data!!! */
2268 /* send an ack if there's no data, if we're missing the
2269 * first packet, or we're missing something between first
2270 * and last -- there's a "hole" in the incoming data. */
2271 if (opr_queue_IsEmpty(&call->rq)
2272 || opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq != 1
2273 || call->rprev != opr_queue_Last(&call->rq, struct rx_packet, entry)->header.seq)
2274 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2276 call->flags &= (~RX_CALL_WAIT_PROC);
2277 service->nRequestsRunning++;
2278 /* just started call in minProcs pool, need fewer to maintain
2280 MUTEX_ENTER(&rx_quota_mutex);
2281 if (service->nRequestsRunning <= service->minProcs)
2284 MUTEX_EXIT(&rx_quota_mutex);
2285 rx_atomic_dec(&rx_nWaiting);
2286 /* MUTEX_EXIT(&call->lock); */
2288 /* If there are no eligible incoming calls, add this process
2289 * to the idle server queue, to wait for one */
2292 *socketp = OSI_NULLSOCKET;
2294 sq->socketp = socketp;
2295 opr_queue_Append(&rx_idleServerQueue, &sq->entry);
2299 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2301 rxi_Free(sq, sizeof(struct rx_serverQueueEntry));
2302 return (struct rx_call *)0;
2305 } while (!(call = sq->newcall)
2306 && !(socketp && *socketp != OSI_NULLSOCKET));
2308 MUTEX_EXIT(&sq->lock);
2310 MUTEX_ENTER(&freeSQEList_lock);
2311 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2312 rx_FreeSQEList = sq;
2313 MUTEX_EXIT(&freeSQEList_lock);
2316 clock_GetTime(&call->startTime);
2317 call->state = RX_STATE_ACTIVE;
2318 call->app.mode = RX_MODE_RECEIVING;
2319 #ifdef RX_KERNEL_TRACE
2320 if (ICL_SETACTIVE(afs_iclSetp)) {
2321 int glockOwner = ISAFS_GLOCK();
2324 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2325 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2332 rxi_calltrace(RX_CALL_START, call);
2333 dpf(("rx_GetCall(port=%d, service=%d) ==> call %p\n",
2334 call->conn->service->servicePort, call->conn->service->serviceId,
2337 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2344 #endif /* RX_ENABLE_LOCKS */
2348 /* Establish a procedure to be called when a packet arrives for a
2349 * call. This routine will be called at most once after each call,
2350 * and will also be called if there is an error condition on the or
2351 * the call is complete. Used by multi rx to build a selection
2352 * function which determines which of several calls is likely to be a
2353 * good one to read from.
2354 * NOTE: the way this is currently implemented it is probably only a
2355 * good idea to (1) use it immediately after a newcall (clients only)
2356 * and (2) only use it once. Other uses currently void your warranty
2359 rx_SetArrivalProc(struct rx_call *call,
2360 void (*proc) (struct rx_call * call,
2363 void * handle, int arg)
2365 call->arrivalProc = proc;
2366 call->arrivalProcHandle = handle;
2367 call->arrivalProcArg = arg;
2370 /* Call is finished (possibly prematurely). Return rc to the peer, if
2371 * appropriate, and return the final error code from the conversation
2375 rx_EndCall(struct rx_call *call, afs_int32 rc)
2377 struct rx_connection *conn = call->conn;
2381 dpf(("rx_EndCall(call %"AFS_PTR_FMT" rc %d error %d abortCode %d)\n",
2382 call, rc, call->error, call->abortCode));
2385 MUTEX_ENTER(&call->lock);
2387 if (rc == 0 && call->error == 0) {
2388 call->abortCode = 0;
2389 call->abortCount = 0;
2392 call->arrivalProc = (void (*)())0;
2393 if (rc && call->error == 0) {
2394 rxi_CallError(call, rc);
2395 call->app.mode = RX_MODE_ERROR;
2396 /* Send an abort message to the peer if this error code has
2397 * only just been set. If it was set previously, assume the
2398 * peer has already been sent the error code or will request it
2400 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
2402 if (conn->type == RX_SERVER_CONNECTION) {
2403 /* Make sure reply or at least dummy reply is sent */
2404 if (call->app.mode == RX_MODE_RECEIVING) {
2405 MUTEX_EXIT(&call->lock);
2406 rxi_WriteProc(call, 0, 0);
2407 MUTEX_ENTER(&call->lock);
2409 if (call->app.mode == RX_MODE_SENDING) {
2410 MUTEX_EXIT(&call->lock);
2411 rxi_FlushWrite(call);
2412 MUTEX_ENTER(&call->lock);
2414 rxi_calltrace(RX_CALL_END, call);
2415 /* Call goes to hold state until reply packets are acknowledged */
2416 if (call->tfirst + call->nSoftAcked < call->tnext) {
2417 call->state = RX_STATE_HOLD;
2419 call->state = RX_STATE_DALLY;
2420 rxi_ClearTransmitQueue(call, 0);
2421 rxi_rto_cancel(call);
2422 rxi_CancelKeepAliveEvent(call);
2424 } else { /* Client connection */
2426 /* Make sure server receives input packets, in the case where
2427 * no reply arguments are expected */
2429 if ((call->app.mode == RX_MODE_SENDING)
2430 || (call->app.mode == RX_MODE_RECEIVING && call->rnext == 1)) {
2431 MUTEX_EXIT(&call->lock);
2432 (void)rxi_ReadProc(call, &dummy, 1);
2433 MUTEX_ENTER(&call->lock);
2436 /* If we had an outstanding delayed ack, be nice to the server
2437 * and force-send it now.
2439 if (call->delayedAckEvent) {
2440 rxi_CancelDelayedAckEvent(call);
2441 rxi_SendDelayedAck(NULL, call, NULL, 0);
2444 /* We need to release the call lock since it's lower than the
2445 * conn_call_lock and we don't want to hold the conn_call_lock
2446 * over the rx_ReadProc call. The conn_call_lock needs to be held
2447 * here for the case where rx_NewCall is perusing the calls on
2448 * the connection structure. We don't want to signal until
2449 * rx_NewCall is in a stable state. Otherwise, rx_NewCall may
2450 * have checked this call, found it active and by the time it
2451 * goes to sleep, will have missed the signal.
2453 MUTEX_EXIT(&call->lock);
2454 MUTEX_ENTER(&conn->conn_call_lock);
2455 MUTEX_ENTER(&call->lock);
2457 if (!(call->flags & RX_CALL_PEER_BUSY)) {
2458 conn->lastBusy[call->channel] = 0;
2461 MUTEX_ENTER(&conn->conn_data_lock);
2462 conn->flags |= RX_CONN_BUSY;
2463 if (conn->flags & RX_CONN_MAKECALL_WAITING) {
2464 MUTEX_EXIT(&conn->conn_data_lock);
2465 #ifdef RX_ENABLE_LOCKS
2466 CV_BROADCAST(&conn->conn_call_cv);
2471 #ifdef RX_ENABLE_LOCKS
2473 MUTEX_EXIT(&conn->conn_data_lock);
2475 #endif /* RX_ENABLE_LOCKS */
2476 call->state = RX_STATE_DALLY;
2478 error = call->error;
2480 /* currentPacket, nLeft, and NFree must be zeroed here, because
2481 * ResetCall cannot: ResetCall may be called at splnet(), in the
2482 * kernel version, and may interrupt the macros rx_Read or
2483 * rx_Write, which run at normal priority for efficiency. */
2484 if (call->app.currentPacket) {
2485 #ifdef RX_TRACK_PACKETS
2486 call->app.currentPacket->flags &= ~RX_PKTFLAG_CP;
2488 rxi_FreePacket(call->app.currentPacket);
2489 call->app.currentPacket = (struct rx_packet *)0;
2492 call->app.nLeft = call->app.nFree = call->app.curlen = 0;
2494 /* Free any packets from the last call to ReadvProc/WritevProc */
2495 #ifdef RXDEBUG_PACKET
2497 #endif /* RXDEBUG_PACKET */
2498 rxi_FreePackets(0, &call->app.iovq);
2499 MUTEX_EXIT(&call->lock);
2501 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
2502 if (conn->type == RX_CLIENT_CONNECTION) {
2503 MUTEX_ENTER(&conn->conn_data_lock);
2504 conn->flags &= ~RX_CONN_BUSY;
2505 MUTEX_EXIT(&conn->conn_data_lock);
2506 MUTEX_EXIT(&conn->conn_call_lock);
2510 * Map errors to the local host's errno.h format.
2512 error = ntoh_syserr_conv(error);
2516 #if !defined(KERNEL)
2518 /* Call this routine when shutting down a server or client (especially
2519 * clients). This will allow Rx to gracefully garbage collect server
2520 * connections, and reduce the number of retries that a server might
2521 * make to a dead client.
2522 * This is not quite right, since some calls may still be ongoing and
2523 * we can't lock them to destroy them. */
2527 struct rx_connection **conn_ptr, **conn_end;
2530 if (rx_atomic_test_and_set_bit(&rxinit_status, 0))
2531 return; /* Already shutdown. */
2533 rxi_DeleteCachedConnections();
2534 if (rx_connHashTable) {
2535 MUTEX_ENTER(&rx_connHashTable_lock);
2536 for (conn_ptr = &rx_connHashTable[0], conn_end =
2537 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
2539 struct rx_connection *conn, *next;
2540 for (conn = *conn_ptr; conn; conn = next) {
2542 if (conn->type == RX_CLIENT_CONNECTION) {
2543 MUTEX_ENTER(&rx_refcnt_mutex);
2545 MUTEX_EXIT(&rx_refcnt_mutex);
2546 #ifdef RX_ENABLE_LOCKS
2547 rxi_DestroyConnectionNoLock(conn);
2548 #else /* RX_ENABLE_LOCKS */
2549 rxi_DestroyConnection(conn);
2550 #endif /* RX_ENABLE_LOCKS */
2554 #ifdef RX_ENABLE_LOCKS
2555 while (rx_connCleanup_list) {
2556 struct rx_connection *conn;
2557 conn = rx_connCleanup_list;
2558 rx_connCleanup_list = rx_connCleanup_list->next;
2559 MUTEX_EXIT(&rx_connHashTable_lock);
2560 rxi_CleanupConnection(conn);
2561 MUTEX_ENTER(&rx_connHashTable_lock);
2563 MUTEX_EXIT(&rx_connHashTable_lock);
2564 #endif /* RX_ENABLE_LOCKS */
2569 afs_winsockCleanup();
2575 /* if we wakeup packet waiter too often, can get in loop with two
2576 AllocSendPackets each waking each other up (from ReclaimPacket calls) */
2578 rxi_PacketsUnWait(void)
2580 if (!rx_waitingForPackets) {
2584 if (rxi_OverQuota(RX_PACKET_CLASS_SEND)) {
2585 return; /* still over quota */
2588 rx_waitingForPackets = 0;
2589 #ifdef RX_ENABLE_LOCKS
2590 CV_BROADCAST(&rx_waitingForPackets_cv);
2592 osi_rxWakeup(&rx_waitingForPackets);
2598 /* ------------------Internal interfaces------------------------- */
2600 /* Return this process's service structure for the
2601 * specified socket and service */
2602 static struct rx_service *
2603 rxi_FindService(osi_socket socket, u_short serviceId)
2605 struct rx_service **sp;
2606 for (sp = &rx_services[0]; *sp; sp++) {
2607 if ((*sp)->serviceId == serviceId && (*sp)->socket == socket)
2613 #ifdef RXDEBUG_PACKET
2614 #ifdef KDUMP_RX_LOCK
2615 static struct rx_call_rx_lock *rx_allCallsp = 0;
2617 static struct rx_call *rx_allCallsp = 0;
2619 #endif /* RXDEBUG_PACKET */
2621 /* Allocate a call structure, for the indicated channel of the
2622 * supplied connection. The mode and state of the call must be set by
2623 * the caller. Returns the call with mutex locked. */
2624 static struct rx_call *
2625 rxi_NewCall(struct rx_connection *conn, int channel)
2627 struct rx_call *call;
2628 #ifdef RX_ENABLE_LOCKS
2629 struct rx_call *cp; /* Call pointer temp */
2630 struct opr_queue *cursor;
2633 dpf(("rxi_NewCall(conn %"AFS_PTR_FMT", channel %d)\n", conn, channel));
2635 /* Grab an existing call structure, or allocate a new one.
2636 * Existing call structures are assumed to have been left reset by
2638 MUTEX_ENTER(&rx_freeCallQueue_lock);
2640 #ifdef RX_ENABLE_LOCKS
2642 * EXCEPT that the TQ might not yet be cleared out.
2643 * Skip over those with in-use TQs.
2646 for (opr_queue_Scan(&rx_freeCallQueue, cursor)) {
2647 cp = opr_queue_Entry(cursor, struct rx_call, entry);
2648 if (!(cp->flags & RX_CALL_TQ_BUSY)) {
2654 #else /* RX_ENABLE_LOCKS */
2655 if (!opr_queue_IsEmpty(&rx_freeCallQueue)) {
2656 call = opr_queue_First(&rx_freeCallQueue, struct rx_call, entry);
2657 #endif /* RX_ENABLE_LOCKS */
2658 opr_queue_Remove(&call->entry);
2659 if (rx_stats_active)
2660 rx_atomic_dec(&rx_stats.nFreeCallStructs);
2661 MUTEX_EXIT(&rx_freeCallQueue_lock);
2662 MUTEX_ENTER(&call->lock);
2663 CLEAR_CALL_QUEUE_LOCK(call);
2664 #ifdef RX_ENABLE_LOCKS
2665 /* Now, if TQ wasn't cleared earlier, do it now. */
2666 rxi_WaitforTQBusy(call);
2667 if (call->flags & RX_CALL_TQ_CLEARME) {
2668 rxi_ClearTransmitQueue(call, 1);
2669 /*queue_Init(&call->tq);*/
2671 #endif /* RX_ENABLE_LOCKS */
2672 /* Bind the call to its connection structure */
2674 rxi_ResetCall(call, 1);
2677 call = rxi_Alloc(sizeof(struct rx_call));
2678 #ifdef RXDEBUG_PACKET
2679 call->allNextp = rx_allCallsp;
2680 rx_allCallsp = call;
2682 rx_atomic_inc_and_read(&rx_stats.nCallStructs);
2683 #else /* RXDEBUG_PACKET */
2684 rx_atomic_inc(&rx_stats.nCallStructs);
2685 #endif /* RXDEBUG_PACKET */
2687 MUTEX_EXIT(&rx_freeCallQueue_lock);
2688 MUTEX_INIT(&call->lock, "call lock", MUTEX_DEFAULT, NULL);
2689 MUTEX_ENTER(&call->lock);
2690 CV_INIT(&call->cv_twind, "call twind", CV_DEFAULT, 0);
2691 CV_INIT(&call->cv_rq, "call rq", CV_DEFAULT, 0);
2692 CV_INIT(&call->cv_tq, "call tq", CV_DEFAULT, 0);
2694 /* Initialize once-only items */
2695 opr_queue_Init(&call->tq);
2696 opr_queue_Init(&call->rq);
2697 opr_queue_Init(&call->app.iovq);
2698 #ifdef RXDEBUG_PACKET
2699 call->rqc = call->tqc = call->iovqc = 0;
2700 #endif /* RXDEBUG_PACKET */
2701 /* Bind the call to its connection structure (prereq for reset) */
2703 rxi_ResetCall(call, 1);
2705 call->channel = channel;
2706 call->callNumber = &conn->callNumber[channel];
2707 call->rwind = conn->rwind[channel];
2708 call->twind = conn->twind[channel];
2709 /* Note that the next expected call number is retained (in
2710 * conn->callNumber[i]), even if we reallocate the call structure
2712 conn->call[channel] = call;
2713 /* if the channel's never been used (== 0), we should start at 1, otherwise
2714 * the call number is valid from the last time this channel was used */
2715 if (*call->callNumber == 0)
2716 *call->callNumber = 1;
2721 /* A call has been inactive long enough that so we can throw away
2722 * state, including the call structure, which is placed on the call
2725 * call->lock amd rx_refcnt_mutex are held upon entry.
2726 * haveCTLock is set when called from rxi_ReapConnections.
2728 * return 1 if the call is freed, 0 if not.
2731 rxi_FreeCall(struct rx_call *call, int haveCTLock)
2733 int channel = call->channel;
2734 struct rx_connection *conn = call->conn;
2735 u_char state = call->state;
2738 * We are setting the state to RX_STATE_RESET to
2739 * ensure that no one else will attempt to use this
2740 * call once we drop the refcnt lock. We must drop
2741 * the refcnt lock before calling rxi_ResetCall
2742 * because it cannot be held across acquiring the
2743 * freepktQ lock. NewCall does the same.
2745 call->state = RX_STATE_RESET;
2746 MUTEX_EXIT(&rx_refcnt_mutex);
2747 rxi_ResetCall(call, 0);
2749 if (MUTEX_TRYENTER(&conn->conn_call_lock))
2751 if (state == RX_STATE_DALLY || state == RX_STATE_HOLD)
2752 (*call->callNumber)++;
2754 if (call->conn->call[channel] == call)
2755 call->conn->call[channel] = 0;
2756 MUTEX_EXIT(&conn->conn_call_lock);
2759 * We couldn't obtain the conn_call_lock so we can't
2760 * disconnect the call from the connection. Set the
2761 * call state to dally so that the call can be reused.
2763 MUTEX_ENTER(&rx_refcnt_mutex);
2764 call->state = RX_STATE_DALLY;
2768 MUTEX_ENTER(&rx_freeCallQueue_lock);
2769 SET_CALL_QUEUE_LOCK(call, &rx_freeCallQueue_lock);
2770 #ifdef RX_ENABLE_LOCKS
2771 /* A call may be free even though its transmit queue is still in use.
2772 * Since we search the call list from head to tail, put busy calls at
2773 * the head of the list, and idle calls at the tail.
2775 if (call->flags & RX_CALL_TQ_BUSY)
2776 opr_queue_Prepend(&rx_freeCallQueue, &call->entry);
2778 opr_queue_Append(&rx_freeCallQueue, &call->entry);
2779 #else /* RX_ENABLE_LOCKS */
2780 opr_queue_Append(&rx_freeCallQueue, &call->entry);
2781 #endif /* RX_ENABLE_LOCKS */
2782 if (rx_stats_active)
2783 rx_atomic_inc(&rx_stats.nFreeCallStructs);
2784 MUTEX_EXIT(&rx_freeCallQueue_lock);
2786 /* Destroy the connection if it was previously slated for
2787 * destruction, i.e. the Rx client code previously called
2788 * rx_DestroyConnection (client connections), or
2789 * rxi_ReapConnections called the same routine (server
2790 * connections). Only do this, however, if there are no
2791 * outstanding calls. Note that for fine grain locking, there appears
2792 * to be a deadlock in that rxi_FreeCall has a call locked and
2793 * DestroyConnectionNoLock locks each call in the conn. But note a
2794 * few lines up where we have removed this call from the conn.
2795 * If someone else destroys a connection, they either have no
2796 * call lock held or are going through this section of code.
2798 MUTEX_ENTER(&conn->conn_data_lock);
2799 if (conn->flags & RX_CONN_DESTROY_ME && !(conn->flags & RX_CONN_MAKECALL_WAITING)) {
2800 MUTEX_ENTER(&rx_refcnt_mutex);
2802 MUTEX_EXIT(&rx_refcnt_mutex);
2803 MUTEX_EXIT(&conn->conn_data_lock);
2804 #ifdef RX_ENABLE_LOCKS
2806 rxi_DestroyConnectionNoLock(conn);
2808 rxi_DestroyConnection(conn);
2809 #else /* RX_ENABLE_LOCKS */
2810 rxi_DestroyConnection(conn);
2811 #endif /* RX_ENABLE_LOCKS */
2813 MUTEX_EXIT(&conn->conn_data_lock);
2815 MUTEX_ENTER(&rx_refcnt_mutex);
2819 rx_atomic_t rxi_Allocsize = RX_ATOMIC_INIT(0);
2820 rx_atomic_t rxi_Alloccnt = RX_ATOMIC_INIT(0);
2823 rxi_Alloc(size_t size)
2827 if (rx_stats_active) {
2828 rx_atomic_add(&rxi_Allocsize, (int) size);
2829 rx_atomic_inc(&rxi_Alloccnt);
2833 #if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV)
2834 afs_osi_Alloc_NoSleep(size);
2839 osi_Panic("rxi_Alloc error");
2845 rxi_Free(void *addr, size_t size)
2847 if (rx_stats_active) {
2848 rx_atomic_sub(&rxi_Allocsize, (int) size);
2849 rx_atomic_dec(&rxi_Alloccnt);
2851 osi_Free(addr, size);
2855 rxi_SetPeerMtu(struct rx_peer *peer, afs_uint32 host, afs_uint32 port, int mtu)
2857 struct rx_peer **peer_ptr = NULL, **peer_end = NULL;
2858 struct rx_peer *next = NULL;
2862 MUTEX_ENTER(&rx_peerHashTable_lock);
2864 peer_ptr = &rx_peerHashTable[0];
2865 peer_end = &rx_peerHashTable[rx_hashTableSize];
2868 for ( ; peer_ptr < peer_end; peer_ptr++) {
2871 for ( ; peer; peer = next) {
2873 if (host == peer->host)
2878 hashIndex = PEER_HASH(host, port);
2879 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2880 if ((peer->host == host) && (peer->port == port))
2885 MUTEX_ENTER(&rx_peerHashTable_lock);
2890 MUTEX_EXIT(&rx_peerHashTable_lock);
2892 MUTEX_ENTER(&peer->peer_lock);
2893 /* We don't handle dropping below min, so don't */
2894 mtu = MAX(mtu, RX_MIN_PACKET_SIZE);
2895 peer->ifMTU=MIN(mtu, peer->ifMTU);
2896 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2897 /* if we tweaked this down, need to tune our peer MTU too */
2898 peer->MTU = MIN(peer->MTU, peer->natMTU);
2899 /* if we discovered a sub-1500 mtu, degrade */
2900 if (peer->ifMTU < OLD_MAX_PACKET_SIZE)
2901 peer->maxDgramPackets = 1;
2902 /* We no longer have valid peer packet information */
2903 if (peer->maxPacketSize-RX_IPUDP_SIZE > peer->ifMTU)
2904 peer->maxPacketSize = 0;
2905 MUTEX_EXIT(&peer->peer_lock);
2907 MUTEX_ENTER(&rx_peerHashTable_lock);
2909 if (host && !port) {
2911 /* pick up where we left off */
2915 MUTEX_EXIT(&rx_peerHashTable_lock);
2918 #ifdef AFS_RXERRQ_ENV
2920 rxi_SetPeerDead(struct sock_extended_err *err, afs_uint32 host, afs_uint16 port)
2922 int hashIndex = PEER_HASH(host, port);
2923 struct rx_peer *peer;
2925 MUTEX_ENTER(&rx_peerHashTable_lock);
2927 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2928 if (peer->host == host && peer->port == port) {
2934 MUTEX_EXIT(&rx_peerHashTable_lock);
2937 rx_atomic_inc(&peer->neterrs);
2938 MUTEX_ENTER(&peer->peer_lock);
2939 peer->last_err_origin = RX_NETWORK_ERROR_ORIGIN_ICMP;
2940 peer->last_err_type = err->ee_type;
2941 peer->last_err_code = err->ee_code;
2942 MUTEX_EXIT(&peer->peer_lock);
2944 MUTEX_ENTER(&rx_peerHashTable_lock);
2946 MUTEX_EXIT(&rx_peerHashTable_lock);
2951 rxi_ProcessNetError(struct sock_extended_err *err, afs_uint32 addr, afs_uint16 port)
2953 # ifdef AFS_ADAPT_PMTU
2954 if (err->ee_errno == EMSGSIZE && err->ee_info >= 68) {
2955 rxi_SetPeerMtu(NULL, addr, port, err->ee_info - RX_IPUDP_SIZE);
2959 if (err->ee_origin == SO_EE_ORIGIN_ICMP && err->ee_type == ICMP_DEST_UNREACH) {
2960 switch (err->ee_code) {
2961 case ICMP_NET_UNREACH:
2962 case ICMP_HOST_UNREACH:
2963 case ICMP_PORT_UNREACH:
2966 rxi_SetPeerDead(err, addr, port);
2973 rxi_TranslateICMP(int type, int code)
2976 case ICMP_DEST_UNREACH:
2978 case ICMP_NET_UNREACH:
2979 return "Destination Net Unreachable";
2980 case ICMP_HOST_UNREACH:
2981 return "Destination Host Unreachable";
2982 case ICMP_PROT_UNREACH:
2983 return "Destination Protocol Unreachable";
2984 case ICMP_PORT_UNREACH:
2985 return "Destination Port Unreachable";
2987 return "Destination Net Prohibited";
2989 return "Destination Host Prohibited";
2995 #endif /* AFS_RXERRQ_ENV */
2998 * Get the last network error for a connection
3000 * A "network error" here means an error retrieved from ICMP, or some other
3001 * mechanism outside of Rx that informs us of errors in network reachability.
3003 * If a peer associated with the given Rx connection has received a network
3004 * error recently, this function allows the caller to know what error
3005 * specifically occurred. This can be useful to know, since e.g. ICMP errors
3006 * can cause calls to that peer to be quickly aborted. So, this function can
3007 * help see why a call was aborted due to network errors.
3009 * If we have received traffic from a peer since the last network error, we
3010 * treat that peer as if we had not received an network error for it.
3012 * @param[in] conn The Rx connection to examine
3013 * @param[out] err_origin The origin of the last network error (e.g. ICMP);
3014 * one of the RX_NETWORK_ERROR_ORIGIN_* constants
3015 * @param[out] err_type The type of the last error
3016 * @param[out] err_code The code of the last error
3017 * @param[out] msg Human-readable error message, if applicable; NULL otherwise
3019 * @return If we have an error
3020 * @retval -1 No error to get; 'out' params are undefined
3021 * @retval 0 We have an error; 'out' params contain the last error
3024 rx_GetNetworkError(struct rx_connection *conn, int *err_origin, int *err_type,
3025 int *err_code, const char **msg)
3027 #ifdef AFS_RXERRQ_ENV
3028 struct rx_peer *peer = conn->peer;
3029 if (rx_atomic_read(&peer->neterrs)) {
3030 MUTEX_ENTER(&peer->peer_lock);
3031 *err_origin = peer->last_err_origin;
3032 *err_type = peer->last_err_type;
3033 *err_code = peer->last_err_code;
3034 MUTEX_EXIT(&peer->peer_lock);
3037 if (*err_origin == RX_NETWORK_ERROR_ORIGIN_ICMP) {
3038 *msg = rxi_TranslateICMP(*err_type, *err_code);
3047 /* Find the peer process represented by the supplied (host,port)
3048 * combination. If there is no appropriate active peer structure, a
3049 * new one will be allocated and initialized
3052 rxi_FindPeer(afs_uint32 host, u_short port, int create)
3056 hashIndex = PEER_HASH(host, port);
3057 MUTEX_ENTER(&rx_peerHashTable_lock);
3058 for (pp = rx_peerHashTable[hashIndex]; pp; pp = pp->next) {
3059 if ((pp->host == host) && (pp->port == port))
3064 pp = rxi_AllocPeer(); /* This bzero's *pp */
3065 pp->host = host; /* set here or in InitPeerParams is zero */
3067 #ifdef AFS_RXERRQ_ENV
3068 rx_atomic_set(&pp->neterrs, 0);
3070 MUTEX_INIT(&pp->peer_lock, "peer_lock", MUTEX_DEFAULT, 0);
3071 opr_queue_Init(&pp->rpcStats);
3072 pp->next = rx_peerHashTable[hashIndex];
3073 rx_peerHashTable[hashIndex] = pp;
3074 rxi_InitPeerParams(pp);
3075 if (rx_stats_active)
3076 rx_atomic_inc(&rx_stats.nPeerStructs);
3082 MUTEX_EXIT(&rx_peerHashTable_lock);
3087 /* Find the connection at (host, port) started at epoch, and with the
3088 * given connection id. Creates the server connection if necessary.
3089 * The type specifies whether a client connection or a server
3090 * connection is desired. In both cases, (host, port) specify the
3091 * peer's (host, pair) pair. Client connections are not made
3092 * automatically by this routine. The parameter socket gives the
3093 * socket descriptor on which the packet was received. This is used,
3094 * in the case of server connections, to check that *new* connections
3095 * come via a valid (port, serviceId). Finally, the securityIndex
3096 * parameter must match the existing index for the connection. If a
3097 * server connection is created, it will be created using the supplied
3098 * index, if the index is valid for this service */
3099 static struct rx_connection *
3100 rxi_FindConnection(osi_socket socket, afs_uint32 host,
3101 u_short port, u_short serviceId, afs_uint32 cid,
3102 afs_uint32 epoch, int type, u_int securityIndex,
3103 int *unknownService)
3105 int hashindex, flag, i;
3106 struct rx_connection *conn;
3107 *unknownService = 0;
3108 hashindex = CONN_HASH(host, port, cid, epoch, type);
3109 MUTEX_ENTER(&rx_connHashTable_lock);
3110 rxLastConn ? (conn = rxLastConn, flag = 0) : (conn =
3111 rx_connHashTable[hashindex],
3114 if ((conn->type == type) && ((cid & RX_CIDMASK) == conn->cid)
3115 && (epoch == conn->epoch)) {
3116 struct rx_peer *pp = conn->peer;
3117 if (securityIndex != conn->securityIndex) {
3118 /* this isn't supposed to happen, but someone could forge a packet
3119 * like this, and there seems to be some CM bug that makes this
3120 * happen from time to time -- in which case, the fileserver
3122 MUTEX_EXIT(&rx_connHashTable_lock);
3123 return (struct rx_connection *)0;
3125 if (pp->host == host && pp->port == port)
3127 if (type == RX_CLIENT_CONNECTION && pp->port == port)
3129 /* So what happens when it's a callback connection? */
3130 if ( /*type == RX_CLIENT_CONNECTION && */
3131 (conn->epoch & 0x80000000))
3135 /* the connection rxLastConn that was used the last time is not the
3136 ** one we are looking for now. Hence, start searching in the hash */
3138 conn = rx_connHashTable[hashindex];
3143 struct rx_service *service;
3144 if (type == RX_CLIENT_CONNECTION) {
3145 MUTEX_EXIT(&rx_connHashTable_lock);
3146 return (struct rx_connection *)0;
3148 service = rxi_FindService(socket, serviceId);
3149 if (!service || (securityIndex >= service->nSecurityObjects)
3150 || (service->securityObjects[securityIndex] == 0)) {
3151 MUTEX_EXIT(&rx_connHashTable_lock);
3152 *unknownService = 1;
3153 return (struct rx_connection *)0;
3155 conn = rxi_AllocConnection(); /* This bzero's the connection */
3156 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
3157 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
3158 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
3159 conn->next = rx_connHashTable[hashindex];
3160 rx_connHashTable[hashindex] = conn;
3161 conn->peer = rxi_FindPeer(host, port, 1);
3162 conn->type = RX_SERVER_CONNECTION;
3163 conn->lastSendTime = clock_Sec(); /* don't GC immediately */
3164 conn->epoch = epoch;
3165 conn->cid = cid & RX_CIDMASK;
3166 conn->ackRate = RX_FAST_ACK_RATE;
3167 conn->service = service;
3168 conn->serviceId = serviceId;
3169 conn->securityIndex = securityIndex;
3170 conn->securityObject = service->securityObjects[securityIndex];
3171 conn->nSpecific = 0;
3172 conn->specific = NULL;
3173 rx_SetConnDeadTime(conn, service->connDeadTime);
3174 conn->idleDeadTime = service->idleDeadTime;
3175 conn->idleDeadDetection = service->idleDeadErr ? 1 : 0;
3176 for (i = 0; i < RX_MAXCALLS; i++) {
3177 conn->twind[i] = rx_initSendWindow;
3178 conn->rwind[i] = rx_initReceiveWindow;
3180 /* Notify security object of the new connection */
3181 RXS_NewConnection(conn->securityObject, conn);
3182 /* XXXX Connection timeout? */
3183 if (service->newConnProc)
3184 (*service->newConnProc) (conn);
3185 if (rx_stats_active)
3186 rx_atomic_inc(&rx_stats.nServerConns);
3189 MUTEX_ENTER(&rx_refcnt_mutex);
3191 MUTEX_EXIT(&rx_refcnt_mutex);
3193 rxLastConn = conn; /* store this connection as the last conn used */
3194 MUTEX_EXIT(&rx_connHashTable_lock);
3199 * Timeout a call on a busy call channel if appropriate.
3201 * @param[in] call The busy call.
3203 * @pre 'call' is marked as busy (namely,
3204 * call->conn->lastBusy[call->channel] != 0)
3206 * @pre call->lock is held
3207 * @pre rxi_busyChannelError is nonzero
3209 * @note call->lock is dropped and reacquired
3212 rxi_CheckBusy(struct rx_call *call)
3214 struct rx_connection *conn = call->conn;
3215 int channel = call->channel;
3216 int freechannel = 0;
3219 MUTEX_EXIT(&call->lock);
3221 MUTEX_ENTER(&conn->conn_call_lock);
3223 /* Are there any other call slots on this conn that we should try? Look for
3224 * slots that are empty and are either non-busy, or were marked as busy
3225 * longer than conn->secondsUntilDead seconds before this call started. */
3227 for (i = 0; i < RX_MAXCALLS && !freechannel; i++) {
3229 /* only look at channels that aren't us */
3233 if (conn->lastBusy[i]) {
3234 /* if this channel looked busy too recently, don't look at it */
3235 if (conn->lastBusy[i] >= call->startTime.sec) {
3238 if (call->startTime.sec - conn->lastBusy[i] < conn->secondsUntilDead) {
3243 if (conn->call[i]) {
3244 struct rx_call *tcall = conn->call[i];
3245 MUTEX_ENTER(&tcall->lock);
3246 if (tcall->state == RX_STATE_DALLY) {
3249 MUTEX_EXIT(&tcall->lock);
3255 MUTEX_ENTER(&call->lock);
3257 /* Since the call->lock has been released it is possible that the call may
3258 * no longer be busy (the call channel cannot have been reallocated as we
3259 * haven't dropped the conn_call_lock) Therefore, we must confirm
3260 * that the call state has not changed when deciding whether or not to
3261 * force this application thread to retry by forcing a Timeout error. */
3263 if (freechannel && (call->flags & RX_CALL_PEER_BUSY)) {
3264 /* Since 'freechannel' is set, there exists another channel in this
3265 * rx_conn that the application thread might be able to use. We know
3266 * that we have the correct call since callNumber is unchanged, and we
3267 * know that the call is still busy. So, set the call error state to
3268 * rxi_busyChannelError so the application can retry the request,
3269 * presumably on a less-busy call channel. */
3271 rxi_CallError(call, RX_CALL_BUSY);
3273 MUTEX_EXIT(&conn->conn_call_lock);
3277 * Abort the call if the server is over the busy threshold. This
3278 * can be used without requiring a call structure be initialised,
3279 * or connected to a particular channel
3282 rxi_AbortIfServerBusy(osi_socket socket, struct rx_connection *conn,
3283 struct rx_packet *np)
3285 if ((rx_BusyThreshold > 0) &&
3286 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3287 rxi_SendRawAbort(socket, conn->peer->host, conn->peer->port,
3288 rx_BusyError, np, 0);
3289 if (rx_stats_active)
3290 rx_atomic_inc(&rx_stats.nBusies);
3297 static_inline struct rx_call *
3298 rxi_ReceiveClientCall(struct rx_packet *np, struct rx_connection *conn)
3301 struct rx_call *call;
3303 channel = np->header.cid & RX_CHANNELMASK;
3304 MUTEX_ENTER(&conn->conn_call_lock);
3305 call = conn->call[channel];
3306 if (!call || conn->callNumber[channel] != np->header.callNumber) {
3307 MUTEX_EXIT(&conn->conn_call_lock);
3308 if (rx_stats_active)
3309 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3313 MUTEX_ENTER(&call->lock);
3314 MUTEX_EXIT(&conn->conn_call_lock);
3316 if ((call->state == RX_STATE_DALLY)
3317 && np->header.type == RX_PACKET_TYPE_ACK) {
3318 if (rx_stats_active)
3319 rx_atomic_inc(&rx_stats.ignorePacketDally);
3320 MUTEX_EXIT(&call->lock);
3327 static_inline struct rx_call *
3328 rxi_ReceiveServerCall(osi_socket socket, struct rx_packet *np,
3329 struct rx_connection *conn)
3332 struct rx_call *call;
3334 channel = np->header.cid & RX_CHANNELMASK;
3335 MUTEX_ENTER(&conn->conn_call_lock);
3336 call = conn->call[channel];
3339 if (rxi_AbortIfServerBusy(socket, conn, np)) {
3340 MUTEX_EXIT(&conn->conn_call_lock);
3344 call = rxi_NewCall(conn, channel); /* returns locked call */
3345 *call->callNumber = np->header.callNumber;
3346 MUTEX_EXIT(&conn->conn_call_lock);
3348 call->state = RX_STATE_PRECALL;
3349 clock_GetTime(&call->queueTime);
3350 call->app.bytesSent = 0;
3351 call->app.bytesRcvd = 0;
3352 rxi_KeepAliveOn(call);
3357 if (np->header.callNumber == conn->callNumber[channel]) {
3358 MUTEX_ENTER(&call->lock);
3359 MUTEX_EXIT(&conn->conn_call_lock);
3363 if (np->header.callNumber < conn->callNumber[channel]) {
3364 MUTEX_EXIT(&conn->conn_call_lock);
3365 if (rx_stats_active)
3366 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3370 MUTEX_ENTER(&call->lock);
3371 MUTEX_EXIT(&conn->conn_call_lock);
3373 /* Wait until the transmit queue is idle before deciding
3374 * whether to reset the current call. Chances are that the
3375 * call will be in ether DALLY or HOLD state once the TQ_BUSY
3378 #ifdef RX_ENABLE_LOCKS
3379 if (call->state == RX_STATE_ACTIVE && !call->error) {
3380 rxi_WaitforTQBusy(call);
3381 /* If we entered error state while waiting,
3382 * must call rxi_CallError to permit rxi_ResetCall
3383 * to processed when the tqWaiter count hits zero.
3386 rxi_CallError(call, call->error);
3387 MUTEX_EXIT(&call->lock);
3391 #endif /* RX_ENABLE_LOCKS */
3392 /* If the new call cannot be taken right now send a busy and set
3393 * the error condition in this call, so that it terminates as
3394 * quickly as possible */
3395 if (call->state == RX_STATE_ACTIVE) {
3396 rxi_CallError(call, RX_CALL_DEAD);
3397 rxi_SendSpecial(call, conn, NULL, RX_PACKET_TYPE_BUSY,
3399 MUTEX_EXIT(&call->lock);
3403 if (rxi_AbortIfServerBusy(socket, conn, np)) {
3404 MUTEX_EXIT(&call->lock);
3408 rxi_ResetCall(call, 0);
3409 /* The conn_call_lock is not held but no one else should be
3410 * using this call channel while we are processing this incoming
3411 * packet. This assignment should be safe.
3413 *call->callNumber = np->header.callNumber;
3414 call->state = RX_STATE_PRECALL;
3415 clock_GetTime(&call->queueTime);
3416 call->app.bytesSent = 0;
3417 call->app.bytesRcvd = 0;
3418 rxi_KeepAliveOn(call);
3424 /* There are two packet tracing routines available for testing and monitoring
3425 * Rx. One is called just after every packet is received and the other is
3426 * called just before every packet is sent. Received packets, have had their
3427 * headers decoded, and packets to be sent have not yet had their headers
3428 * encoded. Both take two parameters: a pointer to the packet and a sockaddr
3429 * containing the network address. Both can be modified. The return value, if
3430 * non-zero, indicates that the packet should be dropped. */
3432 int (*rx_justReceived) (struct rx_packet *, struct sockaddr_in *) = 0;
3433 int (*rx_almostSent) (struct rx_packet *, struct sockaddr_in *) = 0;
3435 /* A packet has been received off the interface. Np is the packet, socket is
3436 * the socket number it was received from (useful in determining which service
3437 * this packet corresponds to), and (host, port) reflect the host,port of the
3438 * sender. This call returns the packet to the caller if it is finished with
3439 * it, rather than de-allocating it, just as a small performance hack */
3442 rxi_ReceivePacket(struct rx_packet *np, osi_socket socket,
3443 afs_uint32 host, u_short port, int *tnop,
3444 struct rx_call **newcallp)
3446 struct rx_call *call;
3447 struct rx_connection *conn;
3449 int unknownService = 0;
3453 struct rx_packet *tnp;
3456 /* We don't print out the packet until now because (1) the time may not be
3457 * accurate enough until now in the lwp implementation (rx_Listener only gets
3458 * the time after the packet is read) and (2) from a protocol point of view,
3459 * this is the first time the packet has been seen */
3460 packetType = (np->header.type > 0 && np->header.type < RX_N_PACKET_TYPES)
3461 ? rx_packetTypes[np->header.type - 1] : "*UNKNOWN*";
3462 dpf(("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"AFS_PTR_FMT"\n",
3463 np->header.serial, packetType, ntohl(host), ntohs(port), np->header.serviceId,
3464 np->header.epoch, np->header.cid, np->header.callNumber,
3465 np->header.seq, np->header.flags, np));
3468 /* Account for connectionless packets */
3469 if (rx_stats_active &&
3470 ((np->header.type == RX_PACKET_TYPE_VERSION) ||
3471 (np->header.type == RX_PACKET_TYPE_DEBUG))) {
3472 struct rx_peer *peer;
3474 /* Try to look up the peer structure, but don't create one */
3475 peer = rxi_FindPeer(host, port, 0);
3477 /* Since this may not be associated with a connection, it may have
3478 * no refCount, meaning we could race with ReapConnections
3481 if (peer && (peer->refCount > 0)) {
3482 #ifdef AFS_RXERRQ_ENV
3483 if (rx_atomic_read(&peer->neterrs)) {
3484 rx_atomic_set(&peer->neterrs, 0);
3487 MUTEX_ENTER(&peer->peer_lock);
3488 peer->bytesReceived += np->length;
3489 MUTEX_EXIT(&peer->peer_lock);
3493 if (np->header.type == RX_PACKET_TYPE_VERSION) {
3494 return rxi_ReceiveVersionPacket(np, socket, host, port, 1);
3497 if (np->header.type == RX_PACKET_TYPE_DEBUG) {
3498 return rxi_ReceiveDebugPacket(np, socket, host, port, 1);
3501 /* If an input tracer function is defined, call it with the packet and
3502 * network address. Note this function may modify its arguments. */
3503 if (rx_justReceived) {
3504 struct sockaddr_in addr;
3506 addr.sin_family = AF_INET;
3507 addr.sin_port = port;
3508 addr.sin_addr.s_addr = host;
3509 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
3510 addr.sin_len = sizeof(addr);
3511 #endif /* AFS_OSF_ENV */
3512 drop = (*rx_justReceived) (np, &addr);
3513 /* drop packet if return value is non-zero */
3516 port = addr.sin_port; /* in case fcn changed addr */
3517 host = addr.sin_addr.s_addr;
3521 /* If packet was not sent by the client, then *we* must be the client */
3522 type = ((np->header.flags & RX_CLIENT_INITIATED) != RX_CLIENT_INITIATED)
3523 ? RX_CLIENT_CONNECTION : RX_SERVER_CONNECTION;
3525 /* Find the connection (or fabricate one, if we're the server & if
3526 * necessary) associated with this packet */
3528 rxi_FindConnection(socket, host, port, np->header.serviceId,
3529 np->header.cid, np->header.epoch, type,
3530 np->header.securityIndex, &unknownService);
3532 /* To avoid having 2 connections just abort at each other,
3533 don't abort an abort. */
3535 if (unknownService && (np->header.type != RX_PACKET_TYPE_ABORT))
3536 rxi_SendRawAbort(socket, host, port, RX_INVALID_OPERATION,
3541 #ifdef AFS_RXERRQ_ENV
3542 if (rx_atomic_read(&conn->peer->neterrs)) {
3543 rx_atomic_set(&conn->peer->neterrs, 0);
3547 /* If we're doing statistics, then account for the incoming packet */
3548 if (rx_stats_active) {
3549 MUTEX_ENTER(&conn->peer->peer_lock);
3550 conn->peer->bytesReceived += np->length;
3551 MUTEX_EXIT(&conn->peer->peer_lock);
3554 /* If the connection is in an error state, send an abort packet and ignore
3555 * the incoming packet */
3557 /* Don't respond to an abort packet--we don't want loops! */
3558 MUTEX_ENTER(&conn->conn_data_lock);
3559 if (np->header.type != RX_PACKET_TYPE_ABORT)
3560 np = rxi_SendConnectionAbort(conn, np, 1, 0);
3561 putConnection(conn);
3562 MUTEX_EXIT(&conn->conn_data_lock);
3566 /* Check for connection-only requests (i.e. not call specific). */
3567 if (np->header.callNumber == 0) {
3568 switch (np->header.type) {
3569 case RX_PACKET_TYPE_ABORT: {
3570 /* What if the supplied error is zero? */
3571 afs_int32 errcode = ntohl(rx_GetInt32(np, 0));
3572 dpf(("rxi_ReceivePacket ABORT rx_GetInt32 = %d\n", errcode));
3573 rxi_ConnectionError(conn, errcode);
3574 putConnection(conn);
3577 case RX_PACKET_TYPE_CHALLENGE:
3578 tnp = rxi_ReceiveChallengePacket(conn, np, 1);
3579 putConnection(conn);
3581 case RX_PACKET_TYPE_RESPONSE:
3582 tnp = rxi_ReceiveResponsePacket(conn, np, 1);
3583 putConnection(conn);
3585 case RX_PACKET_TYPE_PARAMS:
3586 case RX_PACKET_TYPE_PARAMS + 1:
3587 case RX_PACKET_TYPE_PARAMS + 2:
3588 /* ignore these packet types for now */
3589 putConnection(conn);
3593 /* Should not reach here, unless the peer is broken: send an
3595 rxi_ConnectionError(conn, RX_PROTOCOL_ERROR);
3596 MUTEX_ENTER(&conn->conn_data_lock);
3597 tnp = rxi_SendConnectionAbort(conn, np, 1, 0);
3598 putConnection(conn);
3599 MUTEX_EXIT(&conn->conn_data_lock);
3604 if (type == RX_SERVER_CONNECTION)
3605 call = rxi_ReceiveServerCall(socket, np, conn);
3607 call = rxi_ReceiveClientCall(np, conn);
3610 putConnection(conn);
3614 MUTEX_ASSERT(&call->lock);
3615 /* Set remote user defined status from packet */
3616 call->remoteStatus = np->header.userStatus;
3618 /* Now do packet type-specific processing */
3619 switch (np->header.type) {
3620 case RX_PACKET_TYPE_DATA:
3621 /* If we're a client, and receiving a response, then all the packets
3622 * we transmitted packets are implicitly acknowledged. */
3623 if (type == RX_CLIENT_CONNECTION && !opr_queue_IsEmpty(&call->tq))
3624 rxi_AckAllInTransmitQueue(call);
3626 np = rxi_ReceiveDataPacket(call, np, 1, socket, host, port, tnop,
3629 case RX_PACKET_TYPE_ACK:
3630 /* Respond immediately to ack packets requesting acknowledgement
3632 if (np->header.flags & RX_REQUEST_ACK) {
3634 (void)rxi_SendCallAbort(call, 0, 1, 0);
3636 (void)rxi_SendAck(call, 0, np->header.serial,
3637 RX_ACK_PING_RESPONSE, 1);
3639 np = rxi_ReceiveAckPacket(call, np, 1);
3641 case RX_PACKET_TYPE_ABORT: {
3642 /* An abort packet: reset the call, passing the error up to the user. */
3643 /* What if error is zero? */
3644 /* What if the error is -1? the application will treat it as a timeout. */
3645 afs_int32 errdata = ntohl(*(afs_int32 *) rx_DataOf(np));
3646 dpf(("rxi_ReceivePacket ABORT rx_DataOf = %d\n", errdata));
3647 rxi_CallError(call, errdata);
3648 MUTEX_EXIT(&call->lock);
3649 putConnection(conn);
3650 return np; /* xmitting; drop packet */
3652 case RX_PACKET_TYPE_BUSY: {
3653 struct clock busyTime;
3655 clock_GetTime(&busyTime);
3657 MUTEX_EXIT(&call->lock);
3659 MUTEX_ENTER(&conn->conn_call_lock);
3660 MUTEX_ENTER(&call->lock);
3661 conn->lastBusy[call->channel] = busyTime.sec;
3662 call->flags |= RX_CALL_PEER_BUSY;
3663 MUTEX_EXIT(&call->lock);
3664 MUTEX_EXIT(&conn->conn_call_lock);
3666 putConnection(conn);
3670 case RX_PACKET_TYPE_ACKALL:
3671 /* All packets acknowledged, so we can drop all packets previously
3672 * readied for sending */
3673 rxi_AckAllInTransmitQueue(call);
3676 /* Should not reach here, unless the peer is broken: send an abort
3678 rxi_CallError(call, RX_PROTOCOL_ERROR);
3679 np = rxi_SendCallAbort(call, np, 1, 0);
3682 /* Note when this last legitimate packet was received, for keep-alive
3683 * processing. Note, we delay getting the time until now in the hope that
3684 * the packet will be delivered to the user before any get time is required
3685 * (if not, then the time won't actually be re-evaluated here). */
3686 call->lastReceiveTime = clock_Sec();
3687 /* we've received a legit packet, so the channel is not busy */
3688 call->flags &= ~RX_CALL_PEER_BUSY;
3689 MUTEX_EXIT(&call->lock);
3690 putConnection(conn);
3694 /* return true if this is an "interesting" connection from the point of view
3695 of someone trying to debug the system */
3697 rxi_IsConnInteresting(struct rx_connection *aconn)
3700 struct rx_call *tcall;
3702 if (aconn->flags & (RX_CONN_MAKECALL_WAITING | RX_CONN_DESTROY_ME))
3705 for (i = 0; i < RX_MAXCALLS; i++) {
3706 tcall = aconn->call[i];
3708 if ((tcall->state == RX_STATE_PRECALL)
3709 || (tcall->state == RX_STATE_ACTIVE))
3711 if ((tcall->app.mode == RX_MODE_SENDING)
3712 || (tcall->app.mode == RX_MODE_RECEIVING))
3720 /* if this is one of the last few packets AND it wouldn't be used by the
3721 receiving call to immediately satisfy a read request, then drop it on
3722 the floor, since accepting it might prevent a lock-holding thread from
3723 making progress in its reading. If a call has been cleared while in
3724 the precall state then ignore all subsequent packets until the call
3725 is assigned to a thread. */
3728 TooLow(struct rx_packet *ap, struct rx_call *acall)
3732 MUTEX_ENTER(&rx_quota_mutex);
3733 if (((ap->header.seq != 1) && (acall->flags & RX_CALL_CLEARED)
3734 && (acall->state == RX_STATE_PRECALL))
3735 || ((rx_nFreePackets < rxi_dataQuota + 2)
3736 && !((ap->header.seq < acall->rnext + rx_initSendWindow)
3737 && (acall->flags & RX_CALL_READER_WAIT)))) {
3740 MUTEX_EXIT(&rx_quota_mutex);
3746 * Clear the attach wait flag on a connection and proceed.
3748 * Any processing waiting for a connection to be attached should be
3749 * unblocked. We clear the flag and do any other needed tasks.
3752 * the conn to unmark waiting for attach
3754 * @pre conn's conn_data_lock must be locked before calling this function
3758 rxi_ConnClearAttachWait(struct rx_connection *conn)
3760 /* Indicate that rxi_CheckReachEvent is no longer running by
3761 * clearing the flag. Must be atomic under conn_data_lock to
3762 * avoid a new call slipping by: rxi_CheckConnReach holds
3763 * conn_data_lock while checking RX_CONN_ATTACHWAIT.
3765 conn->flags &= ~RX_CONN_ATTACHWAIT;
3766 if (conn->flags & RX_CONN_NAT_PING) {
3767 conn->flags &= ~RX_CONN_NAT_PING;
3768 rxi_ScheduleNatKeepAliveEvent(conn);
3773 rxi_CheckReachEvent(struct rxevent *event, void *arg1, void *arg2, int dummy)
3775 struct rx_connection *conn = arg1;
3776 struct rx_call *acall = arg2;
3777 struct rx_call *call = acall;
3778 struct clock when, now;
3781 MUTEX_ENTER(&conn->conn_data_lock);
3784 rxevent_Put(&conn->checkReachEvent);
3786 waiting = conn->flags & RX_CONN_ATTACHWAIT;
3788 putConnection(conn);
3790 MUTEX_EXIT(&conn->conn_data_lock);
3794 MUTEX_ENTER(&conn->conn_call_lock);
3795 MUTEX_ENTER(&conn->conn_data_lock);
3796 for (i = 0; i < RX_MAXCALLS; i++) {
3797 struct rx_call *tc = conn->call[i];
3798 if (tc && tc->state == RX_STATE_PRECALL) {
3804 rxi_ConnClearAttachWait(conn);
3805 MUTEX_EXIT(&conn->conn_data_lock);
3806 MUTEX_EXIT(&conn->conn_call_lock);
3811 MUTEX_ENTER(&call->lock);
3812 rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
3814 MUTEX_EXIT(&call->lock);
3816 clock_GetTime(&now);
3818 when.sec += RX_CHECKREACH_TIMEOUT;
3819 MUTEX_ENTER(&conn->conn_data_lock);
3820 if (!conn->checkReachEvent) {
3821 MUTEX_ENTER(&rx_refcnt_mutex);
3823 MUTEX_EXIT(&rx_refcnt_mutex);
3824 conn->checkReachEvent = rxevent_Post(&when, &now,
3825 rxi_CheckReachEvent, conn,
3828 MUTEX_EXIT(&conn->conn_data_lock);
3834 rxi_CheckConnReach(struct rx_connection *conn, struct rx_call *call)
3836 struct rx_service *service = conn->service;
3837 struct rx_peer *peer = conn->peer;
3838 afs_uint32 now, lastReach;
3840 if (service->checkReach == 0)
3844 MUTEX_ENTER(&peer->peer_lock);
3845 lastReach = peer->lastReachTime;
3846 MUTEX_EXIT(&peer->peer_lock);
3847 if (now - lastReach < RX_CHECKREACH_TTL)
3850 MUTEX_ENTER(&conn->conn_data_lock);
3851 if (conn->flags & RX_CONN_ATTACHWAIT) {
3852 MUTEX_EXIT(&conn->conn_data_lock);
3855 conn->flags |= RX_CONN_ATTACHWAIT;
3856 MUTEX_EXIT(&conn->conn_data_lock);
3857 if (!conn->checkReachEvent)
3858 rxi_CheckReachEvent(NULL, conn, call, 0);
3863 /* try to attach call, if authentication is complete */
3865 TryAttach(struct rx_call *acall, osi_socket socket,
3866 int *tnop, struct rx_call **newcallp,
3869 struct rx_connection *conn = acall->conn;
3871 if (conn->type == RX_SERVER_CONNECTION
3872 && acall->state == RX_STATE_PRECALL) {
3873 /* Don't attach until we have any req'd. authentication. */
3874 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0) {
3875 if (reachOverride || rxi_CheckConnReach(conn, acall) == 0)
3876 rxi_AttachServerProc(acall, socket, tnop, newcallp);
3877 /* Note: this does not necessarily succeed; there
3878 * may not any proc available
3881 rxi_ChallengeOn(acall->conn);
3886 /* A data packet has been received off the interface. This packet is
3887 * appropriate to the call (the call is in the right state, etc.). This
3888 * routine can return a packet to the caller, for re-use */
3890 static struct rx_packet *
3891 rxi_ReceiveDataPacket(struct rx_call *call,
3892 struct rx_packet *np, int istack,
3893 osi_socket socket, afs_uint32 host, u_short port,
3894 int *tnop, struct rx_call **newcallp)
3896 int ackNeeded = 0; /* 0 means no, otherwise ack_reason */
3901 afs_uint32 serial=0, flags=0;
3903 struct rx_packet *tnp;
3904 if (rx_stats_active)
3905 rx_atomic_inc(&rx_stats.dataPacketsRead);
3908 /* If there are no packet buffers, drop this new packet, unless we can find
3909 * packet buffers from inactive calls */
3911 && (rxi_OverQuota(RX_PACKET_CLASS_RECEIVE) || TooLow(np, call))) {
3912 MUTEX_ENTER(&rx_freePktQ_lock);
3913 rxi_NeedMorePackets = TRUE;
3914 MUTEX_EXIT(&rx_freePktQ_lock);
3915 if (rx_stats_active)
3916 rx_atomic_inc(&rx_stats.noPacketBuffersOnRead);
3917 rxi_calltrace(RX_TRACE_DROP, call);
3918 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - quota problems\n", np));
3919 /* We used to clear the receive queue here, in an attempt to free
3920 * packets. However this is unsafe if the queue has received a
3921 * soft ACK for the final packet */
3922 rxi_PostDelayedAckEvent(call, &rx_softAckDelay);
3928 * New in AFS 3.5, if the RX_JUMBO_PACKET flag is set then this
3929 * packet is one of several packets transmitted as a single
3930 * datagram. Do not send any soft or hard acks until all packets
3931 * in a jumbogram have been processed. Send negative acks right away.
3933 for (isFirst = 1, tnp = NULL; isFirst || tnp; isFirst = 0) {
3934 /* tnp is non-null when there are more packets in the
3935 * current jumbo gram */
3942 seq = np->header.seq;
3943 serial = np->header.serial;
3944 flags = np->header.flags;
3946 /* If the call is in an error state, send an abort message */
3948 return rxi_SendCallAbort(call, np, istack, 0);
3950 /* The RX_JUMBO_PACKET is set in all but the last packet in each
3951 * AFS 3.5 jumbogram. */
3952 if (flags & RX_JUMBO_PACKET) {
3953 tnp = rxi_SplitJumboPacket(np, host, port, isFirst);
3958 if (np->header.spare != 0) {
3959 MUTEX_ENTER(&call->conn->conn_data_lock);
3960 call->conn->flags |= RX_CONN_USING_PACKET_CKSUM;
3961 MUTEX_EXIT(&call->conn->conn_data_lock);
3964 /* The usual case is that this is the expected next packet */
3965 if (seq == call->rnext) {
3967 /* Check to make sure it is not a duplicate of one already queued */
3968 if (!opr_queue_IsEmpty(&call->rq)
3969 && opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq == seq) {
3970 if (rx_stats_active)
3971 rx_atomic_inc(&rx_stats.dupPacketsRead);
3972 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - duplicate\n", np));
3973 rxi_CancelDelayedAckEvent(call);
3974 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3980 /* It's the next packet. Stick it on the receive queue
3981 * for this call. Set newPackets to make sure we wake
3982 * the reader once all packets have been processed */
3983 #ifdef RX_TRACK_PACKETS
3984 np->flags |= RX_PKTFLAG_RQ;
3986 opr_queue_Prepend(&call->rq, &np->entry);
3987 #ifdef RXDEBUG_PACKET
3989 #endif /* RXDEBUG_PACKET */
3991 np = NULL; /* We can't use this anymore */
3994 /* If an ack is requested then set a flag to make sure we
3995 * send an acknowledgement for this packet */
3996 if (flags & RX_REQUEST_ACK) {
3997 ackNeeded = RX_ACK_REQUESTED;
4000 /* Keep track of whether we have received the last packet */
4001 if (flags & RX_LAST_PACKET) {
4002 call->flags |= RX_CALL_HAVE_LAST;
4006 /* Check whether we have all of the packets for this call */
4007 if (call->flags & RX_CALL_HAVE_LAST) {
4008 afs_uint32 tseq; /* temporary sequence number */
4009 struct opr_queue *cursor;
4011 for (tseq = seq, opr_queue_Scan(&call->rq, cursor)) {
4012 struct rx_packet *tp;
4014 tp = opr_queue_Entry(cursor, struct rx_packet, entry);
4015 if (tseq != tp->header.seq)
4017 if (tp->header.flags & RX_LAST_PACKET) {
4018 call->flags |= RX_CALL_RECEIVE_DONE;
4025 /* Provide asynchronous notification for those who want it
4026 * (e.g. multi rx) */
4027 if (call->arrivalProc) {
4028 (*call->arrivalProc) (call, call->arrivalProcHandle,
4029 call->arrivalProcArg);
4030 call->arrivalProc = (void (*)())0;
4033 /* Update last packet received */
4036 /* If there is no server process serving this call, grab
4037 * one, if available. We only need to do this once. If a
4038 * server thread is available, this thread becomes a server
4039 * thread and the server thread becomes a listener thread. */
4041 TryAttach(call, socket, tnop, newcallp, 0);
4044 /* This is not the expected next packet. */
4046 /* Determine whether this is a new or old packet, and if it's
4047 * a new one, whether it fits into the current receive window.
4048 * Also figure out whether the packet was delivered in sequence.
4049 * We use the prev variable to determine whether the new packet
4050 * is the successor of its immediate predecessor in the
4051 * receive queue, and the missing flag to determine whether
4052 * any of this packets predecessors are missing. */
4054 afs_uint32 prev; /* "Previous packet" sequence number */
4055 struct opr_queue *cursor;
4056 int missing; /* Are any predecessors missing? */
4058 /* If the new packet's sequence number has been sent to the
4059 * application already, then this is a duplicate */
4060 if (seq < call->rnext) {
4061 if (rx_stats_active)
4062 rx_atomic_inc(&rx_stats.dupPacketsRead);
4063 rxi_CancelDelayedAckEvent(call);
4064 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
4070 /* If the sequence number is greater than what can be
4071 * accomodated by the current window, then send a negative
4072 * acknowledge and drop the packet */
4073 if ((call->rnext + call->rwind) <= seq) {
4074 rxi_CancelDelayedAckEvent(call);
4075 np = rxi_SendAck(call, np, serial, RX_ACK_EXCEEDS_WINDOW,
4082 /* Look for the packet in the queue of old received packets */
4083 prev = call->rnext - 1;
4085 for (opr_queue_Scan(&call->rq, cursor)) {
4086 struct rx_packet *tp
4087 = opr_queue_Entry(cursor, struct rx_packet, entry);
4089 /*Check for duplicate packet */
4090 if (seq == tp->header.seq) {
4091 if (rx_stats_active)
4092 rx_atomic_inc(&rx_stats.dupPacketsRead);
4093 rxi_CancelDelayedAckEvent(call);
4094 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE,
4100 /* If we find a higher sequence packet, break out and
4101 * insert the new packet here. */
4102 if (seq < tp->header.seq)
4104 /* Check for missing packet */
4105 if (tp->header.seq != prev + 1) {
4109 prev = tp->header.seq;
4112 /* Keep track of whether we have received the last packet. */
4113 if (flags & RX_LAST_PACKET) {
4114 call->flags |= RX_CALL_HAVE_LAST;
4117 /* It's within the window: add it to the the receive queue.
4118 * tp is left by the previous loop either pointing at the
4119 * packet before which to insert the new packet, or at the
4120 * queue head if the queue is empty or the packet should be
4122 #ifdef RX_TRACK_PACKETS
4123 np->flags |= RX_PKTFLAG_RQ;
4125 #ifdef RXDEBUG_PACKET
4127 #endif /* RXDEBUG_PACKET */
4128 opr_queue_InsertBefore(cursor, &np->entry);
4132 /* Check whether we have all of the packets for this call */
4133 if ((call->flags & RX_CALL_HAVE_LAST)
4134 && !(call->flags & RX_CALL_RECEIVE_DONE)) {
4135 afs_uint32 tseq; /* temporary sequence number */
4138 for (opr_queue_Scan(&call->rq, cursor)) {
4139 struct rx_packet *tp
4140 = opr_queue_Entry(cursor, struct rx_packet, entry);
4141 if (tseq != tp->header.seq)
4143 if (tp->header.flags & RX_LAST_PACKET) {
4144 call->flags |= RX_CALL_RECEIVE_DONE;
4151 /* We need to send an ack of the packet is out of sequence,
4152 * or if an ack was requested by the peer. */
4153 if (seq != prev + 1 || missing) {
4154 ackNeeded = RX_ACK_OUT_OF_SEQUENCE;
4155 } else if (flags & RX_REQUEST_ACK) {
4156 ackNeeded = RX_ACK_REQUESTED;
4159 /* Acknowledge the last packet for each call */
4160 if (flags & RX_LAST_PACKET) {
4171 * If the receiver is waiting for an iovec, fill the iovec
4172 * using the data from the receive queue */
4173 if (call->flags & RX_CALL_IOVEC_WAIT) {
4174 didHardAck = rxi_FillReadVec(call, serial);
4175 /* the call may have been aborted */
4184 /* Wakeup the reader if any */
4185 if ((call->flags & RX_CALL_READER_WAIT)
4186 && (!(call->flags & RX_CALL_IOVEC_WAIT) || !(call->iovNBytes)
4187 || (call->iovNext >= call->iovMax)
4188 || (call->flags & RX_CALL_RECEIVE_DONE))) {
4189 call->flags &= ~RX_CALL_READER_WAIT;
4190 #ifdef RX_ENABLE_LOCKS
4191 CV_BROADCAST(&call->cv_rq);
4193 osi_rxWakeup(&call->rq);
4199 * Send an ack when requested by the peer, or once every
4200 * rxi_SoftAckRate packets until the last packet has been
4201 * received. Always send a soft ack for the last packet in
4202 * the server's reply. */
4204 rxi_CancelDelayedAckEvent(call);
4205 np = rxi_SendAck(call, np, serial, ackNeeded, istack);
4206 } else if (call->nSoftAcks > (u_short) rxi_SoftAckRate) {
4207 rxi_CancelDelayedAckEvent(call);
4208 np = rxi_SendAck(call, np, serial, RX_ACK_IDLE, istack);
4209 } else if (call->nSoftAcks) {
4210 if (haveLast && !(flags & RX_CLIENT_INITIATED))
4211 rxi_PostDelayedAckEvent(call, &rx_lastAckDelay);
4213 rxi_PostDelayedAckEvent(call, &rx_softAckDelay);
4214 } else if (call->flags & RX_CALL_RECEIVE_DONE) {
4215 rxi_CancelDelayedAckEvent(call);
4222 rxi_UpdatePeerReach(struct rx_connection *conn, struct rx_call *acall)
4224 struct rx_peer *peer = conn->peer;
4226 MUTEX_ENTER(&peer->peer_lock);
4227 peer->lastReachTime = clock_Sec();
4228 MUTEX_EXIT(&peer->peer_lock);
4230 MUTEX_ENTER(&conn->conn_data_lock);
4231 if (conn->flags & RX_CONN_ATTACHWAIT) {
4234 rxi_ConnClearAttachWait(conn);
4235 MUTEX_EXIT(&conn->conn_data_lock);
4237 for (i = 0; i < RX_MAXCALLS; i++) {
4238 struct rx_call *call = conn->call[i];
4241 MUTEX_ENTER(&call->lock);
4242 /* tnop can be null if newcallp is null */
4243 TryAttach(call, (osi_socket) - 1, NULL, NULL, 1);
4245 MUTEX_EXIT(&call->lock);
4249 MUTEX_EXIT(&conn->conn_data_lock);
4252 #if defined(RXDEBUG) && defined(AFS_NT40_ENV)
4254 rx_ack_reason(int reason)
4257 case RX_ACK_REQUESTED:
4259 case RX_ACK_DUPLICATE:
4261 case RX_ACK_OUT_OF_SEQUENCE:
4263 case RX_ACK_EXCEEDS_WINDOW:
4265 case RX_ACK_NOSPACE:
4269 case RX_ACK_PING_RESPONSE:
4282 /* The real smarts of the whole thing. */
4283 static struct rx_packet *
4284 rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
4287 struct rx_ackPacket *ap;
4289 struct rx_packet *tp;
4290 struct rx_connection *conn = call->conn;
4291 struct rx_peer *peer = conn->peer;
4292 struct opr_queue *cursor;
4293 struct clock now; /* Current time, for RTT calculations */
4301 int newAckCount = 0;
4302 int maxDgramPackets = 0; /* Set if peer supports AFS 3.5 jumbo datagrams */
4303 int pktsize = 0; /* Set if we need to update the peer mtu */
4304 int conn_data_locked = 0;
4306 if (rx_stats_active)
4307 rx_atomic_inc(&rx_stats.ackPacketsRead);
4308 ap = (struct rx_ackPacket *)rx_DataOf(np);
4309 nbytes = rx_Contiguous(np) - (int)((ap->acks) - (u_char *) ap);
4311 return np; /* truncated ack packet */
4313 /* depends on ack packet struct */
4314 nAcks = MIN((unsigned)nbytes, (unsigned)ap->nAcks);
4315 first = ntohl(ap->firstPacket);
4316 prev = ntohl(ap->previousPacket);
4317 serial = ntohl(ap->serial);
4320 * Ignore ack packets received out of order while protecting
4321 * against peers that set the previousPacket field to a packet
4322 * serial number instead of a sequence number.
4324 if (first < call->tfirst ||
4325 (first == call->tfirst && prev < call->tprev && prev < call->tfirst
4332 if (np->header.flags & RX_SLOW_START_OK) {
4333 call->flags |= RX_CALL_SLOW_START_OK;
4336 if (ap->reason == RX_ACK_PING_RESPONSE)
4337 rxi_UpdatePeerReach(conn, call);
4339 if (conn->lastPacketSizeSeq) {
4340 MUTEX_ENTER(&conn->conn_data_lock);
4341 conn_data_locked = 1;
4342 if ((first > conn->lastPacketSizeSeq) && (conn->lastPacketSize)) {
4343 pktsize = conn->lastPacketSize;
4344 conn->lastPacketSize = conn->lastPacketSizeSeq = 0;
4347 if ((ap->reason == RX_ACK_PING_RESPONSE) && (conn->lastPingSizeSer)) {
4348 if (!conn_data_locked) {
4349 MUTEX_ENTER(&conn->conn_data_lock);
4350 conn_data_locked = 1;
4352 if ((conn->lastPingSizeSer == serial) && (conn->lastPingSize)) {
4353 /* process mtu ping ack */
4354 pktsize = conn->lastPingSize;
4355 conn->lastPingSizeSer = conn->lastPingSize = 0;
4359 if (conn_data_locked) {
4360 MUTEX_EXIT(&conn->conn_data_lock);
4361 conn_data_locked = 0;
4365 if (rxdebug_active) {
4369 len = _snprintf(msg, sizeof(msg),
4370 "tid[%d] RACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
4371 GetCurrentThreadId(), rx_ack_reason(ap->reason),
4372 ntohl(ap->serial), ntohl(ap->previousPacket),
4373 (unsigned int)np->header.seq, ntohl(ap->firstPacket),
4374 ap->nAcks, ntohs(ap->bufferSpace) );
4378 for (offset = 0; offset < nAcks && len < sizeof(msg); offset++)
4379 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
4383 OutputDebugString(msg);
4385 #else /* AFS_NT40_ENV */
4388 "RACK: reason %x previous %u seq %u serial %u first %u",
4389 ap->reason, ntohl(ap->previousPacket),
4390 (unsigned int)np->header.seq, (unsigned int)serial,
4391 ntohl(ap->firstPacket));
4394 for (offset = 0; offset < nAcks; offset++)
4395 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
4400 #endif /* AFS_NT40_ENV */
4403 MUTEX_ENTER(&peer->peer_lock);
4406 * Start somewhere. Can't assume we can send what we can receive,
4407 * but we are clearly receiving.
4409 if (!peer->maxPacketSize)
4410 peer->maxPacketSize = RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE;
4412 if (pktsize > peer->maxPacketSize) {
4413 peer->maxPacketSize = pktsize;
4414 if ((pktsize-RX_IPUDP_SIZE > peer->ifMTU)) {
4415 peer->ifMTU=pktsize-RX_IPUDP_SIZE;
4416 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
4417 rxi_ScheduleGrowMTUEvent(call, 1);
4422 clock_GetTime(&now);
4424 /* The transmit queue splits into 4 sections.
4426 * The first section is packets which have now been acknowledged
4427 * by a window size change in the ack. These have reached the
4428 * application layer, and may be discarded. These are packets
4429 * with sequence numbers < ap->firstPacket.
4431 * The second section is packets which have sequence numbers in
4432 * the range ap->firstPacket to ap->firstPacket + ap->nAcks. The
4433 * contents of the packet's ack array determines whether these
4434 * packets are acknowledged or not.
4436 * The third section is packets which fall above the range
4437 * addressed in the ack packet. These have not yet been received
4440 * The four section is packets which have not yet been transmitted.
4441 * These packets will have a header.serial of 0.
4444 /* First section - implicitly acknowledged packets that can be
4448 tp = opr_queue_First(&call->tq, struct rx_packet, entry);
4449 while(!opr_queue_IsEnd(&call->tq, &tp->entry) && tp->header.seq < first) {
4450 struct rx_packet *next;
4452 next = opr_queue_Next(&tp->entry, struct rx_packet, entry);
4453 call->tfirst = tp->header.seq + 1;
4455 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4457 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4460 #ifdef RX_ENABLE_LOCKS
4461 /* XXX Hack. Because we have to release the global call lock when sending
4462 * packets (osi_NetSend) we drop all acks while we're traversing the tq
4463 * in rxi_Start sending packets out because packets may move to the
4464 * freePacketQueue as result of being here! So we drop these packets until
4465 * we're safely out of the traversing. Really ugly!
4466 * To make it even uglier, if we're using fine grain locking, we can
4467 * set the ack bits in the packets and have rxi_Start remove the packets
4468 * when it's done transmitting.
4470 if (call->flags & RX_CALL_TQ_BUSY) {
4471 tp->flags |= RX_PKTFLAG_ACKED;
4472 call->flags |= RX_CALL_TQ_SOME_ACKED;
4474 #endif /* RX_ENABLE_LOCKS */
4476 opr_queue_Remove(&tp->entry);
4477 #ifdef RX_TRACK_PACKETS
4478 tp->flags &= ~RX_PKTFLAG_TQ;
4480 #ifdef RXDEBUG_PACKET
4482 #endif /* RXDEBUG_PACKET */
4483 rxi_FreePacket(tp); /* rxi_FreePacket mustn't wake up anyone, preemptively. */
4488 /* N.B. we don't turn off any timers here. They'll go away by themselves, anyway */
4490 /* Second section of the queue - packets for which we are receiving
4493 * Go through the explicit acks/nacks and record the results in
4494 * the waiting packets. These are packets that can't be released
4495 * yet, even with a positive acknowledge. This positive
4496 * acknowledge only means the packet has been received by the
4497 * peer, not that it will be retained long enough to be sent to
4498 * the peer's upper level. In addition, reset the transmit timers
4499 * of any missing packets (those packets that must be missing
4500 * because this packet was out of sequence) */
4502 call->nSoftAcked = 0;
4504 while (!opr_queue_IsEnd(&call->tq, &tp->entry)
4505 && tp->header.seq < first + nAcks) {
4506 /* Set the acknowledge flag per packet based on the
4507 * information in the ack packet. An acknowlegded packet can
4508 * be downgraded when the server has discarded a packet it
4509 * soacked previously, or when an ack packet is received
4510 * out of sequence. */
4511 if (ap->acks[tp->header.seq - first] == RX_ACK_TYPE_ACK) {
4512 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4514 tp->flags |= RX_PKTFLAG_ACKED;
4515 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4522 } else /* RX_ACK_TYPE_NACK */ {
4523 tp->flags &= ~RX_PKTFLAG_ACKED;
4527 tp = opr_queue_Next(&tp->entry, struct rx_packet, entry);
4530 /* We don't need to take any action with the 3rd or 4th section in the
4531 * queue - they're not addressed by the contents of this ACK packet.
4534 /* If the window has been extended by this acknowledge packet,
4535 * then wakeup a sender waiting in alloc for window space, or try
4536 * sending packets now, if he's been sitting on packets due to
4537 * lack of window space */
4538 if (call->tnext < (call->tfirst + call->twind)) {
4539 #ifdef RX_ENABLE_LOCKS
4540 CV_SIGNAL(&call->cv_twind);
4542 if (call->flags & RX_CALL_WAIT_WINDOW_ALLOC) {
4543 call->flags &= ~RX_CALL_WAIT_WINDOW_ALLOC;
4544 osi_rxWakeup(&call->twind);
4547 if (call->flags & RX_CALL_WAIT_WINDOW_SEND) {
4548 call->flags &= ~RX_CALL_WAIT_WINDOW_SEND;
4552 /* if the ack packet has a receivelen field hanging off it,
4553 * update our state */
4554 if (np->length >= rx_AckDataSize(ap->nAcks) + 2 * sizeof(afs_int32)) {
4557 /* If the ack packet has a "recommended" size that is less than
4558 * what I am using now, reduce my size to match */
4559 rx_packetread(np, rx_AckDataSize(ap->nAcks) + (int)sizeof(afs_int32),
4560 (int)sizeof(afs_int32), &tSize);
4561 tSize = (afs_uint32) ntohl(tSize);
4562 peer->natMTU = rxi_AdjustIfMTU(MIN(tSize, peer->ifMTU));
4564 /* Get the maximum packet size to send to this peer */
4565 rx_packetread(np, rx_AckDataSize(ap->nAcks), (int)sizeof(afs_int32),
4567 tSize = (afs_uint32) ntohl(tSize);
4568 tSize = (afs_uint32) MIN(tSize, rx_MyMaxSendSize);
4569 tSize = rxi_AdjustMaxMTU(peer->natMTU, tSize);
4571 /* sanity check - peer might have restarted with different params.
4572 * If peer says "send less", dammit, send less... Peer should never
4573 * be unable to accept packets of the size that prior AFS versions would
4574 * send without asking. */
4575 if (peer->maxMTU != tSize) {
4576 if (peer->maxMTU > tSize) /* possible cong., maxMTU decreased */
4578 peer->maxMTU = tSize;
4579 peer->MTU = MIN(tSize, peer->MTU);
4580 call->MTU = MIN(call->MTU, tSize);
4583 if (np->length == rx_AckDataSize(ap->nAcks) + 3 * sizeof(afs_int32)) {
4586 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4587 (int)sizeof(afs_int32), &tSize);
4588 tSize = (afs_uint32) ntohl(tSize); /* peer's receive window, if it's */
4589 if (tSize < call->twind) { /* smaller than our send */
4590 call->twind = tSize; /* window, we must send less... */
4591 call->ssthresh = MIN(call->twind, call->ssthresh);
4592 call->conn->twind[call->channel] = call->twind;
4595 /* Only send jumbograms to 3.4a fileservers. 3.3a RX gets the
4596 * network MTU confused with the loopback MTU. Calculate the
4597 * maximum MTU here for use in the slow start code below.
4599 /* Did peer restart with older RX version? */
4600 if (peer->maxDgramPackets > 1) {
4601 peer->maxDgramPackets = 1;
4603 } else if (np->length >=
4604 rx_AckDataSize(ap->nAcks) + 4 * sizeof(afs_int32)) {
4607 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4608 sizeof(afs_int32), &tSize);
4609 tSize = (afs_uint32) ntohl(tSize);
4611 * As of AFS 3.5 we set the send window to match the receive window.
4613 if (tSize < call->twind) {
4614 call->twind = tSize;
4615 call->conn->twind[call->channel] = call->twind;
4616 call->ssthresh = MIN(call->twind, call->ssthresh);
4617 } else if (tSize > call->twind) {
4618 call->twind = tSize;
4619 call->conn->twind[call->channel] = call->twind;
4623 * As of AFS 3.5, a jumbogram is more than one fixed size
4624 * packet transmitted in a single UDP datagram. If the remote
4625 * MTU is smaller than our local MTU then never send a datagram
4626 * larger than the natural MTU.
4629 rx_AckDataSize(ap->nAcks) + 3 * (int)sizeof(afs_int32),
4630 (int)sizeof(afs_int32), &tSize);
4631 maxDgramPackets = (afs_uint32) ntohl(tSize);
4632 maxDgramPackets = MIN(maxDgramPackets, rxi_nDgramPackets);
4634 MIN(maxDgramPackets, (int)(peer->ifDgramPackets));
4635 if (maxDgramPackets > 1) {
4636 peer->maxDgramPackets = maxDgramPackets;
4637 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
4639 peer->maxDgramPackets = 1;
4640 call->MTU = peer->natMTU;
4642 } else if (peer->maxDgramPackets > 1) {
4643 /* Restarted with lower version of RX */
4644 peer->maxDgramPackets = 1;
4646 } else if (peer->maxDgramPackets > 1
4647 || peer->maxMTU != OLD_MAX_PACKET_SIZE) {
4648 /* Restarted with lower version of RX */
4649 peer->maxMTU = OLD_MAX_PACKET_SIZE;
4650 peer->natMTU = OLD_MAX_PACKET_SIZE;
4651 peer->MTU = OLD_MAX_PACKET_SIZE;
4652 peer->maxDgramPackets = 1;
4653 peer->nDgramPackets = 1;
4655 call->MTU = OLD_MAX_PACKET_SIZE;
4660 * Calculate how many datagrams were successfully received after
4661 * the first missing packet and adjust the negative ack counter
4666 nNacked = (nNacked + call->nDgramPackets - 1) / call->nDgramPackets;
4667 if (call->nNacks < nNacked) {
4668 call->nNacks = nNacked;
4671 call->nAcks += newAckCount;
4675 /* If the packet contained new acknowledgements, rather than just
4676 * being a duplicate of one we have previously seen, then we can restart
4679 if (newAckCount > 0)
4680 rxi_rto_packet_acked(call, istack);
4682 if (call->flags & RX_CALL_FAST_RECOVER) {
4683 if (newAckCount == 0) {
4684 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4686 call->flags &= ~RX_CALL_FAST_RECOVER;
4687 call->cwind = call->nextCwind;
4688 call->nextCwind = 0;
4691 call->nCwindAcks = 0;
4692 } else if (nNacked && call->nNacks >= (u_short) rx_nackThreshold) {
4693 /* Three negative acks in a row trigger congestion recovery */
4694 call->flags |= RX_CALL_FAST_RECOVER;
4695 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
4697 MIN((int)(call->ssthresh + rx_nackThreshold), rx_maxSendWindow);
4698 call->nDgramPackets = MAX(2, (int)call->nDgramPackets) >> 1;
4699 call->nextCwind = call->ssthresh;
4702 peer->MTU = call->MTU;
4703 peer->cwind = call->nextCwind;
4704 peer->nDgramPackets = call->nDgramPackets;
4706 call->congestSeq = peer->congestSeq;
4708 /* Reset the resend times on the packets that were nacked
4709 * so we will retransmit as soon as the window permits
4713 for (opr_queue_ScanBackwards(&call->tq, cursor)) {
4714 struct rx_packet *tp =
4715 opr_queue_Entry(cursor, struct rx_packet, entry);
4717 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4718 tp->flags &= ~RX_PKTFLAG_SENT;
4720 } else if (tp->flags & RX_PKTFLAG_ACKED) {
4725 /* If cwind is smaller than ssthresh, then increase
4726 * the window one packet for each ack we receive (exponential
4728 * If cwind is greater than or equal to ssthresh then increase
4729 * the congestion window by one packet for each cwind acks we
4730 * receive (linear growth). */
4731 if (call->cwind < call->ssthresh) {
4733 MIN((int)call->ssthresh, (int)(call->cwind + newAckCount));
4734 call->nCwindAcks = 0;
4736 call->nCwindAcks += newAckCount;
4737 if (call->nCwindAcks >= call->cwind) {
4738 call->nCwindAcks = 0;
4739 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4743 * If we have received several acknowledgements in a row then
4744 * it is time to increase the size of our datagrams
4746 if ((int)call->nAcks > rx_nDgramThreshold) {
4747 if (peer->maxDgramPackets > 1) {
4748 if (call->nDgramPackets < peer->maxDgramPackets) {
4749 call->nDgramPackets++;
4751 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
4752 } else if (call->MTU < peer->maxMTU) {
4753 /* don't upgrade if we can't handle it */
4754 if ((call->nDgramPackets == 1) && (call->MTU >= peer->ifMTU))
4755 call->MTU = peer->ifMTU;
4757 call->MTU += peer->natMTU;
4758 call->MTU = MIN(call->MTU, peer->maxMTU);
4765 MUTEX_EXIT(&peer->peer_lock); /* rxi_Start will lock peer. */
4767 /* Servers need to hold the call until all response packets have
4768 * been acknowledged. Soft acks are good enough since clients
4769 * are not allowed to clear their receive queues. */
4770 if (call->state == RX_STATE_HOLD
4771 && call->tfirst + call->nSoftAcked >= call->tnext) {
4772 call->state = RX_STATE_DALLY;
4773 rxi_ClearTransmitQueue(call, 0);
4774 rxi_CancelKeepAliveEvent(call);
4775 } else if (!opr_queue_IsEmpty(&call->tq)) {
4776 rxi_Start(call, istack);
4782 * Schedule a connection abort to be sent after some delay.
4784 * @param[in] conn The connection to send the abort on.
4785 * @param[in] msec The number of milliseconds to wait before sending.
4787 * @pre conn_data_lock must be held
4790 rxi_SendConnectionAbortLater(struct rx_connection *conn, int msec)
4792 struct clock when, now;
4796 if (!conn->delayedAbortEvent) {
4797 clock_GetTime(&now);
4799 clock_Addmsec(&when, msec);
4800 conn->delayedAbortEvent =
4801 rxevent_Post(&when, &now, rxi_SendDelayedConnAbort, conn, NULL, 0);
4805 /* Received a response to a challenge packet */
4806 static struct rx_packet *
4807 rxi_ReceiveResponsePacket(struct rx_connection *conn,
4808 struct rx_packet *np, int istack)
4812 /* Ignore the packet if we're the client */
4813 if (conn->type == RX_CLIENT_CONNECTION)
4816 /* If already authenticated, ignore the packet (it's probably a retry) */
4817 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0)
4820 /* Otherwise, have the security object evaluate the response packet */
4821 error = RXS_CheckResponse(conn->securityObject, conn, np);
4823 /* If the response is invalid, reset the connection, sending
4824 * an abort to the peer. Send the abort with a 1 second delay,
4825 * to avoid a peer hammering us by constantly recreating a
4826 * connection with bad credentials. */
4827 rxi_ConnectionError(conn, error);
4828 MUTEX_ENTER(&conn->conn_data_lock);
4829 rxi_SendConnectionAbortLater(conn, 1000);
4830 MUTEX_EXIT(&conn->conn_data_lock);
4833 /* If the response is valid, any calls waiting to attach
4834 * servers can now do so */
4837 for (i = 0; i < RX_MAXCALLS; i++) {
4838 struct rx_call *call = conn->call[i];
4840 MUTEX_ENTER(&call->lock);
4841 if (call->state == RX_STATE_PRECALL)
4842 rxi_AttachServerProc(call, (osi_socket) - 1, NULL, NULL);
4843 /* tnop can be null if newcallp is null */
4844 MUTEX_EXIT(&call->lock);
4848 /* Update the peer reachability information, just in case
4849 * some calls went into attach-wait while we were waiting
4850 * for authentication..
4852 rxi_UpdatePeerReach(conn, NULL);
4857 /* A client has received an authentication challenge: the security
4858 * object is asked to cough up a respectable response packet to send
4859 * back to the server. The server is responsible for retrying the
4860 * challenge if it fails to get a response. */
4862 static struct rx_packet *
4863 rxi_ReceiveChallengePacket(struct rx_connection *conn,
4864 struct rx_packet *np, int istack)
4868 /* Ignore the challenge if we're the server */
4869 if (conn->type == RX_SERVER_CONNECTION)
4872 /* Ignore the challenge if the connection is otherwise idle; someone's
4873 * trying to use us as an oracle. */
4874 if (!rxi_HasActiveCalls(conn))
4877 /* Send the security object the challenge packet. It is expected to fill
4878 * in the response. */
4879 error = RXS_GetResponse(conn->securityObject, conn, np);
4881 /* If the security object is unable to return a valid response, reset the
4882 * connection and send an abort to the peer. Otherwise send the response
4883 * packet to the peer connection. */
4885 rxi_ConnectionError(conn, error);
4886 MUTEX_ENTER(&conn->conn_data_lock);
4887 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4888 MUTEX_EXIT(&conn->conn_data_lock);
4890 np = rxi_SendSpecial((struct rx_call *)0, conn, np,
4891 RX_PACKET_TYPE_RESPONSE, NULL, -1, istack);
4897 /* Find an available server process to service the current request in
4898 * the given call structure. If one isn't available, queue up this
4899 * call so it eventually gets one */
4901 rxi_AttachServerProc(struct rx_call *call,
4902 osi_socket socket, int *tnop,
4903 struct rx_call **newcallp)
4905 struct rx_serverQueueEntry *sq;
4906 struct rx_service *service = call->conn->service;
4909 /* May already be attached */
4910 if (call->state == RX_STATE_ACTIVE)
4913 MUTEX_ENTER(&rx_serverPool_lock);
4915 haveQuota = QuotaOK(service);
4916 if ((!haveQuota) || opr_queue_IsEmpty(&rx_idleServerQueue)) {
4917 /* If there are no processes available to service this call,
4918 * put the call on the incoming call queue (unless it's
4919 * already on the queue).
4921 #ifdef RX_ENABLE_LOCKS
4923 ReturnToServerPool(service);
4924 #endif /* RX_ENABLE_LOCKS */
4926 if (!(call->flags & RX_CALL_WAIT_PROC)) {
4927 call->flags |= RX_CALL_WAIT_PROC;
4928 rx_atomic_inc(&rx_nWaiting);
4929 rx_atomic_inc(&rx_nWaited);
4930 rxi_calltrace(RX_CALL_ARRIVAL, call);
4931 SET_CALL_QUEUE_LOCK(call, &rx_serverPool_lock);
4932 opr_queue_Append(&rx_incomingCallQueue, &call->entry);
4935 sq = opr_queue_Last(&rx_idleServerQueue,
4936 struct rx_serverQueueEntry, entry);
4938 /* If hot threads are enabled, and both newcallp and sq->socketp
4939 * are non-null, then this thread will process the call, and the
4940 * idle server thread will start listening on this threads socket.
4942 opr_queue_Remove(&sq->entry);
4944 if (rx_enable_hot_thread && newcallp && sq->socketp) {
4947 *sq->socketp = socket;
4948 clock_GetTime(&call->startTime);
4949 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
4953 if (call->flags & RX_CALL_WAIT_PROC) {
4954 /* Conservative: I don't think this should happen */
4955 call->flags &= ~RX_CALL_WAIT_PROC;
4956 rx_atomic_dec(&rx_nWaiting);
4957 if (opr_queue_IsOnQueue(&call->entry)) {
4958 opr_queue_Remove(&call->entry);
4961 call->state = RX_STATE_ACTIVE;
4962 call->app.mode = RX_MODE_RECEIVING;
4963 #ifdef RX_KERNEL_TRACE
4965 int glockOwner = ISAFS_GLOCK();
4968 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
4969 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
4975 if (call->flags & RX_CALL_CLEARED) {
4976 /* send an ack now to start the packet flow up again */
4977 call->flags &= ~RX_CALL_CLEARED;
4978 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4980 #ifdef RX_ENABLE_LOCKS
4983 service->nRequestsRunning++;
4984 MUTEX_ENTER(&rx_quota_mutex);
4985 if (service->nRequestsRunning <= service->minProcs)
4988 MUTEX_EXIT(&rx_quota_mutex);
4992 MUTEX_EXIT(&rx_serverPool_lock);
4995 /* Delay the sending of an acknowledge event for a short while, while
4996 * a new call is being prepared (in the case of a client) or a reply
4997 * is being prepared (in the case of a server). Rather than sending
4998 * an ack packet, an ACKALL packet is sent. */
5000 rxi_AckAll(struct rx_call *call)
5002 rxi_SendSpecial(call, call->conn, NULL, RX_PACKET_TYPE_ACKALL,
5004 call->flags |= RX_CALL_ACKALL_SENT;
5008 rxi_SendDelayedAck(struct rxevent *event, void *arg1, void *unused1,
5011 struct rx_call *call = arg1;
5012 #ifdef RX_ENABLE_LOCKS
5014 MUTEX_ENTER(&call->lock);
5015 if (event == call->delayedAckEvent)
5016 rxevent_Put(&call->delayedAckEvent);
5017 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
5019 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
5021 MUTEX_EXIT(&call->lock);
5022 #else /* RX_ENABLE_LOCKS */
5024 rxevent_Put(&call->delayedAckEvent);
5025 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
5026 #endif /* RX_ENABLE_LOCKS */
5029 #ifdef RX_ENABLE_LOCKS
5030 /* Set ack in all packets in transmit queue. rxi_Start will deal with
5031 * clearing them out.
5034 rxi_SetAcksInTransmitQueue(struct rx_call *call)
5036 struct opr_queue *cursor;
5039 for (opr_queue_Scan(&call->tq, cursor)) {
5041 = opr_queue_Entry(cursor, struct rx_packet, entry);
5043 p->flags |= RX_PKTFLAG_ACKED;
5048 call->flags |= RX_CALL_TQ_CLEARME;
5049 call->flags |= RX_CALL_TQ_SOME_ACKED;
5052 rxi_rto_cancel(call);
5054 call->tfirst = call->tnext;
5055 call->nSoftAcked = 0;
5057 if (call->flags & RX_CALL_FAST_RECOVER) {
5058 call->flags &= ~RX_CALL_FAST_RECOVER;
5059 call->cwind = call->nextCwind;
5060 call->nextCwind = 0;
5063 CV_SIGNAL(&call->cv_twind);
5065 #endif /* RX_ENABLE_LOCKS */
5068 * Acknowledge the whole transmit queue.
5070 * If we're running without locks, or the transmit queue isn't busy, then
5071 * we can just clear the queue now. Otherwise, we have to mark all of the
5072 * packets as acknowledged, and let rxi_Start clear it later on
5075 rxi_AckAllInTransmitQueue(struct rx_call *call)
5077 #ifdef RX_ENABLE_LOCKS
5078 if (call->flags & RX_CALL_TQ_BUSY) {
5079 rxi_SetAcksInTransmitQueue(call);
5083 rxi_ClearTransmitQueue(call, 0);
5085 /* Clear out the transmit queue for the current call (all packets have
5086 * been received by peer) */
5088 rxi_ClearTransmitQueue(struct rx_call *call, int force)
5090 #ifdef RX_ENABLE_LOCKS
5091 struct opr_queue *cursor;
5092 if (!force && (call->flags & RX_CALL_TQ_BUSY)) {
5094 for (opr_queue_Scan(&call->tq, cursor)) {
5096 = opr_queue_Entry(cursor, struct rx_packet, entry);
5098 p->flags |= RX_PKTFLAG_ACKED;
5102 call->flags |= RX_CALL_TQ_CLEARME;
5103 call->flags |= RX_CALL_TQ_SOME_ACKED;
5106 #endif /* RX_ENABLE_LOCKS */
5107 #ifdef RXDEBUG_PACKET
5109 #endif /* RXDEBUG_PACKET */
5110 rxi_FreePackets(0, &call->tq);
5111 rxi_WakeUpTransmitQueue(call);
5112 #ifdef RX_ENABLE_LOCKS
5113 call->flags &= ~RX_CALL_TQ_CLEARME;
5117 rxi_rto_cancel(call);
5118 call->tfirst = call->tnext; /* implicitly acknowledge all data already sent */
5119 call->nSoftAcked = 0;
5121 if (call->flags & RX_CALL_FAST_RECOVER) {
5122 call->flags &= ~RX_CALL_FAST_RECOVER;
5123 call->cwind = call->nextCwind;
5125 #ifdef RX_ENABLE_LOCKS
5126 CV_SIGNAL(&call->cv_twind);
5128 osi_rxWakeup(&call->twind);
5133 rxi_ClearReceiveQueue(struct rx_call *call)
5135 if (!opr_queue_IsEmpty(&call->rq)) {
5138 count = rxi_FreePackets(0, &call->rq);
5139 rx_packetReclaims += count;
5140 #ifdef RXDEBUG_PACKET
5142 if ( call->rqc != 0 )
5143 dpf(("rxi_ClearReceiveQueue call %"AFS_PTR_FMT" rqc %u != 0\n", call, call->rqc));
5145 call->flags &= ~(RX_CALL_RECEIVE_DONE | RX_CALL_HAVE_LAST);
5147 if (call->state == RX_STATE_PRECALL) {
5148 call->flags |= RX_CALL_CLEARED;
5152 /* Send an abort packet for the specified call */
5153 static struct rx_packet *
5154 rxi_SendCallAbort(struct rx_call *call, struct rx_packet *packet,
5155 int istack, int force)
5157 afs_int32 error, cerror;
5158 struct clock when, now;
5163 switch (call->error) {
5166 cerror = RX_CALL_TIMEOUT;
5169 cerror = call->error;
5172 /* Clients should never delay abort messages */
5173 if (rx_IsClientConn(call->conn))
5176 if (call->abortCode != cerror) {
5177 call->abortCode = cerror;
5178 call->abortCount = 0;
5181 if (force || rxi_callAbortThreshhold == 0
5182 || call->abortCount < rxi_callAbortThreshhold) {
5183 rxi_CancelDelayedAbortEvent(call);
5184 error = htonl(cerror);
5187 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
5188 (char *)&error, sizeof(error), istack);
5189 } else if (!call->delayedAbortEvent) {
5190 clock_GetTime(&now);
5192 clock_Addmsec(&when, rxi_callAbortDelay);
5193 CALL_HOLD(call, RX_CALL_REFCOUNT_ABORT);
5194 call->delayedAbortEvent =
5195 rxevent_Post(&when, &now, rxi_SendDelayedCallAbort, call, 0, 0);
5201 rxi_CancelDelayedAbortEvent(struct rx_call *call)
5203 if (call->delayedAbortEvent) {
5204 rxevent_Cancel(&call->delayedAbortEvent);
5205 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
5209 /* Send an abort packet for the specified connection. Packet is an
5210 * optional pointer to a packet that can be used to send the abort.
5211 * Once the number of abort messages reaches the threshhold, an
5212 * event is scheduled to send the abort. Setting the force flag
5213 * overrides sending delayed abort messages.
5215 * NOTE: Called with conn_data_lock held. conn_data_lock is dropped
5216 * to send the abort packet.
5219 rxi_SendConnectionAbort(struct rx_connection *conn,
5220 struct rx_packet *packet, int istack, int force)
5227 /* Clients should never delay abort messages */
5228 if (rx_IsClientConn(conn))
5231 if (force || rxi_connAbortThreshhold == 0
5232 || conn->abortCount < rxi_connAbortThreshhold) {
5234 rxevent_Cancel(&conn->delayedAbortEvent);
5235 error = htonl(conn->error);
5237 MUTEX_EXIT(&conn->conn_data_lock);
5239 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5240 RX_PACKET_TYPE_ABORT, (char *)&error,
5241 sizeof(error), istack);
5242 MUTEX_ENTER(&conn->conn_data_lock);
5244 rxi_SendConnectionAbortLater(conn, rxi_connAbortDelay);
5249 /* Associate an error all of the calls owned by a connection. Called
5250 * with error non-zero. This is only for really fatal things, like
5251 * bad authentication responses. The connection itself is set in
5252 * error at this point, so that future packets received will be
5255 rxi_ConnectionError(struct rx_connection *conn,
5261 dpf(("rxi_ConnectionError conn %"AFS_PTR_FMT" error %d\n", conn, error));
5263 MUTEX_ENTER(&conn->conn_data_lock);
5264 rxevent_Cancel(&conn->challengeEvent);
5265 rxevent_Cancel(&conn->natKeepAliveEvent);
5266 if (conn->checkReachEvent) {
5267 rxevent_Cancel(&conn->checkReachEvent);
5268 conn->flags &= ~(RX_CONN_ATTACHWAIT|RX_CONN_NAT_PING);
5269 putConnection(conn);
5271 MUTEX_EXIT(&conn->conn_data_lock);
5272 for (i = 0; i < RX_MAXCALLS; i++) {
5273 struct rx_call *call = conn->call[i];
5275 MUTEX_ENTER(&call->lock);
5276 rxi_CallError(call, error);
5277 MUTEX_EXIT(&call->lock);
5280 conn->error = error;
5281 if (rx_stats_active)
5282 rx_atomic_inc(&rx_stats.fatalErrors);
5287 * Interrupt an in-progress call with the specified error and wakeup waiters.
5289 * @param[in] call The call to interrupt
5290 * @param[in] error The error code to send to the peer
5293 rx_InterruptCall(struct rx_call *call, afs_int32 error)
5295 MUTEX_ENTER(&call->lock);
5296 rxi_CallError(call, error);
5297 rxi_SendCallAbort(call, NULL, 0, 1);
5298 MUTEX_EXIT(&call->lock);
5302 rxi_CallError(struct rx_call *call, afs_int32 error)
5304 MUTEX_ASSERT(&call->lock);
5305 dpf(("rxi_CallError call %"AFS_PTR_FMT" error %d call->error %d\n", call, error, call->error));
5307 error = call->error;
5309 #ifdef RX_ENABLE_LOCKS
5310 if (!((call->flags & RX_CALL_TQ_BUSY) || (call->tqWaiters > 0))) {
5311 rxi_ResetCall(call, 0);
5314 rxi_ResetCall(call, 0);
5316 call->error = error;
5319 /* Reset various fields in a call structure, and wakeup waiting
5320 * processes. Some fields aren't changed: state & mode are not
5321 * touched (these must be set by the caller), and bufptr, nLeft, and
5322 * nFree are not reset, since these fields are manipulated by
5323 * unprotected macros, and may only be reset by non-interrupting code.
5327 rxi_ResetCall(struct rx_call *call, int newcall)
5330 struct rx_peer *peer;
5331 struct rx_packet *packet;
5333 MUTEX_ASSERT(&call->lock);
5334 dpf(("rxi_ResetCall(call %"AFS_PTR_FMT", newcall %d)\n", call, newcall));
5336 /* Notify anyone who is waiting for asynchronous packet arrival */
5337 if (call->arrivalProc) {
5338 (*call->arrivalProc) (call, call->arrivalProcHandle,
5339 call->arrivalProcArg);
5340 call->arrivalProc = (void (*)())0;
5344 rxi_CancelGrowMTUEvent(call);
5346 if (call->delayedAbortEvent) {
5347 rxi_CancelDelayedAbortEvent(call);
5348 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5350 rxi_SendCallAbort(call, packet, 0, 1);
5351 rxi_FreePacket(packet);
5356 * Update the peer with the congestion information in this call
5357 * so other calls on this connection can pick up where this call
5358 * left off. If the congestion sequence numbers don't match then
5359 * another call experienced a retransmission.
5361 peer = call->conn->peer;
5362 MUTEX_ENTER(&peer->peer_lock);
5364 if (call->congestSeq == peer->congestSeq) {
5365 peer->cwind = MAX(peer->cwind, call->cwind);
5366 peer->MTU = MAX(peer->MTU, call->MTU);
5367 peer->nDgramPackets =
5368 MAX(peer->nDgramPackets, call->nDgramPackets);
5371 call->abortCode = 0;
5372 call->abortCount = 0;
5374 if (peer->maxDgramPackets > 1) {
5375 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
5377 call->MTU = peer->MTU;
5379 call->cwind = MIN((int)peer->cwind, (int)peer->nDgramPackets);
5380 call->ssthresh = rx_maxSendWindow;
5381 call->nDgramPackets = peer->nDgramPackets;
5382 call->congestSeq = peer->congestSeq;
5383 call->rtt = peer->rtt;
5384 call->rtt_dev = peer->rtt_dev;
5385 clock_Zero(&call->rto);
5386 clock_Addmsec(&call->rto,
5387 MAX(((call->rtt >> 3) + call->rtt_dev), rx_minPeerTimeout) + 200);
5388 MUTEX_EXIT(&peer->peer_lock);
5390 flags = call->flags;
5391 rxi_WaitforTQBusy(call);
5393 rxi_ClearTransmitQueue(call, 1);
5394 if (call->tqWaiters || (flags & RX_CALL_TQ_WAIT)) {
5395 dpf(("rcall %"AFS_PTR_FMT" has %d waiters and flags %d\n", call, call->tqWaiters, call->flags));
5399 if (!newcall && (flags & RX_CALL_PEER_BUSY)) {
5400 /* The call channel is still busy; resetting the call doesn't change
5401 * that. However, if 'newcall' is set, we are processing a call
5402 * structure that has either been recycled from the free list, or has
5403 * been newly allocated. So, RX_CALL_PEER_BUSY is not relevant if
5404 * 'newcall' is set, since it describes a completely different call
5405 * channel which we do not care about. */
5406 call->flags |= RX_CALL_PEER_BUSY;
5409 rxi_ClearReceiveQueue(call);
5410 /* why init the queue if you just emptied it? queue_Init(&call->rq); */
5414 call->twind = call->conn->twind[call->channel];
5415 call->rwind = call->conn->rwind[call->channel];
5416 call->nSoftAcked = 0;
5417 call->nextCwind = 0;
5420 call->nCwindAcks = 0;
5421 call->nSoftAcks = 0;
5422 call->nHardAcks = 0;
5424 call->tfirst = call->rnext = call->tnext = 1;
5427 call->lastAcked = 0;
5428 call->localStatus = call->remoteStatus = 0;
5430 if (flags & RX_CALL_READER_WAIT) {
5431 #ifdef RX_ENABLE_LOCKS
5432 CV_BROADCAST(&call->cv_rq);
5434 osi_rxWakeup(&call->rq);
5437 if (flags & RX_CALL_WAIT_PACKETS) {
5438 MUTEX_ENTER(&rx_freePktQ_lock);
5439 rxi_PacketsUnWait(); /* XXX */
5440 MUTEX_EXIT(&rx_freePktQ_lock);
5442 #ifdef RX_ENABLE_LOCKS
5443 CV_SIGNAL(&call->cv_twind);
5445 if (flags & RX_CALL_WAIT_WINDOW_ALLOC)
5446 osi_rxWakeup(&call->twind);
5449 if (flags & RX_CALL_WAIT_PROC) {
5450 rx_atomic_dec(&rx_nWaiting);
5452 #ifdef RX_ENABLE_LOCKS
5453 /* The following ensures that we don't mess with any queue while some
5454 * other thread might also be doing so. The call_queue_lock field is
5455 * is only modified under the call lock. If the call is in the process
5456 * of being removed from a queue, the call is not locked until the
5457 * the queue lock is dropped and only then is the call_queue_lock field
5458 * zero'd out. So it's safe to lock the queue if call_queue_lock is set.
5459 * Note that any other routine which removes a call from a queue has to
5460 * obtain the queue lock before examing the queue and removing the call.
5462 if (call->call_queue_lock) {
5463 MUTEX_ENTER(call->call_queue_lock);
5464 if (opr_queue_IsOnQueue(&call->entry)) {
5465 opr_queue_Remove(&call->entry);
5467 MUTEX_EXIT(call->call_queue_lock);
5468 CLEAR_CALL_QUEUE_LOCK(call);
5470 #else /* RX_ENABLE_LOCKS */
5471 if (opr_queue_IsOnQueue(&call->entry)) {
5472 opr_queue_Remove(&call->entry);
5474 #endif /* RX_ENABLE_LOCKS */
5476 rxi_CancelKeepAliveEvent(call);
5477 rxi_CancelDelayedAckEvent(call);
5480 /* Send an acknowledge for the indicated packet (seq,serial) of the
5481 * indicated call, for the indicated reason (reason). This
5482 * acknowledge will specifically acknowledge receiving the packet, and
5483 * will also specify which other packets for this call have been
5484 * received. This routine returns the packet that was used to the
5485 * caller. The caller is responsible for freeing it or re-using it.
5486 * This acknowledgement also returns the highest sequence number
5487 * actually read out by the higher level to the sender; the sender
5488 * promises to keep around packets that have not been read by the
5489 * higher level yet (unless, of course, the sender decides to abort
5490 * the call altogether). Any of p, seq, serial, pflags, or reason may
5491 * be set to zero without ill effect. That is, if they are zero, they
5492 * will not convey any information.
5493 * NOW there is a trailer field, after the ack where it will safely be
5494 * ignored by mundanes, which indicates the maximum size packet this
5495 * host can swallow. */
5497 struct rx_packet *optionalPacket; use to send ack (or null)
5498 int seq; Sequence number of the packet we are acking
5499 int serial; Serial number of the packet
5500 int pflags; Flags field from packet header
5501 int reason; Reason an acknowledge was prompted
5505 rxi_SendAck(struct rx_call *call,
5506 struct rx_packet *optionalPacket, int serial, int reason,
5509 struct rx_ackPacket *ap;
5510 struct rx_packet *p;
5511 struct opr_queue *cursor;
5514 afs_uint32 padbytes = 0;
5515 #ifdef RX_ENABLE_TSFPQ
5516 struct rx_ts_info_t * rx_ts_info;
5520 * Open the receive window once a thread starts reading packets
5522 if (call->rnext > 1) {
5523 call->conn->rwind[call->channel] = call->rwind = rx_maxReceiveWindow;
5526 /* Don't attempt to grow MTU if this is a critical ping */
5527 if (reason == RX_ACK_MTU) {
5528 /* keep track of per-call attempts, if we're over max, do in small
5529 * otherwise in larger? set a size to increment by, decrease
5532 if (call->conn->peer->maxPacketSize &&
5533 (call->conn->peer->maxPacketSize < OLD_MAX_PACKET_SIZE
5535 padbytes = call->conn->peer->maxPacketSize+16;
5537 padbytes = call->conn->peer->maxMTU + 128;
5539 /* do always try a minimum size ping */
5540 padbytes = MAX(padbytes, RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE+4);
5542 /* subtract the ack payload */
5543 padbytes -= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32));
5544 reason = RX_ACK_PING;
5547 call->nHardAcks = 0;
5548 call->nSoftAcks = 0;
5549 if (call->rnext > call->lastAcked)
5550 call->lastAcked = call->rnext;
5554 rx_computelen(p, p->length); /* reset length, you never know */
5555 } /* where that's been... */
5556 #ifdef RX_ENABLE_TSFPQ
5558 RX_TS_INFO_GET(rx_ts_info);
5559 if ((p = rx_ts_info->local_special_packet)) {
5560 rx_computelen(p, p->length);
5561 } else if ((p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5562 rx_ts_info->local_special_packet = p;
5563 } else { /* We won't send the ack, but don't panic. */
5564 return optionalPacket;
5568 else if (!(p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5569 /* We won't send the ack, but don't panic. */
5570 return optionalPacket;
5575 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32) -
5578 if (rxi_AllocDataBuf(p, templ, RX_PACKET_CLASS_SPECIAL) > 0) {
5579 #ifndef RX_ENABLE_TSFPQ
5580 if (!optionalPacket)
5583 return optionalPacket;
5585 templ = rx_AckDataSize(call->rwind) + 2 * sizeof(afs_int32);
5586 if (rx_Contiguous(p) < templ) {
5587 #ifndef RX_ENABLE_TSFPQ
5588 if (!optionalPacket)
5591 return optionalPacket;
5596 /* MTUXXX failing to send an ack is very serious. We should */
5597 /* try as hard as possible to send even a partial ack; it's */
5598 /* better than nothing. */
5599 ap = (struct rx_ackPacket *)rx_DataOf(p);
5600 ap->bufferSpace = htonl(0); /* Something should go here, sometime */
5601 ap->reason = reason;
5603 /* The skew computation used to be bogus, I think it's better now. */
5604 /* We should start paying attention to skew. XXX */
5605 ap->serial = htonl(serial);
5606 ap->maxSkew = 0; /* used to be peer->inPacketSkew */
5609 * First packet not yet forwarded to reader. When ACKALL has been
5610 * sent the peer has been told that all received packets will be
5611 * delivered to the reader. The value 'rnext' is used internally
5612 * to refer to the next packet in the receive queue that must be
5613 * delivered to the reader. From the perspective of the peer it
5614 * already has so report the last sequence number plus one if there
5615 * are packets in the receive queue awaiting processing.
5617 if ((call->flags & RX_CALL_ACKALL_SENT) &&
5618 !opr_queue_IsEmpty(&call->rq)) {
5619 ap->firstPacket = htonl(opr_queue_Last(&call->rq, struct rx_packet, entry)->header.seq + 1);
5621 ap->firstPacket = htonl(call->rnext);
5623 ap->previousPacket = htonl(call->rprev); /* Previous packet received */
5625 /* No fear of running out of ack packet here because there can only
5626 * be at most one window full of unacknowledged packets. The window
5627 * size must be constrained to be less than the maximum ack size,
5628 * of course. Also, an ack should always fit into a single packet
5629 * -- it should not ever be fragmented. */
5631 for (opr_queue_Scan(&call->rq, cursor)) {
5632 struct rx_packet *rqp
5633 = opr_queue_Entry(cursor, struct rx_packet, entry);
5635 if (!rqp || !call->rq.next
5636 || (rqp->header.seq > (call->rnext + call->rwind))) {
5637 #ifndef RX_ENABLE_TSFPQ
5638 if (!optionalPacket)
5641 rxi_CallError(call, RX_CALL_DEAD);
5642 return optionalPacket;
5645 while (rqp->header.seq > call->rnext + offset)
5646 ap->acks[offset++] = RX_ACK_TYPE_NACK;
5647 ap->acks[offset++] = RX_ACK_TYPE_ACK;
5649 if ((offset > (u_char) rx_maxReceiveWindow) || (offset > call->rwind)) {
5650 #ifndef RX_ENABLE_TSFPQ
5651 if (!optionalPacket)
5654 rxi_CallError(call, RX_CALL_DEAD);
5655 return optionalPacket;
5661 p->length = rx_AckDataSize(offset) + 4 * sizeof(afs_int32);
5663 /* these are new for AFS 3.3 */
5664 templ = rxi_AdjustMaxMTU(call->conn->peer->ifMTU, rx_maxReceiveSize);
5665 templ = htonl(templ);
5666 rx_packetwrite(p, rx_AckDataSize(offset), sizeof(afs_int32), &templ);
5667 templ = htonl(call->conn->peer->ifMTU);
5668 rx_packetwrite(p, rx_AckDataSize(offset) + sizeof(afs_int32),
5669 sizeof(afs_int32), &templ);
5671 /* new for AFS 3.4 */
5672 templ = htonl(call->rwind);
5673 rx_packetwrite(p, rx_AckDataSize(offset) + 2 * sizeof(afs_int32),
5674 sizeof(afs_int32), &templ);
5676 /* new for AFS 3.5 */
5677 templ = htonl(call->conn->peer->ifDgramPackets);
5678 rx_packetwrite(p, rx_AckDataSize(offset) + 3 * sizeof(afs_int32),
5679 sizeof(afs_int32), &templ);
5681 p->header.serviceId = call->conn->serviceId;
5682 p->header.cid = (call->conn->cid | call->channel);
5683 p->header.callNumber = *call->callNumber;
5685 p->header.securityIndex = call->conn->securityIndex;
5686 p->header.epoch = call->conn->epoch;
5687 p->header.type = RX_PACKET_TYPE_ACK;
5688 p->header.flags = RX_SLOW_START_OK;
5689 if (reason == RX_ACK_PING) {
5690 p->header.flags |= RX_REQUEST_ACK;
5692 p->length = padbytes +
5693 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32);
5696 /* not fast but we can potentially use this if truncated
5697 * fragments are delivered to figure out the mtu.
5699 rx_packetwrite(p, rx_AckDataSize(offset) + 4 *
5700 sizeof(afs_int32), sizeof(afs_int32),
5704 if (call->conn->type == RX_CLIENT_CONNECTION)
5705 p->header.flags |= RX_CLIENT_INITIATED;
5709 if (rxdebug_active) {
5713 len = _snprintf(msg, sizeof(msg),
5714 "tid[%d] SACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
5715 GetCurrentThreadId(), rx_ack_reason(ap->reason),
5716 ntohl(ap->serial), ntohl(ap->previousPacket),
5717 (unsigned int)p->header.seq, ntohl(ap->firstPacket),
5718 ap->nAcks, ntohs(ap->bufferSpace) );
5722 for (offset = 0; offset < ap->nAcks && len < sizeof(msg); offset++)
5723 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
5727 OutputDebugString(msg);
5729 #else /* AFS_NT40_ENV */
5731 fprintf(rx_Log, "SACK: reason %x previous %u seq %u first %u ",
5732 ap->reason, ntohl(ap->previousPacket),
5733 (unsigned int)p->header.seq, ntohl(ap->firstPacket));
5735 for (offset = 0; offset < ap->nAcks; offset++)
5736 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
5741 #endif /* AFS_NT40_ENV */
5744 int i, nbytes = p->length;
5746 for (i = 1; i < p->niovecs; i++) { /* vec 0 is ALWAYS header */
5747 if (nbytes <= p->wirevec[i].iov_len) {
5750 savelen = p->wirevec[i].iov_len;
5752 p->wirevec[i].iov_len = nbytes;
5754 rxi_Send(call, p, istack);
5755 p->wirevec[i].iov_len = savelen;
5759 nbytes -= p->wirevec[i].iov_len;
5762 if (rx_stats_active)
5763 rx_atomic_inc(&rx_stats.ackPacketsSent);
5764 #ifndef RX_ENABLE_TSFPQ
5765 if (!optionalPacket)
5768 return optionalPacket; /* Return packet for re-use by caller */
5772 struct rx_packet **list;
5777 /* Send all of the packets in the list in single datagram */
5779 rxi_SendList(struct rx_call *call, struct xmitlist *xmit,
5780 int istack, int moreFlag)
5786 struct rx_connection *conn = call->conn;
5787 struct rx_peer *peer = conn->peer;
5789 MUTEX_ENTER(&peer->peer_lock);
5790 peer->nSent += xmit->len;
5791 if (xmit->resending)
5792 peer->reSends += xmit->len;
5793 MUTEX_EXIT(&peer->peer_lock);
5795 if (rx_stats_active) {
5796 if (xmit->resending)
5797 rx_atomic_add(&rx_stats.dataPacketsReSent, xmit->len);
5799 rx_atomic_add(&rx_stats.dataPacketsSent, xmit->len);
5802 clock_GetTime(&now);
5804 if (xmit->list[xmit->len - 1]->header.flags & RX_LAST_PACKET) {
5808 /* Set the packet flags and schedule the resend events */
5809 /* Only request an ack for the last packet in the list */
5810 for (i = 0; i < xmit->len; i++) {
5811 struct rx_packet *packet = xmit->list[i];
5813 /* Record the time sent */
5814 packet->timeSent = now;
5815 packet->flags |= RX_PKTFLAG_SENT;
5817 /* Ask for an ack on retransmitted packets, on every other packet
5818 * if the peer doesn't support slow start. Ask for an ack on every
5819 * packet until the congestion window reaches the ack rate. */
5820 if (packet->header.serial) {
5823 packet->firstSent = now;
5824 if (!lastPacket && (call->cwind <= (u_short) (conn->ackRate + 1)
5825 || (!(call->flags & RX_CALL_SLOW_START_OK)
5826 && (packet->header.seq & 1)))) {
5831 /* Tag this packet as not being the last in this group,
5832 * for the receiver's benefit */
5833 if (i < xmit->len - 1 || moreFlag) {
5834 packet->header.flags |= RX_MORE_PACKETS;
5839 xmit->list[xmit->len - 1]->header.flags |= RX_REQUEST_ACK;
5842 /* Since we're about to send a data packet to the peer, it's
5843 * safe to nuke any scheduled end-of-packets ack */
5844 rxi_CancelDelayedAckEvent(call);
5846 MUTEX_EXIT(&call->lock);
5847 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5848 if (xmit->len > 1) {
5849 rxi_SendPacketList(call, conn, xmit->list, xmit->len, istack);
5851 rxi_SendPacket(call, conn, xmit->list[0], istack);
5853 MUTEX_ENTER(&call->lock);
5854 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5856 /* Tell the RTO calculation engine that we have sent a packet, and
5857 * if it was the last one */
5858 rxi_rto_packet_sent(call, lastPacket, istack);
5860 /* Update last send time for this call (for keep-alive
5861 * processing), and for the connection (so that we can discover
5862 * idle connections) */
5863 conn->lastSendTime = call->lastSendTime = clock_Sec();
5864 /* Let a set of retransmits trigger an idle timeout */
5865 if (!xmit->resending)
5866 call->lastSendData = call->lastSendTime;
5869 /* When sending packets we need to follow these rules:
5870 * 1. Never send more than maxDgramPackets in a jumbogram.
5871 * 2. Never send a packet with more than two iovecs in a jumbogram.
5872 * 3. Never send a retransmitted packet in a jumbogram.
5873 * 4. Never send more than cwind/4 packets in a jumbogram
5874 * We always keep the last list we should have sent so we
5875 * can set the RX_MORE_PACKETS flags correctly.
5879 rxi_SendXmitList(struct rx_call *call, struct rx_packet **list, int len,
5884 struct xmitlist working;
5885 struct xmitlist last;
5887 struct rx_peer *peer = call->conn->peer;
5888 int morePackets = 0;
5890 memset(&last, 0, sizeof(struct xmitlist));
5891 working.list = &list[0];
5893 working.resending = 0;
5895 recovery = call->flags & RX_CALL_FAST_RECOVER;
5897 for (i = 0; i < len; i++) {
5898 /* Does the current packet force us to flush the current list? */
5900 && (list[i]->header.serial || (list[i]->flags & RX_PKTFLAG_ACKED)
5901 || list[i]->length > RX_JUMBOBUFFERSIZE)) {
5903 /* This sends the 'last' list and then rolls the current working
5904 * set into the 'last' one, and resets the working set */
5907 rxi_SendList(call, &last, istack, 1);
5908 /* If the call enters an error state stop sending, or if
5909 * we entered congestion recovery mode, stop sending */
5911 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5916 working.resending = 0;
5917 working.list = &list[i];
5919 /* Add the current packet to the list if it hasn't been acked.
5920 * Otherwise adjust the list pointer to skip the current packet. */
5921 if (!(list[i]->flags & RX_PKTFLAG_ACKED)) {
5924 if (list[i]->header.serial)
5925 working.resending = 1;
5927 /* Do we need to flush the list? */
5928 if (working.len >= (int)peer->maxDgramPackets
5929 || working.len >= (int)call->nDgramPackets
5930 || working.len >= (int)call->cwind
5931 || list[i]->header.serial
5932 || list[i]->length != RX_JUMBOBUFFERSIZE) {
5934 rxi_SendList(call, &last, istack, 1);
5935 /* If the call enters an error state stop sending, or if
5936 * we entered congestion recovery mode, stop sending */
5938 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5943 working.resending = 0;
5944 working.list = &list[i + 1];
5947 if (working.len != 0) {
5948 osi_Panic("rxi_SendList error");
5950 working.list = &list[i + 1];
5954 /* Send the whole list when the call is in receive mode, when
5955 * the call is in eof mode, when we are in fast recovery mode,
5956 * and when we have the last packet */
5957 /* XXX - The accesses to app.mode aren't safe, as this may be called by
5958 * the listener or event threads
5960 if ((list[len - 1]->header.flags & RX_LAST_PACKET)
5961 || (call->flags & RX_CALL_FLUSH)
5962 || (call->flags & RX_CALL_FAST_RECOVER)) {
5963 /* Check for the case where the current list contains
5964 * an acked packet. Since we always send retransmissions
5965 * in a separate packet, we only need to check the first
5966 * packet in the list */
5967 if (working.len > 0 && !(working.list[0]->flags & RX_PKTFLAG_ACKED)) {
5971 rxi_SendList(call, &last, istack, morePackets);
5972 /* If the call enters an error state stop sending, or if
5973 * we entered congestion recovery mode, stop sending */
5975 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5979 rxi_SendList(call, &working, istack, 0);
5981 } else if (last.len > 0) {
5982 rxi_SendList(call, &last, istack, 0);
5983 /* Packets which are in 'working' are not sent by this call */
5988 * Check if the peer for the given call is known to be dead
5990 * If the call's peer appears dead (it has encountered fatal network errors
5991 * since the call started) the call is killed with RX_CALL_DEAD if the call
5992 * is active. Otherwise, we do nothing.
5994 * @param[in] call The call to check
5997 * @retval 0 The call is fine, and we haven't done anything to the call
5998 * @retval nonzero The call's peer appears dead, and the call has been
5999 * terminated if it was active
6001 * @pre call->lock must be locked
6004 rxi_CheckPeerDead(struct rx_call *call)
6006 #ifdef AFS_RXERRQ_ENV
6009 if (call->state == RX_STATE_DALLY) {
6013 peererrs = rx_atomic_read(&call->conn->peer->neterrs);
6014 if (call->neterr_gen < peererrs) {
6015 /* we have received network errors since this call started; kill
6017 if (call->state == RX_STATE_ACTIVE) {
6018 rxi_CallError(call, RX_CALL_DEAD);
6022 if (call->neterr_gen > peererrs) {
6023 /* someone has reset the number of peer errors; set the call error gen
6024 * so we can detect if more errors are encountered */
6025 call->neterr_gen = peererrs;
6032 rxi_Resend(struct rxevent *event, void *arg0, void *arg1, int istack)
6034 struct rx_call *call = arg0;
6035 struct rx_peer *peer;
6036 struct opr_queue *cursor;
6037 struct clock maxTimeout = { 60, 0 };
6039 MUTEX_ENTER(&call->lock);
6041 peer = call->conn->peer;
6043 /* Make sure that the event pointer is removed from the call
6044 * structure, since there is no longer a per-call retransmission
6046 if (event == call->resendEvent) {
6047 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
6048 rxevent_Put(&call->resendEvent);
6051 rxi_CheckPeerDead(call);
6053 if (rxi_busyChannelError && (call->flags & RX_CALL_PEER_BUSY)) {
6054 rxi_CheckBusy(call);
6057 if (opr_queue_IsEmpty(&call->tq)) {
6058 /* Nothing to do. This means that we've been raced, and that an
6059 * ACK has come in between when we were triggered, and when we
6060 * actually got to run. */
6064 /* We're in loss recovery */
6065 call->flags |= RX_CALL_FAST_RECOVER;
6067 /* Mark all of the pending packets in the queue as being lost */
6068 for (opr_queue_Scan(&call->tq, cursor)) {
6069 struct rx_packet *p = opr_queue_Entry(cursor, struct rx_packet, entry);
6070 if (!(p->flags & RX_PKTFLAG_ACKED))
6071 p->flags &= ~RX_PKTFLAG_SENT;
6074 /* We're resending, so we double the timeout of the call. This will be
6075 * dropped back down by the first successful ACK that we receive.
6077 * We apply a maximum value here of 60 seconds
6079 clock_Add(&call->rto, &call->rto);
6080 if (clock_Gt(&call->rto, &maxTimeout))
6081 call->rto = maxTimeout;
6083 /* Packet loss is most likely due to congestion, so drop our window size
6084 * and start again from the beginning */
6085 if (peer->maxDgramPackets >1) {
6086 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
6087 call->MTU = MIN(peer->natMTU, peer->maxMTU);
6089 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
6090 call->nDgramPackets = 1;
6092 call->nextCwind = 1;
6095 MUTEX_ENTER(&peer->peer_lock);
6096 peer->MTU = call->MTU;
6097 peer->cwind = call->cwind;
6098 peer->nDgramPackets = 1;
6100 call->congestSeq = peer->congestSeq;
6101 MUTEX_EXIT(&peer->peer_lock);
6103 rxi_Start(call, istack);
6106 MUTEX_EXIT(&call->lock);
6109 /* This routine is called when new packets are readied for
6110 * transmission and when retransmission may be necessary, or when the
6111 * transmission window or burst count are favourable. This should be
6112 * better optimized for new packets, the usual case, now that we've
6113 * got rid of queues of send packets. XXXXXXXXXXX */
6115 rxi_Start(struct rx_call *call, int istack)
6117 struct opr_queue *cursor;
6118 #ifdef RX_ENABLE_LOCKS
6119 struct opr_queue *store;
6125 #ifdef RX_ENABLE_LOCKS
6126 if (rx_stats_active)
6127 rx_atomic_inc(&rx_tq_debug.rxi_start_in_error);
6132 if (!opr_queue_IsEmpty(&call->tq)) { /* If we have anything to send */
6133 /* Send (or resend) any packets that need it, subject to
6134 * window restrictions and congestion burst control
6135 * restrictions. Ask for an ack on the last packet sent in
6136 * this burst. For now, we're relying upon the window being
6137 * considerably bigger than the largest number of packets that
6138 * are typically sent at once by one initial call to
6139 * rxi_Start. This is probably bogus (perhaps we should ask
6140 * for an ack when we're half way through the current
6141 * window?). Also, for non file transfer applications, this
6142 * may end up asking for an ack for every packet. Bogus. XXXX
6145 * But check whether we're here recursively, and let the other guy
6148 #ifdef RX_ENABLE_LOCKS
6149 if (!(call->flags & RX_CALL_TQ_BUSY)) {
6150 call->flags |= RX_CALL_TQ_BUSY;
6152 #endif /* RX_ENABLE_LOCKS */
6154 #ifdef RX_ENABLE_LOCKS
6155 call->flags &= ~RX_CALL_NEED_START;
6156 #endif /* RX_ENABLE_LOCKS */
6158 maxXmitPackets = MIN(call->twind, call->cwind);
6159 for (opr_queue_Scan(&call->tq, cursor)) {
6161 = opr_queue_Entry(cursor, struct rx_packet, entry);
6163 if (p->flags & RX_PKTFLAG_ACKED) {
6164 /* Since we may block, don't trust this */
6165 if (rx_stats_active)
6166 rx_atomic_inc(&rx_stats.ignoreAckedPacket);
6167 continue; /* Ignore this packet if it has been acknowledged */
6170 /* Turn off all flags except these ones, which are the same
6171 * on each transmission */
6172 p->header.flags &= RX_PRESET_FLAGS;
6174 if (p->header.seq >=
6175 call->tfirst + MIN((int)call->twind,
6176 (int)(call->nSoftAcked +
6178 call->flags |= RX_CALL_WAIT_WINDOW_SEND; /* Wait for transmit window */
6179 /* Note: if we're waiting for more window space, we can
6180 * still send retransmits; hence we don't return here, but
6181 * break out to schedule a retransmit event */
6182 dpf(("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n",
6183 *(call->callNumber), p->header.seq, call->twind, call->nSoftAcked,
6188 /* Transmit the packet if it needs to be sent. */
6189 if (!(p->flags & RX_PKTFLAG_SENT)) {
6190 if (nXmitPackets == maxXmitPackets) {
6191 rxi_SendXmitList(call, call->xmitList,
6192 nXmitPackets, istack);
6195 dpf(("call %d xmit packet %"AFS_PTR_FMT"\n",
6196 *(call->callNumber), p));
6197 call->xmitList[nXmitPackets++] = p;
6199 } /* end of the queue_Scan */
6201 /* xmitList now hold pointers to all of the packets that are
6202 * ready to send. Now we loop to send the packets */
6203 if (nXmitPackets > 0) {
6204 rxi_SendXmitList(call, call->xmitList, nXmitPackets,
6208 #ifdef RX_ENABLE_LOCKS
6210 /* We went into the error state while sending packets. Now is
6211 * the time to reset the call. This will also inform the using
6212 * process that the call is in an error state.
6214 if (rx_stats_active)
6215 rx_atomic_inc(&rx_tq_debug.rxi_start_aborted);
6216 call->flags &= ~RX_CALL_TQ_BUSY;
6217 rxi_WakeUpTransmitQueue(call);
6218 rxi_CallError(call, call->error);
6222 if (call->flags & RX_CALL_TQ_SOME_ACKED) {
6224 call->flags &= ~RX_CALL_TQ_SOME_ACKED;
6225 /* Some packets have received acks. If they all have, we can clear
6226 * the transmit queue.
6229 for (opr_queue_ScanSafe(&call->tq, cursor, store)) {
6231 = opr_queue_Entry(cursor, struct rx_packet, entry);
6233 if (p->header.seq < call->tfirst
6234 && (p->flags & RX_PKTFLAG_ACKED)) {
6235 opr_queue_Remove(&p->entry);
6236 #ifdef RX_TRACK_PACKETS
6237 p->flags &= ~RX_PKTFLAG_TQ;
6239 #ifdef RXDEBUG_PACKET
6247 call->flags |= RX_CALL_TQ_CLEARME;
6249 if (call->flags & RX_CALL_TQ_CLEARME)
6250 rxi_ClearTransmitQueue(call, 1);
6251 } while (call->flags & RX_CALL_NEED_START);
6253 * TQ references no longer protected by this flag; they must remain
6254 * protected by the call lock.
6256 call->flags &= ~RX_CALL_TQ_BUSY;
6257 rxi_WakeUpTransmitQueue(call);
6259 call->flags |= RX_CALL_NEED_START;
6261 #endif /* RX_ENABLE_LOCKS */
6263 rxi_rto_cancel(call);
6267 /* Also adjusts the keep alive parameters for the call, to reflect
6268 * that we have just sent a packet (so keep alives aren't sent
6271 rxi_Send(struct rx_call *call, struct rx_packet *p,
6274 struct rx_connection *conn = call->conn;
6276 /* Stamp each packet with the user supplied status */
6277 p->header.userStatus = call->localStatus;
6279 /* Allow the security object controlling this call's security to
6280 * make any last-minute changes to the packet */
6281 RXS_SendPacket(conn->securityObject, call, p);
6283 /* Since we're about to send SOME sort of packet to the peer, it's
6284 * safe to nuke any scheduled end-of-packets ack */
6285 rxi_CancelDelayedAckEvent(call);
6287 /* Actually send the packet, filling in more connection-specific fields */
6288 MUTEX_EXIT(&call->lock);
6289 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
6290 rxi_SendPacket(call, conn, p, istack);
6291 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
6292 MUTEX_ENTER(&call->lock);
6294 /* Update last send time for this call (for keep-alive
6295 * processing), and for the connection (so that we can discover
6296 * idle connections) */
6297 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6298 (((struct rx_ackPacket *)rx_DataOf(p))->reason == RX_ACK_PING) ||
6299 (p->length <= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32))))
6301 conn->lastSendTime = call->lastSendTime = clock_Sec();
6302 /* Don't count keepalive ping/acks here, so idleness can be tracked. */
6303 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6304 ((((struct rx_ackPacket *)rx_DataOf(p))->reason != RX_ACK_PING) &&
6305 (((struct rx_ackPacket *)rx_DataOf(p))->reason !=
6306 RX_ACK_PING_RESPONSE)))
6307 call->lastSendData = call->lastSendTime;
6311 /* Check if a call needs to be destroyed. Called by keep-alive code to ensure
6312 * that things are fine. Also called periodically to guarantee that nothing
6313 * falls through the cracks (e.g. (error + dally) connections have keepalive
6314 * turned off. Returns 0 if conn is well, -1 otherwise. If otherwise, call
6316 * haveCTLock Set if calling from rxi_ReapConnections
6319 rxi_CheckCall(struct rx_call *call, int haveCTLock)
6321 struct rx_connection *conn = call->conn;
6323 afs_uint32 deadTime, idleDeadTime = 0, hardDeadTime = 0;
6324 afs_uint32 fudgeFactor;
6327 int idle_timeout = 0;
6328 afs_int32 clock_diff = 0;
6330 if (rxi_CheckPeerDead(call)) {
6336 /* Large swings in the clock can have a significant impact on
6337 * the performance of RX call processing. Forward clock shifts
6338 * will result in premature event triggering or timeouts.
6339 * Backward shifts can result in calls not completing until
6340 * the clock catches up with the original start clock value.
6342 * If a backward clock shift of more than five minutes is noticed,
6343 * just fail the call.
6345 if (now < call->lastSendTime)
6346 clock_diff = call->lastSendTime - now;
6347 if (now < call->startWait)
6348 clock_diff = MAX(clock_diff, call->startWait - now);
6349 if (now < call->lastReceiveTime)
6350 clock_diff = MAX(clock_diff, call->lastReceiveTime - now);
6351 if (clock_diff > 5 * 60)
6353 if (call->state == RX_STATE_ACTIVE)
6354 rxi_CallError(call, RX_CALL_TIMEOUT);
6358 #ifdef RX_ENABLE_LOCKS
6359 if (call->flags & RX_CALL_TQ_BUSY) {
6360 /* Call is active and will be reset by rxi_Start if it's
6361 * in an error state.
6366 /* RTT + 8*MDEV, rounded up to the next second. */
6367 fudgeFactor = (((afs_uint32) call->rtt >> 3) +
6368 ((afs_uint32) call->rtt_dev << 1) + 1023) >> 10;
6370 deadTime = conn->secondsUntilDead + fudgeFactor;
6371 /* These are computed to the second (+- 1 second). But that's
6372 * good enough for these values, which should be a significant
6373 * number of seconds. */
6374 if (now > (call->lastReceiveTime + deadTime)) {
6375 if (call->state == RX_STATE_ACTIVE) {
6376 #ifdef AFS_ADAPT_PMTU
6377 # if defined(KERNEL) && defined(AFS_SUN5_ENV)
6379 # if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
6380 netstack_t *ns = netstack_find_by_stackid(GLOBAL_NETSTACKID);
6381 ip_stack_t *ipst = ns->netstack_ip;
6383 ire = ire_cache_lookup(conn->peer->host
6384 # if defined(AFS_SUN510_ENV) && defined(ALL_ZONES)
6386 # if defined(ICL_3_ARG) || defined(GLOBAL_NETSTACKID)
6388 # if defined(GLOBAL_NETSTACKID)
6395 if (ire && ire->ire_max_frag > 0)
6396 rxi_SetPeerMtu(NULL, conn->peer->host, 0,
6398 # if defined(GLOBAL_NETSTACKID)
6402 #endif /* AFS_ADAPT_PMTU */
6403 cerror = RX_CALL_DEAD;
6406 #ifdef RX_ENABLE_LOCKS
6407 /* Cancel pending events */
6408 rxi_CancelDelayedAckEvent(call);
6409 rxi_rto_cancel(call);
6410 rxi_CancelKeepAliveEvent(call);
6411 rxi_CancelGrowMTUEvent(call);
6412 MUTEX_ENTER(&rx_refcnt_mutex);
6413 /* if rxi_FreeCall returns 1 it has freed the call */
6414 if (call->refCount == 0 &&
6415 rxi_FreeCall(call, haveCTLock))
6417 MUTEX_EXIT(&rx_refcnt_mutex);
6420 MUTEX_EXIT(&rx_refcnt_mutex);
6422 #else /* RX_ENABLE_LOCKS */
6423 rxi_FreeCall(call, 0);
6425 #endif /* RX_ENABLE_LOCKS */
6427 /* Non-active calls are destroyed if they are not responding
6428 * to pings; active calls are simply flagged in error, so the
6429 * attached process can die reasonably gracefully. */
6432 if (conn->idleDeadDetection) {
6433 if (conn->idleDeadTime) {
6434 idleDeadTime = conn->idleDeadTime + fudgeFactor;
6438 /* see if we have a non-activity timeout */
6439 if (call->startWait && ((call->startWait + idleDeadTime) < now) &&
6440 (call->flags & RX_CALL_READER_WAIT)) {
6441 if (call->state == RX_STATE_ACTIVE) {
6442 cerror = RX_CALL_TIMEOUT;
6447 if (call->lastSendData && ((call->lastSendData + idleDeadTime) < now)) {
6448 if (call->state == RX_STATE_ACTIVE) {
6449 cerror = conn->service ? conn->service->idleDeadErr : RX_CALL_IDLE;
6457 if (conn->hardDeadTime) {
6458 hardDeadTime = conn->hardDeadTime + fudgeFactor;
6461 /* see if we have a hard timeout */
6463 && (now > (hardDeadTime + call->startTime.sec))) {
6464 if (call->state == RX_STATE_ACTIVE)
6465 rxi_CallError(call, RX_CALL_TIMEOUT);
6470 if (conn->msgsizeRetryErr && cerror != RX_CALL_TIMEOUT && !idle_timeout &&
6471 call->lastReceiveTime) {
6472 int oldMTU = conn->peer->ifMTU;
6474 /* if we thought we could send more, perhaps things got worse */
6475 if (conn->peer->maxPacketSize > conn->lastPacketSize)
6476 /* maxpacketsize will be cleared in rxi_SetPeerMtu */
6477 newmtu = MAX(conn->peer->maxPacketSize-RX_IPUDP_SIZE,
6478 conn->lastPacketSize-(128+RX_IPUDP_SIZE));
6480 newmtu = conn->lastPacketSize-(128+RX_IPUDP_SIZE);
6482 /* minimum capped in SetPeerMtu */
6483 rxi_SetPeerMtu(conn->peer, 0, 0, newmtu);
6486 conn->lastPacketSize = 0;
6488 /* needed so ResetCall doesn't clobber us. */
6489 call->MTU = conn->peer->ifMTU;
6491 /* if we never succeeded, let the error pass out as-is */
6492 if (conn->peer->maxPacketSize && oldMTU != conn->peer->ifMTU)
6493 cerror = conn->msgsizeRetryErr;
6496 rxi_CallError(call, cerror);
6501 rxi_NatKeepAliveEvent(struct rxevent *event, void *arg1,
6502 void *dummy, int dummy2)
6504 struct rx_connection *conn = arg1;
6505 struct rx_header theader;
6506 char tbuffer[1 + sizeof(struct rx_header)];
6507 struct sockaddr_in taddr;
6510 struct iovec tmpiov[2];
6513 RX_CLIENT_CONNECTION ? rx_socket : conn->service->socket);
6516 tp = &tbuffer[sizeof(struct rx_header)];
6517 taddr.sin_family = AF_INET;
6518 taddr.sin_port = rx_PortOf(rx_PeerOf(conn));
6519 taddr.sin_addr.s_addr = rx_HostOf(rx_PeerOf(conn));
6520 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
6521 taddr.sin_len = sizeof(struct sockaddr_in);
6523 memset(&theader, 0, sizeof(theader));
6524 theader.epoch = htonl(999);
6526 theader.callNumber = 0;
6529 theader.type = RX_PACKET_TYPE_VERSION;
6530 theader.flags = RX_LAST_PACKET;
6531 theader.serviceId = 0;
6533 memcpy(tbuffer, &theader, sizeof(theader));
6534 memcpy(tp, &a, sizeof(a));
6535 tmpiov[0].iov_base = tbuffer;
6536 tmpiov[0].iov_len = 1 + sizeof(struct rx_header);
6538 osi_NetSend(socket, &taddr, tmpiov, 1, 1 + sizeof(struct rx_header), 1);
6540 MUTEX_ENTER(&conn->conn_data_lock);
6541 MUTEX_ENTER(&rx_refcnt_mutex);
6542 /* Only reschedule ourselves if the connection would not be destroyed */
6543 if (conn->refCount <= 1) {
6544 rxevent_Put(&conn->natKeepAliveEvent);
6545 MUTEX_EXIT(&rx_refcnt_mutex);
6546 MUTEX_EXIT(&conn->conn_data_lock);
6547 rx_DestroyConnection(conn); /* drop the reference for this */
6549 conn->refCount--; /* drop the reference for this */
6550 MUTEX_EXIT(&rx_refcnt_mutex);
6551 rxevent_Put(&conn->natKeepAliveEvent);
6552 rxi_ScheduleNatKeepAliveEvent(conn);
6553 MUTEX_EXIT(&conn->conn_data_lock);
6558 rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn)
6560 if (!conn->natKeepAliveEvent && conn->secondsUntilNatPing) {
6561 struct clock when, now;
6562 clock_GetTime(&now);
6564 when.sec += conn->secondsUntilNatPing;
6565 MUTEX_ENTER(&rx_refcnt_mutex);
6566 conn->refCount++; /* hold a reference for this */
6567 MUTEX_EXIT(&rx_refcnt_mutex);
6568 conn->natKeepAliveEvent =
6569 rxevent_Post(&when, &now, rxi_NatKeepAliveEvent, conn, NULL, 0);
6574 rx_SetConnSecondsUntilNatPing(struct rx_connection *conn, afs_int32 seconds)
6576 MUTEX_ENTER(&conn->conn_data_lock);
6577 conn->secondsUntilNatPing = seconds;
6579 if (!(conn->flags & RX_CONN_ATTACHWAIT))
6580 rxi_ScheduleNatKeepAliveEvent(conn);
6582 conn->flags |= RX_CONN_NAT_PING;
6584 MUTEX_EXIT(&conn->conn_data_lock);
6587 /* When a call is in progress, this routine is called occasionally to
6588 * make sure that some traffic has arrived (or been sent to) the peer.
6589 * If nothing has arrived in a reasonable amount of time, the call is
6590 * declared dead; if nothing has been sent for a while, we send a
6591 * keep-alive packet (if we're actually trying to keep the call alive)
6594 rxi_KeepAliveEvent(struct rxevent *event, void *arg1, void *dummy,
6597 struct rx_call *call = arg1;
6598 struct rx_connection *conn;
6601 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6602 MUTEX_ENTER(&call->lock);
6604 if (event == call->keepAliveEvent)
6605 rxevent_Put(&call->keepAliveEvent);
6609 if (rxi_CheckCall(call, 0)) {
6610 MUTEX_EXIT(&call->lock);
6614 /* Don't try to keep alive dallying calls */
6615 if (call->state == RX_STATE_DALLY) {
6616 MUTEX_EXIT(&call->lock);
6621 if ((now - call->lastSendTime) > conn->secondsUntilPing) {
6622 /* Don't try to send keepalives if there is unacknowledged data */
6623 /* the rexmit code should be good enough, this little hack
6624 * doesn't quite work XXX */
6625 (void)rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
6627 rxi_ScheduleKeepAliveEvent(call);
6628 MUTEX_EXIT(&call->lock);
6631 /* Does what's on the nameplate. */
6633 rxi_GrowMTUEvent(struct rxevent *event, void *arg1, void *dummy, int dummy2)
6635 struct rx_call *call = arg1;
6636 struct rx_connection *conn;
6638 CALL_RELE(call, RX_CALL_REFCOUNT_MTU);
6639 MUTEX_ENTER(&call->lock);
6641 if (event == call->growMTUEvent)
6642 rxevent_Put(&call->growMTUEvent);
6644 if (rxi_CheckCall(call, 0)) {
6645 MUTEX_EXIT(&call->lock);
6649 /* Don't bother with dallying calls */
6650 if (call->state == RX_STATE_DALLY) {
6651 MUTEX_EXIT(&call->lock);
6658 * keep being scheduled, just don't do anything if we're at peak,
6659 * or we're not set up to be properly handled (idle timeout required)
6661 if ((conn->peer->maxPacketSize != 0) &&
6662 (conn->peer->natMTU < RX_MAX_PACKET_SIZE) &&
6663 conn->idleDeadDetection)
6664 (void)rxi_SendAck(call, NULL, 0, RX_ACK_MTU, 0);
6665 rxi_ScheduleGrowMTUEvent(call, 0);
6666 MUTEX_EXIT(&call->lock);
6670 rxi_ScheduleKeepAliveEvent(struct rx_call *call)
6672 if (!call->keepAliveEvent) {
6673 struct clock when, now;
6674 clock_GetTime(&now);
6676 when.sec += call->conn->secondsUntilPing;
6677 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6678 call->keepAliveEvent =
6679 rxevent_Post(&when, &now, rxi_KeepAliveEvent, call, NULL, 0);
6684 rxi_CancelKeepAliveEvent(struct rx_call *call) {
6685 if (call->keepAliveEvent) {
6686 rxevent_Cancel(&call->keepAliveEvent);
6687 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6692 rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs)
6694 if (!call->growMTUEvent) {
6695 struct clock when, now;
6697 clock_GetTime(&now);
6700 if (call->conn->secondsUntilPing)
6701 secs = (6*call->conn->secondsUntilPing)-1;
6703 if (call->conn->secondsUntilDead)
6704 secs = MIN(secs, (call->conn->secondsUntilDead-1));
6708 CALL_HOLD(call, RX_CALL_REFCOUNT_MTU);
6709 call->growMTUEvent =
6710 rxevent_Post(&when, &now, rxi_GrowMTUEvent, call, NULL, 0);
6715 rxi_CancelGrowMTUEvent(struct rx_call *call)
6717 if (call->growMTUEvent) {
6718 rxevent_Cancel(&call->growMTUEvent);
6719 CALL_RELE(call, RX_CALL_REFCOUNT_MTU);
6724 rxi_KeepAliveOn(struct rx_call *call)
6726 /* Pretend last packet received was received now--i.e. if another
6727 * packet isn't received within the keep alive time, then the call
6728 * will die; Initialize last send time to the current time--even
6729 * if a packet hasn't been sent yet. This will guarantee that a
6730 * keep-alive is sent within the ping time */
6731 call->lastReceiveTime = call->lastSendTime = clock_Sec();
6732 rxi_ScheduleKeepAliveEvent(call);
6736 rx_KeepAliveOff(struct rx_call *call)
6738 MUTEX_ENTER(&call->lock);
6739 rxi_CancelKeepAliveEvent(call);
6740 MUTEX_EXIT(&call->lock);
6744 rx_KeepAliveOn(struct rx_call *call)
6746 MUTEX_ENTER(&call->lock);
6747 rxi_KeepAliveOn(call);
6748 MUTEX_EXIT(&call->lock);
6752 rxi_GrowMTUOn(struct rx_call *call)
6754 struct rx_connection *conn = call->conn;
6755 MUTEX_ENTER(&conn->conn_data_lock);
6756 conn->lastPingSizeSer = conn->lastPingSize = 0;
6757 MUTEX_EXIT(&conn->conn_data_lock);
6758 rxi_ScheduleGrowMTUEvent(call, 1);
6761 /* This routine is called to send connection abort messages
6762 * that have been delayed to throttle looping clients. */
6764 rxi_SendDelayedConnAbort(struct rxevent *event, void *arg1, void *unused,
6767 struct rx_connection *conn = arg1;
6770 struct rx_packet *packet;
6772 MUTEX_ENTER(&conn->conn_data_lock);
6773 rxevent_Put(&conn->delayedAbortEvent);
6774 error = htonl(conn->error);
6776 MUTEX_EXIT(&conn->conn_data_lock);
6777 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6780 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6781 RX_PACKET_TYPE_ABORT, (char *)&error,
6783 rxi_FreePacket(packet);
6787 /* This routine is called to send call abort messages
6788 * that have been delayed to throttle looping clients. */
6790 rxi_SendDelayedCallAbort(struct rxevent *event, void *arg1, void *dummy,
6793 struct rx_call *call = arg1;
6796 struct rx_packet *packet;
6798 MUTEX_ENTER(&call->lock);
6799 rxevent_Put(&call->delayedAbortEvent);
6800 error = htonl(call->error);
6802 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6805 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
6806 (char *)&error, sizeof(error), 0);
6807 rxi_FreePacket(packet);
6809 MUTEX_EXIT(&call->lock);
6810 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
6813 /* This routine is called periodically (every RX_AUTH_REQUEST_TIMEOUT
6814 * seconds) to ask the client to authenticate itself. The routine
6815 * issues a challenge to the client, which is obtained from the
6816 * security object associated with the connection */
6818 rxi_ChallengeEvent(struct rxevent *event,
6819 void *arg0, void *arg1, int tries)
6821 struct rx_connection *conn = arg0;
6824 rxevent_Put(&conn->challengeEvent);
6826 /* If there are no active calls it is not worth re-issuing the
6827 * challenge. If the client issues another call on this connection
6828 * the challenge can be requested at that time.
6830 if (!rxi_HasActiveCalls(conn))
6833 if (RXS_CheckAuthentication(conn->securityObject, conn) != 0) {
6834 struct rx_packet *packet;
6835 struct clock when, now;
6838 /* We've failed to authenticate for too long.
6839 * Reset any calls waiting for authentication;
6840 * they are all in RX_STATE_PRECALL.
6844 MUTEX_ENTER(&conn->conn_call_lock);
6845 for (i = 0; i < RX_MAXCALLS; i++) {
6846 struct rx_call *call = conn->call[i];
6848 MUTEX_ENTER(&call->lock);
6849 if (call->state == RX_STATE_PRECALL) {
6850 rxi_CallError(call, RX_CALL_DEAD);
6851 rxi_SendCallAbort(call, NULL, 0, 0);
6853 MUTEX_EXIT(&call->lock);
6856 MUTEX_EXIT(&conn->conn_call_lock);
6860 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6862 /* If there's no packet available, do this later. */
6863 RXS_GetChallenge(conn->securityObject, conn, packet);
6864 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6865 RX_PACKET_TYPE_CHALLENGE, NULL, -1, 0);
6866 rxi_FreePacket(packet);
6868 clock_GetTime(&now);
6870 when.sec += RX_CHALLENGE_TIMEOUT;
6871 conn->challengeEvent =
6872 rxevent_Post(&when, &now, rxi_ChallengeEvent, conn, 0,
6877 /* Call this routine to start requesting the client to authenticate
6878 * itself. This will continue until authentication is established,
6879 * the call times out, or an invalid response is returned. The
6880 * security object associated with the connection is asked to create
6881 * the challenge at this time. N.B. rxi_ChallengeOff is a macro,
6882 * defined earlier. */
6884 rxi_ChallengeOn(struct rx_connection *conn)
6886 if (!conn->challengeEvent) {
6887 RXS_CreateChallenge(conn->securityObject, conn);
6888 rxi_ChallengeEvent(NULL, conn, 0, RX_CHALLENGE_MAXTRIES);
6893 /* rxi_ComputeRoundTripTime is called with peer locked. */
6894 /* peer may be null */
6896 rxi_ComputeRoundTripTime(struct rx_packet *p,
6897 struct rx_ackPacket *ack,
6898 struct rx_call *call,
6899 struct rx_peer *peer,
6902 struct clock thisRtt, *sentp;
6906 /* If the ACK is delayed, then do nothing */
6907 if (ack->reason == RX_ACK_DELAY)
6910 /* On the wire, jumbograms are a single UDP packet. We shouldn't count
6911 * their RTT multiple times, so only include the RTT of the last packet
6913 if (p->flags & RX_JUMBO_PACKET)
6916 /* Use the serial number to determine which transmission the ACK is for,
6917 * and set the sent time to match this. If we have no serial number, then
6918 * only use the ACK for RTT calculations if the packet has not been
6922 serial = ntohl(ack->serial);
6924 if (serial == p->header.serial) {
6925 sentp = &p->timeSent;
6926 } else if (serial == p->firstSerial) {
6927 sentp = &p->firstSent;
6928 } else if (clock_Eq(&p->timeSent, &p->firstSent)) {
6929 sentp = &p->firstSent;
6933 if (clock_Eq(&p->timeSent, &p->firstSent)) {
6934 sentp = &p->firstSent;
6941 if (clock_Lt(&thisRtt, sentp))
6942 return; /* somebody set the clock back, don't count this time. */
6944 clock_Sub(&thisRtt, sentp);
6945 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rttp=%d.%06d sec)\n",
6946 p->header.callNumber, p, thisRtt.sec, thisRtt.usec));
6948 if (clock_IsZero(&thisRtt)) {
6950 * The actual round trip time is shorter than the
6951 * clock_GetTime resolution. It is most likely 1ms or 100ns.
6952 * Since we can't tell which at the moment we will assume 1ms.
6954 thisRtt.usec = 1000;
6957 if (rx_stats_active) {
6958 MUTEX_ENTER(&rx_stats_mutex);
6959 if (clock_Lt(&thisRtt, &rx_stats.minRtt))
6960 rx_stats.minRtt = thisRtt;
6961 if (clock_Gt(&thisRtt, &rx_stats.maxRtt)) {
6962 if (thisRtt.sec > 60) {
6963 MUTEX_EXIT(&rx_stats_mutex);
6964 return; /* somebody set the clock ahead */
6966 rx_stats.maxRtt = thisRtt;
6968 clock_Add(&rx_stats.totalRtt, &thisRtt);
6969 rx_atomic_inc(&rx_stats.nRttSamples);
6970 MUTEX_EXIT(&rx_stats_mutex);
6973 /* better rtt calculation courtesy of UMich crew (dave,larry,peter,?) */
6975 /* Apply VanJacobson round-trip estimations */
6980 * srtt (call->rtt) is in units of one-eighth-milliseconds.
6981 * srtt is stored as fixed point with 3 bits after the binary
6982 * point (i.e., scaled by 8). The following magic is
6983 * equivalent to the smoothing algorithm in rfc793 with an
6984 * alpha of .875 (srtt' = rtt/8 + srtt*7/8 in fixed point).
6985 * srtt'*8 = rtt + srtt*7
6986 * srtt'*8 = srtt*8 + rtt - srtt
6987 * srtt' = srtt + rtt/8 - srtt/8
6988 * srtt' = srtt + (rtt - srtt)/8
6991 delta = _8THMSEC(&thisRtt) - call->rtt;
6992 call->rtt += (delta >> 3);
6995 * We accumulate a smoothed rtt variance (actually, a smoothed
6996 * mean difference), then set the retransmit timer to smoothed
6997 * rtt + 4 times the smoothed variance (was 2x in van's original
6998 * paper, but 4x works better for me, and apparently for him as
7000 * rttvar is stored as
7001 * fixed point with 2 bits after the binary point (scaled by
7002 * 4). The following is equivalent to rfc793 smoothing with
7003 * an alpha of .75 (rttvar' = rttvar*3/4 + |delta| / 4).
7004 * rttvar'*4 = rttvar*3 + |delta|
7005 * rttvar'*4 = rttvar*4 + |delta| - rttvar
7006 * rttvar' = rttvar + |delta|/4 - rttvar/4
7007 * rttvar' = rttvar + (|delta| - rttvar)/4
7008 * This replaces rfc793's wired-in beta.
7009 * dev*4 = dev*4 + (|actual - expected| - dev)
7015 delta -= (call->rtt_dev << 1);
7016 call->rtt_dev += (delta >> 3);
7018 /* I don't have a stored RTT so I start with this value. Since I'm
7019 * probably just starting a call, and will be pushing more data down
7020 * this, I expect congestion to increase rapidly. So I fudge a
7021 * little, and I set deviance to half the rtt. In practice,
7022 * deviance tends to approach something a little less than
7023 * half the smoothed rtt. */
7024 call->rtt = _8THMSEC(&thisRtt) + 8;
7025 call->rtt_dev = call->rtt >> 2; /* rtt/2: they're scaled differently */
7027 /* the smoothed RTT time is RTT + 4*MDEV
7029 * We allow a user specified minimum to be set for this, to allow clamping
7030 * at a minimum value in the same way as TCP. In addition, we have to allow
7031 * for the possibility that this packet is answered by a delayed ACK, so we
7032 * add on a fixed 200ms to account for that timer expiring.
7035 rtt_timeout = MAX(((call->rtt >> 3) + call->rtt_dev),
7036 rx_minPeerTimeout) + 200;
7037 clock_Zero(&call->rto);
7038 clock_Addmsec(&call->rto, rtt_timeout);
7040 /* Update the peer, so any new calls start with our values */
7041 peer->rtt_dev = call->rtt_dev;
7042 peer->rtt = call->rtt;
7044 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n",
7045 p->header.callNumber, p, MSEC(&thisRtt), call->rtt >> 3, call->rtt_dev >> 2, (call->rto.sec), (call->rto.usec)));
7049 /* Find all server connections that have not been active for a long time, and
7052 rxi_ReapConnections(struct rxevent *unused, void *unused1, void *unused2,
7055 struct clock now, when;
7056 struct rxevent *event;
7057 clock_GetTime(&now);
7059 /* Find server connection structures that haven't been used for
7060 * greater than rx_idleConnectionTime */
7062 struct rx_connection **conn_ptr, **conn_end;
7063 int i, havecalls = 0;
7064 MUTEX_ENTER(&rx_connHashTable_lock);
7065 for (conn_ptr = &rx_connHashTable[0], conn_end =
7066 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
7068 struct rx_connection *conn, *next;
7069 struct rx_call *call;
7073 for (conn = *conn_ptr; conn; conn = next) {
7074 /* XXX -- Shouldn't the connection be locked? */
7077 for (i = 0; i < RX_MAXCALLS; i++) {
7078 call = conn->call[i];
7082 code = MUTEX_TRYENTER(&call->lock);
7085 result = rxi_CheckCall(call, 1);
7086 MUTEX_EXIT(&call->lock);
7088 /* If CheckCall freed the call, it might
7089 * have destroyed the connection as well,
7090 * which screws up the linked lists.
7096 if (conn->type == RX_SERVER_CONNECTION) {
7097 /* This only actually destroys the connection if
7098 * there are no outstanding calls */
7099 MUTEX_ENTER(&conn->conn_data_lock);
7100 MUTEX_ENTER(&rx_refcnt_mutex);
7101 if (!havecalls && !conn->refCount
7102 && ((conn->lastSendTime + rx_idleConnectionTime) <
7104 conn->refCount++; /* it will be decr in rx_DestroyConn */
7105 MUTEX_EXIT(&rx_refcnt_mutex);
7106 MUTEX_EXIT(&conn->conn_data_lock);
7107 #ifdef RX_ENABLE_LOCKS
7108 rxi_DestroyConnectionNoLock(conn);
7109 #else /* RX_ENABLE_LOCKS */
7110 rxi_DestroyConnection(conn);
7111 #endif /* RX_ENABLE_LOCKS */
7113 #ifdef RX_ENABLE_LOCKS
7115 MUTEX_EXIT(&rx_refcnt_mutex);
7116 MUTEX_EXIT(&conn->conn_data_lock);
7118 #endif /* RX_ENABLE_LOCKS */
7122 #ifdef RX_ENABLE_LOCKS
7123 while (rx_connCleanup_list) {
7124 struct rx_connection *conn;
7125 conn = rx_connCleanup_list;
7126 rx_connCleanup_list = rx_connCleanup_list->next;
7127 MUTEX_EXIT(&rx_connHashTable_lock);
7128 rxi_CleanupConnection(conn);
7129 MUTEX_ENTER(&rx_connHashTable_lock);
7131 MUTEX_EXIT(&rx_connHashTable_lock);
7132 #endif /* RX_ENABLE_LOCKS */
7135 /* Find any peer structures that haven't been used (haven't had an
7136 * associated connection) for greater than rx_idlePeerTime */
7138 struct rx_peer **peer_ptr, **peer_end;
7142 * Why do we need to hold the rx_peerHashTable_lock across
7143 * the incrementing of peer_ptr since the rx_peerHashTable
7144 * array is not changing? We don't.
7146 * By dropping the lock periodically we can permit other
7147 * activities to be performed while a rxi_ReapConnections
7148 * call is in progress. The goal of reap connections
7149 * is to clean up quickly without causing large amounts
7150 * of contention. Therefore, it is important that global
7151 * mutexes not be held for extended periods of time.
7153 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7154 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7156 struct rx_peer *peer, *next, *prev;
7158 MUTEX_ENTER(&rx_peerHashTable_lock);
7159 for (prev = peer = *peer_ptr; peer; peer = next) {
7161 code = MUTEX_TRYENTER(&peer->peer_lock);
7162 if ((code) && (peer->refCount == 0)
7163 && ((peer->idleWhen + rx_idlePeerTime) < now.sec)) {
7164 struct opr_queue *cursor, *store;
7168 * now know that this peer object is one to be
7169 * removed from the hash table. Once it is removed
7170 * it can't be referenced by other threads.
7171 * Lets remove it first and decrement the struct
7172 * nPeerStructs count.
7174 if (peer == *peer_ptr) {
7180 if (rx_stats_active)
7181 rx_atomic_dec(&rx_stats.nPeerStructs);
7184 * Now if we hold references on 'prev' and 'next'
7185 * we can safely drop the rx_peerHashTable_lock
7186 * while we destroy this 'peer' object.
7192 MUTEX_EXIT(&rx_peerHashTable_lock);
7194 MUTEX_EXIT(&peer->peer_lock);
7195 MUTEX_DESTROY(&peer->peer_lock);
7197 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
7198 unsigned int num_funcs;
7199 struct rx_interface_stat *rpc_stat
7200 = opr_queue_Entry(cursor, struct rx_interface_stat,
7205 opr_queue_Remove(&rpc_stat->entry);
7206 opr_queue_Remove(&rpc_stat->entryPeers);
7208 num_funcs = rpc_stat->stats[0].func_total;
7210 sizeof(rx_interface_stat_t) +
7211 rpc_stat->stats[0].func_total *
7212 sizeof(rx_function_entry_v1_t);
7214 rxi_Free(rpc_stat, space);
7216 MUTEX_ENTER(&rx_rpc_stats);
7217 rxi_rpc_peer_stat_cnt -= num_funcs;
7218 MUTEX_EXIT(&rx_rpc_stats);
7223 * Regain the rx_peerHashTable_lock and
7224 * decrement the reference count on 'prev'
7227 MUTEX_ENTER(&rx_peerHashTable_lock);
7234 MUTEX_EXIT(&peer->peer_lock);
7239 MUTEX_EXIT(&rx_peerHashTable_lock);
7243 /* THIS HACK IS A TEMPORARY HACK. The idea is that the race condition in
7244 * rxi_AllocSendPacket, if it hits, will be handled at the next conn
7245 * GC, just below. Really, we shouldn't have to keep moving packets from
7246 * one place to another, but instead ought to always know if we can
7247 * afford to hold onto a packet in its particular use. */
7248 MUTEX_ENTER(&rx_freePktQ_lock);
7249 if (rx_waitingForPackets) {
7250 rx_waitingForPackets = 0;
7251 #ifdef RX_ENABLE_LOCKS
7252 CV_BROADCAST(&rx_waitingForPackets_cv);
7254 osi_rxWakeup(&rx_waitingForPackets);
7257 MUTEX_EXIT(&rx_freePktQ_lock);
7260 when.sec += RX_REAP_TIME; /* Check every RX_REAP_TIME seconds */
7261 event = rxevent_Post(&when, &now, rxi_ReapConnections, 0, NULL, 0);
7262 rxevent_Put(&event);
7266 /* rxs_Release - This isn't strictly necessary but, since the macro name from
7267 * rx.h is sort of strange this is better. This is called with a security
7268 * object before it is discarded. Each connection using a security object has
7269 * its own refcount to the object so it won't actually be freed until the last
7270 * connection is destroyed.
7272 * This is the only rxs module call. A hold could also be written but no one
7276 rxs_Release(struct rx_securityClass *aobj)
7278 return RXS_Close(aobj);
7286 #define TRACE_OPTION_RX_DEBUG 16
7294 code = RegOpenKeyEx(HKEY_LOCAL_MACHINE, AFSREG_CLT_SVC_PARAM_SUBKEY,
7295 0, KEY_QUERY_VALUE, &parmKey);
7296 if (code != ERROR_SUCCESS)
7299 dummyLen = sizeof(TraceOption);
7300 code = RegQueryValueEx(parmKey, "TraceOption", NULL, NULL,
7301 (BYTE *) &TraceOption, &dummyLen);
7302 if (code == ERROR_SUCCESS) {
7303 rxdebug_active = (TraceOption & TRACE_OPTION_RX_DEBUG) ? 1 : 0;
7305 RegCloseKey (parmKey);
7306 #endif /* AFS_NT40_ENV */
7311 rx_DebugOnOff(int on)
7315 rxdebug_active = on;
7321 rx_StatsOnOff(int on)
7323 rx_stats_active = on;
7327 /* Don't call this debugging routine directly; use dpf */
7329 rxi_DebugPrint(char *format, ...)
7338 va_start(ap, format);
7340 len = _snprintf(tformat, sizeof(tformat), "tid[%d] %s", GetCurrentThreadId(), format);
7343 len = _vsnprintf(msg, sizeof(msg)-2, tformat, ap);
7345 OutputDebugString(msg);
7351 va_start(ap, format);
7353 clock_GetTime(&now);
7354 fprintf(rx_Log, " %d.%06d:", (unsigned int)now.sec,
7355 (unsigned int)now.usec);
7356 vfprintf(rx_Log, format, ap);
7364 * This function is used to process the rx_stats structure that is local
7365 * to a process as well as an rx_stats structure received from a remote
7366 * process (via rxdebug). Therefore, it needs to do minimal version
7370 rx_PrintTheseStats(FILE * file, struct rx_statistics *s, int size,
7371 afs_int32 freePackets, char version)
7375 if (size != sizeof(struct rx_statistics)) {
7377 "Unexpected size of stats structure: was %d, expected %" AFS_SIZET_FMT "\n",
7378 size, sizeof(struct rx_statistics));
7381 fprintf(file, "rx stats: free packets %d, allocs %d, ", (int)freePackets,
7384 if (version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7385 fprintf(file, "alloc-failures(rcv %u/%u,send %u/%u,ack %u)\n",
7386 s->receivePktAllocFailures, s->receiveCbufPktAllocFailures,
7387 s->sendPktAllocFailures, s->sendCbufPktAllocFailures,
7388 s->specialPktAllocFailures);
7390 fprintf(file, "alloc-failures(rcv %u,send %u,ack %u)\n",
7391 s->receivePktAllocFailures, s->sendPktAllocFailures,
7392 s->specialPktAllocFailures);
7396 " greedy %u, " "bogusReads %u (last from host %x), "
7397 "noPackets %u, " "noBuffers %u, " "selects %u, "
7398 "sendSelects %u\n", s->socketGreedy, s->bogusPacketOnRead,
7399 s->bogusHost, s->noPacketOnRead, s->noPacketBuffersOnRead,
7400 s->selects, s->sendSelects);
7402 fprintf(file, " packets read: ");
7403 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7404 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsRead[i]);
7406 fprintf(file, "\n");
7409 " other read counters: data %u, " "ack %u, " "dup %u "
7410 "spurious %u " "dally %u\n", s->dataPacketsRead,
7411 s->ackPacketsRead, s->dupPacketsRead, s->spuriousPacketsRead,
7412 s->ignorePacketDally);
7414 fprintf(file, " packets sent: ");
7415 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7416 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsSent[i]);
7418 fprintf(file, "\n");
7421 " other send counters: ack %u, " "data %u (not resends), "
7422 "resends %u, " "pushed %u, " "acked&ignored %u\n",
7423 s->ackPacketsSent, s->dataPacketsSent, s->dataPacketsReSent,
7424 s->dataPacketsPushed, s->ignoreAckedPacket);
7427 " \t(these should be small) sendFailed %u, " "fatalErrors %u\n",
7428 s->netSendFailures, (int)s->fatalErrors);
7430 if (s->nRttSamples) {
7431 fprintf(file, " Average rtt is %0.3f, with %d samples\n",
7432 clock_Float(&s->totalRtt) / s->nRttSamples, s->nRttSamples);
7434 fprintf(file, " Minimum rtt is %0.3f, maximum is %0.3f\n",
7435 clock_Float(&s->minRtt), clock_Float(&s->maxRtt));
7439 " %d server connections, " "%d client connections, "
7440 "%d peer structs, " "%d call structs, " "%d free call structs\n",
7441 s->nServerConns, s->nClientConns, s->nPeerStructs,
7442 s->nCallStructs, s->nFreeCallStructs);
7444 #if !defined(AFS_PTHREAD_ENV) && !defined(AFS_USE_GETTIMEOFDAY)
7445 fprintf(file, " %d clock updates\n", clock_nUpdates);
7449 /* for backward compatibility */
7451 rx_PrintStats(FILE * file)
7453 MUTEX_ENTER(&rx_stats_mutex);
7454 rx_PrintTheseStats(file, (struct rx_statistics *) &rx_stats,
7455 sizeof(rx_stats), rx_nFreePackets,
7457 MUTEX_EXIT(&rx_stats_mutex);
7461 rx_PrintPeerStats(FILE * file, struct rx_peer *peer)
7463 fprintf(file, "Peer %x.%d.\n",
7464 ntohl(peer->host), (int)ntohs(peer->port));
7467 " Rtt %d, " "total sent %d, " "resent %d\n",
7468 peer->rtt, peer->nSent, peer->reSends);
7470 fprintf(file, " Packet size %d\n", peer->ifMTU);
7474 #if defined(AFS_PTHREAD_ENV) && defined(RXDEBUG)
7476 * This mutex protects the following static variables:
7480 #define LOCK_RX_DEBUG MUTEX_ENTER(&rx_debug_mutex)
7481 #define UNLOCK_RX_DEBUG MUTEX_EXIT(&rx_debug_mutex)
7483 #define LOCK_RX_DEBUG
7484 #define UNLOCK_RX_DEBUG
7485 #endif /* AFS_PTHREAD_ENV */
7487 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7489 MakeDebugCall(osi_socket socket, afs_uint32 remoteAddr, afs_uint16 remotePort,
7490 u_char type, void *inputData, size_t inputLength,
7491 void *outputData, size_t outputLength)
7493 static afs_int32 counter = 100;
7494 time_t waitTime, waitCount;
7495 struct rx_header theader;
7498 struct timeval tv_now, tv_wake, tv_delta;
7499 struct sockaddr_in taddr, faddr;
7513 tp = &tbuffer[sizeof(struct rx_header)];
7514 taddr.sin_family = AF_INET;
7515 taddr.sin_port = remotePort;
7516 taddr.sin_addr.s_addr = remoteAddr;
7517 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
7518 taddr.sin_len = sizeof(struct sockaddr_in);
7521 memset(&theader, 0, sizeof(theader));
7522 theader.epoch = htonl(999);
7524 theader.callNumber = htonl(counter);
7527 theader.type = type;
7528 theader.flags = RX_CLIENT_INITIATED | RX_LAST_PACKET;
7529 theader.serviceId = 0;
7531 memcpy(tbuffer, &theader, sizeof(theader));
7532 memcpy(tp, inputData, inputLength);
7534 sendto(socket, tbuffer, inputLength + sizeof(struct rx_header), 0,
7535 (struct sockaddr *)&taddr, sizeof(struct sockaddr_in));
7537 /* see if there's a packet available */
7538 gettimeofday(&tv_wake, NULL);
7539 tv_wake.tv_sec += waitTime;
7542 FD_SET(socket, &imask);
7543 tv_delta.tv_sec = tv_wake.tv_sec;
7544 tv_delta.tv_usec = tv_wake.tv_usec;
7545 gettimeofday(&tv_now, NULL);
7547 if (tv_delta.tv_usec < tv_now.tv_usec) {
7549 tv_delta.tv_usec += 1000000;
7552 tv_delta.tv_usec -= tv_now.tv_usec;
7554 if (tv_delta.tv_sec < tv_now.tv_sec) {
7558 tv_delta.tv_sec -= tv_now.tv_sec;
7561 code = select(0, &imask, 0, 0, &tv_delta);
7562 #else /* AFS_NT40_ENV */
7563 code = select(socket + 1, &imask, 0, 0, &tv_delta);
7564 #endif /* AFS_NT40_ENV */
7565 if (code == 1 && FD_ISSET(socket, &imask)) {
7566 /* now receive a packet */
7567 faddrLen = sizeof(struct sockaddr_in);
7569 recvfrom(socket, tbuffer, sizeof(tbuffer), 0,
7570 (struct sockaddr *)&faddr, &faddrLen);
7573 memcpy(&theader, tbuffer, sizeof(struct rx_header));
7574 if (counter == ntohl(theader.callNumber))
7582 /* see if we've timed out */
7590 code -= sizeof(struct rx_header);
7591 if (code > outputLength)
7592 code = outputLength;
7593 memcpy(outputData, tp, code);
7596 #endif /* RXDEBUG */
7599 rx_GetServerDebug(osi_socket socket, afs_uint32 remoteAddr,
7600 afs_uint16 remotePort, struct rx_debugStats * stat,
7601 afs_uint32 * supportedValues)
7603 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7605 struct rx_debugIn in;
7607 *supportedValues = 0;
7608 in.type = htonl(RX_DEBUGI_GETSTATS);
7611 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7612 &in, sizeof(in), stat, sizeof(*stat));
7615 * If the call was successful, fixup the version and indicate
7616 * what contents of the stat structure are valid.
7617 * Also do net to host conversion of fields here.
7621 if (stat->version >= RX_DEBUGI_VERSION_W_SECSTATS) {
7622 *supportedValues |= RX_SERVER_DEBUG_SEC_STATS;
7624 if (stat->version >= RX_DEBUGI_VERSION_W_GETALLCONN) {
7625 *supportedValues |= RX_SERVER_DEBUG_ALL_CONN;
7627 if (stat->version >= RX_DEBUGI_VERSION_W_RXSTATS) {
7628 *supportedValues |= RX_SERVER_DEBUG_RX_STATS;
7630 if (stat->version >= RX_DEBUGI_VERSION_W_WAITERS) {
7631 *supportedValues |= RX_SERVER_DEBUG_WAITER_CNT;
7633 if (stat->version >= RX_DEBUGI_VERSION_W_IDLETHREADS) {
7634 *supportedValues |= RX_SERVER_DEBUG_IDLE_THREADS;
7636 if (stat->version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7637 *supportedValues |= RX_SERVER_DEBUG_NEW_PACKETS;
7639 if (stat->version >= RX_DEBUGI_VERSION_W_GETPEER) {
7640 *supportedValues |= RX_SERVER_DEBUG_ALL_PEER;
7642 if (stat->version >= RX_DEBUGI_VERSION_W_WAITED) {
7643 *supportedValues |= RX_SERVER_DEBUG_WAITED_CNT;
7645 if (stat->version >= RX_DEBUGI_VERSION_W_PACKETS) {
7646 *supportedValues |= RX_SERVER_DEBUG_PACKETS_CNT;
7648 stat->nFreePackets = ntohl(stat->nFreePackets);
7649 stat->packetReclaims = ntohl(stat->packetReclaims);
7650 stat->callsExecuted = ntohl(stat->callsExecuted);
7651 stat->nWaiting = ntohl(stat->nWaiting);
7652 stat->idleThreads = ntohl(stat->idleThreads);
7653 stat->nWaited = ntohl(stat->nWaited);
7654 stat->nPackets = ntohl(stat->nPackets);
7663 rx_GetServerStats(osi_socket socket, afs_uint32 remoteAddr,
7664 afs_uint16 remotePort, struct rx_statistics * stat,
7665 afs_uint32 * supportedValues)
7667 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7669 struct rx_debugIn in;
7670 afs_int32 *lp = (afs_int32 *) stat;
7674 * supportedValues is currently unused, but added to allow future
7675 * versioning of this function.
7678 *supportedValues = 0;
7679 in.type = htonl(RX_DEBUGI_RXSTATS);
7681 memset(stat, 0, sizeof(*stat));
7683 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7684 &in, sizeof(in), stat, sizeof(*stat));
7689 * Do net to host conversion here
7692 for (i = 0; i < sizeof(*stat) / sizeof(afs_int32); i++, lp++) {
7703 rx_GetServerVersion(osi_socket socket, afs_uint32 remoteAddr,
7704 afs_uint16 remotePort, size_t version_length,
7707 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7709 return MakeDebugCall(socket, remoteAddr, remotePort,
7710 RX_PACKET_TYPE_VERSION, a, 1, version,
7718 rx_GetServerConnections(osi_socket socket, afs_uint32 remoteAddr,
7719 afs_uint16 remotePort, afs_int32 * nextConnection,
7720 int allConnections, afs_uint32 debugSupportedValues,
7721 struct rx_debugConn * conn,
7722 afs_uint32 * supportedValues)
7724 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7726 struct rx_debugIn in;
7730 * supportedValues is currently unused, but added to allow future
7731 * versioning of this function.
7734 *supportedValues = 0;
7735 if (allConnections) {
7736 in.type = htonl(RX_DEBUGI_GETALLCONN);
7738 in.type = htonl(RX_DEBUGI_GETCONN);
7740 in.index = htonl(*nextConnection);
7741 memset(conn, 0, sizeof(*conn));
7743 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7744 &in, sizeof(in), conn, sizeof(*conn));
7747 *nextConnection += 1;
7750 * Convert old connection format to new structure.
7753 if (debugSupportedValues & RX_SERVER_DEBUG_OLD_CONN) {
7754 struct rx_debugConn_vL *vL = (struct rx_debugConn_vL *)conn;
7755 #define MOVEvL(a) (conn->a = vL->a)
7757 /* any old or unrecognized version... */
7758 for (i = 0; i < RX_MAXCALLS; i++) {
7759 MOVEvL(callState[i]);
7760 MOVEvL(callMode[i]);
7761 MOVEvL(callFlags[i]);
7762 MOVEvL(callOther[i]);
7764 if (debugSupportedValues & RX_SERVER_DEBUG_SEC_STATS) {
7765 MOVEvL(secStats.type);
7766 MOVEvL(secStats.level);
7767 MOVEvL(secStats.flags);
7768 MOVEvL(secStats.expires);
7769 MOVEvL(secStats.packetsReceived);
7770 MOVEvL(secStats.packetsSent);
7771 MOVEvL(secStats.bytesReceived);
7772 MOVEvL(secStats.bytesSent);
7777 * Do net to host conversion here
7779 * I don't convert host or port since we are most likely
7780 * going to want these in NBO.
7782 conn->cid = ntohl(conn->cid);
7783 conn->serial = ntohl(conn->serial);
7784 for (i = 0; i < RX_MAXCALLS; i++) {
7785 conn->callNumber[i] = ntohl(conn->callNumber[i]);
7787 conn->error = ntohl(conn->error);
7788 conn->secStats.flags = ntohl(conn->secStats.flags);
7789 conn->secStats.expires = ntohl(conn->secStats.expires);
7790 conn->secStats.packetsReceived =
7791 ntohl(conn->secStats.packetsReceived);
7792 conn->secStats.packetsSent = ntohl(conn->secStats.packetsSent);
7793 conn->secStats.bytesReceived = ntohl(conn->secStats.bytesReceived);
7794 conn->secStats.bytesSent = ntohl(conn->secStats.bytesSent);
7795 conn->epoch = ntohl(conn->epoch);
7796 conn->natMTU = ntohl(conn->natMTU);
7805 rx_GetServerPeers(osi_socket socket, afs_uint32 remoteAddr,
7806 afs_uint16 remotePort, afs_int32 * nextPeer,
7807 afs_uint32 debugSupportedValues, struct rx_debugPeer * peer,
7808 afs_uint32 * supportedValues)
7810 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7812 struct rx_debugIn in;
7815 * supportedValues is currently unused, but added to allow future
7816 * versioning of this function.
7819 *supportedValues = 0;
7820 in.type = htonl(RX_DEBUGI_GETPEER);
7821 in.index = htonl(*nextPeer);
7822 memset(peer, 0, sizeof(*peer));
7824 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7825 &in, sizeof(in), peer, sizeof(*peer));
7831 * Do net to host conversion here
7833 * I don't convert host or port since we are most likely
7834 * going to want these in NBO.
7836 peer->ifMTU = ntohs(peer->ifMTU);
7837 peer->idleWhen = ntohl(peer->idleWhen);
7838 peer->refCount = ntohs(peer->refCount);
7839 peer->rtt = ntohl(peer->rtt);
7840 peer->rtt_dev = ntohl(peer->rtt_dev);
7841 peer->timeout.sec = 0;
7842 peer->timeout.usec = 0;
7843 peer->nSent = ntohl(peer->nSent);
7844 peer->reSends = ntohl(peer->reSends);
7845 peer->natMTU = ntohs(peer->natMTU);
7846 peer->maxMTU = ntohs(peer->maxMTU);
7847 peer->maxDgramPackets = ntohs(peer->maxDgramPackets);
7848 peer->ifDgramPackets = ntohs(peer->ifDgramPackets);
7849 peer->MTU = ntohs(peer->MTU);
7850 peer->cwind = ntohs(peer->cwind);
7851 peer->nDgramPackets = ntohs(peer->nDgramPackets);
7852 peer->congestSeq = ntohs(peer->congestSeq);
7853 peer->bytesSent.high = ntohl(peer->bytesSent.high);
7854 peer->bytesSent.low = ntohl(peer->bytesSent.low);
7855 peer->bytesReceived.high = ntohl(peer->bytesReceived.high);
7856 peer->bytesReceived.low = ntohl(peer->bytesReceived.low);
7865 rx_GetLocalPeers(afs_uint32 peerHost, afs_uint16 peerPort,
7866 struct rx_debugPeer * peerStats)
7869 afs_int32 error = 1; /* default to "did not succeed" */
7870 afs_uint32 hashValue = PEER_HASH(peerHost, peerPort);
7872 MUTEX_ENTER(&rx_peerHashTable_lock);
7873 for(tp = rx_peerHashTable[hashValue];
7874 tp != NULL; tp = tp->next) {
7875 if (tp->host == peerHost)
7881 MUTEX_EXIT(&rx_peerHashTable_lock);
7885 MUTEX_ENTER(&tp->peer_lock);
7886 peerStats->host = tp->host;
7887 peerStats->port = tp->port;
7888 peerStats->ifMTU = tp->ifMTU;
7889 peerStats->idleWhen = tp->idleWhen;
7890 peerStats->refCount = tp->refCount;
7891 peerStats->burstSize = 0;
7892 peerStats->burst = 0;
7893 peerStats->burstWait.sec = 0;
7894 peerStats->burstWait.usec = 0;
7895 peerStats->rtt = tp->rtt;
7896 peerStats->rtt_dev = tp->rtt_dev;
7897 peerStats->timeout.sec = 0;
7898 peerStats->timeout.usec = 0;
7899 peerStats->nSent = tp->nSent;
7900 peerStats->reSends = tp->reSends;
7901 peerStats->natMTU = tp->natMTU;
7902 peerStats->maxMTU = tp->maxMTU;
7903 peerStats->maxDgramPackets = tp->maxDgramPackets;
7904 peerStats->ifDgramPackets = tp->ifDgramPackets;
7905 peerStats->MTU = tp->MTU;
7906 peerStats->cwind = tp->cwind;
7907 peerStats->nDgramPackets = tp->nDgramPackets;
7908 peerStats->congestSeq = tp->congestSeq;
7909 peerStats->bytesSent.high = tp->bytesSent >> 32;
7910 peerStats->bytesSent.low = tp->bytesSent & MAX_AFS_UINT32;
7911 peerStats->bytesReceived.high = tp->bytesReceived >> 32;
7912 peerStats->bytesReceived.low
7913 = tp->bytesReceived & MAX_AFS_UINT32;
7914 MUTEX_EXIT(&tp->peer_lock);
7916 MUTEX_ENTER(&rx_peerHashTable_lock);
7919 MUTEX_EXIT(&rx_peerHashTable_lock);
7927 struct rx_serverQueueEntry *np;
7930 struct rx_call *call;
7931 struct rx_serverQueueEntry *sq;
7934 if (rx_atomic_test_and_set_bit(&rxinit_status, 0))
7935 return; /* Already shutdown. */
7939 #ifndef AFS_PTHREAD_ENV
7940 FD_ZERO(&rx_selectMask);
7941 #endif /* AFS_PTHREAD_ENV */
7942 rxi_dataQuota = RX_MAX_QUOTA;
7943 #ifndef AFS_PTHREAD_ENV
7945 #endif /* AFS_PTHREAD_ENV */
7948 #ifndef AFS_PTHREAD_ENV
7949 #ifndef AFS_USE_GETTIMEOFDAY
7951 #endif /* AFS_USE_GETTIMEOFDAY */
7952 #endif /* AFS_PTHREAD_ENV */
7954 while (!opr_queue_IsEmpty(&rx_freeCallQueue)) {
7955 call = opr_queue_First(&rx_freeCallQueue, struct rx_call, entry);
7956 opr_queue_Remove(&call->entry);
7957 rxi_Free(call, sizeof(struct rx_call));
7960 while (!opr_queue_IsEmpty(&rx_idleServerQueue)) {
7961 sq = opr_queue_First(&rx_idleServerQueue, struct rx_serverQueueEntry,
7963 opr_queue_Remove(&sq->entry);
7968 struct rx_peer **peer_ptr, **peer_end;
7969 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7970 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7972 struct rx_peer *peer, *next;
7974 MUTEX_ENTER(&rx_peerHashTable_lock);
7975 for (peer = *peer_ptr; peer; peer = next) {
7976 struct opr_queue *cursor, *store;
7979 MUTEX_ENTER(&rx_rpc_stats);
7980 MUTEX_ENTER(&peer->peer_lock);
7981 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
7982 unsigned int num_funcs;
7983 struct rx_interface_stat *rpc_stat
7984 = opr_queue_Entry(cursor, struct rx_interface_stat,
7988 opr_queue_Remove(&rpc_stat->entry);
7989 opr_queue_Remove(&rpc_stat->entryPeers);
7990 num_funcs = rpc_stat->stats[0].func_total;
7992 sizeof(rx_interface_stat_t) +
7993 rpc_stat->stats[0].func_total *
7994 sizeof(rx_function_entry_v1_t);
7996 rxi_Free(rpc_stat, space);
7998 /* rx_rpc_stats must be held */
7999 rxi_rpc_peer_stat_cnt -= num_funcs;
8001 MUTEX_EXIT(&peer->peer_lock);
8002 MUTEX_EXIT(&rx_rpc_stats);
8006 if (rx_stats_active)
8007 rx_atomic_dec(&rx_stats.nPeerStructs);
8009 MUTEX_EXIT(&rx_peerHashTable_lock);
8012 for (i = 0; i < RX_MAX_SERVICES; i++) {
8014 rxi_Free(rx_services[i], sizeof(*rx_services[i]));
8016 for (i = 0; i < rx_hashTableSize; i++) {
8017 struct rx_connection *tc, *ntc;
8018 MUTEX_ENTER(&rx_connHashTable_lock);
8019 for (tc = rx_connHashTable[i]; tc; tc = ntc) {
8021 for (j = 0; j < RX_MAXCALLS; j++) {
8023 rxi_Free(tc->call[j], sizeof(*tc->call[j]));
8026 rxi_Free(tc, sizeof(*tc));
8028 MUTEX_EXIT(&rx_connHashTable_lock);
8031 MUTEX_ENTER(&freeSQEList_lock);
8033 while ((np = rx_FreeSQEList)) {
8034 rx_FreeSQEList = *(struct rx_serverQueueEntry **)np;
8035 MUTEX_DESTROY(&np->lock);
8036 rxi_Free(np, sizeof(*np));
8039 MUTEX_EXIT(&freeSQEList_lock);
8040 MUTEX_DESTROY(&freeSQEList_lock);
8041 MUTEX_DESTROY(&rx_freeCallQueue_lock);
8042 MUTEX_DESTROY(&rx_connHashTable_lock);
8043 MUTEX_DESTROY(&rx_peerHashTable_lock);
8044 MUTEX_DESTROY(&rx_serverPool_lock);
8046 osi_Free(rx_connHashTable,
8047 rx_hashTableSize * sizeof(struct rx_connection *));
8048 osi_Free(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
8050 UNPIN(rx_connHashTable,
8051 rx_hashTableSize * sizeof(struct rx_connection *));
8052 UNPIN(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
8054 rxi_FreeAllPackets();
8056 MUTEX_ENTER(&rx_quota_mutex);
8057 rxi_dataQuota = RX_MAX_QUOTA;
8058 rxi_availProcs = rxi_totalMin = rxi_minDeficit = 0;
8059 MUTEX_EXIT(&rx_quota_mutex);
8065 * Routines to implement connection specific data.
8069 rx_KeyCreate(rx_destructor_t rtn)
8072 MUTEX_ENTER(&rxi_keyCreate_lock);
8073 key = rxi_keyCreate_counter++;
8074 rxi_keyCreate_destructor = (rx_destructor_t *)
8075 realloc((void *)rxi_keyCreate_destructor,
8076 (key + 1) * sizeof(rx_destructor_t));
8077 rxi_keyCreate_destructor[key] = rtn;
8078 MUTEX_EXIT(&rxi_keyCreate_lock);
8083 rx_SetSpecific(struct rx_connection *conn, int key, void *ptr)
8086 MUTEX_ENTER(&conn->conn_data_lock);
8087 if (!conn->specific) {
8088 conn->specific = malloc((key + 1) * sizeof(void *));
8089 for (i = 0; i < key; i++)
8090 conn->specific[i] = NULL;
8091 conn->nSpecific = key + 1;
8092 conn->specific[key] = ptr;
8093 } else if (key >= conn->nSpecific) {
8094 conn->specific = (void **)
8095 realloc(conn->specific, (key + 1) * sizeof(void *));
8096 for (i = conn->nSpecific; i < key; i++)
8097 conn->specific[i] = NULL;
8098 conn->nSpecific = key + 1;
8099 conn->specific[key] = ptr;
8101 if (conn->specific[key] && rxi_keyCreate_destructor[key])
8102 (*rxi_keyCreate_destructor[key]) (conn->specific[key]);
8103 conn->specific[key] = ptr;
8105 MUTEX_EXIT(&conn->conn_data_lock);
8109 rx_SetServiceSpecific(struct rx_service *svc, int key, void *ptr)
8112 MUTEX_ENTER(&svc->svc_data_lock);
8113 if (!svc->specific) {
8114 svc->specific = malloc((key + 1) * sizeof(void *));
8115 for (i = 0; i < key; i++)
8116 svc->specific[i] = NULL;
8117 svc->nSpecific = key + 1;
8118 svc->specific[key] = ptr;
8119 } else if (key >= svc->nSpecific) {
8120 svc->specific = (void **)
8121 realloc(svc->specific, (key + 1) * sizeof(void *));
8122 for (i = svc->nSpecific; i < key; i++)
8123 svc->specific[i] = NULL;
8124 svc->nSpecific = key + 1;
8125 svc->specific[key] = ptr;
8127 if (svc->specific[key] && rxi_keyCreate_destructor[key])
8128 (*rxi_keyCreate_destructor[key]) (svc->specific[key]);
8129 svc->specific[key] = ptr;
8131 MUTEX_EXIT(&svc->svc_data_lock);
8135 rx_GetSpecific(struct rx_connection *conn, int key)
8138 MUTEX_ENTER(&conn->conn_data_lock);
8139 if (key >= conn->nSpecific)
8142 ptr = conn->specific[key];
8143 MUTEX_EXIT(&conn->conn_data_lock);
8148 rx_GetServiceSpecific(struct rx_service *svc, int key)
8151 MUTEX_ENTER(&svc->svc_data_lock);
8152 if (key >= svc->nSpecific)
8155 ptr = svc->specific[key];
8156 MUTEX_EXIT(&svc->svc_data_lock);
8161 #endif /* !KERNEL */
8164 * processStats is a queue used to store the statistics for the local
8165 * process. Its contents are similar to the contents of the rpcStats
8166 * queue on a rx_peer structure, but the actual data stored within
8167 * this queue contains totals across the lifetime of the process (assuming
8168 * the stats have not been reset) - unlike the per peer structures
8169 * which can come and go based upon the peer lifetime.
8172 static struct opr_queue processStats = { &processStats, &processStats };
8175 * peerStats is a queue used to store the statistics for all peer structs.
8176 * Its contents are the union of all the peer rpcStats queues.
8179 static struct opr_queue peerStats = { &peerStats, &peerStats };
8182 * rxi_monitor_processStats is used to turn process wide stat collection
8186 static int rxi_monitor_processStats = 0;
8189 * rxi_monitor_peerStats is used to turn per peer stat collection on and off
8192 static int rxi_monitor_peerStats = 0;
8196 rxi_ClearRPCOpStat(rx_function_entry_v1_p rpc_stat)
8198 rpc_stat->invocations = 0;
8199 rpc_stat->bytes_sent = 0;
8200 rpc_stat->bytes_rcvd = 0;
8201 rpc_stat->queue_time_sum.sec = 0;
8202 rpc_stat->queue_time_sum.usec = 0;
8203 rpc_stat->queue_time_sum_sqr.sec = 0;
8204 rpc_stat->queue_time_sum_sqr.usec = 0;
8205 rpc_stat->queue_time_min.sec = 9999999;
8206 rpc_stat->queue_time_min.usec = 9999999;
8207 rpc_stat->queue_time_max.sec = 0;
8208 rpc_stat->queue_time_max.usec = 0;
8209 rpc_stat->execution_time_sum.sec = 0;
8210 rpc_stat->execution_time_sum.usec = 0;
8211 rpc_stat->execution_time_sum_sqr.sec = 0;
8212 rpc_stat->execution_time_sum_sqr.usec = 0;
8213 rpc_stat->execution_time_min.sec = 9999999;
8214 rpc_stat->execution_time_min.usec = 9999999;
8215 rpc_stat->execution_time_max.sec = 0;
8216 rpc_stat->execution_time_max.usec = 0;
8220 * Given all of the information for a particular rpc
8221 * call, find or create (if requested) the stat structure for the rpc.
8224 * the queue of stats that will be updated with the new value
8226 * @param rxInterface
8227 * a unique number that identifies the rpc interface
8230 * the total number of functions in this interface. this is only
8231 * required if create is true
8234 * if true, this invocation was made to a server
8237 * the ip address of the remote host. this is only required if create
8238 * and addToPeerList are true
8241 * the port of the remote host. this is only required if create
8242 * and addToPeerList are true
8244 * @param addToPeerList
8245 * if != 0, add newly created stat to the global peer list
8248 * if a new stats structure is allocated, the counter will
8249 * be updated with the new number of allocated stat structures.
8250 * only required if create is true
8253 * if no stats structure exists, allocate one
8257 static rx_interface_stat_p
8258 rxi_FindRpcStat(struct opr_queue *stats, afs_uint32 rxInterface,
8259 afs_uint32 totalFunc, int isServer, afs_uint32 remoteHost,
8260 afs_uint32 remotePort, int addToPeerList,
8261 unsigned int *counter, int create)
8263 rx_interface_stat_p rpc_stat = NULL;
8264 struct opr_queue *cursor;
8267 * See if there's already a structure for this interface
8270 for (opr_queue_Scan(stats, cursor)) {
8271 rpc_stat = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8273 if ((rpc_stat->stats[0].interfaceId == rxInterface)
8274 && (rpc_stat->stats[0].remote_is_server == isServer))
8278 /* if they didn't ask us to create, we're done */
8280 if (opr_queue_IsEnd(stats, cursor))
8286 /* can't proceed without these */
8287 if (!totalFunc || !counter)
8291 * Didn't find a match so allocate a new structure and add it to the
8295 if (opr_queue_IsEnd(stats, cursor) || (rpc_stat == NULL)
8296 || (rpc_stat->stats[0].interfaceId != rxInterface)
8297 || (rpc_stat->stats[0].remote_is_server != isServer)) {
8302 sizeof(rx_interface_stat_t) +
8303 totalFunc * sizeof(rx_function_entry_v1_t);
8305 rpc_stat = rxi_Alloc(space);
8306 if (rpc_stat == NULL)
8309 *counter += totalFunc;
8310 for (i = 0; i < totalFunc; i++) {
8311 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8312 rpc_stat->stats[i].remote_peer = remoteHost;
8313 rpc_stat->stats[i].remote_port = remotePort;
8314 rpc_stat->stats[i].remote_is_server = isServer;
8315 rpc_stat->stats[i].interfaceId = rxInterface;
8316 rpc_stat->stats[i].func_total = totalFunc;
8317 rpc_stat->stats[i].func_index = i;
8319 opr_queue_Prepend(stats, &rpc_stat->entry);
8320 if (addToPeerList) {
8321 opr_queue_Prepend(&peerStats, &rpc_stat->entryPeers);
8328 rx_ClearProcessRPCStats(afs_int32 rxInterface)
8330 rx_interface_stat_p rpc_stat;
8333 if (rxInterface == -1)
8336 MUTEX_ENTER(&rx_rpc_stats);
8337 rpc_stat = rxi_FindRpcStat(&processStats, rxInterface, 0, 0,
8340 totalFunc = rpc_stat->stats[0].func_total;
8341 for (i = 0; i < totalFunc; i++)
8342 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8344 MUTEX_EXIT(&rx_rpc_stats);
8349 rx_ClearPeerRPCStats(afs_int32 rxInterface, afs_uint32 peerHost, afs_uint16 peerPort)
8351 rx_interface_stat_p rpc_stat;
8353 struct rx_peer * peer;
8355 if (rxInterface == -1)
8358 peer = rxi_FindPeer(peerHost, peerPort, 0);
8362 MUTEX_ENTER(&rx_rpc_stats);
8363 rpc_stat = rxi_FindRpcStat(&peer->rpcStats, rxInterface, 0, 1,
8366 totalFunc = rpc_stat->stats[0].func_total;
8367 for (i = 0; i < totalFunc; i++)
8368 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8370 MUTEX_EXIT(&rx_rpc_stats);
8375 rx_CopyProcessRPCStats(afs_uint64 op)
8377 rx_interface_stat_p rpc_stat;
8378 rx_function_entry_v1_p rpcop_stat =
8379 rxi_Alloc(sizeof(rx_function_entry_v1_t));
8380 int currentFunc = (op & MAX_AFS_UINT32);
8381 afs_int32 rxInterface = (op >> 32);
8383 if (!rxi_monitor_processStats)
8386 if (rxInterface == -1)
8389 if (rpcop_stat == NULL)
8392 MUTEX_ENTER(&rx_rpc_stats);
8393 rpc_stat = rxi_FindRpcStat(&processStats, rxInterface, 0, 0,
8396 memcpy(rpcop_stat, &(rpc_stat->stats[currentFunc]),
8397 sizeof(rx_function_entry_v1_t));
8398 MUTEX_EXIT(&rx_rpc_stats);
8400 rxi_Free(rpcop_stat, sizeof(rx_function_entry_v1_t));
8407 rx_CopyPeerRPCStats(afs_uint64 op, afs_uint32 peerHost, afs_uint16 peerPort)
8409 rx_interface_stat_p rpc_stat;
8410 rx_function_entry_v1_p rpcop_stat =
8411 rxi_Alloc(sizeof(rx_function_entry_v1_t));
8412 int currentFunc = (op & MAX_AFS_UINT32);
8413 afs_int32 rxInterface = (op >> 32);
8414 struct rx_peer *peer;
8416 if (!rxi_monitor_peerStats)
8419 if (rxInterface == -1)
8422 if (rpcop_stat == NULL)
8425 peer = rxi_FindPeer(peerHost, peerPort, 0);
8429 MUTEX_ENTER(&rx_rpc_stats);
8430 rpc_stat = rxi_FindRpcStat(&peer->rpcStats, rxInterface, 0, 1,
8433 memcpy(rpcop_stat, &(rpc_stat->stats[currentFunc]),
8434 sizeof(rx_function_entry_v1_t));
8435 MUTEX_EXIT(&rx_rpc_stats);
8437 rxi_Free(rpcop_stat, sizeof(rx_function_entry_v1_t));
8444 rx_ReleaseRPCStats(void *stats)
8447 rxi_Free(stats, sizeof(rx_function_entry_v1_t));
8451 * Given all of the information for a particular rpc
8452 * call, create (if needed) and update the stat totals for the rpc.
8455 * the queue of stats that will be updated with the new value
8457 * @param rxInterface
8458 * a unique number that identifies the rpc interface
8460 * @param currentFunc
8461 * the index of the function being invoked
8464 * the total number of functions in this interface
8467 * the amount of time this function waited for a thread
8470 * the amount of time this function invocation took to execute
8473 * the number bytes sent by this invocation
8476 * the number bytes received by this invocation
8479 * if true, this invocation was made to a server
8482 * the ip address of the remote host
8485 * the port of the remote host
8487 * @param addToPeerList
8488 * if != 0, add newly created stat to the global peer list
8491 * if a new stats structure is allocated, the counter will
8492 * be updated with the new number of allocated stat structures
8497 rxi_AddRpcStat(struct opr_queue *stats, afs_uint32 rxInterface,
8498 afs_uint32 currentFunc, afs_uint32 totalFunc,
8499 struct clock *queueTime, struct clock *execTime,
8500 afs_uint64 bytesSent, afs_uint64 bytesRcvd, int isServer,
8501 afs_uint32 remoteHost, afs_uint32 remotePort,
8502 int addToPeerList, unsigned int *counter)
8505 rx_interface_stat_p rpc_stat;
8507 rpc_stat = rxi_FindRpcStat(stats, rxInterface, totalFunc, isServer,
8508 remoteHost, remotePort, addToPeerList, counter,
8516 * Increment the stats for this function
8519 rpc_stat->stats[currentFunc].invocations++;
8520 rpc_stat->stats[currentFunc].bytes_sent += bytesSent;
8521 rpc_stat->stats[currentFunc].bytes_rcvd += bytesRcvd;
8522 clock_Add(&rpc_stat->stats[currentFunc].queue_time_sum, queueTime);
8523 clock_AddSq(&rpc_stat->stats[currentFunc].queue_time_sum_sqr, queueTime);
8524 if (clock_Lt(queueTime, &rpc_stat->stats[currentFunc].queue_time_min)) {
8525 rpc_stat->stats[currentFunc].queue_time_min = *queueTime;
8527 if (clock_Gt(queueTime, &rpc_stat->stats[currentFunc].queue_time_max)) {
8528 rpc_stat->stats[currentFunc].queue_time_max = *queueTime;
8530 clock_Add(&rpc_stat->stats[currentFunc].execution_time_sum, execTime);
8531 clock_AddSq(&rpc_stat->stats[currentFunc].execution_time_sum_sqr,
8533 if (clock_Lt(execTime, &rpc_stat->stats[currentFunc].execution_time_min)) {
8534 rpc_stat->stats[currentFunc].execution_time_min = *execTime;
8536 if (clock_Gt(execTime, &rpc_stat->stats[currentFunc].execution_time_max)) {
8537 rpc_stat->stats[currentFunc].execution_time_max = *execTime;
8545 rxi_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8546 afs_uint32 currentFunc, afs_uint32 totalFunc,
8547 struct clock *queueTime, struct clock *execTime,
8548 afs_uint64 bytesSent, afs_uint64 bytesRcvd,
8552 if (!(rxi_monitor_peerStats || rxi_monitor_processStats))
8555 MUTEX_ENTER(&rx_rpc_stats);
8557 if (rxi_monitor_peerStats) {
8558 MUTEX_ENTER(&peer->peer_lock);
8559 rxi_AddRpcStat(&peer->rpcStats, rxInterface, currentFunc, totalFunc,
8560 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8561 peer->host, peer->port, 1, &rxi_rpc_peer_stat_cnt);
8562 MUTEX_EXIT(&peer->peer_lock);
8565 if (rxi_monitor_processStats) {
8566 rxi_AddRpcStat(&processStats, rxInterface, currentFunc, totalFunc,
8567 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8568 0xffffffff, 0xffffffff, 0, &rxi_rpc_process_stat_cnt);
8571 MUTEX_EXIT(&rx_rpc_stats);
8575 * Increment the times and count for a particular rpc function.
8577 * Traditionally this call was invoked from rxgen stubs. Modern stubs
8578 * call rx_RecordCallStatistics instead, so the public version of this
8579 * function is left purely for legacy callers.
8582 * The peer who invoked the rpc
8584 * @param rxInterface
8585 * A unique number that identifies the rpc interface
8587 * @param currentFunc
8588 * The index of the function being invoked
8591 * The total number of functions in this interface
8594 * The amount of time this function waited for a thread
8597 * The amount of time this function invocation took to execute
8600 * The number bytes sent by this invocation
8603 * The number bytes received by this invocation
8606 * If true, this invocation was made to a server
8610 rx_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8611 afs_uint32 currentFunc, afs_uint32 totalFunc,
8612 struct clock *queueTime, struct clock *execTime,
8613 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd,
8619 sent64 = ((afs_uint64)bytesSent->high << 32) + bytesSent->low;
8620 rcvd64 = ((afs_uint64)bytesRcvd->high << 32) + bytesRcvd->low;
8622 rxi_IncrementTimeAndCount(peer, rxInterface, currentFunc, totalFunc,
8623 queueTime, execTime, sent64, rcvd64,
8630 * rx_MarshallProcessRPCStats - marshall an array of rpc statistics
8634 * IN callerVersion - the rpc stat version of the caller.
8636 * IN count - the number of entries to marshall.
8638 * IN stats - pointer to stats to be marshalled.
8640 * OUT ptr - Where to store the marshalled data.
8647 rx_MarshallProcessRPCStats(afs_uint32 callerVersion, int count,
8648 rx_function_entry_v1_t * stats, afs_uint32 ** ptrP)
8654 * We only support the first version
8656 for (ptr = *ptrP, i = 0; i < count; i++, stats++) {
8657 *(ptr++) = stats->remote_peer;
8658 *(ptr++) = stats->remote_port;
8659 *(ptr++) = stats->remote_is_server;
8660 *(ptr++) = stats->interfaceId;
8661 *(ptr++) = stats->func_total;
8662 *(ptr++) = stats->func_index;
8663 *(ptr++) = stats->invocations >> 32;
8664 *(ptr++) = stats->invocations & MAX_AFS_UINT32;
8665 *(ptr++) = stats->bytes_sent >> 32;
8666 *(ptr++) = stats->bytes_sent & MAX_AFS_UINT32;
8667 *(ptr++) = stats->bytes_rcvd >> 32;
8668 *(ptr++) = stats->bytes_rcvd & MAX_AFS_UINT32;
8669 *(ptr++) = stats->queue_time_sum.sec;
8670 *(ptr++) = stats->queue_time_sum.usec;
8671 *(ptr++) = stats->queue_time_sum_sqr.sec;
8672 *(ptr++) = stats->queue_time_sum_sqr.usec;
8673 *(ptr++) = stats->queue_time_min.sec;
8674 *(ptr++) = stats->queue_time_min.usec;
8675 *(ptr++) = stats->queue_time_max.sec;
8676 *(ptr++) = stats->queue_time_max.usec;
8677 *(ptr++) = stats->execution_time_sum.sec;
8678 *(ptr++) = stats->execution_time_sum.usec;
8679 *(ptr++) = stats->execution_time_sum_sqr.sec;
8680 *(ptr++) = stats->execution_time_sum_sqr.usec;
8681 *(ptr++) = stats->execution_time_min.sec;
8682 *(ptr++) = stats->execution_time_min.usec;
8683 *(ptr++) = stats->execution_time_max.sec;
8684 *(ptr++) = stats->execution_time_max.usec;
8690 * rx_RetrieveProcessRPCStats - retrieve all of the rpc statistics for
8695 * IN callerVersion - the rpc stat version of the caller
8697 * OUT myVersion - the rpc stat version of this function
8699 * OUT clock_sec - local time seconds
8701 * OUT clock_usec - local time microseconds
8703 * OUT allocSize - the number of bytes allocated to contain stats
8705 * OUT statCount - the number stats retrieved from this process.
8707 * OUT stats - the actual stats retrieved from this process.
8711 * Returns void. If successful, stats will != NULL.
8715 rx_RetrieveProcessRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8716 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8717 size_t * allocSize, afs_uint32 * statCount,
8718 afs_uint32 ** stats)
8728 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8731 * Check to see if stats are enabled
8734 MUTEX_ENTER(&rx_rpc_stats);
8735 if (!rxi_monitor_processStats) {
8736 MUTEX_EXIT(&rx_rpc_stats);
8740 clock_GetTime(&now);
8741 *clock_sec = now.sec;
8742 *clock_usec = now.usec;
8745 * Allocate the space based upon the caller version
8747 * If the client is at an older version than we are,
8748 * we return the statistic data in the older data format, but
8749 * we still return our version number so the client knows we
8750 * are maintaining more data than it can retrieve.
8753 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8754 space = rxi_rpc_process_stat_cnt * sizeof(rx_function_entry_v1_t);
8755 *statCount = rxi_rpc_process_stat_cnt;
8758 * This can't happen yet, but in the future version changes
8759 * can be handled by adding additional code here
8763 if (space > (size_t) 0) {
8765 ptr = *stats = rxi_Alloc(space);
8768 struct opr_queue *cursor;
8770 for (opr_queue_Scan(&processStats, cursor)) {
8771 struct rx_interface_stat *rpc_stat =
8772 opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8774 * Copy the data based upon the caller version
8776 rx_MarshallProcessRPCStats(callerVersion,
8777 rpc_stat->stats[0].func_total,
8778 rpc_stat->stats, &ptr);
8784 MUTEX_EXIT(&rx_rpc_stats);
8789 * rx_RetrievePeerRPCStats - retrieve all of the rpc statistics for the peers
8793 * IN callerVersion - the rpc stat version of the caller
8795 * OUT myVersion - the rpc stat version of this function
8797 * OUT clock_sec - local time seconds
8799 * OUT clock_usec - local time microseconds
8801 * OUT allocSize - the number of bytes allocated to contain stats
8803 * OUT statCount - the number of stats retrieved from the individual
8806 * OUT stats - the actual stats retrieved from the individual peer structures.
8810 * Returns void. If successful, stats will != NULL.
8814 rx_RetrievePeerRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8815 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8816 size_t * allocSize, afs_uint32 * statCount,
8817 afs_uint32 ** stats)
8827 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8830 * Check to see if stats are enabled
8833 MUTEX_ENTER(&rx_rpc_stats);
8834 if (!rxi_monitor_peerStats) {
8835 MUTEX_EXIT(&rx_rpc_stats);
8839 clock_GetTime(&now);
8840 *clock_sec = now.sec;
8841 *clock_usec = now.usec;
8844 * Allocate the space based upon the caller version
8846 * If the client is at an older version than we are,
8847 * we return the statistic data in the older data format, but
8848 * we still return our version number so the client knows we
8849 * are maintaining more data than it can retrieve.
8852 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8853 space = rxi_rpc_peer_stat_cnt * sizeof(rx_function_entry_v1_t);
8854 *statCount = rxi_rpc_peer_stat_cnt;
8857 * This can't happen yet, but in the future version changes
8858 * can be handled by adding additional code here
8862 if (space > (size_t) 0) {
8864 ptr = *stats = rxi_Alloc(space);
8867 struct opr_queue *cursor;
8869 for (opr_queue_Scan(&peerStats, cursor)) {
8870 struct rx_interface_stat *rpc_stat
8871 = opr_queue_Entry(cursor, struct rx_interface_stat,
8875 * Copy the data based upon the caller version
8877 rx_MarshallProcessRPCStats(callerVersion,
8878 rpc_stat->stats[0].func_total,
8879 rpc_stat->stats, &ptr);
8885 MUTEX_EXIT(&rx_rpc_stats);
8890 * rx_FreeRPCStats - free memory allocated by
8891 * rx_RetrieveProcessRPCStats and rx_RetrievePeerRPCStats
8895 * IN stats - stats previously returned by rx_RetrieveProcessRPCStats or
8896 * rx_RetrievePeerRPCStats
8898 * IN allocSize - the number of bytes in stats.
8906 rx_FreeRPCStats(afs_uint32 * stats, size_t allocSize)
8908 rxi_Free(stats, allocSize);
8912 * rx_queryProcessRPCStats - see if process rpc stat collection is
8913 * currently enabled.
8919 * Returns 0 if stats are not enabled != 0 otherwise
8923 rx_queryProcessRPCStats(void)
8926 MUTEX_ENTER(&rx_rpc_stats);
8927 rc = rxi_monitor_processStats;
8928 MUTEX_EXIT(&rx_rpc_stats);
8933 * rx_queryPeerRPCStats - see if peer stat collection is currently enabled.
8939 * Returns 0 if stats are not enabled != 0 otherwise
8943 rx_queryPeerRPCStats(void)
8946 MUTEX_ENTER(&rx_rpc_stats);
8947 rc = rxi_monitor_peerStats;
8948 MUTEX_EXIT(&rx_rpc_stats);
8953 * rx_enableProcessRPCStats - begin rpc stat collection for entire process
8963 rx_enableProcessRPCStats(void)
8965 MUTEX_ENTER(&rx_rpc_stats);
8966 rx_enable_stats = 1;
8967 rxi_monitor_processStats = 1;
8968 MUTEX_EXIT(&rx_rpc_stats);
8972 * rx_enablePeerRPCStats - begin rpc stat collection per peer structure
8982 rx_enablePeerRPCStats(void)
8984 MUTEX_ENTER(&rx_rpc_stats);
8985 rx_enable_stats = 1;
8986 rxi_monitor_peerStats = 1;
8987 MUTEX_EXIT(&rx_rpc_stats);
8991 * rx_disableProcessRPCStats - stop rpc stat collection for entire process
9001 rx_disableProcessRPCStats(void)
9003 struct opr_queue *cursor, *store;
9006 MUTEX_ENTER(&rx_rpc_stats);
9009 * Turn off process statistics and if peer stats is also off, turn
9013 rxi_monitor_processStats = 0;
9014 if (rxi_monitor_peerStats == 0) {
9015 rx_enable_stats = 0;
9018 for (opr_queue_ScanSafe(&processStats, cursor, store)) {
9019 unsigned int num_funcs = 0;
9020 struct rx_interface_stat *rpc_stat
9021 = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
9023 opr_queue_Remove(&rpc_stat->entry);
9025 num_funcs = rpc_stat->stats[0].func_total;
9027 sizeof(rx_interface_stat_t) +
9028 rpc_stat->stats[0].func_total * sizeof(rx_function_entry_v1_t);
9030 rxi_Free(rpc_stat, space);
9031 rxi_rpc_process_stat_cnt -= num_funcs;
9033 MUTEX_EXIT(&rx_rpc_stats);
9037 * rx_disablePeerRPCStats - stop rpc stat collection for peers
9047 rx_disablePeerRPCStats(void)
9049 struct rx_peer **peer_ptr, **peer_end;
9053 * Turn off peer statistics and if process stats is also off, turn
9057 rxi_monitor_peerStats = 0;
9058 if (rxi_monitor_processStats == 0) {
9059 rx_enable_stats = 0;
9062 for (peer_ptr = &rx_peerHashTable[0], peer_end =
9063 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
9065 struct rx_peer *peer, *next, *prev;
9067 MUTEX_ENTER(&rx_peerHashTable_lock);
9068 MUTEX_ENTER(&rx_rpc_stats);
9069 for (prev = peer = *peer_ptr; peer; peer = next) {
9071 code = MUTEX_TRYENTER(&peer->peer_lock);
9074 struct opr_queue *cursor, *store;
9076 if (prev == *peer_ptr) {
9087 MUTEX_EXIT(&rx_peerHashTable_lock);
9089 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
9090 unsigned int num_funcs = 0;
9091 struct rx_interface_stat *rpc_stat
9092 = opr_queue_Entry(cursor, struct rx_interface_stat,
9095 opr_queue_Remove(&rpc_stat->entry);
9096 opr_queue_Remove(&rpc_stat->entryPeers);
9097 num_funcs = rpc_stat->stats[0].func_total;
9099 sizeof(rx_interface_stat_t) +
9100 rpc_stat->stats[0].func_total *
9101 sizeof(rx_function_entry_v1_t);
9103 rxi_Free(rpc_stat, space);
9104 rxi_rpc_peer_stat_cnt -= num_funcs;
9106 MUTEX_EXIT(&peer->peer_lock);
9108 MUTEX_ENTER(&rx_peerHashTable_lock);
9118 MUTEX_EXIT(&rx_rpc_stats);
9119 MUTEX_EXIT(&rx_peerHashTable_lock);
9124 * rx_clearProcessRPCStats - clear the contents of the rpc stats according
9129 * IN clearFlag - flag indicating which stats to clear
9137 rx_clearProcessRPCStats(afs_uint32 clearFlag)
9139 struct opr_queue *cursor;
9141 MUTEX_ENTER(&rx_rpc_stats);
9143 for (opr_queue_Scan(&processStats, cursor)) {
9144 unsigned int num_funcs = 0, i;
9145 struct rx_interface_stat *rpc_stat
9146 = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
9148 num_funcs = rpc_stat->stats[0].func_total;
9149 for (i = 0; i < num_funcs; i++) {
9150 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
9151 rpc_stat->stats[i].invocations = 0;
9153 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
9154 rpc_stat->stats[i].bytes_sent = 0;
9156 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
9157 rpc_stat->stats[i].bytes_rcvd = 0;
9159 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9160 rpc_stat->stats[i].queue_time_sum.sec = 0;
9161 rpc_stat->stats[i].queue_time_sum.usec = 0;
9163 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9164 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9165 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9167 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9168 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9169 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9171 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9172 rpc_stat->stats[i].queue_time_max.sec = 0;
9173 rpc_stat->stats[i].queue_time_max.usec = 0;
9175 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9176 rpc_stat->stats[i].execution_time_sum.sec = 0;
9177 rpc_stat->stats[i].execution_time_sum.usec = 0;
9179 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9180 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9181 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9183 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9184 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9185 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9187 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9188 rpc_stat->stats[i].execution_time_max.sec = 0;
9189 rpc_stat->stats[i].execution_time_max.usec = 0;
9194 MUTEX_EXIT(&rx_rpc_stats);
9198 * rx_clearPeerRPCStats - clear the contents of the rpc stats according
9203 * IN clearFlag - flag indicating which stats to clear
9211 rx_clearPeerRPCStats(afs_uint32 clearFlag)
9213 struct opr_queue *cursor;
9215 MUTEX_ENTER(&rx_rpc_stats);
9217 for (opr_queue_Scan(&peerStats, cursor)) {
9218 unsigned int num_funcs, i;
9219 struct rx_interface_stat *rpc_stat
9220 = opr_queue_Entry(cursor, struct rx_interface_stat, entryPeers);
9222 num_funcs = rpc_stat->stats[0].func_total;
9223 for (i = 0; i < num_funcs; i++) {
9224 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
9225 rpc_stat->stats[i].invocations = 0;
9227 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
9228 rpc_stat->stats[i].bytes_sent = 0;
9230 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
9231 rpc_stat->stats[i].bytes_rcvd = 0;
9233 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9234 rpc_stat->stats[i].queue_time_sum.sec = 0;
9235 rpc_stat->stats[i].queue_time_sum.usec = 0;
9237 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9238 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9239 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9241 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9242 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9243 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9245 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9246 rpc_stat->stats[i].queue_time_max.sec = 0;
9247 rpc_stat->stats[i].queue_time_max.usec = 0;
9249 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9250 rpc_stat->stats[i].execution_time_sum.sec = 0;
9251 rpc_stat->stats[i].execution_time_sum.usec = 0;
9253 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9254 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9255 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9257 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9258 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9259 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9261 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9262 rpc_stat->stats[i].execution_time_max.sec = 0;
9263 rpc_stat->stats[i].execution_time_max.usec = 0;
9268 MUTEX_EXIT(&rx_rpc_stats);
9272 * rxi_rxstat_userok points to a routine that returns 1 if the caller
9273 * is authorized to enable/disable/clear RX statistics.
9275 static int (*rxi_rxstat_userok) (struct rx_call * call) = NULL;
9278 rx_SetRxStatUserOk(int (*proc) (struct rx_call * call))
9280 rxi_rxstat_userok = proc;
9284 rx_RxStatUserOk(struct rx_call *call)
9286 if (!rxi_rxstat_userok)
9288 return rxi_rxstat_userok(call);
9293 * DllMain() -- Entry-point function called by the DllMainCRTStartup()
9294 * function in the MSVC runtime DLL (msvcrt.dll).
9296 * Note: the system serializes calls to this function.
9299 DllMain(HINSTANCE dllInstHandle, /* instance handle for this DLL module */
9300 DWORD reason, /* reason function is being called */
9301 LPVOID reserved) /* reserved for future use */
9304 case DLL_PROCESS_ATTACH:
9305 /* library is being attached to a process */
9309 case DLL_PROCESS_DETACH:
9316 #endif /* AFS_NT40_ENV */
9319 int rx_DumpCalls(FILE *outputFile, char *cookie)
9321 #ifdef RXDEBUG_PACKET
9322 #ifdef KDUMP_RX_LOCK
9323 struct rx_call_rx_lock *c;
9330 #define RXDPRINTF sprintf
9331 #define RXDPRINTOUT output
9333 #define RXDPRINTF fprintf
9334 #define RXDPRINTOUT outputFile
9337 RXDPRINTF(RXDPRINTOUT, "%s - Start dumping all Rx Calls - count=%u\r\n", cookie, rx_stats.nCallStructs);
9339 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9342 for (c = rx_allCallsp; c; c = c->allNextp) {
9343 u_short rqc, tqc, iovqc;
9345 MUTEX_ENTER(&c->lock);
9346 rqc = opr_queue_Count(&c->rq);
9347 tqc = opr_queue_Count(&c->tq);
9348 iovqc = opr_queue_Count(&c->app.iovq);
9350 RXDPRINTF(RXDPRINTOUT, "%s - call=0x%p, id=%u, state=%u, mode=%u, conn=%p, epoch=%u, cid=%u, callNum=%u, connFlags=0x%x, flags=0x%x, "
9351 "rqc=%u,%u, tqc=%u,%u, iovqc=%u,%u, "
9352 "lstatus=%u, rstatus=%u, error=%d, timeout=%u, "
9353 "resendEvent=%d, keepAliveEvt=%d, delayedAckEvt=%d, delayedAbortEvt=%d, abortCode=%d, abortCount=%d, "
9354 "lastSendTime=%u, lastRecvTime=%u, lastSendData=%u"
9355 #ifdef RX_ENABLE_LOCKS
9358 #ifdef RX_REFCOUNT_CHECK
9359 ", refCountBegin=%u, refCountResend=%u, refCountDelay=%u, "
9360 "refCountAlive=%u, refCountPacket=%u, refCountSend=%u, refCountAckAll=%u, refCountAbort=%u"
9363 cookie, c, c->call_id, (afs_uint32)c->state, (afs_uint32)c->app.mode, c->conn, c->conn?c->conn->epoch:0, c->conn?c->conn->cid:0,
9364 c->callNumber?*c->callNumber:0, c->conn?c->conn->flags:0, c->flags,
9365 (afs_uint32)c->rqc, (afs_uint32)rqc, (afs_uint32)c->tqc, (afs_uint32)tqc, (afs_uint32)c->iovqc, (afs_uint32)iovqc,
9366 (afs_uint32)c->localStatus, (afs_uint32)c->remoteStatus, c->error, c->timeout,
9367 c->resendEvent?1:0, c->keepAliveEvent?1:0, c->delayedAckEvent?1:0, c->delayedAbortEvent?1:0,
9368 c->abortCode, c->abortCount, c->lastSendTime, c->lastReceiveTime, c->lastSendData
9369 #ifdef RX_ENABLE_LOCKS
9370 , (afs_uint32)c->refCount
9372 #ifdef RX_REFCOUNT_CHECK
9373 , c->refCDebug[0],c->refCDebug[1],c->refCDebug[2],c->refCDebug[3],c->refCDebug[4],c->refCDebug[5],c->refCDebug[6],c->refCDebug[7]
9376 MUTEX_EXIT(&c->lock);
9379 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9382 RXDPRINTF(RXDPRINTOUT, "%s - End dumping all Rx Calls\r\n", cookie);
9384 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9386 #endif /* RXDEBUG_PACKET */