1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
|
/*
* Copyright © 2008-2011 Kristian Høgsberg
* Copyright © 2011 Intel Corporation
* Copyright © 2013-2015 Red Hat, Inc.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
/*
* This list data structure is verbatim copy from wayland-util.h from the
* Wayland project; except that wl_ prefix has been removed.
*/
#include "config.h"
#include <ctype.h>
#include <locale.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include "libinput-util.h"
#include "libinput-private.h"
void
list_init(struct list *list)
{
list->prev = list;
list->next = list;
}
void
list_insert(struct list *list, struct list *elm)
{
elm->prev = list;
elm->next = list->next;
list->next = elm;
elm->next->prev = elm;
}
void
list_remove(struct list *elm)
{
elm->prev->next = elm->next;
elm->next->prev = elm->prev;
elm->next = NULL;
elm->prev = NULL;
}
bool
list_empty(const struct list *list)
{
return list->next == list;
}
void
ratelimit_init(struct ratelimit *r, uint64_t ival_us, unsigned int burst)
{
r->interval = ival_us;
r->begin = 0;
r->burst = burst;
r->num = 0;
}
/*
* Perform rate-limit test. Returns RATELIMIT_PASS if the rate-limited action
* is still allowed, RATELIMIT_THRESHOLD if the limit has been reached with
* this call, and RATELIMIT_EXCEEDED if you're beyond the threshold.
* It's safe to treat the return-value as boolean, if you're not interested in
* the exact state. It evaluates to "true" if the threshold hasn't been
* exceeded, yet.
*
* The ratelimit object must be initialized via ratelimit_init().
*
* Modelled after Linux' lib/ratelimit.c by Dave Young
* <hidave.darkstar@gmail.com>, which is licensed GPLv2.
*/
enum ratelimit_state
ratelimit_test(struct ratelimit *r)
{
struct timespec ts;
uint64_t utime;
if (r->interval <= 0 || r->burst <= 0)
return RATELIMIT_PASS;
clock_gettime(CLOCK_MONOTONIC, &ts);
utime = s2us(ts.tv_sec) + ns2us(ts.tv_nsec);
if (r->begin <= 0 || r->begin + r->interval < utime) {
/* reset counter */
r->begin = utime;
r->num = 1;
return RATELIMIT_PASS;
} else if (r->num < r->burst) {
/* continue burst */
return (++r->num == r->burst) ? RATELIMIT_THRESHOLD
: RATELIMIT_PASS;
}
return RATELIMIT_EXCEEDED;
}
/* Helper function to parse the mouse DPI tag from udev.
* The tag is of the form:
* MOUSE_DPI=400 *1000 2000
* or
* MOUSE_DPI=400@125 *1000@125 2000@125
* Where the * indicates the default value and @number indicates device poll
* rate.
* Numbers should be in ascending order, and if rates are present they should
* be present for all entries.
*
* When parsing the mouse DPI property, if we find an error we just return 0
* since it's obviously invalid, the caller will treat that as an error and
* use a reasonable default instead. If the property contains multiple DPI
* settings but none flagged as default, we return the last because we're
* lazy and that's a silly way to set the property anyway.
*
* @param prop The value of the udev property (without the MOUSE_DPI=)
* @return The default dpi value on success, 0 on error
*/
int
parse_mouse_dpi_property(const char *prop)
{
bool is_default = false;
int nread, dpi = 0, rate;
if (!prop)
return 0;
while (*prop != 0) {
if (*prop == ' ') {
prop++;
continue;
}
if (*prop == '*') {
prop++;
is_default = true;
if (!isdigit(prop[0]))
return 0;
}
/* While we don't do anything with the rate right now we
* will validate that, if it's present, it is non-zero and
* positive
*/
rate = 1;
nread = 0;
sscanf(prop, "%d@%d%n", &dpi, &rate, &nread);
if (!nread)
sscanf(prop, "%d%n", &dpi, &nread);
if (!nread || dpi <= 0 || rate <= 0 || prop[nread] == '@')
return 0;
if (is_default)
break;
prop += nread;
}
return dpi;
}
/**
* Helper function to parse the MOUSE_WHEEL_CLICK_COUNT property from udev.
* Property is of the form:
* MOUSE_WHEEL_CLICK_COUNT=<integer>
* Where the number indicates the number of wheel clicks per 360 deg
* rotation.
*
* @param prop The value of the udev property (without the MOUSE_WHEEL_CLICK_COUNT=)
* @return The click count of the wheel (may be negative) or 0 on error.
*/
int
parse_mouse_wheel_click_count_property(const char *prop)
{
int count = 0;
if (!prop)
return 0;
if (!safe_atoi(prop, &count) || abs(count) > 360)
return 0;
return count;
}
/**
*
* Helper function to parse the MOUSE_WHEEL_CLICK_ANGLE property from udev.
* Property is of the form:
* MOUSE_WHEEL_CLICK_ANGLE=<integer>
* Where the number indicates the degrees travelled for each click.
*
* @param prop The value of the udev property (without the MOUSE_WHEEL_CLICK_ANGLE=)
* @return The angle of the wheel (may be negative) or 0 on error.
*/
int
parse_mouse_wheel_click_angle_property(const char *prop)
{
int angle = 0;
if (!prop)
return 0;
if (!safe_atoi(prop, &angle) || abs(angle) > 360)
return 0;
return angle;
}
/**
* Helper function to parse the TRACKPOINT_CONST_ACCEL property from udev.
* Property is of the form:
* TRACKPOINT_CONST_ACCEL=<float>
*
* @param prop The value of the udev property (without the TRACKPOINT_CONST_ACCEL=)
* @return The acceleration, or 0.0 on error.
*/
double
parse_trackpoint_accel_property(const char *prop)
{
double accel;
if (!prop)
return 0.0;
if (!safe_atod(prop, &accel))
accel = 0.0;
return accel;
}
/**
* Parses a simple dimension string in the form of "10x40". The two
* numbers must be positive integers in decimal notation.
* On success, the two numbers are stored in w and h. On failure, w and h
* are unmodified.
*
* @param prop The value of the property
* @param w Returns the first component of the dimension
* @param h Returns the second component of the dimension
* @return true on success, false otherwise
*/
bool
parse_dimension_property(const char *prop, size_t *w, size_t *h)
{
int x, y;
if (!prop)
return false;
if (sscanf(prop, "%dx%d", &x, &y) != 2)
return false;
if (x < 0 || y < 0)
return false;
*w = (size_t)x;
*h = (size_t)y;
return true;
}
bool
parse_switch_reliability_property(const char *prop,
enum switch_reliability *reliability)
{
if (!prop) {
*reliability = RELIABILITY_UNKNOWN;
return true;
}
if (streq(prop, "reliable"))
*reliability = RELIABILITY_RELIABLE;
else if (streq(prop, "write_open"))
*reliability = RELIABILITY_WRITE_OPEN;
else
return false;
return true;
}
/**
* Return the next word in a string pointed to by state before the first
* separator character. Call repeatedly to tokenize a whole string.
*
* @param state Current state
* @param len String length of the word returned
* @param separators List of separator characters
*
* @return The first word in *state, NOT null-terminated
*/
static const char *
next_word(const char **state, size_t *len, const char *separators)
{
const char *next = *state;
size_t l;
if (!*next)
return NULL;
next += strspn(next, separators);
if (!*next) {
*state = next;
return NULL;
}
l = strcspn(next, separators);
*state = next + l;
*len = l;
return next;
}
/**
* Return a null-terminated string array with the tokens in the input
* string, e.g. "one two\tthree" with a separator list of " \t" will return
* an array [ "one", "two", "three", NULL ].
*
* Use strv_free() to free the array.
*
* @param in Input string
* @param separators List of separator characters
*
* @return A null-terminated string array or NULL on errors
*/
char **
strv_from_string(const char *in, const char *separators)
{
const char *s, *word;
char **strv = NULL;
int nelems = 0, idx;
size_t l;
assert(in != NULL);
s = in;
while ((word = next_word(&s, &l, separators)) != NULL)
nelems++;
if (nelems == 0)
return NULL;
nelems++; /* NULL-terminated */
strv = zalloc(nelems * sizeof *strv);
if (!strv)
return NULL;
idx = 0;
s = in;
while ((word = next_word(&s, &l, separators)) != NULL) {
char *copy = strndup(word, l);
if (!copy) {
strv_free(strv);
return NULL;
}
strv[idx++] = copy;
}
return strv;
}
|