return 1;
}
-int prioq_reshuffle(Prioq *q, void *data, unsigned *idx) {
+void prioq_reshuffle(Prioq *q, void *data, unsigned *idx) {
struct prioq_item *i;
unsigned k;
i = find_item(q, data, idx);
if (!i)
- return 0;
+ return;
k = i - q->items;
k = shuffle_down(q, k);
shuffle_up(q, k);
- return 1;
}
void *prioq_peek_by_index(Prioq *q, unsigned idx) {
int prioq_put(Prioq *q, void *data, unsigned *idx);
int prioq_ensure_put(Prioq **q, compare_func_t compare_func, void *data, unsigned *idx);
int prioq_remove(Prioq *q, void *data, unsigned *idx);
-int prioq_reshuffle(Prioq *q, void *data, unsigned *idx);
+void prioq_reshuffle(Prioq *q, void *data, unsigned *idx);
void *prioq_peek_by_index(Prioq *q, unsigned idx) _pure_;
static inline void *prioq_peek(Prioq *q) {
if (c->in_lru) {
assert(c->n_ref == 0);
- assert_se(prioq_reshuffle(s->client_contexts_lru, c, &c->lru_index) >= 0);
+ prioq_reshuffle(s->client_contexts_lru, c, &c->lru_index);
}
}
break;
s->prepare_iteration = e->iteration;
- r = prioq_reshuffle(e->prepare, s, &s->prepare_index);
- if (r < 0)
- return r;
+ prioq_reshuffle(e->prepare, s, &s->prepare_index);
assert(s->prepare);
-
s->dispatching = true;
r = s->prepare(s, s->userdata);
s->dispatching = false;