11 void select_desktop(monitor_t *m, desktop_t *d)
18 PRINTF("select desktop %s\n", d->name);
21 hide_desktop(mon->desk);
25 ewmh_update_current_desktop();
29 desktop_t *closest_desktop(monitor_t *m, desktop_t *d, cycle_dir_t dir, desktop_select_t sel)
31 desktop_t *f = (dir == CYCLE_PREV ? d->prev : d->next);
33 f = (dir == CYCLE_PREV ? m->desk_tail : m->desk_head);
36 if (desktop_matches(f, sel))
38 f = (dir == CYCLE_PREV ? f->prev : f->next);
40 f = (dir == CYCLE_PREV ? m->desk_tail : m->desk_head);
46 void change_layout(monitor_t *m, desktop_t *d, layout_t l)
54 void transfer_desktop(monitor_t *ms, monitor_t *md, desktop_t *d)
59 desktop_t *dd = ms->desk;
60 unlink_desktop(ms, d);
61 insert_desktop(md, d);
65 show_desktop(ms->desk);
70 for (node_t *n = first_extrema(d->root); n != NULL; n = next_leaf(n, d->root))
71 fit_monitor(md, n->client);
75 if (d != dd && md->desk == d)
78 history_transfer_desktop(md, d);
80 ewmh_update_wm_desktops();
81 ewmh_update_desktop_names();
82 ewmh_update_current_desktop();
86 desktop_t *make_desktop(const char *name)
88 desktop_t *d = malloc(sizeof(desktop_t));
90 snprintf(d->name, sizeof(d->name), "%s%d", DEFAULT_DESK_NAME, ++desktop_uid);
92 snprintf(d->name, sizeof(d->name), "%s", name);
93 d->layout = LAYOUT_TILED;
94 d->prev = d->next = NULL;
95 d->root = d->focus = NULL;
96 d->window_gap = WINDOW_GAP;
97 d->border_width = BORDER_WIDTH;
101 void insert_desktop(monitor_t *m, desktop_t *d)
103 if (m->desk == NULL) {
108 m->desk_tail->next = d;
109 d->prev = m->desk_tail;
114 void add_desktop(monitor_t *m, desktop_t *d)
116 PRINTF("add desktop %s\n", d->name);
118 insert_desktop(m, d);
120 ewmh_update_number_of_desktops();
121 ewmh_update_desktop_names();
125 void empty_desktop(desktop_t *d)
127 destroy_tree(d->root);
128 d->root = d->focus = NULL;
131 void unlink_desktop(monitor_t *m, desktop_t *d)
133 desktop_t *prev = d->prev;
134 desktop_t *next = d->next;
135 desktop_t *last_desk = history_get_desktop(m, d);
140 if (m->desk_head == d)
142 if (m->desk_tail == d)
145 m->desk = (last_desk == NULL ? (prev == NULL ? next : prev) : last_desk);
146 d->prev = d->next = NULL;
149 void remove_desktop(monitor_t *m, desktop_t *d)
151 PRINTF("remove desktop %s\n", d->name);
153 unlink_desktop(m, d);
154 history_remove(d, NULL);
158 ewmh_update_number_of_desktops();
159 ewmh_update_desktop_names();
163 void swap_desktops(monitor_t *m1, desktop_t *d1, monitor_t *m2, desktop_t *d2)
165 if (d1 == NULL || d2 == NULL || d1 == d2)
168 PRINTF("swap desktops %s %s\n", d1->name, d2->name);
170 bool d1_focused = (m1->desk == d1);
171 bool d2_focused = (m2->desk == d2);
176 if (m1->desk_head == d1)
178 if (m1->desk_tail == d1)
182 if (m2->desk_head == d2)
184 if (m2->desk_tail == d2)
187 if (m1->desk_head == d1)
189 else if (m1->desk_head == d2)
191 if (m1->desk_tail == d1)
193 else if (m1->desk_tail == d2)
197 desktop_t *p1 = d1->prev;
198 desktop_t *n1 = d1->next;
199 desktop_t *p2 = d2->prev;
200 desktop_t *n2 = d2->next;
202 if (p1 != NULL && p1 != d2)
204 if (n1 != NULL && n1 != d2)
206 if (p2 != NULL && p2 != d1)
208 if (n2 != NULL && n2 != d1)
211 d1->prev = p2 == d1 ? d2 : p2;
212 d1->next = n2 == d1 ? d2 : n2;
213 d2->prev = p1 == d2 ? d1 : p1;
214 d2->next = n1 == d2 ? d1 : n1;
217 for (node_t *n = first_extrema(d1->root); n != NULL; n = next_leaf(n, d1->root))
218 fit_monitor(m2, n->client);
219 for (node_t *n = first_extrema(d2->root); n != NULL; n = next_leaf(n, d2->root))
220 fit_monitor(m1, n->client);
221 history_swap_desktops(m1, d1, m2, d2);
224 if (d1_focused && !d2_focused) {
227 } else if (!d1_focused && d2_focused) {
233 update_input_focus();
234 ewmh_update_wm_desktops();
235 ewmh_update_desktop_names();
236 ewmh_update_current_desktop();
240 void show_desktop(desktop_t *d)
244 for (node_t *n = first_extrema(d->root); n != NULL; n = next_leaf(n, d->root))
245 window_show(n->client->window);
248 void hide_desktop(desktop_t *d)
252 for (node_t *n = first_extrema(d->root); n != NULL; n = next_leaf(n, d->root))
253 window_hide(n->client->window);
256 bool is_urgent(desktop_t *d)
258 for (node_t *n = first_extrema(d->root); n != NULL; n = next_leaf(n, d->root))
259 if (n->client->urgent)