forked from baskerville/bspwm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
subscribe.c
91 lines (86 loc) · 2.99 KB
/
subscribe.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/* Copyright (c) 2012, Bastien Dejean
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdlib.h>
#include <unistd.h>
#include <ctype.h>
#include "bspwm.h"
#include "tree.h"
#include "settings.h"
#include "subscribe.h"
subscriber_list_t *make_subscriber_list(FILE *stream)
{
subscriber_list_t *sb = malloc(sizeof(subscriber_list_t));
sb->prev = sb->next = NULL;
sb->stream = stream;
return sb;
}
void remove_subscriber(subscriber_list_t *sb)
{
if (sb == NULL)
return;
subscriber_list_t *a = sb->prev;
subscriber_list_t *b = sb->next;
if (a != NULL)
a->next = b;
if (b != NULL)
b->prev = a;
if (sb == subscribe_head)
subscribe_head = b;
if (sb == subscribe_tail)
subscribe_tail = a;
fclose(sb->stream);
free(sb);
}
void add_subscriber(FILE *stream)
{
subscriber_list_t *sb = make_subscriber_list(stream);
if (subscribe_head == NULL) {
subscribe_head = subscribe_tail = sb;
} else {
subscribe_tail->next = sb;
sb->prev = subscribe_tail;
subscribe_tail = sb;
}
print_status(sb->stream);
}
int print_status(FILE *stream)
{
fprintf(stream, "%s", status_prefix);
bool urgent = false;
for (monitor_t *m = mon_head; m != NULL; m = m->next) {
fprintf(stream, "%c%s:", (mon == m ? 'M' : 'm'), m->name);
for (desktop_t *d = m->desk_head; d != NULL; d = d->next, urgent = false) {
for (node_t *n = first_extrema(d->root); n != NULL && !urgent; n = next_leaf(n, d->root))
urgent |= n->client->urgent;
char c = (urgent ? 'u' : (d->root == NULL ? 'f' : 'o'));
if (m->desk == d)
c = toupper(c);
fprintf(stream, "%c%s:", c, d->name);
}
if (m->desk != NULL)
fprintf(stream, "L%c%s", (m->desk->layout == LAYOUT_TILED ? 'T' : 'M'), (m != mon_tail ? ":" : ""));
}
fprintf(stream, "%s", "\n");
return fflush(stream);
}