chiark / gitweb /
Remove tracks now works again. queue_entry pointers are now stashed
[disorder] / disobedience / queue-menu.c
CommitLineData
c133bd3c
RK
1/*
2 * This file is part of DisOrder
3 * Copyright (C) 2006-2008 Richard Kettlewell
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#include "disobedience.h"
21#include "queue-generic.h"
22
23/* Select All */
24
25int ql_selectall_sensitive(struct queuelike *ql) {
26 return !!ql->q;
27}
28
29void ql_selectall_activate(GtkMenuItem attribute((unused)) *menuitem,
30 gpointer user_data) {
31 struct queuelike *ql = user_data;
32
33 gtk_tree_selection_select_all(ql->selection);
34}
35
36/* Select None */
37
38int ql_selectnone_sensitive(struct queuelike *ql) {
39 return gtk_tree_selection_count_selected_rows(ql->selection) > 0;
40}
41
42void ql_selectnone_activate(GtkMenuItem attribute((unused)) *menuitem,
43 gpointer user_data) {
44 struct queuelike *ql = user_data;
45
46 gtk_tree_selection_unselect_all(ql->selection);
47}
48
49/* Properties */
50
51int ql_properties_sensitive(struct queuelike *ql) {
52 return gtk_tree_selection_count_selected_rows(ql->selection) > 0;
53}
54
55void ql_properties_activate(GtkMenuItem attribute((unused)) *menuitem,
56 gpointer user_data) {
57 struct queuelike *ql = user_data;
58 struct vector v[1];
59 GtkTreeIter iter[1];
60
61 vector_init(v);
62 gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), iter);
63 for(struct queue_entry *q = ql->q; q; q = q->next) {
64 if(gtk_tree_selection_iter_is_selected(ql->selection, iter))
65 vector_append(v, (char *)q->track);
66 gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter);
67 }
68 if(v->nvec)
69 properties(v->nvec, (const char **)v->vec);
70}
71
72/* Scratch */
73
74int ql_scratch_sensitive(struct queuelike attribute((unused)) *ql) {
75 return !!playing_track;
76}
77
78void ql_scratch_activate(GtkMenuItem attribute((unused)) *menuitem,
79 gpointer attribute((unused)) user_data) {
80 /* TODO */
81}
82
83/* Remove */
84
22717074
RK
85static void remove_sensitive_callback(GtkTreeModel *model,
86 GtkTreePath attribute((unused)) *path,
87 GtkTreeIter *iter,
88 gpointer data) {
89 struct queuelike *ql = g_object_get_data(G_OBJECT(model), "ql");
90 struct queue_entry *q = ql_iter_to_q(ql, iter);
91 const int removable = (q != playing_track
92 && right_removable(last_rights, config->username, q));
93 int *const counts = data;
94 ++counts[removable];
95}
96
c133bd3c 97int ql_remove_sensitive(struct queuelike *ql) {
22717074
RK
98 int counts[2] = { 0, 0 };
99 gtk_tree_selection_selected_foreach(ql->selection,
100 remove_sensitive_callback,
101 counts);
102 /* Remove will work if we have at least some removable tracks selected, and
103 * no unremovable ones */
104 return counts[1] > 0 && counts[0] == 0;
105}
106
107static void remove_completed(void attribute((unused)) *v, const char *error) {
108 if(error)
109 popup_protocol_error(0, error);
110}
111
112static void remove_activate_callback(GtkTreeModel *model,
113 GtkTreePath attribute((unused)) *path,
114 GtkTreeIter *iter,
115 gpointer attribute((unused)) data) {
116 struct queuelike *ql = g_object_get_data(G_OBJECT(model), "ql");
117 struct queue_entry *q = ql_iter_to_q(ql, iter);
118
119 disorder_eclient_remove(client, q->id, remove_completed, q);
c133bd3c
RK
120}
121
122void ql_remove_activate(GtkMenuItem attribute((unused)) *menuitem,
22717074
RK
123 gpointer user_data) {
124 struct queuelike *ql = user_data;
125 gtk_tree_selection_selected_foreach(ql->selection,
126 remove_activate_callback,
127 0);
c133bd3c
RK
128}
129
130/* Play */
131
132int ql_play_sensitive(struct queuelike *ql) {
133 return gtk_tree_selection_count_selected_rows(ql->selection) > 0;
134}
135
136void ql_play_activate(GtkMenuItem attribute((unused)) *menuitem,
137 gpointer attribute((unused)) user_data) {
138 /* TODO */
139}
140
141
142/** @brief Create @c ql->menu if it does not already exist */
143static void ql_create_menu(struct queuelike *ql) {
144 if(ql->menu)
145 return;
146 ql->menu = gtk_menu_new();
147 g_signal_connect(ql->menu, "destroy",
148 G_CALLBACK(gtk_widget_destroyed), &ql->menu);
149 for(int n = 0; n < ql->nmenuitems; ++n) {
150 ql->menuitems[n].w = gtk_menu_item_new_with_label(ql->menuitems[n].name);
151 gtk_menu_attach(GTK_MENU(ql->menu), ql->menuitems[n].w, 0, 1, n, n + 1);
152 }
153 set_tool_colors(ql->menu);
154}
155
156/** @brief Configure @c ql->menu */
157static void ql_configure_menu(struct queuelike *ql) {
158 /* Set the sensitivity of each menu item and (re-)establish the signal
159 * handlers */
160 for(int n = 0; n < ql->nmenuitems; ++n) {
161 if(ql->menuitems[n].handlerid)
162 g_signal_handler_disconnect(ql->menuitems[n].w,
163 ql->menuitems[n].handlerid);
164 gtk_widget_set_sensitive(ql->menuitems[n].w,
165 ql->menuitems[n].sensitive(ql));
166 ql->menuitems[n].handlerid = g_signal_connect
167 (ql->menuitems[n].w, "activate",
168 G_CALLBACK(ql->menuitems[n].activate), ql);
169 }
170}
171
172/** @brief Called when a button is released over a queuelike */
be909398 173gboolean ql_button_release(GtkWidget*widget,
c133bd3c
RK
174 GdkEventButton *event,
175 gpointer user_data) {
176 struct queuelike *ql = user_data;
177
178 if(event->type == GDK_BUTTON_PRESS
179 && event->button == 3) {
be909398
RK
180 /* Right button click. */
181 if(gtk_tree_selection_count_selected_rows(ql->selection) == 0) {
182 /* Nothing is selected, select whatever is under the pointer */
183 GtkTreePath *path;
184 if(gtk_tree_view_get_path_at_pos(GTK_TREE_VIEW(widget),
185 event->x, event->y,
186 &path,
187 NULL,
188 NULL, NULL))
189 gtk_tree_selection_select_path(ql->selection, path);
190 }
c133bd3c
RK
191 ql_create_menu(ql);
192 ql_configure_menu(ql);
193 gtk_widget_show_all(ql->menu);
194 gtk_menu_popup(GTK_MENU(ql->menu), 0, 0, 0, 0,
195 event->button, event->time);
196 return TRUE; /* hide the click from other widgets */
197 }
198
199 return FALSE;
200}
201
ee7552f8
RK
202static int ql_tab_selectall_sensitive(void *extra) {
203 return ql_selectall_sensitive(extra);
204}
205
206static void ql_tab_selectall_activate(void *extra) {
207 ql_selectall_activate(NULL, extra);
208}
209
210static int ql_tab_selectnone_sensitive(void *extra) {
211 return ql_selectnone_sensitive(extra);
212}
213
214static void ql_tab_selectnone_activate(void *extra) {
215 ql_selectnone_activate(NULL, extra);
216}
217
218static int ql_tab_properties_sensitive(void *extra) {
219 return ql_properties_sensitive(extra);
220}
221
222static void ql_tab_properties_activate(void *extra) {
223 ql_properties_activate(NULL, extra);
224}
225
226struct tabtype *ql_tabtype(struct queuelike *ql) {
227 static const struct tabtype ql_tabtype = {
228 ql_tab_properties_sensitive,
229 ql_tab_selectall_sensitive,
230 ql_tab_selectnone_sensitive,
231 ql_tab_properties_activate,
232 ql_tab_selectall_activate,
233 ql_tab_selectnone_activate,
234 0,
235 0
236 };
237
238 struct tabtype *t = xmalloc(sizeof *t);
239 *t = ql_tabtype;
240 t->extra = ql;
241 return t;
242}
243
c133bd3c
RK
244/*
245Local Variables:
246c-basic-offset:2
247comment-column:40
248fill-column:79
249indent-tabs-mode:nil
250End:
251*/