Skip to content
Snippets Groups Projects
Commit be009de7 authored by aidan's avatar aidan
Browse files

Potential fix to the queue_task_overlap function

parent 6ef308ab
No related branches found
No related tags found
No related merge requests found
......@@ -59,13 +59,13 @@ float queue_task_overlap ( struct qsched *s , qsched_task_t a , qsched_task_t b
if (nr_res_a == 0 || nr_res_b == 0) return nr_res_a == nr_res_b ? 1.0f : 0.0f;
struct res *res_a[nr_res_a], *res_b[nr_res_b];
for (int k = 0; k < ta->nr_locks; k++)
res_a[k] = &s->res[s->locks[ta->locks[k]]];
res_a[k] = &s->res[ta->locks[k]];
for (int k = 0; k < ta->nr_uses; k++)
res_a[ta->nr_locks + k] = &s->res[s->locks[ta->uses[k]]];
res_a[ta->nr_locks + k] = &s->res[ta->uses[k]];
for (int k = 0; k < tb->nr_locks; k++)
res_b[k] = &s->res[s->locks[tb->locks[k]]];
res_b[k] = &s->res[tb->locks[k]];
for (int k = 0; k < tb->nr_uses; k++)
res_b[tb->nr_locks + k] = &s->res[s->locks[tb->uses[k]]];
res_b[tb->nr_locks + k] = &s->res[tb->uses[k]];
/* Compute the resource union, which is just the sum of the
resource sizes. */
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment