[apple/xnu.git] / bsd / netat / atp_alloc.c

/*
 * 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;
}
Commit	Line	Data
1c79356b	1	/*
2d21ac55	2	* Copyright (c) 2000-2006 Apple Computer, Inc. All rights reserved.
5d5c5d0d	3	*
2d21ac55	4	* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
1c79356b	5	*
2d21ac55 A	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 License
	10	* may not be used to create, or enable the creation or redistribution of,
	11	* unlawful or unlicensed copies of an Apple operating system, or to
	12	* circumvent, violate, or enable the circumvention or violation of, any
	13	* terms of an Apple operating system software license agreement.
8f6c56a5	14	*
2d21ac55 A	15	* Please obtain a copy of the License at
	16	* http://www.opensource.apple.com/apsl/ and read it before using this file.
	17	*
	18	* The Original Code and all software distributed under the License are
	19	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
8f6c56a5 A	20	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
8f6c56a5 A	21	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
2d21ac55 A	22	* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
	23	* Please see the License for the specific language governing rights and
	24	* limitations under the License.
8f6c56a5	25	*
2d21ac55	26	* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
1c79356b A	27	*/
	28	/* Modified for MP, 1996 by Tuyen Nguyen */
	29	/*
	30	* tcb (transaction) allocation routine. If no transaction data structure
	31	* is available then put the module on a queue of modules waiting
	32	* for transaction structures. When a tcb is available it will be
	33	* removed from this list and its write queue will be scheduled.
	34	* Version 1.4 of atp_alloc.c on 89/02/09 17:53:01
	35	* Modified, March 17, 1997 by Tuyen Nguyen for MacOSX.
	36	*/
	37	#include <sys/errno.h>
	38	#include <sys/types.h>
	39	#include <sys/param.h>
	40	#include <machine/spl.h>
	41	#include <sys/systm.h>
	42	#include <sys/kernel.h>
	43	#include <sys/proc.h>
	44	#include <sys/filedesc.h>
	45	#include <sys/fcntl.h>
	46	#include <sys/mbuf.h>
	47	#include <sys/socket.h>
	48
	49	#include <netat/sysglue.h>
	50	#include <netat/appletalk.h>
	51	#include <netat/ddp.h>
	52	#include <netat/debug.h>
	53	#include <netat/at_pcb.h>
	54	#include <netat/atp.h>
	55
	56	/### MacOSX MCLBYTE is 2048, not 4096 like AIX /
	57	#define TRPS_PER_BLK 16
	58
	59	gbuf_t *atp_resource_m = 0;
0b4e3aa0	60	extern caddr_t atp_free_cluster_list;
2d21ac55 A	61	extern struct atp_rcb_qhead atp_need_rel;
2d21ac55 A	62
1c79356b A	63
	64	struct atp_trans *atp_trans_alloc(atp)
	65	struct atp_state *atp;
	66	{
1c79356b A	67	int i;
	68	gbuf_t *m;
	69	register struct atp_trans trp, trp_array;
	70
1c79356b	71	if (atp_trans_free_list == 0) {
2d21ac55 A	72	if ((m = gbuf_alloc_wait(TRPS_PER_BLK*sizeof(struct atp_trans),
2d21ac55 A	73	atp == NULL)) == 0)
1c79356b A	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];
1c79356b A	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;
1c79356b A	87	trp->tr_queue = atp;
	88	trp->tr_state = TRANS_TIMEOUT;
	89	trp->tr_local_node = 0;
1c79356b A	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	{
1c79356b	106
1c79356b A	107	trp->tr_queue = 0;
	108	trp->tr_list.next = atp_trans_free_list;
	109	atp_trans_free_list = trp;
1c79356b A	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;
1c79356b	122
1c79356b A	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	}
1c79356b A	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;
1c79356b A	145
	146	dPrintf(D_M_ATP_LOW, D_L_TRACE,
	147	("atp_rcb_free: freeing rcbp 0x%x\n", (u_int) rcbp));
1c79356b A	148	atp = rcbp->rc_queue;
1c79356b A	149	if ((rc_state = rcbp->rc_state) == -1) {
1c79356b A	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) {
1c79356b A	161	rcbp->rc_timestamp = 0;
	162	ATP_Q_REMOVE(atp_need_rel, rcbp, rc_tlist);
	163	rcbp->rc_tlist.prev = NULL;
	164	rcbp->rc_tlist.next = NULL;
	165	}
	166
	167	if (rcbp->rc_xmt) {
	168	gbuf_freem(rcbp->rc_xmt); /* * bad free is the second mbuf in this chain * */
	169	rcbp->rc_xmt = NULL;
	170	for (i=0; i < rcbp->rc_pktcnt; i++)
	171	rcbp->rc_snd[i] = 0;
	172	}
0b4e3aa0	173	if (atp_free_cluster_list)
2d21ac55	174	atp_delete_free_clusters(NULL);
1c79356b A	175	if (rc_state != RCB_UNQUEUED) {
	176	if (rc_state == RCB_PENDING) {
	177	ATP_Q_REMOVE(atp->atp_attached, rcbp, rc_list);
	178	} else {
	179	ATP_Q_REMOVE(atp->atp_rcb, rcbp, rc_list);
	180	}
	181	}
	182	if (rcbp->rc_ioctl) {
	183	gbuf_freem(rcbp->rc_ioctl);
	184	rcbp->rc_ioctl = NULL;
	185	}
	186	rcbp->rc_list.next = atp_rcb_free_list;
	187	atp_rcb_free_list = rcbp;
1c79356b	188	}