src/subscribe.c

   1 /* Copyright (c) 2012, Bastien Dejean
   2  * All rights reserved.
   3  *
   4  * Redistribution and use in source and binary forms, with or without
   5  * modification, are permitted provided that the following conditions are met:
   6  *
   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.
  12  *
  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.
  23  */
  24
  25 #include <stdio.h>
  26 #include <stdlib.h>
  27 #include <unistd.h>
  28 #include <ctype.h>
  29 #include <stdarg.h>
  30 #include "bspwm.h"
  31 #include "desktop.h"
  32 #include "settings.h"
  33 #include "subscribe.h"
  34 #include "tree.h"
  35
  36 subscriber_list_t *make_subscriber(FILE *stream, char *fifo_path, int field, int count)
  37 {
  38         subscriber_list_t *sb = calloc(1, sizeof(subscriber_list_t));
  39         sb->prev = sb->next = NULL;
  40         sb->stream = stream;
  41         sb->fifo_path = fifo_path;
  42         sb->field = field;
  43         sb->count = count;
  44         return sb;
  45 }
  46
  47 void remove_subscriber(subscriber_list_t *sb)
  48 {
  49         if (sb == NULL) {
  50                 return;
  51         }
  52         subscriber_list_t *a = sb->prev;
  53         subscriber_list_t *b = sb->next;
  54         if (a != NULL) {
  55                 a->next = b;
  56         }
  57         if (b != NULL) {
  58                 b->prev = a;
  59         }
  60         if (sb == subscribe_head) {
  61                 subscribe_head = b;
  62         }
  63         if (sb == subscribe_tail) {
  64                 subscribe_tail = a;
  65         }
  66         if (!restart) {
  67                 fclose(sb->stream);
  68                 unlink(sb->fifo_path);
  69         }
  70         free(sb->fifo_path);
  71         free(sb);
  72 }
  73
  74 void add_subscriber(subscriber_list_t *sb)
  75 {
  76         if (subscribe_head == NULL) {
  77                 subscribe_head = subscribe_tail = sb;
  78         } else {
  79                 subscribe_tail->next = sb;
  80                 sb->prev = subscribe_tail;
  81                 subscribe_tail = sb;
  82         }
  83         if (sb->field & SBSC_MASK_REPORT) {
  84                 print_report(sb->stream);
  85                 if (sb->count-- == 1) {
  86                         remove_subscriber(sb);
  87                 }
  88         }
  89 }
  90
  91 int print_report(FILE *stream)
  92 {
  93         fprintf(stream, "%s", status_prefix);
  94         for (monitor_t *m = mon_head; m != NULL; m = m->next) {
  95                 fprintf(stream, "%c%s", (mon == m ? 'M' : 'm'), m->name);
  96                 for (desktop_t *d = m->desk_head; d != NULL; d = d->next) {
  97                         char c = (is_urgent(d) ? 'u' : (d->root == NULL ? 'f' : 'o'));
  98                         if (m->desk == d) {
  99                                 c = toupper(c);
 100                         }
 101                         fprintf(stream, ":%c%s", c, d->name);
 102                 }
 103                 if (m->desk != NULL) {
 104                         fprintf(stream, ":L%c", LAYOUT_CHR(m->desk->layout));
 105                         if (m->desk->focus != NULL) {
 106                                 node_t *n = m->desk->focus;
 107                                 if (n->client != NULL) {
 108                                         fprintf(stream, ":T%c", STATE_CHR(n->client->state));
 109                                 } else {
 110                                         fprintf(stream, ":T@");
 111                                 }
 112                                 int i = 0;
 113                                 char flags[5];
 114                                 if (n->sticky) {
 115                                         flags[i++] = 'S';
 116                                 }
 117                                 if (n->private) {
 118                                         flags[i++] = 'P';
 119                                 }
 120                                 if (n->locked) {
 121                                         flags[i++] = 'L';
 122                                 }
 123                                 if (n->marked) {
 124                                         flags[i++] = 'M';
 125                                 }
 126                                 flags[i] = '\0';
 127                                 fprintf(stream, ":G%s", flags);
 128                         }
 129                 }
 130                 if (m != mon_tail) {
 131                         fprintf(stream, "%s", ":");
 132                 }
 133         }
 134         fprintf(stream, "%s", "\n");
 135         return fflush(stream);
 136 }
 137
 138 void put_status(subscriber_mask_t mask, ...)
 139 {
 140         subscriber_list_t *sb = subscribe_head;
 141         int ret;
 142         while (sb != NULL) {
 143                 subscriber_list_t *next = sb->next;
 144                 if (sb->field & mask) {
 145                         if (sb->count > 0) {
 146                                 sb->count--;
 147                         }
 148                         if (mask == SBSC_MASK_REPORT) {
 149                                 ret = print_report(sb->stream);
 150                         } else {
 151                                 char *fmt;
 152                                 va_list args;
 153                                 va_start(args, mask);
 154                                 fmt = va_arg(args, char *);
 155                                 vfprintf(sb->stream, fmt, args);
 156                                 va_end(args);
 157                                 ret = fflush(sb->stream);
 158                         }
 159                         if (ret != 0 || sb->count == 0) {
 160                                 remove_subscriber(sb);
 161                         }
 162                 }
 163                 sb = next;
 164         }
 165 }
 166
 167 void prune_dead_subscribers(void)
 168 {
 169         subscriber_list_t *sb = subscribe_head;
 170         while (sb != NULL) {
 171                 subscriber_list_t *next = sb->next;
 172                 // To check if a subscriber's stream is still open and writable call
 173                 // write with an empty buffer and check the returned value. If the
 174                 // stream is not writable anymore (i.e. it has been closed because the
 175                 // process associated to this subscriber no longer exists) then write()
 176                 // will return -1.
 177                 if (write(fileno(sb->stream), 0, 0) == -1) {
 178                         remove_subscriber(sb);
 179                 }
 180                 sb = next;
 181         }
 182 }