bsd/netat/atp_alloc.c

   1 /*
   2  * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_OSREFERENCE_HEADER_START@
   5  *
   6  * This file contains Original Code and/or Modifications of Original Code
   7  * as defined in and that are subject to the Apple Public Source License
   8  * Version 2.0 (the 'License'). You may not use this file except in
   9  * compliance with the License.  The rights granted to you under the
  10  * License may not be used to create, or enable the creation or
  11  * redistribution of, unlawful or unlicensed copies of an Apple operating
  12  * system, or to circumvent, violate, or enable the circumvention or
  13  * violation of, any terms of an Apple operating system software license
  14  * agreement.
  15  *
  16  * Please obtain a copy of the License at
  17  * http://www.opensource.apple.com/apsl/ and read it before using this
  18  * file.
  19  *
  20  * The Original Code and all software distributed under the License are
  21  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  22  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  23  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  24  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  25  * Please see the License for the specific language governing rights and
  26  * limitations under the License.
  27  *
  28  * @APPLE_LICENSE_OSREFERENCE_HEADER_END@
  29  */
  30 /*    Modified for MP, 1996 by Tuyen Nguyen */
  31 /*
  32  *      tcb (transaction) allocation routine. If no transaction data structure
  33  *              is available then put the module on a queue of modules waiting
  34  *              for transaction structures. When a tcb is available it will be
  35  *              removed from this list and its write queue will be scheduled.
  36  *      Version 1.4 of atp_alloc.c on 89/02/09 17:53:01
  37  *   Modified, March 17, 1997 by Tuyen Nguyen for MacOSX.
  38  */
  39 #include <sys/errno.h>
  40 #include <sys/types.h>
  41 #include <sys/param.h>
  42 #include <machine/spl.h>
  43 #include <sys/systm.h>
  44 #include <sys/kernel.h>
  45 #include <sys/proc.h>
  46 #include <sys/filedesc.h>
  47 #include <sys/fcntl.h>
  48 #include <sys/mbuf.h>
  49 #include <sys/socket.h>
  50
  51 #include <netat/sysglue.h>
  52 #include <netat/appletalk.h>
  53 #include <netat/ddp.h>
  54 #include <netat/debug.h>
  55 #include <netat/at_pcb.h>
  56 #include <netat/atp.h>
  57
  58 /*### MacOSX MCLBYTE is 2048, not 4096 like AIX */
  59 #define TRPS_PER_BLK 16
  60
  61 gbuf_t *atp_resource_m = 0;
  62 extern caddr_t atp_free_cluster_list;
  63 extern void atp_delete_free_clusters();
  64
  65 struct atp_trans *atp_trans_alloc(atp)
  66 struct  atp_state *atp;
  67 {
  68         int i;
  69         gbuf_t *m;
  70         register struct atp_trans *trp, *trp_array;
  71
  72         if (atp_trans_free_list == 0) {
  73                 if ((m = gbuf_alloc(TRPS_PER_BLK*sizeof(struct atp_trans),PRI_HI)) == 0)
  74                         return (struct atp_trans *)0;
  75                 bzero(gbuf_rptr(m), TRPS_PER_BLK*sizeof(struct atp_trans));
  76                 trp_array = (struct atp_trans *)gbuf_rptr(m);
  77                 for (i=0; i < TRPS_PER_BLK-1; i++)
  78                         trp_array[i].tr_list.next = (struct atp_trans *)&trp_array[i+1];
  79                 gbuf_cont(m) = atp_resource_m;
  80                 atp_resource_m = m;
  81                 trp_array[i].tr_list.next = atp_trans_free_list;
  82                 atp_trans_free_list = (struct atp_trans *)&trp_array[0];
  83         }
  84
  85         trp = atp_trans_free_list;
  86         atp_trans_free_list = trp->tr_list.next;
  87         trp->tr_queue = atp;
  88         trp->tr_state = TRANS_TIMEOUT;
  89         trp->tr_local_node = 0;
  90         ATEVENTINIT(trp->tr_event);
  91
  92         dPrintf(D_M_ATP_LOW, D_L_TRACE,
  93                 ("atp_trans_alloc(0x%x): alloc'd trp 0x%x\n",
  94                  (u_int) atp, (u_int) trp));
  95         return trp;
  96 } /* atp_trans_alloc */
  97
  98 /*
  99  *      tcb free routine - if modules are waiting schedule them
 100  *      always called at 'lock'
 101  */
 102
 103 void atp_trans_free(trp)
 104 register struct atp_trans *trp;
 105 {
 106
 107         trp->tr_queue = 0;
 108         trp->tr_list.next = atp_trans_free_list;
 109         atp_trans_free_list = trp;
 110 }
 111
 112 /*
 113  *      This routine allocates a rcb, if none are available it makes sure the
 114  *              the write service routine will be called when one is
 115  *      always called at 'lock'
 116  */
 117
 118 struct atp_rcb *atp_rcb_alloc(atp)
 119 struct  atp_state *atp;
 120 {
 121         register struct atp_rcb *rcbp;
 122
 123         if ((rcbp = atp_rcb_free_list) != NULL) {
 124                 atp_rcb_free_list = rcbp->rc_list.next;
 125                 rcbp->rc_queue = atp;
 126                 rcbp->rc_pktcnt = 0;
 127                 rcbp->rc_local_node = 0;
 128         }
 129         dPrintf(D_M_ATP_LOW, D_L_TRACE,
 130                 ("atp_rcb_alloc: allocated rcbp 0x%x\n", (u_int) rcbp));
 131         return(rcbp);
 132 }
 133
 134 /*
 135  *      Here we free rcbs, if required reschedule other people waiting for them
 136  *      always called at 'lock'
 137  */
 138
 139 void atp_rcb_free(rcbp)
 140 register struct atp_rcb *rcbp;
 141 {
 142         register struct atp_state *atp;
 143         register int i;
 144         register int rc_state;
 145
 146         dPrintf(D_M_ATP_LOW, D_L_TRACE,
 147                 ("atp_rcb_free: freeing rcbp 0x%x\n", (u_int) rcbp));
 148         atp = rcbp->rc_queue;
 149         if ((rc_state = rcbp->rc_state) == -1) {
 150                 dPrintf(D_M_ATP, D_L_WARNING,
 151                         ("atp_rcb_free(%d): tid=%d,loc=%d,rem=%d\n",
 152                         0, rcbp->rc_tid,
 153                         rcbp->rc_socket.socket, atp->atp_socket_no));
 154                 return;
 155         }
 156         rcbp->rc_state = -1;
 157         rcbp->rc_xo = 0;
 158         rcbp->rc_queue = 0;
 159
 160         if (rcbp->rc_timestamp) {
 161                 extern struct atp_rcb_qhead atp_need_rel;
 162
 163                 rcbp->rc_timestamp = 0;
 164                 ATP_Q_REMOVE(atp_need_rel, rcbp, rc_tlist);
 165                 rcbp->rc_tlist.prev = NULL;
 166                 rcbp->rc_tlist.next = NULL;
 167         }
 168
 169         if (rcbp->rc_xmt) {
 170                 gbuf_freem(rcbp->rc_xmt); /* *** bad free is the second mbuf in this chain *** */
 171                 rcbp->rc_xmt = NULL;
 172                 for (i=0; i < rcbp->rc_pktcnt; i++)
 173                         rcbp->rc_snd[i] = 0;
 174         }
 175         if (atp_free_cluster_list)
 176                 atp_delete_free_clusters();
 177         if (rc_state != RCB_UNQUEUED) {
 178                 if (rc_state == RCB_PENDING) {
 179                         ATP_Q_REMOVE(atp->atp_attached, rcbp, rc_list);
 180                 } else {
 181                         ATP_Q_REMOVE(atp->atp_rcb, rcbp, rc_list);
 182                 }
 183         }
 184         if (rcbp->rc_ioctl) {
 185                 gbuf_freem(rcbp->rc_ioctl);
 186                 rcbp->rc_ioctl = NULL;
 187         }
 188         rcbp->rc_list.next = atp_rcb_free_list;
 189         atp_rcb_free_list = rcbp;
 190 }