dtvar.h revision 1.1.2.1 1 1.1.2.1 ad /* $NetBSD: dtvar.h,v 1.1.2.1 2002/03/15 14:22:51 ad Exp $ */
2 1.1.2.1 ad
3 1.1.2.1 ad /*-
4 1.1.2.1 ad * Copyright (c) 2002 The NetBSD Foundation, Inc.
5 1.1.2.1 ad * All rights reserved.
6 1.1.2.1 ad *
7 1.1.2.1 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.1.2.1 ad * by Andrew Doran.
9 1.1.2.1 ad *
10 1.1.2.1 ad * Redistribution and use in source and binary forms, with or without
11 1.1.2.1 ad * modification, are permitted provided that the following conditions
12 1.1.2.1 ad * are met:
13 1.1.2.1 ad * 1. Redistributions of source code must retain the above copyright
14 1.1.2.1 ad * notice, this list of conditions and the following disclaimer.
15 1.1.2.1 ad * 2. Redistributions in binary form must reproduce the above copyright
16 1.1.2.1 ad * notice, this list of conditions and the following disclaimer in the
17 1.1.2.1 ad * documentation and/or other materials provided with the distribution.
18 1.1.2.1 ad * 3. All advertising materials mentioning features or use of this software
19 1.1.2.1 ad * must display the following acknowledgement:
20 1.1.2.1 ad * This product includes software developed by the NetBSD
21 1.1.2.1 ad * Foundation, Inc. and its contributors.
22 1.1.2.1 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1.2.1 ad * contributors may be used to endorse or promote products derived
24 1.1.2.1 ad * from this software without specific prior written permission.
25 1.1.2.1 ad *
26 1.1.2.1 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1.2.1 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1.2.1 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1.2.1 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1.2.1 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1.2.1 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1.2.1 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1.2.1 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1.2.1 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1.2.1 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1.2.1 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.1.2.1 ad */
38 1.1.2.1 ad
39 1.1.2.1 ad #ifndef _DTVAR_H_
40 1.1.2.1 ad #define _DTVAR_H_
41 1.1.2.1 ad
42 1.1.2.1 ad #define DT_DEVICE_NO(a) (((a) - DT_ADDR_FIRST) >> 1)
43 1.1.2.1 ad
44 1.1.2.1 ad struct dt_msg {
45 1.1.2.1 ad u_int8_t dst;
46 1.1.2.1 ad u_int8_t src;
47 1.1.2.1 ad union {
48 1.1.2.1 ad struct {
49 1.1.2.1 ad u_int8_t len : 5, /* message byte len */
50 1.1.2.1 ad sub : 2, /* sub-address */
51 1.1.2.1 ad P : 1; /* Ctl(1)/Data(0) marker */
52 1.1.2.1 ad } val;
53 1.1.2.1 ad u_int8_t bits; /* quick check */
54 1.1.2.1 ad } code;
55 1.1.2.1 ad
56 1.1.2.1 ad /* varzise, checksum byte at end */
57 1.1.2.1 ad u_int8_t body[DT_MAX_MSG_SIZE-3];
58 1.1.2.1 ad
59 1.1.2.1 ad union {
60 1.1.2.1 ad SLIST_ENTRY(dt_msg) slist;
61 1.1.2.1 ad SIMPLEQ_ENTRY(dt_msg) simpleq;
62 1.1.2.1 ad } chain;
63 1.1.2.1 ad };
64 1.1.2.1 ad
65 1.1.2.1 ad struct dt_device {
66 1.1.2.1 ad struct device *dtdv_dv;
67 1.1.2.1 ad void *dtdv_sih;
68 1.1.2.1 ad SIMPLEQ_HEAD(, dt_msg) dtdv_queue;
69 1.1.2.1 ad };
70 1.1.2.1 ad
71 1.1.2.1 ad struct dt_state {
72 1.1.2.1 ad volatile u_int *ds_data;
73 1.1.2.1 ad volatile u_int *ds_poll;
74 1.1.2.1 ad int ds_bad_pkts;
75 1.1.2.1 ad int ds_state;
76 1.1.2.1 ad int ds_escaped;
77 1.1.2.1 ad int ds_len;
78 1.1.2.1 ad int ds_ptr;
79 1.1.2.1 ad };
80 1.1.2.1 ad
81 1.1.2.1 ad struct dt_softc {
82 1.1.2.1 ad struct device sc_dv;
83 1.1.2.1 ad struct dt_msg sc_msg;
84 1.1.2.1 ad SLIST_HEAD(, dt_msg) sc_free;
85 1.1.2.1 ad struct dt_device sc_dtdv[(DT_ADDR_DEFAULT - DT_ADDR_FIRST) >> 1];
86 1.1.2.1 ad };
87 1.1.2.1 ad
88 1.1.2.1 ad struct dt_attach_args {
89 1.1.2.1 ad int dta_addr;
90 1.1.2.1 ad };
91 1.1.2.1 ad
92 1.1.2.1 ad #define DT_GET_ERROR -1
93 1.1.2.1 ad #define DT_GET_DONE 0
94 1.1.2.1 ad #define DT_GET_NOTYET 1
95 1.1.2.1 ad
96 1.1.2.1 ad void dt_cninit(void);
97 1.1.2.1 ad int dt_identify(int, struct dt_ident *);
98 1.1.2.1 ad int dt_msg_get(struct dt_msg *, int);
99 1.1.2.1 ad int dt_establish_handler(struct dt_softc *, int, struct device *,
100 1.1.2.1 ad void (*)(void *));
101 1.1.2.1 ad
102 1.1.2.1 ad static __inline__ struct dt_msg *dt_msg_dequeue(struct dt_device *);
103 1.1.2.1 ad static __inline__ void dt_msg_release(struct dt_softc *, struct dt_msg *);
104 1.1.2.1 ad
105 1.1.2.1 ad extern int dt_kbd_addr;
106 1.1.2.1 ad extern struct dt_state dt_state;
107 1.1.2.1 ad
108 1.1.2.1 ad static __inline__ struct dt_msg *
109 1.1.2.1 ad dt_msg_dequeue(struct dt_device *dtdv)
110 1.1.2.1 ad {
111 1.1.2.1 ad struct dt_msg *msg;
112 1.1.2.1 ad int s;
113 1.1.2.1 ad
114 1.1.2.1 ad s = spltty();
115 1.1.2.1 ad msg = SIMPLEQ_FIRST(&dtdv->dtdv_queue);
116 1.1.2.1 ad if (msg != NULL)
117 1.1.2.1 ad SIMPLEQ_REMOVE_HEAD(&dtdv->dtdv_queue, msg, chain.simpleq);
118 1.1.2.1 ad splx(s);
119 1.1.2.1 ad return (msg);
120 1.1.2.1 ad }
121 1.1.2.1 ad
122 1.1.2.1 ad static __inline__ void
123 1.1.2.1 ad dt_msg_release(struct dt_softc *sc, struct dt_msg *msg)
124 1.1.2.1 ad {
125 1.1.2.1 ad int s;
126 1.1.2.1 ad
127 1.1.2.1 ad s = spltty();
128 1.1.2.1 ad SLIST_INSERT_HEAD(&sc->sc_free, msg, chain.slist);
129 1.1.2.1 ad splx(s);
130 1.1.2.1 ad }
131 1.1.2.1 ad
132 1.1.2.1 ad #endif /* !_DTVAR_H_ */
133