460b9539 |
1 | /* |
2 | * This file is part of DisOrder |
eb525fcd |
3 | * Copyright (C) 2006, 2007 Richard Kettlewell |
460b9539 |
4 | * |
5 | * This program is free software; you can redistribute it and/or modify |
6 | * it under the terms of the GNU General Public License as published by |
7 | * the Free Software Foundation; either version 2 of the License, or |
8 | * (at your option) any later version. |
9 | * |
10 | * This program is distributed in the hope that it will be useful, but |
11 | * WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 | * General Public License for more details. |
14 | * |
15 | * You should have received a copy of the GNU General Public License |
16 | * along with this program; if not, write to the Free Software |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 |
18 | * USA |
19 | */ |
20 | |
21 | #include "disobedience.h" |
22 | |
23 | /* Choose track ------------------------------------------------------------ */ |
24 | |
e9b70a84 |
25 | WT(label); |
26 | WT(event_box); |
27 | WT(menu); |
28 | WT(menu_item); |
29 | WT(layout); |
30 | WT(vbox); |
31 | WT(arrow); |
32 | WT(hbox); |
33 | WT(button); |
34 | WT(image); |
35 | WT(entry); |
36 | |
460b9539 |
37 | /* We don't use the built-in tree widgets because they require that you know |
38 | * the children of a node on demand, and we have to wait for the server to tell |
39 | * us. */ |
40 | |
41 | /* Types */ |
42 | |
43 | struct choosenode; |
44 | |
45 | struct displaydata { |
46 | guint width; /* total width required */ |
47 | guint height; /* total height required */ |
48 | }; |
49 | |
50 | /* instantiate the node vector type */ |
51 | VECTOR_TYPE(nodevector, struct choosenode *, xrealloc) |
52 | |
53 | struct choosenode { |
54 | struct choosenode *parent; /* parent node */ |
55 | const char *path; /* full path or 0 */ |
56 | const char *sort; /* sort key */ |
57 | const char *display; /* display name */ |
58 | int pending; /* pending resolve queries */ |
59 | unsigned flags; |
60 | #define CN_EXPANDABLE 0x0001 /* node is expandable */ |
61 | #define CN_EXPANDED 0x0002 /* node is expanded */ |
62 | /* Expandable items are directories; non-expandable ones are files */ |
63 | #define CN_DISPLAYED 0x0004 /* widget is displayed in layout */ |
64 | #define CN_SELECTED 0x0008 /* node is selected */ |
65 | struct nodevector children; /* vector of children */ |
66 | void (*fill)(struct choosenode *); /* request child fill or 0 for leaf */ |
67 | GtkWidget *container; /* the container for this row */ |
68 | GtkWidget *hbox; /* the hbox for this row */ |
69 | GtkWidget *arrow; /* arrow widget or 0 */ |
70 | GtkWidget *label; /* text label for this node */ |
71 | GtkWidget *marker; /* queued marker */ |
72 | }; |
73 | |
74 | struct menuitem { |
75 | /* Parameters */ |
76 | const char *name; /* name */ |
77 | |
78 | /* Callbacks */ |
79 | void (*activate)(GtkMenuItem *menuitem, gpointer user_data); |
80 | /* Called to activate the menu item. The user data is the choosenode the |
81 | * pointer is over. */ |
82 | |
83 | gboolean (*sensitive)(struct choosenode *cn); |
84 | /* Called to determine whether the menu item should be sensitive. TODO */ |
85 | |
86 | /* State */ |
87 | gulong handlerid; /* signal handler ID */ |
88 | GtkWidget *w; /* menu item widget */ |
89 | }; |
90 | |
91 | /* Variables */ |
92 | |
93 | static GtkWidget *chooselayout; |
94 | static GtkWidget *searchentry; /* search terms */ |
95 | static struct choosenode *root; |
96 | static struct choosenode *realroot; |
97 | static GtkWidget *menu; /* our popup menu */ |
98 | static struct choosenode *last_click; /* last clicked node for selection */ |
99 | static int files_visible; /* total files visible */ |
100 | static int files_selected; /* total files selected */ |
101 | static int search_in_flight; /* a search is underway */ |
102 | static int search_obsolete; /* the current search is void */ |
103 | static char **searchresults; /* search results */ |
104 | static int nsearchresults; /* number of results */ |
105 | |
106 | /* Forward Declarations */ |
107 | |
77d95881 |
108 | static void clear_children(struct choosenode *cn); |
460b9539 |
109 | static struct choosenode *newnode(struct choosenode *parent, |
110 | const char *path, |
111 | const char *display, |
112 | const char *sort, |
113 | unsigned flags, |
114 | void (*fill)(struct choosenode *)); |
115 | static void fill_root_node(struct choosenode *cn); |
116 | static void fill_letter_node(struct choosenode *cn); |
117 | static void fill_directory_node(struct choosenode *cn); |
118 | static void got_files(void *v, int nvec, char **vec); |
119 | static void got_resolved_file(void *v, const char *track); |
120 | static void got_dirs(void *v, int nvec, char **vec); |
121 | |
122 | static void expand_node(struct choosenode *cn); |
123 | static void contract_node(struct choosenode *cn); |
124 | static void updated_node(struct choosenode *cn, int redisplay); |
125 | |
126 | static void display_selection(struct choosenode *cn); |
127 | static void clear_selection(struct choosenode *cn); |
128 | |
129 | static void redisplay_tree(void); |
130 | static struct displaydata display_tree(struct choosenode *cn, int x, int y); |
131 | static void undisplay_tree(struct choosenode *cn); |
132 | static void initiate_search(void); |
133 | static void delete_widgets(struct choosenode *cn); |
134 | |
135 | static void clicked_choosenode(GtkWidget attribute((unused)) *widget, |
136 | GdkEventButton *event, |
137 | gpointer user_data); |
138 | |
139 | static void activate_play(GtkMenuItem *menuitem, gpointer user_data); |
39fe1014 |
140 | #if 0 |
460b9539 |
141 | static void activate_remove(GtkMenuItem *menuitem, gpointer user_data); |
39fe1014 |
142 | #endif |
460b9539 |
143 | static void activate_properties(GtkMenuItem *menuitem, gpointer user_data); |
144 | |
145 | static gboolean sensitive_play(struct choosenode *cn); |
39fe1014 |
146 | #if 0 |
460b9539 |
147 | static gboolean sensitive_remove(struct choosenode *cn); |
39fe1014 |
148 | #endif |
460b9539 |
149 | static gboolean sensitive_properties(struct choosenode *cn); |
150 | |
151 | static struct menuitem menuitems[] = { |
39fe1014 |
152 | { "Play track", activate_play, sensitive_play, 0, 0 }, |
153 | #if 0 |
154 | /* Not implemented yet */ |
460b9539 |
155 | { "Remove", activate_remove, sensitive_remove, 0, 0 }, |
39fe1014 |
156 | #endif |
157 | { "Track properties", activate_properties, sensitive_properties, 0, 0 }, |
460b9539 |
158 | }; |
159 | |
160 | #define NMENUITEMS (int)(sizeof menuitems / sizeof *menuitems) |
161 | |
162 | /* Maintaining the data structure ------------------------------------------ */ |
163 | |
164 | /* Create a new node */ |
165 | static struct choosenode *newnode(struct choosenode *parent, |
166 | const char *path, |
167 | const char *display, |
168 | const char *sort, |
169 | unsigned flags, |
170 | void (*fill)(struct choosenode *)) { |
171 | struct choosenode *const n = xmalloc(sizeof *n); |
172 | |
173 | D(("newnode %s %s", path, display)); |
174 | if(flags & CN_EXPANDABLE) |
175 | assert(fill); |
176 | else |
177 | assert(!fill); |
178 | n->parent = parent; |
179 | n->path = path; |
180 | n->display = display; |
181 | n->sort = sort; |
182 | n->flags = flags; |
183 | nodevector_init(&n->children); |
184 | n->fill = fill; |
185 | if(parent) |
186 | nodevector_append(&parent->children, n); |
187 | return n; |
188 | } |
189 | |
190 | /* Fill the root */ |
191 | static void fill_root_node(struct choosenode *cn) { |
192 | int ch; |
193 | char *name; |
194 | struct callbackdata *cbd; |
195 | |
196 | D(("fill_root_node")); |
77d95881 |
197 | clear_children(cn); |
460b9539 |
198 | if(choosealpha) { |
199 | if(!cn->children.nvec) { /* Only need to do this once */ |
200 | for(ch = 'A'; ch <= 'Z'; ++ch) { |
201 | byte_xasprintf(&name, "%c", ch); |
202 | newnode(cn, "<letter>", name, name, CN_EXPANDABLE, fill_letter_node); |
203 | } |
204 | newnode(cn, "<letter>", "*", "~", CN_EXPANDABLE, fill_letter_node); |
205 | } |
206 | updated_node(cn, 1); |
207 | } else { |
208 | /* More de-duping possible here */ |
209 | gtk_label_set_text(GTK_LABEL(report_label), "getting files"); |
210 | cbd = xmalloc(sizeof *cbd); |
211 | cbd->u.choosenode = cn; |
212 | disorder_eclient_dirs(client, got_dirs, "", 0, cbd); |
213 | cbd = xmalloc(sizeof *cbd); |
214 | cbd->u.choosenode = cn; |
215 | disorder_eclient_files(client, got_files, "", 0, cbd); |
216 | } |
217 | } |
218 | |
e9b70a84 |
219 | static void delete_cn_widgets(struct choosenode *cn) { |
220 | if(cn->arrow) { |
221 | DW(arrow); |
222 | gtk_widget_destroy(cn->arrow); |
223 | cn->arrow = 0; |
224 | } |
225 | if(cn->label) { |
226 | DW(label); |
227 | gtk_widget_destroy(cn->label); |
228 | cn->label = 0; |
229 | } |
230 | if(cn->marker) { |
231 | DW(image); |
232 | gtk_widget_destroy(cn->marker); |
233 | cn->marker = 0; |
234 | } |
235 | if(cn->hbox) { |
236 | DW(hbox); |
237 | gtk_widget_destroy(cn->hbox); |
238 | cn->hbox = 0; |
239 | } |
240 | if(cn->container) { |
241 | DW(event_box); |
242 | gtk_widget_destroy(cn->container); |
243 | cn->container = 0; |
244 | } |
245 | } |
246 | |
460b9539 |
247 | /* Clear all the children of CN */ |
248 | static void clear_children(struct choosenode *cn) { |
249 | int n; |
250 | |
251 | D(("clear_children %s", cn->path)); |
252 | /* Recursively clear subtrees */ |
253 | for(n = 0; n < cn->children.nvec; ++n) { |
254 | clear_children(cn->children.vec[n]); |
e9b70a84 |
255 | delete_cn_widgets(cn->children.vec[n]); |
460b9539 |
256 | } |
257 | cn->children.nvec = 0; |
258 | } |
259 | |
260 | /* Fill a child node */ |
261 | static void fill_letter_node(struct choosenode *cn) { |
262 | const char *regexp; |
263 | struct callbackdata *cbd; |
264 | |
265 | D(("fill_letter_node %s", cn->display)); |
266 | switch(cn->display[0]) { |
267 | default: |
268 | byte_xasprintf((char **)®exp, "^(the )?%c", tolower(cn->display[0])); |
269 | break; |
270 | case 'T': |
271 | regexp = "^(?!the [^t])t"; |
272 | break; |
273 | case '*': |
274 | regexp = "^[^a-z]"; |
275 | break; |
276 | } |
277 | /* TODO: caching */ |
278 | /* TODO: de-dupe against fill_directory_node */ |
279 | gtk_label_set_text(GTK_LABEL(report_label), "getting files"); |
280 | clear_children(cn); |
281 | cbd = xmalloc(sizeof *cbd); |
282 | cbd->u.choosenode = cn; |
283 | disorder_eclient_dirs(client, got_dirs, "", regexp, cbd); |
284 | cbd = xmalloc(sizeof *cbd); |
285 | cbd->u.choosenode = cn; |
286 | disorder_eclient_files(client, got_files, "", regexp, cbd); |
287 | } |
288 | |
289 | /* Called with a list of files just below some node */ |
290 | static void got_files(void *v, int nvec, char **vec) { |
291 | struct callbackdata *cbd = v; |
292 | struct choosenode *cn = cbd->u.choosenode; |
293 | int n; |
294 | |
295 | D(("got_files %d files for %s", nvec, cn->path)); |
296 | /* Complicated by the need to resolve aliases. We can save a bit of effort |
297 | * by re-using cbd though. */ |
298 | cn->pending = nvec; |
299 | for(n = 0; n < nvec; ++n) |
300 | disorder_eclient_resolve(client, got_resolved_file, vec[n], cbd); |
301 | } |
302 | |
303 | static void got_resolved_file(void *v, const char *track) { |
304 | struct callbackdata *cbd = v; |
305 | struct choosenode *cn = cbd->u.choosenode, *file_cn; |
306 | |
307 | file_cn = newnode(cn, track, |
308 | trackname_transform("track", track, "display"), |
309 | trackname_transform("track", track, "sort"), |
310 | 0/*flags*/, 0/*fill*/); |
311 | /* Only bother updating when we've got the lot */ |
312 | if(--cn->pending == 0) |
313 | updated_node(cn, 1); |
314 | } |
315 | |
316 | /* Called with a list of directories just below some node */ |
317 | static void got_dirs(void *v, int nvec, char **vec) { |
318 | struct callbackdata *cbd = v; |
319 | struct choosenode *cn = cbd->u.choosenode; |
320 | int n; |
321 | |
322 | D(("got_dirs %d dirs for %s", nvec, cn->path)); |
323 | for(n = 0; n < nvec; ++n) |
324 | newnode(cn, vec[n], |
325 | trackname_transform("dir", vec[n], "display"), |
326 | trackname_transform("dir", vec[n], "sort"), |
327 | CN_EXPANDABLE, fill_directory_node); |
328 | updated_node(cn, 1); |
329 | } |
330 | |
331 | /* Fill a child node */ |
332 | static void fill_directory_node(struct choosenode *cn) { |
333 | struct callbackdata *cbd; |
334 | |
335 | D(("fill_directory_node %s", cn->path)); |
336 | /* TODO: caching */ |
337 | /* TODO: de-dupe against fill_letter_node */ |
338 | assert(report_label != 0); |
339 | gtk_label_set_text(GTK_LABEL(report_label), "getting files"); |
1d0c28c7 |
340 | clear_children(cn); |
460b9539 |
341 | cbd = xmalloc(sizeof *cbd); |
342 | cbd->u.choosenode = cn; |
343 | disorder_eclient_dirs(client, got_dirs, cn->path, 0, cbd); |
344 | cbd = xmalloc(sizeof *cbd); |
345 | cbd->u.choosenode = cn; |
346 | disorder_eclient_files(client, got_files, cn->path, 0, cbd); |
347 | } |
348 | |
349 | /* Expand a node */ |
350 | static void expand_node(struct choosenode *cn) { |
351 | D(("expand_node %s", cn->path)); |
352 | assert(cn->flags & CN_EXPANDABLE); |
353 | /* If node is already expanded do nothing. */ |
354 | if(cn->flags & CN_EXPANDED) return; |
355 | /* We mark the node as expanded and request that it fill itself. When it has |
356 | * completed it will called updated_node() and we can redraw at that |
357 | * point. */ |
358 | cn->flags |= CN_EXPANDED; |
359 | /* TODO: visual feedback */ |
360 | cn->fill(cn); |
361 | } |
362 | |
363 | /* Contract a node */ |
364 | static void contract_node(struct choosenode *cn) { |
365 | D(("contract_node %s", cn->path)); |
366 | assert(cn->flags & CN_EXPANDABLE); |
367 | /* If node is already contracted do nothing. */ |
368 | if(!(cn->flags & CN_EXPANDED)) return; |
369 | cn->flags &= ~CN_EXPANDED; |
370 | /* Clear selection below this node */ |
371 | clear_selection(cn); |
e9b70a84 |
372 | /* Zot children. We never used to do this but the result would be that over |
373 | * time you'd end up with the entire tree pulled into memory. If the server |
374 | * is over a slow network it will make interactivity slightly worse; if |
375 | * anyone complains we can make it an option. */ |
376 | clear_children(cn); |
460b9539 |
377 | /* We can contract a node immediately. */ |
378 | redisplay_tree(); |
379 | } |
380 | |
381 | /* qsort callback for ordering choosenodes */ |
382 | static int compare_choosenode(const void *av, const void *bv) { |
383 | const struct choosenode *const *aa = av, *const *bb = bv; |
384 | const struct choosenode *a = *aa, *b = *bb; |
385 | |
386 | return compare_tracks(a->sort, b->sort, |
387 | a->display, b->display, |
388 | a->path, b->path); |
389 | } |
390 | |
391 | /* Called when an expandable node is updated. */ |
392 | static void updated_node(struct choosenode *cn, int redisplay) { |
393 | D(("updated_node %s", cn->path)); |
394 | assert(cn->flags & CN_EXPANDABLE); |
395 | /* It might be that the node has been de-expanded since we requested the |
396 | * update. In that case we ignore this notification. */ |
397 | if(!(cn->flags & CN_EXPANDED)) return; |
398 | /* Sort children */ |
399 | qsort(cn->children.vec, cn->children.nvec, sizeof (struct choosenode *), |
400 | compare_choosenode); |
401 | if(redisplay) |
402 | redisplay_tree(); |
403 | } |
404 | |
405 | /* Searching --------------------------------------------------------------- */ |
406 | |
407 | static int compare_track_for_qsort(const void *a, const void *b) { |
408 | return compare_path(*(char **)a, *(char **)b); |
409 | } |
410 | |
411 | /* Return true iff FILE is a child of DIR */ |
412 | static int is_child(const char *dir, const char *file) { |
413 | const size_t dlen = strlen(dir); |
414 | |
415 | return (!strncmp(file, dir, dlen) |
416 | && file[dlen] == '/' |
417 | && strchr(file + dlen + 1, '/') == 0); |
418 | } |
419 | |
420 | /* Return true iff FILE is a descendant of DIR */ |
421 | static int is_descendant(const char *dir, const char *file) { |
422 | const size_t dlen = strlen(dir); |
423 | |
424 | return !strncmp(file, dir, dlen) && file[dlen] == '/'; |
425 | } |
426 | |
427 | /* Called to fill a node in the search results tree */ |
428 | static void fill_search_node(struct choosenode *cn) { |
429 | int n; |
430 | const size_t plen = strlen(cn->path); |
431 | const char *s; |
432 | char *dir, *last = 0; |
433 | |
434 | D(("fill_search_node %s", cn->path)); |
435 | /* We depend on the search results being sorted as by compare_path(). */ |
9e9fc4ae |
436 | clear_children(cn); |
460b9539 |
437 | for(n = 0; n < nsearchresults; ++n) { |
438 | /* We only care about descendants of CN */ |
439 | if(!is_descendant(cn->path, searchresults[n])) |
440 | continue; |
441 | s = strchr(searchresults[n] + plen + 1, '/'); |
442 | if(s) { |
443 | /* We've identified a subdirectory of CN. */ |
444 | dir = xstrndup(searchresults[n], s - searchresults[n]); |
445 | if(!last || strcmp(dir, last)) { |
446 | /* Not a duplicate */ |
447 | last = dir; |
448 | newnode(cn, dir, |
449 | trackname_transform("dir", dir, "display"), |
450 | trackname_transform("dir", dir, "sort"), |
451 | CN_EXPANDABLE, fill_search_node); |
452 | } |
453 | } else { |
454 | /* We've identified a file in CN */ |
455 | newnode(cn, searchresults[n], |
456 | trackname_transform("track", searchresults[n], "display"), |
457 | trackname_transform("track", searchresults[n], "sort"), |
458 | 0/*flags*/, 0/*fill*/); |
459 | } |
460 | } |
461 | updated_node(cn, 1); |
462 | } |
463 | |
464 | /* This is called from eclient with a (possibly empty) list of search results, |
465 | * and also from initiate_seatch with an always empty list to indicate that |
466 | * we're not searching for anything in particular. */ |
467 | static void search_completed(void attribute((unused)) *v, |
468 | int nvec, char **vec) { |
469 | struct choosenode *cn; |
470 | int n; |
471 | const char *dir; |
472 | |
473 | search_in_flight = 0; |
474 | if(search_obsolete) { |
475 | /* This search has been obsoleted by user input since it started. |
476 | * Therefore we throw away the result and search again. */ |
477 | search_obsolete = 0; |
478 | initiate_search(); |
479 | } else { |
480 | if(nvec) { |
481 | /* We will replace the choose tree with a tree structured view of search |
482 | * results. First we must disabled the choose tree's widgets. */ |
483 | delete_widgets(root); |
484 | /* Put the tracks into order, grouped by directory. They'll probably |
485 | * come back this way anyway in current versions of the server, but it's |
486 | * cheap not to rely on it (compared with the massive effort we expend |
487 | * later on) */ |
488 | qsort(vec, nvec, sizeof(char *), compare_track_for_qsort); |
489 | searchresults = vec; |
490 | nsearchresults = nvec; |
491 | cn = root = newnode(0/*parent*/, "", "Search results", "", |
492 | CN_EXPANDABLE|CN_EXPANDED, fill_search_node); |
493 | /* Construct the initial tree. We do this in a single pass and expand |
494 | * everything, so you can actually see your search results. */ |
495 | for(n = 0; n < nsearchresults; ++n) { |
496 | /* Firstly we might need to go up a few directories to each an ancestor |
497 | * of this track */ |
498 | while(!is_descendant(cn->path, searchresults[n])) { |
499 | /* We report the update on each node the last time we see it (With |
500 | * display=0, the main purpose of this is to get the order of the |
501 | * children right.) */ |
502 | updated_node(cn, 0); |
503 | cn = cn->parent; |
504 | } |
505 | /* Secondly we might need to insert some new directories */ |
506 | while(!is_child(cn->path, searchresults[n])) { |
507 | /* Figure out the subdirectory */ |
508 | dir = xstrndup(searchresults[n], |
509 | strchr(searchresults[n] + strlen(cn->path) + 1, |
510 | '/') - searchresults[n]); |
511 | cn = newnode(cn, dir, |
512 | trackname_transform("dir", dir, "display"), |
513 | trackname_transform("dir", dir, "sort"), |
514 | CN_EXPANDABLE|CN_EXPANDED, fill_search_node); |
515 | } |
516 | /* Finally we can insert the track as a child of the current |
517 | * directory */ |
518 | newnode(cn, searchresults[n], |
519 | trackname_transform("track", searchresults[n], "display"), |
520 | trackname_transform("track", searchresults[n], "sort"), |
521 | 0/*flags*/, 0/*fill*/); |
522 | } |
523 | while(cn) { |
524 | /* Update all the nodes back up to the root */ |
525 | updated_node(cn, 0); |
526 | cn = cn->parent; |
527 | } |
528 | /* Now it's worth displaying the tree */ |
529 | redisplay_tree(); |
530 | } else if(root != realroot) { |
531 | delete_widgets(root); |
532 | root = realroot; |
533 | redisplay_tree(); |
534 | } |
535 | } |
536 | } |
537 | |
538 | static void initiate_search(void) { |
539 | char *terms, *e; |
540 | |
541 | /* Find out what the user is after */ |
542 | terms = xstrdup(gtk_entry_get_text(GTK_ENTRY(searchentry))); |
543 | /* Strip leading and trailing space */ |
544 | while(*terms == ' ') ++terms; |
545 | e = terms + strlen(terms); |
546 | while(e > terms && e[-1] == ' ') --e; |
547 | *e = 0; |
548 | /* If a search is already underway then mark it as obsolete. We'll revisit |
549 | * when it returns. */ |
550 | if(search_in_flight) { |
551 | search_obsolete = 1; |
552 | return; |
553 | } |
554 | if(*terms) { |
555 | /* There's still something left. Initiate the search. */ |
556 | if(disorder_eclient_search(client, search_completed, terms, 0)) { |
557 | /* The search terms are bad! We treat this as if there were no search |
558 | * terms at all. Some kind of feedback would be handy. */ |
559 | fprintf(stderr, "bad terms [%s]\n", terms); /* TODO */ |
560 | search_completed(0, 0, 0); |
561 | } else { |
562 | search_in_flight = 1; |
563 | } |
564 | } else { |
565 | /* No search terms - we want to see all tracks */ |
566 | search_completed(0, 0, 0); |
567 | } |
568 | } |
569 | |
570 | /* Called when the cancel search button is clicked */ |
571 | static void clearsearch_clicked(GtkButton attribute((unused)) *button, |
572 | gpointer attribute((unused)) userdata) { |
573 | gtk_entry_set_text(GTK_ENTRY(searchentry), ""); |
574 | } |
575 | |
576 | /* Display functions ------------------------------------------------------- */ |
577 | |
578 | /* Delete all the widgets in the tree */ |
579 | static void delete_widgets(struct choosenode *cn) { |
580 | int n; |
581 | |
e9b70a84 |
582 | delete_cn_widgets(cn); |
460b9539 |
583 | for(n = 0; n < cn->children.nvec; ++n) |
584 | delete_widgets(cn->children.vec[n]); |
585 | cn->flags &= ~(CN_DISPLAYED|CN_SELECTED); |
586 | files_selected = 0; |
587 | } |
588 | |
589 | /* Update the display */ |
590 | static void redisplay_tree(void) { |
591 | struct displaydata d; |
592 | guint oldwidth, oldheight; |
593 | |
594 | D(("redisplay_tree")); |
595 | /* We'll count these up empirically each time */ |
596 | files_selected = 0; |
597 | files_visible = 0; |
598 | /* Correct the layout and find out how much space it uses */ |
e1d4a32b |
599 | MTAG_PUSH("display_tree"); |
460b9539 |
600 | d = display_tree(root, 0, 0); |
e1d4a32b |
601 | MTAG_POP(); |
460b9539 |
602 | /* We must set the total size or scrolling will not work (it wouldn't be hard |
603 | * for GtkLayout to figure it out for itself but presumably you're supposed |
604 | * to be able to have widgets off the edge of the layuot.) |
605 | * |
606 | * There is a problem: if we shrink the size then the part of the screen that |
607 | * is outside the new size but inside the old one is not updated. I think |
608 | * this is arguably bug in GTK+ but it's easy to force a redraw if this |
609 | * region is nonempty. |
610 | */ |
611 | gtk_layout_get_size(GTK_LAYOUT(chooselayout), &oldwidth, &oldheight); |
612 | if(oldwidth > d.width || oldheight > d.height) |
613 | gtk_widget_queue_draw(chooselayout); |
614 | gtk_layout_set_size(GTK_LAYOUT(chooselayout), d.width, d.height); |
615 | /* Notify the main menu of any recent changes */ |
616 | menu_update(-1); |
617 | } |
618 | |
619 | /* Make sure all displayed widgets from CN down exist and are in their proper |
620 | * place and return the vertical space used. */ |
621 | static struct displaydata display_tree(struct choosenode *cn, int x, int y) { |
622 | int n, aw; |
623 | GtkRequisition req; |
624 | struct displaydata d, cd; |
625 | GdkPixbuf *pb; |
626 | |
627 | D(("display_tree %s %d,%d", cn->path, x, y)); |
628 | |
629 | /* An expandable item contains an arrow and a text label. When you press the |
630 | * button it flips its expand state. |
631 | * |
632 | * A non-expandable item has just a text label and no arrow. |
633 | */ |
634 | if(!cn->container) { |
e1d4a32b |
635 | MTAG_PUSH("make_widgets"); |
460b9539 |
636 | /* Widgets need to be created */ |
e9b70a84 |
637 | NW(hbox); |
460b9539 |
638 | cn->hbox = gtk_hbox_new(FALSE, 1); |
639 | if(cn->flags & CN_EXPANDABLE) { |
e9b70a84 |
640 | NW(arrow); |
460b9539 |
641 | cn->arrow = gtk_arrow_new(cn->flags & CN_EXPANDED ? GTK_ARROW_DOWN |
642 | : GTK_ARROW_RIGHT, |
643 | GTK_SHADOW_NONE); |
644 | cn->marker = 0; |
645 | } else { |
646 | cn->arrow = 0; |
e9b70a84 |
647 | if((pb = find_image("notes.png"))) { |
648 | NW(image); |
460b9539 |
649 | cn->marker = gtk_image_new_from_pixbuf(pb); |
e9b70a84 |
650 | } |
460b9539 |
651 | } |
e9b70a84 |
652 | NW(label); |
460b9539 |
653 | cn->label = gtk_label_new(cn->display); |
654 | if(cn->arrow) |
655 | gtk_container_add(GTK_CONTAINER(cn->hbox), cn->arrow); |
656 | gtk_container_add(GTK_CONTAINER(cn->hbox), cn->label); |
657 | if(cn->marker) |
658 | gtk_container_add(GTK_CONTAINER(cn->hbox), cn->marker); |
e9b70a84 |
659 | NW(event_box); |
460b9539 |
660 | cn->container = gtk_event_box_new(); |
661 | gtk_container_add(GTK_CONTAINER(cn->container), cn->hbox); |
662 | g_signal_connect(cn->container, "button-release-event", |
663 | G_CALLBACK(clicked_choosenode), cn); |
664 | g_signal_connect(cn->container, "button-press-event", |
665 | G_CALLBACK(clicked_choosenode), cn); |
666 | g_object_ref(cn->container); |
667 | gtk_widget_set_name(cn->label, "choose"); |
668 | gtk_widget_set_name(cn->container, "choose"); |
669 | /* Show everything by default */ |
670 | gtk_widget_show_all(cn->container); |
e1d4a32b |
671 | MTAG_POP(); |
460b9539 |
672 | } |
673 | assert(cn->container); |
674 | /* Make sure the icon is right */ |
675 | if(cn->flags & CN_EXPANDABLE) |
676 | gtk_arrow_set(GTK_ARROW(cn->arrow), |
677 | cn->flags & CN_EXPANDED ? GTK_ARROW_DOWN : GTK_ARROW_RIGHT, |
678 | GTK_SHADOW_NONE); |
679 | else if(cn->marker) |
680 | /* Make sure the queued marker is right */ |
681 | /* TODO: doesn't always work */ |
682 | (queued(cn->path) ? gtk_widget_show : gtk_widget_hide)(cn->marker); |
683 | /* Put the widget in the right place */ |
684 | if(cn->flags & CN_DISPLAYED) |
685 | gtk_layout_move(GTK_LAYOUT(chooselayout), cn->container, x, y); |
686 | else { |
687 | gtk_layout_put(GTK_LAYOUT(chooselayout), cn->container, x, y); |
688 | cn->flags |= CN_DISPLAYED; |
689 | } |
690 | /* Set the widget's selection status */ |
691 | if(!(cn->flags & CN_EXPANDABLE)) |
692 | display_selection(cn); |
693 | /* Find the size used so we can get vertical positioning right. */ |
694 | gtk_widget_size_request(cn->container, &req); |
695 | d.width = x + req.width; |
696 | d.height = y + req.height; |
697 | if(cn->flags & CN_EXPANDED) { |
698 | /* We'll offset children by the size of the arrow whatever it might be. */ |
699 | assert(cn->arrow); |
700 | gtk_widget_size_request(cn->arrow, &req); |
701 | aw = req.width; |
702 | for(n = 0; n < cn->children.nvec; ++n) { |
703 | cd = display_tree(cn->children.vec[n], x + aw, d.height); |
704 | if(cd.width > d.width) |
705 | d.width = cd.width; |
706 | d.height = cd.height; |
707 | } |
708 | } else { |
709 | for(n = 0; n < cn->children.nvec; ++n) |
710 | undisplay_tree(cn->children.vec[n]); |
711 | } |
712 | if(!(cn->flags & CN_EXPANDABLE)) { |
713 | ++files_visible; |
714 | if(cn->flags & CN_SELECTED) |
715 | ++files_selected; |
716 | } |
717 | /* report back how much space we used */ |
718 | D(("display_tree %s %d,%d total size %dx%d", cn->path, x, y, |
719 | d.width, d.height)); |
720 | return d; |
721 | } |
722 | |
723 | /* Remove widgets for newly hidden nodes */ |
724 | static void undisplay_tree(struct choosenode *cn) { |
725 | int n; |
726 | |
727 | D(("undisplay_tree %s", cn->path)); |
728 | /* Remove this widget from the display */ |
729 | if(cn->flags & CN_DISPLAYED) { |
730 | gtk_container_remove(GTK_CONTAINER(chooselayout), cn->container); |
731 | cn->flags ^= CN_DISPLAYED; |
732 | } |
733 | /* Remove children too */ |
734 | for(n = 0; n < cn->children.nvec; ++n) |
735 | undisplay_tree(cn->children.vec[n]); |
736 | } |
737 | |
738 | /* Selection --------------------------------------------------------------- */ |
739 | |
740 | static void display_selection(struct choosenode *cn) { |
741 | /* Need foreground and background colors */ |
742 | gtk_widget_set_state(cn->label, (cn->flags & CN_SELECTED |
743 | ? GTK_STATE_SELECTED : GTK_STATE_NORMAL)); |
744 | gtk_widget_set_state(cn->container, (cn->flags & CN_SELECTED |
745 | ? GTK_STATE_SELECTED : GTK_STATE_NORMAL)); |
746 | } |
747 | |
748 | /* Set the selection state of a widget. Directories can never be selected, we |
749 | * just ignore attempts to do so. */ |
750 | static void set_selection(struct choosenode *cn, int selected) { |
751 | unsigned f = selected ? CN_SELECTED : 0; |
752 | |
753 | D(("set_selection %d %s", selected, cn->path)); |
754 | if(!(cn->flags & CN_EXPANDABLE) && (cn->flags & CN_SELECTED) != f) { |
755 | cn->flags ^= CN_SELECTED; |
756 | /* Maintain selection count */ |
757 | if(selected) |
758 | ++files_selected; |
759 | else |
760 | --files_selected; |
761 | display_selection(cn); |
762 | /* Update main menu sensitivity */ |
763 | menu_update(-1); |
764 | } |
765 | } |
766 | |
767 | /* Recursively clear all selection bits from CN down */ |
768 | static void clear_selection(struct choosenode *cn) { |
769 | int n; |
770 | |
771 | set_selection(cn, 0); |
772 | for(n = 0; n < cn->children.nvec; ++n) |
773 | clear_selection(cn->children.vec[n]); |
774 | } |
775 | |
776 | /* User actions ------------------------------------------------------------ */ |
777 | |
778 | /* Clicked on something */ |
779 | static void clicked_choosenode(GtkWidget attribute((unused)) *widget, |
780 | GdkEventButton *event, |
781 | gpointer user_data) { |
782 | struct choosenode *cn = user_data; |
783 | int ind, last_ind, n; |
784 | |
785 | D(("clicked_choosenode %s", cn->path)); |
786 | if(event->type == GDK_BUTTON_RELEASE |
787 | && event->button == 1) { |
788 | /* Left click */ |
789 | if(cn->flags & CN_EXPANDABLE) { |
790 | /* This is a directory. Flip its expansion status. */ |
791 | if(cn->flags & CN_EXPANDED) |
792 | contract_node(cn); |
793 | else |
794 | expand_node(cn); |
795 | last_click = 0; |
796 | } else { |
797 | /* This is a file. Adjust selection status */ |
798 | /* TODO the basic logic here is essentially the same as that in queue.c. |
799 | * Can we share code at all? */ |
800 | switch(event->state & (GDK_SHIFT_MASK|GDK_CONTROL_MASK)) { |
801 | case 0: |
802 | clear_selection(root); |
803 | set_selection(cn, 1); |
804 | last_click = cn; |
805 | break; |
806 | case GDK_CONTROL_MASK: |
807 | set_selection(cn, !(cn->flags & CN_SELECTED)); |
808 | last_click = cn; |
809 | break; |
810 | case GDK_SHIFT_MASK: |
811 | case GDK_SHIFT_MASK|GDK_CONTROL_MASK: |
812 | if(last_click && last_click->parent == cn->parent) { |
813 | /* Figure out where the current and last clicks are in the list */ |
814 | ind = last_ind = -1; |
815 | for(n = 0; n < cn->parent->children.nvec; ++n) { |
816 | if(cn->parent->children.vec[n] == cn) |
817 | ind = n; |
818 | if(cn->parent->children.vec[n] == last_click) |
819 | last_ind = n; |
820 | } |
821 | /* Test shouldn't ever fail, but still */ |
822 | if(ind >= 0 && last_ind >= 0) { |
823 | if(!(event->state & GDK_CONTROL_MASK)) { |
824 | for(n = 0; n < cn->parent->children.nvec; ++n) |
825 | set_selection(cn->parent->children.vec[n], 0); |
826 | } |
827 | if(ind > last_ind) |
828 | for(n = last_ind; n <= ind; ++n) |
829 | set_selection(cn->parent->children.vec[n], 1); |
830 | else |
831 | for(n = ind; n <= last_ind; ++n) |
832 | set_selection(cn->parent->children.vec[n], 1); |
833 | if(event->state & GDK_CONTROL_MASK) |
834 | last_click = cn; |
835 | } |
836 | } |
837 | break; |
838 | } |
839 | } |
840 | } else if(event->type == GDK_BUTTON_RELEASE |
841 | && event->button == 2) { |
842 | /* Middle click - play the pointed track */ |
843 | if(!(cn->flags & CN_EXPANDABLE)) { |
844 | clear_selection(root); |
845 | set_selection(cn, 1); |
846 | gtk_label_set_text(GTK_LABEL(report_label), "adding track to queue"); |
847 | disorder_eclient_play(client, cn->path, 0, 0); |
848 | last_click = 0; |
849 | } |
850 | } else if(event->type == GDK_BUTTON_PRESS |
851 | && event->button == 3) { |
852 | /* Right click. Pop up a menu. */ |
853 | /* If the current file isn't selected, switch the selection to just that. |
854 | * (If we're looking at a directory then leave the selection alone.) */ |
855 | if(!(cn->flags & CN_EXPANDABLE) && !(cn->flags & CN_SELECTED)) { |
856 | clear_selection(root); |
857 | set_selection(cn, 1); |
858 | last_click = cn; |
859 | } |
860 | /* Set the item sensitivity and callbacks */ |
861 | for(n = 0; n < NMENUITEMS; ++n) { |
862 | if(menuitems[n].handlerid) |
863 | g_signal_handler_disconnect(menuitems[n].w, |
864 | menuitems[n].handlerid); |
865 | gtk_widget_set_sensitive(menuitems[n].w, |
866 | menuitems[n].sensitive(cn)); |
867 | menuitems[n].handlerid = g_signal_connect |
868 | (menuitems[n].w, "activate", G_CALLBACK(menuitems[n].activate), cn); |
869 | } |
870 | /* Pop up the menu */ |
871 | gtk_widget_show_all(menu); |
872 | gtk_menu_popup(GTK_MENU(menu), 0, 0, 0, 0, |
873 | event->button, event->time); |
874 | } |
875 | } |
876 | |
877 | static void searchentry_changed(GtkEditable attribute((unused)) *editable, |
878 | gpointer attribute((unused)) user_data) { |
879 | initiate_search(); |
880 | } |
881 | |
882 | /* Menu items -------------------------------------------------------------- */ |
883 | |
884 | static void recurse_selected(struct choosenode *cn, struct vector *v) { |
885 | int n; |
886 | |
887 | if(cn->flags & CN_EXPANDABLE) { |
888 | if(cn->flags & CN_EXPANDED) |
889 | for(n = 0; n < cn->children.nvec; ++n) |
890 | recurse_selected(cn->children.vec[n], v); |
891 | } else { |
892 | if((cn->flags & CN_SELECTED) && cn->path) |
893 | vector_append(v, (char *)cn->path); |
894 | } |
895 | } |
896 | |
897 | static char **gather_selected(int *ntracks) { |
898 | struct vector v; |
899 | |
900 | vector_init(&v); |
901 | recurse_selected(root, &v); |
902 | vector_terminate(&v); |
903 | if(ntracks) *ntracks = v.nvec; |
904 | return v.vec; |
905 | } |
906 | |
907 | static void activate_play(GtkMenuItem attribute((unused)) *menuitem, |
908 | gpointer attribute((unused)) user_data) { |
909 | char **tracks = gather_selected(0); |
910 | int n; |
911 | |
912 | gtk_label_set_text(GTK_LABEL(report_label), "adding track to queue"); |
913 | for(n = 0; tracks[n]; ++n) |
914 | disorder_eclient_play(client, tracks[n], 0, 0); |
915 | } |
916 | |
39fe1014 |
917 | #if 0 |
460b9539 |
918 | static void activate_remove(GtkMenuItem attribute((unused)) *menuitem, |
919 | gpointer attribute((unused)) user_data) { |
920 | /* TODO remove all selected tracks */ |
921 | } |
39fe1014 |
922 | #endif |
460b9539 |
923 | |
924 | static void activate_properties(GtkMenuItem attribute((unused)) *menuitem, |
925 | gpointer attribute((unused)) user_data) { |
926 | int ntracks; |
927 | char **tracks = gather_selected(&ntracks); |
928 | |
929 | properties(ntracks, tracks); |
930 | } |
931 | |
932 | static gboolean sensitive_play(struct choosenode attribute((unused)) *cn) { |
933 | return !!files_selected; |
934 | } |
935 | |
39fe1014 |
936 | #if 0 |
460b9539 |
937 | static gboolean sensitive_remove(struct choosenode attribute((unused)) *cn) { |
938 | return FALSE; /* not implemented yet */ |
939 | } |
39fe1014 |
940 | #endif |
460b9539 |
941 | |
942 | static gboolean sensitive_properties(struct choosenode attribute((unused)) *cn) { |
943 | return !!files_selected; |
944 | } |
945 | |
946 | /* Main menu plumbing ------------------------------------------------------ */ |
947 | |
948 | static int choose_properties_sensitive(GtkWidget attribute((unused)) *w) { |
949 | return !!files_selected; |
950 | } |
951 | |
952 | static int choose_selectall_sensitive(GtkWidget attribute((unused)) *w) { |
953 | return FALSE; /* TODO */ |
954 | } |
955 | |
956 | static void choose_properties_activate(GtkWidget attribute((unused)) *w) { |
957 | activate_properties(0, 0); |
958 | } |
959 | |
960 | static void choose_selectall_activate(GtkWidget attribute((unused)) *w) { |
961 | /* TODO */ |
962 | } |
963 | |
964 | static const struct tabtype tabtype_choose = { |
965 | choose_properties_sensitive, |
966 | choose_selectall_sensitive, |
967 | choose_properties_activate, |
968 | choose_selectall_activate, |
969 | }; |
970 | |
971 | /* Public entry points ----------------------------------------------------- */ |
972 | |
973 | /* Create a track choice widget */ |
974 | GtkWidget *choose_widget(void) { |
975 | int n; |
976 | GtkWidget *scrolled; |
977 | GtkWidget *vbox, *hbox, *clearsearch; |
978 | |
979 | /* |
980 | * +--vbox-------------------------------------------------------+ |
981 | * | +-hbox----------------------------------------------------+ | |
982 | * | | searchentry | clearsearch | | |
983 | * | +---------------------------------------------------------+ | |
984 | * | +-scrolled------------------------------------------------+ | |
985 | * | | +-chooselayout------------------------------------++--+ | | |
986 | * | | | Tree structure is manually layed out in here ||^^| | | |
987 | * | | | || | | | |
988 | * | | | || | | | |
989 | * | | | || | | | |
990 | * | | | ||vv| | | |
991 | * | | +-------------------------------------------------++--+ | | |
992 | * | | +-------------------------------------------------+ | | |
993 | * | | |< >| | | |
994 | * | | +-------------------------------------------------+ | | |
995 | * | +---------------------------------------------------------+ | |
996 | * +-------------------------------------------------------------+ |
997 | */ |
998 | |
999 | /* Text entry box for search terms */ |
e9b70a84 |
1000 | NW(entry); |
460b9539 |
1001 | searchentry = gtk_entry_new(); |
1002 | g_signal_connect(searchentry, "changed", G_CALLBACK(searchentry_changed), 0); |
1003 | |
1004 | /* Cancel button to clear the search */ |
e9b70a84 |
1005 | NW(button); |
460b9539 |
1006 | clearsearch = gtk_button_new_from_stock(GTK_STOCK_CANCEL); |
1007 | g_signal_connect(G_OBJECT(clearsearch), "clicked", |
1008 | G_CALLBACK(clearsearch_clicked), 0); |
1009 | |
1010 | /* hbox packs the search box and the cancel button together on a line */ |
e9b70a84 |
1011 | NW(hbox); |
460b9539 |
1012 | hbox = gtk_hbox_new(FALSE/*homogeneous*/, 1/*spacing*/); |
1013 | gtk_box_pack_start(GTK_BOX(hbox), searchentry, |
1014 | TRUE/*expand*/, TRUE/*fill*/, 0/*padding*/); |
1015 | gtk_box_pack_end(GTK_BOX(hbox), clearsearch, |
1016 | FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); |
1017 | |
1018 | /* chooselayout contains the currently visible subset of the track |
1019 | * namespace */ |
e9b70a84 |
1020 | NW(layout); |
460b9539 |
1021 | chooselayout = gtk_layout_new(0, 0); |
1022 | root = newnode(0/*parent*/, "<root>", "All files", "", |
1023 | CN_EXPANDABLE, fill_root_node); |
1024 | realroot = root; |
1025 | expand_node(root); /* will call redisplay_tree */ |
1026 | /* Create the popup menu */ |
e9b70a84 |
1027 | NW(menu); |
460b9539 |
1028 | menu = gtk_menu_new(); |
1029 | g_signal_connect(menu, "destroy", G_CALLBACK(gtk_widget_destroyed), &menu); |
1030 | for(n = 0; n < NMENUITEMS; ++n) { |
e9b70a84 |
1031 | NW(menu_item); |
460b9539 |
1032 | menuitems[n].w = gtk_menu_item_new_with_label(menuitems[n].name); |
1033 | gtk_menu_attach(GTK_MENU(menu), menuitems[n].w, 0, 1, n, n + 1); |
1034 | } |
1035 | /* The layout is scrollable */ |
1036 | scrolled = scroll_widget(GTK_WIDGET(chooselayout), "choose"); |
1037 | |
1038 | /* The scrollable layout and the search hbox go together in a vbox */ |
e9b70a84 |
1039 | NW(vbox); |
460b9539 |
1040 | vbox = gtk_vbox_new(FALSE/*homogenous*/, 1/*spacing*/); |
1041 | gtk_box_pack_start(GTK_BOX(vbox), hbox, |
1042 | FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); |
1043 | gtk_box_pack_end(GTK_BOX(vbox), scrolled, |
1044 | TRUE/*expand*/, TRUE/*fill*/, 0/*padding*/); |
1045 | |
1046 | g_object_set_data(G_OBJECT(vbox), "type", (void *)&tabtype_choose); |
1047 | return vbox; |
1048 | } |
1049 | |
1050 | /* Called when something we care about here might have changed */ |
1051 | void choose_update(void) { |
1052 | redisplay_tree(); |
1053 | } |
1054 | |
1055 | /* |
1056 | Local Variables: |
1057 | c-basic-offset:2 |
1058 | comment-column:40 |
1059 | fill-column:79 |
1060 | indent-tabs-mode:nil |
1061 | End: |
1062 | */ |