Rev 1392 | Rev 1447 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1339 | cejka | 1 | /* |
2 | * Copyright (C) 2006 Josef Cejka |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
1352 | palkovsky | 29 | #include <ipc/ipc.h> |
30 | #include <ipc/services.h> |
||
1339 | cejka | 31 | #include <stdio.h> |
32 | #include <unistd.h> |
||
33 | #include <stdlib.h> |
||
1352 | palkovsky | 34 | #include <ipc/ns.h> |
1339 | cejka | 35 | #include <errno.h> |
36 | #include <arch/kbd.h> |
||
37 | #include <kbd.h> |
||
1445 | cejka | 38 | #include <libadt/fifo.h> |
1339 | cejka | 39 | #include <key_buffer.h> |
40 | |||
41 | #define NAME "KBD" |
||
1445 | cejka | 42 | void hello(void *private, int retval, ipc_call_t *data) { |
43 | printf("%s: got answer from console with retval %d.\n", NAME, retval); |
||
44 | } |
||
1339 | cejka | 45 | int main(int argc, char **argv) |
46 | { |
||
47 | ipc_call_t call; |
||
48 | ipc_callid_t callid; |
||
49 | int res; |
||
50 | ipcarg_t phonead; |
||
1445 | cejka | 51 | int phoneid; |
52 | char connected = 0; |
||
1339 | cejka | 53 | |
54 | ipcarg_t retval, arg1, arg2; |
||
1344 | cejka | 55 | |
1339 | cejka | 56 | printf("Uspace kbd service started.\n"); |
57 | |||
58 | /* Initialize arch dependent parts */ |
||
59 | if (!(res = kbd_arch_init())) { |
||
60 | printf("Kbd registration failed with retval %d.\n", res); |
||
61 | return -1; |
||
62 | }; |
||
63 | |||
64 | /* Initialize key buffer */ |
||
65 | key_buffer_init(); |
||
66 | |||
67 | /* Register service at nameserver */ |
||
68 | printf("%s: Registering at naming service.\n", NAME); |
||
69 | |||
1343 | jermar | 70 | if ((res = ipc_connect_to_me(PHONE_NS, SERVICE_KEYBOARD, 0, &phonead)) != 0) { |
1339 | cejka | 71 | printf("%s: Error: Registering at naming service failed.\n", NAME); |
72 | return -1; |
||
73 | }; |
||
74 | |||
75 | while (1) { |
||
1365 | jermar | 76 | callid = ipc_wait_for_call(&call); |
1339 | cejka | 77 | // printf("%s:Call phone=%lX..", NAME, call.in_phone_hash); |
78 | switch (IPC_GET_METHOD(call)) { |
||
1344 | cejka | 79 | case IPC_M_PHONE_HUNGUP: |
1445 | cejka | 80 | printf("%s: Phone hung up.\n", NAME); |
81 | connected = 0; |
||
1339 | cejka | 82 | retval = 0; |
83 | break; |
||
1344 | cejka | 84 | case IPC_M_CONNECT_ME_TO: |
85 | // printf("%s: Connect me (%P) to: %zd\n",NAME, IPC_GET_ARG3(call), IPC_GET_ARG1(call)); |
||
86 | /* Only one connected client allowed */ |
||
87 | if (connected) { |
||
88 | retval = ELIMIT; |
||
1339 | cejka | 89 | } else { |
1344 | cejka | 90 | retval = 0; |
91 | connected = 1; |
||
1339 | cejka | 92 | } |
1344 | cejka | 93 | break; |
1445 | cejka | 94 | case IPC_M_CONNECT_TO_ME: |
95 | phoneid = IPC_GET_ARG3(call); |
||
96 | retval = 0; |
||
97 | break; |
||
98 | |||
1344 | cejka | 99 | case IPC_M_INTERRUPT: |
100 | if (connected) { |
||
1445 | cejka | 101 | /* recode to ASCII - one interrupt can produce more than one code so result is stored in fifo */ |
1344 | cejka | 102 | kbd_arch_process(IPC_GET_ARG2(call)); |
103 | |||
1445 | cejka | 104 | //printf("%s: GOT INTERRUPT: %c\n", NAME, key); |
105 | |||
1344 | cejka | 106 | /* Some callers could awaiting keypress - if its true, we have to send keys to them. |
107 | * One interrupt can store more than one key into buffer. */ |
||
1445 | cejka | 108 | |
1344 | cejka | 109 | retval = 0; |
1445 | cejka | 110 | |
111 | while (!key_buffer_empty()) { |
||
1344 | cejka | 112 | if (!key_buffer_pop((char *)&arg1)) { |
1445 | cejka | 113 | printf("%s: KeyBuffer is empty but it should not be.\n"); |
1344 | cejka | 114 | break; |
115 | } |
||
1445 | cejka | 116 | /*FIXME: detection of closed connection */ |
117 | ipc_call_async(phoneid, KBD_PUSHCHAR, arg1, 0, &hello); |
||
1344 | cejka | 118 | } |
1445 | cejka | 119 | |
1344 | cejka | 120 | } |
1445 | cejka | 121 | printf("%s: Interrupt processed.\n", NAME); |
1344 | cejka | 122 | break; |
123 | default: |
||
124 | printf("%s: Unknown method: %zd\n", NAME, IPC_GET_METHOD(call)); |
||
125 | retval = ENOENT; |
||
126 | break; |
||
1339 | cejka | 127 | } |
1344 | cejka | 128 | |
1339 | cejka | 129 | if (! (callid & IPC_CALLID_NOTIFICATION)) { |
1343 | jermar | 130 | ipc_answer_fast(callid, retval, arg1, arg2); |
1339 | cejka | 131 | } |
132 | } |
||
133 | } |
||
1344 | cejka | 134 |