Lines Matching refs:i
54 int i; in GlobInitEvent() local
55 for (i = 0; i < NUM_UDE; i++) { in GlobInitEvent()
56 g_udes[i].ft = NULL; in GlobInitEvent()
57 g_udes[i].ancestors = 0; in GlobInitEvent()
58 g_udes[i].parent = -1; in GlobInitEvent()
61 for (i = 0; i < MAX_EV; i++) in GlobInitEvent()
62 g_descendants[i] = 0; in GlobInitEvent()
84 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, map) { in InitEvP()
85 evp->evt->ent[i].ref++; in InitEvP()
91 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, map) { in InitEvP()
92 evp->evt->ent[i].ref++; in InitEvP()
99 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, evp->cb_map) { in CleanupEvP()
100 evp->evt->ent[i].ref--; in CleanupEvP()
106 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, evp->cb_map) { in CleanupEvP()
107 evp->evt->ent[i].ref--; in CleanupEvP()
163 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, ev_total) { in RegCbWCpy()
165 assert((ev & overlap) ? new_evt->ent[i].cb == cb in RegCbWCpy()
166 : new_evt->ent[i].ref == 0); in RegCbWCpy()
168 new_evt->ent[i].cb = cb; in RegCbWCpy()
171 new_evt->ent[i].cb = cur_evt->ent[i].cb; in RegCbWCpy()
176 new_evt->ent[i].ref++; in RegCbWCpy()
180 if (--cur_evt->ent[i].ref) in RegCbWCpy()
190 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, ev_total) { in RegCbWCpy()
192 assert((ev & overlap) ? new_evt->ent[i].cb == cb in RegCbWCpy()
193 : new_evt->ent[i].ref == 0); in RegCbWCpy()
195 new_evt->ent[i].cb = cb; in RegCbWCpy()
197 assert(g_udes[i - UDE_OFFSET].ft); in RegCbWCpy()
198 assert(g_udes[i - UDE_OFFSET].ancestors); in RegCbWCpy()
199 evp->ft_map |= g_udes[i - UDE_OFFSET].ancestors; in RegCbWCpy()
202 new_evt->ent[i].cb = cur_evt->ent[i].cb; in RegCbWCpy()
207 new_evt->ent[i].ref++; in RegCbWCpy()
211 if (--cur_evt->ent[i].ref) in RegCbWCpy()
237 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, 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()
257 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, events) { 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()
264 assert(g_udes[i - UDE_OFFSET].ft); in RegCbWoCpy()
265 assert(g_udes[i - UDE_OFFSET].ancestors); in RegCbWoCpy()
266 evp->ft_map |= g_udes[i - UDE_OFFSET].ancestors; in RegCbWoCpy()
271 cur_evt->ent[i].ref++; in RegCbWoCpy()
289 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, evs) { in UnregCb()
290 int walk = i; in UnregCb()
317 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, events) { in UnregCb()
318 if (--evt->ent[i].ref == 0) in UnregCb()
325 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, events) { in UnregCb()
326 if (--evt->ent[i].ref == 0) in UnregCb()
345 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, ev_total) { in FindReusableEvT()
347 if (walk->ent[i].cb != cb) in FindReusableEvT()
350 if (walk->ent[i].cb != cur_evt->ent[i].cb) in FindReusableEvT()
358 EVENT_FOREACH_START(ev, i, UDE_OFFSET, MAX_EV, ev_total) { in FindReusableEvT()
360 if (walk->ent[i].cb != cb) in FindReusableEvT()
363 if (walk->ent[i].cb != cur_evt->ent[i].cb) in FindReusableEvT()
504 int i, j; in mtcp_define_event() local
513 for (i = 0; i < MAX_EV; i++) in mtcp_define_event()
514 if (event == 1L << i) { in mtcp_define_event()
515 evid = i; in mtcp_define_event()
518 if (i == MAX_EV) in mtcp_define_event()
521 for (i = 0; i < NUM_UDE; i++) { in mtcp_define_event()
522 const event_t ude = 1L << (i + UDE_OFFSET); in mtcp_define_event()
528 g_ude_id[evid][j] = i + UDE_OFFSET; in mtcp_define_event()
545 g_udes[i].ancestors = event | g_udes[evid - UDE_OFFSET].ancestors; in mtcp_define_event()
547 g_udes[i].ancestors = event; in mtcp_define_event()
549 g_udes[i].parent = evid; in mtcp_define_event()
550 g_udes[i].ft = filter; in mtcp_define_event()