job-test.c

   1 #include <stdint.h>
   2 #include <stdlib.h>
   3 #include <stdio.h>
   4 #include <string.h>
   5 #include <sys/time.h>
   6
   7 #include "ct/ct.h"
   8 #include "dat.h"
   9
  10 static tube default_tube;
  11
  12 void
  13 cttestjob_creation()
  14 {
  15     job j;
  16
  17     TUBE_ASSIGN(default_tube, make_tube("default"));
  18     j = make_job(1, 0, 1, 0, default_tube);
  19     assertf(j->pri == 1, "priority should match");
  20 }
  21
  22 void
  23 cttestjob_cmp_pris()
  24 {
  25     job a, b;
  26
  27     TUBE_ASSIGN(default_tube, make_tube("default"));
  28     a = make_job(1, 0, 1, 0, default_tube);
  29     b = make_job(1 << 27, 0, 1, 0, default_tube);
  30
  31     assertf(job_pri_cmp(a, b) < 0, "should be a < b");
  32 }
  33
  34 void
  35 cttestjob_cmp_ids()
  36 {
  37     job a, b;
  38
  39     TUBE_ASSIGN(default_tube, make_tube("default"));
  40     a = make_job(1, 0, 1, 0, default_tube);
  41     b = make_job(1, 0, 1, 0, default_tube);
  42
  43     b->id <<= 49;
  44     assertf(job_pri_cmp(a, b) < 0, "should be a < b");
  45 }
  46
  47
  48 void
  49 cttestjob_large_pris()
  50 {
  51     job a, b;
  52
  53     TUBE_ASSIGN(default_tube, make_tube("default"));
  54     a = make_job(1, 0, 1, 0, default_tube);
  55     b = make_job(-5, 0, 1, 0, default_tube);
  56
  57     assertf(job_pri_cmp(a, b) < 0, "should be a < b");
  58
  59     a = make_job(-5, 0, 1, 0, default_tube);
  60     b = make_job(1, 0, 1, 0, default_tube);
  61
  62     assertf(job_pri_cmp(a, b) > 0, "should be a > b");
  63 }
  64
  65 void
  66 cttestjob_hash_free()
  67 {
  68     job j;
  69     uint64 jid = 83;
  70
  71     TUBE_ASSIGN(default_tube, make_tube("default"));
  72     j = make_job_with_id(0, 0, 1, 0, default_tube, jid);
  73     job_free(j);
  74
  75     assertf(!job_find(jid), "job should be missing");
  76 }
  77
  78 void
  79 cttestjob_hash_free_next()
  80 {
  81     job a, b;
  82     uint64 aid = 97, bid = 12386;
  83
  84     TUBE_ASSIGN(default_tube, make_tube("default"));
  85     b = make_job_with_id(0, 0, 1, 0, default_tube, bid);
  86     a = make_job_with_id(0, 0, 1, 0, default_tube, aid);
  87
  88     assertf(a->ht_next == b, "b should be chained to a");
  89
  90     job_free(b);
  91
  92     assertf(a->ht_next == NULL, "job should be missing");
  93 }
  94
  95 void
  96 cttestjob_all_jobs_used()
  97 {
  98     job j, x;
  99
 100     TUBE_ASSIGN(default_tube, make_tube("default"));
 101     j = make_job(0, 0, 1, 0, default_tube);
 102     assertf(get_all_jobs_used() == 1, "should match");
 103
 104     x = allocate_job(10);
 105     assertf(get_all_jobs_used() == 1, "should match");
 106
 107     job_free(x);
 108     assertf(get_all_jobs_used() == 1, "should match");
 109
 110     job_free(j);
 111     assertf(get_all_jobs_used() == 0, "should match");
 112 }
 113
 114 void
 115 cttestjob_100_000_jobs()
 116 {
 117     int i;
 118
 119     TUBE_ASSIGN(default_tube, make_tube("default"));
 120     for (i = 0; i < 100000; i++) {
 121         make_job(0, 0, 1, 0, default_tube);
 122     }
 123     assertf(get_all_jobs_used() == 100000, "should match");
 124
 125     for (i = 1; i <= 100000; i++) {
 126         job_free(job_find(i));
 127     }
 128     fprintf(stderr, "get_all_jobs_used() => %zu\n", get_all_jobs_used());
 129     assertf(get_all_jobs_used() == 0, "should match");
 130 }