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
|
/*
* tslib/src/testutils.c
*
* Copyright (C) 2001 Russell King.
*
* This file is placed under the GPL. Please see the file
* COPYING for more details.
*
* SPDX-License-Identifier: GPL-2.0+
*
*
* Common functions for the test programs
*/
#include "config.h"
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/time.h>
#include "tslib.h"
#include "fbutils.h"
#include "testutils.h"
/* [inactive] border fill text [active] border fill text */
static int button_palette[6] = {
1, 4, 2,
1, 5, 0
};
void button_draw(struct ts_button *button)
{
int s = (button->flags & BUTTON_ACTIVE) ? 3 : 0;
rect(button->x, button->y, button->x + button->w,
button->y + button->h, button_palette[s]);
fillrect(button->x + 1, button->y + 1,
button->x + button->w - 2,
button->y + button->h - 2, button_palette[s + 1]);
put_string_center(button->x + button->w / 2,
button->y + button->h / 2,
button->text, button_palette[s + 2]);
}
int button_handle(struct ts_button *button, int x, int y, unsigned int p)
{
int inside = (x >= button->x) && (y >= button->y) &&
(x < button->x + button->w) &&
(y < button->y + button->h);
if (p > 0) {
if (inside) {
if (!(button->flags & BUTTON_ACTIVE)) {
button->flags |= BUTTON_ACTIVE;
button_draw(button);
}
} else if (button->flags & BUTTON_ACTIVE) {
button->flags &= ~BUTTON_ACTIVE;
button_draw(button);
}
} else if (button->flags & BUTTON_ACTIVE) {
button->flags &= ~BUTTON_ACTIVE;
button_draw(button);
return 1;
}
return 0;
}
static int sort_by_x(const void *a, const void *b)
{
return (((struct ts_sample *)a)->x - ((struct ts_sample *)b)->x);
}
static int sort_by_y(const void *a, const void *b)
{
return (((struct ts_sample *)a)->y - ((struct ts_sample *)b)->y);
}
/* Waits for the screen to be touched, averages x and y sample
* coordinates until the end of contact
*/
void getxy(struct tsdev *ts, int *x, int *y)
{
#define MAX_SAMPLES 128
struct ts_sample samp[MAX_SAMPLES];
int index, middle;
do {
if (ts_read_raw(ts, &samp[0], 1) < 0) {
perror("ts_read_raw");
close_framebuffer();
exit(1);
}
} while (samp[0].pressure == 0);
/* Now collect up to MAX_SAMPLES touches into the samp array. */
index = 0;
do {
if (index < MAX_SAMPLES-1)
index++;
if (ts_read_raw(ts, &samp[index], 1) < 0) {
perror("ts_read_raw");
close_framebuffer();
exit(1);
}
} while (samp[index].pressure > 0);
printf("Took %d samples...\n", index);
/*
* At this point, we have samples in indices zero to (index-1)
* which means that we have (index) number of samples. We want
* to calculate the median of the samples so that wild outliers
* don't skew the result. First off, let's assume that arrays
* are one-based instead of zero-based. If this were the case
* and index was odd, we would need sample number ((index+1)/2)
* of a sorted array; if index was even, we would need the
* average of sample number (index/2) and sample number
* ((index/2)+1). To turn this into something useful for the
* real world, we just need to subtract one off of the sample
* numbers. So for when index is odd, we need sample number
* (((index+1)/2)-1). Due to integer division truncation, we
* can simplify this to just (index/2). When index is even, we
* need the average of sample number ((index/2)-1) and sample
* number (index/2). Calculate (index/2) now and we'll handle
* the even odd stuff after we sort.
*/
middle = index/2;
if (x) {
qsort(samp, index, sizeof(struct ts_sample), sort_by_x);
if (index & 1)
*x = samp[middle].x;
else
*x = (samp[middle-1].x + samp[middle].x) / 2;
}
if (y) {
qsort(samp, index, sizeof(struct ts_sample), sort_by_y);
if (index & 1)
*y = samp[middle].y;
else
*y = (samp[middle-1].y + samp[middle].y) / 2;
}
}
void getxy_validate(struct tsdev *ts, int *x, int *y)
{
#define MAX_SAMPLES 128
struct ts_sample samp[MAX_SAMPLES];
int index;
do {
if (ts_read(ts, &samp[0], 1) < 0) {
perror("ts_read");
close_framebuffer();
exit(1);
}
} while (samp[0].pressure == 0);
/* Now collect up to MAX_SAMPLES touches into the samp array. */
index = 0;
do {
if (index < MAX_SAMPLES-1)
index++;
if (ts_read(ts, &samp[index], 1) < 0) {
perror("ts_read");
close_framebuffer();
exit(1);
}
} while (samp[index].pressure > 0);
printf("Took %d samples...\n", index);
if (x)
*x = samp[index - 1].x;
if (y)
*y = samp[index - 1].y;
}
void ts_flush(struct tsdev *ts)
{
/* Read all unread touchscreen data,
* so that we are sure that the next data that we read
* have been input after this flushing.
*/
#define TS_BUFFER_MAX 32768
static char buffer[TS_BUFFER_MAX];
if (read(ts_fd(ts), buffer, TS_BUFFER_MAX) == -1)
fprintf(stderr, "ts_flush read error\n");
}
void print_version(void)
{
printf("%s", tslib_version());
}
|
