forked from jordansissel/xdotool
-
Notifications
You must be signed in to change notification settings - Fork 0
/
xdo_search.c
383 lines (330 loc) · 12.6 KB
/
xdo_search.c
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
/* xdo search implementation
*
* Lets you search windows by a query
*/
#include <stdlib.h>
#include <regex.h>
#include <stdio.h>
#include <X11/Xlib.h>
#include <X11/Xatom.h>
#include <X11/Xresource.h>
#include <X11/Xutil.h>
#include <X11/extensions/XTest.h>
#include "xdo.h"
static int compile_re(const char *pattern, regex_t *re);
static int check_window_match(const xdo_t *xdo, Window wid, const xdo_search_t *search);
static int _xdo_match_window_class(const xdo_t *xdo, Window window, regex_t *re);
static int _xdo_match_window_classname(const xdo_t *xdo, Window window, regex_t *re);
static int _xdo_match_window_name(const xdo_t *xdo, Window window, regex_t *re);
static int _xdo_match_window_title(const xdo_t *xdo, Window window, regex_t *re);
static int _xdo_match_window_pid(const xdo_t *xdo, Window window, int pid);
static int _xdo_is_window_visible(const xdo_t *xdo, Window wid);
static void find_matching_windows(const xdo_t *xdo, Window window,
const xdo_search_t *search,
Window **windowlist_ret,
unsigned int *nwindows_ret,
unsigned int *windowlist_size,
int current_depth);
int xdo_search_windows(const xdo_t *xdo, const xdo_search_t *search,
Window **windowlist_ret, unsigned int *nwindows_ret) {
int i = 0;
unsigned int windowlist_size = 100;
*nwindows_ret = 0;
*windowlist_ret = calloc(sizeof(Window), windowlist_size);
/* TODO(sissel): Support multiple screens */
if (search->searchmask & SEARCH_SCREEN) {
Window root = RootWindow(xdo->xdpy, search->screen);
if (check_window_match(xdo, root, search)) {
(*windowlist_ret)[*nwindows_ret] = root;
(*nwindows_ret)++;
/* Don't have to check for size bounds here because
* we start with array size 100 */
}
/* Start with depth=1 since we already covered the root windows */
find_matching_windows(xdo, root, search, windowlist_ret, nwindows_ret,
&windowlist_size, 1);
} else {
const int screencount = ScreenCount(xdo->xdpy);
for (i = 0; i < screencount; i++) {
Window root = RootWindow(xdo->xdpy, i);
if (check_window_match(xdo, root, search)) {
(*windowlist_ret)[*nwindows_ret] = root;
(*nwindows_ret)++;
/* Don't have to check for size bounds here because
* we start with array size 100 */
}
/* Start with depth=1 since we already covered the root windows */
find_matching_windows(xdo, root, search, windowlist_ret,
nwindows_ret, &windowlist_size, 1);
}
}
//printf("Window count: %d\n", (int)ncandidate_windows);
//printf("Search:\n");
//printf("onlyvisible: %d\n", search->only_visible);
//printf("pid: %lu\n", search->pid);
//printf("title: %s\n", search->title);
//printf("name: %s\n", search->winname);
//printf("class: %s\n", search->winclass);
//printf("classname: %s\n", search->winclassname);
//printf("//Search\n");
return XDO_SUCCESS;
} /* int xdo_search_windows */
static int _xdo_match_window_title(const xdo_t *xdo, Window window, regex_t *re) {
fprintf(stderr, "This function (match window by title) is deprecated."
" You want probably want to match by the window name.\n");
return _xdo_match_window_name(xdo, window, re);
} /* int _xdo_match_window_title */
static int _xdo_match_window_name(const xdo_t *xdo, Window window, regex_t *re) {
/* historically in xdo, 'match_name' matched the classhint 'name' which we
* match in _xdo_match_window_classname. But really, most of the time 'name'
* refers to the window manager name for the window, which is displayed in
* the titlebar */
int i;
int count = 0;
char **list = NULL;
XTextProperty tp;
XGetWMName(xdo->xdpy, window, &tp);
if (tp.nitems > 0) {
//XmbTextPropertyToTextList(xdo->xdpy, &tp, &list, &count);
Xutf8TextPropertyToTextList(xdo->xdpy, &tp, &list, &count);
for (i = 0; i < count; i++) {
if (regexec(re, list[i], 0, NULL, 0) == 0) {
XFreeStringList(list);
XFree(tp.value);
return True;
}
}
} else {
/* Treat windows with no names as empty strings */
if (regexec(re, "", 0, NULL, 0) == 0) {
XFreeStringList(list);
XFree(tp.value);
return True;
}
}
XFreeStringList(list);
XFree(tp.value);
return False;
} /* int _xdo_match_window_name */
static int _xdo_match_window_class(const xdo_t *xdo, Window window, regex_t *re) {
XWindowAttributes attr;
XClassHint classhint;
XGetWindowAttributes(xdo->xdpy, window, &attr);
if (XGetClassHint(xdo->xdpy, window, &classhint)) {
//printf("%d: class %s\n", window, classhint.res_class);
if ((classhint.res_class) && (regexec(re, classhint.res_class, 0, NULL, 0) == 0)) {
XFree(classhint.res_name);
XFree(classhint.res_class);
return True;
}
XFree(classhint.res_name);
XFree(classhint.res_class);
} else {
/* Treat windows with no class as empty strings */
if (regexec(re, "", 0, NULL, 0) == 0) {
return True;
}
}
return False;
} /* int _xdo_match_window_class */
static int _xdo_match_window_classname(const xdo_t *xdo, Window window, regex_t *re) {
XWindowAttributes attr;
XClassHint classhint;
XGetWindowAttributes(xdo->xdpy, window, &attr);
if (XGetClassHint(xdo->xdpy, window, &classhint)) {
if ((classhint.res_name) && (regexec(re, classhint.res_name, 0, NULL, 0) == 0)) {
XFree(classhint.res_name);
XFree(classhint.res_class);
return True;
}
XFree(classhint.res_name);
XFree(classhint.res_class);
} else {
/* Treat windows with no class name as empty strings */
if (regexec(re, "", 0, NULL, 0) == 0) {
return True;
}
}
return False;
} /* int _xdo_match_window_classname */
static int _xdo_match_window_pid(const xdo_t *xdo, Window window, const int pid) {
int window_pid;
window_pid = xdo_get_pid_window(xdo, window);
if (pid == window_pid) {
return True;
} else {
return False;
}
} /* int _xdo_match_window_pid */
static int compile_re(const char *pattern, regex_t *re) {
int ret;
if (pattern == NULL) {
regcomp(re, "^$", REG_EXTENDED | REG_ICASE);
return True;
}
ret = regcomp(re, pattern, REG_EXTENDED | REG_ICASE);
if (ret != 0) {
fprintf(stderr, "Failed to compile regex (return code %d): '%s'\n", ret, pattern);
return False;
}
return True;
} /* int compile_re */
static int _xdo_is_window_visible(const xdo_t *xdo, Window wid) {
XWindowAttributes wattr;
XGetWindowAttributes(xdo->xdpy, wid, &wattr);
if (wattr.map_state != IsViewable)
return False;
return True;
} /* int _xdo_is_window_visible */
static int check_window_match(const xdo_t *xdo, Window wid,
const xdo_search_t *search) {
regex_t title_re;
regex_t class_re;
regex_t classname_re;
regex_t name_re;
if (!compile_re(search->title, &title_re) \
|| !compile_re(search->winclass, &class_re) \
|| !compile_re(search->winclassname, &classname_re) \
|| !compile_re(search->winname, &name_re)) {
return False;
}
/* Set this to 1 for dev debugging */
static const int debug = 0;
int visible_ok, pid_ok, title_ok, name_ok, class_ok, classname_ok, desktop_ok;
int visible_want, pid_want, title_want, name_want, class_want, classname_want, desktop_want;
visible_ok = pid_ok = title_ok = name_ok = class_ok = classname_ok = desktop_ok = True;
//(search->require == SEARCH_ANY ? False : True);
desktop_want = search->searchmask & SEARCH_DESKTOP;
visible_want = search->searchmask & SEARCH_ONLYVISIBLE;
pid_want = search->searchmask & SEARCH_PID;
title_want = search->searchmask & SEARCH_TITLE;
name_want = search->searchmask & SEARCH_NAME;
class_want = search->searchmask & SEARCH_CLASS;
classname_want = search->searchmask & SEARCH_CLASSNAME;
do {
if (desktop_want) {
long desktop = -1;
/* We're modifying xdo here, but since we restore it, we're still
* obeying the "const" contract. */
int old_quiet = xdo->quiet;
xdo_t *xdo2 = (xdo_t *)xdo;
xdo2->quiet = 1;
int ret = xdo_get_desktop_for_window(xdo2, wid, &desktop);
xdo2->quiet = old_quiet;
/* Desktop matched if we support desktop queries *and* the desktop is
* equal */
desktop_ok = (ret == XDO_SUCCESS && desktop == search->desktop);
}
/* Visibility is a hard condition, fail always if we wanted
* only visible windows and this one isn't */
if (visible_want && !_xdo_is_window_visible(xdo, wid)) {
if (debug) fprintf(stderr, "skip %ld visible\n", wid);
visible_ok = False;
break;
}
if (pid_want && !_xdo_match_window_pid(xdo, wid, search->pid)) {
if (debug) fprintf(stderr, "skip %ld pid\n", wid);
pid_ok = False;
}
if (title_want && !_xdo_match_window_title(xdo, wid, &title_re)) {
if (debug) fprintf(stderr, "skip %ld title\n", wid);
title_ok = False;
}
if (name_want && !_xdo_match_window_name(xdo, wid, &name_re)) {
if (debug) fprintf(stderr, "skip %ld winname\n", wid);
name_ok = False;
}
if (class_want && !_xdo_match_window_class(xdo, wid, &class_re)) {
if (debug) fprintf(stderr, "skip %ld winclass\n", wid);
class_ok = False;
}
if (classname_want && !_xdo_match_window_classname(xdo, wid, &classname_re)) {
if (debug) fprintf(stderr, "skip %ld winclassname\n", wid);
classname_ok = False;
}
} while (0);
if (search->title)
regfree(&title_re);
if (search->winclass)
regfree(&class_re);
if (search->winclassname)
regfree(&classname_re);
if (search->winname)
regfree(&name_re);
if (debug) {
fprintf(stderr, "win: %ld, pid:%d, title:%d, name:%d, class:%d, visible:%d\n",
wid, pid_ok, title_ok, name_ok, class_ok, visible_ok);
}
switch (search->require) {
case SEARCH_ALL:
return visible_ok && pid_ok && title_ok && name_ok && class_ok && classname_ok && desktop_ok;
break;
case SEARCH_ANY:
return visible_ok && ((pid_want && pid_ok) || (title_want && title_ok) \
|| (name_want && name_ok) \
|| (class_want && class_ok) \
|| (classname_want && classname_ok)) \
&& desktop_ok;
break;
}
fprintf(stderr,
"Unexpected code reached. search->require is not valid? (%d); "
"this may be a bug?\n",
search->require);
return False;
} /* int check_window_match */
static void find_matching_windows(const xdo_t *xdo, Window window,
const xdo_search_t *search,
Window **windowlist_ret,
unsigned int *nwindows_ret,
unsigned int *windowlist_size,
int current_depth) {
/* Query for children of 'wid'. For each child, check match.
* We want to do a breadth-first search.
*
* If match, add to list.
* If over limit, break.
* Recurse.
*/
Window dummy;
Window *children;
unsigned int i, nchildren;
/* Break early, if we have enough windows already. */
if (search->limit > 0 && *nwindows_ret >= search->limit) {
return;
}
/* Break if too deep */
if (search->max_depth != -1 && current_depth > search->max_depth) {
return;
}
/* Break if XQueryTree fails.
* TODO(sissel): report an error? */
if (!XQueryTree(xdo->xdpy, window, &dummy, &dummy, &children, &nchildren)) {
return;
}
/* Breadth first, check all children for matches */
for (i = 0; i < nchildren; i++) {
Window child = children[i];
if (!check_window_match(xdo, child, search))
continue;
(*windowlist_ret)[*nwindows_ret] = child;
(*nwindows_ret)++;
if (search->limit > 0 && *nwindows_ret >= search->limit) {
/* Limit hit, break early. */
break;
}
if (*windowlist_size == *nwindows_ret) {
*windowlist_size *= 2;
*windowlist_ret = realloc(*windowlist_ret,
*windowlist_size * sizeof(Window));
}
} /* for (i in children) ... */
/* Now check children-children */
if (search->max_depth == -1 || (current_depth + 1) <= search->max_depth) {
for (i = 0; i < nchildren; i++) {
find_matching_windows(xdo, children[i], search, windowlist_ret,
nwindows_ret, windowlist_size,
current_depth + 1);
}
} /* recurse on children if not at max depth */
} /* void find_matching_windows */