Searched refs:n_changes (Results 1 – 4 of 4) sorted by relevance
204 int n_changes = 0; in kq_build_changes_list() local206 for (i = 0; i < changelist->n_changes; ++i) { in kq_build_changes_list()209 if (n_changes >= kqop->changes_size - 1) { in kq_build_changes_list()223 out_ch = &kqop->changes[n_changes++]; in kq_build_changes_list()228 out_ch = &kqop->changes[n_changes++]; in kq_build_changes_list()233 return n_changes; in kq_build_changes_list()260 int i, n_changes, res; in kq_dispatch() local270 n_changes = kq_build_changes_list(&base->changelist, kqop); in kq_dispatch()271 if (n_changes < 0) in kq_dispatch()290 if (kqop->events_size < n_changes) { in kq_dispatch()[all …]
701 changelist->n_changes = 0;746 EVUTIL_ASSERT(changelist->changes_size >= changelist->n_changes);747 for (i = 0; i < changelist->n_changes; ++i) {775 for (i = 0; i < changelist->n_changes; ++i) {783 changelist->n_changes = 0;833 EVUTIL_ASSERT(changelist->n_changes <= changelist->changes_size);835 if (changelist->n_changes == changelist->changes_size) {840 idx = changelist->n_changes++;
185 int n_changes; member
365 for (i = 0; i < changelist->n_changes; ++i) { in epoll_apply_changes()