Rev 1339 | Rev 1344 | 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 | |||
| 29 | #include <ipc.h> |
||
| 1343 | jermar | 30 | #include <services.h> |
| 1339 | cejka | 31 | #include <stdio.h> |
| 32 | #include <unistd.h> |
||
| 33 | #include <stdlib.h> |
||
| 34 | #include <ns.h> |
||
| 35 | #include <errno.h> |
||
| 36 | #include <arch/kbd.h> |
||
| 37 | #include <kbd.h> |
||
| 38 | #include <key_buffer.h> |
||
| 39 | #include <fifo.h> |
||
| 40 | |||
| 41 | #define NAME "KBD" |
||
| 42 | |||
| 43 | #define KBD_REQUEST_MAX 32 /**< Maximum requests buffered until keypress */ |
||
| 44 | |||
| 45 | int main(int argc, char **argv) |
||
| 46 | { |
||
| 47 | ipc_call_t call; |
||
| 48 | ipc_callid_t callid; |
||
| 49 | char connected = 0; |
||
| 50 | int res; |
||
| 51 | int c; |
||
| 52 | ipcarg_t phonead; |
||
| 53 | |||
| 54 | ipcarg_t retval, arg1, arg2; |
||
| 55 | |||
| 56 | fifo_count_t callers_counter = 0; |
||
| 57 | |||
| 58 | FIFO_INITIALIZE_STATIC(callers_buffer, ipc_callid_t, KBD_REQUEST_MAX); |
||
| 59 | |||
| 60 | printf("Uspace kbd service started.\n"); |
||
| 61 | |||
| 62 | /* Initialize arch dependent parts */ |
||
| 63 | if (!(res = kbd_arch_init())) { |
||
| 64 | printf("Kbd registration failed with retval %d.\n", res); |
||
| 65 | return -1; |
||
| 66 | }; |
||
| 67 | |||
| 68 | /* Initialize key buffer */ |
||
| 69 | key_buffer_init(); |
||
| 70 | |||
| 71 | /* Register service at nameserver */ |
||
| 72 | printf("%s: Registering at naming service.\n", NAME); |
||
| 73 | |||
| 1343 | jermar | 74 | if ((res = ipc_connect_to_me(PHONE_NS, SERVICE_KEYBOARD, 0, &phonead)) != 0) { |
| 1339 | cejka | 75 | printf("%s: Error: Registering at naming service failed.\n", NAME); |
| 76 | return -1; |
||
| 77 | }; |
||
| 78 | |||
| 79 | while (1) { |
||
| 80 | callid = ipc_wait_for_call(&call, 0); |
||
| 81 | // printf("%s:Call phone=%lX..", NAME, call.in_phone_hash); |
||
| 82 | switch (IPC_GET_METHOD(call)) { |
||
| 83 | case IPC_M_PHONE_HUNGUP: |
||
| 84 | if (connected) { |
||
| 85 | if (--connected == 0) { |
||
| 86 | callers_counter = 0; |
||
| 87 | callers_buffer.head = callers_buffer.tail = 0; |
||
| 88 | key_buffer_free(); |
||
| 89 | } |
||
| 90 | } |
||
| 91 | |||
| 92 | printf("%s: Phone hung up.\n", NAME); |
||
| 93 | retval = 0; |
||
| 94 | break; |
||
| 95 | case IPC_M_CONNECT_TO_ME: |
||
| 96 | printf("%s: Somebody connecting phid=%zd.\n", NAME, IPC_GET_ARG3(call)); |
||
| 97 | retval = 0; |
||
| 98 | break; |
||
| 99 | case IPC_M_CONNECT_ME_TO: |
||
| 100 | // printf("%s: Connect me (%P) to: %zd\n",NAME, IPC_GET_ARG3(call), IPC_GET_ARG1(call)); |
||
| 101 | if (connected) { |
||
| 102 | retval = ELIMIT; |
||
| 103 | } else { |
||
| 104 | retval = 0; |
||
| 105 | connected = 1; |
||
| 106 | } |
||
| 107 | break; |
||
| 108 | case IPC_M_INTERRUPT: |
||
| 109 | if (connected) { |
||
| 110 | kbd_arch_process(IPC_GET_ARG2(call)); |
||
| 111 | } |
||
| 112 | //printf("%s: GOT INTERRUPT: %c\n", NAME, IPC_GET_ARG2(call)); |
||
| 113 | if (!callers_counter) |
||
| 114 | break; |
||
| 115 | /* Small trick - interrupt does not need answer so we can change callid to caller awaiting key */ |
||
| 116 | callers_counter--; |
||
| 117 | callid = fifo_pop(callers_buffer); |
||
| 118 | case KBD_GETCHAR: |
||
| 119 | // printf("%s: Getchar: ", NAME); |
||
| 120 | retval = 0; |
||
| 121 | arg1 = 0; |
||
| 122 | if (!key_buffer_pop((char *)&arg1)) { |
||
| 123 | if (callers_counter < KBD_REQUEST_MAX) { |
||
| 124 | callers_counter++; |
||
| 125 | fifo_push(callers_buffer, callid); |
||
| 126 | } else { |
||
| 127 | retval = ELIMIT; |
||
| 128 | } |
||
| 129 | continue; |
||
| 130 | }; |
||
| 131 | arg2 = 0xbeef; |
||
| 132 | // printf("GetChar return %c\n", arg1); |
||
| 133 | |||
| 134 | break; |
||
| 135 | default: |
||
| 136 | printf("%s: Unknown method: %zd\n", NAME, IPC_GET_METHOD(call)); |
||
| 137 | retval = ENOENT; |
||
| 138 | break; |
||
| 139 | } |
||
| 140 | if (! (callid & IPC_CALLID_NOTIFICATION)) { |
||
| 141 | // printf("%s: Answering\n", NAME); |
||
| 1343 | jermar | 142 | ipc_answer_fast(callid, retval, arg1, arg2); |
| 1339 | cejka | 143 | } |
| 144 | } |
||
| 145 | } |