testjobs.c

   1 #include "ct/ct.h"
   2 #include "dat.h"
   3 #include <stdint.h>
   4 #include <stdlib.h>
   5 #include <stdio.h>
   6 #include <string.h>
   7 #include <sys/time.h>
   8
   9 static Tube *default_tube;
  10
  11 void
  12 cttest_job_creation()
  13 {
  14     Job *j;
  15
  16     TUBE_ASSIGN(default_tube, make_tube("default"));
  17     j = make_job(1, 0, 1, 0, default_tube);
  18     assertf(j->r.pri == 1, "priority should match");
  19 }
  20
  21 void
  22 cttest_job_cmp_pris()
  23 {
  24     Job *a, *b;
  25
  26     TUBE_ASSIGN(default_tube, make_tube("default"));
  27     a = make_job(1, 0, 1, 0, default_tube);
  28     b = make_job(1 << 27, 0, 1, 0, default_tube);
  29
  30     assertf(job_pri_less(a, b), "should be less");
  31 }
  32
  33 void
  34 cttest_job_cmp_ids()
  35 {
  36     Job *a, *b;
  37
  38     TUBE_ASSIGN(default_tube, make_tube("default"));
  39     a = make_job(1, 0, 1, 0, default_tube);
  40     b = make_job(1, 0, 1, 0, default_tube);
  41
  42     b->r.id <<= 49;
  43     assertf(job_pri_less(a, b), "should be less");
  44 }
  45
  46 void
  47 cttest_job_large_pris()
  48 {
  49     Job *a, *b;
  50
  51     TUBE_ASSIGN(default_tube, make_tube("default"));
  52     a = make_job(1, 0, 1, 0, default_tube);
  53     b = make_job(-5, 0, 1, 0, default_tube);
  54
  55     assertf(job_pri_less(a, b), "should be less");
  56
  57     a = make_job(-5, 0, 1, 0, default_tube);
  58     b = make_job(1, 0, 1, 0, default_tube);
  59
  60     assertf(!job_pri_less(a, b), "should not be less");
  61 }
  62
  63 void
  64 cttest_job_hash_free()
  65 {
  66     Job *j;
  67     uint64 jid = 83;
  68
  69     TUBE_ASSIGN(default_tube, make_tube("default"));
  70     j = make_job_with_id(0, 0, 1, 0, default_tube, jid);
  71     job_free(j);
  72
  73     assertf(!job_find(jid), "job should be missing");
  74 }
  75
  76 void
  77 cttest_job_hash_free_next()
  78 {
  79     Job *a, *b;
  80     uint64 aid = 97, bid = 12386;
  81
  82     TUBE_ASSIGN(default_tube, make_tube("default"));
  83     b = make_job_with_id(0, 0, 1, 0, default_tube, bid);
  84     a = make_job_with_id(0, 0, 1, 0, default_tube, aid);
  85
  86     assertf(a->ht_next == b, "b should be chained to a");
  87
  88     job_free(b);
  89
  90     assertf(a->ht_next == NULL, "job should be missing");
  91 }
  92
  93 void
  94 cttest_job_all_jobs_used()
  95 {
  96     Job *j, *x;
  97
  98     TUBE_ASSIGN(default_tube, make_tube("default"));
  99     j = make_job(0, 0, 1, 0, default_tube);
 100     assertf(get_all_jobs_used() == 1, "should match");
 101
 102     x = allocate_job(10);
 103     assertf(get_all_jobs_used() == 1, "should match");
 104
 105     job_free(x);
 106     assertf(get_all_jobs_used() == 1, "should match");
 107
 108     job_free(j);
 109     assertf(get_all_jobs_used() == 0, "should match");
 110 }
 111
 112 void
 113 cttest_job_100_000_jobs()
 114 {
 115     int i;
 116
 117     TUBE_ASSIGN(default_tube, make_tube("default"));
 118     for (i = 0; i < 100000; i++) {
 119         make_job(0, 0, 1, 0, default_tube);
 120     }
 121     assertf(get_all_jobs_used() == 100000, "should match");
 122
 123     for (i = 1; i <= 100000; i++) {
 124         job_free(job_find(i));
 125     }
 126     fprintf(stderr, "get_all_jobs_used() => %zu\n", get_all_jobs_used());
 127     assertf(get_all_jobs_used() == 0, "should match");
 128 }
 129
 130 void
 131 ctbench_job_make(int n)
 132 {
 133     int i;
 134     Job **j = calloc(n, sizeof *j);
 135     TUBE_ASSIGN(default_tube, make_tube("default"));
 136
 137     ctresettimer();
 138     for (i = 0; i < n; i++) {
 139         j[i] = make_job(0, 0, 1, 0, default_tube);
 140     }
 141     ctstoptimer();
 142
 143     for (i = 0; i < n; i++) {
 144         job_free(j[i]);
 145     }
 146     free(j);
 147 }
 148
 149 void
 150 ctbench_job_free(int n)
 151 {
 152     int i;
 153     Job **j = calloc(n, sizeof *j);
 154     TUBE_ASSIGN(default_tube, make_tube("default"));
 155     for (i = 0; i < n; i++) {
 156         j[i] = make_job(0, 0, 1, 0, default_tube);
 157     }
 158
 159     ctresettimer();
 160     for (i = 0; i < n; i++) {
 161         job_free(j[i]);
 162     }
 163     ctstoptimer();
 164
 165     free(j);
 166 }