10 static tube default_tube
;
16 TUBE_ASSIGN(default_tube
, make_tube("default"));
20 __CUT__job_test_creation()
24 j
= make_job(1, 0, 1, 0, default_tube
);
25 ASSERT(j
->pri
== 1, "priority should match");
29 __CUT__job_test_cmp_pris()
33 a
= make_job(1, 0, 1, 0, default_tube
);
34 b
= make_job(1 << 27, 0, 1, 0, default_tube
);
36 ASSERT(job_pri_cmp(a
, b
) < 0, "should be a < b");
40 __CUT__job_test_cmp_ids()
44 a
= make_job(1, 0, 1, 0, default_tube
);
45 b
= make_job(1, 0, 1, 0, default_tube
);
48 ASSERT(job_pri_cmp(a
, b
) < 0, "should be a < b");
53 __CUT__job_test_large_pris()
57 a
= make_job(1, 0, 1, 0, default_tube
);
58 b
= make_job(-5, 0, 1, 0, default_tube
);
60 ASSERT(job_pri_cmp(a
, b
) < 0, "should be a < b");
62 a
= make_job(-5, 0, 1, 0, default_tube
);
63 b
= make_job(1, 0, 1, 0, default_tube
);
65 ASSERT(job_pri_cmp(a
, b
) > 0, "should be a > b");
69 __CUT__job_test_hash_free()
72 unsigned long long int jid
= 83;
74 j
= make_job_with_id(0, 0, 1, 0, default_tube
, jid
);
77 ASSERT(!job_find(jid
), "job should be missing");
81 __CUT__job_test_hash_free_next()
84 unsigned long long int aid
= 97, bid
= 12386;
86 b
= make_job_with_id(0, 0, 1, 0, default_tube
, bid
);
87 a
= make_job_with_id(0, 0, 1, 0, default_tube
, aid
);
89 ASSERT(a
->ht_next
== b
, "b should be chained to a");
93 ASSERT(a
->ht_next
== NULL
, "job should be missing");
97 __CUT__job_test_all_jobs_used()
101 j
= make_job(0, 0, 1, 0, default_tube
);
102 ASSERT(get_all_jobs_used() == 1, "should match");
104 x
= allocate_job(10);
105 ASSERT(get_all_jobs_used() == 1, "should match");
108 ASSERT(get_all_jobs_used() == 1, "should match");
111 ASSERT(get_all_jobs_used() == 0, "should match");
115 __CUT_TAKEDOWN__job()