Lines Matching defs:prev
83 struct idr_free_id_range *prev = list;
87 while (prev->next && prev->next->start < start)
88 prev = prev->next;
93 n->next = prev->next;
94 prev->next = n;
97 prev->end = start;
101 if (fr_isfull(prev)) {
103 n->min_unused_id = prev->min_unused_id;
104 prev->min_unused_id = start;
107 pid = &prev->free_ids;
115 /* remove from the prev range */
409 entry->prev = node;
411 temp->prev = entry;
436 struct idr_list *p_node = (ptr)->prev; \
437 n_node->prev = (ptr)->prev; \
439 (ptr)->prev = NULL; \