Searched refs:prev (Results 1 - 8 of 8) sorted by relevance

/lib/
H A Dlist_debug.c16 * the prev/next entries already!
20 struct list_head *prev,
23 WARN(next->prev != prev,
24 "list_add corruption. next->prev should be "
25 "prev (%p), but was %p. (next=%p).\n",
26 prev, next->prev, next);
27 WARN(prev->next != next,
28 "list_add corruption. prev
19 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
40 struct list_head *prev, *next; local
[all...]
H A Dplist.c36 WARN(n->prev != p || p->next != n,
38 "prev: %p, n: %p, p: %p\n"
40 t, t->next, t->prev,
41 p, p->next, p->prev,
42 n, n->next, n->prev);
47 struct list_head *prev = top, *next = top->next; local
49 plist_check_prev_next(top, prev, next);
51 prev = next;
52 next = prev->next;
53 plist_check_prev_next(top, prev, nex
76 struct plist_node *first, *iter, *prev = NULL; local
[all...]
H A Dlist_sort.c12 * sentinel head node, "prev" links not maintained.
40 * prev-link restoration pass, or maintaining the prev links
55 a->prev = tail;
59 b->prev = tail;
75 tail->next->prev = tail;
80 head->prev = tail;
112 head->prev->next = NULL;
246 if (cur->next->prev != cur) {
H A Dprio_tree.c97 struct prio_tree_node *first = NULL, *prev, *last = NULL; local
114 prev = last;
118 prev->left = last;
119 last->parent = prev;
H A Drwsem.c156 next->prev = &sem->wait_list;
H A Dlru_cache.c259 n = lc->lru.prev;
/lib/zlib_deflate/
H A Ddeflate.c155 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
160 * prev[] will be initialized on the fly.
233 s->prev = (Pos *) mem->prev_memory;
606 ds->prev = (Pos *) mem->prev_memory;
612 memcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
713 Pos *prev = s->prev; local
829 } while ((cur_match = prev[cur_match & wmask]) > limit
923 p = &s->prev[
[all...]
H A Ddefutil.h104 Pos *prev; member in struct:deflate_state

Completed in 196 milliseconds