blob: 690e0a11c82ed4c4f37decd73d4e1b455d205bc5 [file] [log] [blame]
Jeff Brown5912f952013-07-01 19:10:31 -07001/*
2 * Copyright (C) 2010 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#ifndef _LIBINPUT_INPUT_TRANSPORT_H
18#define _LIBINPUT_INPUT_TRANSPORT_H
19
Robert Carr2c358bf2018-08-08 15:58:15 -070020#pragma GCC system_header
21
Jeff Brown5912f952013-07-01 19:10:31 -070022/**
23 * Native input transport.
24 *
25 * The InputChannel provides a mechanism for exchanging InputMessage structures across processes.
26 *
27 * The InputPublisher and InputConsumer each handle one end-point of an input channel.
28 * The InputPublisher is used by the input dispatcher to send events to the application.
29 * The InputConsumer is used by the application to receive events from the input dispatcher.
30 */
31
Siarhei Vishniakouec8f7252018-07-06 11:19:32 +010032#include <string>
33
Atif Niyaz3d3fa522019-07-25 11:12:39 -070034#include <android-base/chrono_utils.h>
35
Robert Carr803535b2018-08-02 16:38:15 -070036#include <binder/IBinder.h>
Jeff Brown5912f952013-07-01 19:10:31 -070037#include <input/Input.h>
Atif Niyaz3d3fa522019-07-25 11:12:39 -070038#include <input/LatencyStatistics.h>
Jeff Brown5912f952013-07-01 19:10:31 -070039#include <utils/BitSet.h>
Atif Niyaz3d3fa522019-07-25 11:12:39 -070040#include <utils/Errors.h>
41#include <utils/RefBase.h>
42#include <utils/Timers.h>
43#include <utils/Vector.h>
Jeff Brown5912f952013-07-01 19:10:31 -070044
45namespace android {
Robert Carr3720ed02018-08-08 16:08:27 -070046class Parcel;
Jeff Brown5912f952013-07-01 19:10:31 -070047
48/*
49 * Intermediate representation used to send input events and related signals.
Fengwei Yin83e0e422014-05-24 05:32:09 +080050 *
51 * Note that this structure is used for IPCs so its layout must be identical
52 * on 64 and 32 bit processes. This is tested in StructLayout_test.cpp.
Siarhei Vishniakou1f7c0e42018-11-16 22:18:53 -080053 *
54 * Since the struct must be aligned to an 8-byte boundary, there could be uninitialized bytes
55 * in-between the defined fields. This padding data should be explicitly accounted for by adding
56 * "empty" fields into the struct. This data is memset to zero before sending the struct across
57 * the socket. Adding the explicit fields ensures that the memset is not optimized away by the
58 * compiler. When a new field is added to the struct, the corresponding change
59 * in StructLayout_test should be made.
Jeff Brown5912f952013-07-01 19:10:31 -070060 */
61struct InputMessage {
62 enum {
63 TYPE_KEY = 1,
64 TYPE_MOTION = 2,
65 TYPE_FINISHED = 3,
66 };
67
68 struct Header {
69 uint32_t type;
Fengwei Yin83e0e422014-05-24 05:32:09 +080070 // We don't need this field in order to align the body below but we
71 // leave it here because InputMessage::size() and other functions
72 // compute the size of this structure as sizeof(Header) + sizeof(Body).
73 uint32_t padding;
Jeff Brown5912f952013-07-01 19:10:31 -070074 } header;
75
Fengwei Yin83e0e422014-05-24 05:32:09 +080076 // Body *must* be 8 byte aligned.
Jeff Brown5912f952013-07-01 19:10:31 -070077 union Body {
78 struct Key {
79 uint32_t seq;
Siarhei Vishniakou1f7c0e42018-11-16 22:18:53 -080080 uint32_t empty1;
Fengwei Yin83e0e422014-05-24 05:32:09 +080081 nsecs_t eventTime __attribute__((aligned(8)));
Jeff Brown5912f952013-07-01 19:10:31 -070082 int32_t deviceId;
83 int32_t source;
Siarhei Vishniakoua62a8dd2018-06-08 21:17:33 +010084 int32_t displayId;
Jeff Brown5912f952013-07-01 19:10:31 -070085 int32_t action;
86 int32_t flags;
87 int32_t keyCode;
88 int32_t scanCode;
89 int32_t metaState;
90 int32_t repeatCount;
Siarhei Vishniakou1f7c0e42018-11-16 22:18:53 -080091 uint32_t empty2;
Fengwei Yin83e0e422014-05-24 05:32:09 +080092 nsecs_t downTime __attribute__((aligned(8)));
Jeff Brown5912f952013-07-01 19:10:31 -070093
94 inline size_t size() const {
95 return sizeof(Key);
96 }
97 } key;
98
99 struct Motion {
100 uint32_t seq;
Siarhei Vishniakou1f7c0e42018-11-16 22:18:53 -0800101 uint32_t empty1;
Fengwei Yin83e0e422014-05-24 05:32:09 +0800102 nsecs_t eventTime __attribute__((aligned(8)));
Jeff Brown5912f952013-07-01 19:10:31 -0700103 int32_t deviceId;
104 int32_t source;
Tarandeep Singh58641502017-07-31 10:51:54 -0700105 int32_t displayId;
Jeff Brown5912f952013-07-01 19:10:31 -0700106 int32_t action;
Michael Wright7b159c92015-05-14 14:48:03 +0100107 int32_t actionButton;
Jeff Brown5912f952013-07-01 19:10:31 -0700108 int32_t flags;
109 int32_t metaState;
110 int32_t buttonState;
Siarhei Vishniakou16a2e302019-01-14 19:21:45 -0800111 MotionClassification classification; // base type: uint8_t
112 uint8_t empty2[3];
Jeff Brown5912f952013-07-01 19:10:31 -0700113 int32_t edgeFlags;
Fengwei Yin83e0e422014-05-24 05:32:09 +0800114 nsecs_t downTime __attribute__((aligned(8)));
Jeff Brown5912f952013-07-01 19:10:31 -0700115 float xOffset;
116 float yOffset;
117 float xPrecision;
118 float yPrecision;
Garfield Tan00f511d2019-06-12 16:55:40 -0700119 float xCursorPosition;
120 float yCursorPosition;
Narayan Kamathed5fd382014-05-02 17:53:33 +0100121 uint32_t pointerCount;
Siarhei Vishniakou1f7c0e42018-11-16 22:18:53 -0800122 uint32_t empty3;
Fengwei Yin83e0e422014-05-24 05:32:09 +0800123 // Note that PointerCoords requires 8 byte alignment.
Michael Wrightb03f1032015-05-14 16:29:13 +0100124 struct Pointer {
Jeff Brown5912f952013-07-01 19:10:31 -0700125 PointerProperties properties;
126 PointerCoords coords;
127 } pointers[MAX_POINTERS];
128
129 int32_t getActionId() const {
130 uint32_t index = (action & AMOTION_EVENT_ACTION_POINTER_INDEX_MASK)
131 >> AMOTION_EVENT_ACTION_POINTER_INDEX_SHIFT;
132 return pointers[index].properties.id;
133 }
134
135 inline size_t size() const {
136 return sizeof(Motion) - sizeof(Pointer) * MAX_POINTERS
137 + sizeof(Pointer) * pointerCount;
138 }
139 } motion;
140
141 struct Finished {
142 uint32_t seq;
143 bool handled;
144
145 inline size_t size() const {
146 return sizeof(Finished);
147 }
148 } finished;
Fengwei Yin83e0e422014-05-24 05:32:09 +0800149 } __attribute__((aligned(8))) body;
Jeff Brown5912f952013-07-01 19:10:31 -0700150
151 bool isValid(size_t actualSize) const;
152 size_t size() const;
Siarhei Vishniakou1f7c0e42018-11-16 22:18:53 -0800153 void getSanitizedCopy(InputMessage* msg) const;
Jeff Brown5912f952013-07-01 19:10:31 -0700154};
155
156/*
157 * An input channel consists of a local unix domain socket used to send and receive
158 * input messages across processes. Each channel has a descriptive name for debugging purposes.
159 *
160 * Each endpoint has its own InputChannel object that specifies its file descriptor.
161 *
162 * The input channel is closed when all references to it are released.
163 */
164class InputChannel : public RefBase {
165protected:
166 virtual ~InputChannel();
167
168public:
Robert Carr3720ed02018-08-08 16:08:27 -0700169 InputChannel() = default;
Siarhei Vishniakouf93fcf42017-11-22 16:00:14 -0800170 InputChannel(const std::string& name, int fd);
Jeff Brown5912f952013-07-01 19:10:31 -0700171
172 /* Creates a pair of input channels.
173 *
174 * Returns OK on success.
175 */
Siarhei Vishniakouf93fcf42017-11-22 16:00:14 -0800176 static status_t openInputChannelPair(const std::string& name,
Jeff Brown5912f952013-07-01 19:10:31 -0700177 sp<InputChannel>& outServerChannel, sp<InputChannel>& outClientChannel);
178
Siarhei Vishniakouf93fcf42017-11-22 16:00:14 -0800179 inline std::string getName() const { return mName; }
Jeff Brown5912f952013-07-01 19:10:31 -0700180 inline int getFd() const { return mFd; }
181
182 /* Sends a message to the other endpoint.
183 *
184 * If the channel is full then the message is guaranteed not to have been sent at all.
185 * Try again after the consumer has sent a finished signal indicating that it has
186 * consumed some of the pending messages from the channel.
187 *
188 * Returns OK on success.
189 * Returns WOULD_BLOCK if the channel is full.
190 * Returns DEAD_OBJECT if the channel's peer has been closed.
191 * Other errors probably indicate that the channel is broken.
192 */
193 status_t sendMessage(const InputMessage* msg);
194
195 /* Receives a message sent by the other endpoint.
196 *
197 * If there is no message present, try again after poll() indicates that the fd
198 * is readable.
199 *
200 * Returns OK on success.
201 * Returns WOULD_BLOCK if there is no message present.
202 * Returns DEAD_OBJECT if the channel's peer has been closed.
203 * Other errors probably indicate that the channel is broken.
204 */
205 status_t receiveMessage(InputMessage* msg);
206
207 /* Returns a new object that has a duplicate of this channel's fd. */
208 sp<InputChannel> dup() const;
209
Robert Carr3720ed02018-08-08 16:08:27 -0700210 status_t write(Parcel& out) const;
211 status_t read(const Parcel& from);
212
Robert Carr803535b2018-08-02 16:38:15 -0700213 sp<IBinder> getToken() const;
214 void setToken(const sp<IBinder>& token);
215
Jeff Brown5912f952013-07-01 19:10:31 -0700216private:
Robert Carr3720ed02018-08-08 16:08:27 -0700217 void setFd(int fd);
218
Siarhei Vishniakouf93fcf42017-11-22 16:00:14 -0800219 std::string mName;
Robert Carr3720ed02018-08-08 16:08:27 -0700220 int mFd = -1;
Robert Carr803535b2018-08-02 16:38:15 -0700221
222 sp<IBinder> mToken = nullptr;
Jeff Brown5912f952013-07-01 19:10:31 -0700223};
224
225/*
226 * Publishes input events to an input channel.
227 */
228class InputPublisher {
229public:
230 /* Creates a publisher associated with an input channel. */
231 explicit InputPublisher(const sp<InputChannel>& channel);
232
233 /* Destroys the publisher and releases its input channel. */
234 ~InputPublisher();
235
236 /* Gets the underlying input channel. */
237 inline sp<InputChannel> getChannel() { return mChannel; }
238
239 /* Publishes a key event to the input channel.
240 *
241 * Returns OK on success.
242 * Returns WOULD_BLOCK if the channel is full.
243 * Returns DEAD_OBJECT if the channel's peer has been closed.
244 * Returns BAD_VALUE if seq is 0.
245 * Other errors probably indicate that the channel is broken.
246 */
247 status_t publishKeyEvent(
248 uint32_t seq,
249 int32_t deviceId,
250 int32_t source,
Siarhei Vishniakoua62a8dd2018-06-08 21:17:33 +0100251 int32_t displayId,
Jeff Brown5912f952013-07-01 19:10:31 -0700252 int32_t action,
253 int32_t flags,
254 int32_t keyCode,
255 int32_t scanCode,
256 int32_t metaState,
257 int32_t repeatCount,
258 nsecs_t downTime,
259 nsecs_t eventTime);
260
261 /* Publishes a motion event to the input channel.
262 *
263 * Returns OK on success.
264 * Returns WOULD_BLOCK if the channel is full.
265 * Returns DEAD_OBJECT if the channel's peer has been closed.
266 * Returns BAD_VALUE if seq is 0 or if pointerCount is less than 1 or greater than MAX_POINTERS.
267 * Other errors probably indicate that the channel is broken.
268 */
Garfield Tan00f511d2019-06-12 16:55:40 -0700269 status_t publishMotionEvent(uint32_t seq, int32_t deviceId, int32_t source, int32_t displayId,
270 int32_t action, int32_t actionButton, int32_t flags,
271 int32_t edgeFlags, int32_t metaState, int32_t buttonState,
272 MotionClassification classification, float xOffset, float yOffset,
273 float xPrecision, float yPrecision, float xCursorPosition,
274 float yCursorPosition, nsecs_t downTime, nsecs_t eventTime,
275 uint32_t pointerCount, const PointerProperties* pointerProperties,
276 const PointerCoords* pointerCoords);
Jeff Brown5912f952013-07-01 19:10:31 -0700277
278 /* Receives the finished signal from the consumer in reply to the original dispatch signal.
279 * If a signal was received, returns the message sequence number,
280 * and whether the consumer handled the message.
281 *
282 * The returned sequence number is never 0 unless the operation failed.
283 *
284 * Returns OK on success.
285 * Returns WOULD_BLOCK if there is no signal present.
286 * Returns DEAD_OBJECT if the channel's peer has been closed.
287 * Other errors probably indicate that the channel is broken.
288 */
289 status_t receiveFinishedSignal(uint32_t* outSeq, bool* outHandled);
290
291private:
Atif Niyaz3d3fa522019-07-25 11:12:39 -0700292 static constexpr std::chrono::duration TOUCH_STATS_REPORT_PERIOD = 5min;
293
Jeff Brown5912f952013-07-01 19:10:31 -0700294 sp<InputChannel> mChannel;
Atif Niyaz3d3fa522019-07-25 11:12:39 -0700295 LatencyStatistics mTouchStatistics{TOUCH_STATS_REPORT_PERIOD};
296
297 void reportTouchEventForStatistics(nsecs_t evdevTime);
Jeff Brown5912f952013-07-01 19:10:31 -0700298};
299
300/*
301 * Consumes input events from an input channel.
302 */
303class InputConsumer {
304public:
305 /* Creates a consumer associated with an input channel. */
306 explicit InputConsumer(const sp<InputChannel>& channel);
307
308 /* Destroys the consumer and releases its input channel. */
309 ~InputConsumer();
310
311 /* Gets the underlying input channel. */
312 inline sp<InputChannel> getChannel() { return mChannel; }
313
314 /* Consumes an input event from the input channel and copies its contents into
315 * an InputEvent object created using the specified factory.
316 *
317 * Tries to combine a series of move events into larger batches whenever possible.
318 *
319 * If consumeBatches is false, then defers consuming pending batched events if it
320 * is possible for additional samples to be added to them later. Call hasPendingBatch()
321 * to determine whether a pending batch is available to be consumed.
322 *
323 * If consumeBatches is true, then events are still batched but they are consumed
324 * immediately as soon as the input channel is exhausted.
325 *
326 * The frameTime parameter specifies the time when the current display frame started
327 * rendering in the CLOCK_MONOTONIC time base, or -1 if unknown.
328 *
329 * The returned sequence number is never 0 unless the operation failed.
330 *
331 * Returns OK on success.
332 * Returns WOULD_BLOCK if there is no event present.
333 * Returns DEAD_OBJECT if the channel's peer has been closed.
334 * Returns NO_MEMORY if the event could not be created.
335 * Other errors probably indicate that the channel is broken.
336 */
337 status_t consume(InputEventFactoryInterface* factory, bool consumeBatches,
Siarhei Vishniakou777a10b2018-01-31 16:45:06 -0800338 nsecs_t frameTime, uint32_t* outSeq, InputEvent** outEvent);
Jeff Brown5912f952013-07-01 19:10:31 -0700339
340 /* Sends a finished signal to the publisher to inform it that the message
341 * with the specified sequence number has finished being process and whether
342 * the message was handled by the consumer.
343 *
344 * Returns OK on success.
345 * Returns BAD_VALUE if seq is 0.
346 * Other errors probably indicate that the channel is broken.
347 */
348 status_t sendFinishedSignal(uint32_t seq, bool handled);
349
350 /* Returns true if there is a deferred event waiting.
351 *
352 * Should be called after calling consume() to determine whether the consumer
353 * has a deferred event to be processed. Deferred events are somewhat special in
354 * that they have already been removed from the input channel. If the input channel
355 * becomes empty, the client may need to do extra work to ensure that it processes
356 * the deferred event despite the fact that the input channel's file descriptor
357 * is not readable.
358 *
359 * One option is simply to call consume() in a loop until it returns WOULD_BLOCK.
360 * This guarantees that all deferred events will be processed.
361 *
362 * Alternately, the caller can call hasDeferredEvent() to determine whether there is
363 * a deferred event waiting and then ensure that its event loop wakes up at least
364 * one more time to consume the deferred event.
365 */
366 bool hasDeferredEvent() const;
367
368 /* Returns true if there is a pending batch.
369 *
370 * Should be called after calling consume() with consumeBatches == false to determine
371 * whether consume() should be called again later on with consumeBatches == true.
372 */
373 bool hasPendingBatch() const;
374
375private:
376 // True if touch resampling is enabled.
377 const bool mResampleTouch;
378
379 // The input channel.
380 sp<InputChannel> mChannel;
381
382 // The current input message.
383 InputMessage mMsg;
384
385 // True if mMsg contains a valid input message that was deferred from the previous
386 // call to consume and that still needs to be handled.
387 bool mMsgDeferred;
388
389 // Batched motion events per device and source.
390 struct Batch {
391 Vector<InputMessage> samples;
392 };
393 Vector<Batch> mBatches;
394
395 // Touch state per device and source, only for sources of class pointer.
396 struct History {
397 nsecs_t eventTime;
398 BitSet32 idBits;
399 int32_t idToIndex[MAX_POINTER_ID + 1];
400 PointerCoords pointers[MAX_POINTERS];
401
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100402 void initializeFrom(const InputMessage& msg) {
403 eventTime = msg.body.motion.eventTime;
Jeff Brown5912f952013-07-01 19:10:31 -0700404 idBits.clear();
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100405 for (uint32_t i = 0; i < msg.body.motion.pointerCount; i++) {
406 uint32_t id = msg.body.motion.pointers[i].properties.id;
Jeff Brown5912f952013-07-01 19:10:31 -0700407 idBits.markBit(id);
408 idToIndex[id] = i;
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100409 pointers[i].copyFrom(msg.body.motion.pointers[i].coords);
Jeff Brown5912f952013-07-01 19:10:31 -0700410 }
411 }
412
Siarhei Vishniakou56c9ae12017-11-06 21:16:47 -0800413 void initializeFrom(const History& other) {
414 eventTime = other.eventTime;
415 idBits = other.idBits; // temporary copy
416 for (size_t i = 0; i < other.idBits.count(); i++) {
417 uint32_t id = idBits.clearFirstMarkedBit();
418 int32_t index = other.idToIndex[id];
419 idToIndex[id] = index;
420 pointers[index].copyFrom(other.pointers[index]);
421 }
422 idBits = other.idBits; // final copy
423 }
424
Jeff Brown5912f952013-07-01 19:10:31 -0700425 const PointerCoords& getPointerById(uint32_t id) const {
426 return pointers[idToIndex[id]];
427 }
Siarhei Vishniakouc7dc3782017-08-24 20:36:28 -0700428
429 bool hasPointerId(uint32_t id) const {
430 return idBits.hasBit(id);
431 }
Jeff Brown5912f952013-07-01 19:10:31 -0700432 };
433 struct TouchState {
434 int32_t deviceId;
435 int32_t source;
436 size_t historyCurrent;
437 size_t historySize;
438 History history[2];
439 History lastResample;
440
441 void initialize(int32_t deviceId, int32_t source) {
442 this->deviceId = deviceId;
443 this->source = source;
444 historyCurrent = 0;
445 historySize = 0;
446 lastResample.eventTime = 0;
447 lastResample.idBits.clear();
448 }
449
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100450 void addHistory(const InputMessage& msg) {
Jeff Brown5912f952013-07-01 19:10:31 -0700451 historyCurrent ^= 1;
452 if (historySize < 2) {
453 historySize += 1;
454 }
455 history[historyCurrent].initializeFrom(msg);
456 }
457
458 const History* getHistory(size_t index) const {
459 return &history[(historyCurrent + index) & 1];
460 }
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100461
462 bool recentCoordinatesAreIdentical(uint32_t id) const {
463 // Return true if the two most recently received "raw" coordinates are identical
464 if (historySize < 2) {
465 return false;
466 }
Siarhei Vishniakouc7dc3782017-08-24 20:36:28 -0700467 if (!getHistory(0)->hasPointerId(id) || !getHistory(1)->hasPointerId(id)) {
468 return false;
469 }
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100470 float currentX = getHistory(0)->getPointerById(id).getX();
471 float currentY = getHistory(0)->getPointerById(id).getY();
472 float previousX = getHistory(1)->getPointerById(id).getX();
473 float previousY = getHistory(1)->getPointerById(id).getY();
474 if (currentX == previousX && currentY == previousY) {
475 return true;
476 }
477 return false;
478 }
Jeff Brown5912f952013-07-01 19:10:31 -0700479 };
480 Vector<TouchState> mTouchStates;
481
482 // Chain of batched sequence numbers. When multiple input messages are combined into
483 // a batch, we append a record here that associates the last sequence number in the
484 // batch with the previous one. When the finished signal is sent, we traverse the
485 // chain to individually finish all input messages that were part of the batch.
486 struct SeqChain {
487 uint32_t seq; // sequence number of batched input message
488 uint32_t chain; // sequence number of previous batched input message
489 };
490 Vector<SeqChain> mSeqChains;
491
492 status_t consumeBatch(InputEventFactoryInterface* factory,
Siarhei Vishniakou777a10b2018-01-31 16:45:06 -0800493 nsecs_t frameTime, uint32_t* outSeq, InputEvent** outEvent);
Jeff Brown5912f952013-07-01 19:10:31 -0700494 status_t consumeSamples(InputEventFactoryInterface* factory,
Siarhei Vishniakou777a10b2018-01-31 16:45:06 -0800495 Batch& batch, size_t count, uint32_t* outSeq, InputEvent** outEvent);
Jeff Brown5912f952013-07-01 19:10:31 -0700496
Siarhei Vishniakou086a02a2017-06-12 15:01:41 +0100497 void updateTouchState(InputMessage& msg);
Jeff Brown5912f952013-07-01 19:10:31 -0700498 void resampleTouchState(nsecs_t frameTime, MotionEvent* event,
499 const InputMessage *next);
500
501 ssize_t findBatch(int32_t deviceId, int32_t source) const;
502 ssize_t findTouchState(int32_t deviceId, int32_t source) const;
503
504 status_t sendUnchainedFinishedSignal(uint32_t seq, bool handled);
505
Siarhei Vishniakou56c9ae12017-11-06 21:16:47 -0800506 static void rewriteMessage(TouchState& state, InputMessage& msg);
Jeff Brown5912f952013-07-01 19:10:31 -0700507 static void initializeKeyEvent(KeyEvent* event, const InputMessage* msg);
508 static void initializeMotionEvent(MotionEvent* event, const InputMessage* msg);
509 static void addSample(MotionEvent* event, const InputMessage* msg);
510 static bool canAddSample(const Batch& batch, const InputMessage* msg);
511 static ssize_t findSampleNoLaterThan(const Batch& batch, nsecs_t time);
512 static bool shouldResampleTool(int32_t toolType);
513
514 static bool isTouchResamplingEnabled();
515};
516
517} // namespace android
518
519#endif // _LIBINPUT_INPUT_TRANSPORT_H