File: [local] / sys / xfs / xfs_queue.h (download)
Revision 1.1.1.1 (vendor branch), Tue Mar 4 16:04:30 2008 UTC (16 years, 3 months ago) by nbrk
Branch: OPENBSD_4_2_BASE, MAIN
CVS Tags: jornada-partial-support-wip, HEAD Changes since 1.1: +0 -0 lines
Import of OpenBSD 4.2 release kernel tree with initial code to support
Jornada 720/728, StrongARM 1110-based handheld PC.
At this point kernel roots on NFS and boots into vfs_mountroot() and traps.
What is supported:
- glass console, Jornada framebuffer (jfb) works in 16bpp direct color mode
(needs some palette tweaks for non black/white/blue colors, i think)
- saic, SA11x0 interrupt controller (needs cleanup)
- sacom, SA11x0 UART (supported only as boot console for now)
- SA11x0 GPIO controller fully supported (but can't handle multiple interrupt
handlers on one gpio pin)
- sassp, SSP port on SA11x0 that attaches spibus
- Jornada microcontroller (jmcu) to control kbd, battery, etc throught
the SPI bus (wskbd attaches on jmcu, but not tested)
- tod functions seem work
- initial code for SA-1111 (chip companion) : this is TODO
Next important steps, i think:
- gpio and intc on sa1111
- pcmcia support for sa11x0 (and sa1111 help logic)
- REAL root on nfs when we have PCMCIA support (we may use any of supported pccard NICs)
- root on wd0! (using already supported PCMCIA-ATA)
|
/*
* Copyright (c) 2002, Stockholms Universitet
* (Stockholm University, Stockholm Sweden)
* 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. Neither the name of the university nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR CONTRIBUTORS 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.
*/
/* $arla: xfs_queue.h,v 1.1 2002/11/28 06:24:23 lha Exp $ */
/* Inspirered by the queue macros in BSD. */
#ifndef NNPFS_QUEUE_H
#define NNPFS_QUEUE_H 1
/* Define a head. */
#define NNPQUEUE_HEAD(name, type) \
struct name { \
struct type *nnpq_first; \
struct type **nnpq_last; \
}
/* Defining a entry. */
#define NNPQUEUE_ENTRY(type) \
struct { \
struct type *nnpq_next, **nnpq_prev; \
}
/* Is the queue empty. */
#define NNPQUEUE_EMPTY(head) \
((head)->nnpq_first == NULL)
/* Init head. */
#define NNPQUEUE_INIT(head) do { \
(head)->nnpq_first = NULL; \
(head)->nnpq_last = &(head)->nnpq_first; \
} while (0)
/* Insert elm after listelm, field is named. */
#define NNPQUEUE_INSERT_HEAD(head, elm, field) do { \
if (((elm)->field.nnpq_next = (head)->nnpq_first) != NULL) \
(head)->nnpq_first->field.nnpq_prev = \
&(elm)->field.nnpq_next; \
else \
(head)->nnpq_last = &(elm)->field.nnpq_next; \
(head)->nnpq_first = (elm); \
(elm)->field.nnpq_prev = &(head)->nnpq_first; \
} while (0)
/* Remove an entry. */
#define NNPQUEUE_REMOVE(elm,head,field) do { \
if (((elm)->field.nnpq_next) != NULL) \
(elm)->field.nnpq_next->field.nnpq_prev = \
(elm)->field.nnpq_prev; \
else \
(head)->nnpq_last = (elm)->field.nnpq_prev; \
*(elm)->field.nnpq_prev = (elm)->field.nnpq_next; \
} while(0)
/* Iterate over the list. */
#define NNPQUEUE_FOREACH(var,head,field) \
for ((var) = ((head)->nnpq_first); \
(var); \
(var) = ((var)->field.nnpq_next))
#endif /* NNPFS_QUEUE_H */