31 #define EVENT_FOREACH_START(ev, idx, from, to, map) \  argument
33 	const event_t ev = 1L << idx; if (!((map) & (ev))) continue; 
34 #define EVENT_FOREACH_END(ev, map) \  argument
35 	if (!((map) &= ~ev)) break;}} while (0)
82 	event_t map = evp->cb_map;  in InitEvP()  local
84 	EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, map) {  in InitEvP()
86 	} EVENT_FOREACH_END(ev, map);  in InitEvP()
88 	if (!map)  in InitEvP()
91 	EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, map) {  in InitEvP()
93 	} EVENT_FOREACH_END(ev, map);  in InitEvP()
145 	event_t overlap = events & new_evt->map;  in RegCbWCpy()
149 	assert((evp->cb_map & cur_evt->map) == evp->cb_map);  in RegCbWCpy()
153 	evcpy = evp->cb_map & ~new_evt->map;  in RegCbWCpy()
159 	new_evt->map |= ev_total;  in RegCbWCpy()
177 			if (!(new_evt->map & ev))  in RegCbWCpy()
178 				new_evt->map |= ev;  in RegCbWCpy()
181 					cur_evt->map &= ~ev;  in RegCbWCpy()
208 			if (!(new_evt->map & ev))  in RegCbWCpy()
209 				new_evt->map |= ev;  in RegCbWCpy()
212 					cur_evt->map &= ~ev;  in RegCbWCpy()
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()
248 			if (!(cur_evt->map & ev))  in RegCbWoCpy()
249 				cur_evt->map |= ev;  in RegCbWoCpy()
272 			if (!(cur_evt->map & ev))  in RegCbWoCpy()
273 				cur_evt->map |= ev;  in RegCbWoCpy()
319 			evt->map &= ~ev;  in UnregCb()
327 			evt->map &= ~ev;  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()
392 		} else if (events & evt->map) {  in ModCb()