Lines Matching full:list
108 static void init_list(struct ril_event * list)
110 memset(list, 0, sizeof(struct ril_event));
111 list->next = list;
112 list->prev = list;
113 list->fd = -1;
116 static void addToList(struct ril_event * ev, struct ril_event * list)
118 ev->next = list;
119 ev->prev = list->prev;
121 list->prev = ev;
168 // walk list, see if now >= ev->timeout for any events
223 // Sorted list, so calc based on first node
265 // Add event to watch list
292 struct ril_event * list;
294 // add to timer list
295 list = timer_list.next;
302 // keep list sorted
303 while (timercmp(&list->timeout, &ev->timeout, < )
304 && (list != &timer_list)) {
305 list = list->next;
307 // list now points to the first event older than ev
308 addToList(ev, list);
315 // Remove event from watch or timer list
