[b0b5628] | 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 |
|
---|
[5f88293] | 29 | /** @addtogroup inputgen generic
|
---|
[b0b5628] | 30 | * @brief Generic scancode parser.
|
---|
[5f88293] | 31 | * @ingroup input
|
---|
[b0b5628] | 32 | * @{
|
---|
[5f88293] | 33 | */
|
---|
[b0b5628] | 34 | /** @file
|
---|
| 35 | */
|
---|
| 36 |
|
---|
| 37 | #ifndef KBD_GSP_H_
|
---|
| 38 | #define KBD_GSP_H_
|
---|
| 39 |
|
---|
[d9c8c81] | 40 | #include <adt/hash_table.h>
|
---|
[b0b5628] | 41 |
|
---|
| 42 | enum {
|
---|
[7ee8c5b] | 43 | GSP_END = -1, /**< Terminates a sequence. */
|
---|
| 44 | GSP_DEFAULT = -2 /**< Wildcard, catches unhandled cases. */
|
---|
[b0b5628] | 45 | };
|
---|
| 46 |
|
---|
[7ee8c5b] | 47 | /** Scancode parser description */
|
---|
[b0b5628] | 48 | typedef struct {
|
---|
[7ee8c5b] | 49 | /** Transition table, (state, input) -> (state, output) */
|
---|
[b0b5628] | 50 | hash_table_t trans;
|
---|
| 51 |
|
---|
[7ee8c5b] | 52 | /** Number of states */
|
---|
[b0b5628] | 53 | int states;
|
---|
| 54 | } gsp_t;
|
---|
| 55 |
|
---|
[7ee8c5b] | 56 | /** Scancode parser transition. */
|
---|
[b0b5628] | 57 | typedef struct {
|
---|
[062d900] | 58 | ht_link_t link; /**< Link to hash table in @c gsp_t */
|
---|
[b0b5628] | 59 |
|
---|
[7ee8c5b] | 60 | /* Preconditions */
|
---|
[b0b5628] | 61 |
|
---|
[7ee8c5b] | 62 | int old_state; /**< State before transition */
|
---|
| 63 | int input; /**< Input symbol (scancode) */
|
---|
[b0b5628] | 64 |
|
---|
[7ee8c5b] | 65 | /* Effects */
|
---|
| 66 |
|
---|
| 67 | int new_state; /**< State after transition */
|
---|
| 68 |
|
---|
| 69 | /* Output emitted during transition */
|
---|
| 70 |
|
---|
| 71 | unsigned out_mods; /**< Modifier to emit */
|
---|
| 72 | unsigned out_key; /**< Keycode to emit */
|
---|
[b0b5628] | 73 | } gsp_trans_t;
|
---|
| 74 |
|
---|
| 75 | extern void gsp_init(gsp_t *);
|
---|
| 76 | extern int gsp_insert_defs(gsp_t *, const int *);
|
---|
| 77 | extern int gsp_insert_seq(gsp_t *, const int *, unsigned, unsigned);
|
---|
| 78 | extern int gsp_step(gsp_t *, int, int, unsigned *, unsigned *);
|
---|
| 79 |
|
---|
| 80 | #endif
|
---|
| 81 |
|
---|
| 82 | /**
|
---|
| 83 | * @}
|
---|
| 84 | */
|
---|