3241be7550
Cleaning up the code: - Declare many functions static - Change variable names to make them more self explanatory - Change usbd_request_handle -> usbd_xfer_handle - Syntactical changes - Remove some unused code - Other KNF changes Interrupt context handling - Change delay to usbd_delay_ms were possible (takes polling mode into account) - Change detection mechanism for interrupt context Add support for pre-allocation DMA-able memory by device driver Add preliminary support for isochronous to the UHCI driver (not for OHCI yet). usb.c, uhci.c, ohci.c - Initial attempt at detachable USB host controllers - Handle the use_polling flag with a lttle more care and only set it if we are cold booting. usb.c, uhci.c ohci.c, usbdi.c usbdi_util.c usb_subr.c - Make sure an aborted pipe is marked as not running. - Start queued request in the right order. - Insert some more DIAGNOSTIC sanity checks. - Remove (almost) unused definitions USBD_XFER_OUT and USBD_XFER_IN. usb.c, usb_subr.c - Add an event mechanism so that a userland process can watch devices come and go. ohci.c - Handle the case when a USB transfer is so long that it crosses two page (4K) boundaries. OHCI cannot do that with a single TD so we make a chain. ulpt.c - Use a bigger buffer when transferring data. - Pre-allocate the DMA buffer. This makes the driver slightly more efficient. - Comment out the GET_DEVICE_ID code, because for some unknown reason it causes printing to fail sometimes. usb.h - Add a macro to extract the isoc type. - Add a macro to check whether the routine has been entered after splusb and if not, complain. usbdi.c - Fix a glitch in dequeueing and aborting requests on interrupt pipes. - Add a flag in the request to determine if the data copying is done by the driver or the usbdi layer.
92 lines
3.3 KiB
C
92 lines
3.3 KiB
C
/* $NetBSD: hid.h,v 1.2 1998/07/24 20:57:46 augustss Exp $ */
|
|
/* $FreeBSD$ */
|
|
|
|
/*
|
|
* Copyright (c) 1998 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Lennart Augustsson (augustss@carlstedt.se) at
|
|
* Carlstedt Research & Technology.
|
|
*
|
|
* 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. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the NetBSD
|
|
* Foundation, Inc. and its contributors.
|
|
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
*/
|
|
|
|
enum hid_kind {
|
|
hid_input, hid_output, hid_feature, hid_collection, hid_endcollection
|
|
};
|
|
|
|
struct hid_location {
|
|
u_int32_t size;
|
|
u_int32_t count;
|
|
u_int32_t pos;
|
|
};
|
|
|
|
struct hid_item {
|
|
/* Global */
|
|
int32_t _usage_page;
|
|
int32_t logical_minimum;
|
|
int32_t logical_maximum;
|
|
int32_t physical_minimum;
|
|
int32_t physical_maximum;
|
|
int32_t unit_exponent;
|
|
int32_t unit;
|
|
int32_t report_ID;
|
|
/* Local */
|
|
int32_t usage;
|
|
int32_t usage_minimum;
|
|
int32_t usage_maximum;
|
|
int32_t designator_index;
|
|
int32_t designator_minimum;
|
|
int32_t designator_maximum;
|
|
int32_t string_index;
|
|
int32_t string_minimum;
|
|
int32_t string_maximum;
|
|
int32_t set_delimiter;
|
|
/* Misc */
|
|
int32_t collection;
|
|
int collevel;
|
|
enum hid_kind kind;
|
|
u_int32_t flags;
|
|
/* Location */
|
|
struct hid_location loc;
|
|
/* */
|
|
struct hid_item *next;
|
|
};
|
|
|
|
struct hid_data *hid_start_parse __P((void *d, int len, int kindset));
|
|
void hid_end_parse __P((struct hid_data *s));
|
|
int hid_get_item __P((struct hid_data *s, struct hid_item *h));
|
|
int hid_report_size __P((void *buf, int len, enum hid_kind k, u_int8_t *id));
|
|
int hid_locate __P((void *desc, int size, u_int32_t usage,
|
|
enum hid_kind kind, struct hid_location *loc,
|
|
u_int32_t *flags));
|
|
u_long hid_get_data __P((u_char *buf, struct hid_location *loc));
|
|
int hid_is_collection __P((void *desc, int size, u_int32_t usage));
|