input-mt.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  1. /*
  2. * Input Multitouch Library
  3. *
  4. * Copyright (c) 2008-2010 Henrik Rydberg
  5. *
  6. * This program is free software; you can redistribute it and/or modify it
  7. * under the terms of the GNU General Public License version 2 as published by
  8. * the Free Software Foundation.
  9. */
  10. #include <linux/input/mt.h>
  11. #include <linux/export.h>
  12. #include <linux/slab.h>
  13. #define TRKID_SGN ((TRKID_MAX + 1) >> 1)
  14. static void copy_abs(struct input_dev *dev, unsigned int dst, unsigned int src)
  15. {
  16. if (dev->absinfo && test_bit(src, dev->absbit)) {
  17. dev->absinfo[dst] = dev->absinfo[src];
  18. dev->absbit[BIT_WORD(dst)] |= BIT_MASK(dst);
  19. }
  20. }
  21. /**
  22. * input_mt_init_slots() - initialize MT input slots
  23. * @dev: input device supporting MT events and finger tracking
  24. * @num_slots: number of slots used by the device
  25. * @flags: mt tasks to handle in core
  26. *
  27. * This function allocates all necessary memory for MT slot handling
  28. * in the input device, prepares the ABS_MT_SLOT and
  29. * ABS_MT_TRACKING_ID events for use and sets up appropriate buffers.
  30. * Depending on the flags set, it also performs pointer emulation and
  31. * frame synchronization.
  32. *
  33. * May be called repeatedly. Returns -EINVAL if attempting to
  34. * reinitialize with a different number of slots.
  35. */
  36. int input_mt_init_slots(struct input_dev *dev, unsigned int num_slots,
  37. unsigned int flags)
  38. {
  39. struct input_mt *mt = dev->mt;
  40. int i;
  41. if (!num_slots)
  42. return 0;
  43. if (mt)
  44. return mt->num_slots != num_slots ? -EINVAL : 0;
  45. mt = kzalloc(sizeof(*mt) + num_slots * sizeof(*mt->slots), GFP_KERNEL);
  46. if (!mt)
  47. goto err_mem;
  48. mt->num_slots = num_slots;
  49. mt->flags = flags;
  50. input_set_abs_params(dev, ABS_MT_SLOT, 0, num_slots - 1, 0, 0);
  51. input_set_abs_params(dev, ABS_MT_TRACKING_ID, 0, TRKID_MAX, 0, 0);
  52. if (flags & (INPUT_MT_POINTER | INPUT_MT_DIRECT)) {
  53. __set_bit(EV_KEY, dev->evbit);
  54. __set_bit(BTN_TOUCH, dev->keybit);
  55. copy_abs(dev, ABS_X, ABS_MT_POSITION_X);
  56. copy_abs(dev, ABS_Y, ABS_MT_POSITION_Y);
  57. copy_abs(dev, ABS_PRESSURE, ABS_MT_PRESSURE);
  58. }
  59. if (flags & INPUT_MT_POINTER) {
  60. __set_bit(BTN_TOOL_FINGER, dev->keybit);
  61. __set_bit(BTN_TOOL_DOUBLETAP, dev->keybit);
  62. if (num_slots >= 3)
  63. __set_bit(BTN_TOOL_TRIPLETAP, dev->keybit);
  64. if (num_slots >= 4)
  65. __set_bit(BTN_TOOL_QUADTAP, dev->keybit);
  66. if (num_slots >= 5)
  67. __set_bit(BTN_TOOL_QUINTTAP, dev->keybit);
  68. __set_bit(INPUT_PROP_POINTER, dev->propbit);
  69. }
  70. if (flags & INPUT_MT_DIRECT)
  71. __set_bit(INPUT_PROP_DIRECT, dev->propbit);
  72. if (flags & INPUT_MT_TRACK) {
  73. unsigned int n2 = num_slots * num_slots;
  74. mt->red = kcalloc(n2, sizeof(*mt->red), GFP_KERNEL);
  75. if (!mt->red)
  76. goto err_mem;
  77. }
  78. /* Mark slots as 'unused' */
  79. for (i = 0; i < num_slots; i++)
  80. input_mt_set_value(&mt->slots[i], ABS_MT_TRACKING_ID, -1);
  81. dev->mt = mt;
  82. return 0;
  83. err_mem:
  84. kfree(mt);
  85. return -ENOMEM;
  86. }
  87. EXPORT_SYMBOL(input_mt_init_slots);
  88. /**
  89. * input_mt_destroy_slots() - frees the MT slots of the input device
  90. * @dev: input device with allocated MT slots
  91. *
  92. * This function is only needed in error path as the input core will
  93. * automatically free the MT slots when the device is destroyed.
  94. */
  95. void input_mt_destroy_slots(struct input_dev *dev)
  96. {
  97. if (dev->mt) {
  98. kfree(dev->mt->red);
  99. kfree(dev->mt);
  100. }
  101. dev->mt = NULL;
  102. }
  103. EXPORT_SYMBOL(input_mt_destroy_slots);
  104. /**
  105. * input_mt_report_slot_state() - report contact state
  106. * @dev: input device with allocated MT slots
  107. * @tool_type: the tool type to use in this slot
  108. * @active: true if contact is active, false otherwise
  109. *
  110. * Reports a contact via ABS_MT_TRACKING_ID, and optionally
  111. * ABS_MT_TOOL_TYPE. If active is true and the slot is currently
  112. * inactive, or if the tool type is changed, a new tracking id is
  113. * assigned to the slot. The tool type is only reported if the
  114. * corresponding absbit field is set.
  115. */
  116. void input_mt_report_slot_state(struct input_dev *dev,
  117. unsigned int tool_type, bool active)
  118. {
  119. struct input_mt *mt = dev->mt;
  120. struct input_mt_slot *slot;
  121. int id;
  122. if (!mt)
  123. return;
  124. slot = &mt->slots[mt->slot];
  125. slot->frame = mt->frame;
  126. if (!active) {
  127. input_event(dev, EV_ABS, ABS_MT_TRACKING_ID, -1);
  128. return;
  129. }
  130. id = input_mt_get_value(slot, ABS_MT_TRACKING_ID);
  131. if (id < 0 || input_mt_get_value(slot, ABS_MT_TOOL_TYPE) != tool_type)
  132. id = input_mt_new_trkid(mt);
  133. input_event(dev, EV_ABS, ABS_MT_TRACKING_ID, id);
  134. input_event(dev, EV_ABS, ABS_MT_TOOL_TYPE, tool_type);
  135. }
  136. EXPORT_SYMBOL(input_mt_report_slot_state);
  137. /**
  138. * input_mt_report_finger_count() - report contact count
  139. * @dev: input device with allocated MT slots
  140. * @count: the number of contacts
  141. *
  142. * Reports the contact count via BTN_TOOL_FINGER, BTN_TOOL_DOUBLETAP,
  143. * BTN_TOOL_TRIPLETAP and BTN_TOOL_QUADTAP.
  144. *
  145. * The input core ensures only the KEY events already setup for
  146. * this device will produce output.
  147. */
  148. void input_mt_report_finger_count(struct input_dev *dev, int count)
  149. {
  150. input_event(dev, EV_KEY, BTN_TOOL_FINGER, count == 1);
  151. input_event(dev, EV_KEY, BTN_TOOL_DOUBLETAP, count == 2);
  152. input_event(dev, EV_KEY, BTN_TOOL_TRIPLETAP, count == 3);
  153. input_event(dev, EV_KEY, BTN_TOOL_QUADTAP, count == 4);
  154. input_event(dev, EV_KEY, BTN_TOOL_QUINTTAP, count == 5);
  155. }
  156. EXPORT_SYMBOL(input_mt_report_finger_count);
  157. /**
  158. * input_mt_report_pointer_emulation() - common pointer emulation
  159. * @dev: input device with allocated MT slots
  160. * @use_count: report number of active contacts as finger count
  161. *
  162. * Performs legacy pointer emulation via BTN_TOUCH, ABS_X, ABS_Y and
  163. * ABS_PRESSURE. Touchpad finger count is emulated if use_count is true.
  164. *
  165. * The input core ensures only the KEY and ABS axes already setup for
  166. * this device will produce output.
  167. */
  168. void input_mt_report_pointer_emulation(struct input_dev *dev, bool use_count)
  169. {
  170. struct input_mt *mt = dev->mt;
  171. struct input_mt_slot *oldest;
  172. int oldid, count, i;
  173. if (!mt)
  174. return;
  175. oldest = NULL;
  176. oldid = mt->trkid;
  177. count = 0;
  178. for (i = 0; i < mt->num_slots; ++i) {
  179. struct input_mt_slot *ps = &mt->slots[i];
  180. int id = input_mt_get_value(ps, ABS_MT_TRACKING_ID);
  181. if (id < 0)
  182. continue;
  183. if ((id - oldid) & TRKID_SGN) {
  184. oldest = ps;
  185. oldid = id;
  186. }
  187. count++;
  188. }
  189. input_event(dev, EV_KEY, BTN_TOUCH, count > 0);
  190. if (use_count)
  191. input_mt_report_finger_count(dev, count);
  192. if (oldest) {
  193. int x = input_mt_get_value(oldest, ABS_MT_POSITION_X);
  194. int y = input_mt_get_value(oldest, ABS_MT_POSITION_Y);
  195. input_event(dev, EV_ABS, ABS_X, x);
  196. input_event(dev, EV_ABS, ABS_Y, y);
  197. if (test_bit(ABS_MT_PRESSURE, dev->absbit)) {
  198. int p = input_mt_get_value(oldest, ABS_MT_PRESSURE);
  199. input_event(dev, EV_ABS, ABS_PRESSURE, p);
  200. }
  201. } else {
  202. if (test_bit(ABS_MT_PRESSURE, dev->absbit))
  203. input_event(dev, EV_ABS, ABS_PRESSURE, 0);
  204. }
  205. }
  206. EXPORT_SYMBOL(input_mt_report_pointer_emulation);
  207. /**
  208. * input_mt_sync_frame() - synchronize mt frame
  209. * @dev: input device with allocated MT slots
  210. *
  211. * Close the frame and prepare the internal state for a new one.
  212. * Depending on the flags, marks unused slots as inactive and performs
  213. * pointer emulation.
  214. */
  215. void input_mt_sync_frame(struct input_dev *dev)
  216. {
  217. struct input_mt *mt = dev->mt;
  218. struct input_mt_slot *s;
  219. if (!mt)
  220. return;
  221. if (mt->flags & INPUT_MT_DROP_UNUSED) {
  222. for (s = mt->slots; s != mt->slots + mt->num_slots; s++) {
  223. if (input_mt_is_used(mt, s))
  224. continue;
  225. input_mt_slot(dev, s - mt->slots);
  226. input_event(dev, EV_ABS, ABS_MT_TRACKING_ID, -1);
  227. }
  228. }
  229. input_mt_report_pointer_emulation(dev, (mt->flags & INPUT_MT_POINTER));
  230. mt->frame++;
  231. }
  232. EXPORT_SYMBOL(input_mt_sync_frame);
  233. static int adjust_dual(int *begin, int step, int *end, int eq)
  234. {
  235. int f, *p, s, c;
  236. if (begin == end)
  237. return 0;
  238. f = *begin;
  239. p = begin + step;
  240. s = p == end ? f + 1 : *p;
  241. for (; p != end; p += step)
  242. if (*p < f)
  243. s = f, f = *p;
  244. else if (*p < s)
  245. s = *p;
  246. c = (f + s + 1) / 2;
  247. if (c == 0 || (c > 0 && !eq))
  248. return 0;
  249. if (s < 0)
  250. c *= 2;
  251. for (p = begin; p != end; p += step)
  252. *p -= c;
  253. return (c < s && s <= 0) || (f >= 0 && f < c);
  254. }
  255. static void find_reduced_matrix(int *w, int nr, int nc, int nrc)
  256. {
  257. int i, k, sum;
  258. for (k = 0; k < nrc; k++) {
  259. for (i = 0; i < nr; i++)
  260. adjust_dual(w + i, nr, w + i + nrc, nr <= nc);
  261. sum = 0;
  262. for (i = 0; i < nrc; i += nr)
  263. sum += adjust_dual(w + i, 1, w + i + nr, nc <= nr);
  264. if (!sum)
  265. break;
  266. }
  267. }
  268. static int input_mt_set_matrix(struct input_mt *mt,
  269. const struct input_mt_pos *pos, int num_pos)
  270. {
  271. const struct input_mt_pos *p;
  272. struct input_mt_slot *s;
  273. int *w = mt->red;
  274. int x, y;
  275. for (s = mt->slots; s != mt->slots + mt->num_slots; s++) {
  276. if (!input_mt_is_active(s))
  277. continue;
  278. x = input_mt_get_value(s, ABS_MT_POSITION_X);
  279. y = input_mt_get_value(s, ABS_MT_POSITION_Y);
  280. for (p = pos; p != pos + num_pos; p++) {
  281. int dx = x - p->x, dy = y - p->y;
  282. *w++ = dx * dx + dy * dy;
  283. }
  284. }
  285. return w - mt->red;
  286. }
  287. static void input_mt_set_slots(struct input_mt *mt,
  288. int *slots, int num_pos)
  289. {
  290. struct input_mt_slot *s;
  291. int *w = mt->red, *p;
  292. for (p = slots; p != slots + num_pos; p++)
  293. *p = -1;
  294. for (s = mt->slots; s != mt->slots + mt->num_slots; s++) {
  295. if (!input_mt_is_active(s))
  296. continue;
  297. for (p = slots; p != slots + num_pos; p++)
  298. if (*w++ < 0)
  299. *p = s - mt->slots;
  300. }
  301. for (s = mt->slots; s != mt->slots + mt->num_slots; s++) {
  302. if (input_mt_is_active(s))
  303. continue;
  304. for (p = slots; p != slots + num_pos; p++)
  305. if (*p < 0) {
  306. *p = s - mt->slots;
  307. break;
  308. }
  309. }
  310. }
  311. /**
  312. * input_mt_assign_slots() - perform a best-match assignment
  313. * @dev: input device with allocated MT slots
  314. * @slots: the slot assignment to be filled
  315. * @pos: the position array to match
  316. * @num_pos: number of positions
  317. *
  318. * Performs a best match against the current contacts and returns
  319. * the slot assignment list. New contacts are assigned to unused
  320. * slots.
  321. *
  322. * Returns zero on success, or negative error in case of failure.
  323. */
  324. int input_mt_assign_slots(struct input_dev *dev, int *slots,
  325. const struct input_mt_pos *pos, int num_pos)
  326. {
  327. struct input_mt *mt = dev->mt;
  328. int nrc;
  329. if (!mt || !mt->red)
  330. return -ENXIO;
  331. if (num_pos > mt->num_slots)
  332. return -EINVAL;
  333. if (num_pos < 1)
  334. return 0;
  335. nrc = input_mt_set_matrix(mt, pos, num_pos);
  336. find_reduced_matrix(mt->red, num_pos, nrc / num_pos, nrc);
  337. input_mt_set_slots(mt, slots, num_pos);
  338. return 0;
  339. }
  340. EXPORT_SYMBOL(input_mt_assign_slots);
  341. /**
  342. * input_mt_get_slot_by_key() - return slot matching key
  343. * @dev: input device with allocated MT slots
  344. * @key: the key of the sought slot
  345. *
  346. * Returns the slot of the given key, if it exists, otherwise
  347. * set the key on the first unused slot and return.
  348. *
  349. * If no available slot can be found, -1 is returned.
  350. */
  351. int input_mt_get_slot_by_key(struct input_dev *dev, int key)
  352. {
  353. struct input_mt *mt = dev->mt;
  354. struct input_mt_slot *s;
  355. if (!mt)
  356. return -1;
  357. for (s = mt->slots; s != mt->slots + mt->num_slots; s++)
  358. if (input_mt_is_active(s) && s->key == key)
  359. return s - mt->slots;
  360. for (s = mt->slots; s != mt->slots + mt->num_slots; s++)
  361. if (!input_mt_is_active(s)) {
  362. s->key = key;
  363. return s - mt->slots;
  364. }
  365. return -1;
  366. }
  367. EXPORT_SYMBOL(input_mt_get_slot_by_key);