tube.c

   1 #include <stdint.h>
   2 #include <stdlib.h>
   3 #include <string.h>
   4 #include "dat.h"
   5
   6 struct ms tubes;
   7
   8 tube
   9 make_tube(const char *name)
  10 {
  11     tube t;
  12
  13     t = malloc(sizeof(struct tube));
  14     if (!t) return NULL;
  15
  16     t->refs = 0;
  17
  18     t->name[MAX_TUBE_NAME_LEN - 1] = '\0';
  19     strncpy(t->name, name, MAX_TUBE_NAME_LEN - 1);
  20     if (t->name[MAX_TUBE_NAME_LEN - 1] != '\0') twarnx("truncating tube name");
  21
  22     t->ready.cap = 0;
  23     t->delay.cap = 0;
  24     t->ready.len = 0;
  25     t->delay.len = 0;
  26     t->ready.data = NULL;
  27     t->delay.data = NULL;
  28
  29     t->ready.less = job_pri_less;
  30     t->delay.less = job_delay_less;
  31     t->ready.rec = job_setheappos;
  32     t->delay.rec = job_setheappos;
  33     t->buried = (struct job) { };
  34     t->buried.prev = t->buried.next = &t->buried;
  35     ms_init(&t->waiting, NULL, NULL);
  36
  37     t->stat = (struct stats) {0, 0, 0, 0, 0};
  38     t->using_ct = t->watching_ct = 0;
  39     t->deadline_at = t->pause = 0;
  40
  41     return t;
  42 }
  43
  44 static void
  45 tube_free(tube t)
  46 {
  47     prot_remove_tube(t);
  48     free(t->ready.data);
  49     free(t->delay.data);
  50     ms_clear(&t->waiting);
  51     free(t);
  52 }
  53
  54 void
  55 tube_dref(tube t)
  56 {
  57     if (!t) return;
  58     if (t->refs < 1) return twarnx("refs is zero for tube: %s", t->name);
  59
  60     --t->refs;
  61     if (t->refs < 1) tube_free(t);
  62 }
  63
  64 void
  65 tube_iref(tube t)
  66 {
  67     if (!t) return;
  68     ++t->refs;
  69 }
  70
  71 static tube
  72 make_and_insert_tube(const char *name)
  73 {
  74     int r;
  75     tube t = NULL;
  76
  77     t = make_tube(name);
  78     if (!t) return NULL;
  79
  80     /* We want this global tube list to behave like "weak" refs, so don't
  81      * increment the ref count. */
  82     r = ms_append(&tubes, t);
  83     if (!r) return tube_dref(t), (tube) 0;
  84
  85     return t;
  86 }
  87
  88 tube
  89 tube_find(const char *name)
  90 {
  91     tube t;
  92     size_t i;
  93
  94     for (i = 0; i < tubes.used; i++) {
  95         t = tubes.items[i];
  96         if (strncmp(t->name, name, MAX_TUBE_NAME_LEN) == 0) return t;
  97     }
  98     return NULL;
  99 }
 100
 101 tube
 102 tube_find_or_make(const char *name)
 103 {
 104     return tube_find(name) ? : make_and_insert_tube(name);
 105 }
 106