Commit | Line | Data |
---|---|---|
c133bd3c RK |
1 | /* |
2 | * This file is part of DisOrder | |
0beb320e | 3 | * Copyright (C) 2006-2009 Richard Kettlewell |
c133bd3c | 4 | * |
e7eb3a27 | 5 | * This program is free software: you can redistribute it and/or modify |
c133bd3c | 6 | * it under the terms of the GNU General Public License as published by |
e7eb3a27 | 7 | * the Free Software Foundation, either version 3 of the License, or |
c133bd3c RK |
8 | * (at your option) any later version. |
9 | * | |
e7eb3a27 RK |
10 | * This program is distributed in the hope that it will be useful, |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | * GNU General Public License for more details. | |
14 | * | |
c133bd3c | 15 | * You should have received a copy of the GNU General Public License |
e7eb3a27 | 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
c133bd3c RK |
17 | */ |
18 | /** @file disobedience/queue-generic.c | |
132a5a4a | 19 | * @brief Disobedience queue widgets |
c133bd3c RK |
20 | * |
21 | * This file provides contains code shared between all the queue-like | |
22 | * widgets - the queue, the recent list and the added tracks list. | |
23 | * | |
24 | * This code is in the process of being rewritten to use the native list | |
25 | * widget. | |
26 | * | |
27 | * There are three @ref queuelike objects: @ref ql_queue, @ref | |
28 | * ql_recent and @ref ql_added. Each has an associated queue linked | |
29 | * list and a list store containing the contents. | |
30 | * | |
31 | * When new contents turn up we rearrange the list store accordingly. | |
32 | * | |
33 | * NB that while in the server the playing track is not in the queue, in | |
34 | * Disobedience, the playing does live in @c ql_queue.q, despite its different | |
35 | * status to everything else found in that list. | |
ee7552f8 RK |
36 | * |
37 | * To do: | |
ee7552f8 | 38 | * - display playing row in a different color? |
c133bd3c RK |
39 | */ |
40 | #include "disobedience.h" | |
6982880f | 41 | #include "popup.h" |
c133bd3c | 42 | #include "queue-generic.h" |
3ae36d41 | 43 | #include "multidrag.h" |
df73cc67 | 44 | #include "autoscroll.h" |
c133bd3c | 45 | |
0beb320e RK |
46 | static const GtkTargetEntry queuelike_targets[] = { |
47 | { | |
4b51f265 RK |
48 | (char *)"text/x-disorder-queued-tracks", /* drag type */ |
49 | GTK_TARGET_SAME_WIDGET, /* rearrangement within a widget */ | |
0beb320e RK |
50 | 0 /* ID value */ |
51 | }, | |
4b51f265 RK |
52 | { |
53 | (char *)"text/x-disorder-playable-tracks", /* drag type */ | |
54 | GTK_TARGET_SAME_APP|GTK_TARGET_OTHER_WIDGET, /* copying between widgets */ | |
55 | 1 /* ID value */ | |
56 | }, | |
0beb320e RK |
57 | }; |
58 | ||
c133bd3c RK |
59 | /* Track detail lookup ----------------------------------------------------- */ |
60 | ||
ad47bd4c RK |
61 | static void queue_lookups_completed(const char attribute((unused)) *event, |
62 | void attribute((unused)) *eventdata, | |
63 | void *callbackdata) { | |
64 | struct queuelike *ql = callbackdata; | |
65 | ql_update_list_store(ql); | |
c133bd3c RK |
66 | } |
67 | ||
68 | /* Column formatting -------------------------------------------------------- */ | |
69 | ||
70 | /** @brief Format the 'when' column */ | |
71 | const char *column_when(const struct queue_entry *q, | |
72 | const char attribute((unused)) *data) { | |
73 | char when[64]; | |
74 | struct tm tm; | |
75 | time_t t; | |
76 | ||
77 | D(("column_when")); | |
78 | switch(q->state) { | |
79 | case playing_isscratch: | |
80 | case playing_unplayed: | |
81 | case playing_random: | |
82 | t = q->expected; | |
83 | break; | |
84 | case playing_failed: | |
85 | case playing_no_player: | |
86 | case playing_ok: | |
87 | case playing_scratched: | |
88 | case playing_started: | |
89 | case playing_paused: | |
90 | case playing_quitting: | |
91 | t = q->played; | |
92 | break; | |
93 | default: | |
94 | t = 0; | |
95 | break; | |
96 | } | |
97 | if(t) | |
98 | strftime(when, sizeof when, "%H:%M", localtime_r(&t, &tm)); | |
99 | else | |
100 | when[0] = 0; | |
101 | return xstrdup(when); | |
102 | } | |
103 | ||
104 | /** @brief Format the 'who' column */ | |
105 | const char *column_who(const struct queue_entry *q, | |
106 | const char attribute((unused)) *data) { | |
107 | D(("column_who")); | |
108 | return q->submitter ? q->submitter : ""; | |
109 | } | |
110 | ||
111 | /** @brief Format one of the track name columns */ | |
112 | const char *column_namepart(const struct queue_entry *q, | |
22717074 | 113 | const char *data) { |
c133bd3c RK |
114 | D(("column_namepart")); |
115 | return namepart(q->track, "display", data); | |
116 | } | |
117 | ||
118 | /** @brief Format the length column */ | |
119 | const char *column_length(const struct queue_entry *q, | |
120 | const char attribute((unused)) *data) { | |
121 | D(("column_length")); | |
122 | long l; | |
123 | time_t now; | |
124 | char *played = 0, *length = 0; | |
125 | ||
126 | /* Work out what to say for the length */ | |
ad47bd4c | 127 | l = namepart_length(q->track); |
c133bd3c RK |
128 | if(l > 0) |
129 | byte_xasprintf(&length, "%ld:%02ld", l / 60, l % 60); | |
130 | else | |
131 | byte_xasprintf(&length, "?:??"); | |
132 | /* For the currently playing track we want to report how much of the track | |
133 | * has been played */ | |
134 | if(q == playing_track) { | |
135 | /* log_state() arranges that we re-get the playing data whenever the | |
136 | * pause/resume state changes */ | |
137 | if(last_state & DISORDER_TRACK_PAUSED) | |
138 | l = playing_track->sofar; | |
139 | else { | |
3900d6d6 RK |
140 | if(!last_playing) |
141 | return NULL; | |
4265e5d3 | 142 | xtime(&now); |
c133bd3c RK |
143 | l = playing_track->sofar + (now - last_playing); |
144 | } | |
145 | byte_xasprintf(&played, "%ld:%02ld/%s", l / 60, l % 60, length); | |
146 | return played; | |
147 | } else | |
148 | return length; | |
149 | } | |
150 | ||
c133bd3c RK |
151 | /* List store maintenance -------------------------------------------------- */ |
152 | ||
22717074 | 153 | /** @brief Return the @ref queue_entry corresponding to @p iter |
83fb99f9 | 154 | * @param model Model that owns @p iter |
22717074 | 155 | * @param iter Tree iterator |
82db9336 | 156 | * @return Pointer to queue entry |
22717074 | 157 | */ |
83fb99f9 | 158 | struct queue_entry *ql_iter_to_q(GtkTreeModel *model, |
22717074 | 159 | GtkTreeIter *iter) { |
83fb99f9 | 160 | struct queuelike *ql = g_object_get_data(G_OBJECT(model), "ql"); |
22717074 RK |
161 | GValue v[1]; |
162 | memset(v, 0, sizeof v); | |
0fb5e8f3 | 163 | gtk_tree_model_get_value(model, iter, ql->ncolumns + QUEUEPOINTER_COLUMN, v); |
22717074 RK |
164 | assert(G_VALUE_TYPE(v) == G_TYPE_POINTER); |
165 | struct queue_entry *const q = g_value_get_pointer(v); | |
166 | g_value_unset(v); | |
167 | return q; | |
168 | } | |
169 | ||
0beb320e RK |
170 | /** @brief Return the @ref queue_entry corresponding to @p path |
171 | * @param model Model to query | |
172 | * @param path Path into tree | |
173 | * @return Pointer to queue entry or NULL | |
174 | */ | |
175 | struct queue_entry *ql_path_to_q(GtkTreeModel *model, | |
176 | GtkTreePath *path) { | |
177 | GtkTreeIter iter[1]; | |
178 | if(!gtk_tree_model_get_iter(model, iter, path)) | |
179 | return NULL; | |
180 | return ql_iter_to_q(model, iter); | |
181 | } | |
182 | ||
c133bd3c RK |
183 | /** @brief Update one row of a list store |
184 | * @param q Queue entry | |
185 | * @param iter Iterator referring to row or NULL to work it out | |
186 | */ | |
187 | void ql_update_row(struct queue_entry *q, | |
188 | GtkTreeIter *iter) { | |
189 | const struct queuelike *const ql = q->ql; | |
190 | ||
191 | D(("ql_update_row")); | |
192 | /* If no iter was supplied, work it out */ | |
193 | GtkTreeIter my_iter[1]; | |
194 | if(!iter) { | |
195 | gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), my_iter); | |
196 | struct queue_entry *qq; | |
197 | for(qq = ql->q; qq && q != qq; qq = qq->next) | |
198 | gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), my_iter); | |
199 | if(!qq) | |
200 | return; | |
201 | iter = my_iter; | |
202 | } | |
203 | /* Update all the columns */ | |
3900d6d6 RK |
204 | for(int col = 0; col < ql->ncolumns; ++col) { |
205 | const char *const v = ql->columns[col].value(q, | |
206 | ql->columns[col].data); | |
207 | if(v) | |
208 | gtk_list_store_set(ql->store, iter, | |
209 | col, v, | |
210 | -1); | |
211 | } | |
0fb5e8f3 RK |
212 | gtk_list_store_set(ql->store, iter, |
213 | ql->ncolumns + QUEUEPOINTER_COLUMN, q, | |
214 | -1); | |
215 | if(q == playing_track) | |
216 | gtk_list_store_set(ql->store, iter, | |
217 | ql->ncolumns + BACKGROUND_COLUMN, BG_PLAYING, | |
218 | ql->ncolumns + FOREGROUND_COLUMN, FG_PLAYING, | |
219 | -1); | |
220 | else | |
221 | gtk_list_store_set(ql->store, iter, | |
222 | ql->ncolumns + BACKGROUND_COLUMN, (char *)0, | |
223 | ql->ncolumns + FOREGROUND_COLUMN, (char *)0, | |
224 | -1); | |
c133bd3c RK |
225 | } |
226 | ||
227 | /** @brief Update the list store | |
228 | * @param ql Queuelike to update | |
229 | * | |
230 | * Called when new namepart data is available (and initially). Doesn't change | |
231 | * the rows, just updates the cell values. | |
232 | */ | |
233 | void ql_update_list_store(struct queuelike *ql) { | |
234 | D(("ql_update_list_store")); | |
235 | GtkTreeIter iter[1]; | |
236 | gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), iter); | |
237 | for(struct queue_entry *q = ql->q; q; q = q->next) { | |
238 | ql_update_row(q, iter); | |
239 | gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
240 | } | |
241 | } | |
242 | ||
83fb99f9 RK |
243 | struct newqueue_data { |
244 | struct queue_entry *old, *new; | |
245 | }; | |
246 | ||
247 | static void record_queue_map(hash *h, | |
248 | const char *id, | |
249 | struct queue_entry *old, | |
250 | struct queue_entry *new) { | |
251 | struct newqueue_data *nqd; | |
252 | ||
253 | if(!(nqd = hash_find(h, id))) { | |
254 | static const struct newqueue_data empty[1]; | |
255 | hash_add(h, id, empty, HASH_INSERT); | |
256 | nqd = hash_find(h, id); | |
257 | } | |
258 | if(old) | |
259 | nqd->old = old; | |
260 | if(new) | |
261 | nqd->new = new; | |
262 | } | |
263 | ||
264 | #if 0 | |
265 | static void dump_queue(struct queue_entry *head, struct queue_entry *mark) { | |
266 | for(struct queue_entry *q = head; q; q = q->next) { | |
267 | if(q == mark) | |
268 | fprintf(stderr, "!"); | |
269 | fprintf(stderr, "%s", q->id); | |
270 | if(q->next) | |
271 | fprintf(stderr, " "); | |
272 | } | |
273 | fprintf(stderr, "\n"); | |
274 | } | |
275 | ||
276 | static void dump_rows(struct queuelike *ql) { | |
277 | GtkTreeIter iter[1]; | |
278 | gboolean it = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
279 | iter); | |
280 | while(it) { | |
281 | struct queue_entry *q = ql_iter_to_q(GTK_TREE_MODEL(ql->store), iter); | |
282 | it = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
283 | fprintf(stderr, "%s", q->id); | |
284 | if(it) | |
285 | fprintf(stderr, " "); | |
286 | } | |
287 | fprintf(stderr, "\n"); | |
288 | } | |
289 | #endif | |
290 | ||
c133bd3c RK |
291 | /** @brief Reset the list store |
292 | * @param ql Queuelike to reset | |
83fb99f9 | 293 | * @param newq New queue contents/ordering |
c133bd3c | 294 | * |
83fb99f9 | 295 | * Updates the queue to match @p newq |
c133bd3c RK |
296 | */ |
297 | void ql_new_queue(struct queuelike *ql, | |
298 | struct queue_entry *newq) { | |
299 | D(("ql_new_queue")); | |
83fb99f9 RK |
300 | ++suppress_actions; |
301 | ||
302 | /* Tell every queue entry which queue owns it */ | |
303 | //fprintf(stderr, "%s: filling in q->ql\n", ql->name); | |
304 | for(struct queue_entry *q = newq; q; q = q->next) | |
c133bd3c | 305 | q->ql = ql; |
83fb99f9 RK |
306 | |
307 | //fprintf(stderr, "%s: constructing h\n", ql->name); | |
308 | /* Construct map from id to new and old structures */ | |
309 | hash *h = hash_new(sizeof(struct newqueue_data)); | |
310 | for(struct queue_entry *q = ql->q; q; q = q->next) | |
311 | record_queue_map(h, q->id, q, NULL); | |
312 | for(struct queue_entry *q = newq; q; q = q->next) | |
313 | record_queue_map(h, q->id, NULL, q); | |
314 | ||
315 | /* The easy bit: delete rows not present any more. In the same pass we | |
316 | * update the secret column containing the queue_entry pointer. */ | |
317 | //fprintf(stderr, "%s: deleting rows...\n", ql->name); | |
318 | GtkTreeIter iter[1]; | |
319 | gboolean it = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
320 | iter); | |
321 | int inserted = 0, deleted = 0, kept = 0; | |
322 | while(it) { | |
323 | struct queue_entry *q = ql_iter_to_q(GTK_TREE_MODEL(ql->store), iter); | |
324 | const struct newqueue_data *nqd = hash_find(h, q->id); | |
325 | if(nqd->new) { | |
326 | /* Tell this row that it belongs to the new version of the queue */ | |
0fb5e8f3 RK |
327 | gtk_list_store_set(ql->store, iter, |
328 | ql->ncolumns + QUEUEPOINTER_COLUMN, nqd->new, | |
329 | -1); | |
83fb99f9 RK |
330 | it = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); |
331 | ++kept; | |
332 | } else { | |
333 | /* Delete this row (and move iter to the next one) */ | |
334 | //fprintf(stderr, " delete %s", q->id); | |
335 | it = gtk_list_store_remove(ql->store, iter); | |
336 | ++deleted; | |
337 | } | |
c133bd3c | 338 | } |
83fb99f9 RK |
339 | |
340 | /* Now every row's secret column is right, but we might be missing new rows | |
341 | * and they might be in the wrong order */ | |
342 | ||
343 | /* We're going to have to support arbitrary rearrangements, so we might as | |
344 | * well add new elements at the end. */ | |
345 | //fprintf(stderr, "%s: adding rows...\n", ql->name); | |
346 | struct queue_entry *after = 0; | |
347 | for(struct queue_entry *q = newq; q; q = q->next) { | |
348 | const struct newqueue_data *nqd = hash_find(h, q->id); | |
349 | if(!nqd->old) { | |
83fb99f9 RK |
350 | if(after) { |
351 | /* Try to insert at the right sort of place */ | |
352 | GtkTreeIter where[1]; | |
353 | gboolean wit = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
354 | where); | |
355 | while(wit && ql_iter_to_q(GTK_TREE_MODEL(ql->store), where) != after) | |
356 | wit = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), where); | |
357 | if(wit) | |
358 | gtk_list_store_insert_after(ql->store, iter, where); | |
359 | else | |
360 | gtk_list_store_append(ql->store, iter); | |
361 | } else | |
362 | gtk_list_store_prepend(ql->store, iter); | |
0fb5e8f3 RK |
363 | gtk_list_store_set(ql->store, iter, |
364 | ql->ncolumns + QUEUEPOINTER_COLUMN, q, | |
365 | -1); | |
83fb99f9 RK |
366 | //fprintf(stderr, " add %s", q->id); |
367 | ++inserted; | |
368 | } | |
369 | after = newq; | |
370 | } | |
371 | ||
372 | /* Now exactly the right set of rows are present, and they have the right | |
373 | * queue_entry pointers in their secret column, but they may be in the wrong | |
374 | * order. | |
375 | * | |
376 | * The current code is simple but amounts to a bubble-sort - we might easily | |
377 | * called gtk_tree_model_iter_next a couple of thousand times. | |
378 | */ | |
379 | //fprintf(stderr, "%s: rearranging rows\n", ql->name); | |
380 | //fprintf(stderr, "%s: queue state: ", ql->name); | |
381 | //dump_queue(newq, 0); | |
382 | //fprintf(stderr, "%s: row state: ", ql->name); | |
383 | //dump_rows(ql); | |
384 | it = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
385 | iter); | |
386 | struct queue_entry *rq = newq; /* r for 'right, correct' */ | |
387 | int swaps = 0, searches = 0; | |
388 | while(it) { | |
389 | struct queue_entry *q = ql_iter_to_q(GTK_TREE_MODEL(ql->store), iter); | |
390 | //fprintf(stderr, " rq = %p, q = %p\n", rq, q); | |
391 | //fprintf(stderr, " rq->id = %s, q->id = %s\n", rq->id, q->id); | |
392 | ||
393 | if(q != rq) { | |
394 | //fprintf(stderr, " mismatch\n"); | |
395 | GtkTreeIter next[1] = { *iter }; | |
396 | gboolean nit = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), next); | |
397 | while(nit) { | |
398 | struct queue_entry *nq = ql_iter_to_q(GTK_TREE_MODEL(ql->store), next); | |
399 | //fprintf(stderr, " candidate: %s\n", nq->id); | |
400 | if(nq == rq) | |
401 | break; | |
402 | nit = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), next); | |
403 | ++searches; | |
404 | } | |
405 | assert(nit); | |
406 | //fprintf(stderr, " found it\n"); | |
407 | gtk_list_store_swap(ql->store, iter, next); | |
408 | *iter = *next; | |
409 | //fprintf(stderr, "%s: new row state: ", ql->name); | |
410 | //dump_rows(ql); | |
411 | ++swaps; | |
412 | } | |
413 | /* ...and onto the next one */ | |
414 | it = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
415 | rq = rq->next; | |
416 | } | |
417 | #if 0 | |
418 | fprintf(stderr, "%6s: %3d kept %3d inserted %3d deleted %3d swaps %4d searches\n", ql->name, | |
419 | kept, inserted, deleted, swaps, searches); | |
420 | #endif | |
421 | //fprintf(stderr, "done\n"); | |
422 | ql->q = newq; | |
423 | /* Set the rest of the columns in new rows */ | |
424 | ql_update_list_store(ql); | |
83fb99f9 | 425 | --suppress_actions; |
c133bd3c RK |
426 | } |
427 | ||
30b358a3 RK |
428 | /** @brief Called when a drag moves within a candidate destination |
429 | * @param w Destination widget | |
430 | * @param dc Drag context | |
431 | * @param x Current pointer location | |
432 | * @param y Current pointer location | |
433 | * @param time_ Current time | |
434 | * @param user_data Pointer to queuelike | |
435 | * @return TRUE in a dropzone, otherwise FALSE | |
df73cc67 RK |
436 | * |
437 | * This is the handler for the "drag-motion" signal. | |
30b358a3 | 438 | */ |
a6e6b359 RK |
439 | static gboolean ql_drag_motion(GtkWidget *w, |
440 | GdkDragContext *dc, | |
441 | gint x, | |
442 | gint y, | |
443 | guint time_, | |
444 | gpointer attribute((unused)) user_data) { | |
445 | //struct queuelike *const ql = user_data; | |
446 | GdkDragAction action = 0; | |
447 | ||
448 | // GTK_DEST_DEFAULT_MOTION vets actions as follows: | |
449 | // 1) if dc->suggested_action is in the gtk_drag_dest_set actions | |
450 | // then dc->suggested_action is taken as the action. | |
451 | // 2) otherwise if dc->actions intersects the gtk_drag_dest_set actions | |
452 | // then the lowest-numbered member of the intersection is chosen. | |
453 | // 3) otherwise no member is chosen and gdk_drag_status() is called | |
454 | // with action=0 to refuse the drop. | |
a6e6b359 | 455 | if(dc->suggested_action) { |
4b51f265 | 456 | if(dc->suggested_action & (GDK_ACTION_MOVE|GDK_ACTION_COPY)) |
a6e6b359 RK |
457 | action = dc->suggested_action; |
458 | } else if(dc->actions & GDK_ACTION_MOVE) | |
4b51f265 RK |
459 | action = GDK_ACTION_MOVE; |
460 | else if(dc->actions & GDK_ACTION_COPY) | |
461 | action = GDK_ACTION_COPY; | |
a6e6b359 RK |
462 | /*fprintf(stderr, "suggested %#x actions %#x result %#x\n", |
463 | dc->suggested_action, dc->actions, action);*/ | |
464 | if(action) { | |
465 | // If the action is acceptable then we see if this widget is acceptable | |
4b51f265 | 466 | if(gtk_drag_dest_find_target(w, dc, NULL) == GDK_NONE) |
a6e6b359 RK |
467 | action = 0; |
468 | } | |
469 | // Report the status | |
470 | gdk_drag_status(dc, action, time_); | |
471 | if(action) { | |
472 | // Highlight the drop area | |
473 | GtkTreePath *path; | |
474 | GtkTreeViewDropPosition pos; | |
475 | ||
476 | if(gtk_tree_view_get_dest_row_at_pos(GTK_TREE_VIEW(w), | |
477 | x, y, | |
478 | &path, | |
479 | &pos)) { | |
480 | //fprintf(stderr, "gtk_tree_view_get_dest_row_at_pos() -> TRUE\n"); | |
481 | // Normalize drop position | |
482 | switch(pos) { | |
483 | case GTK_TREE_VIEW_DROP_INTO_OR_BEFORE: | |
484 | pos = GTK_TREE_VIEW_DROP_BEFORE; | |
485 | break; | |
486 | case GTK_TREE_VIEW_DROP_INTO_OR_AFTER: | |
487 | pos = GTK_TREE_VIEW_DROP_AFTER; | |
488 | break; | |
489 | default: break; | |
490 | } | |
491 | // Highlight drop target | |
492 | gtk_tree_view_set_drag_dest_row(GTK_TREE_VIEW(w), path, pos); | |
493 | } else { | |
494 | //fprintf(stderr, "gtk_tree_view_get_dest_row_at_pos() -> FALSE\n"); | |
495 | gtk_tree_view_set_drag_dest_row(GTK_TREE_VIEW(w), NULL, 0); | |
82db9336 | 496 | } |
a6e6b359 | 497 | } |
98c3d1f1 RK |
498 | /* TODO _something_ is not quite right here. Supposedly if action=0 we |
499 | * should probably be returning FALSE; _but_ actually we always want to | |
500 | * support dropping, as dropping into the big empty space at the bottom | |
501 | * should be the same as dropping at the end of the last row. | |
502 | * | |
503 | * As the code stands the drop works but the visual feedback is not quite | |
504 | * right. | |
505 | */ | |
df73cc67 | 506 | autoscroll_add(GTK_TREE_VIEW(w)); |
98c3d1f1 | 507 | return TRUE; /* We are (always) in a drop zone */ |
a6e6b359 | 508 | } |
82db9336 | 509 | |
30b358a3 RK |
510 | /** @brief Called when a drag moves leaves a candidate destination |
511 | * @param w Destination widget | |
512 | * @param dc Drag context | |
513 | * @param time_ Current time | |
514 | * @param user_data Pointer to queuelike | |
df73cc67 RK |
515 | * |
516 | * This is the handler for the "drag-leave" signal. | |
517 | * | |
518 | * It turns out that we get a drag-leave event when the data is dropped, too | |
519 | * (See _gtk_drag_dest_handle_event). This seems logically consistent and is | |
520 | * convenient too - for instance it's why autoscroll_remove() gets called at | |
521 | * the end of a drag+drop sequence. | |
30b358a3 | 522 | */ |
a6e6b359 RK |
523 | static void ql_drag_leave(GtkWidget *w, |
524 | GdkDragContext attribute((unused)) *dc, | |
525 | guint attribute((unused)) time_, | |
526 | gpointer attribute((unused)) user_data) { | |
527 | //struct queuelike *const ql = user_data; | |
82db9336 | 528 | |
a6e6b359 | 529 | gtk_tree_view_set_drag_dest_row(GTK_TREE_VIEW(w), NULL, 0); |
df73cc67 | 530 | autoscroll_remove(GTK_TREE_VIEW(w)); |
a6e6b359 | 531 | } |
82db9336 | 532 | |
0beb320e | 533 | /** @brief Callback to add selected tracks to the selection data |
82db9336 | 534 | * |
0beb320e | 535 | * Called from ql_drag_data_get(). |
82db9336 | 536 | */ |
0beb320e RK |
537 | static void ql_drag_data_get_collect(GtkTreeModel *model, |
538 | GtkTreePath attribute((unused)) *path, | |
539 | GtkTreeIter *iter, | |
540 | gpointer data) { | |
541 | struct dynstr *const result = data; | |
542 | struct queue_entry *const q = ql_iter_to_q(model, iter); | |
543 | ||
544 | dynstr_append_string(result, q->id); | |
545 | dynstr_append(result, '\n'); | |
546 | dynstr_append_string(result, q->track); | |
547 | dynstr_append(result, '\n'); | |
548 | } | |
82db9336 | 549 | |
0beb320e RK |
550 | /** @brief Called to extract the dragged data from the source queuelike |
551 | * @param w Source widget (the tree view) | |
552 | * @param dc Drag context | |
553 | * @param data Where to put the answer | |
554 | * @param info_ Target @c info parameter | |
555 | * @param time_ Time data requested (for some reason not a @c time_t) | |
556 | * @param user_data The queuelike | |
ff18efce RK |
557 | * |
558 | * The list of tracks is converted into a single string, consisting of IDs | |
559 | * and track names. Each is terminated by a newline. Including both ID and | |
560 | * track name means that the receiver can use whichever happens to be more | |
561 | * convenient. | |
562 | * | |
563 | * If there are no IDs for rows in this widget then the ID half is undefined. | |
df73cc67 RK |
564 | * |
565 | * This is the handler for the "drag-data-get" signal. | |
0beb320e RK |
566 | */ |
567 | static void ql_drag_data_get(GtkWidget attribute((unused)) *w, | |
568 | GdkDragContext attribute((unused)) *dc, | |
569 | GtkSelectionData *data, | |
570 | guint attribute((unused)) info_, | |
571 | guint attribute((unused)) time_, | |
572 | gpointer user_data) { | |
82db9336 | 573 | struct queuelike *const ql = user_data; |
0beb320e RK |
574 | struct dynstr result[1]; |
575 | ||
0beb320e RK |
576 | dynstr_init(result); |
577 | gtk_tree_selection_selected_foreach(ql->selection, | |
578 | ql_drag_data_get_collect, | |
579 | result); | |
4b51f265 | 580 | // TODO must not be able to drag playing track! |
0beb320e RK |
581 | //fprintf(stderr, "drag-data-get: %.*s\n", |
582 | // result->nvec, result->vec); | |
583 | /* gtk_selection_data_set_text() insists that data->target is one of a | |
584 | * variety of stringy atoms. TODO: where does this value actually come | |
585 | * from? */ | |
586 | gtk_selection_data_set(data, | |
587 | GDK_TARGET_STRING, | |
588 | 8, (guchar *)result->vec, result->nvec); | |
82db9336 RK |
589 | } |
590 | ||
0beb320e RK |
591 | /** @brief Called when drag data is received |
592 | * @param w Target widget (the tree view) | |
593 | * @param dc Drag context | |
594 | * @param x The drop location | |
595 | * @param y The drop location | |
596 | * @param data The selection data | |
597 | * @param info_ The target type that was chosen | |
598 | * @param time_ Time data received (for some reason not a @c time_t) | |
599 | * @param user_data The queuelike | |
df73cc67 RK |
600 | * |
601 | * This is the handler for the "drag-data-received" signal. | |
0beb320e RK |
602 | */ |
603 | static void ql_drag_data_received(GtkWidget attribute((unused)) *w, | |
604 | GdkDragContext attribute((unused)) *dc, | |
605 | gint x, | |
606 | gint y, | |
607 | GtkSelectionData *data, | |
608 | guint attribute((unused)) info_, | |
609 | guint attribute((unused)) time_, | |
610 | gpointer user_data) { | |
82db9336 | 611 | struct queuelike *const ql = user_data; |
0beb320e RK |
612 | char *result, *p; |
613 | struct vector ids[1], tracks[1]; | |
614 | int parity = 0; | |
615 | ||
4b51f265 | 616 | //fprintf(stderr, "drag-data-received: %d,%d info_=%u\n", x, y, info_); |
0beb320e RK |
617 | /* Get the selection string */ |
618 | p = result = (char *)gtk_selection_data_get_text(data); | |
619 | if(!result) { | |
620 | //fprintf(stderr, "gtk_selection_data_get_text() returned NULL\n"); | |
621 | return; | |
622 | } | |
623 | //fprintf(stderr, "%s--\n", result); | |
624 | /* Parse it back into IDs and track names */ | |
625 | vector_init(ids); | |
626 | vector_init(tracks); | |
627 | while(*p) { | |
628 | char *nl = strchr(p, '\n'); | |
629 | if(!nl) | |
630 | break; | |
631 | *nl = 0; | |
632 | //fprintf(stderr, " %s\n", p); | |
633 | vector_append(parity++ & 1 ? tracks : ids, xstrdup(p)); | |
634 | p = nl + 1; | |
635 | } | |
636 | g_free(result); | |
637 | if(ids->nvec != tracks->nvec) { | |
638 | //fprintf(stderr, " inconsistent drag data!\n"); | |
639 | return; | |
640 | } | |
641 | vector_terminate(ids); | |
642 | vector_terminate(tracks); | |
643 | /* Figure out which row the drop precedes (if any) */ | |
644 | GtkTreePath *path; | |
645 | GtkTreeViewDropPosition pos; | |
646 | struct queue_entry *q; | |
647 | if(!gtk_tree_view_get_dest_row_at_pos(GTK_TREE_VIEW(ql->view), x, y, | |
648 | &path, &pos)) { | |
649 | //fprintf(stderr, "gtk_tree_view_get_dest_row_at_pos returned FALSE\n"); | |
650 | /* This generally means a drop past the end of the queue. We find the last | |
651 | * element in the queue and ask to move after that. */ | |
652 | for(q = ql->q; q && q->next; q = q->next) | |
653 | ; | |
654 | } else { | |
655 | /* Convert the path to a queue entry pointer. */ | |
656 | q = ql_path_to_q(GTK_TREE_MODEL(ql->store), path); | |
657 | //fprintf(stderr, " tree view likes to drop near %s\n", | |
658 | // q->id ? q->id : "NULL"); | |
659 | /* TODO interpretation of q=NULL */ | |
660 | /* Q should point to the entry just before the insertion point, so that | |
661 | * moveafter works, or NULL to insert right at the start. We don't support | |
662 | * dropping into a row, since that doesn't make sense for us. */ | |
663 | switch(pos) { | |
664 | case GTK_TREE_VIEW_DROP_BEFORE: | |
665 | case GTK_TREE_VIEW_DROP_INTO_OR_BEFORE: | |
666 | if(q) { | |
667 | q = q->prev; | |
668 | //fprintf(stderr, " ...but we like to drop near %s\n", | |
669 | // q ? q->id : "NULL"); | |
670 | } | |
671 | break; | |
672 | default: | |
673 | break; | |
82db9336 | 674 | } |
82db9336 | 675 | } |
4b51f265 RK |
676 | /* Guarantee we never drop an empty list */ |
677 | if(!tracks->nvec) | |
678 | return; | |
0beb320e RK |
679 | /* Note that q->id can match one of ids[]. This doesn't matter for |
680 | * moveafter but TODO may matter for playlist support. */ | |
4b51f265 RK |
681 | switch(info_) { |
682 | case 0: | |
683 | /* Rearrangement. Send ID and track data. */ | |
684 | ql->drop(ql, tracks->nvec, tracks->vec, ids->vec, q); | |
685 | break; | |
686 | case 1: | |
687 | /* Copying between widgets. IDs mean nothing so don't send them. */ | |
688 | ql->drop(ql, tracks->nvec, tracks->vec, NULL, q); | |
689 | break; | |
690 | } | |
82db9336 RK |
691 | } |
692 | ||
c133bd3c RK |
693 | /** @brief Initialize a @ref queuelike */ |
694 | GtkWidget *init_queuelike(struct queuelike *ql) { | |
695 | D(("init_queuelike")); | |
0fb5e8f3 RK |
696 | /* Create the list store. We add an extra column to hold a pointer to the |
697 | * queue_entry. */ | |
698 | GType *types = xcalloc(ql->ncolumns + EXTRA_COLUMNS, sizeof (GType)); | |
699 | for(int n = 0; n < ql->ncolumns + EXTRA_COLUMNS; ++n) | |
c133bd3c | 700 | types[n] = G_TYPE_STRING; |
0fb5e8f3 RK |
701 | types[ql->ncolumns + QUEUEPOINTER_COLUMN] = G_TYPE_POINTER; |
702 | ql->store = gtk_list_store_newv(ql->ncolumns + EXTRA_COLUMNS, types); | |
22717074 | 703 | g_object_set_data(G_OBJECT(ql->store), "ql", (void *)ql); |
c133bd3c RK |
704 | |
705 | /* Create the view */ | |
706 | ql->view = gtk_tree_view_new_with_model(GTK_TREE_MODEL(ql->store)); | |
1583d68f | 707 | gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(ql->view), TRUE); |
c133bd3c RK |
708 | |
709 | /* Create cell renderers and label columns */ | |
710 | for(int n = 0; n < ql->ncolumns; ++n) { | |
711 | GtkCellRenderer *r = gtk_cell_renderer_text_new(); | |
b0b15b7c RK |
712 | if(ql->columns[n].flags & COL_ELLIPSIZE) |
713 | g_object_set(r, "ellipsize", PANGO_ELLIPSIZE_END, (char *)0); | |
714 | if(ql->columns[n].flags & COL_RIGHT) | |
715 | g_object_set(r, "xalign", (gfloat)1.0, (char *)0); | |
c133bd3c RK |
716 | GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes |
717 | (ql->columns[n].name, | |
718 | r, | |
719 | "text", n, | |
0fb5e8f3 RK |
720 | "background", ql->ncolumns + BACKGROUND_COLUMN, |
721 | "foreground", ql->ncolumns + FOREGROUND_COLUMN, | |
c133bd3c | 722 | (char *)0); |
3ffb8e5d RK |
723 | gtk_tree_view_column_set_resizable(c, TRUE); |
724 | gtk_tree_view_column_set_reorderable(c, TRUE); | |
b0b15b7c RK |
725 | if(ql->columns[n].flags & COL_EXPAND) |
726 | g_object_set(c, "expand", TRUE, (char *)0); | |
c133bd3c RK |
727 | gtk_tree_view_append_column(GTK_TREE_VIEW(ql->view), c); |
728 | } | |
729 | ||
730 | /* The selection should support multiple things being selected */ | |
731 | ql->selection = gtk_tree_view_get_selection(GTK_TREE_VIEW(ql->view)); | |
732 | gtk_tree_selection_set_mode(ql->selection, GTK_SELECTION_MULTIPLE); | |
733 | ||
c133bd3c | 734 | /* Catch button presses */ |
17c36802 | 735 | g_signal_connect(ql->view, "button-press-event", |
c133bd3c RK |
736 | G_CALLBACK(ql_button_release), ql); |
737 | ||
82db9336 RK |
738 | /* Drag+drop*/ |
739 | if(ql->drop) { | |
0beb320e RK |
740 | /* Originally this was: |
741 | * | |
742 | * gtk_tree_view_set_reorderable(GTK_TREE_VIEW(ql->view), TRUE); | |
743 | * | |
744 | * However this has a two deficiencies: | |
745 | * | |
746 | * 1) Only one row can be dragged at once. It would be nice | |
747 | * to be able to do bulk rearrangements since the server | |
748 | * can cope with that well. | |
749 | * 2) Dragging between windows is not possible. When playlist | |
750 | * support appears, it should be possible to drag tracks | |
751 | * from the choose tag into the playlist. | |
752 | * | |
753 | * At the time of writing neither of these problems are fully solved, the | |
754 | * code as it stands is just a stepping stone in that direction. | |
755 | */ | |
756 | ||
757 | /* This view will act as a drag source */ | |
758 | gtk_drag_source_set(ql->view, | |
759 | GDK_BUTTON1_MASK, | |
760 | queuelike_targets, | |
761 | sizeof queuelike_targets / sizeof *queuelike_targets, | |
762 | GDK_ACTION_MOVE); | |
a6e6b359 | 763 | /* This view will act as a drag destination */ |
0beb320e | 764 | gtk_drag_dest_set(ql->view, |
a6e6b359 | 765 | GTK_DEST_DEFAULT_HIGHLIGHT|GTK_DEST_DEFAULT_DROP, |
0beb320e RK |
766 | queuelike_targets, |
767 | sizeof queuelike_targets / sizeof *queuelike_targets, | |
4b51f265 | 768 | GDK_ACTION_MOVE|GDK_ACTION_COPY); |
a6e6b359 RK |
769 | g_signal_connect(ql->view, "drag-motion", |
770 | G_CALLBACK(ql_drag_motion), ql); | |
771 | g_signal_connect(ql->view, "drag-leave", | |
772 | G_CALLBACK(ql_drag_leave), ql); | |
0beb320e RK |
773 | g_signal_connect(ql->view, "drag-data-get", |
774 | G_CALLBACK(ql_drag_data_get), ql); | |
775 | g_signal_connect(ql->view, "drag-data-received", | |
776 | G_CALLBACK(ql_drag_data_received), ql); | |
ff18efce RK |
777 | make_treeview_multidrag(ql->view, NULL); |
778 | // TODO playing track should be refused by predicate arg | |
0beb320e | 779 | } else { |
4b51f265 RK |
780 | /* For queues that cannot accept a drop we still accept a copy out */ |
781 | gtk_drag_source_set(ql->view, | |
782 | GDK_BUTTON1_MASK, | |
783 | queuelike_targets, | |
784 | sizeof queuelike_targets / sizeof *queuelike_targets, | |
785 | GDK_ACTION_COPY); | |
4b51f265 RK |
786 | g_signal_connect(ql->view, "drag-data-get", |
787 | G_CALLBACK(ql_drag_data_get), ql); | |
ff18efce | 788 | make_treeview_multidrag(ql->view, NULL); |
82db9336 RK |
789 | } |
790 | ||
c133bd3c | 791 | /* TODO style? */ |
c133bd3c | 792 | |
a8c0e917 | 793 | ql->init(ql); |
c133bd3c | 794 | |
ad47bd4c RK |
795 | /* Update display text when lookups complete */ |
796 | event_register("lookups-completed", queue_lookups_completed, ql); | |
797 | ||
ee7552f8 RK |
798 | GtkWidget *scrolled = scroll_widget(ql->view); |
799 | g_object_set_data(G_OBJECT(scrolled), "type", (void *)ql_tabtype(ql)); | |
800 | return scrolled; | |
c133bd3c RK |
801 | } |
802 | ||
803 | /* | |
804 | Local Variables: | |
805 | c-basic-offset:2 | |
806 | comment-column:40 | |
807 | fill-column:79 | |
808 | indent-tabs-mode:nil | |
809 | End: | |
810 | */ |