212 	int n_changes = 0;  in kq_build_changes_list()  local
214 	for (i = 0; i < changelist->n_changes; ++i) {  in kq_build_changes_list()
217 		if (n_changes >= kqop->changes_size - 1) {  in kq_build_changes_list()
239 			out_ch = &kqop->changes[n_changes++];  in kq_build_changes_list()
244 			out_ch = &kqop->changes[n_changes++];  in kq_build_changes_list()
249 	return n_changes;  in kq_build_changes_list()
276 	int i, n_changes, res;  in kq_dispatch()  local
286 	n_changes = kq_build_changes_list(&base->changelist, kqop);  in kq_dispatch()
287 	if (n_changes < 0)  in kq_dispatch()
306 	if (kqop->events_size < n_changes) {  in kq_dispatch()
310 		} while (new_size < n_changes);  in kq_dispatch()
318 	res = kevent(kqop->kq, changes, n_changes,  in kq_dispatch()