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 static struct rx_packet
130 *rxi_ReceiveDataPacket(struct rx_call *call, struct rx_packet *np,
131 int istack, osi_socket socket,
132 afs_uint32 host, u_short port, int *tnop,
133 struct rx_call **newcallp);
134 static struct rx_packet
135 *rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
137 static struct rx_packet
138 *rxi_ReceiveResponsePacket(struct rx_connection *conn,
139 struct rx_packet *np, int istack);
140 static struct rx_packet
141 *rxi_ReceiveChallengePacket(struct rx_connection *conn,
142 struct rx_packet *np, int istack);
143 static void rxi_AttachServerProc(struct rx_call *call, osi_socket socket,
144 int *tnop, struct rx_call **newcallp);
145 static void rxi_ClearTransmitQueue(struct rx_call *call, int force);
146 static void rxi_ClearReceiveQueue(struct rx_call *call);
147 static void rxi_ResetCall(struct rx_call *call, int newcall);
148 static void rxi_ScheduleKeepAliveEvent(struct rx_call *call);
149 static void rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn);
150 static void rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs);
151 static void rxi_KeepAliveOn(struct rx_call *call);
152 static void rxi_GrowMTUOn(struct rx_call *call);
153 static void rxi_ChallengeOn(struct rx_connection *conn);
154 static int rxi_CheckCall(struct rx_call *call, int haveCTLock);
155 static void rxi_AckAllInTransmitQueue(struct rx_call *call);
157 #ifdef RX_ENABLE_LOCKS
159 rx_atomic_t rxi_start_aborted; /* rxi_start awoke after rxi_Send in error.*/
160 rx_atomic_t rxi_start_in_error;
162 #endif /* RX_ENABLE_LOCKS */
164 /* Constant delay time before sending an acknowledge of the last packet
165 * received. This is to avoid sending an extra acknowledge when the
166 * client is about to make another call, anyway, or the server is
169 * The lastAckDelay may not exceeed 400ms without causing peers to
170 * unecessarily timeout.
172 struct clock rx_lastAckDelay = {0, 400000};
174 /* Constant delay time before sending a soft ack when none was requested.
175 * This is to make sure we send soft acks before the sender times out,
176 * Normally we wait and send a hard ack when the receiver consumes the packet
178 * This value has been 100ms in all shipping versions of OpenAFS. Changing it
179 * will require changes to the peer's RTT calculations.
181 struct clock rx_softAckDelay = {0, 100000};
184 * rxi_rpc_peer_stat_cnt counts the total number of peer stat structures
185 * currently allocated within rx. This number is used to allocate the
186 * memory required to return the statistics when queried.
187 * Protected by the rx_rpc_stats mutex.
190 static unsigned int rxi_rpc_peer_stat_cnt;
193 * rxi_rpc_process_stat_cnt counts the total number of local process stat
194 * structures currently allocated within rx. The number is used to allocate
195 * the memory required to return the statistics when queried.
196 * Protected by the rx_rpc_stats mutex.
199 static unsigned int rxi_rpc_process_stat_cnt;
202 * rxi_busyChannelError is a boolean. It indicates whether or not RX_CALL_BUSY
203 * errors should be reported to the application when a call channel appears busy
204 * (inferred from the receipt of RX_PACKET_TYPE_BUSY packets on the channel),
205 * and there are other call channels in the connection that are not busy.
206 * If 0, we do not return errors upon receiving busy packets; we just keep
207 * trying on the same call channel until we hit a timeout.
209 static afs_int32 rxi_busyChannelError = 0;
211 rx_atomic_t rx_nWaiting = RX_ATOMIC_INIT(0);
212 rx_atomic_t rx_nWaited = RX_ATOMIC_INIT(0);
214 /* Incoming calls wait on this queue when there are no available
215 * server processes */
216 struct opr_queue rx_incomingCallQueue;
218 /* Server processes wait on this queue when there are no appropriate
219 * calls to process */
220 struct opr_queue rx_idleServerQueue;
222 #if !defined(offsetof)
223 #include <stddef.h> /* for definition of offsetof() */
226 #ifdef RX_ENABLE_LOCKS
227 afs_kmutex_t rx_atomic_mutex;
230 /* Forward prototypes */
231 static struct rx_call * rxi_NewCall(struct rx_connection *, int);
234 putConnection (struct rx_connection *conn) {
235 MUTEX_ENTER(&rx_refcnt_mutex);
237 MUTEX_EXIT(&rx_refcnt_mutex);
240 #ifdef AFS_PTHREAD_ENV
243 * Use procedural initialization of mutexes/condition variables
247 extern afs_kmutex_t rx_quota_mutex;
248 extern afs_kmutex_t rx_pthread_mutex;
249 extern afs_kmutex_t rx_packets_mutex;
250 extern afs_kmutex_t rx_refcnt_mutex;
251 extern afs_kmutex_t des_init_mutex;
252 extern afs_kmutex_t des_random_mutex;
253 extern afs_kmutex_t rx_clock_mutex;
254 extern afs_kmutex_t rxi_connCacheMutex;
255 extern afs_kmutex_t event_handler_mutex;
256 extern afs_kmutex_t listener_mutex;
257 extern afs_kmutex_t rx_if_init_mutex;
258 extern afs_kmutex_t rx_if_mutex;
260 extern afs_kcondvar_t rx_event_handler_cond;
261 extern afs_kcondvar_t rx_listener_cond;
263 static afs_kmutex_t epoch_mutex;
264 static afs_kmutex_t rx_init_mutex;
265 static afs_kmutex_t rx_debug_mutex;
266 static afs_kmutex_t rx_rpc_stats;
269 rxi_InitPthread(void)
271 MUTEX_INIT(&rx_clock_mutex, "clock", MUTEX_DEFAULT, 0);
272 MUTEX_INIT(&rx_stats_mutex, "stats", MUTEX_DEFAULT, 0);
273 MUTEX_INIT(&rx_atomic_mutex, "atomic", MUTEX_DEFAULT, 0);
274 MUTEX_INIT(&rx_quota_mutex, "quota", MUTEX_DEFAULT, 0);
275 MUTEX_INIT(&rx_pthread_mutex, "pthread", MUTEX_DEFAULT, 0);
276 MUTEX_INIT(&rx_packets_mutex, "packets", MUTEX_DEFAULT, 0);
277 MUTEX_INIT(&rx_refcnt_mutex, "refcnts", MUTEX_DEFAULT, 0);
278 MUTEX_INIT(&epoch_mutex, "epoch", MUTEX_DEFAULT, 0);
279 MUTEX_INIT(&rx_init_mutex, "init", MUTEX_DEFAULT, 0);
280 MUTEX_INIT(&event_handler_mutex, "event handler", MUTEX_DEFAULT, 0);
281 MUTEX_INIT(&rxi_connCacheMutex, "conn cache", MUTEX_DEFAULT, 0);
282 MUTEX_INIT(&listener_mutex, "listener", MUTEX_DEFAULT, 0);
283 MUTEX_INIT(&rx_if_init_mutex, "if init", MUTEX_DEFAULT, 0);
284 MUTEX_INIT(&rx_if_mutex, "if", MUTEX_DEFAULT, 0);
285 MUTEX_INIT(&rx_debug_mutex, "debug", MUTEX_DEFAULT, 0);
287 CV_INIT(&rx_event_handler_cond, "evhand", CV_DEFAULT, 0);
288 CV_INIT(&rx_listener_cond, "rxlisten", CV_DEFAULT, 0);
290 osi_Assert(pthread_key_create(&rx_thread_id_key, NULL) == 0);
291 osi_Assert(pthread_key_create(&rx_ts_info_key, NULL) == 0);
293 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
294 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
295 #ifdef RX_ENABLE_LOCKS
298 #endif /* RX_LOCKS_DB */
299 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
300 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
302 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
304 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
306 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
308 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
309 MUTEX_INIT(&rxi_keyCreate_lock, "rxi_keyCreate_lock", MUTEX_DEFAULT, 0);
310 #endif /* RX_ENABLE_LOCKS */
313 pthread_once_t rx_once_init = PTHREAD_ONCE_INIT;
314 #define INIT_PTHREAD_LOCKS osi_Assert(pthread_once(&rx_once_init, rxi_InitPthread)==0)
316 * The rx_stats_mutex mutex protects the following global variables:
317 * rxi_lowConnRefCount
318 * rxi_lowPeerRefCount
327 * The rx_quota_mutex mutex protects the following global variables:
335 * The rx_freePktQ_lock protects the following global variables:
340 * The rx_packets_mutex mutex protects the following global variables:
348 * The rx_pthread_mutex mutex protects the following global variables:
349 * rxi_fcfs_thread_num
352 #define INIT_PTHREAD_LOCKS
356 /* Variables for handling the minProcs implementation. availProcs gives the
357 * number of threads available in the pool at this moment (not counting dudes
358 * executing right now). totalMin gives the total number of procs required
359 * for handling all minProcs requests. minDeficit is a dynamic variable
360 * tracking the # of procs required to satisfy all of the remaining minProcs
362 * For fine grain locking to work, the quota check and the reservation of
363 * a server thread has to come while rxi_availProcs and rxi_minDeficit
364 * are locked. To this end, the code has been modified under #ifdef
365 * RX_ENABLE_LOCKS so that quota checks and reservation occur at the
366 * same time. A new function, ReturnToServerPool() returns the allocation.
368 * A call can be on several queue's (but only one at a time). When
369 * rxi_ResetCall wants to remove the call from a queue, it has to ensure
370 * that no one else is touching the queue. To this end, we store the address
371 * of the queue lock in the call structure (under the call lock) when we
372 * put the call on a queue, and we clear the call_queue_lock when the
373 * call is removed from a queue (once the call lock has been obtained).
374 * This allows rxi_ResetCall to safely synchronize with others wishing
375 * to manipulate the queue.
378 #if defined(RX_ENABLE_LOCKS)
379 static afs_kmutex_t rx_rpc_stats;
382 /* We keep a "last conn pointer" in rxi_FindConnection. The odds are
383 ** pretty good that the next packet coming in is from the same connection
384 ** as the last packet, since we're send multiple packets in a transmit window.
386 struct rx_connection *rxLastConn = 0;
388 #ifdef RX_ENABLE_LOCKS
389 /* The locking hierarchy for rx fine grain locking is composed of these
392 * rx_connHashTable_lock - synchronizes conn creation, rx_connHashTable access
393 * conn_call_lock - used to synchonize rx_EndCall and rx_NewCall
394 * call->lock - locks call data fields.
395 * These are independent of each other:
396 * rx_freeCallQueue_lock
401 * serverQueueEntry->lock
402 * rx_peerHashTable_lock - locked under rx_connHashTable_lock
404 * peer->lock - locks peer data fields.
405 * conn_data_lock - that more than one thread is not updating a conn data
406 * field at the same time.
417 * Do we need a lock to protect the peer field in the conn structure?
418 * conn->peer was previously a constant for all intents and so has no
419 * lock protecting this field. The multihomed client delta introduced
420 * a RX code change : change the peer field in the connection structure
421 * to that remote interface from which the last packet for this
422 * connection was sent out. This may become an issue if further changes
425 #define SET_CALL_QUEUE_LOCK(C, L) (C)->call_queue_lock = (L)
426 #define CLEAR_CALL_QUEUE_LOCK(C) (C)->call_queue_lock = NULL
428 /* rxdb_fileID is used to identify the lock location, along with line#. */
429 static int rxdb_fileID = RXDB_FILE_RX;
430 #endif /* RX_LOCKS_DB */
431 #else /* RX_ENABLE_LOCKS */
432 #define SET_CALL_QUEUE_LOCK(C, L)
433 #define CLEAR_CALL_QUEUE_LOCK(C)
434 #endif /* RX_ENABLE_LOCKS */
435 struct rx_serverQueueEntry *rx_waitForPacket = 0;
436 struct rx_serverQueueEntry *rx_waitingForPacket = 0;
438 /* ------------Exported Interfaces------------- */
440 /* This function allows rxkad to set the epoch to a suitably random number
441 * which rx_NewConnection will use in the future. The principle purpose is to
442 * get rxnull connections to use the same epoch as the rxkad connections do, at
443 * least once the first rxkad connection is established. This is important now
444 * that the host/port addresses aren't used in FindConnection: the uniqueness
445 * of epoch/cid matters and the start time won't do. */
447 #ifdef AFS_PTHREAD_ENV
449 * This mutex protects the following global variables:
453 #define LOCK_EPOCH MUTEX_ENTER(&epoch_mutex)
454 #define UNLOCK_EPOCH MUTEX_EXIT(&epoch_mutex)
458 #endif /* AFS_PTHREAD_ENV */
461 rx_SetEpoch(afs_uint32 epoch)
468 /* Initialize rx. A port number may be mentioned, in which case this
469 * becomes the default port number for any service installed later.
470 * If 0 is provided for the port number, a random port will be chosen
471 * by the kernel. Whether this will ever overlap anything in
472 * /etc/services is anybody's guess... Returns 0 on success, -1 on
477 int rxinit_status = 1;
478 #ifdef AFS_PTHREAD_ENV
480 * This mutex protects the following global variables:
484 #define LOCK_RX_INIT MUTEX_ENTER(&rx_init_mutex)
485 #define UNLOCK_RX_INIT MUTEX_EXIT(&rx_init_mutex)
488 #define UNLOCK_RX_INIT
492 rx_InitHost(u_int host, u_int port)
499 char *htable, *ptable;
506 if (rxinit_status == 0) {
507 tmp_status = rxinit_status;
509 return tmp_status; /* Already started; return previous error code. */
515 if (afs_winsockInit() < 0)
521 * Initialize anything necessary to provide a non-premptive threading
524 rxi_InitializeThreadSupport();
527 /* Allocate and initialize a socket for client and perhaps server
530 rx_socket = rxi_GetHostUDPSocket(host, (u_short) port);
531 if (rx_socket == OSI_NULLSOCKET) {
535 #if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
538 #endif /* RX_LOCKS_DB */
539 MUTEX_INIT(&rx_stats_mutex, "rx_stats_mutex", MUTEX_DEFAULT, 0);
540 MUTEX_INIT(&rx_quota_mutex, "rx_quota_mutex", MUTEX_DEFAULT, 0);
541 MUTEX_INIT(&rx_atomic_mutex, "rx_atomic_mutex", MUTEX_DEFAULT, 0);
542 MUTEX_INIT(&rx_pthread_mutex, "rx_pthread_mutex", MUTEX_DEFAULT, 0);
543 MUTEX_INIT(&rx_packets_mutex, "rx_packets_mutex", MUTEX_DEFAULT, 0);
544 MUTEX_INIT(&rx_refcnt_mutex, "rx_refcnt_mutex", MUTEX_DEFAULT, 0);
545 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
546 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
547 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
548 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
550 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
552 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
554 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
556 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
557 #if defined(AFS_HPUX110_ENV)
559 rx_sleepLock = alloc_spinlock(LAST_HELD_ORDER - 10, "rx_sleepLock");
560 #endif /* AFS_HPUX110_ENV */
561 #endif /* RX_ENABLE_LOCKS && KERNEL */
564 rx_connDeadTime = 12;
565 rx_tranquil = 0; /* reset flag */
566 rxi_ResetStatistics();
567 htable = osi_Alloc(rx_hashTableSize * sizeof(struct rx_connection *));
568 PIN(htable, rx_hashTableSize * sizeof(struct rx_connection *)); /* XXXXX */
569 memset(htable, 0, rx_hashTableSize * sizeof(struct rx_connection *));
570 ptable = osi_Alloc(rx_hashTableSize * sizeof(struct rx_peer *));
571 PIN(ptable, rx_hashTableSize * sizeof(struct rx_peer *)); /* XXXXX */
572 memset(ptable, 0, rx_hashTableSize * sizeof(struct rx_peer *));
574 /* Malloc up a bunch of packets & buffers */
576 opr_queue_Init(&rx_freePacketQueue);
577 rxi_NeedMorePackets = FALSE;
578 rx_nPackets = 0; /* rx_nPackets is managed by rxi_MorePackets* */
580 /* enforce a minimum number of allocated packets */
581 if (rx_extraPackets < rxi_nSendFrags * rx_maxSendWindow)
582 rx_extraPackets = rxi_nSendFrags * rx_maxSendWindow;
584 /* allocate the initial free packet pool */
585 #ifdef RX_ENABLE_TSFPQ
586 rxi_MorePacketsTSFPQ(rx_extraPackets + RX_MAX_QUOTA + 2, RX_TS_FPQ_FLUSH_GLOBAL, 0);
587 #else /* RX_ENABLE_TSFPQ */
588 rxi_MorePackets(rx_extraPackets + RX_MAX_QUOTA + 2); /* fudge */
589 #endif /* RX_ENABLE_TSFPQ */
596 #if defined(AFS_NT40_ENV) && !defined(AFS_PTHREAD_ENV)
597 tv.tv_sec = clock_now.sec;
598 tv.tv_usec = clock_now.usec;
599 srand((unsigned int)tv.tv_usec);
606 #if defined(KERNEL) && !defined(UKERNEL)
607 /* Really, this should never happen in a real kernel */
610 struct sockaddr_in addr;
612 int addrlen = sizeof(addr);
614 socklen_t addrlen = sizeof(addr);
616 if (getsockname((intptr_t)rx_socket, (struct sockaddr *)&addr, &addrlen)) {
618 osi_Free(htable, rx_hashTableSize * sizeof(struct rx_connection *));
621 rx_port = addr.sin_port;
624 rx_stats.minRtt.sec = 9999999;
626 rx_SetEpoch(tv.tv_sec | 0x80000000);
628 rx_SetEpoch(tv.tv_sec); /* Start time of this package, rxkad
629 * will provide a randomer value. */
631 MUTEX_ENTER(&rx_quota_mutex);
632 rxi_dataQuota += rx_extraQuota; /* + extra pkts caller asked to rsrv */
633 MUTEX_EXIT(&rx_quota_mutex);
634 /* *Slightly* random start time for the cid. This is just to help
635 * out with the hashing function at the peer */
636 rx_nextCid = ((tv.tv_sec ^ tv.tv_usec) << RX_CIDSHIFT);
637 rx_connHashTable = (struct rx_connection **)htable;
638 rx_peerHashTable = (struct rx_peer **)ptable;
640 rx_hardAckDelay.sec = 0;
641 rx_hardAckDelay.usec = 100000; /* 100 milliseconds */
643 rxevent_Init(20, rxi_ReScheduleEvents);
645 /* Initialize various global queues */
646 opr_queue_Init(&rx_idleServerQueue);
647 opr_queue_Init(&rx_incomingCallQueue);
648 opr_queue_Init(&rx_freeCallQueue);
650 #if defined(AFS_NT40_ENV) && !defined(KERNEL)
651 /* Initialize our list of usable IP addresses. */
655 #if defined(RXK_LISTENER_ENV) || !defined(KERNEL)
656 /* Start listener process (exact function is dependent on the
657 * implementation environment--kernel or user space) */
662 tmp_status = rxinit_status = 0;
670 return rx_InitHost(htonl(INADDR_ANY), port);
676 * The rxi_rto functions implement a TCP (RFC2988) style algorithm for
677 * maintaing the round trip timer.
682 * Start a new RTT timer for a given call and packet.
684 * There must be no resendEvent already listed for this call, otherwise this
685 * will leak events - intended for internal use within the RTO code only
688 * the RX call to start the timer for
689 * @param[in] lastPacket
690 * a flag indicating whether the last packet has been sent or not
692 * @pre call must be locked before calling this function
696 rxi_rto_startTimer(struct rx_call *call, int lastPacket, int istack)
698 struct clock now, retryTime;
703 clock_Add(&retryTime, &call->rto);
705 /* If we're sending the last packet, and we're the client, then the server
706 * may wait for an additional 400ms before returning the ACK, wait for it
707 * rather than hitting a timeout */
708 if (lastPacket && call->conn->type == RX_CLIENT_CONNECTION)
709 clock_Addmsec(&retryTime, 400);
711 CALL_HOLD(call, RX_CALL_REFCOUNT_RESEND);
712 call->resendEvent = rxevent_Post(&retryTime, &now, rxi_Resend,
717 * Cancel an RTT timer for a given call.
721 * the RX call to cancel the timer for
723 * @pre call must be locked before calling this function
728 rxi_rto_cancel(struct rx_call *call)
730 rxevent_Cancel(&call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
734 * Tell the RTO timer that we have sent a packet.
736 * If the timer isn't already running, then start it. If the timer is running,
740 * the RX call that the packet has been sent on
741 * @param[in] lastPacket
742 * A flag which is true if this is the last packet for the call
744 * @pre The call must be locked before calling this function
749 rxi_rto_packet_sent(struct rx_call *call, int lastPacket, int istack)
751 if (call->resendEvent)
754 rxi_rto_startTimer(call, lastPacket, istack);
758 * Tell the RTO timer that we have received an new ACK message
760 * This function should be called whenever a call receives an ACK that
761 * acknowledges new packets. Whatever happens, we stop the current timer.
762 * If there are unacked packets in the queue which have been sent, then
763 * we restart the timer from now. Otherwise, we leave it stopped.
766 * the RX call that the ACK has been received on
770 rxi_rto_packet_acked(struct rx_call *call, int istack)
772 struct opr_queue *cursor;
774 rxi_rto_cancel(call);
776 if (opr_queue_IsEmpty(&call->tq))
779 for (opr_queue_Scan(&call->tq, cursor)) {
780 struct rx_packet *p = opr_queue_Entry(cursor, struct rx_packet, entry);
781 if (p->header.seq > call->tfirst + call->twind)
784 if (!(p->flags & RX_PKTFLAG_ACKED) && p->flags & RX_PKTFLAG_SENT) {
785 rxi_rto_startTimer(call, p->header.flags & RX_LAST_PACKET, istack);
793 * Set an initial round trip timeout for a peer connection
795 * @param[in] secs The timeout to set in seconds
799 rx_rto_setPeerTimeoutSecs(struct rx_peer *peer, int secs) {
800 peer->rtt = secs * 8000;
804 * Enables or disables the busy call channel error (RX_CALL_BUSY).
806 * @param[in] onoff Non-zero to enable busy call channel errors.
808 * @pre Neither rx_Init nor rx_InitHost have been called yet
811 rx_SetBusyChannelError(afs_int32 onoff)
813 osi_Assert(rxinit_status != 0);
814 rxi_busyChannelError = onoff ? 1 : 0;
818 * Set a delayed ack event on the specified call for the given time
820 * @param[in] call - the call on which to set the event
821 * @param[in] offset - the delay from now after which the event fires
824 rxi_PostDelayedAckEvent(struct rx_call *call, struct clock *offset)
826 struct clock now, when;
830 clock_Add(&when, offset);
832 if (!call->delayedAckEvent
833 || clock_Gt(&call->delayedAckTime, &when)) {
835 rxevent_Cancel(&call->delayedAckEvent, call,
836 RX_CALL_REFCOUNT_DELAY);
837 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
839 call->delayedAckEvent = rxevent_Post(&when, &now,
842 call->delayedAckTime = when;
846 /* called with unincremented nRequestsRunning to see if it is OK to start
847 * a new thread in this service. Could be "no" for two reasons: over the
848 * max quota, or would prevent others from reaching their min quota.
850 #ifdef RX_ENABLE_LOCKS
851 /* This verion of QuotaOK reserves quota if it's ok while the
852 * rx_serverPool_lock is held. Return quota using ReturnToServerPool().
855 QuotaOK(struct rx_service *aservice)
857 /* check if over max quota */
858 if (aservice->nRequestsRunning >= aservice->maxProcs) {
862 /* under min quota, we're OK */
863 /* otherwise, can use only if there are enough to allow everyone
864 * to go to their min quota after this guy starts.
867 MUTEX_ENTER(&rx_quota_mutex);
868 if ((aservice->nRequestsRunning < aservice->minProcs)
869 || (rxi_availProcs > rxi_minDeficit)) {
870 aservice->nRequestsRunning++;
871 /* just started call in minProcs pool, need fewer to maintain
873 if (aservice->nRequestsRunning <= aservice->minProcs)
876 MUTEX_EXIT(&rx_quota_mutex);
879 MUTEX_EXIT(&rx_quota_mutex);
885 ReturnToServerPool(struct rx_service *aservice)
887 aservice->nRequestsRunning--;
888 MUTEX_ENTER(&rx_quota_mutex);
889 if (aservice->nRequestsRunning < aservice->minProcs)
892 MUTEX_EXIT(&rx_quota_mutex);
895 #else /* RX_ENABLE_LOCKS */
897 QuotaOK(struct rx_service *aservice)
900 /* under min quota, we're OK */
901 if (aservice->nRequestsRunning < aservice->minProcs)
904 /* check if over max quota */
905 if (aservice->nRequestsRunning >= aservice->maxProcs)
908 /* otherwise, can use only if there are enough to allow everyone
909 * to go to their min quota after this guy starts.
911 MUTEX_ENTER(&rx_quota_mutex);
912 if (rxi_availProcs > rxi_minDeficit)
914 MUTEX_EXIT(&rx_quota_mutex);
917 #endif /* RX_ENABLE_LOCKS */
920 /* Called by rx_StartServer to start up lwp's to service calls.
921 NExistingProcs gives the number of procs already existing, and which
922 therefore needn't be created. */
924 rxi_StartServerProcs(int nExistingProcs)
926 struct rx_service *service;
931 /* For each service, reserve N processes, where N is the "minimum"
932 * number of processes that MUST be able to execute a request in parallel,
933 * at any time, for that process. Also compute the maximum difference
934 * between any service's maximum number of processes that can run
935 * (i.e. the maximum number that ever will be run, and a guarantee
936 * that this number will run if other services aren't running), and its
937 * minimum number. The result is the extra number of processes that
938 * we need in order to provide the latter guarantee */
939 for (i = 0; i < RX_MAX_SERVICES; i++) {
941 service = rx_services[i];
942 if (service == (struct rx_service *)0)
944 nProcs += service->minProcs;
945 diff = service->maxProcs - service->minProcs;
949 nProcs += maxdiff; /* Extra processes needed to allow max number requested to run in any given service, under good conditions */
950 nProcs -= nExistingProcs; /* Subtract the number of procs that were previously created for use as server procs */
951 for (i = 0; i < nProcs; i++) {
952 rxi_StartServerProc(rx_ServerProc, rx_stackSize);
958 /* This routine is only required on Windows */
960 rx_StartClientThread(void)
962 #ifdef AFS_PTHREAD_ENV
964 pid = pthread_self();
965 #endif /* AFS_PTHREAD_ENV */
967 #endif /* AFS_NT40_ENV */
969 /* This routine must be called if any services are exported. If the
970 * donateMe flag is set, the calling process is donated to the server
973 rx_StartServer(int donateMe)
975 struct rx_service *service;
981 /* Start server processes, if necessary (exact function is dependent
982 * on the implementation environment--kernel or user space). DonateMe
983 * will be 1 if there is 1 pre-existing proc, i.e. this one. In this
984 * case, one less new proc will be created rx_StartServerProcs.
986 rxi_StartServerProcs(donateMe);
988 /* count up the # of threads in minProcs, and add set the min deficit to
989 * be that value, too.
991 for (i = 0; i < RX_MAX_SERVICES; i++) {
992 service = rx_services[i];
993 if (service == (struct rx_service *)0)
995 MUTEX_ENTER(&rx_quota_mutex);
996 rxi_totalMin += service->minProcs;
997 /* below works even if a thread is running, since minDeficit would
998 * still have been decremented and later re-incremented.
1000 rxi_minDeficit += service->minProcs;
1001 MUTEX_EXIT(&rx_quota_mutex);
1004 /* Turn on reaping of idle server connections */
1005 rxi_ReapConnections(NULL, NULL, NULL, 0);
1010 #ifndef AFS_NT40_ENV
1014 #ifdef AFS_PTHREAD_ENV
1016 pid = afs_pointer_to_int(pthread_self());
1017 #else /* AFS_PTHREAD_ENV */
1019 LWP_CurrentProcess(&pid);
1020 #endif /* AFS_PTHREAD_ENV */
1022 sprintf(name, "srv_%d", ++nProcs);
1023 if (registerProgram)
1024 (*registerProgram) (pid, name);
1026 #endif /* AFS_NT40_ENV */
1027 rx_ServerProc(NULL); /* Never returns */
1029 #ifdef RX_ENABLE_TSFPQ
1030 /* no use leaving packets around in this thread's local queue if
1031 * it isn't getting donated to the server thread pool.
1033 rxi_FlushLocalPacketsTSFPQ();
1034 #endif /* RX_ENABLE_TSFPQ */
1038 /* Create a new client connection to the specified service, using the
1039 * specified security object to implement the security model for this
1041 struct rx_connection *
1042 rx_NewConnection(afs_uint32 shost, u_short sport, u_short sservice,
1043 struct rx_securityClass *securityObject,
1044 int serviceSecurityIndex)
1048 struct rx_connection *conn;
1053 dpf(("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
1054 "serviceSecurityIndex %d)\n",
1055 ntohl(shost), ntohs(sport), sservice, securityObject,
1056 serviceSecurityIndex));
1058 /* Vasilsi said: "NETPRI protects Cid and Alloc", but can this be true in
1059 * the case of kmem_alloc? */
1060 conn = rxi_AllocConnection();
1061 #ifdef RX_ENABLE_LOCKS
1062 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
1063 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
1064 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
1067 MUTEX_ENTER(&rx_connHashTable_lock);
1068 cid = (rx_nextCid += RX_MAXCALLS);
1069 conn->type = RX_CLIENT_CONNECTION;
1071 conn->epoch = rx_epoch;
1072 conn->peer = rxi_FindPeer(shost, sport, 0, 1);
1073 conn->serviceId = sservice;
1074 conn->securityObject = securityObject;
1075 conn->securityData = (void *) 0;
1076 conn->securityIndex = serviceSecurityIndex;
1077 rx_SetConnDeadTime(conn, rx_connDeadTime);
1078 rx_SetConnSecondsUntilNatPing(conn, 0);
1079 conn->ackRate = RX_FAST_ACK_RATE;
1080 conn->nSpecific = 0;
1081 conn->specific = NULL;
1082 conn->challengeEvent = NULL;
1083 conn->delayedAbortEvent = NULL;
1084 conn->abortCount = 0;
1086 for (i = 0; i < RX_MAXCALLS; i++) {
1087 conn->twind[i] = rx_initSendWindow;
1088 conn->rwind[i] = rx_initReceiveWindow;
1089 conn->lastBusy[i] = 0;
1092 RXS_NewConnection(securityObject, conn);
1094 CONN_HASH(shost, sport, conn->cid, conn->epoch, RX_CLIENT_CONNECTION);
1096 conn->refCount++; /* no lock required since only this thread knows... */
1097 conn->next = rx_connHashTable[hashindex];
1098 rx_connHashTable[hashindex] = conn;
1099 if (rx_stats_active)
1100 rx_atomic_inc(&rx_stats.nClientConns);
1101 MUTEX_EXIT(&rx_connHashTable_lock);
1107 * Ensure a connection's timeout values are valid.
1109 * @param[in] conn The connection to check
1111 * @post conn->secondUntilDead <= conn->idleDeadTime <= conn->hardDeadTime,
1112 * unless idleDeadTime and/or hardDeadTime are not set
1116 rxi_CheckConnTimeouts(struct rx_connection *conn)
1118 /* a connection's timeouts must have the relationship
1119 * deadTime <= idleDeadTime <= hardDeadTime. Otherwise, for example, a
1120 * total loss of network to a peer may cause an idle timeout instead of a
1121 * dead timeout, simply because the idle timeout gets hit first. Also set
1122 * a minimum deadTime of 6, just to ensure it doesn't get set too low. */
1123 /* this logic is slightly complicated by the fact that
1124 * idleDeadTime/hardDeadTime may not be set at all, but it's not too bad.
1126 conn->secondsUntilDead = MAX(conn->secondsUntilDead, 6);
1127 if (conn->idleDeadTime) {
1128 conn->idleDeadTime = MAX(conn->idleDeadTime, conn->secondsUntilDead);
1130 if (conn->hardDeadTime) {
1131 if (conn->idleDeadTime) {
1132 conn->hardDeadTime = MAX(conn->idleDeadTime, conn->hardDeadTime);
1134 conn->hardDeadTime = MAX(conn->secondsUntilDead, conn->hardDeadTime);
1140 rx_SetConnDeadTime(struct rx_connection *conn, int seconds)
1142 /* The idea is to set the dead time to a value that allows several
1143 * keepalives to be dropped without timing out the connection. */
1144 conn->secondsUntilDead = seconds;
1145 rxi_CheckConnTimeouts(conn);
1146 conn->secondsUntilPing = conn->secondsUntilDead / 6;
1150 rx_SetConnHardDeadTime(struct rx_connection *conn, int seconds)
1152 conn->hardDeadTime = seconds;
1153 rxi_CheckConnTimeouts(conn);
1157 rx_SetConnIdleDeadTime(struct rx_connection *conn, int seconds)
1159 conn->idleDeadTime = seconds;
1160 conn->idleDeadDetection = (seconds ? 1 : 0);
1161 rxi_CheckConnTimeouts(conn);
1164 int rxi_lowPeerRefCount = 0;
1165 int rxi_lowConnRefCount = 0;
1168 * Cleanup a connection that was destroyed in rxi_DestroyConnectioNoLock.
1169 * NOTE: must not be called with rx_connHashTable_lock held.
1172 rxi_CleanupConnection(struct rx_connection *conn)
1174 /* Notify the service exporter, if requested, that this connection
1175 * is being destroyed */
1176 if (conn->type == RX_SERVER_CONNECTION && conn->service->destroyConnProc)
1177 (*conn->service->destroyConnProc) (conn);
1179 /* Notify the security module that this connection is being destroyed */
1180 RXS_DestroyConnection(conn->securityObject, conn);
1182 /* If this is the last connection using the rx_peer struct, set its
1183 * idle time to now. rxi_ReapConnections will reap it if it's still
1184 * idle (refCount == 0) after rx_idlePeerTime (60 seconds) have passed.
1186 MUTEX_ENTER(&rx_peerHashTable_lock);
1187 if (conn->peer->refCount < 2) {
1188 conn->peer->idleWhen = clock_Sec();
1189 if (conn->peer->refCount < 1) {
1190 conn->peer->refCount = 1;
1191 if (rx_stats_active) {
1192 MUTEX_ENTER(&rx_stats_mutex);
1193 rxi_lowPeerRefCount++;
1194 MUTEX_EXIT(&rx_stats_mutex);
1198 conn->peer->refCount--;
1199 MUTEX_EXIT(&rx_peerHashTable_lock);
1201 if (rx_stats_active)
1203 if (conn->type == RX_SERVER_CONNECTION)
1204 rx_atomic_dec(&rx_stats.nServerConns);
1206 rx_atomic_dec(&rx_stats.nClientConns);
1209 if (conn->specific) {
1211 for (i = 0; i < conn->nSpecific; i++) {
1212 if (conn->specific[i] && rxi_keyCreate_destructor[i])
1213 (*rxi_keyCreate_destructor[i]) (conn->specific[i]);
1214 conn->specific[i] = NULL;
1216 free(conn->specific);
1218 conn->specific = NULL;
1219 conn->nSpecific = 0;
1220 #endif /* !KERNEL */
1222 MUTEX_DESTROY(&conn->conn_call_lock);
1223 MUTEX_DESTROY(&conn->conn_data_lock);
1224 CV_DESTROY(&conn->conn_call_cv);
1226 rxi_FreeConnection(conn);
1229 /* Destroy the specified connection */
1231 rxi_DestroyConnection(struct rx_connection *conn)
1233 MUTEX_ENTER(&rx_connHashTable_lock);
1234 rxi_DestroyConnectionNoLock(conn);
1235 /* conn should be at the head of the cleanup list */
1236 if (conn == rx_connCleanup_list) {
1237 rx_connCleanup_list = rx_connCleanup_list->next;
1238 MUTEX_EXIT(&rx_connHashTable_lock);
1239 rxi_CleanupConnection(conn);
1241 #ifdef RX_ENABLE_LOCKS
1243 MUTEX_EXIT(&rx_connHashTable_lock);
1245 #endif /* RX_ENABLE_LOCKS */
1249 rxi_DestroyConnectionNoLock(struct rx_connection *conn)
1251 struct rx_connection **conn_ptr;
1253 struct rx_packet *packet;
1260 MUTEX_ENTER(&conn->conn_data_lock);
1261 MUTEX_ENTER(&rx_refcnt_mutex);
1262 if (conn->refCount > 0)
1265 if (rx_stats_active) {
1266 MUTEX_ENTER(&rx_stats_mutex);
1267 rxi_lowConnRefCount++;
1268 MUTEX_EXIT(&rx_stats_mutex);
1272 if ((conn->refCount > 0) || (conn->flags & RX_CONN_BUSY)) {
1273 /* Busy; wait till the last guy before proceeding */
1274 MUTEX_EXIT(&rx_refcnt_mutex);
1275 MUTEX_EXIT(&conn->conn_data_lock);
1280 /* If the client previously called rx_NewCall, but it is still
1281 * waiting, treat this as a running call, and wait to destroy the
1282 * connection later when the call completes. */
1283 if ((conn->type == RX_CLIENT_CONNECTION)
1284 && (conn->flags & (RX_CONN_MAKECALL_WAITING|RX_CONN_MAKECALL_ACTIVE))) {
1285 conn->flags |= RX_CONN_DESTROY_ME;
1286 MUTEX_EXIT(&conn->conn_data_lock);
1290 MUTEX_EXIT(&rx_refcnt_mutex);
1291 MUTEX_EXIT(&conn->conn_data_lock);
1293 /* Check for extant references to this connection */
1294 MUTEX_ENTER(&conn->conn_call_lock);
1295 for (i = 0; i < RX_MAXCALLS; i++) {
1296 struct rx_call *call = conn->call[i];
1299 if (conn->type == RX_CLIENT_CONNECTION) {
1300 MUTEX_ENTER(&call->lock);
1301 if (call->delayedAckEvent) {
1302 /* Push the final acknowledgment out now--there
1303 * won't be a subsequent call to acknowledge the
1304 * last reply packets */
1305 rxevent_Cancel(&call->delayedAckEvent, call,
1306 RX_CALL_REFCOUNT_DELAY);
1307 if (call->state == RX_STATE_PRECALL
1308 || call->state == RX_STATE_ACTIVE) {
1309 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1314 MUTEX_EXIT(&call->lock);
1318 MUTEX_EXIT(&conn->conn_call_lock);
1320 #ifdef RX_ENABLE_LOCKS
1322 if (MUTEX_TRYENTER(&conn->conn_data_lock)) {
1323 MUTEX_EXIT(&conn->conn_data_lock);
1325 /* Someone is accessing a packet right now. */
1329 #endif /* RX_ENABLE_LOCKS */
1332 /* Don't destroy the connection if there are any call
1333 * structures still in use */
1334 MUTEX_ENTER(&conn->conn_data_lock);
1335 conn->flags |= RX_CONN_DESTROY_ME;
1336 MUTEX_EXIT(&conn->conn_data_lock);
1341 if (conn->natKeepAliveEvent) {
1342 rxi_NatKeepAliveOff(conn);
1345 if (conn->delayedAbortEvent) {
1346 rxevent_Cancel(&conn->delayedAbortEvent, NULL, 0);
1347 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
1349 MUTEX_ENTER(&conn->conn_data_lock);
1350 rxi_SendConnectionAbort(conn, packet, 0, 1);
1351 MUTEX_EXIT(&conn->conn_data_lock);
1352 rxi_FreePacket(packet);
1356 /* Remove from connection hash table before proceeding */
1358 &rx_connHashTable[CONN_HASH
1359 (peer->host, peer->port, conn->cid, conn->epoch,
1361 for (; *conn_ptr; conn_ptr = &(*conn_ptr)->next) {
1362 if (*conn_ptr == conn) {
1363 *conn_ptr = conn->next;
1367 /* if the conn that we are destroying was the last connection, then we
1368 * clear rxLastConn as well */
1369 if (rxLastConn == conn)
1372 /* Make sure the connection is completely reset before deleting it. */
1373 /* get rid of pending events that could zap us later */
1374 rxevent_Cancel(&conn->challengeEvent, NULL, 0);
1375 rxevent_Cancel(&conn->checkReachEvent, NULL, 0);
1376 rxevent_Cancel(&conn->natKeepAliveEvent, NULL, 0);
1378 /* Add the connection to the list of destroyed connections that
1379 * need to be cleaned up. This is necessary to avoid deadlocks
1380 * in the routines we call to inform others that this connection is
1381 * being destroyed. */
1382 conn->next = rx_connCleanup_list;
1383 rx_connCleanup_list = conn;
1386 /* Externally available version */
1388 rx_DestroyConnection(struct rx_connection *conn)
1393 rxi_DestroyConnection(conn);
1398 rx_GetConnection(struct rx_connection *conn)
1403 MUTEX_ENTER(&rx_refcnt_mutex);
1405 MUTEX_EXIT(&rx_refcnt_mutex);
1409 #ifdef RX_ENABLE_LOCKS
1410 /* Wait for the transmit queue to no longer be busy.
1411 * requires the call->lock to be held */
1413 rxi_WaitforTQBusy(struct rx_call *call) {
1414 while (!call->error && (call->flags & RX_CALL_TQ_BUSY)) {
1415 call->flags |= RX_CALL_TQ_WAIT;
1417 MUTEX_ASSERT(&call->lock);
1418 CV_WAIT(&call->cv_tq, &call->lock);
1420 if (call->tqWaiters == 0) {
1421 call->flags &= ~RX_CALL_TQ_WAIT;
1428 rxi_WakeUpTransmitQueue(struct rx_call *call)
1430 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
1431 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",
1432 call, call->tqWaiters, call->flags));
1433 #ifdef RX_ENABLE_LOCKS
1434 MUTEX_ASSERT(&call->lock);
1435 CV_BROADCAST(&call->cv_tq);
1436 #else /* RX_ENABLE_LOCKS */
1437 osi_rxWakeup(&call->tq);
1438 #endif /* RX_ENABLE_LOCKS */
1442 /* Start a new rx remote procedure call, on the specified connection.
1443 * If wait is set to 1, wait for a free call channel; otherwise return
1444 * 0. Maxtime gives the maximum number of seconds this call may take,
1445 * after rx_NewCall returns. After this time interval, a call to any
1446 * of rx_SendData, rx_ReadData, etc. will fail with RX_CALL_TIMEOUT.
1447 * For fine grain locking, we hold the conn_call_lock in order to
1448 * to ensure that we don't get signalle after we found a call in an active
1449 * state and before we go to sleep.
1452 rx_NewCall(struct rx_connection *conn)
1454 int i, wait, ignoreBusy = 1;
1455 struct rx_call *call;
1456 struct clock queueTime;
1457 afs_uint32 leastBusy = 0;
1461 dpf(("rx_NewCall(conn %"AFS_PTR_FMT")\n", conn));
1464 clock_GetTime(&queueTime);
1466 * Check if there are others waiting for a new call.
1467 * If so, let them go first to avoid starving them.
1468 * This is a fairly simple scheme, and might not be
1469 * a complete solution for large numbers of waiters.
1471 * makeCallWaiters keeps track of the number of
1472 * threads waiting to make calls and the
1473 * RX_CONN_MAKECALL_WAITING flag bit is used to
1474 * indicate that there are indeed calls waiting.
1475 * The flag is set when the waiter is incremented.
1476 * It is only cleared when makeCallWaiters is 0.
1477 * This prevents us from accidently destroying the
1478 * connection while it is potentially about to be used.
1480 MUTEX_ENTER(&conn->conn_call_lock);
1481 MUTEX_ENTER(&conn->conn_data_lock);
1482 while (conn->flags & RX_CONN_MAKECALL_ACTIVE) {
1483 conn->flags |= RX_CONN_MAKECALL_WAITING;
1484 conn->makeCallWaiters++;
1485 MUTEX_EXIT(&conn->conn_data_lock);
1487 #ifdef RX_ENABLE_LOCKS
1488 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1492 MUTEX_ENTER(&conn->conn_data_lock);
1493 conn->makeCallWaiters--;
1494 if (conn->makeCallWaiters == 0)
1495 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1498 /* We are now the active thread in rx_NewCall */
1499 conn->flags |= RX_CONN_MAKECALL_ACTIVE;
1500 MUTEX_EXIT(&conn->conn_data_lock);
1505 for (i = 0; i < RX_MAXCALLS; i++) {
1506 call = conn->call[i];
1508 if (!ignoreBusy && conn->lastBusy[i] != leastBusy) {
1509 /* we're not ignoring busy call slots; only look at the
1510 * call slot that is the "least" busy */
1514 if (call->state == RX_STATE_DALLY) {
1515 MUTEX_ENTER(&call->lock);
1516 if (call->state == RX_STATE_DALLY) {
1517 if (ignoreBusy && conn->lastBusy[i]) {
1518 /* if we're ignoring busy call slots, skip any ones that
1519 * have lastBusy set */
1520 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1521 leastBusy = conn->lastBusy[i];
1523 MUTEX_EXIT(&call->lock);
1528 * We are setting the state to RX_STATE_RESET to
1529 * ensure that no one else will attempt to use this
1530 * call once we drop the conn->conn_call_lock and
1531 * call->lock. We must drop the conn->conn_call_lock
1532 * before calling rxi_ResetCall because the process
1533 * of clearing the transmit queue can block for an
1534 * extended period of time. If we block while holding
1535 * the conn->conn_call_lock, then all rx_EndCall
1536 * processing will block as well. This has a detrimental
1537 * effect on overall system performance.
1539 call->state = RX_STATE_RESET;
1540 (*call->callNumber)++;
1541 MUTEX_EXIT(&conn->conn_call_lock);
1542 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1543 rxi_ResetCall(call, 0);
1544 if (MUTEX_TRYENTER(&conn->conn_call_lock))
1548 * If we failed to be able to safely obtain the
1549 * conn->conn_call_lock we will have to drop the
1550 * call->lock to avoid a deadlock. When the call->lock
1551 * is released the state of the call can change. If it
1552 * is no longer RX_STATE_RESET then some other thread is
1555 MUTEX_EXIT(&call->lock);
1556 MUTEX_ENTER(&conn->conn_call_lock);
1557 MUTEX_ENTER(&call->lock);
1559 if (call->state == RX_STATE_RESET)
1563 * If we get here it means that after dropping
1564 * the conn->conn_call_lock and call->lock that
1565 * the call is no longer ours. If we can't find
1566 * a free call in the remaining slots we should
1567 * not go immediately to RX_CONN_MAKECALL_WAITING
1568 * because by dropping the conn->conn_call_lock
1569 * we have given up synchronization with rx_EndCall.
1570 * Instead, cycle through one more time to see if
1571 * we can find a call that can call our own.
1573 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
1576 MUTEX_EXIT(&call->lock);
1579 if (ignoreBusy && conn->lastBusy[i]) {
1580 /* if we're ignoring busy call slots, skip any ones that
1581 * have lastBusy set */
1582 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1583 leastBusy = conn->lastBusy[i];
1588 /* rxi_NewCall returns with mutex locked */
1589 call = rxi_NewCall(conn, i);
1590 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1594 if (i < RX_MAXCALLS) {
1595 conn->lastBusy[i] = 0;
1596 call->flags &= ~RX_CALL_PEER_BUSY;
1601 if (leastBusy && ignoreBusy) {
1602 /* we didn't find a useable call slot, but we did see at least one
1603 * 'busy' slot; look again and only use a slot with the 'least
1609 MUTEX_ENTER(&conn->conn_data_lock);
1610 conn->flags |= RX_CONN_MAKECALL_WAITING;
1611 conn->makeCallWaiters++;
1612 MUTEX_EXIT(&conn->conn_data_lock);
1614 #ifdef RX_ENABLE_LOCKS
1615 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1619 MUTEX_ENTER(&conn->conn_data_lock);
1620 conn->makeCallWaiters--;
1621 if (conn->makeCallWaiters == 0)
1622 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1623 MUTEX_EXIT(&conn->conn_data_lock);
1625 /* Client is initially in send mode */
1626 call->state = RX_STATE_ACTIVE;
1627 call->error = conn->error;
1629 call->app.mode = RX_MODE_ERROR;
1631 call->app.mode = RX_MODE_SENDING;
1633 #ifdef AFS_RXERRQ_ENV
1634 /* remember how many network errors the peer has when we started, so if
1635 * more errors are encountered after the call starts, we know the other endpoint won't be
1636 * responding to us */
1637 call->neterr_gen = rx_atomic_read(&conn->peer->neterrs);
1640 /* remember start time for call in case we have hard dead time limit */
1641 call->queueTime = queueTime;
1642 clock_GetTime(&call->startTime);
1643 call->app.bytesSent = 0;
1644 call->app.bytesRcvd = 0;
1646 /* Turn on busy protocol. */
1647 rxi_KeepAliveOn(call);
1649 /* Attempt MTU discovery */
1650 rxi_GrowMTUOn(call);
1653 * We are no longer the active thread in rx_NewCall
1655 MUTEX_ENTER(&conn->conn_data_lock);
1656 conn->flags &= ~RX_CONN_MAKECALL_ACTIVE;
1657 MUTEX_EXIT(&conn->conn_data_lock);
1660 * Wake up anyone else who might be giving us a chance to
1661 * run (see code above that avoids resource starvation).
1663 #ifdef RX_ENABLE_LOCKS
1664 if (call->flags & (RX_CALL_TQ_BUSY | RX_CALL_TQ_CLEARME)) {
1665 osi_Panic("rx_NewCall call about to be used without an empty tq");
1668 CV_BROADCAST(&conn->conn_call_cv);
1672 MUTEX_EXIT(&conn->conn_call_lock);
1673 MUTEX_EXIT(&call->lock);
1676 dpf(("rx_NewCall(call %"AFS_PTR_FMT")\n", call));
1681 rxi_HasActiveCalls(struct rx_connection *aconn)
1684 struct rx_call *tcall;
1688 for (i = 0; i < RX_MAXCALLS; i++) {
1689 if ((tcall = aconn->call[i])) {
1690 if ((tcall->state == RX_STATE_ACTIVE)
1691 || (tcall->state == RX_STATE_PRECALL)) {
1702 rxi_GetCallNumberVector(struct rx_connection *aconn,
1703 afs_int32 * aint32s)
1706 struct rx_call *tcall;
1710 MUTEX_ENTER(&aconn->conn_call_lock);
1711 for (i = 0; i < RX_MAXCALLS; i++) {
1712 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1713 aint32s[i] = aconn->callNumber[i] + 1;
1715 aint32s[i] = aconn->callNumber[i];
1717 MUTEX_EXIT(&aconn->conn_call_lock);
1723 rxi_SetCallNumberVector(struct rx_connection *aconn,
1724 afs_int32 * aint32s)
1727 struct rx_call *tcall;
1731 MUTEX_ENTER(&aconn->conn_call_lock);
1732 for (i = 0; i < RX_MAXCALLS; i++) {
1733 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1734 aconn->callNumber[i] = aint32s[i] - 1;
1736 aconn->callNumber[i] = aint32s[i];
1738 MUTEX_EXIT(&aconn->conn_call_lock);
1743 /* Advertise a new service. A service is named locally by a UDP port
1744 * number plus a 16-bit service id. Returns (struct rx_service *) 0
1747 char *serviceName; Name for identification purposes (e.g. the
1748 service name might be used for probing for
1751 rx_NewServiceHost(afs_uint32 host, u_short port, u_short serviceId,
1752 char *serviceName, struct rx_securityClass **securityObjects,
1753 int nSecurityObjects,
1754 afs_int32(*serviceProc) (struct rx_call * acall))
1756 osi_socket socket = OSI_NULLSOCKET;
1757 struct rx_service *tservice;
1763 if (serviceId == 0) {
1765 "rx_NewService: service id for service %s is not non-zero.\n",
1772 "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",
1780 tservice = rxi_AllocService();
1783 MUTEX_INIT(&tservice->svc_data_lock, "svc data lock", MUTEX_DEFAULT, 0);
1785 for (i = 0; i < RX_MAX_SERVICES; i++) {
1786 struct rx_service *service = rx_services[i];
1788 if (port == service->servicePort && host == service->serviceHost) {
1789 if (service->serviceId == serviceId) {
1790 /* The identical service has already been
1791 * installed; if the caller was intending to
1792 * change the security classes used by this
1793 * service, he/she loses. */
1795 "rx_NewService: tried to install service %s with service id %d, which is already in use for service %s\n",
1796 serviceName, serviceId, service->serviceName);
1798 rxi_FreeService(tservice);
1801 /* Different service, same port: re-use the socket
1802 * which is bound to the same port */
1803 socket = service->socket;
1806 if (socket == OSI_NULLSOCKET) {
1807 /* If we don't already have a socket (from another
1808 * service on same port) get a new one */
1809 socket = rxi_GetHostUDPSocket(host, port);
1810 if (socket == OSI_NULLSOCKET) {
1812 rxi_FreeService(tservice);
1817 service->socket = socket;
1818 service->serviceHost = host;
1819 service->servicePort = port;
1820 service->serviceId = serviceId;
1821 service->serviceName = serviceName;
1822 service->nSecurityObjects = nSecurityObjects;
1823 service->securityObjects = securityObjects;
1824 service->minProcs = 0;
1825 service->maxProcs = 1;
1826 service->idleDeadTime = 60;
1827 service->idleDeadErr = 0;
1828 service->connDeadTime = rx_connDeadTime;
1829 service->executeRequestProc = serviceProc;
1830 service->checkReach = 0;
1831 service->nSpecific = 0;
1832 service->specific = NULL;
1833 rx_services[i] = service; /* not visible until now */
1839 rxi_FreeService(tservice);
1840 (osi_Msg "rx_NewService: cannot support > %d services\n",
1845 /* Set configuration options for all of a service's security objects */
1848 rx_SetSecurityConfiguration(struct rx_service *service,
1849 rx_securityConfigVariables type,
1853 for (i = 0; i<service->nSecurityObjects; i++) {
1854 if (service->securityObjects[i]) {
1855 RXS_SetConfiguration(service->securityObjects[i], NULL, type,
1863 rx_NewService(u_short port, u_short serviceId, char *serviceName,
1864 struct rx_securityClass **securityObjects, int nSecurityObjects,
1865 afs_int32(*serviceProc) (struct rx_call * acall))
1867 return rx_NewServiceHost(htonl(INADDR_ANY), port, serviceId, serviceName, securityObjects, nSecurityObjects, serviceProc);
1870 /* Generic request processing loop. This routine should be called
1871 * by the implementation dependent rx_ServerProc. If socketp is
1872 * non-null, it will be set to the file descriptor that this thread
1873 * is now listening on. If socketp is null, this routine will never
1876 rxi_ServerProc(int threadID, struct rx_call *newcall, osi_socket * socketp)
1878 struct rx_call *call;
1880 struct rx_service *tservice = NULL;
1887 call = rx_GetCall(threadID, tservice, socketp);
1888 if (socketp && *socketp != OSI_NULLSOCKET) {
1889 /* We are now a listener thread */
1895 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1896 #ifdef RX_ENABLE_LOCKS
1898 #endif /* RX_ENABLE_LOCKS */
1899 afs_termState = AFSOP_STOP_AFS;
1900 afs_osi_Wakeup(&afs_termState);
1901 #ifdef RX_ENABLE_LOCKS
1903 #endif /* RX_ENABLE_LOCKS */
1908 /* if server is restarting( typically smooth shutdown) then do not
1909 * allow any new calls.
1912 if (rx_tranquil && (call != NULL)) {
1916 MUTEX_ENTER(&call->lock);
1918 rxi_CallError(call, RX_RESTARTING);
1919 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1921 MUTEX_EXIT(&call->lock);
1926 tservice = call->conn->service;
1928 if (tservice->beforeProc)
1929 (*tservice->beforeProc) (call);
1931 code = tservice->executeRequestProc(call);
1933 if (tservice->afterProc)
1934 (*tservice->afterProc) (call, code);
1936 rx_EndCall(call, code);
1938 if (tservice->postProc)
1939 (*tservice->postProc) (code);
1941 if (rx_stats_active) {
1942 MUTEX_ENTER(&rx_stats_mutex);
1944 MUTEX_EXIT(&rx_stats_mutex);
1951 rx_WakeupServerProcs(void)
1953 struct rx_serverQueueEntry *np, *tqp;
1954 struct opr_queue *cursor;
1958 MUTEX_ENTER(&rx_serverPool_lock);
1960 #ifdef RX_ENABLE_LOCKS
1961 if (rx_waitForPacket)
1962 CV_BROADCAST(&rx_waitForPacket->cv);
1963 #else /* RX_ENABLE_LOCKS */
1964 if (rx_waitForPacket)
1965 osi_rxWakeup(rx_waitForPacket);
1966 #endif /* RX_ENABLE_LOCKS */
1967 MUTEX_ENTER(&freeSQEList_lock);
1968 for (np = rx_FreeSQEList; np; np = tqp) {
1969 tqp = *(struct rx_serverQueueEntry **)np;
1970 #ifdef RX_ENABLE_LOCKS
1971 CV_BROADCAST(&np->cv);
1972 #else /* RX_ENABLE_LOCKS */
1974 #endif /* RX_ENABLE_LOCKS */
1976 MUTEX_EXIT(&freeSQEList_lock);
1977 for (opr_queue_Scan(&rx_idleServerQueue, cursor)) {
1978 np = opr_queue_Entry(cursor, struct rx_serverQueueEntry, entry);
1979 #ifdef RX_ENABLE_LOCKS
1980 CV_BROADCAST(&np->cv);
1981 #else /* RX_ENABLE_LOCKS */
1983 #endif /* RX_ENABLE_LOCKS */
1985 MUTEX_EXIT(&rx_serverPool_lock);
1990 * One thing that seems to happen is that all the server threads get
1991 * tied up on some empty or slow call, and then a whole bunch of calls
1992 * arrive at once, using up the packet pool, so now there are more
1993 * empty calls. The most critical resources here are server threads
1994 * and the free packet pool. The "doreclaim" code seems to help in
1995 * general. I think that eventually we arrive in this state: there
1996 * are lots of pending calls which do have all their packets present,
1997 * so they won't be reclaimed, are multi-packet calls, so they won't
1998 * be scheduled until later, and thus are tying up most of the free
1999 * packet pool for a very long time.
2001 * 1. schedule multi-packet calls if all the packets are present.
2002 * Probably CPU-bound operation, useful to return packets to pool.
2003 * Do what if there is a full window, but the last packet isn't here?
2004 * 3. preserve one thread which *only* runs "best" calls, otherwise
2005 * it sleeps and waits for that type of call.
2006 * 4. Don't necessarily reserve a whole window for each thread. In fact,
2007 * the current dataquota business is badly broken. The quota isn't adjusted
2008 * to reflect how many packets are presently queued for a running call.
2009 * So, when we schedule a queued call with a full window of packets queued
2010 * up for it, that *should* free up a window full of packets for other 2d-class
2011 * calls to be able to use from the packet pool. But it doesn't.
2013 * NB. Most of the time, this code doesn't run -- since idle server threads
2014 * sit on the idle server queue and are assigned by "...ReceivePacket" as soon
2015 * as a new call arrives.
2017 /* Sleep until a call arrives. Returns a pointer to the call, ready
2018 * for an rx_Read. */
2019 #ifdef RX_ENABLE_LOCKS
2021 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2023 struct rx_serverQueueEntry *sq;
2024 struct rx_call *call = (struct rx_call *)0;
2025 struct rx_service *service = NULL;
2027 MUTEX_ENTER(&freeSQEList_lock);
2029 if ((sq = rx_FreeSQEList)) {
2030 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2031 MUTEX_EXIT(&freeSQEList_lock);
2032 } else { /* otherwise allocate a new one and return that */
2033 MUTEX_EXIT(&freeSQEList_lock);
2034 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2035 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2036 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2039 MUTEX_ENTER(&rx_serverPool_lock);
2040 if (cur_service != NULL) {
2041 ReturnToServerPool(cur_service);
2044 if (!opr_queue_IsEmpty(&rx_incomingCallQueue)) {
2045 struct rx_call *tcall, *choice2 = NULL;
2046 struct opr_queue *cursor;
2048 /* Scan for eligible incoming calls. A call is not eligible
2049 * if the maximum number of calls for its service type are
2050 * already executing */
2051 /* One thread will process calls FCFS (to prevent starvation),
2052 * while the other threads may run ahead looking for calls which
2053 * have all their input data available immediately. This helps
2054 * keep threads from blocking, waiting for data from the client. */
2055 for (opr_queue_Scan(&rx_incomingCallQueue, cursor)) {
2056 tcall = opr_queue_Entry(cursor, struct rx_call, entry);
2058 service = tcall->conn->service;
2059 if (!QuotaOK(service)) {
2062 MUTEX_ENTER(&rx_pthread_mutex);
2063 if (tno == rxi_fcfs_thread_num
2064 || opr_queue_IsEnd(&rx_incomingCallQueue, cursor)) {
2065 MUTEX_EXIT(&rx_pthread_mutex);
2066 /* If we're the fcfs thread , then we'll just use
2067 * this call. If we haven't been able to find an optimal
2068 * choice, and we're at the end of the list, then use a
2069 * 2d choice if one has been identified. Otherwise... */
2070 call = (choice2 ? choice2 : tcall);
2071 service = call->conn->service;
2073 MUTEX_EXIT(&rx_pthread_mutex);
2074 if (!opr_queue_IsEmpty(&tcall->rq)) {
2075 struct rx_packet *rp;
2076 rp = opr_queue_First(&tcall->rq, struct rx_packet,
2078 if (rp->header.seq == 1) {
2080 || (rp->header.flags & RX_LAST_PACKET)) {
2082 } else if (rxi_2dchoice && !choice2
2083 && !(tcall->flags & RX_CALL_CLEARED)
2084 && (tcall->rprev > rxi_HardAckRate)) {
2094 ReturnToServerPool(service);
2100 opr_queue_Remove(&call->entry);
2101 MUTEX_EXIT(&rx_serverPool_lock);
2102 MUTEX_ENTER(&call->lock);
2104 if (call->flags & RX_CALL_WAIT_PROC) {
2105 call->flags &= ~RX_CALL_WAIT_PROC;
2106 rx_atomic_dec(&rx_nWaiting);
2109 if (call->state != RX_STATE_PRECALL || call->error) {
2110 MUTEX_EXIT(&call->lock);
2111 MUTEX_ENTER(&rx_serverPool_lock);
2112 ReturnToServerPool(service);
2117 if (opr_queue_IsEmpty(&call->rq)
2118 || opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq != 1)
2119 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2121 CLEAR_CALL_QUEUE_LOCK(call);
2124 /* If there are no eligible incoming calls, add this process
2125 * to the idle server queue, to wait for one */
2129 *socketp = OSI_NULLSOCKET;
2131 sq->socketp = socketp;
2132 opr_queue_Append(&rx_idleServerQueue, &sq->entry);
2133 #ifndef AFS_AIX41_ENV
2134 rx_waitForPacket = sq;
2136 rx_waitingForPacket = sq;
2137 #endif /* AFS_AIX41_ENV */
2139 CV_WAIT(&sq->cv, &rx_serverPool_lock);
2141 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2142 MUTEX_EXIT(&rx_serverPool_lock);
2143 return (struct rx_call *)0;
2146 } while (!(call = sq->newcall)
2147 && !(socketp && *socketp != OSI_NULLSOCKET));
2148 MUTEX_EXIT(&rx_serverPool_lock);
2150 MUTEX_ENTER(&call->lock);
2156 MUTEX_ENTER(&freeSQEList_lock);
2157 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2158 rx_FreeSQEList = sq;
2159 MUTEX_EXIT(&freeSQEList_lock);
2162 clock_GetTime(&call->startTime);
2163 call->state = RX_STATE_ACTIVE;
2164 call->app.mode = RX_MODE_RECEIVING;
2165 #ifdef RX_KERNEL_TRACE
2166 if (ICL_SETACTIVE(afs_iclSetp)) {
2167 int glockOwner = ISAFS_GLOCK();
2170 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2171 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2178 rxi_calltrace(RX_CALL_START, call);
2179 dpf(("rx_GetCall(port=%d, service=%d) ==> call %"AFS_PTR_FMT"\n",
2180 call->conn->service->servicePort, call->conn->service->serviceId,
2183 MUTEX_EXIT(&call->lock);
2184 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
2186 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2191 #else /* RX_ENABLE_LOCKS */
2193 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2195 struct rx_serverQueueEntry *sq;
2196 struct rx_call *call = (struct rx_call *)0, *choice2;
2197 struct rx_service *service = NULL;
2201 MUTEX_ENTER(&freeSQEList_lock);
2203 if ((sq = rx_FreeSQEList)) {
2204 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2205 MUTEX_EXIT(&freeSQEList_lock);
2206 } else { /* otherwise allocate a new one and return that */
2207 MUTEX_EXIT(&freeSQEList_lock);
2208 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2209 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2210 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2212 MUTEX_ENTER(&sq->lock);
2214 if (cur_service != NULL) {
2215 cur_service->nRequestsRunning--;
2216 MUTEX_ENTER(&rx_quota_mutex);
2217 if (cur_service->nRequestsRunning < cur_service->minProcs)
2220 MUTEX_EXIT(&rx_quota_mutex);
2222 if (!opr_queue_IsEmpty(&rx_incomingCallQueue)) {
2223 struct rx_call *tcall;
2224 struct opr_queue *cursor;
2225 /* Scan for eligible incoming calls. A call is not eligible
2226 * if the maximum number of calls for its service type are
2227 * already executing */
2228 /* One thread will process calls FCFS (to prevent starvation),
2229 * while the other threads may run ahead looking for calls which
2230 * have all their input data available immediately. This helps
2231 * keep threads from blocking, waiting for data from the client. */
2232 choice2 = (struct rx_call *)0;
2233 for (opr_queue_Scan(&rx_incomingCallQueue, cursor)) {
2234 tcall = opr_queue_Entry(cursor, struct rx_call, entry);
2235 service = tcall->conn->service;
2236 if (QuotaOK(service)) {
2237 MUTEX_ENTER(&rx_pthread_mutex);
2238 /* XXX - If tcall->entry.next is NULL, then we're no longer
2239 * on a queue at all. This shouldn't happen. */
2240 if (tno == rxi_fcfs_thread_num || !tcall->entry.next) {
2241 MUTEX_EXIT(&rx_pthread_mutex);
2242 /* If we're the fcfs thread, then we'll just use
2243 * this call. If we haven't been able to find an optimal
2244 * choice, and we're at the end of the list, then use a
2245 * 2d choice if one has been identified. Otherwise... */
2246 call = (choice2 ? choice2 : tcall);
2247 service = call->conn->service;
2249 MUTEX_EXIT(&rx_pthread_mutex);
2250 if (!opr_queue_IsEmpty(&tcall->rq)) {
2251 struct rx_packet *rp;
2252 rp = opr_queue_First(&tcall->rq, struct rx_packet,
2254 if (rp->header.seq == 1
2256 || (rp->header.flags & RX_LAST_PACKET))) {
2258 } else if (rxi_2dchoice && !choice2
2259 && !(tcall->flags & RX_CALL_CLEARED)
2260 && (tcall->rprev > rxi_HardAckRate)) {
2273 opr_queue_Remove(&call->entry);
2274 /* we can't schedule a call if there's no data!!! */
2275 /* send an ack if there's no data, if we're missing the
2276 * first packet, or we're missing something between first
2277 * and last -- there's a "hole" in the incoming data. */
2278 if (opr_queue_IsEmpty(&call->rq)
2279 || opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq != 1
2280 || call->rprev != opr_queue_Last(&call->rq, struct rx_packet, entry)->header.seq)
2281 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2283 call->flags &= (~RX_CALL_WAIT_PROC);
2284 service->nRequestsRunning++;
2285 /* just started call in minProcs pool, need fewer to maintain
2287 MUTEX_ENTER(&rx_quota_mutex);
2288 if (service->nRequestsRunning <= service->minProcs)
2291 MUTEX_EXIT(&rx_quota_mutex);
2292 rx_atomic_dec(&rx_nWaiting);
2293 /* MUTEX_EXIT(&call->lock); */
2295 /* If there are no eligible incoming calls, add this process
2296 * to the idle server queue, to wait for one */
2299 *socketp = OSI_NULLSOCKET;
2301 sq->socketp = socketp;
2302 opr_queue_Append(&rx_idleServerQueue, &sq->entry);
2306 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2308 rxi_Free(sq, sizeof(struct rx_serverQueueEntry));
2309 return (struct rx_call *)0;
2312 } while (!(call = sq->newcall)
2313 && !(socketp && *socketp != OSI_NULLSOCKET));
2315 MUTEX_EXIT(&sq->lock);
2317 MUTEX_ENTER(&freeSQEList_lock);
2318 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2319 rx_FreeSQEList = sq;
2320 MUTEX_EXIT(&freeSQEList_lock);
2323 clock_GetTime(&call->startTime);
2324 call->state = RX_STATE_ACTIVE;
2325 call->app.mode = RX_MODE_RECEIVING;
2326 #ifdef RX_KERNEL_TRACE
2327 if (ICL_SETACTIVE(afs_iclSetp)) {
2328 int glockOwner = ISAFS_GLOCK();
2331 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2332 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2339 rxi_calltrace(RX_CALL_START, call);
2340 dpf(("rx_GetCall(port=%d, service=%d) ==> call %p\n",
2341 call->conn->service->servicePort, call->conn->service->serviceId,
2344 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2351 #endif /* RX_ENABLE_LOCKS */
2355 /* Establish a procedure to be called when a packet arrives for a
2356 * call. This routine will be called at most once after each call,
2357 * and will also be called if there is an error condition on the or
2358 * the call is complete. Used by multi rx to build a selection
2359 * function which determines which of several calls is likely to be a
2360 * good one to read from.
2361 * NOTE: the way this is currently implemented it is probably only a
2362 * good idea to (1) use it immediately after a newcall (clients only)
2363 * and (2) only use it once. Other uses currently void your warranty
2366 rx_SetArrivalProc(struct rx_call *call,
2367 void (*proc) (struct rx_call * call,
2370 void * handle, int arg)
2372 call->arrivalProc = proc;
2373 call->arrivalProcHandle = handle;
2374 call->arrivalProcArg = arg;
2377 /* Call is finished (possibly prematurely). Return rc to the peer, if
2378 * appropriate, and return the final error code from the conversation
2382 rx_EndCall(struct rx_call *call, afs_int32 rc)
2384 struct rx_connection *conn = call->conn;
2388 dpf(("rx_EndCall(call %"AFS_PTR_FMT" rc %d error %d abortCode %d)\n",
2389 call, rc, call->error, call->abortCode));
2392 MUTEX_ENTER(&call->lock);
2394 if (rc == 0 && call->error == 0) {
2395 call->abortCode = 0;
2396 call->abortCount = 0;
2399 call->arrivalProc = (void (*)())0;
2400 if (rc && call->error == 0) {
2401 rxi_CallError(call, rc);
2402 call->app.mode = RX_MODE_ERROR;
2403 /* Send an abort message to the peer if this error code has
2404 * only just been set. If it was set previously, assume the
2405 * peer has already been sent the error code or will request it
2407 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
2409 if (conn->type == RX_SERVER_CONNECTION) {
2410 /* Make sure reply or at least dummy reply is sent */
2411 if (call->app.mode == RX_MODE_RECEIVING) {
2412 MUTEX_EXIT(&call->lock);
2413 rxi_WriteProc(call, 0, 0);
2414 MUTEX_ENTER(&call->lock);
2416 if (call->app.mode == RX_MODE_SENDING) {
2417 MUTEX_EXIT(&call->lock);
2418 rxi_FlushWrite(call);
2419 MUTEX_ENTER(&call->lock);
2421 rxi_calltrace(RX_CALL_END, call);
2422 /* Call goes to hold state until reply packets are acknowledged */
2423 if (call->tfirst + call->nSoftAcked < call->tnext) {
2424 call->state = RX_STATE_HOLD;
2426 call->state = RX_STATE_DALLY;
2427 rxi_ClearTransmitQueue(call, 0);
2428 rxi_rto_cancel(call);
2429 rxevent_Cancel(&call->keepAliveEvent, call,
2430 RX_CALL_REFCOUNT_ALIVE);
2432 } else { /* Client connection */
2434 /* Make sure server receives input packets, in the case where
2435 * no reply arguments are expected */
2437 if ((call->app.mode == RX_MODE_SENDING)
2438 || (call->app.mode == RX_MODE_RECEIVING && call->rnext == 1)) {
2439 MUTEX_EXIT(&call->lock);
2440 (void)rxi_ReadProc(call, &dummy, 1);
2441 MUTEX_ENTER(&call->lock);
2444 /* If we had an outstanding delayed ack, be nice to the server
2445 * and force-send it now.
2447 if (call->delayedAckEvent) {
2448 rxevent_Cancel(&call->delayedAckEvent, call,
2449 RX_CALL_REFCOUNT_DELAY);
2450 rxi_SendDelayedAck(NULL, call, NULL, 0);
2453 /* We need to release the call lock since it's lower than the
2454 * conn_call_lock and we don't want to hold the conn_call_lock
2455 * over the rx_ReadProc call. The conn_call_lock needs to be held
2456 * here for the case where rx_NewCall is perusing the calls on
2457 * the connection structure. We don't want to signal until
2458 * rx_NewCall is in a stable state. Otherwise, rx_NewCall may
2459 * have checked this call, found it active and by the time it
2460 * goes to sleep, will have missed the signal.
2462 MUTEX_EXIT(&call->lock);
2463 MUTEX_ENTER(&conn->conn_call_lock);
2464 MUTEX_ENTER(&call->lock);
2466 if (!(call->flags & RX_CALL_PEER_BUSY)) {
2467 conn->lastBusy[call->channel] = 0;
2470 MUTEX_ENTER(&conn->conn_data_lock);
2471 conn->flags |= RX_CONN_BUSY;
2472 if (conn->flags & RX_CONN_MAKECALL_WAITING) {
2473 MUTEX_EXIT(&conn->conn_data_lock);
2474 #ifdef RX_ENABLE_LOCKS
2475 CV_BROADCAST(&conn->conn_call_cv);
2480 #ifdef RX_ENABLE_LOCKS
2482 MUTEX_EXIT(&conn->conn_data_lock);
2484 #endif /* RX_ENABLE_LOCKS */
2485 call->state = RX_STATE_DALLY;
2487 error = call->error;
2489 /* currentPacket, nLeft, and NFree must be zeroed here, because
2490 * ResetCall cannot: ResetCall may be called at splnet(), in the
2491 * kernel version, and may interrupt the macros rx_Read or
2492 * rx_Write, which run at normal priority for efficiency. */
2493 if (call->app.currentPacket) {
2494 #ifdef RX_TRACK_PACKETS
2495 call->app.currentPacket->flags &= ~RX_PKTFLAG_CP;
2497 rxi_FreePacket(call->app.currentPacket);
2498 call->app.currentPacket = (struct rx_packet *)0;
2501 call->app.nLeft = call->app.nFree = call->app.curlen = 0;
2503 /* Free any packets from the last call to ReadvProc/WritevProc */
2504 #ifdef RXDEBUG_PACKET
2506 #endif /* RXDEBUG_PACKET */
2507 rxi_FreePackets(0, &call->app.iovq);
2508 MUTEX_EXIT(&call->lock);
2510 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
2511 if (conn->type == RX_CLIENT_CONNECTION) {
2512 MUTEX_ENTER(&conn->conn_data_lock);
2513 conn->flags &= ~RX_CONN_BUSY;
2514 MUTEX_EXIT(&conn->conn_data_lock);
2515 MUTEX_EXIT(&conn->conn_call_lock);
2519 * Map errors to the local host's errno.h format.
2521 error = ntoh_syserr_conv(error);
2525 #if !defined(KERNEL)
2527 /* Call this routine when shutting down a server or client (especially
2528 * clients). This will allow Rx to gracefully garbage collect server
2529 * connections, and reduce the number of retries that a server might
2530 * make to a dead client.
2531 * This is not quite right, since some calls may still be ongoing and
2532 * we can't lock them to destroy them. */
2536 struct rx_connection **conn_ptr, **conn_end;
2540 if (rxinit_status == 1) {
2542 return; /* Already shutdown. */
2544 rxi_DeleteCachedConnections();
2545 if (rx_connHashTable) {
2546 MUTEX_ENTER(&rx_connHashTable_lock);
2547 for (conn_ptr = &rx_connHashTable[0], conn_end =
2548 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
2550 struct rx_connection *conn, *next;
2551 for (conn = *conn_ptr; conn; conn = next) {
2553 if (conn->type == RX_CLIENT_CONNECTION) {
2554 MUTEX_ENTER(&rx_refcnt_mutex);
2556 MUTEX_EXIT(&rx_refcnt_mutex);
2557 #ifdef RX_ENABLE_LOCKS
2558 rxi_DestroyConnectionNoLock(conn);
2559 #else /* RX_ENABLE_LOCKS */
2560 rxi_DestroyConnection(conn);
2561 #endif /* RX_ENABLE_LOCKS */
2565 #ifdef RX_ENABLE_LOCKS
2566 while (rx_connCleanup_list) {
2567 struct rx_connection *conn;
2568 conn = rx_connCleanup_list;
2569 rx_connCleanup_list = rx_connCleanup_list->next;
2570 MUTEX_EXIT(&rx_connHashTable_lock);
2571 rxi_CleanupConnection(conn);
2572 MUTEX_ENTER(&rx_connHashTable_lock);
2574 MUTEX_EXIT(&rx_connHashTable_lock);
2575 #endif /* RX_ENABLE_LOCKS */
2580 afs_winsockCleanup();
2588 /* if we wakeup packet waiter too often, can get in loop with two
2589 AllocSendPackets each waking each other up (from ReclaimPacket calls) */
2591 rxi_PacketsUnWait(void)
2593 if (!rx_waitingForPackets) {
2597 if (rxi_OverQuota(RX_PACKET_CLASS_SEND)) {
2598 return; /* still over quota */
2601 rx_waitingForPackets = 0;
2602 #ifdef RX_ENABLE_LOCKS
2603 CV_BROADCAST(&rx_waitingForPackets_cv);
2605 osi_rxWakeup(&rx_waitingForPackets);
2611 /* ------------------Internal interfaces------------------------- */
2613 /* Return this process's service structure for the
2614 * specified socket and service */
2615 static struct rx_service *
2616 rxi_FindService(osi_socket socket, u_short serviceId)
2618 struct rx_service **sp;
2619 for (sp = &rx_services[0]; *sp; sp++) {
2620 if ((*sp)->serviceId == serviceId && (*sp)->socket == socket)
2626 #ifdef RXDEBUG_PACKET
2627 #ifdef KDUMP_RX_LOCK
2628 static struct rx_call_rx_lock *rx_allCallsp = 0;
2630 static struct rx_call *rx_allCallsp = 0;
2632 #endif /* RXDEBUG_PACKET */
2634 /* Allocate a call structure, for the indicated channel of the
2635 * supplied connection. The mode and state of the call must be set by
2636 * the caller. Returns the call with mutex locked. */
2637 static struct rx_call *
2638 rxi_NewCall(struct rx_connection *conn, int channel)
2640 struct rx_call *call;
2641 #ifdef RX_ENABLE_LOCKS
2642 struct rx_call *cp; /* Call pointer temp */
2643 struct opr_queue *cursor;
2646 dpf(("rxi_NewCall(conn %"AFS_PTR_FMT", channel %d)\n", conn, channel));
2648 /* Grab an existing call structure, or allocate a new one.
2649 * Existing call structures are assumed to have been left reset by
2651 MUTEX_ENTER(&rx_freeCallQueue_lock);
2653 #ifdef RX_ENABLE_LOCKS
2655 * EXCEPT that the TQ might not yet be cleared out.
2656 * Skip over those with in-use TQs.
2659 for (opr_queue_Scan(&rx_freeCallQueue, cursor)) {
2660 cp = opr_queue_Entry(cursor, struct rx_call, entry);
2661 if (!(cp->flags & RX_CALL_TQ_BUSY)) {
2667 #else /* RX_ENABLE_LOCKS */
2668 if (!opr_queue_IsEmpty(&rx_freeCallQueue)) {
2669 call = opr_queue_First(&rx_freeCallQueue, struct rx_call, entry);
2670 #endif /* RX_ENABLE_LOCKS */
2671 opr_queue_Remove(&call->entry);
2672 if (rx_stats_active)
2673 rx_atomic_dec(&rx_stats.nFreeCallStructs);
2674 MUTEX_EXIT(&rx_freeCallQueue_lock);
2675 MUTEX_ENTER(&call->lock);
2676 CLEAR_CALL_QUEUE_LOCK(call);
2677 #ifdef RX_ENABLE_LOCKS
2678 /* Now, if TQ wasn't cleared earlier, do it now. */
2679 rxi_WaitforTQBusy(call);
2680 if (call->flags & RX_CALL_TQ_CLEARME) {
2681 rxi_ClearTransmitQueue(call, 1);
2682 /*queue_Init(&call->tq);*/
2684 #endif /* RX_ENABLE_LOCKS */
2685 /* Bind the call to its connection structure */
2687 rxi_ResetCall(call, 1);
2690 call = rxi_Alloc(sizeof(struct rx_call));
2691 #ifdef RXDEBUG_PACKET
2692 call->allNextp = rx_allCallsp;
2693 rx_allCallsp = call;
2695 rx_atomic_inc_and_read(&rx_stats.nCallStructs);
2696 #else /* RXDEBUG_PACKET */
2697 rx_atomic_inc(&rx_stats.nCallStructs);
2698 #endif /* RXDEBUG_PACKET */
2700 MUTEX_EXIT(&rx_freeCallQueue_lock);
2701 MUTEX_INIT(&call->lock, "call lock", MUTEX_DEFAULT, NULL);
2702 MUTEX_ENTER(&call->lock);
2703 CV_INIT(&call->cv_twind, "call twind", CV_DEFAULT, 0);
2704 CV_INIT(&call->cv_rq, "call rq", CV_DEFAULT, 0);
2705 CV_INIT(&call->cv_tq, "call tq", CV_DEFAULT, 0);
2707 /* Initialize once-only items */
2708 opr_queue_Init(&call->tq);
2709 opr_queue_Init(&call->rq);
2710 opr_queue_Init(&call->app.iovq);
2711 #ifdef RXDEBUG_PACKET
2712 call->rqc = call->tqc = call->iovqc = 0;
2713 #endif /* RXDEBUG_PACKET */
2714 /* Bind the call to its connection structure (prereq for reset) */
2716 rxi_ResetCall(call, 1);
2718 call->channel = channel;
2719 call->callNumber = &conn->callNumber[channel];
2720 call->rwind = conn->rwind[channel];
2721 call->twind = conn->twind[channel];
2722 /* Note that the next expected call number is retained (in
2723 * conn->callNumber[i]), even if we reallocate the call structure
2725 conn->call[channel] = call;
2726 /* if the channel's never been used (== 0), we should start at 1, otherwise
2727 * the call number is valid from the last time this channel was used */
2728 if (*call->callNumber == 0)
2729 *call->callNumber = 1;
2734 /* A call has been inactive long enough that so we can throw away
2735 * state, including the call structure, which is placed on the call
2738 * call->lock amd rx_refcnt_mutex are held upon entry.
2739 * haveCTLock is set when called from rxi_ReapConnections.
2741 * return 1 if the call is freed, 0 if not.
2744 rxi_FreeCall(struct rx_call *call, int haveCTLock)
2746 int channel = call->channel;
2747 struct rx_connection *conn = call->conn;
2748 u_char state = call->state;
2751 * We are setting the state to RX_STATE_RESET to
2752 * ensure that no one else will attempt to use this
2753 * call once we drop the refcnt lock. We must drop
2754 * the refcnt lock before calling rxi_ResetCall
2755 * because it cannot be held across acquiring the
2756 * freepktQ lock. NewCall does the same.
2758 call->state = RX_STATE_RESET;
2759 MUTEX_EXIT(&rx_refcnt_mutex);
2760 rxi_ResetCall(call, 0);
2762 if (MUTEX_TRYENTER(&conn->conn_call_lock))
2764 if (state == RX_STATE_DALLY || state == RX_STATE_HOLD)
2765 (*call->callNumber)++;
2767 if (call->conn->call[channel] == call)
2768 call->conn->call[channel] = 0;
2769 MUTEX_EXIT(&conn->conn_call_lock);
2772 * We couldn't obtain the conn_call_lock so we can't
2773 * disconnect the call from the connection. Set the
2774 * call state to dally so that the call can be reused.
2776 MUTEX_ENTER(&rx_refcnt_mutex);
2777 call->state = RX_STATE_DALLY;
2781 MUTEX_ENTER(&rx_freeCallQueue_lock);
2782 SET_CALL_QUEUE_LOCK(call, &rx_freeCallQueue_lock);
2783 #ifdef RX_ENABLE_LOCKS
2784 /* A call may be free even though its transmit queue is still in use.
2785 * Since we search the call list from head to tail, put busy calls at
2786 * the head of the list, and idle calls at the tail.
2788 if (call->flags & RX_CALL_TQ_BUSY)
2789 opr_queue_Prepend(&rx_freeCallQueue, &call->entry);
2791 opr_queue_Append(&rx_freeCallQueue, &call->entry);
2792 #else /* RX_ENABLE_LOCKS */
2793 opr_queue_Append(&rx_freeCallQueue, &call->entry);
2794 #endif /* RX_ENABLE_LOCKS */
2795 if (rx_stats_active)
2796 rx_atomic_inc(&rx_stats.nFreeCallStructs);
2797 MUTEX_EXIT(&rx_freeCallQueue_lock);
2799 /* Destroy the connection if it was previously slated for
2800 * destruction, i.e. the Rx client code previously called
2801 * rx_DestroyConnection (client connections), or
2802 * rxi_ReapConnections called the same routine (server
2803 * connections). Only do this, however, if there are no
2804 * outstanding calls. Note that for fine grain locking, there appears
2805 * to be a deadlock in that rxi_FreeCall has a call locked and
2806 * DestroyConnectionNoLock locks each call in the conn. But note a
2807 * few lines up where we have removed this call from the conn.
2808 * If someone else destroys a connection, they either have no
2809 * call lock held or are going through this section of code.
2811 MUTEX_ENTER(&conn->conn_data_lock);
2812 if (conn->flags & RX_CONN_DESTROY_ME && !(conn->flags & RX_CONN_MAKECALL_WAITING)) {
2813 MUTEX_ENTER(&rx_refcnt_mutex);
2815 MUTEX_EXIT(&rx_refcnt_mutex);
2816 MUTEX_EXIT(&conn->conn_data_lock);
2817 #ifdef RX_ENABLE_LOCKS
2819 rxi_DestroyConnectionNoLock(conn);
2821 rxi_DestroyConnection(conn);
2822 #else /* RX_ENABLE_LOCKS */
2823 rxi_DestroyConnection(conn);
2824 #endif /* RX_ENABLE_LOCKS */
2826 MUTEX_EXIT(&conn->conn_data_lock);
2828 MUTEX_ENTER(&rx_refcnt_mutex);
2832 rx_atomic_t rxi_Allocsize = RX_ATOMIC_INIT(0);
2833 rx_atomic_t rxi_Alloccnt = RX_ATOMIC_INIT(0);
2836 rxi_Alloc(size_t size)
2840 if (rx_stats_active) {
2841 rx_atomic_add(&rxi_Allocsize, (int) size);
2842 rx_atomic_inc(&rxi_Alloccnt);
2846 #if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV)
2847 afs_osi_Alloc_NoSleep(size);
2852 osi_Panic("rxi_Alloc error");
2858 rxi_Free(void *addr, size_t size)
2860 if (rx_stats_active) {
2861 rx_atomic_sub(&rxi_Allocsize, (int) size);
2862 rx_atomic_dec(&rxi_Alloccnt);
2864 osi_Free(addr, size);
2868 rxi_SetPeerMtu(struct rx_peer *peer, afs_uint32 host, afs_uint32 port, int mtu)
2870 struct rx_peer **peer_ptr = NULL, **peer_end = NULL;
2871 struct rx_peer *next = NULL;
2875 MUTEX_ENTER(&rx_peerHashTable_lock);
2877 peer_ptr = &rx_peerHashTable[0];
2878 peer_end = &rx_peerHashTable[rx_hashTableSize];
2881 for ( ; peer_ptr < peer_end; peer_ptr++) {
2884 for ( ; peer; peer = next) {
2886 if (host == peer->host)
2891 hashIndex = PEER_HASH(host, port);
2892 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2893 if ((peer->host == host) && (peer->port == port))
2898 MUTEX_ENTER(&rx_peerHashTable_lock);
2903 MUTEX_EXIT(&rx_peerHashTable_lock);
2905 MUTEX_ENTER(&peer->peer_lock);
2906 /* We don't handle dropping below min, so don't */
2907 mtu = MAX(mtu, RX_MIN_PACKET_SIZE);
2908 peer->ifMTU=MIN(mtu, peer->ifMTU);
2909 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2910 /* if we tweaked this down, need to tune our peer MTU too */
2911 peer->MTU = MIN(peer->MTU, peer->natMTU);
2912 /* if we discovered a sub-1500 mtu, degrade */
2913 if (peer->ifMTU < OLD_MAX_PACKET_SIZE)
2914 peer->maxDgramPackets = 1;
2915 /* We no longer have valid peer packet information */
2916 if (peer->maxPacketSize-RX_IPUDP_SIZE > peer->ifMTU)
2917 peer->maxPacketSize = 0;
2918 MUTEX_EXIT(&peer->peer_lock);
2920 MUTEX_ENTER(&rx_peerHashTable_lock);
2922 if (host && !port) {
2924 /* pick up where we left off */
2928 MUTEX_EXIT(&rx_peerHashTable_lock);
2931 #ifdef AFS_RXERRQ_ENV
2933 rxi_SetPeerDead(afs_uint32 host, afs_uint16 port)
2935 int hashIndex = PEER_HASH(host, port);
2936 struct rx_peer *peer;
2938 MUTEX_ENTER(&rx_peerHashTable_lock);
2940 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2941 if (peer->host == host && peer->port == port) {
2947 rx_atomic_inc(&peer->neterrs);
2950 MUTEX_EXIT(&rx_peerHashTable_lock);
2954 rxi_ProcessNetError(struct sock_extended_err *err, afs_uint32 addr, afs_uint16 port)
2956 # ifdef AFS_ADAPT_PMTU
2957 if (err->ee_errno == EMSGSIZE && err->ee_info >= 68) {
2958 rxi_SetPeerMtu(NULL, addr, port, err->ee_info - RX_IPUDP_SIZE);
2962 if (err->ee_origin == SO_EE_ORIGIN_ICMP && err->ee_type == ICMP_DEST_UNREACH) {
2963 switch (err->ee_code) {
2964 case ICMP_NET_UNREACH:
2965 case ICMP_HOST_UNREACH:
2966 case ICMP_PORT_UNREACH:
2969 rxi_SetPeerDead(addr, port);
2974 #endif /* AFS_RXERRQ_ENV */
2976 /* Find the peer process represented by the supplied (host,port)
2977 * combination. If there is no appropriate active peer structure, a
2978 * new one will be allocated and initialized
2979 * The origPeer, if set, is a pointer to a peer structure on which the
2980 * refcount will be be decremented. This is used to replace the peer
2981 * structure hanging off a connection structure */
2983 rxi_FindPeer(afs_uint32 host, u_short port,
2984 struct rx_peer *origPeer, int create)
2988 hashIndex = PEER_HASH(host, port);
2989 MUTEX_ENTER(&rx_peerHashTable_lock);
2990 for (pp = rx_peerHashTable[hashIndex]; pp; pp = pp->next) {
2991 if ((pp->host == host) && (pp->port == port))
2996 pp = rxi_AllocPeer(); /* This bzero's *pp */
2997 pp->host = host; /* set here or in InitPeerParams is zero */
2999 #ifdef AFS_RXERRQ_ENV
3000 rx_atomic_set(&pp->neterrs, 0);
3002 MUTEX_INIT(&pp->peer_lock, "peer_lock", MUTEX_DEFAULT, 0);
3003 opr_queue_Init(&pp->rpcStats);
3004 pp->next = rx_peerHashTable[hashIndex];
3005 rx_peerHashTable[hashIndex] = pp;
3006 rxi_InitPeerParams(pp);
3007 if (rx_stats_active)
3008 rx_atomic_inc(&rx_stats.nPeerStructs);
3015 origPeer->refCount--;
3016 MUTEX_EXIT(&rx_peerHashTable_lock);
3021 /* Find the connection at (host, port) started at epoch, and with the
3022 * given connection id. Creates the server connection if necessary.
3023 * The type specifies whether a client connection or a server
3024 * connection is desired. In both cases, (host, port) specify the
3025 * peer's (host, pair) pair. Client connections are not made
3026 * automatically by this routine. The parameter socket gives the
3027 * socket descriptor on which the packet was received. This is used,
3028 * in the case of server connections, to check that *new* connections
3029 * come via a valid (port, serviceId). Finally, the securityIndex
3030 * parameter must match the existing index for the connection. If a
3031 * server connection is created, it will be created using the supplied
3032 * index, if the index is valid for this service */
3033 static struct rx_connection *
3034 rxi_FindConnection(osi_socket socket, afs_uint32 host,
3035 u_short port, u_short serviceId, afs_uint32 cid,
3036 afs_uint32 epoch, int type, u_int securityIndex)
3038 int hashindex, flag, i;
3039 struct rx_connection *conn;
3040 hashindex = CONN_HASH(host, port, cid, epoch, type);
3041 MUTEX_ENTER(&rx_connHashTable_lock);
3042 rxLastConn ? (conn = rxLastConn, flag = 0) : (conn =
3043 rx_connHashTable[hashindex],
3046 if ((conn->type == type) && ((cid & RX_CIDMASK) == conn->cid)
3047 && (epoch == conn->epoch)) {
3048 struct rx_peer *pp = conn->peer;
3049 if (securityIndex != conn->securityIndex) {
3050 /* this isn't supposed to happen, but someone could forge a packet
3051 * like this, and there seems to be some CM bug that makes this
3052 * happen from time to time -- in which case, the fileserver
3054 MUTEX_EXIT(&rx_connHashTable_lock);
3055 return (struct rx_connection *)0;
3057 if (pp->host == host && pp->port == port)
3059 if (type == RX_CLIENT_CONNECTION && pp->port == port)
3061 /* So what happens when it's a callback connection? */
3062 if ( /*type == RX_CLIENT_CONNECTION && */
3063 (conn->epoch & 0x80000000))
3067 /* the connection rxLastConn that was used the last time is not the
3068 ** one we are looking for now. Hence, start searching in the hash */
3070 conn = rx_connHashTable[hashindex];
3075 struct rx_service *service;
3076 if (type == RX_CLIENT_CONNECTION) {
3077 MUTEX_EXIT(&rx_connHashTable_lock);
3078 return (struct rx_connection *)0;
3080 service = rxi_FindService(socket, serviceId);
3081 if (!service || (securityIndex >= service->nSecurityObjects)
3082 || (service->securityObjects[securityIndex] == 0)) {
3083 MUTEX_EXIT(&rx_connHashTable_lock);
3084 return (struct rx_connection *)0;
3086 conn = rxi_AllocConnection(); /* This bzero's the connection */
3087 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
3088 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
3089 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
3090 conn->next = rx_connHashTable[hashindex];
3091 rx_connHashTable[hashindex] = conn;
3092 conn->peer = rxi_FindPeer(host, port, 0, 1);
3093 conn->type = RX_SERVER_CONNECTION;
3094 conn->lastSendTime = clock_Sec(); /* don't GC immediately */
3095 conn->epoch = epoch;
3096 conn->cid = cid & RX_CIDMASK;
3097 conn->ackRate = RX_FAST_ACK_RATE;
3098 conn->service = service;
3099 conn->serviceId = serviceId;
3100 conn->securityIndex = securityIndex;
3101 conn->securityObject = service->securityObjects[securityIndex];
3102 conn->nSpecific = 0;
3103 conn->specific = NULL;
3104 rx_SetConnDeadTime(conn, service->connDeadTime);
3105 conn->idleDeadTime = service->idleDeadTime;
3106 conn->idleDeadDetection = service->idleDeadErr ? 1 : 0;
3107 for (i = 0; i < RX_MAXCALLS; i++) {
3108 conn->twind[i] = rx_initSendWindow;
3109 conn->rwind[i] = rx_initReceiveWindow;
3111 /* Notify security object of the new connection */
3112 RXS_NewConnection(conn->securityObject, conn);
3113 /* XXXX Connection timeout? */
3114 if (service->newConnProc)
3115 (*service->newConnProc) (conn);
3116 if (rx_stats_active)
3117 rx_atomic_inc(&rx_stats.nServerConns);
3120 MUTEX_ENTER(&rx_refcnt_mutex);
3122 MUTEX_EXIT(&rx_refcnt_mutex);
3124 rxLastConn = conn; /* store this connection as the last conn used */
3125 MUTEX_EXIT(&rx_connHashTable_lock);
3130 * Timeout a call on a busy call channel if appropriate.
3132 * @param[in] call The busy call.
3134 * @pre 'call' is marked as busy (namely,
3135 * call->conn->lastBusy[call->channel] != 0)
3137 * @pre call->lock is held
3138 * @pre rxi_busyChannelError is nonzero
3140 * @note call->lock is dropped and reacquired
3143 rxi_CheckBusy(struct rx_call *call)
3145 struct rx_connection *conn = call->conn;
3146 int channel = call->channel;
3147 int freechannel = 0;
3149 afs_uint32 callNumber;
3151 MUTEX_EXIT(&call->lock);
3153 MUTEX_ENTER(&conn->conn_call_lock);
3154 callNumber = *call->callNumber;
3156 /* Are there any other call slots on this conn that we should try? Look for
3157 * slots that are empty and are either non-busy, or were marked as busy
3158 * longer than conn->secondsUntilDead seconds before this call started. */
3160 for (i = 0; i < RX_MAXCALLS && !freechannel; i++) {
3162 /* only look at channels that aren't us */
3166 if (conn->lastBusy[i]) {
3167 /* if this channel looked busy too recently, don't look at it */
3168 if (conn->lastBusy[i] >= call->startTime.sec) {
3171 if (call->startTime.sec - conn->lastBusy[i] < conn->secondsUntilDead) {
3176 if (conn->call[i]) {
3177 struct rx_call *tcall = conn->call[i];
3178 MUTEX_ENTER(&tcall->lock);
3179 if (tcall->state == RX_STATE_DALLY) {
3182 MUTEX_EXIT(&tcall->lock);
3188 MUTEX_ENTER(&call->lock);
3190 /* Since the call->lock and conn->conn_call_lock have been released it is
3191 * possible that (1) the call may no longer be busy and/or (2) the call may
3192 * have been reused by another waiting thread. Therefore, we must confirm
3193 * that the call state has not changed when deciding whether or not to
3194 * force this application thread to retry by forcing a Timeout error. */
3196 if (freechannel && *call->callNumber == callNumber &&
3197 (call->flags & RX_CALL_PEER_BUSY)) {
3198 /* Since 'freechannel' is set, there exists another channel in this
3199 * rx_conn that the application thread might be able to use. We know
3200 * that we have the correct call since callNumber is unchanged, and we
3201 * know that the call is still busy. So, set the call error state to
3202 * rxi_busyChannelError so the application can retry the request,
3203 * presumably on a less-busy call channel. */
3205 rxi_CallError(call, RX_CALL_BUSY);
3207 MUTEX_EXIT(&conn->conn_call_lock);
3211 * Abort the call if the server is over the busy threshold. This
3212 * can be used without requiring a call structure be initialised,
3213 * or connected to a particular channel
3216 rxi_AbortIfServerBusy(osi_socket socket, struct rx_connection *conn,
3217 struct rx_packet *np)
3219 if ((rx_BusyThreshold > 0) &&
3220 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3221 rxi_SendRawAbort(socket, conn->peer->host, conn->peer->port,
3222 rx_BusyError, np, 0);
3223 if (rx_stats_active)
3224 rx_atomic_inc(&rx_stats.nBusies);
3231 static_inline struct rx_call *
3232 rxi_ReceiveClientCall(struct rx_packet *np, struct rx_connection *conn)
3235 struct rx_call *call;
3237 channel = np->header.cid & RX_CHANNELMASK;
3238 MUTEX_ENTER(&conn->conn_call_lock);
3239 call = conn->call[channel];
3240 if (!call || conn->callNumber[channel] != np->header.callNumber) {
3241 MUTEX_EXIT(&conn->conn_call_lock);
3242 if (rx_stats_active)
3243 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3247 MUTEX_ENTER(&call->lock);
3248 MUTEX_EXIT(&conn->conn_call_lock);
3250 if ((call->state == RX_STATE_DALLY)
3251 && np->header.type == RX_PACKET_TYPE_ACK) {
3252 if (rx_stats_active)
3253 rx_atomic_inc(&rx_stats.ignorePacketDally);
3254 MUTEX_EXIT(&call->lock);
3261 static_inline struct rx_call *
3262 rxi_ReceiveServerCall(osi_socket socket, struct rx_packet *np,
3263 struct rx_connection *conn)
3266 struct rx_call *call;
3268 channel = np->header.cid & RX_CHANNELMASK;
3269 MUTEX_ENTER(&conn->conn_call_lock);
3270 call = conn->call[channel];
3273 if (rxi_AbortIfServerBusy(socket, conn, np)) {
3274 MUTEX_EXIT(&conn->conn_call_lock);
3278 call = rxi_NewCall(conn, channel); /* returns locked call */
3279 *call->callNumber = np->header.callNumber;
3280 MUTEX_EXIT(&conn->conn_call_lock);
3282 call->state = RX_STATE_PRECALL;
3283 clock_GetTime(&call->queueTime);
3284 call->app.bytesSent = 0;
3285 call->app.bytesRcvd = 0;
3286 rxi_KeepAliveOn(call);
3291 if (np->header.callNumber == conn->callNumber[channel]) {
3292 MUTEX_ENTER(&call->lock);
3293 MUTEX_EXIT(&conn->conn_call_lock);
3297 if (np->header.callNumber < conn->callNumber[channel]) {
3298 MUTEX_EXIT(&conn->conn_call_lock);
3299 if (rx_stats_active)
3300 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3304 MUTEX_ENTER(&call->lock);
3305 MUTEX_EXIT(&conn->conn_call_lock);
3307 /* Wait until the transmit queue is idle before deciding
3308 * whether to reset the current call. Chances are that the
3309 * call will be in ether DALLY or HOLD state once the TQ_BUSY
3312 #ifdef RX_ENABLE_LOCKS
3313 if (call->state == RX_STATE_ACTIVE) {
3314 int old_error = call->error;
3315 rxi_WaitforTQBusy(call);
3316 /* If we entered error state while waiting,
3317 * must call rxi_CallError to permit rxi_ResetCall
3318 * to processed when the tqWaiter count hits zero.
3320 if (call->error && call->error != old_error) {
3321 rxi_CallError(call, call->error);
3322 MUTEX_EXIT(&call->lock);
3326 #endif /* RX_ENABLE_LOCKS */
3327 /* If the new call cannot be taken right now send a busy and set
3328 * the error condition in this call, so that it terminates as
3329 * quickly as possible */
3330 if (call->state == RX_STATE_ACTIVE) {
3331 rxi_CallError(call, RX_CALL_DEAD);
3332 rxi_SendSpecial(call, conn, NULL, RX_PACKET_TYPE_BUSY,
3334 MUTEX_EXIT(&call->lock);
3338 if (rxi_AbortIfServerBusy(socket, conn, np)) {
3339 MUTEX_EXIT(&call->lock);
3343 rxi_ResetCall(call, 0);
3344 /* The conn_call_lock is not held but no one else should be
3345 * using this call channel while we are processing this incoming
3346 * packet. This assignment should be safe.
3348 *call->callNumber = np->header.callNumber;
3349 call->state = RX_STATE_PRECALL;
3350 clock_GetTime(&call->queueTime);
3351 call->app.bytesSent = 0;
3352 call->app.bytesRcvd = 0;
3353 rxi_KeepAliveOn(call);
3359 /* There are two packet tracing routines available for testing and monitoring
3360 * Rx. One is called just after every packet is received and the other is
3361 * called just before every packet is sent. Received packets, have had their
3362 * headers decoded, and packets to be sent have not yet had their headers
3363 * encoded. Both take two parameters: a pointer to the packet and a sockaddr
3364 * containing the network address. Both can be modified. The return value, if
3365 * non-zero, indicates that the packet should be dropped. */
3367 int (*rx_justReceived) (struct rx_packet *, struct sockaddr_in *) = 0;
3368 int (*rx_almostSent) (struct rx_packet *, struct sockaddr_in *) = 0;
3370 /* A packet has been received off the interface. Np is the packet, socket is
3371 * the socket number it was received from (useful in determining which service
3372 * this packet corresponds to), and (host, port) reflect the host,port of the
3373 * sender. This call returns the packet to the caller if it is finished with
3374 * it, rather than de-allocating it, just as a small performance hack */
3377 rxi_ReceivePacket(struct rx_packet *np, osi_socket socket,
3378 afs_uint32 host, u_short port, int *tnop,
3379 struct rx_call **newcallp)
3381 struct rx_call *call;
3382 struct rx_connection *conn;
3387 struct rx_packet *tnp;
3390 /* We don't print out the packet until now because (1) the time may not be
3391 * accurate enough until now in the lwp implementation (rx_Listener only gets
3392 * the time after the packet is read) and (2) from a protocol point of view,
3393 * this is the first time the packet has been seen */
3394 packetType = (np->header.type > 0 && np->header.type < RX_N_PACKET_TYPES)
3395 ? rx_packetTypes[np->header.type - 1] : "*UNKNOWN*";
3396 dpf(("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"AFS_PTR_FMT"\n",
3397 np->header.serial, packetType, ntohl(host), ntohs(port), np->header.serviceId,
3398 np->header.epoch, np->header.cid, np->header.callNumber,
3399 np->header.seq, np->header.flags, np));
3402 /* Account for connectionless packets */
3403 if (rx_stats_active &&
3404 ((np->header.type == RX_PACKET_TYPE_VERSION) ||
3405 (np->header.type == RX_PACKET_TYPE_DEBUG))) {
3406 struct rx_peer *peer;
3408 /* Try to look up the peer structure, but don't create one */
3409 peer = rxi_FindPeer(host, port, 0, 0);
3411 /* Since this may not be associated with a connection, it may have
3412 * no refCount, meaning we could race with ReapConnections
3415 if (peer && (peer->refCount > 0)) {
3416 #ifdef AFS_RXERRQ_ENV
3417 if (rx_atomic_read(&peer->neterrs)) {
3418 rx_atomic_set(&peer->neterrs, 0);
3421 MUTEX_ENTER(&peer->peer_lock);
3422 peer->bytesReceived += np->length;
3423 MUTEX_EXIT(&peer->peer_lock);
3427 if (np->header.type == RX_PACKET_TYPE_VERSION) {
3428 return rxi_ReceiveVersionPacket(np, socket, host, port, 1);
3431 if (np->header.type == RX_PACKET_TYPE_DEBUG) {
3432 return rxi_ReceiveDebugPacket(np, socket, host, port, 1);
3435 /* If an input tracer function is defined, call it with the packet and
3436 * network address. Note this function may modify its arguments. */
3437 if (rx_justReceived) {
3438 struct sockaddr_in addr;
3440 addr.sin_family = AF_INET;
3441 addr.sin_port = port;
3442 addr.sin_addr.s_addr = host;
3443 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
3444 addr.sin_len = sizeof(addr);
3445 #endif /* AFS_OSF_ENV */
3446 drop = (*rx_justReceived) (np, &addr);
3447 /* drop packet if return value is non-zero */
3450 port = addr.sin_port; /* in case fcn changed addr */
3451 host = addr.sin_addr.s_addr;
3455 /* If packet was not sent by the client, then *we* must be the client */
3456 type = ((np->header.flags & RX_CLIENT_INITIATED) != RX_CLIENT_INITIATED)
3457 ? RX_CLIENT_CONNECTION : RX_SERVER_CONNECTION;
3459 /* Find the connection (or fabricate one, if we're the server & if
3460 * necessary) associated with this packet */
3462 rxi_FindConnection(socket, host, port, np->header.serviceId,
3463 np->header.cid, np->header.epoch, type,
3464 np->header.securityIndex);
3466 /* To avoid having 2 connections just abort at each other,
3467 don't abort an abort. */
3469 if (np->header.type != RX_PACKET_TYPE_ABORT)
3470 rxi_SendRawAbort(socket, host, port, RX_INVALID_OPERATION,
3475 #ifdef AFS_RXERRQ_ENV
3476 if (rx_atomic_read(&conn->peer->neterrs)) {
3477 rx_atomic_set(&conn->peer->neterrs, 0);
3481 /* If we're doing statistics, then account for the incoming packet */
3482 if (rx_stats_active) {
3483 MUTEX_ENTER(&conn->peer->peer_lock);
3484 conn->peer->bytesReceived += np->length;
3485 MUTEX_EXIT(&conn->peer->peer_lock);
3488 /* If the connection is in an error state, send an abort packet and ignore
3489 * the incoming packet */
3491 /* Don't respond to an abort packet--we don't want loops! */
3492 MUTEX_ENTER(&conn->conn_data_lock);
3493 if (np->header.type != RX_PACKET_TYPE_ABORT)
3494 np = rxi_SendConnectionAbort(conn, np, 1, 0);
3495 putConnection(conn);
3496 MUTEX_EXIT(&conn->conn_data_lock);
3500 /* Check for connection-only requests (i.e. not call specific). */
3501 if (np->header.callNumber == 0) {
3502 switch (np->header.type) {
3503 case RX_PACKET_TYPE_ABORT: {
3504 /* What if the supplied error is zero? */
3505 afs_int32 errcode = ntohl(rx_GetInt32(np, 0));
3506 dpf(("rxi_ReceivePacket ABORT rx_GetInt32 = %d\n", errcode));
3507 rxi_ConnectionError(conn, errcode);
3508 putConnection(conn);
3511 case RX_PACKET_TYPE_CHALLENGE:
3512 tnp = rxi_ReceiveChallengePacket(conn, np, 1);
3513 putConnection(conn);
3515 case RX_PACKET_TYPE_RESPONSE:
3516 tnp = rxi_ReceiveResponsePacket(conn, np, 1);
3517 putConnection(conn);
3519 case RX_PACKET_TYPE_PARAMS:
3520 case RX_PACKET_TYPE_PARAMS + 1:
3521 case RX_PACKET_TYPE_PARAMS + 2:
3522 /* ignore these packet types for now */
3523 putConnection(conn);
3527 /* Should not reach here, unless the peer is broken: send an
3529 rxi_ConnectionError(conn, RX_PROTOCOL_ERROR);
3530 MUTEX_ENTER(&conn->conn_data_lock);
3531 tnp = rxi_SendConnectionAbort(conn, np, 1, 0);
3532 putConnection(conn);
3533 MUTEX_EXIT(&conn->conn_data_lock);
3538 if (type == RX_SERVER_CONNECTION)
3539 call = rxi_ReceiveServerCall(socket, np, conn);
3541 call = rxi_ReceiveClientCall(np, conn);
3544 putConnection(conn);
3548 MUTEX_ASSERT(&call->lock);
3549 /* Set remote user defined status from packet */
3550 call->remoteStatus = np->header.userStatus;
3552 /* Now do packet type-specific processing */
3553 switch (np->header.type) {
3554 case RX_PACKET_TYPE_DATA:
3555 /* If we're a client, and receiving a response, then all the packets
3556 * we transmitted packets are implicitly acknowledged. */
3557 if (type == RX_CLIENT_CONNECTION && !opr_queue_IsEmpty(&call->tq))
3558 rxi_AckAllInTransmitQueue(call);
3560 np = rxi_ReceiveDataPacket(call, np, 1, socket, host, port, tnop,
3563 case RX_PACKET_TYPE_ACK:
3564 /* Respond immediately to ack packets requesting acknowledgement
3566 if (np->header.flags & RX_REQUEST_ACK) {
3568 (void)rxi_SendCallAbort(call, 0, 1, 0);
3570 (void)rxi_SendAck(call, 0, np->header.serial,
3571 RX_ACK_PING_RESPONSE, 1);
3573 np = rxi_ReceiveAckPacket(call, np, 1);
3575 case RX_PACKET_TYPE_ABORT: {
3576 /* An abort packet: reset the call, passing the error up to the user. */
3577 /* What if error is zero? */
3578 /* What if the error is -1? the application will treat it as a timeout. */
3579 afs_int32 errdata = ntohl(*(afs_int32 *) rx_DataOf(np));
3580 dpf(("rxi_ReceivePacket ABORT rx_DataOf = %d\n", errdata));
3581 rxi_CallError(call, errdata);
3582 MUTEX_EXIT(&call->lock);
3583 putConnection(conn);
3584 return np; /* xmitting; drop packet */
3586 case RX_PACKET_TYPE_BUSY: {
3587 struct clock busyTime;
3589 clock_GetTime(&busyTime);
3591 MUTEX_EXIT(&call->lock);
3593 MUTEX_ENTER(&conn->conn_call_lock);
3594 MUTEX_ENTER(&call->lock);
3595 conn->lastBusy[call->channel] = busyTime.sec;
3596 call->flags |= RX_CALL_PEER_BUSY;
3597 MUTEX_EXIT(&call->lock);
3598 MUTEX_EXIT(&conn->conn_call_lock);
3600 putConnection(conn);
3604 case RX_PACKET_TYPE_ACKALL:
3605 /* All packets acknowledged, so we can drop all packets previously
3606 * readied for sending */
3607 rxi_AckAllInTransmitQueue(call);
3610 /* Should not reach here, unless the peer is broken: send an abort
3612 rxi_CallError(call, RX_PROTOCOL_ERROR);
3613 np = rxi_SendCallAbort(call, np, 1, 0);
3616 /* Note when this last legitimate packet was received, for keep-alive
3617 * processing. Note, we delay getting the time until now in the hope that
3618 * the packet will be delivered to the user before any get time is required
3619 * (if not, then the time won't actually be re-evaluated here). */
3620 call->lastReceiveTime = clock_Sec();
3621 /* we've received a legit packet, so the channel is not busy */
3622 call->flags &= ~RX_CALL_PEER_BUSY;
3623 MUTEX_EXIT(&call->lock);
3624 putConnection(conn);
3628 /* return true if this is an "interesting" connection from the point of view
3629 of someone trying to debug the system */
3631 rxi_IsConnInteresting(struct rx_connection *aconn)
3634 struct rx_call *tcall;
3636 if (aconn->flags & (RX_CONN_MAKECALL_WAITING | RX_CONN_DESTROY_ME))
3639 for (i = 0; i < RX_MAXCALLS; i++) {
3640 tcall = aconn->call[i];
3642 if ((tcall->state == RX_STATE_PRECALL)
3643 || (tcall->state == RX_STATE_ACTIVE))
3645 if ((tcall->app.mode == RX_MODE_SENDING)
3646 || (tcall->app.mode == RX_MODE_RECEIVING))
3654 /* if this is one of the last few packets AND it wouldn't be used by the
3655 receiving call to immediately satisfy a read request, then drop it on
3656 the floor, since accepting it might prevent a lock-holding thread from
3657 making progress in its reading. If a call has been cleared while in
3658 the precall state then ignore all subsequent packets until the call
3659 is assigned to a thread. */
3662 TooLow(struct rx_packet *ap, struct rx_call *acall)
3666 MUTEX_ENTER(&rx_quota_mutex);
3667 if (((ap->header.seq != 1) && (acall->flags & RX_CALL_CLEARED)
3668 && (acall->state == RX_STATE_PRECALL))
3669 || ((rx_nFreePackets < rxi_dataQuota + 2)
3670 && !((ap->header.seq < acall->rnext + rx_initSendWindow)
3671 && (acall->flags & RX_CALL_READER_WAIT)))) {
3674 MUTEX_EXIT(&rx_quota_mutex);
3680 * Clear the attach wait flag on a connection and proceed.
3682 * Any processing waiting for a connection to be attached should be
3683 * unblocked. We clear the flag and do any other needed tasks.
3686 * the conn to unmark waiting for attach
3688 * @pre conn's conn_data_lock must be locked before calling this function
3692 rxi_ConnClearAttachWait(struct rx_connection *conn)
3694 /* Indicate that rxi_CheckReachEvent is no longer running by
3695 * clearing the flag. Must be atomic under conn_data_lock to
3696 * avoid a new call slipping by: rxi_CheckConnReach holds
3697 * conn_data_lock while checking RX_CONN_ATTACHWAIT.
3699 conn->flags &= ~RX_CONN_ATTACHWAIT;
3700 if (conn->flags & RX_CONN_NAT_PING) {
3701 conn->flags &= ~RX_CONN_NAT_PING;
3702 rxi_ScheduleNatKeepAliveEvent(conn);
3707 rxi_CheckReachEvent(struct rxevent *event, void *arg1, void *arg2, int dummy)
3709 struct rx_connection *conn = arg1;
3710 struct rx_call *acall = arg2;
3711 struct rx_call *call = acall;
3712 struct clock when, now;
3715 MUTEX_ENTER(&conn->conn_data_lock);
3718 rxevent_Put(conn->checkReachEvent);
3719 conn->checkReachEvent = NULL;
3722 waiting = conn->flags & RX_CONN_ATTACHWAIT;
3724 putConnection(conn);
3726 MUTEX_EXIT(&conn->conn_data_lock);
3730 MUTEX_ENTER(&conn->conn_call_lock);
3731 MUTEX_ENTER(&conn->conn_data_lock);
3732 for (i = 0; i < RX_MAXCALLS; i++) {
3733 struct rx_call *tc = conn->call[i];
3734 if (tc && tc->state == RX_STATE_PRECALL) {
3740 rxi_ConnClearAttachWait(conn);
3741 MUTEX_EXIT(&conn->conn_data_lock);
3742 MUTEX_EXIT(&conn->conn_call_lock);
3747 MUTEX_ENTER(&call->lock);
3748 rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
3750 MUTEX_EXIT(&call->lock);
3752 clock_GetTime(&now);
3754 when.sec += RX_CHECKREACH_TIMEOUT;
3755 MUTEX_ENTER(&conn->conn_data_lock);
3756 if (!conn->checkReachEvent) {
3757 MUTEX_ENTER(&rx_refcnt_mutex);
3759 MUTEX_EXIT(&rx_refcnt_mutex);
3760 conn->checkReachEvent = rxevent_Post(&when, &now,
3761 rxi_CheckReachEvent, conn,
3764 MUTEX_EXIT(&conn->conn_data_lock);
3770 rxi_CheckConnReach(struct rx_connection *conn, struct rx_call *call)
3772 struct rx_service *service = conn->service;
3773 struct rx_peer *peer = conn->peer;
3774 afs_uint32 now, lastReach;
3776 if (service->checkReach == 0)
3780 MUTEX_ENTER(&peer->peer_lock);
3781 lastReach = peer->lastReachTime;
3782 MUTEX_EXIT(&peer->peer_lock);
3783 if (now - lastReach < RX_CHECKREACH_TTL)
3786 MUTEX_ENTER(&conn->conn_data_lock);
3787 if (conn->flags & RX_CONN_ATTACHWAIT) {
3788 MUTEX_EXIT(&conn->conn_data_lock);
3791 conn->flags |= RX_CONN_ATTACHWAIT;
3792 MUTEX_EXIT(&conn->conn_data_lock);
3793 if (!conn->checkReachEvent)
3794 rxi_CheckReachEvent(NULL, conn, call, 0);
3799 /* try to attach call, if authentication is complete */
3801 TryAttach(struct rx_call *acall, osi_socket socket,
3802 int *tnop, struct rx_call **newcallp,
3805 struct rx_connection *conn = acall->conn;
3807 if (conn->type == RX_SERVER_CONNECTION
3808 && acall->state == RX_STATE_PRECALL) {
3809 /* Don't attach until we have any req'd. authentication. */
3810 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0) {
3811 if (reachOverride || rxi_CheckConnReach(conn, acall) == 0)
3812 rxi_AttachServerProc(acall, socket, tnop, newcallp);
3813 /* Note: this does not necessarily succeed; there
3814 * may not any proc available
3817 rxi_ChallengeOn(acall->conn);
3822 /* A data packet has been received off the interface. This packet is
3823 * appropriate to the call (the call is in the right state, etc.). This
3824 * routine can return a packet to the caller, for re-use */
3826 static struct rx_packet *
3827 rxi_ReceiveDataPacket(struct rx_call *call,
3828 struct rx_packet *np, int istack,
3829 osi_socket socket, afs_uint32 host, u_short port,
3830 int *tnop, struct rx_call **newcallp)
3832 int ackNeeded = 0; /* 0 means no, otherwise ack_reason */
3837 afs_uint32 serial=0, flags=0;
3839 struct rx_packet *tnp;
3840 if (rx_stats_active)
3841 rx_atomic_inc(&rx_stats.dataPacketsRead);
3844 /* If there are no packet buffers, drop this new packet, unless we can find
3845 * packet buffers from inactive calls */
3847 && (rxi_OverQuota(RX_PACKET_CLASS_RECEIVE) || TooLow(np, call))) {
3848 MUTEX_ENTER(&rx_freePktQ_lock);
3849 rxi_NeedMorePackets = TRUE;
3850 MUTEX_EXIT(&rx_freePktQ_lock);
3851 if (rx_stats_active)
3852 rx_atomic_inc(&rx_stats.noPacketBuffersOnRead);
3853 rxi_calltrace(RX_TRACE_DROP, call);
3854 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - quota problems\n", np));
3855 /* We used to clear the receive queue here, in an attempt to free
3856 * packets. However this is unsafe if the queue has received a
3857 * soft ACK for the final packet */
3858 rxi_PostDelayedAckEvent(call, &rx_softAckDelay);
3864 * New in AFS 3.5, if the RX_JUMBO_PACKET flag is set then this
3865 * packet is one of several packets transmitted as a single
3866 * datagram. Do not send any soft or hard acks until all packets
3867 * in a jumbogram have been processed. Send negative acks right away.
3869 for (isFirst = 1, tnp = NULL; isFirst || tnp; isFirst = 0) {
3870 /* tnp is non-null when there are more packets in the
3871 * current jumbo gram */
3878 seq = np->header.seq;
3879 serial = np->header.serial;
3880 flags = np->header.flags;
3882 /* If the call is in an error state, send an abort message */
3884 return rxi_SendCallAbort(call, np, istack, 0);
3886 /* The RX_JUMBO_PACKET is set in all but the last packet in each
3887 * AFS 3.5 jumbogram. */
3888 if (flags & RX_JUMBO_PACKET) {
3889 tnp = rxi_SplitJumboPacket(np, host, port, isFirst);
3894 if (np->header.spare != 0) {
3895 MUTEX_ENTER(&call->conn->conn_data_lock);
3896 call->conn->flags |= RX_CONN_USING_PACKET_CKSUM;
3897 MUTEX_EXIT(&call->conn->conn_data_lock);
3900 /* The usual case is that this is the expected next packet */
3901 if (seq == call->rnext) {
3903 /* Check to make sure it is not a duplicate of one already queued */
3904 if (!opr_queue_IsEmpty(&call->rq)
3905 && opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq == seq) {
3906 if (rx_stats_active)
3907 rx_atomic_inc(&rx_stats.dupPacketsRead);
3908 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - duplicate\n", np));
3909 rxevent_Cancel(&call->delayedAckEvent, call,
3910 RX_CALL_REFCOUNT_DELAY);
3911 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3917 /* It's the next packet. Stick it on the receive queue
3918 * for this call. Set newPackets to make sure we wake
3919 * the reader once all packets have been processed */
3920 #ifdef RX_TRACK_PACKETS
3921 np->flags |= RX_PKTFLAG_RQ;
3923 opr_queue_Prepend(&call->rq, &np->entry);
3924 #ifdef RXDEBUG_PACKET
3926 #endif /* RXDEBUG_PACKET */
3928 np = NULL; /* We can't use this anymore */
3931 /* If an ack is requested then set a flag to make sure we
3932 * send an acknowledgement for this packet */
3933 if (flags & RX_REQUEST_ACK) {
3934 ackNeeded = RX_ACK_REQUESTED;
3937 /* Keep track of whether we have received the last packet */
3938 if (flags & RX_LAST_PACKET) {
3939 call->flags |= RX_CALL_HAVE_LAST;
3943 /* Check whether we have all of the packets for this call */
3944 if (call->flags & RX_CALL_HAVE_LAST) {
3945 afs_uint32 tseq; /* temporary sequence number */
3946 struct opr_queue *cursor;
3948 for (tseq = seq, opr_queue_Scan(&call->rq, cursor)) {
3949 struct rx_packet *tp;
3951 tp = opr_queue_Entry(cursor, struct rx_packet, entry);
3952 if (tseq != tp->header.seq)
3954 if (tp->header.flags & RX_LAST_PACKET) {
3955 call->flags |= RX_CALL_RECEIVE_DONE;
3962 /* Provide asynchronous notification for those who want it
3963 * (e.g. multi rx) */
3964 if (call->arrivalProc) {
3965 (*call->arrivalProc) (call, call->arrivalProcHandle,
3966 call->arrivalProcArg);
3967 call->arrivalProc = (void (*)())0;
3970 /* Update last packet received */
3973 /* If there is no server process serving this call, grab
3974 * one, if available. We only need to do this once. If a
3975 * server thread is available, this thread becomes a server
3976 * thread and the server thread becomes a listener thread. */
3978 TryAttach(call, socket, tnop, newcallp, 0);
3981 /* This is not the expected next packet. */
3983 /* Determine whether this is a new or old packet, and if it's
3984 * a new one, whether it fits into the current receive window.
3985 * Also figure out whether the packet was delivered in sequence.
3986 * We use the prev variable to determine whether the new packet
3987 * is the successor of its immediate predecessor in the
3988 * receive queue, and the missing flag to determine whether
3989 * any of this packets predecessors are missing. */
3991 afs_uint32 prev; /* "Previous packet" sequence number */
3992 struct opr_queue *cursor;
3993 int missing; /* Are any predecessors missing? */
3995 /* If the new packet's sequence number has been sent to the
3996 * application already, then this is a duplicate */
3997 if (seq < call->rnext) {
3998 if (rx_stats_active)
3999 rx_atomic_inc(&rx_stats.dupPacketsRead);
4000 rxevent_Cancel(&call->delayedAckEvent, call,
4001 RX_CALL_REFCOUNT_DELAY);
4002 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
4008 /* If the sequence number is greater than what can be
4009 * accomodated by the current window, then send a negative
4010 * acknowledge and drop the packet */
4011 if ((call->rnext + call->rwind) <= seq) {
4012 rxevent_Cancel(&call->delayedAckEvent, call,
4013 RX_CALL_REFCOUNT_DELAY);
4014 np = rxi_SendAck(call, np, serial, RX_ACK_EXCEEDS_WINDOW,
4021 /* Look for the packet in the queue of old received packets */
4022 prev = call->rnext - 1;
4024 for (opr_queue_Scan(&call->rq, cursor)) {
4025 struct rx_packet *tp
4026 = opr_queue_Entry(cursor, struct rx_packet, entry);
4028 /*Check for duplicate packet */
4029 if (seq == tp->header.seq) {
4030 if (rx_stats_active)
4031 rx_atomic_inc(&rx_stats.dupPacketsRead);
4032 rxevent_Cancel(&call->delayedAckEvent, call,
4033 RX_CALL_REFCOUNT_DELAY);
4034 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE,
4040 /* If we find a higher sequence packet, break out and
4041 * insert the new packet here. */
4042 if (seq < tp->header.seq)
4044 /* Check for missing packet */
4045 if (tp->header.seq != prev + 1) {
4049 prev = tp->header.seq;
4052 /* Keep track of whether we have received the last packet. */
4053 if (flags & RX_LAST_PACKET) {
4054 call->flags |= RX_CALL_HAVE_LAST;
4057 /* It's within the window: add it to the the receive queue.
4058 * tp is left by the previous loop either pointing at the
4059 * packet before which to insert the new packet, or at the
4060 * queue head if the queue is empty or the packet should be
4062 #ifdef RX_TRACK_PACKETS
4063 np->flags |= RX_PKTFLAG_RQ;
4065 #ifdef RXDEBUG_PACKET
4067 #endif /* RXDEBUG_PACKET */
4068 opr_queue_InsertBefore(cursor, &np->entry);
4072 /* Check whether we have all of the packets for this call */
4073 if ((call->flags & RX_CALL_HAVE_LAST)
4074 && !(call->flags & RX_CALL_RECEIVE_DONE)) {
4075 afs_uint32 tseq; /* temporary sequence number */
4078 for (opr_queue_Scan(&call->rq, cursor)) {
4079 struct rx_packet *tp
4080 = opr_queue_Entry(cursor, struct rx_packet, entry);
4081 if (tseq != tp->header.seq)
4083 if (tp->header.flags & RX_LAST_PACKET) {
4084 call->flags |= RX_CALL_RECEIVE_DONE;
4091 /* We need to send an ack of the packet is out of sequence,
4092 * or if an ack was requested by the peer. */
4093 if (seq != prev + 1 || missing) {
4094 ackNeeded = RX_ACK_OUT_OF_SEQUENCE;
4095 } else if (flags & RX_REQUEST_ACK) {
4096 ackNeeded = RX_ACK_REQUESTED;
4099 /* Acknowledge the last packet for each call */
4100 if (flags & RX_LAST_PACKET) {
4111 * If the receiver is waiting for an iovec, fill the iovec
4112 * using the data from the receive queue */
4113 if (call->flags & RX_CALL_IOVEC_WAIT) {
4114 didHardAck = rxi_FillReadVec(call, serial);
4115 /* the call may have been aborted */
4124 /* Wakeup the reader if any */
4125 if ((call->flags & RX_CALL_READER_WAIT)
4126 && (!(call->flags & RX_CALL_IOVEC_WAIT) || !(call->iovNBytes)
4127 || (call->iovNext >= call->iovMax)
4128 || (call->flags & RX_CALL_RECEIVE_DONE))) {
4129 call->flags &= ~RX_CALL_READER_WAIT;
4130 #ifdef RX_ENABLE_LOCKS
4131 CV_BROADCAST(&call->cv_rq);
4133 osi_rxWakeup(&call->rq);
4139 * Send an ack when requested by the peer, or once every
4140 * rxi_SoftAckRate packets until the last packet has been
4141 * received. Always send a soft ack for the last packet in
4142 * the server's reply. */
4144 rxevent_Cancel(&call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4145 np = rxi_SendAck(call, np, serial, ackNeeded, istack);
4146 } else if (call->nSoftAcks > (u_short) rxi_SoftAckRate) {
4147 rxevent_Cancel(&call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4148 np = rxi_SendAck(call, np, serial, RX_ACK_IDLE, istack);
4149 } else if (call->nSoftAcks) {
4150 if (haveLast && !(flags & RX_CLIENT_INITIATED))
4151 rxi_PostDelayedAckEvent(call, &rx_lastAckDelay);
4153 rxi_PostDelayedAckEvent(call, &rx_softAckDelay);
4154 } else if (call->flags & RX_CALL_RECEIVE_DONE) {
4155 rxevent_Cancel(&call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4162 rxi_UpdatePeerReach(struct rx_connection *conn, struct rx_call *acall)
4164 struct rx_peer *peer = conn->peer;
4166 MUTEX_ENTER(&peer->peer_lock);
4167 peer->lastReachTime = clock_Sec();
4168 MUTEX_EXIT(&peer->peer_lock);
4170 MUTEX_ENTER(&conn->conn_data_lock);
4171 if (conn->flags & RX_CONN_ATTACHWAIT) {
4174 rxi_ConnClearAttachWait(conn);
4175 MUTEX_EXIT(&conn->conn_data_lock);
4177 for (i = 0; i < RX_MAXCALLS; i++) {
4178 struct rx_call *call = conn->call[i];
4181 MUTEX_ENTER(&call->lock);
4182 /* tnop can be null if newcallp is null */
4183 TryAttach(call, (osi_socket) - 1, NULL, NULL, 1);
4185 MUTEX_EXIT(&call->lock);
4189 MUTEX_EXIT(&conn->conn_data_lock);
4192 #if defined(RXDEBUG) && defined(AFS_NT40_ENV)
4194 rx_ack_reason(int reason)
4197 case RX_ACK_REQUESTED:
4199 case RX_ACK_DUPLICATE:
4201 case RX_ACK_OUT_OF_SEQUENCE:
4203 case RX_ACK_EXCEEDS_WINDOW:
4205 case RX_ACK_NOSPACE:
4209 case RX_ACK_PING_RESPONSE:
4222 /* The real smarts of the whole thing. */
4223 static struct rx_packet *
4224 rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
4227 struct rx_ackPacket *ap;
4229 struct rx_packet *tp;
4230 struct rx_connection *conn = call->conn;
4231 struct rx_peer *peer = conn->peer;
4232 struct opr_queue *cursor;
4233 struct clock now; /* Current time, for RTT calculations */
4241 int newAckCount = 0;
4242 int maxDgramPackets = 0; /* Set if peer supports AFS 3.5 jumbo datagrams */
4243 int pktsize = 0; /* Set if we need to update the peer mtu */
4244 int conn_data_locked = 0;
4246 if (rx_stats_active)
4247 rx_atomic_inc(&rx_stats.ackPacketsRead);
4248 ap = (struct rx_ackPacket *)rx_DataOf(np);
4249 nbytes = rx_Contiguous(np) - (int)((ap->acks) - (u_char *) ap);
4251 return np; /* truncated ack packet */
4253 /* depends on ack packet struct */
4254 nAcks = MIN((unsigned)nbytes, (unsigned)ap->nAcks);
4255 first = ntohl(ap->firstPacket);
4256 prev = ntohl(ap->previousPacket);
4257 serial = ntohl(ap->serial);
4260 * Ignore ack packets received out of order while protecting
4261 * against peers that set the previousPacket field to a packet
4262 * serial number instead of a sequence number.
4264 if (first < call->tfirst ||
4265 (first == call->tfirst && prev < call->tprev && prev < call->tfirst
4272 if (np->header.flags & RX_SLOW_START_OK) {
4273 call->flags |= RX_CALL_SLOW_START_OK;
4276 if (ap->reason == RX_ACK_PING_RESPONSE)
4277 rxi_UpdatePeerReach(conn, call);
4279 if (conn->lastPacketSizeSeq) {
4280 MUTEX_ENTER(&conn->conn_data_lock);
4281 conn_data_locked = 1;
4282 if ((first > conn->lastPacketSizeSeq) && (conn->lastPacketSize)) {
4283 pktsize = conn->lastPacketSize;
4284 conn->lastPacketSize = conn->lastPacketSizeSeq = 0;
4287 if ((ap->reason == RX_ACK_PING_RESPONSE) && (conn->lastPingSizeSer)) {
4288 if (!conn_data_locked) {
4289 MUTEX_ENTER(&conn->conn_data_lock);
4290 conn_data_locked = 1;
4292 if ((conn->lastPingSizeSer == serial) && (conn->lastPingSize)) {
4293 /* process mtu ping ack */
4294 pktsize = conn->lastPingSize;
4295 conn->lastPingSizeSer = conn->lastPingSize = 0;
4299 if (conn_data_locked) {
4300 MUTEX_EXIT(&conn->conn_data_lock);
4301 conn_data_locked = 0;
4305 if (rxdebug_active) {
4309 len = _snprintf(msg, sizeof(msg),
4310 "tid[%d] RACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
4311 GetCurrentThreadId(), rx_ack_reason(ap->reason),
4312 ntohl(ap->serial), ntohl(ap->previousPacket),
4313 (unsigned int)np->header.seq, ntohl(ap->firstPacket),
4314 ap->nAcks, ntohs(ap->bufferSpace) );
4318 for (offset = 0; offset < nAcks && len < sizeof(msg); offset++)
4319 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
4323 OutputDebugString(msg);
4325 #else /* AFS_NT40_ENV */
4328 "RACK: reason %x previous %u seq %u serial %u first %u",
4329 ap->reason, ntohl(ap->previousPacket),
4330 (unsigned int)np->header.seq, (unsigned int)serial,
4331 ntohl(ap->firstPacket));
4334 for (offset = 0; offset < nAcks; offset++)
4335 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
4340 #endif /* AFS_NT40_ENV */
4343 MUTEX_ENTER(&peer->peer_lock);
4346 * Start somewhere. Can't assume we can send what we can receive,
4347 * but we are clearly receiving.
4349 if (!peer->maxPacketSize)
4350 peer->maxPacketSize = RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE;
4352 if (pktsize > peer->maxPacketSize) {
4353 peer->maxPacketSize = pktsize;
4354 if ((pktsize-RX_IPUDP_SIZE > peer->ifMTU)) {
4355 peer->ifMTU=pktsize-RX_IPUDP_SIZE;
4356 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
4357 rxi_ScheduleGrowMTUEvent(call, 1);
4362 clock_GetTime(&now);
4364 /* The transmit queue splits into 4 sections.
4366 * The first section is packets which have now been acknowledged
4367 * by a window size change in the ack. These have reached the
4368 * application layer, and may be discarded. These are packets
4369 * with sequence numbers < ap->firstPacket.
4371 * The second section is packets which have sequence numbers in
4372 * the range ap->firstPacket to ap->firstPacket + ap->nAcks. The
4373 * contents of the packet's ack array determines whether these
4374 * packets are acknowledged or not.
4376 * The third section is packets which fall above the range
4377 * addressed in the ack packet. These have not yet been received
4380 * The four section is packets which have not yet been transmitted.
4381 * These packets will have a header.serial of 0.
4384 /* First section - implicitly acknowledged packets that can be
4388 tp = opr_queue_First(&call->tq, struct rx_packet, entry);
4389 while(!opr_queue_IsEnd(&call->tq, &tp->entry) && tp->header.seq < first) {
4390 struct rx_packet *next;
4392 next = opr_queue_Next(&tp->entry, struct rx_packet, entry);
4393 call->tfirst = tp->header.seq + 1;
4395 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4397 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4400 #ifdef RX_ENABLE_LOCKS
4401 /* XXX Hack. Because we have to release the global call lock when sending
4402 * packets (osi_NetSend) we drop all acks while we're traversing the tq
4403 * in rxi_Start sending packets out because packets may move to the
4404 * freePacketQueue as result of being here! So we drop these packets until
4405 * we're safely out of the traversing. Really ugly!
4406 * To make it even uglier, if we're using fine grain locking, we can
4407 * set the ack bits in the packets and have rxi_Start remove the packets
4408 * when it's done transmitting.
4410 if (call->flags & RX_CALL_TQ_BUSY) {
4411 tp->flags |= RX_PKTFLAG_ACKED;
4412 call->flags |= RX_CALL_TQ_SOME_ACKED;
4414 #endif /* RX_ENABLE_LOCKS */
4416 opr_queue_Remove(&tp->entry);
4417 #ifdef RX_TRACK_PACKETS
4418 tp->flags &= ~RX_PKTFLAG_TQ;
4420 #ifdef RXDEBUG_PACKET
4422 #endif /* RXDEBUG_PACKET */
4423 rxi_FreePacket(tp); /* rxi_FreePacket mustn't wake up anyone, preemptively. */
4428 /* N.B. we don't turn off any timers here. They'll go away by themselves, anyway */
4430 /* Second section of the queue - packets for which we are receiving
4433 * Go through the explicit acks/nacks and record the results in
4434 * the waiting packets. These are packets that can't be released
4435 * yet, even with a positive acknowledge. This positive
4436 * acknowledge only means the packet has been received by the
4437 * peer, not that it will be retained long enough to be sent to
4438 * the peer's upper level. In addition, reset the transmit timers
4439 * of any missing packets (those packets that must be missing
4440 * because this packet was out of sequence) */
4442 call->nSoftAcked = 0;
4444 while (!opr_queue_IsEnd(&call->tq, &tp->entry)
4445 && tp->header.seq < first + nAcks) {
4446 /* Set the acknowledge flag per packet based on the
4447 * information in the ack packet. An acknowlegded packet can
4448 * be downgraded when the server has discarded a packet it
4449 * soacked previously, or when an ack packet is received
4450 * out of sequence. */
4451 if (ap->acks[tp->header.seq - first] == RX_ACK_TYPE_ACK) {
4452 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4454 tp->flags |= RX_PKTFLAG_ACKED;
4455 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4462 } else /* RX_ACK_TYPE_NACK */ {
4463 tp->flags &= ~RX_PKTFLAG_ACKED;
4467 tp = opr_queue_Next(&tp->entry, struct rx_packet, entry);
4470 /* We don't need to take any action with the 3rd or 4th section in the
4471 * queue - they're not addressed by the contents of this ACK packet.
4474 /* If the window has been extended by this acknowledge packet,
4475 * then wakeup a sender waiting in alloc for window space, or try
4476 * sending packets now, if he's been sitting on packets due to
4477 * lack of window space */
4478 if (call->tnext < (call->tfirst + call->twind)) {
4479 #ifdef RX_ENABLE_LOCKS
4480 CV_SIGNAL(&call->cv_twind);
4482 if (call->flags & RX_CALL_WAIT_WINDOW_ALLOC) {
4483 call->flags &= ~RX_CALL_WAIT_WINDOW_ALLOC;
4484 osi_rxWakeup(&call->twind);
4487 if (call->flags & RX_CALL_WAIT_WINDOW_SEND) {
4488 call->flags &= ~RX_CALL_WAIT_WINDOW_SEND;
4492 /* if the ack packet has a receivelen field hanging off it,
4493 * update our state */
4494 if (np->length >= rx_AckDataSize(ap->nAcks) + 2 * sizeof(afs_int32)) {
4497 /* If the ack packet has a "recommended" size that is less than
4498 * what I am using now, reduce my size to match */
4499 rx_packetread(np, rx_AckDataSize(ap->nAcks) + (int)sizeof(afs_int32),
4500 (int)sizeof(afs_int32), &tSize);
4501 tSize = (afs_uint32) ntohl(tSize);
4502 peer->natMTU = rxi_AdjustIfMTU(MIN(tSize, peer->ifMTU));
4504 /* Get the maximum packet size to send to this peer */
4505 rx_packetread(np, rx_AckDataSize(ap->nAcks), (int)sizeof(afs_int32),
4507 tSize = (afs_uint32) ntohl(tSize);
4508 tSize = (afs_uint32) MIN(tSize, rx_MyMaxSendSize);
4509 tSize = rxi_AdjustMaxMTU(peer->natMTU, tSize);
4511 /* sanity check - peer might have restarted with different params.
4512 * If peer says "send less", dammit, send less... Peer should never
4513 * be unable to accept packets of the size that prior AFS versions would
4514 * send without asking. */
4515 if (peer->maxMTU != tSize) {
4516 if (peer->maxMTU > tSize) /* possible cong., maxMTU decreased */
4518 peer->maxMTU = tSize;
4519 peer->MTU = MIN(tSize, peer->MTU);
4520 call->MTU = MIN(call->MTU, tSize);
4523 if (np->length == rx_AckDataSize(ap->nAcks) + 3 * sizeof(afs_int32)) {
4526 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4527 (int)sizeof(afs_int32), &tSize);
4528 tSize = (afs_uint32) ntohl(tSize); /* peer's receive window, if it's */
4529 if (tSize < call->twind) { /* smaller than our send */
4530 call->twind = tSize; /* window, we must send less... */
4531 call->ssthresh = MIN(call->twind, call->ssthresh);
4532 call->conn->twind[call->channel] = call->twind;
4535 /* Only send jumbograms to 3.4a fileservers. 3.3a RX gets the
4536 * network MTU confused with the loopback MTU. Calculate the
4537 * maximum MTU here for use in the slow start code below.
4539 /* Did peer restart with older RX version? */
4540 if (peer->maxDgramPackets > 1) {
4541 peer->maxDgramPackets = 1;
4543 } else if (np->length >=
4544 rx_AckDataSize(ap->nAcks) + 4 * sizeof(afs_int32)) {
4547 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4548 sizeof(afs_int32), &tSize);
4549 tSize = (afs_uint32) ntohl(tSize);
4551 * As of AFS 3.5 we set the send window to match the receive window.
4553 if (tSize < call->twind) {
4554 call->twind = tSize;
4555 call->conn->twind[call->channel] = call->twind;
4556 call->ssthresh = MIN(call->twind, call->ssthresh);
4557 } else if (tSize > call->twind) {
4558 call->twind = tSize;
4559 call->conn->twind[call->channel] = call->twind;
4563 * As of AFS 3.5, a jumbogram is more than one fixed size
4564 * packet transmitted in a single UDP datagram. If the remote
4565 * MTU is smaller than our local MTU then never send a datagram
4566 * larger than the natural MTU.
4569 rx_AckDataSize(ap->nAcks) + 3 * (int)sizeof(afs_int32),
4570 (int)sizeof(afs_int32), &tSize);
4571 maxDgramPackets = (afs_uint32) ntohl(tSize);
4572 maxDgramPackets = MIN(maxDgramPackets, rxi_nDgramPackets);
4574 MIN(maxDgramPackets, (int)(peer->ifDgramPackets));
4575 if (maxDgramPackets > 1) {
4576 peer->maxDgramPackets = maxDgramPackets;
4577 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
4579 peer->maxDgramPackets = 1;
4580 call->MTU = peer->natMTU;
4582 } else if (peer->maxDgramPackets > 1) {
4583 /* Restarted with lower version of RX */
4584 peer->maxDgramPackets = 1;
4586 } else if (peer->maxDgramPackets > 1
4587 || peer->maxMTU != OLD_MAX_PACKET_SIZE) {
4588 /* Restarted with lower version of RX */
4589 peer->maxMTU = OLD_MAX_PACKET_SIZE;
4590 peer->natMTU = OLD_MAX_PACKET_SIZE;
4591 peer->MTU = OLD_MAX_PACKET_SIZE;
4592 peer->maxDgramPackets = 1;
4593 peer->nDgramPackets = 1;
4595 call->MTU = OLD_MAX_PACKET_SIZE;
4600 * Calculate how many datagrams were successfully received after
4601 * the first missing packet and adjust the negative ack counter
4606 nNacked = (nNacked + call->nDgramPackets - 1) / call->nDgramPackets;
4607 if (call->nNacks < nNacked) {
4608 call->nNacks = nNacked;
4611 call->nAcks += newAckCount;
4615 /* If the packet contained new acknowledgements, rather than just
4616 * being a duplicate of one we have previously seen, then we can restart
4619 if (newAckCount > 0)
4620 rxi_rto_packet_acked(call, istack);
4622 if (call->flags & RX_CALL_FAST_RECOVER) {
4623 if (newAckCount == 0) {
4624 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4626 call->flags &= ~RX_CALL_FAST_RECOVER;
4627 call->cwind = call->nextCwind;
4628 call->nextCwind = 0;
4631 call->nCwindAcks = 0;
4632 } else if (nNacked && call->nNacks >= (u_short) rx_nackThreshold) {
4633 /* Three negative acks in a row trigger congestion recovery */
4634 call->flags |= RX_CALL_FAST_RECOVER;
4635 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
4637 MIN((int)(call->ssthresh + rx_nackThreshold), rx_maxSendWindow);
4638 call->nDgramPackets = MAX(2, (int)call->nDgramPackets) >> 1;
4639 call->nextCwind = call->ssthresh;
4642 peer->MTU = call->MTU;
4643 peer->cwind = call->nextCwind;
4644 peer->nDgramPackets = call->nDgramPackets;
4646 call->congestSeq = peer->congestSeq;
4648 /* Reset the resend times on the packets that were nacked
4649 * so we will retransmit as soon as the window permits
4653 for (opr_queue_ScanBackwards(&call->tq, cursor)) {
4654 struct rx_packet *tp =
4655 opr_queue_Entry(cursor, struct rx_packet, entry);
4657 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4658 tp->flags &= ~RX_PKTFLAG_SENT;
4660 } else if (tp->flags & RX_PKTFLAG_ACKED) {
4665 /* If cwind is smaller than ssthresh, then increase
4666 * the window one packet for each ack we receive (exponential
4668 * If cwind is greater than or equal to ssthresh then increase
4669 * the congestion window by one packet for each cwind acks we
4670 * receive (linear growth). */
4671 if (call->cwind < call->ssthresh) {
4673 MIN((int)call->ssthresh, (int)(call->cwind + newAckCount));
4674 call->nCwindAcks = 0;
4676 call->nCwindAcks += newAckCount;
4677 if (call->nCwindAcks >= call->cwind) {
4678 call->nCwindAcks = 0;
4679 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4683 * If we have received several acknowledgements in a row then
4684 * it is time to increase the size of our datagrams
4686 if ((int)call->nAcks > rx_nDgramThreshold) {
4687 if (peer->maxDgramPackets > 1) {
4688 if (call->nDgramPackets < peer->maxDgramPackets) {
4689 call->nDgramPackets++;
4691 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
4692 } else if (call->MTU < peer->maxMTU) {
4693 /* don't upgrade if we can't handle it */
4694 if ((call->nDgramPackets == 1) && (call->MTU >= peer->ifMTU))
4695 call->MTU = peer->ifMTU;
4697 call->MTU += peer->natMTU;
4698 call->MTU = MIN(call->MTU, peer->maxMTU);
4705 MUTEX_EXIT(&peer->peer_lock); /* rxi_Start will lock peer. */
4707 /* Servers need to hold the call until all response packets have
4708 * been acknowledged. Soft acks are good enough since clients
4709 * are not allowed to clear their receive queues. */
4710 if (call->state == RX_STATE_HOLD
4711 && call->tfirst + call->nSoftAcked >= call->tnext) {
4712 call->state = RX_STATE_DALLY;
4713 rxi_ClearTransmitQueue(call, 0);
4714 rxevent_Cancel(&call->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE);
4715 } else if (!opr_queue_IsEmpty(&call->tq)) {
4716 rxi_Start(call, istack);
4721 /* Received a response to a challenge packet */
4722 static struct rx_packet *
4723 rxi_ReceiveResponsePacket(struct rx_connection *conn,
4724 struct rx_packet *np, int istack)
4728 /* Ignore the packet if we're the client */
4729 if (conn->type == RX_CLIENT_CONNECTION)
4732 /* If already authenticated, ignore the packet (it's probably a retry) */
4733 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0)
4736 /* Otherwise, have the security object evaluate the response packet */
4737 error = RXS_CheckResponse(conn->securityObject, conn, np);
4739 /* If the response is invalid, reset the connection, sending
4740 * an abort to the peer */
4744 rxi_ConnectionError(conn, error);
4745 MUTEX_ENTER(&conn->conn_data_lock);
4746 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4747 MUTEX_EXIT(&conn->conn_data_lock);
4750 /* If the response is valid, any calls waiting to attach
4751 * servers can now do so */
4754 for (i = 0; i < RX_MAXCALLS; i++) {
4755 struct rx_call *call = conn->call[i];
4757 MUTEX_ENTER(&call->lock);
4758 if (call->state == RX_STATE_PRECALL)
4759 rxi_AttachServerProc(call, (osi_socket) - 1, NULL, NULL);
4760 /* tnop can be null if newcallp is null */
4761 MUTEX_EXIT(&call->lock);
4765 /* Update the peer reachability information, just in case
4766 * some calls went into attach-wait while we were waiting
4767 * for authentication..
4769 rxi_UpdatePeerReach(conn, NULL);
4774 /* A client has received an authentication challenge: the security
4775 * object is asked to cough up a respectable response packet to send
4776 * back to the server. The server is responsible for retrying the
4777 * challenge if it fails to get a response. */
4779 static struct rx_packet *
4780 rxi_ReceiveChallengePacket(struct rx_connection *conn,
4781 struct rx_packet *np, int istack)
4785 /* Ignore the challenge if we're the server */
4786 if (conn->type == RX_SERVER_CONNECTION)
4789 /* Ignore the challenge if the connection is otherwise idle; someone's
4790 * trying to use us as an oracle. */
4791 if (!rxi_HasActiveCalls(conn))
4794 /* Send the security object the challenge packet. It is expected to fill
4795 * in the response. */
4796 error = RXS_GetResponse(conn->securityObject, conn, np);
4798 /* If the security object is unable to return a valid response, reset the
4799 * connection and send an abort to the peer. Otherwise send the response
4800 * packet to the peer connection. */
4802 rxi_ConnectionError(conn, error);
4803 MUTEX_ENTER(&conn->conn_data_lock);
4804 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4805 MUTEX_EXIT(&conn->conn_data_lock);
4807 np = rxi_SendSpecial((struct rx_call *)0, conn, np,
4808 RX_PACKET_TYPE_RESPONSE, NULL, -1, istack);
4814 /* Find an available server process to service the current request in
4815 * the given call structure. If one isn't available, queue up this
4816 * call so it eventually gets one */
4818 rxi_AttachServerProc(struct rx_call *call,
4819 osi_socket socket, int *tnop,
4820 struct rx_call **newcallp)
4822 struct rx_serverQueueEntry *sq;
4823 struct rx_service *service = call->conn->service;
4826 /* May already be attached */
4827 if (call->state == RX_STATE_ACTIVE)
4830 MUTEX_ENTER(&rx_serverPool_lock);
4832 haveQuota = QuotaOK(service);
4833 if ((!haveQuota) || opr_queue_IsEmpty(&rx_idleServerQueue)) {
4834 /* If there are no processes available to service this call,
4835 * put the call on the incoming call queue (unless it's
4836 * already on the queue).
4838 #ifdef RX_ENABLE_LOCKS
4840 ReturnToServerPool(service);
4841 #endif /* RX_ENABLE_LOCKS */
4843 if (!(call->flags & RX_CALL_WAIT_PROC)) {
4844 call->flags |= RX_CALL_WAIT_PROC;
4845 rx_atomic_inc(&rx_nWaiting);
4846 rx_atomic_inc(&rx_nWaited);
4847 rxi_calltrace(RX_CALL_ARRIVAL, call);
4848 SET_CALL_QUEUE_LOCK(call, &rx_serverPool_lock);
4849 opr_queue_Append(&rx_incomingCallQueue, &call->entry);
4852 sq = opr_queue_Last(&rx_idleServerQueue,
4853 struct rx_serverQueueEntry, entry);
4855 /* If hot threads are enabled, and both newcallp and sq->socketp
4856 * are non-null, then this thread will process the call, and the
4857 * idle server thread will start listening on this threads socket.
4859 opr_queue_Remove(&sq->entry);
4861 if (rx_enable_hot_thread && newcallp && sq->socketp) {
4864 *sq->socketp = socket;
4865 clock_GetTime(&call->startTime);
4866 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
4870 if (call->flags & RX_CALL_WAIT_PROC) {
4871 /* Conservative: I don't think this should happen */
4872 call->flags &= ~RX_CALL_WAIT_PROC;
4873 rx_atomic_dec(&rx_nWaiting);
4874 if (opr_queue_IsOnQueue(&call->entry)) {
4875 opr_queue_Remove(&call->entry);
4878 call->state = RX_STATE_ACTIVE;
4879 call->app.mode = RX_MODE_RECEIVING;
4880 #ifdef RX_KERNEL_TRACE
4882 int glockOwner = ISAFS_GLOCK();
4885 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
4886 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
4892 if (call->flags & RX_CALL_CLEARED) {
4893 /* send an ack now to start the packet flow up again */
4894 call->flags &= ~RX_CALL_CLEARED;
4895 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4897 #ifdef RX_ENABLE_LOCKS
4900 service->nRequestsRunning++;
4901 MUTEX_ENTER(&rx_quota_mutex);
4902 if (service->nRequestsRunning <= service->minProcs)
4905 MUTEX_EXIT(&rx_quota_mutex);
4909 MUTEX_EXIT(&rx_serverPool_lock);
4912 /* Delay the sending of an acknowledge event for a short while, while
4913 * a new call is being prepared (in the case of a client) or a reply
4914 * is being prepared (in the case of a server). Rather than sending
4915 * an ack packet, an ACKALL packet is sent. */
4917 rxi_AckAll(struct rx_call *call)
4919 rxi_SendSpecial(call, call->conn, NULL, RX_PACKET_TYPE_ACKALL,
4921 call->flags |= RX_CALL_ACKALL_SENT;
4925 rxi_SendDelayedAck(struct rxevent *event, void *arg1, void *unused1,
4928 struct rx_call *call = arg1;
4929 #ifdef RX_ENABLE_LOCKS
4931 MUTEX_ENTER(&call->lock);
4932 if (event == call->delayedAckEvent) {
4933 rxevent_Put(call->delayedAckEvent);
4934 call->delayedAckEvent = NULL;
4936 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
4938 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4940 MUTEX_EXIT(&call->lock);
4941 #else /* RX_ENABLE_LOCKS */
4943 rxevent_Put(call->delayedAckEvent);
4944 call->delayedAckEvent = NULL;
4946 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4947 #endif /* RX_ENABLE_LOCKS */
4950 #ifdef RX_ENABLE_LOCKS
4951 /* Set ack in all packets in transmit queue. rxi_Start will deal with
4952 * clearing them out.
4955 rxi_SetAcksInTransmitQueue(struct rx_call *call)
4957 struct opr_queue *cursor;
4960 for (opr_queue_Scan(&call->tq, cursor)) {
4962 = opr_queue_Entry(cursor, struct rx_packet, entry);
4964 p->flags |= RX_PKTFLAG_ACKED;
4969 call->flags |= RX_CALL_TQ_CLEARME;
4970 call->flags |= RX_CALL_TQ_SOME_ACKED;
4973 rxi_rto_cancel(call);
4975 call->tfirst = call->tnext;
4976 call->nSoftAcked = 0;
4978 if (call->flags & RX_CALL_FAST_RECOVER) {
4979 call->flags &= ~RX_CALL_FAST_RECOVER;
4980 call->cwind = call->nextCwind;
4981 call->nextCwind = 0;
4984 CV_SIGNAL(&call->cv_twind);
4986 #endif /* RX_ENABLE_LOCKS */
4989 * Acknowledge the whole transmit queue.
4991 * If we're running without locks, or the transmit queue isn't busy, then
4992 * we can just clear the queue now. Otherwise, we have to mark all of the
4993 * packets as acknowledged, and let rxi_Start clear it later on
4996 rxi_AckAllInTransmitQueue(struct rx_call *call)
4998 #ifdef RX_ENABLE_LOCKS
4999 if (call->flags & RX_CALL_TQ_BUSY) {
5000 rxi_SetAcksInTransmitQueue(call);
5004 rxi_ClearTransmitQueue(call, 0);
5006 /* Clear out the transmit queue for the current call (all packets have
5007 * been received by peer) */
5009 rxi_ClearTransmitQueue(struct rx_call *call, int force)
5011 #ifdef RX_ENABLE_LOCKS
5012 struct opr_queue *cursor;
5013 if (!force && (call->flags & RX_CALL_TQ_BUSY)) {
5015 for (opr_queue_Scan(&call->tq, cursor)) {
5017 = opr_queue_Entry(cursor, struct rx_packet, entry);
5019 p->flags |= RX_PKTFLAG_ACKED;
5023 call->flags |= RX_CALL_TQ_CLEARME;
5024 call->flags |= RX_CALL_TQ_SOME_ACKED;
5027 #endif /* RX_ENABLE_LOCKS */
5028 #ifdef RXDEBUG_PACKET
5030 #endif /* RXDEBUG_PACKET */
5031 rxi_FreePackets(0, &call->tq);
5032 rxi_WakeUpTransmitQueue(call);
5033 #ifdef RX_ENABLE_LOCKS
5034 call->flags &= ~RX_CALL_TQ_CLEARME;
5038 rxi_rto_cancel(call);
5039 call->tfirst = call->tnext; /* implicitly acknowledge all data already sent */
5040 call->nSoftAcked = 0;
5042 if (call->flags & RX_CALL_FAST_RECOVER) {
5043 call->flags &= ~RX_CALL_FAST_RECOVER;
5044 call->cwind = call->nextCwind;
5046 #ifdef RX_ENABLE_LOCKS
5047 CV_SIGNAL(&call->cv_twind);
5049 osi_rxWakeup(&call->twind);
5054 rxi_ClearReceiveQueue(struct rx_call *call)
5056 if (!opr_queue_IsEmpty(&call->rq)) {
5059 count = rxi_FreePackets(0, &call->rq);
5060 rx_packetReclaims += count;
5061 #ifdef RXDEBUG_PACKET
5063 if ( call->rqc != 0 )
5064 dpf(("rxi_ClearReceiveQueue call %"AFS_PTR_FMT" rqc %u != 0\n", call, call->rqc));
5066 call->flags &= ~(RX_CALL_RECEIVE_DONE | RX_CALL_HAVE_LAST);
5068 if (call->state == RX_STATE_PRECALL) {
5069 call->flags |= RX_CALL_CLEARED;
5073 /* Send an abort packet for the specified call */
5074 static struct rx_packet *
5075 rxi_SendCallAbort(struct rx_call *call, struct rx_packet *packet,
5076 int istack, int force)
5078 afs_int32 error, cerror;
5079 struct clock when, now;
5084 switch (call->error) {
5087 cerror = RX_CALL_TIMEOUT;
5090 cerror = call->error;
5093 /* Clients should never delay abort messages */
5094 if (rx_IsClientConn(call->conn))
5097 if (call->abortCode != cerror) {
5098 call->abortCode = cerror;
5099 call->abortCount = 0;
5102 if (force || rxi_callAbortThreshhold == 0
5103 || call->abortCount < rxi_callAbortThreshhold) {
5104 if (call->delayedAbortEvent) {
5105 rxevent_Cancel(&call->delayedAbortEvent, call,
5106 RX_CALL_REFCOUNT_ABORT);
5108 error = htonl(cerror);
5111 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
5112 (char *)&error, sizeof(error), istack);
5113 } else if (!call->delayedAbortEvent) {
5114 clock_GetTime(&now);
5116 clock_Addmsec(&when, rxi_callAbortDelay);
5117 CALL_HOLD(call, RX_CALL_REFCOUNT_ABORT);
5118 call->delayedAbortEvent =
5119 rxevent_Post(&when, &now, rxi_SendDelayedCallAbort, call, 0, 0);
5124 /* Send an abort packet for the specified connection. Packet is an
5125 * optional pointer to a packet that can be used to send the abort.
5126 * Once the number of abort messages reaches the threshhold, an
5127 * event is scheduled to send the abort. Setting the force flag
5128 * overrides sending delayed abort messages.
5130 * NOTE: Called with conn_data_lock held. conn_data_lock is dropped
5131 * to send the abort packet.
5134 rxi_SendConnectionAbort(struct rx_connection *conn,
5135 struct rx_packet *packet, int istack, int force)
5138 struct clock when, now;
5143 /* Clients should never delay abort messages */
5144 if (rx_IsClientConn(conn))
5147 if (force || rxi_connAbortThreshhold == 0
5148 || conn->abortCount < rxi_connAbortThreshhold) {
5150 rxevent_Cancel(&conn->delayedAbortEvent, NULL, 0);
5151 error = htonl(conn->error);
5153 MUTEX_EXIT(&conn->conn_data_lock);
5155 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5156 RX_PACKET_TYPE_ABORT, (char *)&error,
5157 sizeof(error), istack);
5158 MUTEX_ENTER(&conn->conn_data_lock);
5159 } else if (!conn->delayedAbortEvent) {
5160 clock_GetTime(&now);
5162 clock_Addmsec(&when, rxi_connAbortDelay);
5163 conn->delayedAbortEvent =
5164 rxevent_Post(&when, &now, rxi_SendDelayedConnAbort, conn, NULL, 0);
5169 /* Associate an error all of the calls owned by a connection. Called
5170 * with error non-zero. This is only for really fatal things, like
5171 * bad authentication responses. The connection itself is set in
5172 * error at this point, so that future packets received will be
5175 rxi_ConnectionError(struct rx_connection *conn,
5181 dpf(("rxi_ConnectionError conn %"AFS_PTR_FMT" error %d\n", conn, error));
5183 MUTEX_ENTER(&conn->conn_data_lock);
5184 rxevent_Cancel(&conn->challengeEvent, NULL, 0);
5185 rxevent_Cancel(&conn->natKeepAliveEvent, NULL, 0);
5186 if (conn->checkReachEvent) {
5187 rxevent_Cancel(&conn->checkReachEvent, NULL, 0);
5188 conn->flags &= ~(RX_CONN_ATTACHWAIT|RX_CONN_NAT_PING);
5189 putConnection(conn);
5191 MUTEX_EXIT(&conn->conn_data_lock);
5192 for (i = 0; i < RX_MAXCALLS; i++) {
5193 struct rx_call *call = conn->call[i];
5195 MUTEX_ENTER(&call->lock);
5196 rxi_CallError(call, error);
5197 MUTEX_EXIT(&call->lock);
5200 conn->error = error;
5201 if (rx_stats_active)
5202 rx_atomic_inc(&rx_stats.fatalErrors);
5207 * Interrupt an in-progress call with the specified error and wakeup waiters.
5209 * @param[in] call The call to interrupt
5210 * @param[in] error The error code to send to the peer
5213 rx_InterruptCall(struct rx_call *call, afs_int32 error)
5215 MUTEX_ENTER(&call->lock);
5216 rxi_CallError(call, error);
5217 rxi_SendCallAbort(call, NULL, 0, 1);
5218 MUTEX_EXIT(&call->lock);
5222 rxi_CallError(struct rx_call *call, afs_int32 error)
5224 MUTEX_ASSERT(&call->lock);
5225 dpf(("rxi_CallError call %"AFS_PTR_FMT" error %d call->error %d\n", call, error, call->error));
5227 error = call->error;
5229 #ifdef RX_ENABLE_LOCKS
5230 if (!((call->flags & RX_CALL_TQ_BUSY) || (call->tqWaiters > 0))) {
5231 rxi_ResetCall(call, 0);
5234 rxi_ResetCall(call, 0);
5236 call->error = error;
5239 /* Reset various fields in a call structure, and wakeup waiting
5240 * processes. Some fields aren't changed: state & mode are not
5241 * touched (these must be set by the caller), and bufptr, nLeft, and
5242 * nFree are not reset, since these fields are manipulated by
5243 * unprotected macros, and may only be reset by non-interrupting code.
5247 rxi_ResetCall(struct rx_call *call, int newcall)
5250 struct rx_peer *peer;
5251 struct rx_packet *packet;
5253 MUTEX_ASSERT(&call->lock);
5254 dpf(("rxi_ResetCall(call %"AFS_PTR_FMT", newcall %d)\n", call, newcall));
5256 /* Notify anyone who is waiting for asynchronous packet arrival */
5257 if (call->arrivalProc) {
5258 (*call->arrivalProc) (call, call->arrivalProcHandle,
5259 call->arrivalProcArg);
5260 call->arrivalProc = (void (*)())0;
5264 rxevent_Cancel(&call->growMTUEvent, call, RX_CALL_REFCOUNT_MTU);
5266 if (call->delayedAbortEvent) {
5267 rxevent_Cancel(&call->delayedAbortEvent, call, RX_CALL_REFCOUNT_ABORT);
5268 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5270 rxi_SendCallAbort(call, packet, 0, 1);
5271 rxi_FreePacket(packet);
5276 * Update the peer with the congestion information in this call
5277 * so other calls on this connection can pick up where this call
5278 * left off. If the congestion sequence numbers don't match then
5279 * another call experienced a retransmission.
5281 peer = call->conn->peer;
5282 MUTEX_ENTER(&peer->peer_lock);
5284 if (call->congestSeq == peer->congestSeq) {
5285 peer->cwind = MAX(peer->cwind, call->cwind);
5286 peer->MTU = MAX(peer->MTU, call->MTU);
5287 peer->nDgramPackets =
5288 MAX(peer->nDgramPackets, call->nDgramPackets);
5291 call->abortCode = 0;
5292 call->abortCount = 0;
5294 if (peer->maxDgramPackets > 1) {
5295 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
5297 call->MTU = peer->MTU;
5299 call->cwind = MIN((int)peer->cwind, (int)peer->nDgramPackets);
5300 call->ssthresh = rx_maxSendWindow;
5301 call->nDgramPackets = peer->nDgramPackets;
5302 call->congestSeq = peer->congestSeq;
5303 call->rtt = peer->rtt;
5304 call->rtt_dev = peer->rtt_dev;
5305 clock_Zero(&call->rto);
5306 clock_Addmsec(&call->rto,
5307 MAX(((call->rtt >> 3) + call->rtt_dev), rx_minPeerTimeout) + 200);
5308 MUTEX_EXIT(&peer->peer_lock);
5310 flags = call->flags;
5311 rxi_WaitforTQBusy(call);
5313 rxi_ClearTransmitQueue(call, 1);
5314 if (call->tqWaiters || (flags & RX_CALL_TQ_WAIT)) {
5315 dpf(("rcall %"AFS_PTR_FMT" has %d waiters and flags %d\n", call, call->tqWaiters, call->flags));
5319 if (!newcall && (flags & RX_CALL_PEER_BUSY)) {
5320 /* The call channel is still busy; resetting the call doesn't change
5321 * that. However, if 'newcall' is set, we are processing a call
5322 * structure that has either been recycled from the free list, or has
5323 * been newly allocated. So, RX_CALL_PEER_BUSY is not relevant if
5324 * 'newcall' is set, since it describes a completely different call
5325 * channel which we do not care about. */
5326 call->flags |= RX_CALL_PEER_BUSY;
5329 rxi_ClearReceiveQueue(call);
5330 /* why init the queue if you just emptied it? queue_Init(&call->rq); */
5334 call->twind = call->conn->twind[call->channel];
5335 call->rwind = call->conn->rwind[call->channel];
5336 call->nSoftAcked = 0;
5337 call->nextCwind = 0;
5340 call->nCwindAcks = 0;
5341 call->nSoftAcks = 0;
5342 call->nHardAcks = 0;
5344 call->tfirst = call->rnext = call->tnext = 1;
5347 call->lastAcked = 0;
5348 call->localStatus = call->remoteStatus = 0;
5350 if (flags & RX_CALL_READER_WAIT) {
5351 #ifdef RX_ENABLE_LOCKS
5352 CV_BROADCAST(&call->cv_rq);
5354 osi_rxWakeup(&call->rq);
5357 if (flags & RX_CALL_WAIT_PACKETS) {
5358 MUTEX_ENTER(&rx_freePktQ_lock);
5359 rxi_PacketsUnWait(); /* XXX */
5360 MUTEX_EXIT(&rx_freePktQ_lock);
5362 #ifdef RX_ENABLE_LOCKS
5363 CV_SIGNAL(&call->cv_twind);
5365 if (flags & RX_CALL_WAIT_WINDOW_ALLOC)
5366 osi_rxWakeup(&call->twind);
5369 if (flags & RX_CALL_WAIT_PROC) {
5370 rx_atomic_dec(&rx_nWaiting);
5372 #ifdef RX_ENABLE_LOCKS
5373 /* The following ensures that we don't mess with any queue while some
5374 * other thread might also be doing so. The call_queue_lock field is
5375 * is only modified under the call lock. If the call is in the process
5376 * of being removed from a queue, the call is not locked until the
5377 * the queue lock is dropped and only then is the call_queue_lock field
5378 * zero'd out. So it's safe to lock the queue if call_queue_lock is set.
5379 * Note that any other routine which removes a call from a queue has to
5380 * obtain the queue lock before examing the queue and removing the call.
5382 if (call->call_queue_lock) {
5383 MUTEX_ENTER(call->call_queue_lock);
5384 if (opr_queue_IsOnQueue(&call->entry)) {
5385 opr_queue_Remove(&call->entry);
5387 MUTEX_EXIT(call->call_queue_lock);
5388 CLEAR_CALL_QUEUE_LOCK(call);
5390 #else /* RX_ENABLE_LOCKS */
5391 if (opr_queue_IsOnQueue(&call->entry)) {
5392 opr_queue_Remove(&call->entry);
5394 #endif /* RX_ENABLE_LOCKS */
5396 rxi_KeepAliveOff(call);
5397 rxevent_Cancel(&call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
5400 /* Send an acknowledge for the indicated packet (seq,serial) of the
5401 * indicated call, for the indicated reason (reason). This
5402 * acknowledge will specifically acknowledge receiving the packet, and
5403 * will also specify which other packets for this call have been
5404 * received. This routine returns the packet that was used to the
5405 * caller. The caller is responsible for freeing it or re-using it.
5406 * This acknowledgement also returns the highest sequence number
5407 * actually read out by the higher level to the sender; the sender
5408 * promises to keep around packets that have not been read by the
5409 * higher level yet (unless, of course, the sender decides to abort
5410 * the call altogether). Any of p, seq, serial, pflags, or reason may
5411 * be set to zero without ill effect. That is, if they are zero, they
5412 * will not convey any information.
5413 * NOW there is a trailer field, after the ack where it will safely be
5414 * ignored by mundanes, which indicates the maximum size packet this
5415 * host can swallow. */
5417 struct rx_packet *optionalPacket; use to send ack (or null)
5418 int seq; Sequence number of the packet we are acking
5419 int serial; Serial number of the packet
5420 int pflags; Flags field from packet header
5421 int reason; Reason an acknowledge was prompted
5425 rxi_SendAck(struct rx_call *call,
5426 struct rx_packet *optionalPacket, int serial, int reason,
5429 struct rx_ackPacket *ap;
5430 struct rx_packet *p;
5431 struct opr_queue *cursor;
5434 afs_uint32 padbytes = 0;
5435 #ifdef RX_ENABLE_TSFPQ
5436 struct rx_ts_info_t * rx_ts_info;
5440 * Open the receive window once a thread starts reading packets
5442 if (call->rnext > 1) {
5443 call->conn->rwind[call->channel] = call->rwind = rx_maxReceiveWindow;
5446 /* Don't attempt to grow MTU if this is a critical ping */
5447 if (reason == RX_ACK_MTU) {
5448 /* keep track of per-call attempts, if we're over max, do in small
5449 * otherwise in larger? set a size to increment by, decrease
5452 if (call->conn->peer->maxPacketSize &&
5453 (call->conn->peer->maxPacketSize < OLD_MAX_PACKET_SIZE
5455 padbytes = call->conn->peer->maxPacketSize+16;
5457 padbytes = call->conn->peer->maxMTU + 128;
5459 /* do always try a minimum size ping */
5460 padbytes = MAX(padbytes, RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE+4);
5462 /* subtract the ack payload */
5463 padbytes -= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32));
5464 reason = RX_ACK_PING;
5467 call->nHardAcks = 0;
5468 call->nSoftAcks = 0;
5469 if (call->rnext > call->lastAcked)
5470 call->lastAcked = call->rnext;
5474 rx_computelen(p, p->length); /* reset length, you never know */
5475 } /* where that's been... */
5476 #ifdef RX_ENABLE_TSFPQ
5478 RX_TS_INFO_GET(rx_ts_info);
5479 if ((p = rx_ts_info->local_special_packet)) {
5480 rx_computelen(p, p->length);
5481 } else if ((p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5482 rx_ts_info->local_special_packet = p;
5483 } else { /* We won't send the ack, but don't panic. */
5484 return optionalPacket;
5488 else if (!(p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5489 /* We won't send the ack, but don't panic. */
5490 return optionalPacket;
5495 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32) -
5498 if (rxi_AllocDataBuf(p, templ, RX_PACKET_CLASS_SPECIAL) > 0) {
5499 #ifndef RX_ENABLE_TSFPQ
5500 if (!optionalPacket)
5503 return optionalPacket;
5505 templ = rx_AckDataSize(call->rwind) + 2 * sizeof(afs_int32);
5506 if (rx_Contiguous(p) < templ) {
5507 #ifndef RX_ENABLE_TSFPQ
5508 if (!optionalPacket)
5511 return optionalPacket;
5516 /* MTUXXX failing to send an ack is very serious. We should */
5517 /* try as hard as possible to send even a partial ack; it's */
5518 /* better than nothing. */
5519 ap = (struct rx_ackPacket *)rx_DataOf(p);
5520 ap->bufferSpace = htonl(0); /* Something should go here, sometime */
5521 ap->reason = reason;
5523 /* The skew computation used to be bogus, I think it's better now. */
5524 /* We should start paying attention to skew. XXX */
5525 ap->serial = htonl(serial);
5526 ap->maxSkew = 0; /* used to be peer->inPacketSkew */
5529 * First packet not yet forwarded to reader. When ACKALL has been
5530 * sent the peer has been told that all received packets will be
5531 * delivered to the reader. The value 'rnext' is used internally
5532 * to refer to the next packet in the receive queue that must be
5533 * delivered to the reader. From the perspective of the peer it
5534 * already has so report the last sequence number plus one if there
5535 * are packets in the receive queue awaiting processing.
5537 if ((call->flags & RX_CALL_ACKALL_SENT) &&
5538 !opr_queue_IsEmpty(&call->rq)) {
5539 ap->firstPacket = htonl(opr_queue_Last(&call->rq, struct rx_packet, entry)->header.seq + 1);
5541 ap->firstPacket = htonl(call->rnext);
5543 ap->previousPacket = htonl(call->rprev); /* Previous packet received */
5545 /* No fear of running out of ack packet here because there can only
5546 * be at most one window full of unacknowledged packets. The window
5547 * size must be constrained to be less than the maximum ack size,
5548 * of course. Also, an ack should always fit into a single packet
5549 * -- it should not ever be fragmented. */
5551 for (opr_queue_Scan(&call->rq, cursor)) {
5552 struct rx_packet *rqp
5553 = opr_queue_Entry(cursor, struct rx_packet, entry);
5555 if (!rqp || !call->rq.next
5556 || (rqp->header.seq > (call->rnext + call->rwind))) {
5557 #ifndef RX_ENABLE_TSFPQ
5558 if (!optionalPacket)
5561 rxi_CallError(call, RX_CALL_DEAD);
5562 return optionalPacket;
5565 while (rqp->header.seq > call->rnext + offset)
5566 ap->acks[offset++] = RX_ACK_TYPE_NACK;
5567 ap->acks[offset++] = RX_ACK_TYPE_ACK;
5569 if ((offset > (u_char) rx_maxReceiveWindow) || (offset > call->rwind)) {
5570 #ifndef RX_ENABLE_TSFPQ
5571 if (!optionalPacket)
5574 rxi_CallError(call, RX_CALL_DEAD);
5575 return optionalPacket;
5581 p->length = rx_AckDataSize(offset) + 4 * sizeof(afs_int32);
5583 /* these are new for AFS 3.3 */
5584 templ = rxi_AdjustMaxMTU(call->conn->peer->ifMTU, rx_maxReceiveSize);
5585 templ = htonl(templ);
5586 rx_packetwrite(p, rx_AckDataSize(offset), sizeof(afs_int32), &templ);
5587 templ = htonl(call->conn->peer->ifMTU);
5588 rx_packetwrite(p, rx_AckDataSize(offset) + sizeof(afs_int32),
5589 sizeof(afs_int32), &templ);
5591 /* new for AFS 3.4 */
5592 templ = htonl(call->rwind);
5593 rx_packetwrite(p, rx_AckDataSize(offset) + 2 * sizeof(afs_int32),
5594 sizeof(afs_int32), &templ);
5596 /* new for AFS 3.5 */
5597 templ = htonl(call->conn->peer->ifDgramPackets);
5598 rx_packetwrite(p, rx_AckDataSize(offset) + 3 * sizeof(afs_int32),
5599 sizeof(afs_int32), &templ);
5601 p->header.serviceId = call->conn->serviceId;
5602 p->header.cid = (call->conn->cid | call->channel);
5603 p->header.callNumber = *call->callNumber;
5605 p->header.securityIndex = call->conn->securityIndex;
5606 p->header.epoch = call->conn->epoch;
5607 p->header.type = RX_PACKET_TYPE_ACK;
5608 p->header.flags = RX_SLOW_START_OK;
5609 if (reason == RX_ACK_PING) {
5610 p->header.flags |= RX_REQUEST_ACK;
5612 p->length = padbytes +
5613 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32);
5616 /* not fast but we can potentially use this if truncated
5617 * fragments are delivered to figure out the mtu.
5619 rx_packetwrite(p, rx_AckDataSize(offset) + 4 *
5620 sizeof(afs_int32), sizeof(afs_int32),
5624 if (call->conn->type == RX_CLIENT_CONNECTION)
5625 p->header.flags |= RX_CLIENT_INITIATED;
5629 if (rxdebug_active) {
5633 len = _snprintf(msg, sizeof(msg),
5634 "tid[%d] SACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
5635 GetCurrentThreadId(), rx_ack_reason(ap->reason),
5636 ntohl(ap->serial), ntohl(ap->previousPacket),
5637 (unsigned int)p->header.seq, ntohl(ap->firstPacket),
5638 ap->nAcks, ntohs(ap->bufferSpace) );
5642 for (offset = 0; offset < ap->nAcks && len < sizeof(msg); offset++)
5643 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
5647 OutputDebugString(msg);
5649 #else /* AFS_NT40_ENV */
5651 fprintf(rx_Log, "SACK: reason %x previous %u seq %u first %u ",
5652 ap->reason, ntohl(ap->previousPacket),
5653 (unsigned int)p->header.seq, ntohl(ap->firstPacket));
5655 for (offset = 0; offset < ap->nAcks; offset++)
5656 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
5661 #endif /* AFS_NT40_ENV */
5664 int i, nbytes = p->length;
5666 for (i = 1; i < p->niovecs; i++) { /* vec 0 is ALWAYS header */
5667 if (nbytes <= p->wirevec[i].iov_len) {
5670 savelen = p->wirevec[i].iov_len;
5672 p->wirevec[i].iov_len = nbytes;
5674 rxi_Send(call, p, istack);
5675 p->wirevec[i].iov_len = savelen;
5679 nbytes -= p->wirevec[i].iov_len;
5682 if (rx_stats_active)
5683 rx_atomic_inc(&rx_stats.ackPacketsSent);
5684 #ifndef RX_ENABLE_TSFPQ
5685 if (!optionalPacket)
5688 return optionalPacket; /* Return packet for re-use by caller */
5692 struct rx_packet **list;
5697 /* Send all of the packets in the list in single datagram */
5699 rxi_SendList(struct rx_call *call, struct xmitlist *xmit,
5700 int istack, int moreFlag)
5706 struct rx_connection *conn = call->conn;
5707 struct rx_peer *peer = conn->peer;
5709 MUTEX_ENTER(&peer->peer_lock);
5710 peer->nSent += xmit->len;
5711 if (xmit->resending)
5712 peer->reSends += xmit->len;
5713 MUTEX_EXIT(&peer->peer_lock);
5715 if (rx_stats_active) {
5716 if (xmit->resending)
5717 rx_atomic_add(&rx_stats.dataPacketsReSent, xmit->len);
5719 rx_atomic_add(&rx_stats.dataPacketsSent, xmit->len);
5722 clock_GetTime(&now);
5724 if (xmit->list[xmit->len - 1]->header.flags & RX_LAST_PACKET) {
5728 /* Set the packet flags and schedule the resend events */
5729 /* Only request an ack for the last packet in the list */
5730 for (i = 0; i < xmit->len; i++) {
5731 struct rx_packet *packet = xmit->list[i];
5733 /* Record the time sent */
5734 packet->timeSent = now;
5735 packet->flags |= RX_PKTFLAG_SENT;
5737 /* Ask for an ack on retransmitted packets, on every other packet
5738 * if the peer doesn't support slow start. Ask for an ack on every
5739 * packet until the congestion window reaches the ack rate. */
5740 if (packet->header.serial) {
5743 packet->firstSent = now;
5744 if (!lastPacket && (call->cwind <= (u_short) (conn->ackRate + 1)
5745 || (!(call->flags & RX_CALL_SLOW_START_OK)
5746 && (packet->header.seq & 1)))) {
5751 /* Tag this packet as not being the last in this group,
5752 * for the receiver's benefit */
5753 if (i < xmit->len - 1 || moreFlag) {
5754 packet->header.flags |= RX_MORE_PACKETS;
5759 xmit->list[xmit->len - 1]->header.flags |= RX_REQUEST_ACK;
5762 /* Since we're about to send a data packet to the peer, it's
5763 * safe to nuke any scheduled end-of-packets ack */
5764 rxevent_Cancel(&call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
5766 MUTEX_EXIT(&call->lock);
5767 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5768 if (xmit->len > 1) {
5769 rxi_SendPacketList(call, conn, xmit->list, xmit->len, istack);
5771 rxi_SendPacket(call, conn, xmit->list[0], istack);
5773 MUTEX_ENTER(&call->lock);
5774 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5776 /* Tell the RTO calculation engine that we have sent a packet, and
5777 * if it was the last one */
5778 rxi_rto_packet_sent(call, lastPacket, istack);
5780 /* Update last send time for this call (for keep-alive
5781 * processing), and for the connection (so that we can discover
5782 * idle connections) */
5783 conn->lastSendTime = call->lastSendTime = clock_Sec();
5784 /* Let a set of retransmits trigger an idle timeout */
5785 if (!xmit->resending)
5786 call->lastSendData = call->lastSendTime;
5789 /* When sending packets we need to follow these rules:
5790 * 1. Never send more than maxDgramPackets in a jumbogram.
5791 * 2. Never send a packet with more than two iovecs in a jumbogram.
5792 * 3. Never send a retransmitted packet in a jumbogram.
5793 * 4. Never send more than cwind/4 packets in a jumbogram
5794 * We always keep the last list we should have sent so we
5795 * can set the RX_MORE_PACKETS flags correctly.
5799 rxi_SendXmitList(struct rx_call *call, struct rx_packet **list, int len,
5804 struct xmitlist working;
5805 struct xmitlist last;
5807 struct rx_peer *peer = call->conn->peer;
5808 int morePackets = 0;
5810 memset(&last, 0, sizeof(struct xmitlist));
5811 working.list = &list[0];
5813 working.resending = 0;
5815 recovery = call->flags & RX_CALL_FAST_RECOVER;
5817 for (i = 0; i < len; i++) {
5818 /* Does the current packet force us to flush the current list? */
5820 && (list[i]->header.serial || (list[i]->flags & RX_PKTFLAG_ACKED)
5821 || list[i]->length > RX_JUMBOBUFFERSIZE)) {
5823 /* This sends the 'last' list and then rolls the current working
5824 * set into the 'last' one, and resets the working set */
5827 rxi_SendList(call, &last, istack, 1);
5828 /* If the call enters an error state stop sending, or if
5829 * we entered congestion recovery mode, stop sending */
5831 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5836 working.resending = 0;
5837 working.list = &list[i];
5839 /* Add the current packet to the list if it hasn't been acked.
5840 * Otherwise adjust the list pointer to skip the current packet. */
5841 if (!(list[i]->flags & RX_PKTFLAG_ACKED)) {
5844 if (list[i]->header.serial)
5845 working.resending = 1;
5847 /* Do we need to flush the list? */
5848 if (working.len >= (int)peer->maxDgramPackets
5849 || working.len >= (int)call->nDgramPackets
5850 || working.len >= (int)call->cwind
5851 || list[i]->header.serial
5852 || list[i]->length != RX_JUMBOBUFFERSIZE) {
5854 rxi_SendList(call, &last, istack, 1);
5855 /* If the call enters an error state stop sending, or if
5856 * we entered congestion recovery mode, stop sending */
5858 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5863 working.resending = 0;
5864 working.list = &list[i + 1];
5867 if (working.len != 0) {
5868 osi_Panic("rxi_SendList error");
5870 working.list = &list[i + 1];
5874 /* Send the whole list when the call is in receive mode, when
5875 * the call is in eof mode, when we are in fast recovery mode,
5876 * and when we have the last packet */
5877 /* XXX - The accesses to app.mode aren't safe, as this may be called by
5878 * the listener or event threads
5880 if ((list[len - 1]->header.flags & RX_LAST_PACKET)
5881 || (call->flags & RX_CALL_FLUSH)
5882 || (call->flags & RX_CALL_FAST_RECOVER)) {
5883 /* Check for the case where the current list contains
5884 * an acked packet. Since we always send retransmissions
5885 * in a separate packet, we only need to check the first
5886 * packet in the list */
5887 if (working.len > 0 && !(working.list[0]->flags & RX_PKTFLAG_ACKED)) {
5891 rxi_SendList(call, &last, istack, morePackets);
5892 /* If the call enters an error state stop sending, or if
5893 * we entered congestion recovery mode, stop sending */
5895 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5899 rxi_SendList(call, &working, istack, 0);
5901 } else if (last.len > 0) {
5902 rxi_SendList(call, &last, istack, 0);
5903 /* Packets which are in 'working' are not sent by this call */
5908 * Check if the peer for the given call is known to be dead
5910 * If the call's peer appears dead (it has encountered fatal network errors
5911 * since the call started) the call is killed with RX_CALL_DEAD if the call
5912 * is active. Otherwise, we do nothing.
5914 * @param[in] call The call to check
5917 * @retval 0 The call is fine, and we haven't done anything to the call
5918 * @retval nonzero The call's peer appears dead, and the call has been
5919 * terminated if it was active
5921 * @pre call->lock must be locked
5924 rxi_CheckPeerDead(struct rx_call *call)
5926 #ifdef AFS_RXERRQ_ENV
5929 if (call->state == RX_STATE_DALLY) {
5933 peererrs = rx_atomic_read(&call->conn->peer->neterrs);
5934 if (call->neterr_gen < peererrs) {
5935 /* we have received network errors since this call started; kill
5937 if (call->state == RX_STATE_ACTIVE) {
5938 rxi_CallError(call, RX_CALL_DEAD);
5942 if (call->neterr_gen > peererrs) {
5943 /* someone has reset the number of peer errors; set the call error gen
5944 * so we can detect if more errors are encountered */
5945 call->neterr_gen = peererrs;
5952 rxi_Resend(struct rxevent *event, void *arg0, void *arg1, int istack)
5954 struct rx_call *call = arg0;
5955 struct rx_peer *peer;
5956 struct opr_queue *cursor;
5957 struct clock maxTimeout = { 60, 0 };
5959 MUTEX_ENTER(&call->lock);
5961 peer = call->conn->peer;
5963 /* Make sure that the event pointer is removed from the call
5964 * structure, since there is no longer a per-call retransmission
5966 if (event == call->resendEvent) {
5967 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
5968 rxevent_Put(call->resendEvent);
5969 call->resendEvent = NULL;
5972 rxi_CheckPeerDead(call);
5974 if (rxi_busyChannelError && (call->flags & RX_CALL_PEER_BUSY)) {
5975 rxi_CheckBusy(call);
5978 if (opr_queue_IsEmpty(&call->tq)) {
5979 /* Nothing to do. This means that we've been raced, and that an
5980 * ACK has come in between when we were triggered, and when we
5981 * actually got to run. */
5985 /* We're in loss recovery */
5986 call->flags |= RX_CALL_FAST_RECOVER;
5988 /* Mark all of the pending packets in the queue as being lost */
5989 for (opr_queue_Scan(&call->tq, cursor)) {
5990 struct rx_packet *p = opr_queue_Entry(cursor, struct rx_packet, entry);
5991 if (!(p->flags & RX_PKTFLAG_ACKED))
5992 p->flags &= ~RX_PKTFLAG_SENT;
5995 /* We're resending, so we double the timeout of the call. This will be
5996 * dropped back down by the first successful ACK that we receive.
5998 * We apply a maximum value here of 60 seconds
6000 clock_Add(&call->rto, &call->rto);
6001 if (clock_Gt(&call->rto, &maxTimeout))
6002 call->rto = maxTimeout;
6004 /* Packet loss is most likely due to congestion, so drop our window size
6005 * and start again from the beginning */
6006 if (peer->maxDgramPackets >1) {
6007 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
6008 call->MTU = MIN(peer->natMTU, peer->maxMTU);
6010 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
6011 call->nDgramPackets = 1;
6013 call->nextCwind = 1;
6016 MUTEX_ENTER(&peer->peer_lock);
6017 peer->MTU = call->MTU;
6018 peer->cwind = call->cwind;
6019 peer->nDgramPackets = 1;
6021 call->congestSeq = peer->congestSeq;
6022 MUTEX_EXIT(&peer->peer_lock);
6024 rxi_Start(call, istack);
6027 MUTEX_EXIT(&call->lock);
6030 /* This routine is called when new packets are readied for
6031 * transmission and when retransmission may be necessary, or when the
6032 * transmission window or burst count are favourable. This should be
6033 * better optimized for new packets, the usual case, now that we've
6034 * got rid of queues of send packets. XXXXXXXXXXX */
6036 rxi_Start(struct rx_call *call, int istack)
6038 struct opr_queue *cursor;
6039 #ifdef RX_ENABLE_LOCKS
6040 struct opr_queue *store;
6046 #ifdef RX_ENABLE_LOCKS
6047 if (rx_stats_active)
6048 rx_atomic_inc(&rx_tq_debug.rxi_start_in_error);
6053 if (!opr_queue_IsEmpty(&call->tq)) { /* If we have anything to send */
6054 /* Send (or resend) any packets that need it, subject to
6055 * window restrictions and congestion burst control
6056 * restrictions. Ask for an ack on the last packet sent in
6057 * this burst. For now, we're relying upon the window being
6058 * considerably bigger than the largest number of packets that
6059 * are typically sent at once by one initial call to
6060 * rxi_Start. This is probably bogus (perhaps we should ask
6061 * for an ack when we're half way through the current
6062 * window?). Also, for non file transfer applications, this
6063 * may end up asking for an ack for every packet. Bogus. XXXX
6066 * But check whether we're here recursively, and let the other guy
6069 #ifdef RX_ENABLE_LOCKS
6070 if (!(call->flags & RX_CALL_TQ_BUSY)) {
6071 call->flags |= RX_CALL_TQ_BUSY;
6073 #endif /* RX_ENABLE_LOCKS */
6075 #ifdef RX_ENABLE_LOCKS
6076 call->flags &= ~RX_CALL_NEED_START;
6077 #endif /* RX_ENABLE_LOCKS */
6079 maxXmitPackets = MIN(call->twind, call->cwind);
6080 for (opr_queue_Scan(&call->tq, cursor)) {
6082 = opr_queue_Entry(cursor, struct rx_packet, entry);
6084 if (p->flags & RX_PKTFLAG_ACKED) {
6085 /* Since we may block, don't trust this */
6086 if (rx_stats_active)
6087 rx_atomic_inc(&rx_stats.ignoreAckedPacket);
6088 continue; /* Ignore this packet if it has been acknowledged */
6091 /* Turn off all flags except these ones, which are the same
6092 * on each transmission */
6093 p->header.flags &= RX_PRESET_FLAGS;
6095 if (p->header.seq >=
6096 call->tfirst + MIN((int)call->twind,
6097 (int)(call->nSoftAcked +
6099 call->flags |= RX_CALL_WAIT_WINDOW_SEND; /* Wait for transmit window */
6100 /* Note: if we're waiting for more window space, we can
6101 * still send retransmits; hence we don't return here, but
6102 * break out to schedule a retransmit event */
6103 dpf(("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n",
6104 *(call->callNumber), p->header.seq, call->twind, call->nSoftAcked,
6109 /* Transmit the packet if it needs to be sent. */
6110 if (!(p->flags & RX_PKTFLAG_SENT)) {
6111 if (nXmitPackets == maxXmitPackets) {
6112 rxi_SendXmitList(call, call->xmitList,
6113 nXmitPackets, istack);
6116 dpf(("call %d xmit packet %"AFS_PTR_FMT"\n",
6117 *(call->callNumber), p));
6118 call->xmitList[nXmitPackets++] = p;
6120 } /* end of the queue_Scan */
6122 /* xmitList now hold pointers to all of the packets that are
6123 * ready to send. Now we loop to send the packets */
6124 if (nXmitPackets > 0) {
6125 rxi_SendXmitList(call, call->xmitList, nXmitPackets,
6129 #ifdef RX_ENABLE_LOCKS
6131 /* We went into the error state while sending packets. Now is
6132 * the time to reset the call. This will also inform the using
6133 * process that the call is in an error state.
6135 if (rx_stats_active)
6136 rx_atomic_inc(&rx_tq_debug.rxi_start_aborted);
6137 call->flags &= ~RX_CALL_TQ_BUSY;
6138 rxi_WakeUpTransmitQueue(call);
6139 rxi_CallError(call, call->error);
6143 if (call->flags & RX_CALL_TQ_SOME_ACKED) {
6145 call->flags &= ~RX_CALL_TQ_SOME_ACKED;
6146 /* Some packets have received acks. If they all have, we can clear
6147 * the transmit queue.
6150 for (opr_queue_ScanSafe(&call->tq, cursor, store)) {
6152 = opr_queue_Entry(cursor, struct rx_packet, entry);
6154 if (p->header.seq < call->tfirst
6155 && (p->flags & RX_PKTFLAG_ACKED)) {
6156 opr_queue_Remove(&p->entry);
6157 #ifdef RX_TRACK_PACKETS
6158 p->flags &= ~RX_PKTFLAG_TQ;
6160 #ifdef RXDEBUG_PACKET
6168 call->flags |= RX_CALL_TQ_CLEARME;
6170 if (call->flags & RX_CALL_TQ_CLEARME)
6171 rxi_ClearTransmitQueue(call, 1);
6172 } while (call->flags & RX_CALL_NEED_START);
6174 * TQ references no longer protected by this flag; they must remain
6175 * protected by the call lock.
6177 call->flags &= ~RX_CALL_TQ_BUSY;
6178 rxi_WakeUpTransmitQueue(call);
6180 call->flags |= RX_CALL_NEED_START;
6182 #endif /* RX_ENABLE_LOCKS */
6184 rxi_rto_cancel(call);
6188 /* Also adjusts the keep alive parameters for the call, to reflect
6189 * that we have just sent a packet (so keep alives aren't sent
6192 rxi_Send(struct rx_call *call, struct rx_packet *p,
6195 struct rx_connection *conn = call->conn;
6197 /* Stamp each packet with the user supplied status */
6198 p->header.userStatus = call->localStatus;
6200 /* Allow the security object controlling this call's security to
6201 * make any last-minute changes to the packet */
6202 RXS_SendPacket(conn->securityObject, call, p);
6204 /* Since we're about to send SOME sort of packet to the peer, it's
6205 * safe to nuke any scheduled end-of-packets ack */
6206 rxevent_Cancel(&call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
6208 /* Actually send the packet, filling in more connection-specific fields */
6209 MUTEX_EXIT(&call->lock);
6210 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
6211 rxi_SendPacket(call, conn, p, istack);
6212 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
6213 MUTEX_ENTER(&call->lock);
6215 /* Update last send time for this call (for keep-alive
6216 * processing), and for the connection (so that we can discover
6217 * idle connections) */
6218 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6219 (((struct rx_ackPacket *)rx_DataOf(p))->reason == RX_ACK_PING) ||
6220 (p->length <= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32))))
6222 conn->lastSendTime = call->lastSendTime = clock_Sec();
6223 /* Don't count keepalive ping/acks here, so idleness can be tracked. */
6224 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6225 ((((struct rx_ackPacket *)rx_DataOf(p))->reason != RX_ACK_PING) &&
6226 (((struct rx_ackPacket *)rx_DataOf(p))->reason !=
6227 RX_ACK_PING_RESPONSE)))
6228 call->lastSendData = call->lastSendTime;
6232 /* Check if a call needs to be destroyed. Called by keep-alive code to ensure
6233 * that things are fine. Also called periodically to guarantee that nothing
6234 * falls through the cracks (e.g. (error + dally) connections have keepalive
6235 * turned off. Returns 0 if conn is well, -1 otherwise. If otherwise, call
6237 * haveCTLock Set if calling from rxi_ReapConnections
6240 rxi_CheckCall(struct rx_call *call, int haveCTLock)
6242 struct rx_connection *conn = call->conn;
6244 afs_uint32 deadTime, idleDeadTime = 0, hardDeadTime = 0;
6245 afs_uint32 fudgeFactor;
6248 int idle_timeout = 0;
6249 afs_int32 clock_diff = 0;
6251 if (rxi_CheckPeerDead(call)) {
6257 /* Large swings in the clock can have a significant impact on
6258 * the performance of RX call processing. Forward clock shifts
6259 * will result in premature event triggering or timeouts.
6260 * Backward shifts can result in calls not completing until
6261 * the clock catches up with the original start clock value.
6263 * If a backward clock shift of more than five minutes is noticed,
6264 * just fail the call.
6266 if (now < call->lastSendTime)
6267 clock_diff = call->lastSendTime - now;
6268 if (now < call->startWait)
6269 clock_diff = MAX(clock_diff, call->startWait - now);
6270 if (now < call->lastReceiveTime)
6271 clock_diff = MAX(clock_diff, call->lastReceiveTime - now);
6272 if (clock_diff > 5 * 60)
6274 if (call->state == RX_STATE_ACTIVE)
6275 rxi_CallError(call, RX_CALL_TIMEOUT);
6279 #ifdef RX_ENABLE_LOCKS
6280 if (call->flags & RX_CALL_TQ_BUSY) {
6281 /* Call is active and will be reset by rxi_Start if it's
6282 * in an error state.
6287 /* RTT + 8*MDEV, rounded up to the next second. */
6288 fudgeFactor = (((afs_uint32) call->rtt >> 3) +
6289 ((afs_uint32) call->rtt_dev << 1) + 1023) >> 10;
6291 deadTime = conn->secondsUntilDead + fudgeFactor;
6292 /* These are computed to the second (+- 1 second). But that's
6293 * good enough for these values, which should be a significant
6294 * number of seconds. */
6295 if (now > (call->lastReceiveTime + deadTime)) {
6296 if (call->state == RX_STATE_ACTIVE) {
6297 #ifdef AFS_ADAPT_PMTU
6298 # if defined(KERNEL) && defined(AFS_SUN5_ENV)
6300 # if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
6301 netstack_t *ns = netstack_find_by_stackid(GLOBAL_NETSTACKID);
6302 ip_stack_t *ipst = ns->netstack_ip;
6304 ire = ire_cache_lookup(conn->peer->host
6305 # if defined(AFS_SUN510_ENV) && defined(ALL_ZONES)
6307 # if defined(ICL_3_ARG) || defined(GLOBAL_NETSTACKID)
6309 # if defined(GLOBAL_NETSTACKID)
6316 if (ire && ire->ire_max_frag > 0)
6317 rxi_SetPeerMtu(NULL, conn->peer->host, 0,
6319 # if defined(GLOBAL_NETSTACKID)
6323 #endif /* AFS_ADAPT_PMTU */
6324 cerror = RX_CALL_DEAD;
6327 #ifdef RX_ENABLE_LOCKS
6328 /* Cancel pending events */
6329 rxevent_Cancel(&call->delayedAckEvent, call,
6330 RX_CALL_REFCOUNT_DELAY);
6331 rxi_rto_cancel(call);
6332 rxevent_Cancel(&call->keepAliveEvent, call,
6333 RX_CALL_REFCOUNT_ALIVE);
6334 rxevent_Cancel(&call->growMTUEvent, call,
6335 RX_CALL_REFCOUNT_MTU);
6336 MUTEX_ENTER(&rx_refcnt_mutex);
6337 /* if rxi_FreeCall returns 1 it has freed the call */
6338 if (call->refCount == 0 &&
6339 rxi_FreeCall(call, haveCTLock))
6341 MUTEX_EXIT(&rx_refcnt_mutex);
6344 MUTEX_EXIT(&rx_refcnt_mutex);
6346 #else /* RX_ENABLE_LOCKS */
6347 rxi_FreeCall(call, 0);
6349 #endif /* RX_ENABLE_LOCKS */
6351 /* Non-active calls are destroyed if they are not responding
6352 * to pings; active calls are simply flagged in error, so the
6353 * attached process can die reasonably gracefully. */
6356 if (conn->idleDeadDetection) {
6357 if (conn->idleDeadTime) {
6358 idleDeadTime = conn->idleDeadTime + fudgeFactor;
6362 /* see if we have a non-activity timeout */
6363 if (call->startWait && ((call->startWait + idleDeadTime) < now) &&
6364 (call->flags & RX_CALL_READER_WAIT)) {
6365 if (call->state == RX_STATE_ACTIVE) {
6366 cerror = RX_CALL_TIMEOUT;
6371 if (call->lastSendData && ((call->lastSendData + idleDeadTime) < now)) {
6372 if (call->state == RX_STATE_ACTIVE) {
6373 cerror = conn->service ? conn->service->idleDeadErr : RX_CALL_IDLE;
6381 if (conn->hardDeadTime) {
6382 hardDeadTime = conn->hardDeadTime + fudgeFactor;
6385 /* see if we have a hard timeout */
6387 && (now > (hardDeadTime + call->startTime.sec))) {
6388 if (call->state == RX_STATE_ACTIVE)
6389 rxi_CallError(call, RX_CALL_TIMEOUT);
6394 if (conn->msgsizeRetryErr && cerror != RX_CALL_TIMEOUT && !idle_timeout &&
6395 call->lastReceiveTime) {
6396 int oldMTU = conn->peer->ifMTU;
6398 /* if we thought we could send more, perhaps things got worse */
6399 if (conn->peer->maxPacketSize > conn->lastPacketSize)
6400 /* maxpacketsize will be cleared in rxi_SetPeerMtu */
6401 newmtu = MAX(conn->peer->maxPacketSize-RX_IPUDP_SIZE,
6402 conn->lastPacketSize-(128+RX_IPUDP_SIZE));
6404 newmtu = conn->lastPacketSize-(128+RX_IPUDP_SIZE);
6406 /* minimum capped in SetPeerMtu */
6407 rxi_SetPeerMtu(conn->peer, 0, 0, newmtu);
6410 conn->lastPacketSize = 0;
6412 /* needed so ResetCall doesn't clobber us. */
6413 call->MTU = conn->peer->ifMTU;
6415 /* if we never succeeded, let the error pass out as-is */
6416 if (conn->peer->maxPacketSize && oldMTU != conn->peer->ifMTU)
6417 cerror = conn->msgsizeRetryErr;
6420 rxi_CallError(call, cerror);
6425 rxi_NatKeepAliveEvent(struct rxevent *event, void *arg1,
6426 void *dummy, int dummy2)
6428 struct rx_connection *conn = arg1;
6429 struct rx_header theader;
6430 char tbuffer[1 + sizeof(struct rx_header)];
6431 struct sockaddr_in taddr;
6434 struct iovec tmpiov[2];
6437 RX_CLIENT_CONNECTION ? rx_socket : conn->service->socket);
6440 tp = &tbuffer[sizeof(struct rx_header)];
6441 taddr.sin_family = AF_INET;
6442 taddr.sin_port = rx_PortOf(rx_PeerOf(conn));
6443 taddr.sin_addr.s_addr = rx_HostOf(rx_PeerOf(conn));
6444 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
6445 taddr.sin_len = sizeof(struct sockaddr_in);
6447 memset(&theader, 0, sizeof(theader));
6448 theader.epoch = htonl(999);
6450 theader.callNumber = 0;
6453 theader.type = RX_PACKET_TYPE_VERSION;
6454 theader.flags = RX_LAST_PACKET;
6455 theader.serviceId = 0;
6457 memcpy(tbuffer, &theader, sizeof(theader));
6458 memcpy(tp, &a, sizeof(a));
6459 tmpiov[0].iov_base = tbuffer;
6460 tmpiov[0].iov_len = 1 + sizeof(struct rx_header);
6462 osi_NetSend(socket, &taddr, tmpiov, 1, 1 + sizeof(struct rx_header), 1);
6464 MUTEX_ENTER(&conn->conn_data_lock);
6465 MUTEX_ENTER(&rx_refcnt_mutex);
6466 /* Only reschedule ourselves if the connection would not be destroyed */
6467 if (conn->refCount <= 1) {
6468 rxevent_Put(conn->natKeepAliveEvent);
6469 conn->natKeepAliveEvent = NULL;
6470 MUTEX_EXIT(&rx_refcnt_mutex);
6471 MUTEX_EXIT(&conn->conn_data_lock);
6472 rx_DestroyConnection(conn); /* drop the reference for this */
6474 conn->refCount--; /* drop the reference for this */
6475 MUTEX_EXIT(&rx_refcnt_mutex);
6476 rxevent_Put(conn->natKeepAliveEvent);
6477 conn->natKeepAliveEvent = NULL;
6478 rxi_ScheduleNatKeepAliveEvent(conn);
6479 MUTEX_EXIT(&conn->conn_data_lock);
6484 rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn)
6486 if (!conn->natKeepAliveEvent && conn->secondsUntilNatPing) {
6487 struct clock when, now;
6488 clock_GetTime(&now);
6490 when.sec += conn->secondsUntilNatPing;
6491 MUTEX_ENTER(&rx_refcnt_mutex);
6492 conn->refCount++; /* hold a reference for this */
6493 MUTEX_EXIT(&rx_refcnt_mutex);
6494 conn->natKeepAliveEvent =
6495 rxevent_Post(&when, &now, rxi_NatKeepAliveEvent, conn, NULL, 0);
6500 rx_SetConnSecondsUntilNatPing(struct rx_connection *conn, afs_int32 seconds)
6502 MUTEX_ENTER(&conn->conn_data_lock);
6503 conn->secondsUntilNatPing = seconds;
6505 if (!(conn->flags & RX_CONN_ATTACHWAIT))
6506 rxi_ScheduleNatKeepAliveEvent(conn);
6508 conn->flags |= RX_CONN_NAT_PING;
6510 MUTEX_EXIT(&conn->conn_data_lock);
6513 /* When a call is in progress, this routine is called occasionally to
6514 * make sure that some traffic has arrived (or been sent to) the peer.
6515 * If nothing has arrived in a reasonable amount of time, the call is
6516 * declared dead; if nothing has been sent for a while, we send a
6517 * keep-alive packet (if we're actually trying to keep the call alive)
6520 rxi_KeepAliveEvent(struct rxevent *event, void *arg1, void *dummy,
6523 struct rx_call *call = arg1;
6524 struct rx_connection *conn;
6527 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6528 MUTEX_ENTER(&call->lock);
6530 if (event == call->keepAliveEvent) {
6531 rxevent_Put(call->keepAliveEvent);
6532 call->keepAliveEvent = NULL;
6537 if (rxi_CheckCall(call, 0)) {
6538 MUTEX_EXIT(&call->lock);
6542 /* Don't try to keep alive dallying calls */
6543 if (call->state == RX_STATE_DALLY) {
6544 MUTEX_EXIT(&call->lock);
6549 if ((now - call->lastSendTime) > conn->secondsUntilPing) {
6550 /* Don't try to send keepalives if there is unacknowledged data */
6551 /* the rexmit code should be good enough, this little hack
6552 * doesn't quite work XXX */
6553 (void)rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
6555 rxi_ScheduleKeepAliveEvent(call);
6556 MUTEX_EXIT(&call->lock);
6559 /* Does what's on the nameplate. */
6561 rxi_GrowMTUEvent(struct rxevent *event, void *arg1, void *dummy, int dummy2)
6563 struct rx_call *call = arg1;
6564 struct rx_connection *conn;
6566 CALL_RELE(call, RX_CALL_REFCOUNT_MTU);
6567 MUTEX_ENTER(&call->lock);
6569 if (event == call->growMTUEvent) {
6570 rxevent_Put(call->growMTUEvent);
6571 call->growMTUEvent = NULL;
6574 if (rxi_CheckCall(call, 0)) {
6575 MUTEX_EXIT(&call->lock);
6579 /* Don't bother with dallying calls */
6580 if (call->state == RX_STATE_DALLY) {
6581 MUTEX_EXIT(&call->lock);
6588 * keep being scheduled, just don't do anything if we're at peak,
6589 * or we're not set up to be properly handled (idle timeout required)
6591 if ((conn->peer->maxPacketSize != 0) &&
6592 (conn->peer->natMTU < RX_MAX_PACKET_SIZE) &&
6593 conn->idleDeadDetection)
6594 (void)rxi_SendAck(call, NULL, 0, RX_ACK_MTU, 0);
6595 rxi_ScheduleGrowMTUEvent(call, 0);
6596 MUTEX_EXIT(&call->lock);
6600 rxi_ScheduleKeepAliveEvent(struct rx_call *call)
6602 if (!call->keepAliveEvent) {
6603 struct clock when, now;
6604 clock_GetTime(&now);
6606 when.sec += call->conn->secondsUntilPing;
6607 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6608 call->keepAliveEvent =
6609 rxevent_Post(&when, &now, rxi_KeepAliveEvent, call, NULL, 0);
6614 rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs)
6616 if (!call->growMTUEvent) {
6617 struct clock when, now;
6619 clock_GetTime(&now);
6622 if (call->conn->secondsUntilPing)
6623 secs = (6*call->conn->secondsUntilPing)-1;
6625 if (call->conn->secondsUntilDead)
6626 secs = MIN(secs, (call->conn->secondsUntilDead-1));
6630 CALL_HOLD(call, RX_CALL_REFCOUNT_MTU);
6631 call->growMTUEvent =
6632 rxevent_Post(&when, &now, rxi_GrowMTUEvent, call, NULL, 0);
6636 /* N.B. rxi_KeepAliveOff: is defined earlier as a macro */
6638 rxi_KeepAliveOn(struct rx_call *call)
6640 /* Pretend last packet received was received now--i.e. if another
6641 * packet isn't received within the keep alive time, then the call
6642 * will die; Initialize last send time to the current time--even
6643 * if a packet hasn't been sent yet. This will guarantee that a
6644 * keep-alive is sent within the ping time */
6645 call->lastReceiveTime = call->lastSendTime = clock_Sec();
6646 rxi_ScheduleKeepAliveEvent(call);
6650 * Solely in order that callers not need to include rx_call.h
6653 rx_KeepAliveOff(struct rx_call *call)
6655 rxi_KeepAliveOff(call);
6658 rx_KeepAliveOn(struct rx_call *call)
6660 rxi_KeepAliveOn(call);
6664 rxi_GrowMTUOn(struct rx_call *call)
6666 struct rx_connection *conn = call->conn;
6667 MUTEX_ENTER(&conn->conn_data_lock);
6668 conn->lastPingSizeSer = conn->lastPingSize = 0;
6669 MUTEX_EXIT(&conn->conn_data_lock);
6670 rxi_ScheduleGrowMTUEvent(call, 1);
6673 /* This routine is called to send connection abort messages
6674 * that have been delayed to throttle looping clients. */
6676 rxi_SendDelayedConnAbort(struct rxevent *event, void *arg1, void *unused,
6679 struct rx_connection *conn = arg1;
6682 struct rx_packet *packet;
6684 MUTEX_ENTER(&conn->conn_data_lock);
6685 rxevent_Put(conn->delayedAbortEvent);
6686 conn->delayedAbortEvent = NULL;
6687 error = htonl(conn->error);
6689 MUTEX_EXIT(&conn->conn_data_lock);
6690 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6693 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6694 RX_PACKET_TYPE_ABORT, (char *)&error,
6696 rxi_FreePacket(packet);
6700 /* This routine is called to send call abort messages
6701 * that have been delayed to throttle looping clients. */
6703 rxi_SendDelayedCallAbort(struct rxevent *event, void *arg1, void *dummy,
6706 struct rx_call *call = arg1;
6709 struct rx_packet *packet;
6711 MUTEX_ENTER(&call->lock);
6712 rxevent_Put(call->delayedAbortEvent);
6713 call->delayedAbortEvent = NULL;
6714 error = htonl(call->error);
6716 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6719 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
6720 (char *)&error, sizeof(error), 0);
6721 rxi_FreePacket(packet);
6723 MUTEX_EXIT(&call->lock);
6724 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
6727 /* This routine is called periodically (every RX_AUTH_REQUEST_TIMEOUT
6728 * seconds) to ask the client to authenticate itself. The routine
6729 * issues a challenge to the client, which is obtained from the
6730 * security object associated with the connection */
6732 rxi_ChallengeEvent(struct rxevent *event,
6733 void *arg0, void *arg1, int tries)
6735 struct rx_connection *conn = arg0;
6738 rxevent_Put(conn->challengeEvent);
6739 conn->challengeEvent = NULL;
6742 if (RXS_CheckAuthentication(conn->securityObject, conn) != 0) {
6743 struct rx_packet *packet;
6744 struct clock when, now;
6747 /* We've failed to authenticate for too long.
6748 * Reset any calls waiting for authentication;
6749 * they are all in RX_STATE_PRECALL.
6753 MUTEX_ENTER(&conn->conn_call_lock);
6754 for (i = 0; i < RX_MAXCALLS; i++) {
6755 struct rx_call *call = conn->call[i];
6757 MUTEX_ENTER(&call->lock);
6758 if (call->state == RX_STATE_PRECALL) {
6759 rxi_CallError(call, RX_CALL_DEAD);
6760 rxi_SendCallAbort(call, NULL, 0, 0);
6762 MUTEX_EXIT(&call->lock);
6765 MUTEX_EXIT(&conn->conn_call_lock);
6769 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6771 /* If there's no packet available, do this later. */
6772 RXS_GetChallenge(conn->securityObject, conn, packet);
6773 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6774 RX_PACKET_TYPE_CHALLENGE, NULL, -1, 0);
6775 rxi_FreePacket(packet);
6777 clock_GetTime(&now);
6779 when.sec += RX_CHALLENGE_TIMEOUT;
6780 conn->challengeEvent =
6781 rxevent_Post(&when, &now, rxi_ChallengeEvent, conn, 0,
6786 /* Call this routine to start requesting the client to authenticate
6787 * itself. This will continue until authentication is established,
6788 * the call times out, or an invalid response is returned. The
6789 * security object associated with the connection is asked to create
6790 * the challenge at this time. N.B. rxi_ChallengeOff is a macro,
6791 * defined earlier. */
6793 rxi_ChallengeOn(struct rx_connection *conn)
6795 if (!conn->challengeEvent) {
6796 RXS_CreateChallenge(conn->securityObject, conn);
6797 rxi_ChallengeEvent(NULL, conn, 0, RX_CHALLENGE_MAXTRIES);
6802 /* rxi_ComputeRoundTripTime is called with peer locked. */
6803 /* peer may be null */
6805 rxi_ComputeRoundTripTime(struct rx_packet *p,
6806 struct rx_ackPacket *ack,
6807 struct rx_call *call,
6808 struct rx_peer *peer,
6811 struct clock thisRtt, *sentp;
6815 /* If the ACK is delayed, then do nothing */
6816 if (ack->reason == RX_ACK_DELAY)
6819 /* On the wire, jumbograms are a single UDP packet. We shouldn't count
6820 * their RTT multiple times, so only include the RTT of the last packet
6822 if (p->flags & RX_JUMBO_PACKET)
6825 /* Use the serial number to determine which transmission the ACK is for,
6826 * and set the sent time to match this. If we have no serial number, then
6827 * only use the ACK for RTT calculations if the packet has not been
6831 serial = ntohl(ack->serial);
6833 if (serial == p->header.serial) {
6834 sentp = &p->timeSent;
6835 } else if (serial == p->firstSerial) {
6836 sentp = &p->firstSent;
6837 } else if (clock_Eq(&p->timeSent, &p->firstSent)) {
6838 sentp = &p->firstSent;
6842 if (clock_Eq(&p->timeSent, &p->firstSent)) {
6843 sentp = &p->firstSent;
6850 if (clock_Lt(&thisRtt, sentp))
6851 return; /* somebody set the clock back, don't count this time. */
6853 clock_Sub(&thisRtt, sentp);
6854 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rttp=%d.%06d sec)\n",
6855 p->header.callNumber, p, thisRtt.sec, thisRtt.usec));
6857 if (clock_IsZero(&thisRtt)) {
6859 * The actual round trip time is shorter than the
6860 * clock_GetTime resolution. It is most likely 1ms or 100ns.
6861 * Since we can't tell which at the moment we will assume 1ms.
6863 thisRtt.usec = 1000;
6866 if (rx_stats_active) {
6867 MUTEX_ENTER(&rx_stats_mutex);
6868 if (clock_Lt(&thisRtt, &rx_stats.minRtt))
6869 rx_stats.minRtt = thisRtt;
6870 if (clock_Gt(&thisRtt, &rx_stats.maxRtt)) {
6871 if (thisRtt.sec > 60) {
6872 MUTEX_EXIT(&rx_stats_mutex);
6873 return; /* somebody set the clock ahead */
6875 rx_stats.maxRtt = thisRtt;
6877 clock_Add(&rx_stats.totalRtt, &thisRtt);
6878 rx_atomic_inc(&rx_stats.nRttSamples);
6879 MUTEX_EXIT(&rx_stats_mutex);
6882 /* better rtt calculation courtesy of UMich crew (dave,larry,peter,?) */
6884 /* Apply VanJacobson round-trip estimations */
6889 * srtt (call->rtt) is in units of one-eighth-milliseconds.
6890 * srtt is stored as fixed point with 3 bits after the binary
6891 * point (i.e., scaled by 8). The following magic is
6892 * equivalent to the smoothing algorithm in rfc793 with an
6893 * alpha of .875 (srtt' = rtt/8 + srtt*7/8 in fixed point).
6894 * srtt'*8 = rtt + srtt*7
6895 * srtt'*8 = srtt*8 + rtt - srtt
6896 * srtt' = srtt + rtt/8 - srtt/8
6897 * srtt' = srtt + (rtt - srtt)/8
6900 delta = _8THMSEC(&thisRtt) - call->rtt;
6901 call->rtt += (delta >> 3);
6904 * We accumulate a smoothed rtt variance (actually, a smoothed
6905 * mean difference), then set the retransmit timer to smoothed
6906 * rtt + 4 times the smoothed variance (was 2x in van's original
6907 * paper, but 4x works better for me, and apparently for him as
6909 * rttvar is stored as
6910 * fixed point with 2 bits after the binary point (scaled by
6911 * 4). The following is equivalent to rfc793 smoothing with
6912 * an alpha of .75 (rttvar' = rttvar*3/4 + |delta| / 4).
6913 * rttvar'*4 = rttvar*3 + |delta|
6914 * rttvar'*4 = rttvar*4 + |delta| - rttvar
6915 * rttvar' = rttvar + |delta|/4 - rttvar/4
6916 * rttvar' = rttvar + (|delta| - rttvar)/4
6917 * This replaces rfc793's wired-in beta.
6918 * dev*4 = dev*4 + (|actual - expected| - dev)
6924 delta -= (call->rtt_dev << 1);
6925 call->rtt_dev += (delta >> 3);
6927 /* I don't have a stored RTT so I start with this value. Since I'm
6928 * probably just starting a call, and will be pushing more data down
6929 * this, I expect congestion to increase rapidly. So I fudge a
6930 * little, and I set deviance to half the rtt. In practice,
6931 * deviance tends to approach something a little less than
6932 * half the smoothed rtt. */
6933 call->rtt = _8THMSEC(&thisRtt) + 8;
6934 call->rtt_dev = call->rtt >> 2; /* rtt/2: they're scaled differently */
6936 /* the smoothed RTT time is RTT + 4*MDEV
6938 * We allow a user specified minimum to be set for this, to allow clamping
6939 * at a minimum value in the same way as TCP. In addition, we have to allow
6940 * for the possibility that this packet is answered by a delayed ACK, so we
6941 * add on a fixed 200ms to account for that timer expiring.
6944 rtt_timeout = MAX(((call->rtt >> 3) + call->rtt_dev),
6945 rx_minPeerTimeout) + 200;
6946 clock_Zero(&call->rto);
6947 clock_Addmsec(&call->rto, rtt_timeout);
6949 /* Update the peer, so any new calls start with our values */
6950 peer->rtt_dev = call->rtt_dev;
6951 peer->rtt = call->rtt;
6953 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n",
6954 p->header.callNumber, p, MSEC(&thisRtt), call->rtt >> 3, call->rtt_dev >> 2, (call->rto.sec), (call->rto.usec)));
6958 /* Find all server connections that have not been active for a long time, and
6961 rxi_ReapConnections(struct rxevent *unused, void *unused1, void *unused2,
6964 struct clock now, when;
6965 clock_GetTime(&now);
6967 /* Find server connection structures that haven't been used for
6968 * greater than rx_idleConnectionTime */
6970 struct rx_connection **conn_ptr, **conn_end;
6971 int i, havecalls = 0;
6972 MUTEX_ENTER(&rx_connHashTable_lock);
6973 for (conn_ptr = &rx_connHashTable[0], conn_end =
6974 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
6976 struct rx_connection *conn, *next;
6977 struct rx_call *call;
6981 for (conn = *conn_ptr; conn; conn = next) {
6982 /* XXX -- Shouldn't the connection be locked? */
6985 for (i = 0; i < RX_MAXCALLS; i++) {
6986 call = conn->call[i];
6990 code = MUTEX_TRYENTER(&call->lock);
6993 result = rxi_CheckCall(call, 1);
6994 MUTEX_EXIT(&call->lock);
6996 /* If CheckCall freed the call, it might
6997 * have destroyed the connection as well,
6998 * which screws up the linked lists.
7004 if (conn->type == RX_SERVER_CONNECTION) {
7005 /* This only actually destroys the connection if
7006 * there are no outstanding calls */
7007 MUTEX_ENTER(&conn->conn_data_lock);
7008 MUTEX_ENTER(&rx_refcnt_mutex);
7009 if (!havecalls && !conn->refCount
7010 && ((conn->lastSendTime + rx_idleConnectionTime) <
7012 conn->refCount++; /* it will be decr in rx_DestroyConn */
7013 MUTEX_EXIT(&rx_refcnt_mutex);
7014 MUTEX_EXIT(&conn->conn_data_lock);
7015 #ifdef RX_ENABLE_LOCKS
7016 rxi_DestroyConnectionNoLock(conn);
7017 #else /* RX_ENABLE_LOCKS */
7018 rxi_DestroyConnection(conn);
7019 #endif /* RX_ENABLE_LOCKS */
7021 #ifdef RX_ENABLE_LOCKS
7023 MUTEX_EXIT(&rx_refcnt_mutex);
7024 MUTEX_EXIT(&conn->conn_data_lock);
7026 #endif /* RX_ENABLE_LOCKS */
7030 #ifdef RX_ENABLE_LOCKS
7031 while (rx_connCleanup_list) {
7032 struct rx_connection *conn;
7033 conn = rx_connCleanup_list;
7034 rx_connCleanup_list = rx_connCleanup_list->next;
7035 MUTEX_EXIT(&rx_connHashTable_lock);
7036 rxi_CleanupConnection(conn);
7037 MUTEX_ENTER(&rx_connHashTable_lock);
7039 MUTEX_EXIT(&rx_connHashTable_lock);
7040 #endif /* RX_ENABLE_LOCKS */
7043 /* Find any peer structures that haven't been used (haven't had an
7044 * associated connection) for greater than rx_idlePeerTime */
7046 struct rx_peer **peer_ptr, **peer_end;
7050 * Why do we need to hold the rx_peerHashTable_lock across
7051 * the incrementing of peer_ptr since the rx_peerHashTable
7052 * array is not changing? We don't.
7054 * By dropping the lock periodically we can permit other
7055 * activities to be performed while a rxi_ReapConnections
7056 * call is in progress. The goal of reap connections
7057 * is to clean up quickly without causing large amounts
7058 * of contention. Therefore, it is important that global
7059 * mutexes not be held for extended periods of time.
7061 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7062 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7064 struct rx_peer *peer, *next, *prev;
7066 MUTEX_ENTER(&rx_peerHashTable_lock);
7067 for (prev = peer = *peer_ptr; peer; peer = next) {
7069 code = MUTEX_TRYENTER(&peer->peer_lock);
7070 if ((code) && (peer->refCount == 0)
7071 && ((peer->idleWhen + rx_idlePeerTime) < now.sec)) {
7072 struct opr_queue *cursor, *store;
7076 * now know that this peer object is one to be
7077 * removed from the hash table. Once it is removed
7078 * it can't be referenced by other threads.
7079 * Lets remove it first and decrement the struct
7080 * nPeerStructs count.
7082 if (peer == *peer_ptr) {
7088 if (rx_stats_active)
7089 rx_atomic_dec(&rx_stats.nPeerStructs);
7092 * Now if we hold references on 'prev' and 'next'
7093 * we can safely drop the rx_peerHashTable_lock
7094 * while we destroy this 'peer' object.
7100 MUTEX_EXIT(&rx_peerHashTable_lock);
7102 MUTEX_EXIT(&peer->peer_lock);
7103 MUTEX_DESTROY(&peer->peer_lock);
7105 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
7106 unsigned int num_funcs;
7107 struct rx_interface_stat *rpc_stat
7108 = opr_queue_Entry(cursor, struct rx_interface_stat,
7113 opr_queue_Remove(&rpc_stat->entry);
7114 opr_queue_Remove(&rpc_stat->entryPeers);
7116 num_funcs = rpc_stat->stats[0].func_total;
7118 sizeof(rx_interface_stat_t) +
7119 rpc_stat->stats[0].func_total *
7120 sizeof(rx_function_entry_v1_t);
7122 rxi_Free(rpc_stat, space);
7124 MUTEX_ENTER(&rx_rpc_stats);
7125 rxi_rpc_peer_stat_cnt -= num_funcs;
7126 MUTEX_EXIT(&rx_rpc_stats);
7131 * Regain the rx_peerHashTable_lock and
7132 * decrement the reference count on 'prev'
7135 MUTEX_ENTER(&rx_peerHashTable_lock);
7142 MUTEX_EXIT(&peer->peer_lock);
7147 MUTEX_EXIT(&rx_peerHashTable_lock);
7151 /* THIS HACK IS A TEMPORARY HACK. The idea is that the race condition in
7152 * rxi_AllocSendPacket, if it hits, will be handled at the next conn
7153 * GC, just below. Really, we shouldn't have to keep moving packets from
7154 * one place to another, but instead ought to always know if we can
7155 * afford to hold onto a packet in its particular use. */
7156 MUTEX_ENTER(&rx_freePktQ_lock);
7157 if (rx_waitingForPackets) {
7158 rx_waitingForPackets = 0;
7159 #ifdef RX_ENABLE_LOCKS
7160 CV_BROADCAST(&rx_waitingForPackets_cv);
7162 osi_rxWakeup(&rx_waitingForPackets);
7165 MUTEX_EXIT(&rx_freePktQ_lock);
7168 when.sec += RX_REAP_TIME; /* Check every RX_REAP_TIME seconds */
7169 rxevent_Put(rxevent_Post(&when, &now, rxi_ReapConnections, 0, NULL, 0));
7173 /* rxs_Release - This isn't strictly necessary but, since the macro name from
7174 * rx.h is sort of strange this is better. This is called with a security
7175 * object before it is discarded. Each connection using a security object has
7176 * its own refcount to the object so it won't actually be freed until the last
7177 * connection is destroyed.
7179 * This is the only rxs module call. A hold could also be written but no one
7183 rxs_Release(struct rx_securityClass *aobj)
7185 return RXS_Close(aobj);
7193 #define TRACE_OPTION_RX_DEBUG 16
7201 code = RegOpenKeyEx(HKEY_LOCAL_MACHINE, AFSREG_CLT_SVC_PARAM_SUBKEY,
7202 0, KEY_QUERY_VALUE, &parmKey);
7203 if (code != ERROR_SUCCESS)
7206 dummyLen = sizeof(TraceOption);
7207 code = RegQueryValueEx(parmKey, "TraceOption", NULL, NULL,
7208 (BYTE *) &TraceOption, &dummyLen);
7209 if (code == ERROR_SUCCESS) {
7210 rxdebug_active = (TraceOption & TRACE_OPTION_RX_DEBUG) ? 1 : 0;
7212 RegCloseKey (parmKey);
7213 #endif /* AFS_NT40_ENV */
7218 rx_DebugOnOff(int on)
7222 rxdebug_active = on;
7228 rx_StatsOnOff(int on)
7230 rx_stats_active = on;
7234 /* Don't call this debugging routine directly; use dpf */
7236 rxi_DebugPrint(char *format, ...)
7245 va_start(ap, format);
7247 len = _snprintf(tformat, sizeof(tformat), "tid[%d] %s", GetCurrentThreadId(), format);
7250 len = _vsnprintf(msg, sizeof(msg)-2, tformat, ap);
7252 OutputDebugString(msg);
7258 va_start(ap, format);
7260 clock_GetTime(&now);
7261 fprintf(rx_Log, " %d.%06d:", (unsigned int)now.sec,
7262 (unsigned int)now.usec);
7263 vfprintf(rx_Log, format, ap);
7271 * This function is used to process the rx_stats structure that is local
7272 * to a process as well as an rx_stats structure received from a remote
7273 * process (via rxdebug). Therefore, it needs to do minimal version
7277 rx_PrintTheseStats(FILE * file, struct rx_statistics *s, int size,
7278 afs_int32 freePackets, char version)
7282 if (size != sizeof(struct rx_statistics)) {
7284 "Unexpected size of stats structure: was %d, expected %" AFS_SIZET_FMT "\n",
7285 size, sizeof(struct rx_statistics));
7288 fprintf(file, "rx stats: free packets %d, allocs %d, ", (int)freePackets,
7291 if (version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7292 fprintf(file, "alloc-failures(rcv %u/%u,send %u/%u,ack %u)\n",
7293 s->receivePktAllocFailures, s->receiveCbufPktAllocFailures,
7294 s->sendPktAllocFailures, s->sendCbufPktAllocFailures,
7295 s->specialPktAllocFailures);
7297 fprintf(file, "alloc-failures(rcv %u,send %u,ack %u)\n",
7298 s->receivePktAllocFailures, s->sendPktAllocFailures,
7299 s->specialPktAllocFailures);
7303 " greedy %u, " "bogusReads %u (last from host %x), "
7304 "noPackets %u, " "noBuffers %u, " "selects %u, "
7305 "sendSelects %u\n", s->socketGreedy, s->bogusPacketOnRead,
7306 s->bogusHost, s->noPacketOnRead, s->noPacketBuffersOnRead,
7307 s->selects, s->sendSelects);
7309 fprintf(file, " packets read: ");
7310 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7311 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsRead[i]);
7313 fprintf(file, "\n");
7316 " other read counters: data %u, " "ack %u, " "dup %u "
7317 "spurious %u " "dally %u\n", s->dataPacketsRead,
7318 s->ackPacketsRead, s->dupPacketsRead, s->spuriousPacketsRead,
7319 s->ignorePacketDally);
7321 fprintf(file, " packets sent: ");
7322 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7323 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsSent[i]);
7325 fprintf(file, "\n");
7328 " other send counters: ack %u, " "data %u (not resends), "
7329 "resends %u, " "pushed %u, " "acked&ignored %u\n",
7330 s->ackPacketsSent, s->dataPacketsSent, s->dataPacketsReSent,
7331 s->dataPacketsPushed, s->ignoreAckedPacket);
7334 " \t(these should be small) sendFailed %u, " "fatalErrors %u\n",
7335 s->netSendFailures, (int)s->fatalErrors);
7337 if (s->nRttSamples) {
7338 fprintf(file, " Average rtt is %0.3f, with %d samples\n",
7339 clock_Float(&s->totalRtt) / s->nRttSamples, s->nRttSamples);
7341 fprintf(file, " Minimum rtt is %0.3f, maximum is %0.3f\n",
7342 clock_Float(&s->minRtt), clock_Float(&s->maxRtt));
7346 " %d server connections, " "%d client connections, "
7347 "%d peer structs, " "%d call structs, " "%d free call structs\n",
7348 s->nServerConns, s->nClientConns, s->nPeerStructs,
7349 s->nCallStructs, s->nFreeCallStructs);
7351 #if !defined(AFS_PTHREAD_ENV) && !defined(AFS_USE_GETTIMEOFDAY)
7352 fprintf(file, " %d clock updates\n", clock_nUpdates);
7356 /* for backward compatibility */
7358 rx_PrintStats(FILE * file)
7360 MUTEX_ENTER(&rx_stats_mutex);
7361 rx_PrintTheseStats(file, (struct rx_statistics *) &rx_stats,
7362 sizeof(rx_stats), rx_nFreePackets,
7364 MUTEX_EXIT(&rx_stats_mutex);
7368 rx_PrintPeerStats(FILE * file, struct rx_peer *peer)
7370 fprintf(file, "Peer %x.%d.\n",
7371 ntohl(peer->host), (int)ntohs(peer->port));
7374 " Rtt %d, " "total sent %d, " "resent %d\n",
7375 peer->rtt, peer->nSent, peer->reSends);
7377 fprintf(file, " Packet size %d\n", peer->ifMTU);
7381 #if defined(AFS_PTHREAD_ENV) && defined(RXDEBUG)
7383 * This mutex protects the following static variables:
7387 #define LOCK_RX_DEBUG MUTEX_ENTER(&rx_debug_mutex)
7388 #define UNLOCK_RX_DEBUG MUTEX_EXIT(&rx_debug_mutex)
7390 #define LOCK_RX_DEBUG
7391 #define UNLOCK_RX_DEBUG
7392 #endif /* AFS_PTHREAD_ENV */
7394 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7396 MakeDebugCall(osi_socket socket, afs_uint32 remoteAddr, afs_uint16 remotePort,
7397 u_char type, void *inputData, size_t inputLength,
7398 void *outputData, size_t outputLength)
7400 static afs_int32 counter = 100;
7401 time_t waitTime, waitCount;
7402 struct rx_header theader;
7405 struct timeval tv_now, tv_wake, tv_delta;
7406 struct sockaddr_in taddr, faddr;
7420 tp = &tbuffer[sizeof(struct rx_header)];
7421 taddr.sin_family = AF_INET;
7422 taddr.sin_port = remotePort;
7423 taddr.sin_addr.s_addr = remoteAddr;
7424 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
7425 taddr.sin_len = sizeof(struct sockaddr_in);
7428 memset(&theader, 0, sizeof(theader));
7429 theader.epoch = htonl(999);
7431 theader.callNumber = htonl(counter);
7434 theader.type = type;
7435 theader.flags = RX_CLIENT_INITIATED | RX_LAST_PACKET;
7436 theader.serviceId = 0;
7438 memcpy(tbuffer, &theader, sizeof(theader));
7439 memcpy(tp, inputData, inputLength);
7441 sendto(socket, tbuffer, inputLength + sizeof(struct rx_header), 0,
7442 (struct sockaddr *)&taddr, sizeof(struct sockaddr_in));
7444 /* see if there's a packet available */
7445 gettimeofday(&tv_wake, NULL);
7446 tv_wake.tv_sec += waitTime;
7449 FD_SET(socket, &imask);
7450 tv_delta.tv_sec = tv_wake.tv_sec;
7451 tv_delta.tv_usec = tv_wake.tv_usec;
7452 gettimeofday(&tv_now, NULL);
7454 if (tv_delta.tv_usec < tv_now.tv_usec) {
7456 tv_delta.tv_usec += 1000000;
7459 tv_delta.tv_usec -= tv_now.tv_usec;
7461 if (tv_delta.tv_sec < tv_now.tv_sec) {
7465 tv_delta.tv_sec -= tv_now.tv_sec;
7468 code = select(0, &imask, 0, 0, &tv_delta);
7469 #else /* AFS_NT40_ENV */
7470 code = select(socket + 1, &imask, 0, 0, &tv_delta);
7471 #endif /* AFS_NT40_ENV */
7472 if (code == 1 && FD_ISSET(socket, &imask)) {
7473 /* now receive a packet */
7474 faddrLen = sizeof(struct sockaddr_in);
7476 recvfrom(socket, tbuffer, sizeof(tbuffer), 0,
7477 (struct sockaddr *)&faddr, &faddrLen);
7480 memcpy(&theader, tbuffer, sizeof(struct rx_header));
7481 if (counter == ntohl(theader.callNumber))
7489 /* see if we've timed out */
7497 code -= sizeof(struct rx_header);
7498 if (code > outputLength)
7499 code = outputLength;
7500 memcpy(outputData, tp, code);
7503 #endif /* RXDEBUG */
7506 rx_GetServerDebug(osi_socket socket, afs_uint32 remoteAddr,
7507 afs_uint16 remotePort, struct rx_debugStats * stat,
7508 afs_uint32 * supportedValues)
7510 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7512 struct rx_debugIn in;
7514 *supportedValues = 0;
7515 in.type = htonl(RX_DEBUGI_GETSTATS);
7518 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7519 &in, sizeof(in), stat, sizeof(*stat));
7522 * If the call was successful, fixup the version and indicate
7523 * what contents of the stat structure are valid.
7524 * Also do net to host conversion of fields here.
7528 if (stat->version >= RX_DEBUGI_VERSION_W_SECSTATS) {
7529 *supportedValues |= RX_SERVER_DEBUG_SEC_STATS;
7531 if (stat->version >= RX_DEBUGI_VERSION_W_GETALLCONN) {
7532 *supportedValues |= RX_SERVER_DEBUG_ALL_CONN;
7534 if (stat->version >= RX_DEBUGI_VERSION_W_RXSTATS) {
7535 *supportedValues |= RX_SERVER_DEBUG_RX_STATS;
7537 if (stat->version >= RX_DEBUGI_VERSION_W_WAITERS) {
7538 *supportedValues |= RX_SERVER_DEBUG_WAITER_CNT;
7540 if (stat->version >= RX_DEBUGI_VERSION_W_IDLETHREADS) {
7541 *supportedValues |= RX_SERVER_DEBUG_IDLE_THREADS;
7543 if (stat->version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7544 *supportedValues |= RX_SERVER_DEBUG_NEW_PACKETS;
7546 if (stat->version >= RX_DEBUGI_VERSION_W_GETPEER) {
7547 *supportedValues |= RX_SERVER_DEBUG_ALL_PEER;
7549 if (stat->version >= RX_DEBUGI_VERSION_W_WAITED) {
7550 *supportedValues |= RX_SERVER_DEBUG_WAITED_CNT;
7552 if (stat->version >= RX_DEBUGI_VERSION_W_PACKETS) {
7553 *supportedValues |= RX_SERVER_DEBUG_PACKETS_CNT;
7555 stat->nFreePackets = ntohl(stat->nFreePackets);
7556 stat->packetReclaims = ntohl(stat->packetReclaims);
7557 stat->callsExecuted = ntohl(stat->callsExecuted);
7558 stat->nWaiting = ntohl(stat->nWaiting);
7559 stat->idleThreads = ntohl(stat->idleThreads);
7560 stat->nWaited = ntohl(stat->nWaited);
7561 stat->nPackets = ntohl(stat->nPackets);
7570 rx_GetServerStats(osi_socket socket, afs_uint32 remoteAddr,
7571 afs_uint16 remotePort, struct rx_statistics * stat,
7572 afs_uint32 * supportedValues)
7574 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7576 struct rx_debugIn in;
7577 afs_int32 *lp = (afs_int32 *) stat;
7581 * supportedValues is currently unused, but added to allow future
7582 * versioning of this function.
7585 *supportedValues = 0;
7586 in.type = htonl(RX_DEBUGI_RXSTATS);
7588 memset(stat, 0, sizeof(*stat));
7590 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7591 &in, sizeof(in), stat, sizeof(*stat));
7596 * Do net to host conversion here
7599 for (i = 0; i < sizeof(*stat) / sizeof(afs_int32); i++, lp++) {
7610 rx_GetServerVersion(osi_socket socket, afs_uint32 remoteAddr,
7611 afs_uint16 remotePort, size_t version_length,
7614 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7616 return MakeDebugCall(socket, remoteAddr, remotePort,
7617 RX_PACKET_TYPE_VERSION, a, 1, version,
7625 rx_GetServerConnections(osi_socket socket, afs_uint32 remoteAddr,
7626 afs_uint16 remotePort, afs_int32 * nextConnection,
7627 int allConnections, afs_uint32 debugSupportedValues,
7628 struct rx_debugConn * conn,
7629 afs_uint32 * supportedValues)
7631 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7633 struct rx_debugIn in;
7637 * supportedValues is currently unused, but added to allow future
7638 * versioning of this function.
7641 *supportedValues = 0;
7642 if (allConnections) {
7643 in.type = htonl(RX_DEBUGI_GETALLCONN);
7645 in.type = htonl(RX_DEBUGI_GETCONN);
7647 in.index = htonl(*nextConnection);
7648 memset(conn, 0, sizeof(*conn));
7650 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7651 &in, sizeof(in), conn, sizeof(*conn));
7654 *nextConnection += 1;
7657 * Convert old connection format to new structure.
7660 if (debugSupportedValues & RX_SERVER_DEBUG_OLD_CONN) {
7661 struct rx_debugConn_vL *vL = (struct rx_debugConn_vL *)conn;
7662 #define MOVEvL(a) (conn->a = vL->a)
7664 /* any old or unrecognized version... */
7665 for (i = 0; i < RX_MAXCALLS; i++) {
7666 MOVEvL(callState[i]);
7667 MOVEvL(callMode[i]);
7668 MOVEvL(callFlags[i]);
7669 MOVEvL(callOther[i]);
7671 if (debugSupportedValues & RX_SERVER_DEBUG_SEC_STATS) {
7672 MOVEvL(secStats.type);
7673 MOVEvL(secStats.level);
7674 MOVEvL(secStats.flags);
7675 MOVEvL(secStats.expires);
7676 MOVEvL(secStats.packetsReceived);
7677 MOVEvL(secStats.packetsSent);
7678 MOVEvL(secStats.bytesReceived);
7679 MOVEvL(secStats.bytesSent);
7684 * Do net to host conversion here
7686 * I don't convert host or port since we are most likely
7687 * going to want these in NBO.
7689 conn->cid = ntohl(conn->cid);
7690 conn->serial = ntohl(conn->serial);
7691 for (i = 0; i < RX_MAXCALLS; i++) {
7692 conn->callNumber[i] = ntohl(conn->callNumber[i]);
7694 conn->error = ntohl(conn->error);
7695 conn->secStats.flags = ntohl(conn->secStats.flags);
7696 conn->secStats.expires = ntohl(conn->secStats.expires);
7697 conn->secStats.packetsReceived =
7698 ntohl(conn->secStats.packetsReceived);
7699 conn->secStats.packetsSent = ntohl(conn->secStats.packetsSent);
7700 conn->secStats.bytesReceived = ntohl(conn->secStats.bytesReceived);
7701 conn->secStats.bytesSent = ntohl(conn->secStats.bytesSent);
7702 conn->epoch = ntohl(conn->epoch);
7703 conn->natMTU = ntohl(conn->natMTU);
7712 rx_GetServerPeers(osi_socket socket, afs_uint32 remoteAddr,
7713 afs_uint16 remotePort, afs_int32 * nextPeer,
7714 afs_uint32 debugSupportedValues, struct rx_debugPeer * peer,
7715 afs_uint32 * supportedValues)
7717 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7719 struct rx_debugIn in;
7722 * supportedValues is currently unused, but added to allow future
7723 * versioning of this function.
7726 *supportedValues = 0;
7727 in.type = htonl(RX_DEBUGI_GETPEER);
7728 in.index = htonl(*nextPeer);
7729 memset(peer, 0, sizeof(*peer));
7731 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7732 &in, sizeof(in), peer, sizeof(*peer));
7738 * Do net to host conversion here
7740 * I don't convert host or port since we are most likely
7741 * going to want these in NBO.
7743 peer->ifMTU = ntohs(peer->ifMTU);
7744 peer->idleWhen = ntohl(peer->idleWhen);
7745 peer->refCount = ntohs(peer->refCount);
7746 peer->rtt = ntohl(peer->rtt);
7747 peer->rtt_dev = ntohl(peer->rtt_dev);
7748 peer->timeout.sec = 0;
7749 peer->timeout.usec = 0;
7750 peer->nSent = ntohl(peer->nSent);
7751 peer->reSends = ntohl(peer->reSends);
7752 peer->natMTU = ntohs(peer->natMTU);
7753 peer->maxMTU = ntohs(peer->maxMTU);
7754 peer->maxDgramPackets = ntohs(peer->maxDgramPackets);
7755 peer->ifDgramPackets = ntohs(peer->ifDgramPackets);
7756 peer->MTU = ntohs(peer->MTU);
7757 peer->cwind = ntohs(peer->cwind);
7758 peer->nDgramPackets = ntohs(peer->nDgramPackets);
7759 peer->congestSeq = ntohs(peer->congestSeq);
7760 peer->bytesSent.high = ntohl(peer->bytesSent.high);
7761 peer->bytesSent.low = ntohl(peer->bytesSent.low);
7762 peer->bytesReceived.high = ntohl(peer->bytesReceived.high);
7763 peer->bytesReceived.low = ntohl(peer->bytesReceived.low);
7772 rx_GetLocalPeers(afs_uint32 peerHost, afs_uint16 peerPort,
7773 struct rx_debugPeer * peerStats)
7776 afs_int32 error = 1; /* default to "did not succeed" */
7777 afs_uint32 hashValue = PEER_HASH(peerHost, peerPort);
7779 MUTEX_ENTER(&rx_peerHashTable_lock);
7780 for(tp = rx_peerHashTable[hashValue];
7781 tp != NULL; tp = tp->next) {
7782 if (tp->host == peerHost)
7788 MUTEX_EXIT(&rx_peerHashTable_lock);
7792 MUTEX_ENTER(&tp->peer_lock);
7793 peerStats->host = tp->host;
7794 peerStats->port = tp->port;
7795 peerStats->ifMTU = tp->ifMTU;
7796 peerStats->idleWhen = tp->idleWhen;
7797 peerStats->refCount = tp->refCount;
7798 peerStats->burstSize = 0;
7799 peerStats->burst = 0;
7800 peerStats->burstWait.sec = 0;
7801 peerStats->burstWait.usec = 0;
7802 peerStats->rtt = tp->rtt;
7803 peerStats->rtt_dev = tp->rtt_dev;
7804 peerStats->timeout.sec = 0;
7805 peerStats->timeout.usec = 0;
7806 peerStats->nSent = tp->nSent;
7807 peerStats->reSends = tp->reSends;
7808 peerStats->natMTU = tp->natMTU;
7809 peerStats->maxMTU = tp->maxMTU;
7810 peerStats->maxDgramPackets = tp->maxDgramPackets;
7811 peerStats->ifDgramPackets = tp->ifDgramPackets;
7812 peerStats->MTU = tp->MTU;
7813 peerStats->cwind = tp->cwind;
7814 peerStats->nDgramPackets = tp->nDgramPackets;
7815 peerStats->congestSeq = tp->congestSeq;
7816 peerStats->bytesSent.high = tp->bytesSent >> 32;
7817 peerStats->bytesSent.low = tp->bytesSent & MAX_AFS_UINT32;
7818 peerStats->bytesReceived.high = tp->bytesReceived >> 32;
7819 peerStats->bytesReceived.low
7820 = tp->bytesReceived & MAX_AFS_UINT32;
7821 MUTEX_EXIT(&tp->peer_lock);
7823 MUTEX_ENTER(&rx_peerHashTable_lock);
7826 MUTEX_EXIT(&rx_peerHashTable_lock);
7834 struct rx_serverQueueEntry *np;
7837 struct rx_call *call;
7838 struct rx_serverQueueEntry *sq;
7842 if (rxinit_status == 1) {
7844 return; /* Already shutdown. */
7848 #ifndef AFS_PTHREAD_ENV
7849 FD_ZERO(&rx_selectMask);
7850 #endif /* AFS_PTHREAD_ENV */
7851 rxi_dataQuota = RX_MAX_QUOTA;
7852 #ifndef AFS_PTHREAD_ENV
7854 #endif /* AFS_PTHREAD_ENV */
7857 #ifndef AFS_PTHREAD_ENV
7858 #ifndef AFS_USE_GETTIMEOFDAY
7860 #endif /* AFS_USE_GETTIMEOFDAY */
7861 #endif /* AFS_PTHREAD_ENV */
7863 while (!opr_queue_IsEmpty(&rx_freeCallQueue)) {
7864 call = opr_queue_First(&rx_freeCallQueue, struct rx_call, entry);
7865 opr_queue_Remove(&call->entry);
7866 rxi_Free(call, sizeof(struct rx_call));
7869 while (!opr_queue_IsEmpty(&rx_idleServerQueue)) {
7870 sq = opr_queue_First(&rx_idleServerQueue, struct rx_serverQueueEntry,
7872 opr_queue_Remove(&sq->entry);
7877 struct rx_peer **peer_ptr, **peer_end;
7878 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7879 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7881 struct rx_peer *peer, *next;
7883 MUTEX_ENTER(&rx_peerHashTable_lock);
7884 for (peer = *peer_ptr; peer; peer = next) {
7885 struct opr_queue *cursor, *store;
7888 MUTEX_ENTER(&rx_rpc_stats);
7889 MUTEX_ENTER(&peer->peer_lock);
7890 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
7891 unsigned int num_funcs;
7892 struct rx_interface_stat *rpc_stat
7893 = opr_queue_Entry(cursor, struct rx_interface_stat,
7897 opr_queue_Remove(&rpc_stat->entry);
7898 opr_queue_Remove(&rpc_stat->entryPeers);
7899 num_funcs = rpc_stat->stats[0].func_total;
7901 sizeof(rx_interface_stat_t) +
7902 rpc_stat->stats[0].func_total *
7903 sizeof(rx_function_entry_v1_t);
7905 rxi_Free(rpc_stat, space);
7907 /* rx_rpc_stats must be held */
7908 rxi_rpc_peer_stat_cnt -= num_funcs;
7910 MUTEX_EXIT(&peer->peer_lock);
7911 MUTEX_EXIT(&rx_rpc_stats);
7915 if (rx_stats_active)
7916 rx_atomic_dec(&rx_stats.nPeerStructs);
7918 MUTEX_EXIT(&rx_peerHashTable_lock);
7921 for (i = 0; i < RX_MAX_SERVICES; i++) {
7923 rxi_Free(rx_services[i], sizeof(*rx_services[i]));
7925 for (i = 0; i < rx_hashTableSize; i++) {
7926 struct rx_connection *tc, *ntc;
7927 MUTEX_ENTER(&rx_connHashTable_lock);
7928 for (tc = rx_connHashTable[i]; tc; tc = ntc) {
7930 for (j = 0; j < RX_MAXCALLS; j++) {
7932 rxi_Free(tc->call[j], sizeof(*tc->call[j]));
7935 rxi_Free(tc, sizeof(*tc));
7937 MUTEX_EXIT(&rx_connHashTable_lock);
7940 MUTEX_ENTER(&freeSQEList_lock);
7942 while ((np = rx_FreeSQEList)) {
7943 rx_FreeSQEList = *(struct rx_serverQueueEntry **)np;
7944 MUTEX_DESTROY(&np->lock);
7945 rxi_Free(np, sizeof(*np));
7948 MUTEX_EXIT(&freeSQEList_lock);
7949 MUTEX_DESTROY(&freeSQEList_lock);
7950 MUTEX_DESTROY(&rx_freeCallQueue_lock);
7951 MUTEX_DESTROY(&rx_connHashTable_lock);
7952 MUTEX_DESTROY(&rx_peerHashTable_lock);
7953 MUTEX_DESTROY(&rx_serverPool_lock);
7955 osi_Free(rx_connHashTable,
7956 rx_hashTableSize * sizeof(struct rx_connection *));
7957 osi_Free(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
7959 UNPIN(rx_connHashTable,
7960 rx_hashTableSize * sizeof(struct rx_connection *));
7961 UNPIN(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
7963 rxi_FreeAllPackets();
7965 MUTEX_ENTER(&rx_quota_mutex);
7966 rxi_dataQuota = RX_MAX_QUOTA;
7967 rxi_availProcs = rxi_totalMin = rxi_minDeficit = 0;
7968 MUTEX_EXIT(&rx_quota_mutex);
7976 * Routines to implement connection specific data.
7980 rx_KeyCreate(rx_destructor_t rtn)
7983 MUTEX_ENTER(&rxi_keyCreate_lock);
7984 key = rxi_keyCreate_counter++;
7985 rxi_keyCreate_destructor = (rx_destructor_t *)
7986 realloc((void *)rxi_keyCreate_destructor,
7987 (key + 1) * sizeof(rx_destructor_t));
7988 rxi_keyCreate_destructor[key] = rtn;
7989 MUTEX_EXIT(&rxi_keyCreate_lock);
7994 rx_SetSpecific(struct rx_connection *conn, int key, void *ptr)
7997 MUTEX_ENTER(&conn->conn_data_lock);
7998 if (!conn->specific) {
7999 conn->specific = malloc((key + 1) * sizeof(void *));
8000 for (i = 0; i < key; i++)
8001 conn->specific[i] = NULL;
8002 conn->nSpecific = key + 1;
8003 conn->specific[key] = ptr;
8004 } else if (key >= conn->nSpecific) {
8005 conn->specific = (void **)
8006 realloc(conn->specific, (key + 1) * sizeof(void *));
8007 for (i = conn->nSpecific; i < key; i++)
8008 conn->specific[i] = NULL;
8009 conn->nSpecific = key + 1;
8010 conn->specific[key] = ptr;
8012 if (conn->specific[key] && rxi_keyCreate_destructor[key])
8013 (*rxi_keyCreate_destructor[key]) (conn->specific[key]);
8014 conn->specific[key] = ptr;
8016 MUTEX_EXIT(&conn->conn_data_lock);
8020 rx_SetServiceSpecific(struct rx_service *svc, int key, void *ptr)
8023 MUTEX_ENTER(&svc->svc_data_lock);
8024 if (!svc->specific) {
8025 svc->specific = malloc((key + 1) * sizeof(void *));
8026 for (i = 0; i < key; i++)
8027 svc->specific[i] = NULL;
8028 svc->nSpecific = key + 1;
8029 svc->specific[key] = ptr;
8030 } else if (key >= svc->nSpecific) {
8031 svc->specific = (void **)
8032 realloc(svc->specific, (key + 1) * sizeof(void *));
8033 for (i = svc->nSpecific; i < key; i++)
8034 svc->specific[i] = NULL;
8035 svc->nSpecific = key + 1;
8036 svc->specific[key] = ptr;
8038 if (svc->specific[key] && rxi_keyCreate_destructor[key])
8039 (*rxi_keyCreate_destructor[key]) (svc->specific[key]);
8040 svc->specific[key] = ptr;
8042 MUTEX_EXIT(&svc->svc_data_lock);
8046 rx_GetSpecific(struct rx_connection *conn, int key)
8049 MUTEX_ENTER(&conn->conn_data_lock);
8050 if (key >= conn->nSpecific)
8053 ptr = conn->specific[key];
8054 MUTEX_EXIT(&conn->conn_data_lock);
8059 rx_GetServiceSpecific(struct rx_service *svc, int key)
8062 MUTEX_ENTER(&svc->svc_data_lock);
8063 if (key >= svc->nSpecific)
8066 ptr = svc->specific[key];
8067 MUTEX_EXIT(&svc->svc_data_lock);
8072 #endif /* !KERNEL */
8075 * processStats is a queue used to store the statistics for the local
8076 * process. Its contents are similar to the contents of the rpcStats
8077 * queue on a rx_peer structure, but the actual data stored within
8078 * this queue contains totals across the lifetime of the process (assuming
8079 * the stats have not been reset) - unlike the per peer structures
8080 * which can come and go based upon the peer lifetime.
8083 static struct opr_queue processStats = { &processStats, &processStats };
8086 * peerStats is a queue used to store the statistics for all peer structs.
8087 * Its contents are the union of all the peer rpcStats queues.
8090 static struct opr_queue peerStats = { &peerStats, &peerStats };
8093 * rxi_monitor_processStats is used to turn process wide stat collection
8097 static int rxi_monitor_processStats = 0;
8100 * rxi_monitor_peerStats is used to turn per peer stat collection on and off
8103 static int rxi_monitor_peerStats = 0;
8107 rxi_ClearRPCOpStat(rx_function_entry_v1_p rpc_stat)
8109 rpc_stat->invocations = 0;
8110 rpc_stat->bytes_sent = 0;
8111 rpc_stat->bytes_rcvd = 0;
8112 rpc_stat->queue_time_sum.sec = 0;
8113 rpc_stat->queue_time_sum.usec = 0;
8114 rpc_stat->queue_time_sum_sqr.sec = 0;
8115 rpc_stat->queue_time_sum_sqr.usec = 0;
8116 rpc_stat->queue_time_min.sec = 9999999;
8117 rpc_stat->queue_time_min.usec = 9999999;
8118 rpc_stat->queue_time_max.sec = 0;
8119 rpc_stat->queue_time_max.usec = 0;
8120 rpc_stat->execution_time_sum.sec = 0;
8121 rpc_stat->execution_time_sum.usec = 0;
8122 rpc_stat->execution_time_sum_sqr.sec = 0;
8123 rpc_stat->execution_time_sum_sqr.usec = 0;
8124 rpc_stat->execution_time_min.sec = 9999999;
8125 rpc_stat->execution_time_min.usec = 9999999;
8126 rpc_stat->execution_time_max.sec = 0;
8127 rpc_stat->execution_time_max.usec = 0;
8131 * Given all of the information for a particular rpc
8132 * call, find or create (if requested) the stat structure for the rpc.
8135 * the queue of stats that will be updated with the new value
8137 * @param rxInterface
8138 * a unique number that identifies the rpc interface
8141 * the total number of functions in this interface. this is only
8142 * required if create is true
8145 * if true, this invocation was made to a server
8148 * the ip address of the remote host. this is only required if create
8149 * and addToPeerList are true
8152 * the port of the remote host. this is only required if create
8153 * and addToPeerList are true
8155 * @param addToPeerList
8156 * if != 0, add newly created stat to the global peer list
8159 * if a new stats structure is allocated, the counter will
8160 * be updated with the new number of allocated stat structures.
8161 * only required if create is true
8164 * if no stats structure exists, allocate one
8168 static rx_interface_stat_p
8169 rxi_FindRpcStat(struct opr_queue *stats, afs_uint32 rxInterface,
8170 afs_uint32 totalFunc, int isServer, afs_uint32 remoteHost,
8171 afs_uint32 remotePort, int addToPeerList,
8172 unsigned int *counter, int create)
8174 rx_interface_stat_p rpc_stat = NULL;
8175 struct opr_queue *cursor;
8178 * See if there's already a structure for this interface
8181 for (opr_queue_Scan(stats, cursor)) {
8182 rpc_stat = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8184 if ((rpc_stat->stats[0].interfaceId == rxInterface)
8185 && (rpc_stat->stats[0].remote_is_server == isServer))
8189 /* if they didn't ask us to create, we're done */
8191 if (opr_queue_IsEnd(stats, cursor))
8197 /* can't proceed without these */
8198 if (!totalFunc || !counter)
8202 * Didn't find a match so allocate a new structure and add it to the
8206 if (opr_queue_IsEnd(stats, cursor) || (rpc_stat == NULL)
8207 || (rpc_stat->stats[0].interfaceId != rxInterface)
8208 || (rpc_stat->stats[0].remote_is_server != isServer)) {
8213 sizeof(rx_interface_stat_t) +
8214 totalFunc * sizeof(rx_function_entry_v1_t);
8216 rpc_stat = rxi_Alloc(space);
8217 if (rpc_stat == NULL)
8220 *counter += totalFunc;
8221 for (i = 0; i < totalFunc; i++) {
8222 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8223 rpc_stat->stats[i].remote_peer = remoteHost;
8224 rpc_stat->stats[i].remote_port = remotePort;
8225 rpc_stat->stats[i].remote_is_server = isServer;
8226 rpc_stat->stats[i].interfaceId = rxInterface;
8227 rpc_stat->stats[i].func_total = totalFunc;
8228 rpc_stat->stats[i].func_index = i;
8230 opr_queue_Prepend(stats, &rpc_stat->entry);
8231 if (addToPeerList) {
8232 opr_queue_Prepend(&peerStats, &rpc_stat->entryPeers);
8239 rx_ClearProcessRPCStats(afs_int32 rxInterface)
8241 rx_interface_stat_p rpc_stat;
8244 if (rxInterface == -1)
8247 MUTEX_ENTER(&rx_rpc_stats);
8248 rpc_stat = rxi_FindRpcStat(&processStats, rxInterface, 0, 0,
8251 totalFunc = rpc_stat->stats[0].func_total;
8252 for (i = 0; i < totalFunc; i++)
8253 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8255 MUTEX_EXIT(&rx_rpc_stats);
8260 rx_ClearPeerRPCStats(afs_int32 rxInterface, afs_uint32 peerHost, afs_uint16 peerPort)
8262 rx_interface_stat_p rpc_stat;
8264 struct rx_peer * peer;
8266 if (rxInterface == -1)
8269 peer = rxi_FindPeer(peerHost, peerPort, 0, 0);
8273 MUTEX_ENTER(&rx_rpc_stats);
8274 rpc_stat = rxi_FindRpcStat(&peer->rpcStats, rxInterface, 0, 1,
8277 totalFunc = rpc_stat->stats[0].func_total;
8278 for (i = 0; i < totalFunc; i++)
8279 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8281 MUTEX_EXIT(&rx_rpc_stats);
8286 rx_CopyProcessRPCStats(afs_uint64 op)
8288 rx_interface_stat_p rpc_stat;
8289 rx_function_entry_v1_p rpcop_stat =
8290 rxi_Alloc(sizeof(rx_function_entry_v1_t));
8291 int currentFunc = (op & MAX_AFS_UINT32);
8292 afs_int32 rxInterface = (op >> 32);
8294 if (!rxi_monitor_processStats)
8297 if (rxInterface == -1)
8300 if (rpcop_stat == NULL)
8303 MUTEX_ENTER(&rx_rpc_stats);
8304 rpc_stat = rxi_FindRpcStat(&processStats, rxInterface, 0, 0,
8307 memcpy(rpcop_stat, &(rpc_stat->stats[currentFunc]),
8308 sizeof(rx_function_entry_v1_t));
8309 MUTEX_EXIT(&rx_rpc_stats);
8311 rxi_Free(rpcop_stat, sizeof(rx_function_entry_v1_t));
8318 rx_CopyPeerRPCStats(afs_uint64 op, afs_uint32 peerHost, afs_uint16 peerPort)
8320 rx_interface_stat_p rpc_stat;
8321 rx_function_entry_v1_p rpcop_stat =
8322 rxi_Alloc(sizeof(rx_function_entry_v1_t));
8323 int currentFunc = (op & MAX_AFS_UINT32);
8324 afs_int32 rxInterface = (op >> 32);
8325 struct rx_peer *peer;
8327 if (!rxi_monitor_peerStats)
8330 if (rxInterface == -1)
8333 if (rpcop_stat == NULL)
8336 peer = rxi_FindPeer(peerHost, peerPort, 0, 0);
8340 MUTEX_ENTER(&rx_rpc_stats);
8341 rpc_stat = rxi_FindRpcStat(&peer->rpcStats, rxInterface, 0, 1,
8344 memcpy(rpcop_stat, &(rpc_stat->stats[currentFunc]),
8345 sizeof(rx_function_entry_v1_t));
8346 MUTEX_EXIT(&rx_rpc_stats);
8348 rxi_Free(rpcop_stat, sizeof(rx_function_entry_v1_t));
8355 rx_ReleaseRPCStats(void *stats)
8358 rxi_Free(stats, sizeof(rx_function_entry_v1_t));
8362 * Given all of the information for a particular rpc
8363 * call, create (if needed) and update the stat totals for the rpc.
8366 * the queue of stats that will be updated with the new value
8368 * @param rxInterface
8369 * a unique number that identifies the rpc interface
8371 * @param currentFunc
8372 * the index of the function being invoked
8375 * the total number of functions in this interface
8378 * the amount of time this function waited for a thread
8381 * the amount of time this function invocation took to execute
8384 * the number bytes sent by this invocation
8387 * the number bytes received by this invocation
8390 * if true, this invocation was made to a server
8393 * the ip address of the remote host
8396 * the port of the remote host
8398 * @param addToPeerList
8399 * if != 0, add newly created stat to the global peer list
8402 * if a new stats structure is allocated, the counter will
8403 * be updated with the new number of allocated stat structures
8408 rxi_AddRpcStat(struct opr_queue *stats, afs_uint32 rxInterface,
8409 afs_uint32 currentFunc, afs_uint32 totalFunc,
8410 struct clock *queueTime, struct clock *execTime,
8411 afs_uint64 bytesSent, afs_uint64 bytesRcvd, int isServer,
8412 afs_uint32 remoteHost, afs_uint32 remotePort,
8413 int addToPeerList, unsigned int *counter)
8416 rx_interface_stat_p rpc_stat;
8418 rpc_stat = rxi_FindRpcStat(stats, rxInterface, totalFunc, isServer,
8419 remoteHost, remotePort, addToPeerList, counter,
8427 * Increment the stats for this function
8430 rpc_stat->stats[currentFunc].invocations++;
8431 rpc_stat->stats[currentFunc].bytes_sent += bytesSent;
8432 rpc_stat->stats[currentFunc].bytes_rcvd += bytesRcvd;
8433 clock_Add(&rpc_stat->stats[currentFunc].queue_time_sum, queueTime);
8434 clock_AddSq(&rpc_stat->stats[currentFunc].queue_time_sum_sqr, queueTime);
8435 if (clock_Lt(queueTime, &rpc_stat->stats[currentFunc].queue_time_min)) {
8436 rpc_stat->stats[currentFunc].queue_time_min = *queueTime;
8438 if (clock_Gt(queueTime, &rpc_stat->stats[currentFunc].queue_time_max)) {
8439 rpc_stat->stats[currentFunc].queue_time_max = *queueTime;
8441 clock_Add(&rpc_stat->stats[currentFunc].execution_time_sum, execTime);
8442 clock_AddSq(&rpc_stat->stats[currentFunc].execution_time_sum_sqr,
8444 if (clock_Lt(execTime, &rpc_stat->stats[currentFunc].execution_time_min)) {
8445 rpc_stat->stats[currentFunc].execution_time_min = *execTime;
8447 if (clock_Gt(execTime, &rpc_stat->stats[currentFunc].execution_time_max)) {
8448 rpc_stat->stats[currentFunc].execution_time_max = *execTime;
8456 rxi_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8457 afs_uint32 currentFunc, afs_uint32 totalFunc,
8458 struct clock *queueTime, struct clock *execTime,
8459 afs_uint64 bytesSent, afs_uint64 bytesRcvd,
8463 if (!(rxi_monitor_peerStats || rxi_monitor_processStats))
8466 MUTEX_ENTER(&rx_rpc_stats);
8468 if (rxi_monitor_peerStats) {
8469 MUTEX_ENTER(&peer->peer_lock);
8470 rxi_AddRpcStat(&peer->rpcStats, rxInterface, currentFunc, totalFunc,
8471 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8472 peer->host, peer->port, 1, &rxi_rpc_peer_stat_cnt);
8473 MUTEX_EXIT(&peer->peer_lock);
8476 if (rxi_monitor_processStats) {
8477 rxi_AddRpcStat(&processStats, rxInterface, currentFunc, totalFunc,
8478 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8479 0xffffffff, 0xffffffff, 0, &rxi_rpc_process_stat_cnt);
8482 MUTEX_EXIT(&rx_rpc_stats);
8486 * Increment the times and count for a particular rpc function.
8488 * Traditionally this call was invoked from rxgen stubs. Modern stubs
8489 * call rx_RecordCallStatistics instead, so the public version of this
8490 * function is left purely for legacy callers.
8493 * The peer who invoked the rpc
8495 * @param rxInterface
8496 * A unique number that identifies the rpc interface
8498 * @param currentFunc
8499 * The index of the function being invoked
8502 * The total number of functions in this interface
8505 * The amount of time this function waited for a thread
8508 * The amount of time this function invocation took to execute
8511 * The number bytes sent by this invocation
8514 * The number bytes received by this invocation
8517 * If true, this invocation was made to a server
8521 rx_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8522 afs_uint32 currentFunc, afs_uint32 totalFunc,
8523 struct clock *queueTime, struct clock *execTime,
8524 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd,
8530 sent64 = ((afs_uint64)bytesSent->high << 32) + bytesSent->low;
8531 rcvd64 = ((afs_uint64)bytesRcvd->high << 32) + bytesRcvd->low;
8533 rxi_IncrementTimeAndCount(peer, rxInterface, currentFunc, totalFunc,
8534 queueTime, execTime, sent64, rcvd64,
8541 * rx_MarshallProcessRPCStats - marshall an array of rpc statistics
8545 * IN callerVersion - the rpc stat version of the caller.
8547 * IN count - the number of entries to marshall.
8549 * IN stats - pointer to stats to be marshalled.
8551 * OUT ptr - Where to store the marshalled data.
8558 rx_MarshallProcessRPCStats(afs_uint32 callerVersion, int count,
8559 rx_function_entry_v1_t * stats, afs_uint32 ** ptrP)
8565 * We only support the first version
8567 for (ptr = *ptrP, i = 0; i < count; i++, stats++) {
8568 *(ptr++) = stats->remote_peer;
8569 *(ptr++) = stats->remote_port;
8570 *(ptr++) = stats->remote_is_server;
8571 *(ptr++) = stats->interfaceId;
8572 *(ptr++) = stats->func_total;
8573 *(ptr++) = stats->func_index;
8574 *(ptr++) = stats->invocations >> 32;
8575 *(ptr++) = stats->invocations & MAX_AFS_UINT32;
8576 *(ptr++) = stats->bytes_sent >> 32;
8577 *(ptr++) = stats->bytes_sent & MAX_AFS_UINT32;
8578 *(ptr++) = stats->bytes_rcvd >> 32;
8579 *(ptr++) = stats->bytes_rcvd & MAX_AFS_UINT32;
8580 *(ptr++) = stats->queue_time_sum.sec;
8581 *(ptr++) = stats->queue_time_sum.usec;
8582 *(ptr++) = stats->queue_time_sum_sqr.sec;
8583 *(ptr++) = stats->queue_time_sum_sqr.usec;
8584 *(ptr++) = stats->queue_time_min.sec;
8585 *(ptr++) = stats->queue_time_min.usec;
8586 *(ptr++) = stats->queue_time_max.sec;
8587 *(ptr++) = stats->queue_time_max.usec;
8588 *(ptr++) = stats->execution_time_sum.sec;
8589 *(ptr++) = stats->execution_time_sum.usec;
8590 *(ptr++) = stats->execution_time_sum_sqr.sec;
8591 *(ptr++) = stats->execution_time_sum_sqr.usec;
8592 *(ptr++) = stats->execution_time_min.sec;
8593 *(ptr++) = stats->execution_time_min.usec;
8594 *(ptr++) = stats->execution_time_max.sec;
8595 *(ptr++) = stats->execution_time_max.usec;
8601 * rx_RetrieveProcessRPCStats - retrieve all of the rpc statistics for
8606 * IN callerVersion - the rpc stat version of the caller
8608 * OUT myVersion - the rpc stat version of this function
8610 * OUT clock_sec - local time seconds
8612 * OUT clock_usec - local time microseconds
8614 * OUT allocSize - the number of bytes allocated to contain stats
8616 * OUT statCount - the number stats retrieved from this process.
8618 * OUT stats - the actual stats retrieved from this process.
8622 * Returns void. If successful, stats will != NULL.
8626 rx_RetrieveProcessRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8627 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8628 size_t * allocSize, afs_uint32 * statCount,
8629 afs_uint32 ** stats)
8639 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8642 * Check to see if stats are enabled
8645 MUTEX_ENTER(&rx_rpc_stats);
8646 if (!rxi_monitor_processStats) {
8647 MUTEX_EXIT(&rx_rpc_stats);
8651 clock_GetTime(&now);
8652 *clock_sec = now.sec;
8653 *clock_usec = now.usec;
8656 * Allocate the space based upon the caller version
8658 * If the client is at an older version than we are,
8659 * we return the statistic data in the older data format, but
8660 * we still return our version number so the client knows we
8661 * are maintaining more data than it can retrieve.
8664 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8665 space = rxi_rpc_process_stat_cnt * sizeof(rx_function_entry_v1_t);
8666 *statCount = rxi_rpc_process_stat_cnt;
8669 * This can't happen yet, but in the future version changes
8670 * can be handled by adding additional code here
8674 if (space > (size_t) 0) {
8676 ptr = *stats = rxi_Alloc(space);
8679 struct opr_queue *cursor;
8681 for (opr_queue_Scan(&processStats, cursor)) {
8682 struct rx_interface_stat *rpc_stat =
8683 opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8685 * Copy the data based upon the caller version
8687 rx_MarshallProcessRPCStats(callerVersion,
8688 rpc_stat->stats[0].func_total,
8689 rpc_stat->stats, &ptr);
8695 MUTEX_EXIT(&rx_rpc_stats);
8700 * rx_RetrievePeerRPCStats - retrieve all of the rpc statistics for the peers
8704 * IN callerVersion - the rpc stat version of the caller
8706 * OUT myVersion - the rpc stat version of this function
8708 * OUT clock_sec - local time seconds
8710 * OUT clock_usec - local time microseconds
8712 * OUT allocSize - the number of bytes allocated to contain stats
8714 * OUT statCount - the number of stats retrieved from the individual
8717 * OUT stats - the actual stats retrieved from the individual peer structures.
8721 * Returns void. If successful, stats will != NULL.
8725 rx_RetrievePeerRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8726 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8727 size_t * allocSize, afs_uint32 * statCount,
8728 afs_uint32 ** stats)
8738 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8741 * Check to see if stats are enabled
8744 MUTEX_ENTER(&rx_rpc_stats);
8745 if (!rxi_monitor_peerStats) {
8746 MUTEX_EXIT(&rx_rpc_stats);
8750 clock_GetTime(&now);
8751 *clock_sec = now.sec;
8752 *clock_usec = now.usec;
8755 * Allocate the space based upon the caller version
8757 * If the client is at an older version than we are,
8758 * we return the statistic data in the older data format, but
8759 * we still return our version number so the client knows we
8760 * are maintaining more data than it can retrieve.
8763 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8764 space = rxi_rpc_peer_stat_cnt * sizeof(rx_function_entry_v1_t);
8765 *statCount = rxi_rpc_peer_stat_cnt;
8768 * This can't happen yet, but in the future version changes
8769 * can be handled by adding additional code here
8773 if (space > (size_t) 0) {
8775 ptr = *stats = rxi_Alloc(space);
8778 struct opr_queue *cursor;
8780 for (opr_queue_Scan(&peerStats, cursor)) {
8781 struct rx_interface_stat *rpc_stat
8782 = opr_queue_Entry(cursor, struct rx_interface_stat,
8786 * Copy the data based upon the caller version
8788 rx_MarshallProcessRPCStats(callerVersion,
8789 rpc_stat->stats[0].func_total,
8790 rpc_stat->stats, &ptr);
8796 MUTEX_EXIT(&rx_rpc_stats);
8801 * rx_FreeRPCStats - free memory allocated by
8802 * rx_RetrieveProcessRPCStats and rx_RetrievePeerRPCStats
8806 * IN stats - stats previously returned by rx_RetrieveProcessRPCStats or
8807 * rx_RetrievePeerRPCStats
8809 * IN allocSize - the number of bytes in stats.
8817 rx_FreeRPCStats(afs_uint32 * stats, size_t allocSize)
8819 rxi_Free(stats, allocSize);
8823 * rx_queryProcessRPCStats - see if process rpc stat collection is
8824 * currently enabled.
8830 * Returns 0 if stats are not enabled != 0 otherwise
8834 rx_queryProcessRPCStats(void)
8837 MUTEX_ENTER(&rx_rpc_stats);
8838 rc = rxi_monitor_processStats;
8839 MUTEX_EXIT(&rx_rpc_stats);
8844 * rx_queryPeerRPCStats - see if peer stat collection is currently enabled.
8850 * Returns 0 if stats are not enabled != 0 otherwise
8854 rx_queryPeerRPCStats(void)
8857 MUTEX_ENTER(&rx_rpc_stats);
8858 rc = rxi_monitor_peerStats;
8859 MUTEX_EXIT(&rx_rpc_stats);
8864 * rx_enableProcessRPCStats - begin rpc stat collection for entire process
8874 rx_enableProcessRPCStats(void)
8876 MUTEX_ENTER(&rx_rpc_stats);
8877 rx_enable_stats = 1;
8878 rxi_monitor_processStats = 1;
8879 MUTEX_EXIT(&rx_rpc_stats);
8883 * rx_enablePeerRPCStats - begin rpc stat collection per peer structure
8893 rx_enablePeerRPCStats(void)
8895 MUTEX_ENTER(&rx_rpc_stats);
8896 rx_enable_stats = 1;
8897 rxi_monitor_peerStats = 1;
8898 MUTEX_EXIT(&rx_rpc_stats);
8902 * rx_disableProcessRPCStats - stop rpc stat collection for entire process
8912 rx_disableProcessRPCStats(void)
8914 struct opr_queue *cursor, *store;
8917 MUTEX_ENTER(&rx_rpc_stats);
8920 * Turn off process statistics and if peer stats is also off, turn
8924 rxi_monitor_processStats = 0;
8925 if (rxi_monitor_peerStats == 0) {
8926 rx_enable_stats = 0;
8929 for (opr_queue_ScanSafe(&processStats, cursor, store)) {
8930 unsigned int num_funcs = 0;
8931 struct rx_interface_stat *rpc_stat
8932 = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8934 opr_queue_Remove(&rpc_stat->entry);
8936 num_funcs = rpc_stat->stats[0].func_total;
8938 sizeof(rx_interface_stat_t) +
8939 rpc_stat->stats[0].func_total * sizeof(rx_function_entry_v1_t);
8941 rxi_Free(rpc_stat, space);
8942 rxi_rpc_process_stat_cnt -= num_funcs;
8944 MUTEX_EXIT(&rx_rpc_stats);
8948 * rx_disablePeerRPCStats - stop rpc stat collection for peers
8958 rx_disablePeerRPCStats(void)
8960 struct rx_peer **peer_ptr, **peer_end;
8964 * Turn off peer statistics and if process stats is also off, turn
8968 rxi_monitor_peerStats = 0;
8969 if (rxi_monitor_processStats == 0) {
8970 rx_enable_stats = 0;
8973 for (peer_ptr = &rx_peerHashTable[0], peer_end =
8974 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
8976 struct rx_peer *peer, *next, *prev;
8978 MUTEX_ENTER(&rx_peerHashTable_lock);
8979 MUTEX_ENTER(&rx_rpc_stats);
8980 for (prev = peer = *peer_ptr; peer; peer = next) {
8982 code = MUTEX_TRYENTER(&peer->peer_lock);
8985 struct opr_queue *cursor, *store;
8987 if (prev == *peer_ptr) {
8998 MUTEX_EXIT(&rx_peerHashTable_lock);
9000 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
9001 unsigned int num_funcs = 0;
9002 struct rx_interface_stat *rpc_stat
9003 = opr_queue_Entry(cursor, struct rx_interface_stat,
9006 opr_queue_Remove(&rpc_stat->entry);
9007 opr_queue_Remove(&rpc_stat->entryPeers);
9008 num_funcs = rpc_stat->stats[0].func_total;
9010 sizeof(rx_interface_stat_t) +
9011 rpc_stat->stats[0].func_total *
9012 sizeof(rx_function_entry_v1_t);
9014 rxi_Free(rpc_stat, space);
9015 rxi_rpc_peer_stat_cnt -= num_funcs;
9017 MUTEX_EXIT(&peer->peer_lock);
9019 MUTEX_ENTER(&rx_peerHashTable_lock);
9029 MUTEX_EXIT(&rx_rpc_stats);
9030 MUTEX_EXIT(&rx_peerHashTable_lock);
9035 * rx_clearProcessRPCStats - clear the contents of the rpc stats according
9040 * IN clearFlag - flag indicating which stats to clear
9048 rx_clearProcessRPCStats(afs_uint32 clearFlag)
9050 struct opr_queue *cursor;
9052 MUTEX_ENTER(&rx_rpc_stats);
9054 for (opr_queue_Scan(&processStats, cursor)) {
9055 unsigned int num_funcs = 0, i;
9056 struct rx_interface_stat *rpc_stat
9057 = opr_queue_Entry(rpc_stat, struct rx_interface_stat, entry);
9059 num_funcs = rpc_stat->stats[0].func_total;
9060 for (i = 0; i < num_funcs; i++) {
9061 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
9062 rpc_stat->stats[i].invocations = 0;
9064 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
9065 rpc_stat->stats[i].bytes_sent = 0;
9067 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
9068 rpc_stat->stats[i].bytes_rcvd = 0;
9070 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9071 rpc_stat->stats[i].queue_time_sum.sec = 0;
9072 rpc_stat->stats[i].queue_time_sum.usec = 0;
9074 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9075 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9076 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9078 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9079 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9080 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9082 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9083 rpc_stat->stats[i].queue_time_max.sec = 0;
9084 rpc_stat->stats[i].queue_time_max.usec = 0;
9086 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9087 rpc_stat->stats[i].execution_time_sum.sec = 0;
9088 rpc_stat->stats[i].execution_time_sum.usec = 0;
9090 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9091 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9092 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9094 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9095 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9096 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9098 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9099 rpc_stat->stats[i].execution_time_max.sec = 0;
9100 rpc_stat->stats[i].execution_time_max.usec = 0;
9105 MUTEX_EXIT(&rx_rpc_stats);
9109 * rx_clearPeerRPCStats - clear the contents of the rpc stats according
9114 * IN clearFlag - flag indicating which stats to clear
9122 rx_clearPeerRPCStats(afs_uint32 clearFlag)
9124 struct opr_queue *cursor;
9126 MUTEX_ENTER(&rx_rpc_stats);
9128 for (opr_queue_Scan(&peerStats, cursor)) {
9129 unsigned int num_funcs, i;
9130 struct rx_interface_stat *rpc_stat
9131 = opr_queue_Entry(cursor, struct rx_interface_stat, entryPeers);
9133 num_funcs = rpc_stat->stats[0].func_total;
9134 for (i = 0; i < num_funcs; i++) {
9135 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
9136 rpc_stat->stats[i].invocations = 0;
9138 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
9139 rpc_stat->stats[i].bytes_sent = 0;
9141 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
9142 rpc_stat->stats[i].bytes_rcvd = 0;
9144 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9145 rpc_stat->stats[i].queue_time_sum.sec = 0;
9146 rpc_stat->stats[i].queue_time_sum.usec = 0;
9148 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9149 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9150 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9152 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9153 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9154 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9156 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9157 rpc_stat->stats[i].queue_time_max.sec = 0;
9158 rpc_stat->stats[i].queue_time_max.usec = 0;
9160 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9161 rpc_stat->stats[i].execution_time_sum.sec = 0;
9162 rpc_stat->stats[i].execution_time_sum.usec = 0;
9164 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9165 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9166 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9168 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9169 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9170 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9172 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9173 rpc_stat->stats[i].execution_time_max.sec = 0;
9174 rpc_stat->stats[i].execution_time_max.usec = 0;
9179 MUTEX_EXIT(&rx_rpc_stats);
9183 * rxi_rxstat_userok points to a routine that returns 1 if the caller
9184 * is authorized to enable/disable/clear RX statistics.
9186 static int (*rxi_rxstat_userok) (struct rx_call * call) = NULL;
9189 rx_SetRxStatUserOk(int (*proc) (struct rx_call * call))
9191 rxi_rxstat_userok = proc;
9195 rx_RxStatUserOk(struct rx_call *call)
9197 if (!rxi_rxstat_userok)
9199 return rxi_rxstat_userok(call);
9204 * DllMain() -- Entry-point function called by the DllMainCRTStartup()
9205 * function in the MSVC runtime DLL (msvcrt.dll).
9207 * Note: the system serializes calls to this function.
9210 DllMain(HINSTANCE dllInstHandle, /* instance handle for this DLL module */
9211 DWORD reason, /* reason function is being called */
9212 LPVOID reserved) /* reserved for future use */
9215 case DLL_PROCESS_ATTACH:
9216 /* library is being attached to a process */
9220 case DLL_PROCESS_DETACH:
9227 #endif /* AFS_NT40_ENV */
9230 int rx_DumpCalls(FILE *outputFile, char *cookie)
9232 #ifdef RXDEBUG_PACKET
9233 #ifdef KDUMP_RX_LOCK
9234 struct rx_call_rx_lock *c;
9241 #define RXDPRINTF sprintf
9242 #define RXDPRINTOUT output
9244 #define RXDPRINTF fprintf
9245 #define RXDPRINTOUT outputFile
9248 RXDPRINTF(RXDPRINTOUT, "%s - Start dumping all Rx Calls - count=%u\r\n", cookie, rx_stats.nCallStructs);
9250 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9253 for (c = rx_allCallsp; c; c = c->allNextp) {
9254 u_short rqc, tqc, iovqc;
9256 MUTEX_ENTER(&c->lock);
9257 rqc = opr_queue_Count(&c->rq);
9258 tqc = opr_queue_Count(&c->tq);
9259 iovqc = opr_queue_Count(&c->app.iovq);
9261 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, "
9262 "rqc=%u,%u, tqc=%u,%u, iovqc=%u,%u, "
9263 "lstatus=%u, rstatus=%u, error=%d, timeout=%u, "
9264 "resendEvent=%d, timeoutEvt=%d, keepAliveEvt=%d, delayedAckEvt=%d, delayedAbortEvt=%d, abortCode=%d, abortCount=%d, "
9265 "lastSendTime=%u, lastRecvTime=%u, lastSendData=%u"
9266 #ifdef RX_ENABLE_LOCKS
9269 #ifdef RX_REFCOUNT_CHECK
9270 ", refCountBegin=%u, refCountResend=%u, refCountDelay=%u, "
9271 "refCountAlive=%u, refCountPacket=%u, refCountSend=%u, refCountAckAll=%u, refCountAbort=%u"
9274 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,
9275 c->callNumber?*c->callNumber:0, c->conn?c->conn->flags:0, c->flags,
9276 (afs_uint32)c->rqc, (afs_uint32)rqc, (afs_uint32)c->tqc, (afs_uint32)tqc, (afs_uint32)c->iovqc, (afs_uint32)iovqc,
9277 (afs_uint32)c->localStatus, (afs_uint32)c->remoteStatus, c->error, c->timeout,
9278 c->resendEvent?1:0, c->timeoutEvent?1:0, c->keepAliveEvent?1:0, c->delayedAckEvent?1:0, c->delayedAbortEvent?1:0,
9279 c->abortCode, c->abortCount, c->lastSendTime, c->lastReceiveTime, c->lastSendData
9280 #ifdef RX_ENABLE_LOCKS
9281 , (afs_uint32)c->refCount
9283 #ifdef RX_REFCOUNT_CHECK
9284 , c->refCDebug[0],c->refCDebug[1],c->refCDebug[2],c->refCDebug[3],c->refCDebug[4],c->refCDebug[5],c->refCDebug[6],c->refCDebug[7]
9287 MUTEX_EXIT(&c->lock);
9290 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9293 RXDPRINTF(RXDPRINTOUT, "%s - End dumping all Rx Calls\r\n", cookie);
9295 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9297 #endif /* RXDEBUG_PACKET */