forked from beanstalkd/beanstalkd
/
test_job.c
118 lines (86 loc) · 2.07 KB
/
test_job.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <stdlib.h>
#include <stdio.h>
#include "../cut.h"
#include "../tube.h"
#include "../job.h"
#include "../util.h"
#include "../pq.h"
static tube default_tube;
void
__CUT_BRINGUP__job()
{
job_init();
TUBE_ASSIGN(default_tube, make_tube("default"));
}
void
__CUT__job_test_creation()
{
job j;
j = make_job(1, 0, 1, 0, default_tube);
ASSERT(j->pri == 1, "priority should match");
}
void
__CUT__job_test_cmp_pris()
{
job a, b;
a = make_job(1, 0, 1, 0, default_tube);
b = make_job(1 << 27, 0, 1, 0, default_tube);
ASSERT(job_pri_cmp(a, b) < 0, "should be a < b");
}
void
__CUT__job_test_cmp_ids()
{
job a, b;
a = make_job(1, 0, 1, 0, default_tube);
b = make_job(1, 0, 1, 0, default_tube);
b->id <<= 49;
ASSERT(job_pri_cmp(a, b) < 0, "should be a < b");
}
void
__CUT__job_test_large_pris()
{
job a, b;
a = make_job(1, 0, 1, 0, default_tube);
b = make_job(-5, 0, 1, 0, default_tube);
ASSERT(job_pri_cmp(a, b) < 0, "should be a < b");
a = make_job(-5, 0, 1, 0, default_tube);
b = make_job(1, 0, 1, 0, default_tube);
ASSERT(job_pri_cmp(a, b) > 0, "should be a > b");
}
void
__CUT__job_test_hash_free()
{
job j;
uint64_t jid = 83;
j = make_job_with_id(0, 0, 1, 0, default_tube, jid);
job_free(j);
ASSERT(!job_find(jid), "job should be missing");
}
void
__CUT__job_test_hash_free_next()
{
job a, b;
uint64_t aid = 97, bid = 12386;
b = make_job_with_id(0, 0, 1, 0, default_tube, bid);
a = make_job_with_id(0, 0, 1, 0, default_tube, aid);
ASSERT(a->ht_next == b, "b should be chained to a");
job_free(b);
ASSERT(a->ht_next == NULL, "job should be missing");
}
void
__CUT__job_test_all_jobs_used()
{
job j, x;
j = make_job(0, 0, 1, 0, default_tube);
ASSERT(get_all_jobs_used() == 1, "should match");
x = allocate_job(10);
ASSERT(get_all_jobs_used() == 1, "should match");
job_free(x);
ASSERT(get_all_jobs_used() == 1, "should match");
job_free(j);
ASSERT(get_all_jobs_used() == 0, "should match");
}
void
__CUT_TAKEDOWN__job()
{
}