Rev 1447 | Rev 1499 | 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" |
||
1447 | cejka | 42 | |
1339 | cejka | 43 | int main(int argc, char **argv) |
44 | { |
||
45 | ipc_call_t call; |
||
46 | ipc_callid_t callid; |
||
47 | int res; |
||
48 | ipcarg_t phonead; |
||
1445 | cejka | 49 | int phoneid; |
50 | char connected = 0; |
||
1451 | cejka | 51 | keybuffer_t keybuffer; |
1339 | cejka | 52 | ipcarg_t retval, arg1, arg2; |
1344 | cejka | 53 | |
1451 | cejka | 54 | // printf("Uspace kbd service started.\n"); |
1339 | cejka | 55 | |
56 | /* Initialize arch dependent parts */ |
||
57 | if (!(res = kbd_arch_init())) { |
||
1451 | cejka | 58 | // printf("Kbd registration failed with retval %d.\n", res); |
1339 | cejka | 59 | return -1; |
60 | }; |
||
61 | |||
62 | /* Initialize key buffer */ |
||
1451 | cejka | 63 | keybuffer_init(&keybuffer); |
1339 | cejka | 64 | |
65 | /* Register service at nameserver */ |
||
1451 | cejka | 66 | // printf("%s: Registering at naming service.\n", NAME); |
1339 | cejka | 67 | |
1343 | jermar | 68 | if ((res = ipc_connect_to_me(PHONE_NS, SERVICE_KEYBOARD, 0, &phonead)) != 0) { |
1451 | cejka | 69 | // printf("%s: Error: Registering at naming service failed.\n", NAME); |
1339 | cejka | 70 | return -1; |
71 | }; |
||
72 | |||
73 | while (1) { |
||
1365 | jermar | 74 | callid = ipc_wait_for_call(&call); |
1339 | cejka | 75 | // printf("%s:Call phone=%lX..", NAME, call.in_phone_hash); |
76 | switch (IPC_GET_METHOD(call)) { |
||
1344 | cejka | 77 | case IPC_M_PHONE_HUNGUP: |
1451 | cejka | 78 | // printf("%s: Phone hung up.\n", NAME); |
1445 | cejka | 79 | connected = 0; |
1339 | cejka | 80 | retval = 0; |
81 | break; |
||
1344 | cejka | 82 | case IPC_M_CONNECT_ME_TO: |
83 | // printf("%s: Connect me (%P) to: %zd\n",NAME, IPC_GET_ARG3(call), IPC_GET_ARG1(call)); |
||
84 | /* Only one connected client allowed */ |
||
85 | if (connected) { |
||
86 | retval = ELIMIT; |
||
1339 | cejka | 87 | } else { |
1344 | cejka | 88 | retval = 0; |
89 | connected = 1; |
||
1339 | cejka | 90 | } |
1344 | cejka | 91 | break; |
1445 | cejka | 92 | case IPC_M_CONNECT_TO_ME: |
93 | phoneid = IPC_GET_ARG3(call); |
||
94 | retval = 0; |
||
95 | break; |
||
96 | |||
1344 | cejka | 97 | case IPC_M_INTERRUPT: |
98 | if (connected) { |
||
1445 | cejka | 99 | /* recode to ASCII - one interrupt can produce more than one code so result is stored in fifo */ |
1451 | cejka | 100 | kbd_arch_process(&keybuffer, IPC_GET_ARG2(call)); |
1344 | cejka | 101 | |
1445 | cejka | 102 | //printf("%s: GOT INTERRUPT: %c\n", NAME, key); |
103 | |||
1344 | cejka | 104 | /* Some callers could awaiting keypress - if its true, we have to send keys to them. |
105 | * One interrupt can store more than one key into buffer. */ |
||
1445 | cejka | 106 | |
1344 | cejka | 107 | retval = 0; |
1445 | cejka | 108 | |
1451 | cejka | 109 | while (!keybuffer_empty(&keybuffer)) { |
110 | if (!keybuffer_pop(&keybuffer, (char *)&arg1)) { |
||
111 | // printf("%s: KeyBuffer is empty but it should not be.\n"); |
||
1344 | cejka | 112 | break; |
113 | } |
||
1445 | cejka | 114 | /*FIXME: detection of closed connection */ |
1451 | cejka | 115 | ipc_call_async(phoneid, KBD_PUSHCHAR, arg1, NULL, NULL); |
1344 | cejka | 116 | } |
1445 | cejka | 117 | |
1344 | cejka | 118 | } |
1451 | cejka | 119 | // printf("%s: Interrupt processed.\n", NAME); |
1344 | cejka | 120 | break; |
121 | default: |
||
1451 | cejka | 122 | // printf("%s: Unknown method: %zd\n", NAME, IPC_GET_METHOD(call)); |
1344 | cejka | 123 | retval = ENOENT; |
124 | break; |
||
1339 | cejka | 125 | } |
1344 | cejka | 126 | |
1339 | cejka | 127 | if (! (callid & IPC_CALLID_NOTIFICATION)) { |
1343 | jermar | 128 | ipc_answer_fast(callid, retval, arg1, arg2); |
1339 | cejka | 129 | } |
130 | } |
||
131 | } |
||
1344 | cejka | 132 |