/* $NetBSD: dzms.c,v 1.1 2000/12/02 17:03:55 ragge Exp $ */ /* * Copyright (c) 1992, 1993 * The Regents of the University of California. All rights reserved. * * This software was developed by the Computer Systems Engineering group * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and * contributed to Berkeley. * * All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Lawrence Berkeley Laboratory. * * 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 University of * California, Berkeley and its contributors. * 4. 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 REGENTS 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 REGENTS 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. * * @(#)ms.c 8.1 (Berkeley) 6/11/93 */ /* * VSXXX mice attached to line 1 of the DZ* */ #include #include #include #include #include #include #include #include #include #include #include #include #include "locators.h" struct dzms_softc { /* driver status information */ struct device dzms_dev; /* required first: base device */ struct dz_linestate *dzms_ls; int sc_enabled; /* input enabled? */ int self_test; int inputstate; u_int buttons; signed char dx; signed char dy; struct device *sc_wsmousedev; }; static int dzms_match __P((struct device *, struct cfdata *, void *)); static void dzms_attach __P((struct device *, struct device *, void *)); static int dzms_input __P((void *, int)); struct cfattach dzms_ca = { sizeof(struct dzms_softc), dzms_match, dzms_attach, }; static int dzms_enable __P((void *)); static int dzms_ioctl __P((void *, u_long, caddr_t, int, struct proc *)); static void dzms_disable __P((void *)); const struct wsmouse_accessops dzms_accessops = { dzms_enable, dzms_ioctl, dzms_disable, }; static int dzms_match(parent, cf, aux) struct device *parent; struct cfdata *cf; void *aux; { struct dzkm_attach_args *daa = aux; /* Exact match is better than wildcard. */ if (cf->cf_loc[DZCF_LINE] == daa->daa_line) return 2; /* This driver accepts wildcard. */ if (cf->cf_loc[DZCF_LINE] == DZCF_LINE_DEFAULT) return 1; return 0; } static void dzms_attach(parent, self, aux) struct device *parent, *self; void *aux; { struct dz_softc *dz = (void *)parent; struct dzms_softc *dzms = (void *)self; struct dzkm_attach_args *daa = aux; struct dz_linestate *ls; struct wsmousedev_attach_args a; dz->sc_dz[daa->daa_line].dz_catch = dzms_input; dz->sc_dz[daa->daa_line].dz_private = dzms; ls = &dz->sc_dz[daa->daa_line]; dzms->dzms_ls = ls; printf("\n"); a.accessops = &dzms_accessops; a.accesscookie = dzms; dzms->sc_enabled = 0; dzms->self_test = 0; dzms->sc_wsmousedev = config_found(self, &a, wsmousedevprint); } static int dzms_enable(v) void *v; { struct dzms_softc *sc = v; if (sc->sc_enabled) return EBUSY; /* XXX mice presence test should be done in match/attach context XXX */ sc->self_test = 1; dzputc(sc->dzms_ls, MOUSE_SELF_TEST); DELAY(100000); if (sc->self_test < 0) { sc->self_test = 0; return EBUSY; } else if (sc->self_test == 5) { sc->self_test = 0; sc->sc_enabled = 1; } sc->inputstate = 0; dzputc(sc->dzms_ls, MOUSE_INCREMENTAL); return 0; } static void dzms_disable(v) void *v; { struct dzms_softc *sc = v; sc->sc_enabled = 0; } static int dzms_ioctl(v, cmd, data, flag, p) void *v; u_long cmd; caddr_t data; int flag; struct proc *p; { if (cmd == WSMOUSEIO_GTYPE) { *(u_int *)data = WSMOUSE_TYPE_VSXXX; return 0; } return -1; } static int dzms_input(vsc, data) void *vsc; int data; { struct dzms_softc *sc = vsc; /* XXX mice presence test should be done in match/attach context XXX */ if (!sc->sc_enabled) { if (sc->self_test > 0) { if (data < 0) { printf("Timeout on 1st byte of mouse self-test report\n"); sc->self_test = -1; } else { sc->self_test++; } } if (sc->self_test == 3) { if ((data & 0x0f) != 0x2) { printf("We don't have a mouse!!!\n"); sc->self_test = -1; } } /* Interrupts are not expected. Discard the byte. */ return(1); } #define WSMS_BUTTON1 0x01 #define WSMS_BUTTON2 0x02 #define WSMS_BUTTON3 0x04 if ((data & MOUSE_START_FRAME) != 0) sc->inputstate = 1; else sc->inputstate++; if (sc->inputstate == 1) { sc->buttons = 0; if ((data & LEFT_BUTTON) != 0) sc->buttons |= WSMS_BUTTON1; if ((data & MIDDLE_BUTTON) != 0) sc->buttons |= WSMS_BUTTON2; if ((data & RIGHT_BUTTON) != 0) sc->buttons |= WSMS_BUTTON3; sc->dx = data & MOUSE_X_SIGN; sc->dy = data & MOUSE_Y_SIGN; } else if (sc->inputstate == 2) { if (sc->dx == 0) sc->dx = -data; else sc->dx = data; } else if (sc->inputstate == 3) { sc->inputstate = 0; if (sc->dy == 0) sc->dy = -data; else sc->dy = data; wsmouse_input(sc->sc_wsmousedev, sc->buttons, sc->dx, sc->dy, 0, WSMOUSE_INPUT_DELTA); } return(1); }