2 * This file is part of DisOrder
3 * Copyright (C) 2008 Richard Kettlewell
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.
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.
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
20 /** @file disobedience/choose.c
21 * @brief Hierarchical track selection and search
23 * We now use an ordinary GtkTreeStore/GtkTreeView.
25 * We don't want to pull the entire tree in memory, but we want directories to
26 * show up as having children. Therefore we give directories a placeholder
27 * child and replace their children when they are opened. Placeholders have
28 * TRACK_COLUMN="" and ISFILE_COLUMN=FALSE (so that they don't get check boxes,
31 * TODO We do a period sweep which kills contracted nodes, putting back
32 * placeholders, and updating expanded nodes to keep up with server-side
33 * changes. (We could trigger the latter off rescan complete notifications?)
36 * - sweep up contracted nodes
37 * - update when content may have changed (e.g. after a rescan)
40 #include "disobedience.h"
43 /** @brief The current selection tree */
44 GtkTreeStore *choose_store;
46 /** @brief The view onto the selection tree */
47 GtkWidget *choose_view;
49 /** @brief The selection tree's selection */
50 GtkTreeSelection *choose_selection;
52 /** @brief Count of file listing operations in flight */
53 static int choose_list_in_flight;
55 static char *choose_get_string(GtkTreeIter *iter, int column) {
57 gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter,
60 char *s = xstrdup(gs);
65 char *choose_get_track(GtkTreeIter *iter) {
66 char *s = choose_get_string(iter, TRACK_COLUMN);
67 return *s ? s : 0; /* Placeholder -> NULL */
70 char *choose_get_sort(GtkTreeIter *iter) {
71 return choose_get_string(iter, SORT_COLUMN);
74 char *choose_get_display(GtkTreeIter *iter) {
75 return choose_get_string(iter, NAME_COLUMN);
78 int choose_is_file(GtkTreeIter *iter) {
80 gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter,
81 ISFILE_COLUMN, &isfile,
86 int choose_is_dir(GtkTreeIter *iter) {
88 gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter,
89 ISFILE_COLUMN, &isfile,
93 return !choose_is_placeholder(iter);
96 int choose_is_placeholder(GtkTreeIter *iter) {
97 return choose_get_string(iter, TRACK_COLUMN)[0] == 0;
100 /** @brief Remove node @p it and all its children
101 * @param Iterator, updated to point to next
102 * @return True if iterator remains valid
104 * TODO is this necessary? gtk_tree_store_remove() does not document what
105 * happens to children.
107 static gboolean choose_remove_node(GtkTreeIter *it) {
108 GtkTreeIter child[1];
109 gboolean childv = gtk_tree_model_iter_children(GTK_TREE_MODEL(choose_store),
113 childv = choose_remove_node(child);
114 return gtk_tree_store_remove(choose_store, it);
117 /** @brief Update length and state fields */
118 static gboolean choose_set_state_callback(GtkTreeModel attribute((unused)) *model,
119 GtkTreePath attribute((unused)) *path,
121 gpointer attribute((unused)) data) {
122 if(choose_is_file(it)) {
123 const char *track = choose_get_track(it);
124 const long l = namepart_length(track);
127 byte_snprintf(length, sizeof length, "%ld:%02ld", l / 60, l % 60);
130 gtk_tree_store_set(choose_store, it,
131 LENGTH_COLUMN, length,
132 STATE_COLUMN, queued(track),
134 if(choose_is_search_result(track))
135 gtk_tree_store_set(choose_store, it,
136 BG_COLUMN, SEARCH_RESULT_BG,
137 FG_COLUMN, SEARCH_RESULT_FG,
140 gtk_tree_store_set(choose_store, it,
141 BG_COLUMN, (char *)0,
142 FG_COLUMN, (char *)0,
145 return FALSE; /* continue walking */
148 /** @brief Called when the queue or playing track change */
149 static void choose_set_state(const char attribute((unused)) *event,
150 void attribute((unused)) *eventdata,
151 void attribute((unused)) *callbackdata) {
152 gtk_tree_model_foreach(GTK_TREE_MODEL(choose_store),
153 choose_set_state_callback,
157 /** @brief (Re-)populate a node
158 * @param parent_ref Node to populate or NULL to fill root
159 * @param nvec Number of children to add
160 * @param vec Children
161 * @param files 1 if children are files, 0 if directories
163 * Adjusts the set of files (or directories) below @p parent_ref to match those
164 * listed in @p nvec and @p vec.
166 * @parent_ref will be destroyed.
168 static void choose_populate(GtkTreeRowReference *parent_ref,
169 int nvec, char **vec,
171 const char *type = isfile ? "track" : "dir";
172 //fprintf(stderr, "%d new children of type %s\n", nvec, type);
175 /* Compute parent_* */
176 GtkTreeIter pit[1], *parent_it;
177 GtkTreePath *parent_path;
179 parent_path = gtk_tree_row_reference_get_path(parent_ref);
181 gboolean pitv = gtk_tree_model_get_iter(GTK_TREE_MODEL(choose_store),
184 /*fprintf(stderr, "choose_populate %s: parent path is [%s]\n",
186 gtk_tree_path_to_string(parent_path));*/
190 /*fprintf(stderr, "choose_populate %s: populating the root\n",
193 /* Both td[] and the current node set are sorted so we can do a single linear
194 * pass to insert new nodes and remove unwanted ones. The total performance
195 * may be worse than linear depending on the performance of GTK+'s insert and
196 * delete operations. */
197 //fprintf(stderr, "sorting tracks\n");
198 struct tracksort_data *td = tracksort_init(nvec, vec, type);
200 gboolean itv = gtk_tree_model_iter_children(GTK_TREE_MODEL(choose_store),
203 int inserted = 0, deleted_placeholder = 0;
204 //fprintf(stderr, "inserting tracks type=%s\n", type);
205 while(nvec > 0 || itv) {
206 /*fprintf(stderr, "td[] = %s, it=%s [%s]\n",
207 nvec > 0 ? td->track : "(none)",
208 itv ? choose_get_track(it) : "(!itv)",
209 itv ? (choose_is_file(it) ? "file" : "dir") : "");*/
210 enum { INSERT, DELETE, SKIP_TREE, SKIP_BOTH } action;
211 const char *track = itv ? choose_get_track(it) : 0;
213 //fprintf(stderr, " placeholder\n");
215 ++deleted_placeholder;
216 } else if(nvec > 0 && itv) {
217 /* There's both a tree row and a td[] entry */
218 const int cmp = compare_tracks(td->sort, choose_get_sort(it),
219 td->display, choose_get_display(it),
221 //fprintf(stderr, " cmp=%d\n", cmp);
223 /* td < it, so we insert td before it */
226 /* td > it, so we must either delete it (if the same type) or skip it */
227 if(choose_is_file(it) == isfile)
232 /* td = it, so we step past both */
234 } else if(nvec > 0) {
235 /* We've reached the end of the tree rows, but new have tracks left in
237 //fprintf(stderr, " inserting\n");
240 /* We've reached the end of the new tracks from td[], but there are
241 * further tracks in the tree */
242 //fprintf(stderr, " deleting\n");
243 if(choose_is_file(it) == isfile)
251 //fprintf(stderr, " INSERT %s\n", td->track);
252 /* Insert a new row from td[] before it, or at the end if it is no longer
254 GtkTreeIter child[1];
255 gtk_tree_store_insert_before(choose_store,
257 parent_it, /* parent */
258 itv ? it : NULL); /* successor */
259 gtk_tree_store_set(choose_store, child,
260 NAME_COLUMN, td->display,
261 ISFILE_COLUMN, isfile,
262 TRACK_COLUMN, td->track,
263 SORT_COLUMN, td->sort,
265 /* Update length and state; we expect this to kick off length lookups
266 * rather than necessarily get the right value the first time round. */
267 choose_set_state_callback(0, 0, child, 0);
268 /* If we inserted a directory, insert a placeholder too, so it appears to
269 * have children; it will be deleted when we expand the directory. */
271 //fprintf(stderr, " inserting a placeholder\n");
272 GtkTreeIter placeholder[1];
274 gtk_tree_store_append(choose_store, placeholder, child);
275 gtk_tree_store_set(choose_store, placeholder,
276 NAME_COLUMN, "Waddling...",
278 ISFILE_COLUMN, FALSE,
287 //fprintf(stderr, " SKIP_BOTH\n");
292 //fprintf(stderr, " SKIP_TREE\n");
293 itv = gtk_tree_model_iter_next(GTK_TREE_MODEL(choose_store), it);
296 //fprintf(stderr, " DELETE\n");
297 itv = choose_remove_node(it);
301 /*fprintf(stderr, "inserted=%d deleted_placeholder=%d\n\n",
302 inserted, deleted_placeholder);*/
304 /* If we deleted a placeholder then we must re-expand the row */
305 if(deleted_placeholder)
306 gtk_tree_view_expand_row(GTK_TREE_VIEW(choose_view), parent_path, FALSE);
307 gtk_tree_row_reference_free(parent_ref);
308 gtk_tree_path_free(parent_path);
311 /* We only notify others that we've inserted tracks when there are no more
312 * insertions pending, so that they don't have to keep track of how many
313 * requests they've made. */
314 if(--choose_list_in_flight == 0) {
315 /* Notify interested parties that we inserted some tracks, AFTER making
316 * sure that the row is properly expanded */
317 //fprintf(stderr, "raising choose-more-tracks\n");
318 event_raise("choose-more-tracks", 0);
320 //fprintf(stderr, "choose_list_in_flight -> %d-\n", choose_list_in_flight);
323 static void choose_dirs_completed(void *v,
325 int nvec, char **vec) {
327 popup_protocol_error(0, error);
330 choose_populate(v, nvec, vec, 0/*!isfile*/);
333 static void choose_files_completed(void *v,
335 int nvec, char **vec) {
337 popup_protocol_error(0, error);
340 choose_populate(v, nvec, vec, 1/*isfile*/);
343 void choose_play_completed(void attribute((unused)) *v,
346 popup_protocol_error(0, error);
349 static void choose_state_toggled
350 (GtkCellRendererToggle attribute((unused)) *cell_renderer,
352 gpointer attribute((unused)) user_data) {
354 /* Identify the track */
356 gtk_tree_model_get_iter_from_string(GTK_TREE_MODEL(choose_store),
361 if(!choose_is_file(it))
363 const char *track = choose_get_track(it);
366 disorder_eclient_play(client, track, choose_play_completed, 0);
370 static void choose_row_expanded(GtkTreeView attribute((unused)) *treeview,
373 gpointer attribute((unused)) user_data) {
374 /*fprintf(stderr, "row-expanded path=[%s]\n\n",
375 gtk_tree_path_to_string(path));*/
376 /* We update a node's contents whenever it is expanded, even if it was
377 * already populated; the effect is that contracting and expanding a node
378 * suffices to update it to the latest state on the server. */
379 const char *track = choose_get_track(iter);
380 disorder_eclient_files(client, choose_files_completed,
383 gtk_tree_row_reference_new(GTK_TREE_MODEL(choose_store),
385 disorder_eclient_dirs(client, choose_dirs_completed,
388 gtk_tree_row_reference_new(GTK_TREE_MODEL(choose_store),
390 /* The row references are destroyed in the _completed handlers. */
391 choose_list_in_flight += 2;
392 //fprintf(stderr, "choose_list_in_flight -> %d+\n", choose_list_in_flight);
395 /** @brief Create the choose tab */
396 GtkWidget *choose_widget(void) {
397 /* Create the tree store. */
398 choose_store = gtk_tree_store_new(CHOOSE_COLUMNS,
408 /* Create the view */
409 choose_view = gtk_tree_view_new_with_model(GTK_TREE_MODEL(choose_store));
410 gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(choose_view), TRUE);
412 /* Create cell renderers and columns */
413 /* TODO use a table */
415 GtkCellRenderer *r = gtk_cell_renderer_toggle_new();
416 GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes
419 "active", STATE_COLUMN,
420 "visible", ISFILE_COLUMN,
422 gtk_tree_view_column_set_resizable(c, TRUE);
423 gtk_tree_view_column_set_reorderable(c, TRUE);
424 gtk_tree_view_append_column(GTK_TREE_VIEW(choose_view), c);
425 g_signal_connect(r, "toggled",
426 G_CALLBACK(choose_state_toggled), 0);
429 GtkCellRenderer *r = gtk_cell_renderer_text_new();
430 GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes
433 "text", LENGTH_COLUMN,
435 gtk_tree_view_column_set_resizable(c, TRUE);
436 gtk_tree_view_column_set_reorderable(c, TRUE);
437 g_object_set(r, "xalign", (gfloat)1.0, (char *)0);
438 gtk_tree_view_append_column(GTK_TREE_VIEW(choose_view), c);
441 GtkCellRenderer *r = gtk_cell_renderer_text_new();
442 GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes
446 "background", BG_COLUMN,
447 "foreground", FG_COLUMN,
449 gtk_tree_view_column_set_resizable(c, TRUE);
450 gtk_tree_view_column_set_reorderable(c, TRUE);
451 g_object_set(c, "expand", TRUE, (char *)0);
452 gtk_tree_view_append_column(GTK_TREE_VIEW(choose_view), c);
453 gtk_tree_view_set_expander_column(GTK_TREE_VIEW(choose_view), c);
456 /* The selection should support multiple things being selected */
457 choose_selection = gtk_tree_view_get_selection(GTK_TREE_VIEW(choose_view));
458 gtk_tree_selection_set_mode(choose_selection, GTK_SELECTION_MULTIPLE);
460 /* Catch button presses */
461 g_signal_connect(choose_view, "button-press-event",
462 G_CALLBACK(choose_button_event), 0);
463 g_signal_connect(choose_view, "button-release-event",
464 G_CALLBACK(choose_button_event), 0);
465 /* Catch row expansions so we can fill in placeholders */
466 g_signal_connect(choose_view, "row-expanded",
467 G_CALLBACK(choose_row_expanded), 0);
469 event_register("queue-list-changed", choose_set_state, 0);
470 event_register("playing-track-changed", choose_set_state, 0);
471 event_register("search-results-changed", choose_set_state, 0);
472 event_register("lookups-completed", choose_set_state, 0);
475 disorder_eclient_files(client, choose_files_completed, "", NULL, NULL);
476 disorder_eclient_dirs(client, choose_dirs_completed, "", NULL, NULL);
477 choose_list_in_flight += 2;
478 //fprintf(stderr, "choose_list_in_flight -> %d+\n", choose_list_in_flight);
480 /* Make the widget scrollable */
481 GtkWidget *scrolled = scroll_widget(choose_view);
483 /* Pack vertically with the search widget */
484 GtkWidget *vbox = gtk_vbox_new(FALSE/*homogenous*/, 1/*spacing*/);
485 gtk_box_pack_start(GTK_BOX(vbox), scrolled,
486 TRUE/*expand*/, TRUE/*fill*/, 0/*padding*/);
487 gtk_box_pack_end(GTK_BOX(vbox), choose_search_widget(),
488 FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/);
490 g_object_set_data(G_OBJECT(vbox), "type", (void *)&choose_tabtype);