Lines Matching refs:walk
127 struct ev_table *walk, *tmp; in CleanupEvB() local
128 for (walk = TAILQ_FIRST(&evb->evth); walk != NULL; walk = tmp) { in CleanupEvB()
129 tmp = TAILQ_NEXT(walk, link); in CleanupEvB()
131 MPFreeChunk(mtcp->evt_pool, walk); in CleanupEvB()
290 int walk = i; in UnregCb() local
292 const event_t evid = 1L << walk; in UnregCb()
296 && !(g_descendants[walk] & evp->cb_map)) { in UnregCb()
298 evp->ft_map &= ~(1L << g_udes[walk - UDE_OFFSET].parent); in UnregCb()
301 if ((walk = g_udes[walk - UDE_OFFSET].parent) < UDE_OFFSET) in UnregCb()
336 struct ev_table *walk; in FindReusableEvT() local
340 TAILQ_FOREACH(walk, &evb->evth, link) { in FindReusableEvT()
341 event_t overlap = evp->cb_map & walk->map; in FindReusableEvT()
347 if (walk->ent[i].cb != cb) in FindReusableEvT()
350 if (walk->ent[i].cb != cur_evt->ent[i].cb) in FindReusableEvT()
356 return walk; in FindReusableEvT()
360 if (walk->ent[i].cb != cb) in FindReusableEvT()
363 if (walk->ent[i].cb != cur_evt->ent[i].cb) in FindReusableEvT()
369 return walk; in FindReusableEvT()