Searched refs:n_changes (Results 1 – 8 of 8) sorted by relevance
209 int n_changes = 0; in kq_build_changes_list() local 211 for (i = 0; i < changelist->n_changes; ++i) { in kq_build_changes_list() 214 if (n_changes >= kqop->changes_size - 1) { in kq_build_changes_list() 236 out_ch = &kqop->changes[n_changes++]; in kq_build_changes_list() 241 out_ch = &kqop->changes[n_changes++]; in kq_build_changes_list() 246 return n_changes; in kq_build_changes_list() 273 int i, n_changes, res; in kq_dispatch() local 283 n_changes = kq_build_changes_list(&base->changelist, kqop); in kq_dispatch() 284 if (n_changes < 0) in kq_dispatch() 303 if (kqop->events_size < n_changes) { in kq_dispatch() [all...]
712 changelist->n_changes = 0;757 EVUTIL_ASSERT(changelist->changes_size >= changelist->n_changes);758 for (i = 0; i < changelist->n_changes; ++i) {786 for (i = 0; i < changelist->n_changes; ++i) {794 changelist->n_changes = 0;844 EVUTIL_ASSERT(changelist->n_changes <= changelist->changes_size);846 if (changelist->n_changes == changelist->changes_size) {851 idx = changelist->n_changes++;
185 int n_changes; member
365 for (i = 0; i < changelist->n_changes; ++i) { in epoll_apply_changes()
209 int n_changes = 0; in kq_build_changes_list() local211 for (i = 0; i < changelist->n_changes; ++i) { in kq_build_changes_list()214 if (n_changes >= kqop->changes_size - 1) { in kq_build_changes_list()236 out_ch = &kqop->changes[n_changes++]; in kq_build_changes_list()241 out_ch = &kqop->changes[n_changes++]; in kq_build_changes_list()246 return n_changes; in kq_build_changes_list()273 int i, n_changes, res; in kq_dispatch() local283 n_changes = kq_build_changes_list(&base->changelist, kqop); in kq_dispatch()284 if (n_changes < 0) in kq_dispatch()303 if (kqop->events_size < n_changes) { in kq_dispatch()[all …]