143 	struct ev_table *cur_evt = evp->evt;  in RegCbWCpy()  local
149 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in RegCbWCpy()
170 			assert(new_evt && new_evt != cur_evt);  in RegCbWCpy()
171 			new_evt->ent[i].cb = cur_evt->ent[i].cb;  in RegCbWCpy()
180 				if (--cur_evt->ent[i].ref)  in RegCbWCpy()
181 					cur_evt->map &= ~ev;  in RegCbWCpy()
201 			assert(new_evt && new_evt != cur_evt);  in RegCbWCpy()
202 			new_evt->ent[i].cb = cur_evt->ent[i].cb;  in RegCbWCpy()
211 				if (--cur_evt->ent[i].ref)  in RegCbWCpy()
212 					cur_evt->map &= ~ev;  in RegCbWCpy()
224 	struct ev_table *cur_evt = evp->evt;  in RegCbWoCpy()  local
226 	event_t overlap = events & cur_evt->map;  in RegCbWoCpy()
229 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in RegCbWoCpy()
233 	cur_evt->map |= events;  in RegCbWoCpy()
239 			assert((ev & overlap) ? cur_evt->ent[i].cb == cb  in RegCbWoCpy()
240 								  : cur_evt->ent[i].ref == 0);  in RegCbWoCpy()
242 				cur_evt->ent[i].cb = cb;  in RegCbWoCpy()
247 			cur_evt->ent[i].ref++;  in RegCbWoCpy()
248 			if (!(cur_evt->map & ev))  in RegCbWoCpy()
249 				cur_evt->map |= ev;  in RegCbWoCpy()
259 			assert((ev & overlap) ? cur_evt->ent[i].cb == cb  in RegCbWoCpy()
260 								  : cur_evt->ent[i].ref == 0);  in RegCbWoCpy()
262 				cur_evt->ent[i].cb = cb;  in RegCbWoCpy()
271 			cur_evt->ent[i].ref++;  in RegCbWoCpy()
272 			if (!(cur_evt->map & ev))  in RegCbWoCpy()
273 				cur_evt->map |= ev;  in RegCbWoCpy()
335 	struct ev_table *cur_evt = evp->evt;  in FindReusableEvT()  local
338 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in FindReusableEvT()
350 				if (walk->ent[i].cb != cur_evt->ent[i].cb)  in FindReusableEvT()
363 				if (walk->ent[i].cb != cur_evt->ent[i].cb)  in FindReusableEvT()