82 	event_t map = evp->cb_map;  in InitEvP()
99 	EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, evp->cb_map) {  in CleanupEvP()
101 	} EVENT_FOREACH_END(ev, evp->cb_map);  in CleanupEvP()
103 	if (!evp->cb_map)  in CleanupEvP()
106 	EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, evp->cb_map) {  in CleanupEvP()
108 	} EVENT_FOREACH_END(ev, evp->cb_map);  in CleanupEvP()
119 	evb->dflt_evp.cb_map = 0;  in InitEvB()
148 	assert(!(evp->cb_map & events));  in RegCbWCpy()
149 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in RegCbWCpy()
152 	ev_total = events | evp->cb_map;  in RegCbWCpy()
153 	evcpy = evp->cb_map & ~new_evt->map;  in RegCbWCpy()
156 	ev_inc_ref = events | evp->cb_map;  in RegCbWCpy()
157 	ev_dec_ref = evp->cb_map;  in RegCbWCpy()
160 	evp->cb_map |= events;  in RegCbWCpy()
228 	assert(!(evp->cb_map & events));  in RegCbWoCpy()
229 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in RegCbWoCpy()
234 	evp->cb_map |= events;  in RegCbWoCpy()
284 	evp->cb_map &= ~events;  in UnregCb()
294 					!(evid & evp->cb_map)  in UnregCb()
296 					&& !(g_descendants[walk] & evp->cb_map)) {  in UnregCb()
338 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in FindReusableEvT()
341 		event_t overlap = evp->cb_map & walk->map;  in FindReusableEvT()
388 		if (events & evp->cb_map) {  in ModCb()
412 		if ((events & evp->cb_map) != events) {  in ModCb()
602 	uint64_t cb_map, ft_map;  in HandleCallback()  local
636 	if (!evp || !((cb_map = events & evp->cb_map) || (g_ude_map & evp->cb_map)))  in HandleCallback()
661 	event_t bev_map = cb_map | ft_map;  in HandleCallback()
679 			cb_map |= descendants & evp->cb_map;  in HandleCallback()
686 			if (cb_map & ev) {  in HandleCallback()
690 				if (!(cb_map &= ~ev))  in HandleCallback()
711 				if (((1L << ude_id) & (cb_map | ft_map)) &&  in HandleCallback()