2 * Copyright © 2013 Red Hat, Inc.
4 * Permission to use, copy, modify, distribute, and sell this software and its
5 * documentation for any purpose is hereby granted without fee, provided that
6 * the above copyright notice appear in all copies and that both that copyright
7 * notice and this permission notice appear in supporting documentation, and
8 * that the name of the copyright holders not be used in advertising or
9 * publicity pertaining to distribution of the software without specific,
10 * written prior permission. The copyright holders make no representations
11 * about the suitability of this software for any purpose. It is provided "as
12 * is" without express or implied warranty.
14 * THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
15 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
16 * EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
17 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
18 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
19 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
23 #ifndef libevdev_INT_H
24 #define libevdev_INT_H
29 #define LONG_BITS (sizeof(long) * 8)
30 #define NLONGS(x) (((x) + LONG_BITS - 1) / LONG_BITS)
31 #define ARRAY_LENGTH(a) (sizeof(a) / (sizeof((a)[0])))
34 #define ABS_MT_MIN ABS_MT_SLOT
35 #define ABS_MT_MAX ABS_MT_TOOL_Y
36 #define ABS_MT_CNT (ABS_MT_MAX - ABS_MT_MIN + 1)
41 ({ __typeof__ (a) _a = (a); \
42 __typeof__ (b) _b = (b); \
46 ({ __typeof__ (a) _a = (a); \
47 __typeof__ (b) _b = (b); \
53 libevdev_log_func_t log;
57 unsigned long bits[NLONGS(EV_CNT)];
58 unsigned long props[NLONGS(INPUT_PROP_CNT)];
59 unsigned long key_bits[NLONGS(KEY_CNT)];
60 unsigned long rel_bits[NLONGS(REL_CNT)];
61 unsigned long abs_bits[NLONGS(ABS_CNT)];
62 unsigned long led_bits[NLONGS(LED_CNT)];
63 unsigned long key_values[NLONGS(KEY_CNT)];
64 struct input_absinfo abs_info[ABS_CNT];
65 unsigned int mt_slot_vals[MAX_SLOTS][ABS_MT_CNT];
66 int num_slots; /**< valid slots in mt_slot_vals */
71 struct input_event *queue;
72 size_t queue_size; /**< size of queue in elements */
73 size_t queue_next; /**< next event index */
74 size_t queue_nsync; /**< number of sync events */
78 * @return a pointer to the next element in the queue, or NULL if the queue
81 static inline struct input_event*
82 queue_push(struct libevdev *dev)
84 if (dev->queue_next >= dev->queue_size)
87 return &dev->queue[dev->queue_next++];
91 * Set ev to the last element in the queue, removing it from the queue.
93 * @return 0 on success, 1 if the queue is empty.
96 queue_pop(struct libevdev *dev, struct input_event *ev)
98 if (dev->queue_next == 0)
101 *ev = dev->queue[--dev->queue_next];
107 queue_peek(struct libevdev *dev, size_t idx, struct input_event *ev)
109 if (idx > dev->queue_next)
111 *ev = dev->queue[idx];
117 * Shift the first n elements into ev and return the number of elements
119 * ev must be large enough to store n elements.
121 * @param ev The buffer to copy into, or NULL
122 * @return The number of elements in ev.
125 queue_shift_multiple(struct libevdev *dev, int n, struct input_event *ev)
129 if (dev->queue_next == 0)
132 n = min(n, dev->queue_next);
135 for (i = 0; i < n; i++)
136 ev[i] = dev->queue[i];
139 for (i = 0; i < dev->queue_next - n; i++)
140 dev->queue[i] = dev->queue[n + i];
142 dev->queue_next -= n;
147 * Set ev to the first element in the queue, shifting everything else
150 * @return 0 on success, 1 if the queue is empty.
153 queue_shift(struct libevdev *dev, struct input_event *ev)
155 return queue_shift_multiple(dev, 1, ev) == 1 ? 0 : 1;
159 queue_alloc(struct libevdev *dev, int size)
161 dev->queue = calloc(size, sizeof(struct input_event));
165 dev->queue_size = size;
171 queue_num_elements(struct libevdev *dev)
173 return dev->queue_next;
177 queue_size(struct libevdev *dev)
179 return dev->queue_size;
183 queue_num_free_elements(struct libevdev *dev)
185 return dev->queue_size - dev->queue_next - 1;
188 static inline struct input_event *
189 queue_next_element(struct libevdev *dev)
191 return &dev->queue[dev->queue_next];
195 queue_set_num_elements(struct libevdev *dev, int nelem)
197 if (nelem > dev->queue_size)
200 dev->queue_next = nelem;