* OF THIS SOFTWARE.
*/
-#ifndef libevdev_INT_H
-#define libevdev_INT_H
+#ifndef LIBEVDEV_INT_H
+#define LIBEVDEV_INT_H
#include <config.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <errno.h>
#include "libevdev.h"
#define LONG_BITS (sizeof(long) * 8)
#define ABS_MT_MIN ABS_MT_SLOT
#define ABS_MT_MAX ABS_MT_TOOL_Y
#define ABS_MT_CNT (ABS_MT_MAX - ABS_MT_MIN + 1)
+#define LIBEVDEV_EXPORT __attribute__((visibility("default")))
+#define LIBEVDEV_PRINTF(_format, _args) __attribute__ ((format (printf, _format, _args)))
+#define ALIAS(_to) __attribute__((alias(#_to)))
+
+#undef min
+#undef max
+#define min(a,b) \
+ ({ __typeof__ (a) _a = (a); \
+ __typeof__ (b) _b = (b); \
+ _a > _b ? _b : _a; \
+ })
+#define max(a,b) \
+ ({ __typeof__ (a) _a = (a); \
+ __typeof__ (b) _b = (b); \
+ _a > _b ? _a : _b; \
+ })
+
+/**
+ * Sync state machine:
+ * default state: SYNC_NONE
+ *
+ * SYNC_NONE → SYN_DROPPED or forced sync → SYNC_NEEDED
+ * SYNC_NEEDED → libevdev_next_event(LIBEVDEV_READ_FLAG_SYNC) → SYNC_IN_PROGRESS
+ * SYNC_NEEDED → libevdev_next_event(LIBEVDEV_READ_FLAG_SYNC_NONE) → SYNC_NONE
+ * SYNC_IN_PROGRESS → libevdev_next_event(LIBEVDEV_READ_FLAG_SYNC_NONE) → SYNC_NONE
+ * SYNC_IN_PROGRESS → no sync events left → SYNC_NONE
+ *
+ */
+enum SyncState {
+ SYNC_NONE,
+ SYNC_NEEDED,
+ SYNC_IN_PROGRESS,
+};
struct libevdev {
int fd;
- libevdev_log_func_t log;
-
- char name[MAX_NAME];
+ bool initialized;
+ char *name;
+ char *phys;
+ char *uniq;
struct input_id ids;
+ int driver_version;
unsigned long bits[NLONGS(EV_CNT)];
unsigned long props[NLONGS(INPUT_PROP_CNT)];
unsigned long key_bits[NLONGS(KEY_CNT)];
unsigned long rel_bits[NLONGS(REL_CNT)];
unsigned long abs_bits[NLONGS(ABS_CNT)];
unsigned long led_bits[NLONGS(LED_CNT)];
+ unsigned long msc_bits[NLONGS(MSC_CNT)];
+ unsigned long sw_bits[NLONGS(SW_CNT)];
+ unsigned long rep_bits[NLONGS(REP_CNT)]; /* convenience, always 1 */
+ unsigned long ff_bits[NLONGS(FF_CNT)];
+ unsigned long snd_bits[NLONGS(SND_CNT)];
unsigned long key_values[NLONGS(KEY_CNT)];
+ unsigned long led_values[NLONGS(LED_CNT)];
+ unsigned long sw_values[NLONGS(SW_CNT)];
struct input_absinfo abs_info[ABS_CNT];
- unsigned int mt_slot_vals[MAX_SLOTS][ABS_MT_CNT];
+ int mt_slot_vals[MAX_SLOTS][ABS_MT_CNT];
int num_slots; /**< valid slots in mt_slot_vals */
+ int current_slot;
+ int rep_values[REP_CNT];
- int need_sync;
- int grabbed;
+ enum SyncState sync_state;
+ enum libevdev_grab_mode grabbed;
struct input_event *queue;
size_t queue_size; /**< size of queue in elements */
size_t queue_next; /**< next event index */
size_t queue_nsync; /**< number of sync events */
+
+ struct timeval last_event_time;
+};
+
+struct logdata {
+ enum libevdev_log_priority priority; /** minimum logging priority */
+ libevdev_log_func_t handler; /** handler function */
+ void *userdata; /** user-defined data pointer */
};
+extern struct logdata log_data;
+
+#define log_msg_cond(priority, ...) \
+ do { \
+ if (libevdev_get_log_priority() >= priority) \
+ log_msg(priority, log_data.userdata, __FILE__, __LINE__, __func__, __VA_ARGS__); \
+ } while(0)
+
+#define log_error(...) log_msg_cond(LIBEVDEV_LOG_ERROR, __VA_ARGS__)
+#define log_info(...) log_msg_cond(LIBEVDEV_LOG_INFO, __VA_ARGS__)
+#define log_dbg(...) log_msg_cond(LIBEVDEV_LOG_DEBUG, __VA_ARGS__)
+#define log_bug(...) log_msg_cond(LIBEVDEV_LOG_ERROR, "BUG: "__VA_ARGS__)
+
+extern void
+log_msg(enum libevdev_log_priority priority,
+ void *data,
+ const char *file, int line, const char *func,
+ const char *format, ...) LIBEVDEV_PRINTF(6, 7);
+
+/**
+ * @return a pointer to the next element in the queue, or NULL if the queue
+ * is full.
+ */
+static inline struct input_event*
+queue_push(struct libevdev *dev)
+{
+ if (dev->queue_next >= dev->queue_size)
+ return NULL;
+
+ return &dev->queue[dev->queue_next++];
+}
+
+/**
+ * Set ev to the last element in the queue, removing it from the queue.
+ *
+ * @return 0 on success, 1 if the queue is empty.
+ */
+static inline int
+queue_pop(struct libevdev *dev, struct input_event *ev)
+{
+ if (dev->queue_next == 0)
+ return 1;
+
+ *ev = dev->queue[--dev->queue_next];
+
+ return 0;
+}
+
+static inline int
+queue_peek(struct libevdev *dev, size_t idx, struct input_event *ev)
+{
+ if (dev->queue_next == 0 || idx > dev->queue_next)
+ return 1;
+ *ev = dev->queue[idx];
+ return 0;
+}
+
+
+/**
+ * Shift the first n elements into ev and return the number of elements
+ * shifted.
+ * ev must be large enough to store n elements.
+ *
+ * @param ev The buffer to copy into, or NULL
+ * @return The number of elements in ev.
+ */
+static inline int
+queue_shift_multiple(struct libevdev *dev, size_t n, struct input_event *ev)
+{
+ size_t i;
+
+ if (dev->queue_next == 0)
+ return 0;
+
+ n = min(n, dev->queue_next);
+
+ if (ev) {
+ for (i = 0; i < n; i++)
+ ev[i] = dev->queue[i];
+ }
+
+ for (i = 0; i < dev->queue_next - n; i++)
+ dev->queue[i] = dev->queue[n + i];
+
+ dev->queue_next -= n;
+ return n;
+}
+
+/**
+ * Set ev to the first element in the queue, shifting everything else
+ * forward by one.
+ *
+ * @return 0 on success, 1 if the queue is empty.
+ */
+static inline int
+queue_shift(struct libevdev *dev, struct input_event *ev)
+{
+ return queue_shift_multiple(dev, 1, ev) == 1 ? 0 : 1;
+}
+
+static inline int
+queue_alloc(struct libevdev *dev, size_t size)
+{
+ if (size == 0)
+ return -ENOMEM;
+
+ dev->queue = calloc(size, sizeof(struct input_event));
+ if (!dev->queue)
+ return -ENOMEM;
+
+ dev->queue_size = size;
+ dev->queue_next = 0;
+ return 0;
+}
+
+static inline void
+queue_free(struct libevdev *dev)
+{
+ free(dev->queue);
+ dev->queue_size = 0;
+ dev->queue_next = 0;
+}
+
+static inline size_t
+queue_num_elements(struct libevdev *dev)
+{
+ return dev->queue_next;
+}
+
+static inline size_t
+queue_size(struct libevdev *dev)
+{
+ return dev->queue_size;
+}
+
+static inline size_t
+queue_num_free_elements(struct libevdev *dev)
+{
+ if (dev->queue_size == 0)
+ return 0;
+
+ return dev->queue_size - dev->queue_next;
+}
+
+static inline struct input_event *
+queue_next_element(struct libevdev *dev)
+{
+ if (dev->queue_next == dev->queue_size)
+ return NULL;
+
+ return &dev->queue[dev->queue_next];
+}
+
+static inline int
+queue_set_num_elements(struct libevdev *dev, size_t nelem)
+{
+ if (nelem > dev->queue_size)
+ return 1;
+
+ dev->queue_next = nelem;
+ return 0;
+}
#endif
projects / platform / upstream / libevdev.git / blobdiff