1 /* Copyright (c) 2012, Bastien Dejean
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
7 * 1. Redistributions of source code must retain the above copyright notice, this
8 * list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright notice,
10 * this list of conditions and the following disclaimer in the documentation
11 * and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
14 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
15 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
16 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
17 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
18 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
19 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
20 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
21 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
22 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include "subscribe.h"
33 subscriber_list_t *make_subscriber_list(FILE *stream)
35 subscriber_list_t *sb = malloc(sizeof(subscriber_list_t));
36 sb->prev = sb->next = NULL;
41 void remove_subscriber(subscriber_list_t *sb)
45 subscriber_list_t *a = sb->prev;
46 subscriber_list_t *b = sb->next;
51 if (sb == subscribe_head)
53 if (sb == subscribe_tail)
59 void add_subscriber(FILE *stream)
61 subscriber_list_t *sb = make_subscriber_list(stream);
62 if (subscribe_head == NULL) {
63 subscribe_head = subscribe_tail = sb;
65 subscribe_tail->next = sb;
66 sb->prev = subscribe_tail;
69 print_status(sb->stream);
72 int print_status(FILE *stream)
74 fprintf(stream, "%s", status_prefix);
76 for (monitor_t *m = mon_head; m != NULL; m = m->next) {
77 fprintf(stream, "%c%s:", (mon == m ? 'M' : 'm'), m->name);
78 for (desktop_t *d = m->desk_head; d != NULL; d = d->next, urgent = false) {
79 for (node_t *n = first_extrema(d->root); n != NULL && !urgent; n = next_leaf(n, d->root))
80 urgent |= n->client->urgent;
81 char c = (urgent ? 'u' : (d->root == NULL ? 'f' : 'o'));
84 fprintf(stream, "%c%s:", c, d->name);
87 fprintf(stream, "L%c%s", (m->desk->layout == LAYOUT_TILED ? 'T' : 'M'), (m != mon_tail ? ":" : ""));
89 fprintf(stream, "%s", "\n");
90 return fflush(stream);