/* $NetBSD: isp_inline.h,v 1.9 2000/08/27 21:43:26 mjacob Exp $ */ /* * This driver, which is contained in NetBSD in the files: * * sys/dev/ic/isp.c * sys/dev/ic/ic/isp.c * sys/dev/ic/ic/isp_inline.h * sys/dev/ic/ic/isp_netbsd.c * sys/dev/ic/ic/isp_netbsd.h * sys/dev/ic/ic/isp_target.c * sys/dev/ic/ic/isp_target.h * sys/dev/ic/ic/isp_tpublic.h * sys/dev/ic/ic/ispmbox.h * sys/dev/ic/ic/ispreg.h * sys/dev/ic/ic/ispvar.h * sys/microcode/isp/asm_sbus.h * sys/microcode/isp/asm_1040.h * sys/microcode/isp/asm_1080.h * sys/microcode/isp/asm_12160.h * sys/microcode/isp/asm_2100.h * sys/microcode/isp/asm_2200.h * sys/pci/isp_pci.c * sys/sbus/isp_sbus.c * * Is being actively maintained by Matthew Jacob (mjacob@netbsd.org). * This driver also is shared source with FreeBSD, OpenBSD, Linux, Solaris, * Linux versions. This tends to be an interesting maintenance problem. * * Please coordinate with Matthew Jacob on changes you wish to make here. */ /* * Copyright (C) 1999 National Aeronautics & Space Administration * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /* * Qlogic HBA inline functions. * mjacob@nas.nasa.gov. */ #ifndef _ISP_INLINE_H #define _ISP_INLINE_H /* * Handle Functions. * For each outstanding command there will be a non-zero handle. * There will be at most isp_maxcmds handles, and isp_lasthdls * will be a seed for the last handled allocated. */ static INLINE int isp_save_xs __P((struct ispsoftc *, XS_T *, u_int32_t *)); static INLINE XS_T * isp_find_xs __P((struct ispsoftc *, u_int32_t)); static INLINE u_int32_t isp_find_handle __P((struct ispsoftc *, XS_T *)); static INLINE int isp_handle_index __P((u_int32_t)); static INLINE void isp_destroy_handle __P((struct ispsoftc *, u_int32_t)); static INLINE void isp_remove_handle __P((struct ispsoftc *, XS_T *)); static INLINE int isp_save_xs(isp, xs, handlep) struct ispsoftc *isp; XS_T *xs; u_int32_t *handlep; { int i, j; for (j = isp->isp_lasthdls, i = 0; i < (int) isp->isp_maxcmds; i++) { if (isp->isp_xflist[j] == NULL) { break; } if (++j == isp->isp_maxcmds) { j = 0; } } if (i == isp->isp_maxcmds) { return (-1); } isp->isp_xflist[j] = xs; *handlep = j+1; if (++j == isp->isp_maxcmds) j = 0; isp->isp_lasthdls = (u_int16_t)j; return (0); } static INLINE XS_T * isp_find_xs(isp, handle) struct ispsoftc *isp; u_int32_t handle; { if (handle < 1 || handle > (u_int32_t) isp->isp_maxcmds) { return (NULL); } else { return (isp->isp_xflist[handle - 1]); } } static INLINE u_int32_t isp_find_handle(isp, xs) struct ispsoftc *isp; XS_T *xs; { int i; if (xs != NULL) { for (i = 0; i < isp->isp_maxcmds; i++) { if (isp->isp_xflist[i] == xs) { return ((u_int32_t) i+1); } } } return (0); } static INLINE int isp_handle_index(handle) u_int32_t handle; { return (handle-1); } static INLINE void isp_destroy_handle(isp, handle) struct ispsoftc *isp; u_int32_t handle; { if (handle > 0 && handle <= (u_int32_t) isp->isp_maxcmds) { isp->isp_xflist[isp_handle_index(handle)] = NULL; } } static INLINE void isp_remove_handle(isp, xs) struct ispsoftc *isp; XS_T *xs; { isp_destroy_handle(isp, isp_find_handle(isp, xs)); } static INLINE int isp_getrqentry __P((struct ispsoftc *, u_int16_t *, u_int16_t *, void **)); static INLINE int isp_getrqentry(isp, iptrp, optrp, resultp) struct ispsoftc *isp; u_int16_t *iptrp; u_int16_t *optrp; void **resultp; { volatile u_int16_t iptr, optr; optr = isp->isp_reqodx = ISP_READ(isp, OUTMAILBOX4); iptr = isp->isp_reqidx; *resultp = ISP_QUEUE_ENTRY(isp->isp_rquest, iptr); iptr = ISP_NXT_QENTRY(iptr, RQUEST_QUEUE_LEN(isp)); if (iptr == optr) { return (1); } if (optrp) *optrp = optr; if (iptrp) *iptrp = iptr; return (0); } static INLINE void isp_print_qentry __P((struct ispsoftc *, char *, int, void *)); #define TBA (4 * (((QENTRY_LEN >> 2) * 3) + 1) + 1) static INLINE void isp_print_qentry(isp, msg, idx, arg) struct ispsoftc *isp; char *msg; int idx; void *arg; { char buf[TBA]; int amt, i, j; u_int8_t *ptr = arg; for (buf[0] = 0, amt = i = 0; i < 4; i++) { buf[0] = 0; for (j = 0; j < (QENTRY_LEN >> 2); j++) { SNPRINTF(buf, TBA, "%s %02x", buf, ptr[amt++] & 0xff); } STRNCAT(buf, "\n", TBA); } isp_prt(isp, ISP_LOGALL, "%s index %d:%s", msg, idx, buf); } static INLINE void isp_print_bytes __P((struct ispsoftc *, char *, int, void *)); static INLINE void isp_print_bytes(isp, msg, amt, arg) struct ispsoftc *isp; char *msg; int amt; void *arg; { char buf[128]; u_int8_t *ptr = arg; int off; if (msg) isp_prt(isp, ISP_LOGALL, "%s:", msg); off = 0; buf[0] = 0; while (off < amt) { int j, to; to = off; for (j = 0; j < 16; j++) { SNPRINTF(buf, 128, "%s %02x", buf, ptr[off++] & 0xff); if (off == amt) break; } isp_prt(isp, ISP_LOGALL, "0x%08x:%s", to, buf); buf[0] = 0; } } #endif /* _ISP_INLINE_H */