testjobs.c

   1 #include <stdint.h>
   2 #include <stdlib.h>
   3 #include <stdio.h>
   4 #include <string.h>
   5 #include <sys/time.h>
   6 #include "ct/ct.h"
   7 #include "dat.h"
   8
   9 static tube default_tube;
  10
  11 void
  12 cttestjob_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 cttestjob_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 cttestjob_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
  47 void
  48 cttestjob_large_pris()
  49 {
  50     job a, b;
  51
  52     TUBE_ASSIGN(default_tube, make_tube("default"));
  53     a = make_job(1, 0, 1, 0, default_tube);
  54     b = make_job(-5, 0, 1, 0, default_tube);
  55
  56     assertf(job_pri_less(a, b), "should be less");
  57
  58     a = make_job(-5, 0, 1, 0, default_tube);
  59     b = make_job(1, 0, 1, 0, default_tube);
  60
  61     assertf(!job_pri_less(a, b), "should not be less");
  62 }
  63
  64 void
  65 cttestjob_hash_free()
  66 {
  67     job j;
  68     uint64 jid = 83;
  69
  70     TUBE_ASSIGN(default_tube, make_tube("default"));
  71     j = make_job_with_id(0, 0, 1, 0, default_tube, jid);
  72     job_free(j);
  73
  74     assertf(!job_find(jid), "job should be missing");
  75 }
  76
  77 void
  78 cttestjob_hash_free_next()
  79 {
  80     job a, b;
  81     uint64 aid = 97, bid = 12386;
  82
  83     TUBE_ASSIGN(default_tube, make_tube("default"));
  84     b = make_job_with_id(0, 0, 1, 0, default_tube, bid);
  85     a = make_job_with_id(0, 0, 1, 0, default_tube, aid);
  86
  87     assertf(a->ht_next == b, "b should be chained to a");
  88
  89     job_free(b);
  90
  91     assertf(a->ht_next == NULL, "job should be missing");
  92 }
  93
  94 void
  95 cttestjob_all_jobs_used()
  96 {
  97     job j, x;
  98
  99     TUBE_ASSIGN(default_tube, make_tube("default"));
 100     j = make_job(0, 0, 1, 0, default_tube);
 101     assertf(get_all_jobs_used() == 1, "should match");
 102
 103     x = allocate_job(10);
 104     assertf(get_all_jobs_used() == 1, "should match");
 105
 106     job_free(x);
 107     assertf(get_all_jobs_used() == 1, "should match");
 108
 109     job_free(j);
 110     assertf(get_all_jobs_used() == 0, "should match");
 111 }
 112
 113 void
 114 cttestjob_100_000_jobs()
 115 {
 116     int i;
 117
 118     TUBE_ASSIGN(default_tube, make_tube("default"));
 119     for (i = 0; i < 100000; i++) {
 120         make_job(0, 0, 1, 0, default_tube);
 121     }
 122     assertf(get_all_jobs_used() == 100000, "should match");
 123
 124     for (i = 1; i <= 100000; i++) {
 125         job_free(job_find(i));
 126     }
 127     fprintf(stderr, "get_all_jobs_used() => %zu\n", get_all_jobs_used());
 128     assertf(get_all_jobs_used() == 0, "should match");
 129 }
 130
 131 void
 132 ctbenchmakejob(int n)
 133 {
 134     int i;
 135     TUBE_ASSIGN(default_tube, make_tube("default"));
 136     for (i = 0; i < n; i++) {
 137         make_job(0, 0, 1, 0, default_tube);
 138     }
 139 }