Lines Matching full:n_changes
204 int n_changes = 0;
206 for (i = 0; i < changelist->n_changes; ++i) {
209 if (n_changes >= kqop->changes_size - 1) {
223 out_ch = &kqop->changes[n_changes++];
228 out_ch = &kqop->changes[n_changes++];
233 return n_changes;
260 int i, n_changes, res;
270 n_changes = kq_build_changes_list(&base->changelist, kqop);
271 if (n_changes < 0)
290 if (kqop->events_size < n_changes) {
294 } while (new_size < n_changes);
302 res = kevent(kqop->kq, changes, n_changes,
