blob: 215f6781c0d6db05805da5d80b26ec1f0c0c3cb7 (
plain) (
tree)
|
|
#include <errno.h>
#include <queue.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;
}
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);
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;
}
if (conformity_cur == conformity_max &&
selected->deps_filled > j->deps_filled) {
selected = j;
}
}
if (selected == NULL)
return -ESRCH;
*max_build -= builds_isolated(selected);
*job = selected;
return 0;
}
|