WebSVN – HelenOS-historic – Diff – /uspace/trunk/kbd/generic/kbd.c


/*
 * Copyright (C) 2006 Josef Cejka
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - 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.
 * - 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.
 */
 
#include <ipc/ipc.h>
#include <ipc/services.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <ipc/ns.h>
#include <errno.h>
#include <arch/kbd.h>
#include <kbd.h>
#include <libadt/fifo.h>
#include <key_buffer.h>
#include <async.h>
 
#define NAME "KBD"
 
int cons_connected = 0;
int phone2cons = -1;
keybuffer_t keybuffer; 
 
static void irq_handler(ipc_callid_t iid, ipc_call_t *call)
{
    int chr;
   
    if (cons_connected && phone2cons != -1) {
        /* recode to ASCII - one interrupt can produce more than one code so result is stored in fifo */
        kbd_arch_process(&keybuffer, IPC_GET_ARG2(*call));
       
        while (!keybuffer_empty(&keybuffer)) {
            if (!keybuffer_pop(&keybuffer, (int *)&chr))
                break;
 
            async_msg(phone2cons, KBD_PUSHCHAR, chr);
        }
    }
}
 
static void console_connection(ipc_callid_t iid, ipc_call_t *icall)
{
    ipc_callid_t callid;
    ipc_call_t call;
    int retval;
 
    if (cons_connected) {
        ipc_answer_fast(iid, ELIMIT, 0, 0);
        return;
    }
    cons_connected = 1;
    ipc_answer_fast(iid, 0, 0, 0);
 
    while (1) {
        callid = async_get_call(&call);
        switch (IPC_GET_METHOD(call)) {
        case IPC_M_PHONE_HUNGUP:
            cons_connected = 0;
            ipc_hangup(phone2cons);
            phone2cons = -1;
            ipc_answer_fast(callid, 0,0,0);
            return;
        case IPC_M_CONNECT_TO_ME:
            if (phone2cons != -1) {
                retval = ELIMIT;
                break;
            }
            phone2cons = IPC_GET_ARG3(call);
            retval = 0;
            break;
        }
        ipc_answer_fast(callid, retval, 0, 0);
    }  
}
 
 
int main(int argc, char **argv)
{
    ipc_call_t call;
    ipc_callid_t callid;
    int res;
    ipcarg_t phonead;
    ipcarg_t phoneid;
    char connected = 0;
    ipcarg_t retval, arg1, arg2;
   
    /* Initialize arch dependent parts */
    if (!(res = kbd_arch_init())) {
            return -1;
            };
   
    /* Initialize key buffer */
    keybuffer_init(&keybuffer);
   
    async_set_client_connection(console_connection);
    async_set_interrupt_received(irq_handler);
    /* Register service at nameserver */
 
    if ((res = ipc_connect_to_me(PHONE_NS, SERVICE_KEYBOARD, 0, &phonead)) != 0) {
        return -1;
    }
 
 
 
    async_manager();
 
}
 

Rev 1610	Rev 1640
1	/*	1	/*
2	* Copyright (C) 2006 Josef Cejka	2	* Copyright (C) 2006 Josef Cejka
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <ipc/ipc.h>	29	#include <ipc/ipc.h>
30	#include <ipc/services.h>	30	#include <ipc/services.h>
31	#include <stdio.h>	31	#include <stdio.h>
32	#include <unistd.h>	32	#include <unistd.h>
33	#include <stdlib.h>	33	#include <stdlib.h>
34	#include <stdio.h>	34	#include <stdio.h>
35	#include <ipc/ns.h>	35	#include <ipc/ns.h>
36	#include <errno.h>	36	#include <errno.h>
37	#include <arch/kbd.h>	37	#include <arch/kbd.h>
38	#include <kbd.h>	38	#include <kbd.h>
39	#include <libadt/fifo.h>	39	#include <libadt/fifo.h>
40	#include <key_buffer.h>	40	#include <key_buffer.h>
41	#include <async.h>	41	#include <async.h>
42		42
43	#define NAME "KBD"	43	#define NAME "KBD"
44		44
45	int cons_connected = 0;	45	int cons_connected = 0;
46	int phone2cons = -1;	46	int phone2cons = -1;
47	keybuffer_t keybuffer;	47	keybuffer_t keybuffer;
48		48
49	static void irq_handler(ipc_callid_t iid, ipc_call_t *call)	49	static void irq_handler(ipc_callid_t iid, ipc_call_t *call)
50	{	50	{
51	int chr;	51	int chr;
52		52
53	if (cons_connected && phone2cons != -1) {	53	if (cons_connected && phone2cons != -1) {
54	/* recode to ASCII - one interrupt can produce more than one code so result is stored in fifo */	54	/* recode to ASCII - one interrupt can produce more than one code so result is stored in fifo */
55	kbd_arch_process(&keybuffer, IPC_GET_ARG2(*call));	55	kbd_arch_process(&keybuffer, IPC_GET_ARG2(*call));
56		56
57	while (!keybuffer_empty(&keybuffer)) {	57	while (!keybuffer_empty(&keybuffer)) {
58	if (!keybuffer_pop(&keybuffer, (int *)&chr))	58	if (!keybuffer_pop(&keybuffer, (int *)&chr))
59	break;	59	break;
60		60
61	async_msg(phone2cons, KBD_PUSHCHAR, chr);	61	async_msg(phone2cons, KBD_PUSHCHAR, chr);
62	}	62	}
63	}	63	}
64	}	64	}
65		65
66	static void console_connection(ipc_callid_t iid, ipc_call_t *icall)	66	static void console_connection(ipc_callid_t iid, ipc_call_t *icall)
67	{	67	{
68	ipc_callid_t callid;	68	ipc_callid_t callid;
69	ipc_call_t call;	69	ipc_call_t call;
70	int retval;	70	int retval;
71		71
72	if (cons_connected) {	72	if (cons_connected) {
73	ipc_answer_fast(iid, ELIMIT, 0, 0);	73	ipc_answer_fast(iid, ELIMIT, 0, 0);
74	return;	74	return;
75	}	75	}
76	cons_connected = 1;	76	cons_connected = 1;
77	ipc_answer_fast(iid, 0, 0, 0);	77	ipc_answer_fast(iid, 0, 0, 0);
78		78
79	while (1) {	79	while (1) {
80	callid = async_get_call(&call);	80	callid = async_get_call(&call);
81	switch (IPC_GET_METHOD(call)) {	81	switch (IPC_GET_METHOD(call)) {
82	case IPC_M_PHONE_HUNGUP:	82	case IPC_M_PHONE_HUNGUP:
83	cons_connected = 0;	83	cons_connected = 0;
84	ipc_hangup(phone2cons);	84	ipc_hangup(phone2cons);
85	phone2cons = -1;	85	phone2cons = -1;
86	ipc_answer_fast(callid, 0,0,0);	86	ipc_answer_fast(callid, 0,0,0);
87	return;	87	return;
88	case IPC_M_CONNECT_TO_ME:	88	case IPC_M_CONNECT_TO_ME:
89	if (phone2cons != -1) {	89	if (phone2cons != -1) {
90	retval = ELIMIT;	90	retval = ELIMIT;
91	break;	91	break;
92	}	92	}
93	phone2cons = IPC_GET_ARG3(call);	93	phone2cons = IPC_GET_ARG3(call);
94	retval = 0;	94	retval = 0;
95	break;	95	break;
96	}	96	}
97	ipc_answer_fast(callid, retval, 0, 0);	97	ipc_answer_fast(callid, retval, 0, 0);
98	}	98	}
99	}	99	}
100		100
101		101
102	int main(int argc, char **argv)	102	int main(int argc, char **argv)
103	{	103	{
104	ipc_call_t call;	104	ipc_call_t call;
105	ipc_callid_t callid;	105	ipc_callid_t callid;
106	int res;	106	int res;
107	ipcarg_t phonead;	107	ipcarg_t phonead;
108	ipcarg_t phoneid;	108	ipcarg_t phoneid;
109	char connected = 0;	109	char connected = 0;
110	ipcarg_t retval, arg1, arg2;	110	ipcarg_t retval, arg1, arg2;
111		111
112	/* Initialize arch dependent parts */	112	/* Initialize arch dependent parts */
113	if (!(res = kbd_arch_init())) {	113	if (!(res = kbd_arch_init())) {
114	return -1;	114	return -1;
115	};	115	};
116		116
117	/* Initialize key buffer */	117	/* Initialize key buffer */
118	keybuffer_init(&keybuffer);	118	keybuffer_init(&keybuffer);
119		119
-		120	async_set_client_connection(console_connection);
-		121	async_set_interrupt_received(irq_handler);
120	/* Register service at nameserver */	122	/* Register service at nameserver */
121		-
122	if ((res = ipc_connect_to_me(PHONE_NS, SERVICE_KEYBOARD, 0, &phonead)) != 0) {	123	if ((res = ipc_connect_to_me(PHONE_NS, SERVICE_KEYBOARD, 0, &phonead)) != 0) {
123	return -1;	124	return -1;
124	}	125	}
125		126
126	async_set_client_connection(console_connection);	-
127	async_set_interrupt_received(irq_handler);	-
128	async_manager();	127	async_manager();
129		128
130	}	129	}
131		130

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/kbd/generic/kbd.c – Rev 1610 → 1640