summaryrefslogtreecommitdiff
path: root/include/linux/input
diff options
context:
space:
mode:
authorHenrik Rydberg <rydberg@bitmath.org>2015-02-01 22:25:14 +0300
committerDmitry Torokhov <dmitry.torokhov@gmail.com>2015-02-01 22:50:35 +0300
commit448c7f3830ca283e485aa943279acea6bde8b270 (patch)
tree9e5b1ce72aa87035bc73595d2ce925bacec6a155 /include/linux/input
parent60bcaae15e0bd7f24d004ef2c9b3c8acb34b688d (diff)
downloadlinux-448c7f3830ca283e485aa943279acea6bde8b270.tar.xz
Input: MT - add support for balanced slot assignment
Some devices are not fast enough to differentiate between a fast-moving contact and a new contact. This problem cannot be fully resolved because information is truly missing, but it is possible to safe-guard against obvious mistakes by restricting movement with a maximum displacement. The new problem formulation for dmax > 0 cannot benefit from the speedup for positive definite matrices, but since the convergence is faster, the result is about the same. For a handful of contacts, the latency difference is truly negligible. Suggested-by: Benjamin Tissoires <benjamin.tissoires@redhat.com> Tested-by: Benjamin Tissoires <benjamin.tissoires@redhat.com> Signed-off-by: Henrik Rydberg <rydberg@bitmath.org> Signed-off-by: Dmitry Torokhov <dmitry.torokhov@gmail.com>
Diffstat (limited to 'include/linux/input')
-rw-r--r--include/linux/input/mt.h3
1 files changed, 2 insertions, 1 deletions
diff --git a/include/linux/input/mt.h b/include/linux/input/mt.h
index f583ff639776..d7188de4db96 100644
--- a/include/linux/input/mt.h
+++ b/include/linux/input/mt.h
@@ -119,7 +119,8 @@ struct input_mt_pos {
};
int input_mt_assign_slots(struct input_dev *dev, int *slots,
- const struct input_mt_pos *pos, int num_pos);
+ const struct input_mt_pos *pos, int num_pos,
+ int dmax);
int input_mt_get_slot_by_key(struct input_dev *dev, int key);