204 	int n_changes = 0;  in kq_build_changes_list()  local
206 	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()  local
270 	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()
294 		} while (new_size < n_changes);  in kq_dispatch()
302 	res = kevent(kqop->kq, changes, n_changes,  in kq_dispatch()