3 * ===================================
4 * HARP | Host ATM Research Platform
5 * ===================================
8 * This Host ATM Research Platform ("HARP") file (the "Software") is
9 * made available by Network Computing Services, Inc. ("NetworkCS")
10 * "AS IS". NetworkCS does not provide maintenance, improvements or
11 * support of any kind.
13 * NETWORKCS MAKES NO WARRANTIES OR REPRESENTATIONS, EXPRESS OR IMPLIED,
14 * INCLUDING, BUT NOT LIMITED TO, IMPLIED WARRANTIES OF MERCHANTABILITY
15 * AND FITNESS FOR A PARTICULAR PURPOSE, AS TO ANY ELEMENT OF THE
16 * SOFTWARE OR ANY SUPPORT PROVIDED IN CONNECTION WITH THIS SOFTWARE.
17 * In no event shall NetworkCS be responsible for any damages, including
18 * but not limited to consequential damages, arising from or relating to
19 * any use of the Software or related support.
21 * Copyright 1994-1998 Network Computing Services, Inc.
23 * Copies of this Software may be made, however, the above copyright
24 * notice must be reproduced on all copies.
26 * @(#) $FreeBSD: src/sys/netatm/atm_subr.c,v 1.7 2000/02/13 03:31:59 peter Exp $
27 * @(#) $DragonFly: src/sys/netproto/atm/atm_subr.c,v 1.16 2005/02/01 00:51:50 joerg Exp $
34 * Miscellaneous ATM subroutines
38 #include "kern_include.h"
40 #include <sys/thread2.h>
41 #include <sys/msgport2.h>
46 struct atm_pif *atm_interface_head = NULL;
47 struct atm_ncm *atm_netconv_head = NULL;
48 Atm_endpoint *atm_endpoints[ENDPT_MAX+1] = {NULL};
49 struct sp_info *atm_pool_head = NULL;
50 struct stackq_entry *atm_stackq_head = NULL, *atm_stackq_tail;
51 struct atm_sock_stat atm_sock_stat = { { 0 } };
54 int atm_dev_print = 0;
55 int atm_print_data = 0;
56 int atm_version = ATM_VERSION;
57 struct timeval atm_debugtime = {0, 0};
58 struct ifqueue atm_intrq;
60 struct sp_info atm_attributes_pool = {
61 "atm attributes pool", /* si_name */
62 sizeof(Atm_attributes), /* si_blksiz */
67 static struct callout atm_timexp_ch;
72 static void atm_compact (struct atm_time *);
73 static KTimeout_ret atm_timexp (void *);
74 static int atm_intr(struct netmsg *);
79 static struct atm_time *atm_timeq = NULL;
80 static struct atm_time atm_compactimer = {0, 0};
82 static struct sp_info atm_stackq_pool = {
83 "Service stack queue pool", /* si_name */
84 sizeof(struct stackq_entry), /* si_blksiz */
91 * Initialize ATM kernel
93 * Performs any initialization required before things really get underway.
94 * Called from ATM domain initialization or from first registration function
108 * Never called from interrupts, so no locking needed
114 atm_intrq.ifq_maxlen = ATM_INTRQ_MAX;
115 netisr_register(NETISR_ATM, cpu0_portfn, atm_intr);
118 * Initialize subsystems
125 callout_init(&atm_timexp_ch);
126 callout_reset(&atm_timexp_ch, hz / ATM_HZ, atm_timexp, NULL);
129 * Start the compaction timer
131 atm_timeout(&atm_compactimer, SPOOL_COMPACT, atm_compact);
136 * Allocate a Control Block
138 * Gets a new control block allocated from the specified storage pool,
139 * acquiring memory for new pool chunks if required. The returned control
140 * block's contents will be cleared.
143 * sip pointer to sp_info for storage pool
146 * addr pointer to allocated control block
147 * 0 allocation failed
155 struct sp_chunk *scp;
165 * Are there any free in the pool?
170 * Find first chunk with a free block
172 for (scp = sip->si_poolh; scp; scp = scp->sc_next) {
173 if (scp->sc_freeh != NULL)
180 * No free blocks - have to allocate a new
181 * chunk (but put a limit to this)
183 struct sp_link *slp_next;
187 * First time for this pool??
189 if (sip->si_chunksiz == 0) {
193 * Initialize pool information
195 n = sizeof(struct sp_chunk) +
197 (sip->si_blksiz + sizeof(struct sp_link));
198 sip->si_chunksiz = roundup(n, SPOOL_ROUNDUP);
201 * Place pool on kernel chain
203 LINK2TAIL(sip, struct sp_info, atm_pool_head, si_next);
206 if (sip->si_chunks >= sip->si_maxallow) {
212 scp = KM_ALLOC(sip->si_chunksiz, M_DEVBUF,
213 M_INTWAIT | M_NULLOK);
221 scp->sc_magic = SPOOL_MAGIC;
225 * Divy up chunk into free blocks
227 slp = (struct sp_link *)(scp + 1);
230 for (i = sip->si_blkcnt; i > 1; i--) {
231 slp_next = (struct sp_link *)((caddr_t)(slp + 1) +
233 slp->sl_u.slu_next = slp_next;
236 slp->sl_u.slu_next = NULL;
240 * Add new chunk to end of pool
243 sip->si_poolt->sc_next = scp;
249 sip->si_total += sip->si_blkcnt;
250 sip->si_free += sip->si_blkcnt;
251 if (sip->si_chunks > sip->si_maxused)
252 sip->si_maxused = sip->si_chunks;
256 * Allocate the first free block in chunk
259 scp->sc_freeh = slp->sl_u.slu_next;
265 * Save link back to pool chunk
267 slp->sl_u.slu_chunk = scp;
272 KM_ZERO(bp, sip->si_blksiz);
280 * Free a Control Block
282 * Returns a previously allocated control block back to the owners
286 * bp pointer to block to be freed
297 struct sp_chunk *scp;
302 * Get containing chunk and pool info
304 slp = (struct sp_link *)bp;
306 scp = slp->sl_u.slu_chunk;
307 if (scp->sc_magic != SPOOL_MAGIC)
308 panic("atm_free: chunk magic missing");
312 * Add block to free chain
315 scp->sc_freet->sl_u.slu_next = slp;
318 scp->sc_freeh = scp->sc_freet = slp;
319 slp->sl_u.slu_next = NULL;
329 * Storage Pool Compaction
331 * Called periodically in order to perform compaction of the
332 * storage pools. Each pool will be checked to see if any chunks
333 * can be freed, taking some care to avoid freeing too many chunks
334 * in order to avoid memory thrashing.
339 * tip pointer to timer control block (atm_compactimer)
347 struct atm_time *tip;
350 struct sp_chunk *scp;
352 struct sp_chunk *scp_prev;
355 * Check out all storage pools
357 for (sip = atm_pool_head; sip; sip = sip->si_next) {
360 * Always keep a minimum number of chunks around
362 if (sip->si_chunks <= SPOOL_MIN_CHUNK)
366 * Maximum chunks to free at one time will leave
367 * pool with at least 50% utilization, but never
368 * go below minimum chunk count.
370 i = ((sip->si_free * 2) - sip->si_total) / sip->si_blkcnt;
371 i = MIN(i, sip->si_chunks - SPOOL_MIN_CHUNK);
374 * Look for chunks to free
377 for (scp = sip->si_poolh; scp && i > 0; ) {
379 if (scp->sc_used == 0) {
382 * Found a chunk to free, so do it
385 scp_prev->sc_next = scp->sc_next;
386 if (sip->si_poolt == scp)
387 sip->si_poolt = scp_prev;
389 sip->si_poolh = scp->sc_next;
391 KM_FREE((caddr_t)scp, sip->si_chunksiz,
395 * Update pool controls
398 sip->si_total -= sip->si_blkcnt;
399 sip->si_free -= sip->si_blkcnt;
402 scp = scp_prev->sc_next;
413 * Restart the compaction timer
415 atm_timeout(&atm_compactimer, SPOOL_COMPACT, atm_compact);
422 * Release a Storage Pool
424 * Frees all dynamic storage acquired for a storage pool.
425 * This function is normally called just prior to a module's unloading.
428 * sip pointer to sp_info for storage pool
435 atm_release_pool(sip)
438 struct sp_chunk *scp, *scp_next;
442 * Free each chunk in pool
444 for (scp = sip->si_poolh; scp; scp = scp_next) {
447 * Check for memory leaks
450 panic("atm_release_pool: unfreed blocks");
452 scp_next = scp->sc_next;
454 KM_FREE((caddr_t)scp, sip->si_chunksiz, M_DEVBUF);
458 * Update pool controls
460 sip->si_poolh = NULL;
466 * Unlink pool from active chain
468 sip->si_chunksiz = 0;
469 UNLINK(sip, struct sp_info, atm_pool_head, si_next);
477 * Handle timer tick expiration
479 * Decrement tick count in first block on timer queue. If there
480 * are blocks with expired timers, call their timeout function.
481 * This function is called ATM_HZ times per second.
484 * arg argument passed on timeout() call
494 struct atm_time *tip;
499 * Decrement tick count
501 if (((tip = atm_timeq) == NULL) || (--tip->ti_ticks > 0)) {
506 * Stack queue should have been drained
509 if (atm_stackq_head != NULL)
510 panic("atm_timexp: stack queue not empty");
514 * Dispatch expired timers
516 while (((tip = atm_timeq) != NULL) && (tip->ti_ticks == 0)) {
517 void (*func)(struct atm_time *);
520 * Remove expired block from queue
522 atm_timeq = tip->ti_next;
523 tip->ti_flag &= ~TIF_QUEUED;
526 * Call timeout handler (with network interrupts locked out)
536 * Drain any deferred calls
546 callout_reset(&atm_timexp_ch, hz / ATM_HZ, atm_timexp, NULL);
551 * Schedule a control block timeout
553 * Place the supplied timer control block on the timer queue. The
554 * function (func) will be called in 't' timer ticks with the
555 * control block address as its only argument. There are ATM_HZ
556 * timer ticks per second. The ticks value stored in each block is
557 * a delta of the number of ticks from the previous block in the queue.
558 * Thus, for each tick interval, only the first block in the queue
559 * needs to have its tick value decremented.
562 * tip pointer to timer control block
563 * t number of timer ticks until expiration
564 * func pointer to function to call at expiration
571 atm_timeout(tip, t, func)
572 struct atm_time *tip;
574 void (*func)(struct atm_time *);
576 struct atm_time *tip1, *tip2;
581 * Check for double queueing error
583 if (tip->ti_flag & TIF_QUEUED)
584 panic("atm_timeout: double queueing");
587 * Make sure we delay at least a little bit
593 * Find out where we belong on the queue
596 for (tip1 = NULL, tip2 = atm_timeq; tip2 && (tip2->ti_ticks <= t);
597 tip1 = tip2, tip2 = tip1->ti_next) {
602 * Place ourselves on queue and update timer deltas
616 tip->ti_flag |= TIF_QUEUED;
628 * Remove the supplied timer control block from the timer queue.
631 * tip pointer to timer control block
634 * 0 control block successfully dequeued
635 * 1 control block not on timer queue
640 struct atm_time *tip;
642 struct atm_time *tip1, *tip2;
646 * Is control block queued?
648 if ((tip->ti_flag & TIF_QUEUED) == 0)
652 * Find control block on the queue
655 for (tip1 = NULL, tip2 = atm_timeq; tip2 && (tip2 != tip);
656 tip1 = tip2, tip2 = tip1->ti_next) {
665 * Remove block from queue and update timer deltas
671 tip1->ti_next = tip2;
674 tip2->ti_ticks += tip->ti_ticks;
679 tip->ti_flag &= ~TIF_QUEUED;
689 * Queues a stack call which must be deferred to the global stack queue.
690 * The call parameters are stored in entries which are allocated from the
691 * stack queue storage pool.
695 * func destination function
696 * token destination layer's token
697 * cvp pointer to connection vcc
698 * arg1 command argument
699 * arg2 command argument
703 * errno call not queued - reason indicated
707 atm_stack_enq(cmd, func, token, cvp, arg1, arg2)
709 void (*func)(int, void *, int, int);
715 struct stackq_entry *sqp;
719 * Get a new queue entry for this call
721 sqp = (struct stackq_entry *)atm_allocate(&atm_stackq_pool);
733 sqp->sq_token = token;
736 sqp->sq_connvc = cvp;
739 * Put new entry at end of queue
741 if (atm_stackq_head == NULL)
742 atm_stackq_head = sqp;
744 atm_stackq_tail->sq_next = sqp;
745 atm_stackq_tail = sqp;
753 * Drain the Stack Queue
755 * Dequeues and processes entries from the global stack queue.
767 struct stackq_entry *sqp, *qprev, *qnext;
772 * Loop thru entire queue until queue is empty
773 * (but panic rather loop forever)
778 for (sqp = atm_stackq_head; sqp; ) {
781 * Got an eligible entry, do STACK_CALL stuff
783 if (sqp->sq_cmd & STKCMD_UP) {
784 if (sqp->sq_connvc->cvc_downcnt) {
787 * Cant process now, skip it
795 * OK, dispatch the call
797 sqp->sq_connvc->cvc_upcnt++;
798 (*sqp->sq_func)(sqp->sq_cmd,
802 sqp->sq_connvc->cvc_upcnt--;
804 if (sqp->sq_connvc->cvc_upcnt) {
807 * Cant process now, skip it
815 * OK, dispatch the call
817 sqp->sq_connvc->cvc_downcnt++;
818 (*sqp->sq_func)(sqp->sq_cmd,
822 sqp->sq_connvc->cvc_downcnt--;
826 * Dequeue processed entry and free it
829 qnext = sqp->sq_next;
831 qprev->sq_next = qnext;
833 atm_stackq_head = qnext;
835 atm_stackq_tail = qprev;
836 atm_free((caddr_t)sqp);
842 * Make sure entire queue was drained
844 if (atm_stackq_head != NULL)
845 panic("atm_stack_drain: Queue not emptied");
852 * Process Interrupt Queue
854 * Processes entries on the ATM interrupt queue. This queue is used by
855 * device interface drivers in order to schedule events from the driver's
856 * lower (interrupt) half to the driver's stack services.
858 * The interrupt routines must store the stack processing function to call
859 * and a token (typically a driver/stack control block) at the front of the
860 * queued buffer. We assume that the function pointer and token values are
861 * both contained (and properly aligned) in the first buffer of the chain.
871 atm_intr(struct netmsg *msg)
873 struct mbuf *m = ((struct netmsg_packet *)msg)->nm_packet;
875 atm_intr_func_t func;
879 * Get function to call and token value
881 KB_DATASTART(m, cp, caddr_t);
882 func = *(atm_intr_func_t *)cp;
884 token = *(void **)cp;
885 KB_HEADADJ(m, -(sizeof(func) + sizeof(token)));
886 if (KB_LEN(m) == 0) {
888 KB_UNLINKHEAD(m, m1);
893 * Call processing function
898 * Drain any deferred calls
901 lwkt_replymsg(&msg->nm_lmsg, 0);
906 * Print a pdu buffer chain
909 * m pointer to pdu buffer chain
910 * msg pointer to message header string
917 atm_pdu_print(m, msg)
927 KB_DATASTART(m, cp, caddr_t);
928 printf("%cbfr=%p data=%p len=%d: ",
929 c, m, cp, KB_LEN(m));
931 if (atm_print_data) {
932 for (i = 0; i < KB_LEN(m); i++) {
933 printf("%2x ", (u_char)*cp++);
935 printf("<end_bfr>\n");