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
381
382
383
384
385
386
387
388
|
/*
* Copyright © 2014, 2015 Intel Corporation
*
* 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.
*
* Authors:
* Daniel Vetter <daniel.vetter@ffwll.ch>
*
*/
#ifndef IGT_AUX_H
#define IGT_AUX_H
#include <intel_bufmgr.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stddef.h>
#include <sys/time.h>
#include <i915/gem_submission.h>
extern drm_intel_bo **trash_bos;
extern int num_trash_bos;
/* signal interrupt helpers */
#define MSEC_PER_SEC (1000)
#define USEC_PER_SEC (1000*MSEC_PER_SEC)
#define NSEC_PER_SEC (1000*USEC_PER_SEC)
/* signal interrupt helpers */
#define gettid() syscall(__NR_gettid)
#define sigev_notify_thread_id _sigev_un._tid
/* auxialiary igt helpers from igt_aux.c */
/* generally useful helpers */
void igt_fork_signal_helper(void);
void igt_stop_signal_helper(void);
void igt_suspend_signal_helper(void);
void igt_resume_signal_helper(void);
void igt_fork_shrink_helper(int fd);
void igt_stop_shrink_helper(void);
void igt_fork_hang_detector(int fd);
void igt_stop_hang_detector(void);
struct __igt_sigiter {
unsigned pass;
};
bool __igt_sigiter_continue(struct __igt_sigiter *iter, bool interrupt);
/**
* igt_while_interruptible:
* @enable: enable igt_ioctl interrupting or not
*
* Provides control flow such that all drmIoctl() (strictly igt_ioctl())
* within the loop are forcibly injected with signals (SIGRTMIN).
*
* This is useful to exercise ioctl error paths, at least where those can be
* exercises by interrupting blocking waits, like stalling for the gpu.
*
* The code block attached to this macro is run in a loop with doubling the
* interrupt timeout on each ioctl for every run, until no ioctl gets
* interrupted any more. The starting timeout is taken to be the signal delivery
* latency, measured at runtime. This way the any ioctls called from this code
* block should be exhaustively tested for all signal interruption paths.
*
* Note that since this overloads the igt_ioctl(), this method is not useful
* for widespread signal injection, for example providing coverage of
* pagefaults. To interrupt everything, see igt_fork_signal_helper().
*/
#define igt_while_interruptible(enable) \
for (struct __igt_sigiter iter__={}; __igt_sigiter_continue(&iter__, (enable)); )
/**
* igt_until_timeout:
* @timeout: timeout in seconds
*
* Convenience macro loop to run the provided code block in a loop until the
* timeout has expired. Of course when an individual execution takes too long,
* the actual execution time could be a lot longer.
*
* The code block will be executed at least once.
*/
#define igt_until_timeout(timeout) \
for (struct timespec t__={}; igt_seconds_elapsed(&t__) < (timeout); )
/**
* igt_for_milliseconds:
* @time: how long to run the loop in milliseconds
*
* Convenience macro loop to run the provided code block in a loop until the
* target interval has expired. Of course when an individual execution takes
* too long, the actual execution time could be a lot longer.
*
* The code block will be executed at least once.
*/
#define igt_for_milliseconds(t) \
for (struct timespec t__={}; igt_nsec_elapsed(&t__)>>20 < (t); )
void igt_exchange_int(void *array, unsigned i, unsigned j);
void igt_exchange_int64(void *array, unsigned i, unsigned j);
void igt_permute_array(void *array, unsigned size,
void (*exchange_func)(void *array,
unsigned i,
unsigned j));
void igt_progress(const char *header, uint64_t i, uint64_t total);
void igt_print_activity(void);
bool igt_check_boolean_env_var(const char *env_var, bool default_value);
bool igt_aub_dump_enabled(void);
/* helpers based upon the libdrm buffer manager */
void igt_init_aperture_trashers(drm_intel_bufmgr *bufmgr);
void igt_trash_aperture(void);
void igt_cleanup_aperture_trashers(void);
/* suspend/hibernate and auto-resume system */
/**
* igt_suspend_state:
* @SUSPEND_STATE_FREEZE: suspend-to-idle target state, aka S0ix or freeze,
* first non-hibernation state
* @SUSPEND_STATE_STANDBY: standby target state, aka S1, second
* non-hibernation state
* @SUSPEND_STATE_MEM: suspend-to-mem target state aka S3, third
* non-hibernation state
* @SUSPEND_STATE_DISK: suspend-to-disk target state, aka S4 or hibernation
*
* Target suspend states used with igt_system_suspend_autoresume().
* See /sys/power/state for the available states on a given machine.
*/
enum igt_suspend_state {
SUSPEND_STATE_FREEZE,
SUSPEND_STATE_STANDBY,
SUSPEND_STATE_MEM,
SUSPEND_STATE_DISK,
/*< private >*/
SUSPEND_STATE_NUM,
};
/**
* igt_suspend_test:
* @SUSPEND_TEST_NONE: no testing, perform a full suspend/resume cycle
* @SUSPEND_TEST_FREEZER: complete cycle after freezing all freezable threads
* @SUSPEND_TEST_DEVICES: complete cycle after the above step and suspending
* devices (before calling the drivers' suspend late and
* no_irq hooks). Platform and system devices are not
* suspended here, see #SUSPEND_TEST_CORE.
* @SUSPEND_TEST_PLATFORM: complete cycle after all the above steps and calling
* the ACPI platform global control methods (applies
* only with /sys/power/disk set to platform)
* @SUSPEND_TEST_PROCESSORS: complete cycle after all the above steps and
* disabling non-boot CPUs
* @SUSPEND_TEST_CORE: complete cycle after all the above steps and suspending
* platform and system devices
*
* Test points used with igt_system_suspend_autoresume(). Specifies if and where
* the suspend sequence is to be terminated.
*/
enum igt_suspend_test {
SUSPEND_TEST_NONE,
SUSPEND_TEST_FREEZER,
SUSPEND_TEST_DEVICES,
SUSPEND_TEST_PLATFORM,
SUSPEND_TEST_PROCESSORS,
SUSPEND_TEST_CORE,
/*< private >*/
SUSPEND_TEST_NUM,
};
void igt_system_suspend_autoresume(enum igt_suspend_state state,
enum igt_suspend_test test);
void igt_set_autoresume_delay(int delay_secs);
int igt_get_autoresume_delay(enum igt_suspend_state state);
/* dropping priviledges */
void igt_drop_root(void);
void igt_debug_wait_for_keypress(const char *var);
void igt_debug_manual_check(const char *var, const char *expected);
/* sysinfo cross-arch wrappers from intel_os.c */
/* These are separate to allow easier testing when porting, see the comment at
* the bottom of intel_os.c. */
void intel_purge_vm_caches(int fd);
uint64_t intel_get_avail_ram_mb(void);
uint64_t intel_get_total_ram_mb(void);
uint64_t intel_get_total_swap_mb(void);
int __intel_check_memory(uint64_t count, uint64_t size, unsigned mode,
uint64_t *out_required, uint64_t *out_total);
void intel_require_memory(uint64_t count, uint64_t size, unsigned mode);
void intel_require_files(uint64_t count);
#define CHECK_RAM 0x1
#define CHECK_SWAP 0x2
#define min(a, b) ({ \
typeof(a) _a = (a); \
typeof(b) _b = (b); \
_a < _b ? _a : _b; \
})
#define max(a, b) ({ \
typeof(a) _a = (a); \
typeof(b) _b = (b); \
_a > _b ? _a : _b; \
})
#define igt_swap(a, b) do { \
typeof(a) _tmp = (a); \
(a) = (b); \
(b) = _tmp; \
} while (0)
void igt_lock_mem(size_t size);
void igt_unlock_mem(void);
/**
* igt_wait:
* @COND: condition to wait
* @timeout_ms: timeout in milliseconds
* @interval_ms: amount of time we try to sleep between COND checks
*
* Waits until COND evaluates to true or the timeout passes.
*
* It is safe to call this macro if the signal helper is active. The only
* problem is that the usleep() calls will return early, making us evaluate COND
* too often, possibly eating valuable CPU cycles.
*
* Returns:
* True of COND evaluated to true, false otherwise.
*/
#define igt_wait(COND, timeout_ms, interval_ms) ({ \
const unsigned long interval_us__ = 1000 * (interval_ms); \
const unsigned long timeout_ms__ = (timeout_ms); \
struct timespec tv__ = {}; \
bool ret__; \
\
do { \
uint64_t elapsed__ = igt_nsec_elapsed(&tv__) >> 20; \
\
if (COND) { \
igt_debug("%s took %"PRIu64"ms\n", #COND, elapsed__); \
ret__ = true; \
break; \
} \
if (elapsed__ > timeout_ms__) { \
ret__ = false; \
break; \
} \
\
usleep(interval_us__); \
} while (1); \
\
ret__; \
})
struct igt_mean;
void igt_start_siglatency(int sig); /* 0 => SIGRTMIN (default) */
double igt_stop_siglatency(struct igt_mean *result);
void igt_set_module_param(const char *name, const char *val);
void igt_set_module_param_int(const char *name, int val);
int igt_terminate_process(int sig, const char *comm);
void igt_lsof(const char *dpath);
/*
* This list data structure is a verbatim copy from wayland-util.h from the
* Wayland project; except that wl_ prefix has been removed.
*/
struct igt_list {
struct igt_list *prev;
struct igt_list *next;
};
#define __IGT_INIT_LIST(name) { &(name), &(name) }
#define IGT_LIST(name) struct igt_list name = __IGT_INIT_LIST(name)
static inline void igt_list_init(struct igt_list *list)
{
list->prev = list;
list->next = list;
}
static inline void __igt_list_add(struct igt_list *list,
struct igt_list *prev,
struct igt_list *next)
{
next->prev = list;
list->next = next;
list->prev = prev;
prev->next = list;
}
static inline void igt_list_add(struct igt_list *elm, struct igt_list *list)
{
__igt_list_add(elm, list, list->next);
}
static inline void igt_list_add_tail(struct igt_list *elm,
struct igt_list *list)
{
__igt_list_add(elm, list->prev, list);
}
static inline void __igt_list_del(struct igt_list *prev, struct igt_list *next)
{
next->prev = prev;
prev->next = next;
}
static inline void igt_list_del(struct igt_list *elm)
{
__igt_list_del(elm->prev, elm->next);
}
static inline void igt_list_move(struct igt_list *elm, struct igt_list *list)
{
igt_list_del(elm);
igt_list_add(elm, list);
}
static inline void igt_list_move_tail(struct igt_list *elm,
struct igt_list *list)
{
igt_list_del(elm);
igt_list_add_tail(elm, list);
}
static inline bool igt_list_empty(const struct igt_list *list)
{
return list->next == list;
}
#define container_of(ptr, sample, member) \
(typeof(sample))((char *)(ptr) - offsetof(typeof(*sample), member))
#define igt_list_first_entry(head, pos, member) \
container_of((head)->next, (pos), member)
#define igt_list_last_entry(head, pos, member) \
container_of((head)->prev, (pos), member)
#define igt_list_next_entry(pos, member) \
container_of((pos)->member.next, (pos), member)
#define igt_list_prev_entry(pos, member) \
container_of((pos)->member.prev, (pos), member)
#define igt_list_for_each(pos, head, member) \
for (pos = igt_list_first_entry(head, pos, member); \
&pos->member != (head); \
pos = igt_list_next_entry(pos, member))
#define igt_list_for_each_reverse(pos, head, member) \
for (pos = igt_list_last_entry(head, pos, member); \
&pos->member != (head); \
pos = igt_list_prev_entry(pos, member))
#define igt_list_for_each_safe(pos, tmp, head, member) \
for (pos = igt_list_first_entry(head, pos, member), \
tmp = igt_list_next_entry(pos, member); \
&pos->member != (head); \
pos = tmp, tmp = igt_list_next_entry(pos, member))
#endif /* IGT_AUX_H */
|