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
|
#include <errno.h>
#include <queue.h>
#include "evanix.h"
#include "jobs.h"
#include "queue.h"
#include "solver_greedy.h"
#include "util.h"
static float conformity(struct job *job);
static int32_t builds_isolated(struct job *job);
/* conformity is a ratio between number of direct feasible derivations sharing
* dependencies of a derivation and total number of dependencies */
static float conformity(struct job *job)
{
float conformity = 0;
if (job->deps_filled == 0)
return 0;
for (size_t i = 0; i < job->deps_filled; i++) {
for (size_t j = 0; j < job->deps[i]->parents_filled; j++) {
/* don't count the job itself */
if (job->deps[i]->parents[j] == job)
continue;
/* don't count stale parents */
if (job->deps[i]->parents[j]->stale)
continue;
conformity++;
}
}
conformity /= job->deps_filled;
return conformity;
}
static int32_t builds_isolated(struct job *job)
{
return job->deps_filled + 1;
}
static void solver_report(struct job *job, int32_t max_build)
{
if (!evanix_opts.solver_report)
return;
else if (job->reported)
return;
job->reported = true;
printf("❌ cost: %2d > %2d <-> %s -> %s\n", builds_isolated(job),
max_build, job->name, job->drv_path);
for (size_t i = 0; i < job->parents_filled; i++)
solver_report(job->parents[i], max_build);
}
int solver_greedy(struct job_clist *q, int32_t *max_build, struct job **job)
{
struct job *j;
float conformity_cur;
struct job *selected = NULL;
float conformity_max = -1;
CIRCLEQ_FOREACH (j, q, clist) {
if (j->stale) {
continue;
} else if (builds_isolated(j) > *max_build) {
job_stale_set(j);
solver_report(j, *max_build);
continue;
}
}
CIRCLEQ_FOREACH (j, q, clist) {
if (j->stale)
continue;
conformity_cur = conformity(j);
if (conformity_cur > conformity_max) {
conformity_max = conformity_cur;
selected = j;
} else if (conformity_cur == conformity_max &&
selected->deps_filled > j->deps_filled) {
selected = j;
}
if (!evanix_opts.solver_report)
continue;
printf("ℹ️ cost: %2d, conformity: %.2f <-> %s -> %s\n",
builds_isolated(j), conformity_cur, j->name,
j->drv_path);
}
if (selected == NULL)
return -ESRCH;
if (evanix_opts.solver_report)
printf("✅ cost: %2d, conformity: %.2f <-> %s -> %s\n",
builds_isolated(selected), conformity_max,
selected->name, selected->drv_path);
*max_build -= builds_isolated(selected);
*job = selected;
return 0;
}
|
