summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
ea189af)
->pre_select() methods should never fail, and tasks should not
set this variable at all. It is ignored anyway when set there.
{
struct receiver_node *rn = container_of(t, struct receiver_node, task);
{
struct receiver_node *rn = container_of(t, struct receiver_node, task);
if (generic_recv_pre_select(s, t) <= 0)
return;
para_fd_set(rn->fd, &s->rfds, &s->max_fileno);
if (generic_recv_pre_select(s, t) <= 0)
return;
para_fd_set(rn->fd, &s->rfds, &s->max_fileno);
{
struct filter_node *fn = container_of(t, struct filter_node, task);
{
struct filter_node *fn = container_of(t, struct filter_node, task);
if (btr_node_status(fn->btrn, fn->min_iqs, BTR_NT_INTERNAL) != 0)
sched_min_delay(s);
}
if (btr_node_status(fn->btrn, fn->min_iqs, BTR_NT_INTERNAL) != 0)
sched_min_delay(s);
}
struct receiver_node *rn = container_of(t, struct receiver_node, task);
int ret = btr_node_status(rn->btrn, 0, BTR_NT_ROOT);
struct receiver_node *rn = container_of(t, struct receiver_node, task);
int ret = btr_node_status(rn->btrn, 0, BTR_NT_ROOT);
if (ret < 0)
sched_min_delay(s);
return ret;
if (ret < 0)
sched_min_delay(s);
return ret;
struct filter_node *fn = container_of(t, struct filter_node, task);
size_t iqs = btr_get_input_queue_size(fn->btrn);
struct filter_node *fn = container_of(t, struct filter_node, task);
size_t iqs = btr_get_input_queue_size(fn->btrn);
if (iqs == 0)
return;
sched_min_delay(s);
if (iqs == 0)
return;
sched_min_delay(s);