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