X-Git-Url: https://git.saurik.com/apple/xnu.git/blobdiff_plain/bd504ef0e0b883cdd7917b73b3574eb9ce669905..39236c6e673c41db228275375ab7fdb0f837b292:/bsd/netat/adsp_misc.c?ds=inline diff --git a/bsd/netat/adsp_misc.c b/bsd/netat/adsp_misc.c deleted file mode 100644 index f546b3160..000000000 --- a/bsd/netat/adsp_misc.c +++ /dev/null @@ -1,138 +0,0 @@ -/* - * Copyright (c) 2000 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@ - */ -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include -#include -#include -#include -#include -#include - -/* - * These function replace the Mk68 assembly routines found in qAddToEnd.s and - * q????.s - * Modified for MP, 1996 by Tuyen Nguyen - * Modified, April 9, 1997 by Tuyen Nguyen for MacOSX. - */ - - -/* ---------------------------------------------------------------------- - * void qAddToEnd(void *qhead, void *qelem) - * - * INPUTS: - * Ptr to ptr to 1st item in queue - * Ptr to item to add to end of queue - * OUTPUTS: - * none - * - * Assumptions: The link field is the FIRST field of the qelem structure. - * ---------------------------------------------------------------------- - */ -int qAddToEnd(qhead, qelem) - struct qlink **qhead; - struct qlink *qelem; -{ - /* define our own type to access the next field. NOTE THAT THE "NEXT" - * FIELD IS ASSUMED TO BE THE FIRST FIELD OF THE STRUCTURE - */ - - register struct qlink *q; - - /* Scan the linked list to the end and update the previous - * element next field. (do that protocted). - */ - - q = *qhead; - if (q) { - while (q->qlinkp) { - /* are we about to link to ourself */ - if (q == qelem) - goto breakit; - q = q->qlinkp; - } - q->qlinkp = qelem; - } - else { - *qhead = qelem; - } - qelem->qlinkp = (struct qlink *) 0; -breakit: -#ifdef NOTDEF - DPRINTF("%s: qhead=%x added elem=%x\n","qAddToEnd", qhead, qelem); -#endif - return 0; -} - - - -/* ---------------------------------------------------------------------- - * qfind_m - * void* qfind_m(void *qhead, void NPTR match, ProcPtr compare_fnx) - * - * Hunt down a linked list of queue elements calling the compare - * function on each item. When the compare function returns true, - * return ptr to the queue element. - * - * - * INPUTS: - * qhead Address of ptr to first item in queue - * match - * compare_fnx - * OUTPUTS: - * D0 & A0 Ptr to queue element or NIL - * REGISTERS: - * D0,D1,A0,A1 - * ---------------------------------------------------------------------- - */ -void* qfind_m(qhead, match, compare_fnx) - CCBPtr qhead; - void *match; - ProcPtr compare_fnx; -{ - CCBPtr queue_item = qhead; - - while (queue_item) { - if ((*compare_fnx)(queue_item,match)) - break; - - queue_item = queue_item->ccbLink; - } - - return (queue_item); -}