Rev 4113 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
4061 | svoboda | 1 | /* |
2 | * Copyright (c) 2009 Jiri Svoboda |
||
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 | /** @addtogroup kbdgen generic |
||
30 | * @brief Generic scancode parser. |
||
31 | * @ingroup kbd |
||
32 | * @{ |
||
33 | */ |
||
34 | /** @file |
||
35 | */ |
||
36 | |||
37 | #ifndef KBD_GSP_H_ |
||
38 | #define KBD_GSP_H_ |
||
39 | |||
40 | #include <libadt/hash_table.h> |
||
41 | |||
42 | enum { |
||
43 | GSP_END = -1, |
||
44 | GSP_DEFAULT = -2 |
||
45 | }; |
||
46 | |||
47 | typedef struct { |
||
48 | /** Transition table, (state, input) -> (state, output). */ |
||
49 | hash_table_t trans; |
||
50 | |||
51 | /** Current number of states. */ |
||
52 | int states; |
||
53 | } gsp_t; |
||
54 | |||
55 | typedef struct { |
||
56 | link_t link; |
||
57 | |||
58 | int old_state; |
||
59 | int input; |
||
60 | |||
61 | int new_state; |
||
62 | |||
63 | unsigned out_mods; |
||
64 | unsigned out_key; |
||
65 | } gsp_trans_t; |
||
66 | |||
67 | extern void gsp_init(gsp_t *); |
||
68 | extern int gsp_insert_defs(gsp_t *, const int *); |
||
69 | extern int gsp_insert_seq(gsp_t *, const int *, unsigned, unsigned); |
||
70 | extern int gsp_step(gsp_t *, int, int, unsigned *, unsigned *); |
||
71 | |||
72 | |||
73 | #endif |
||
74 | |||
75 | /** |
||
76 | * @} |
||
77 | */ |
||
78 |