Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 13 of 13) sorted by relevance

/lib/
Dlist_debug.c20 bool __list_add_valid(struct list_head *new, struct list_head *prev, in __list_add_valid() argument
23 if (CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
25 prev, next->prev, next) || in __list_add_valid()
26 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
28 next, prev->next, prev) || in __list_add_valid()
29 CHECK_DATA_CORRUPTION(new == prev || new == next, in __list_add_valid()
31 new, prev, next)) in __list_add_valid()
40 struct list_head *prev, *next; in __list_del_entry_valid() local
42 prev = entry->prev; in __list_del_entry_valid()
48 CHECK_DATA_CORRUPTION(prev == LIST_POISON2, in __list_del_entry_valid()
[all …]
Dlist_sort.c65 a->prev = tail; in merge_final()
72 b->prev = tail; in merge_final()
94 b->prev = tail; in merge_final()
101 head->prev = tail; in merge_final()
195 if (list == head->prev) /* Zero or one elements */ in list_sort()
199 head->prev->next = NULL; in list_sort()
225 tail = &(*tail)->prev; in list_sort()
228 struct list_head *a = *tail, *b = a->prev; in list_sort()
232 a->prev = b->prev; in list_sort()
237 list->prev = pending; in list_sort()
[all …]
Dplist.c35 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
39 t, t->next, t->prev, in plist_check_prev_next()
40 p, p->next, p->prev, in plist_check_prev_next()
41 n, n->next, n->prev); in plist_check_prev_next()
46 struct list_head *prev = top, *next = top->next; in plist_check_list() local
48 plist_check_prev_next(top, prev, next); in plist_check_list()
50 prev = next; in plist_check_list()
51 next = prev->next; in plist_check_list()
52 plist_check_prev_next(top, prev, next); in plist_check_list()
75 struct plist_node *first, *iter, *prev = NULL; in plist_add() local
[all …]
Dklist.c337 struct klist_node *prev; in klist_prev() local
343 prev = to_klist_node(last->n_node.prev); in klist_prev()
347 prev = to_klist_node(i->i_klist->k_list.prev); in klist_prev()
350 while (prev != to_klist_node(&i->i_klist->k_list)) { in klist_prev()
351 if (likely(!knode_dead(prev))) { in klist_prev()
352 kref_get(&prev->n_ref); in klist_prev()
353 i->i_cur = prev; in klist_prev()
356 prev = to_klist_node(prev->n_node.prev); in klist_prev()
Dlockref.c17 struct lockref new = old, prev = old; \
22 if (likely(old.lock_count == prev.lock_count)) { \
Dtest_list_sort.c104 if (cur->next->prev != cur) { in list_sort_test()
129 if (head.prev != cur) { in list_sort_test()
Drhashtable.c114 union nested_table __rcu **prev, in nested_table_alloc() argument
120 ntbl = rcu_dereference(*prev); in nested_table_alloc()
131 if (cmpxchg((union nested_table **)prev, NULL, ntbl) == NULL) in nested_table_alloc()
135 return rcu_dereference(*prev); in nested_table_alloc()
Dlru_cache.c329 n = lc->lru.prev; in lc_prepare_for_change()
Dxarray.c2017 node->array, node->private_list.prev, node->private_list.next); in xa_dump_node()
/lib/dim/
Dnet_dim.c138 struct dim_stats *prev) in net_dim_stats_compare() argument
140 if (!prev->bpms) in net_dim_stats_compare()
143 if (IS_SIGNIFICANT_DIFF(curr->bpms, prev->bpms)) in net_dim_stats_compare()
144 return (curr->bpms > prev->bpms) ? DIM_STATS_BETTER : in net_dim_stats_compare()
147 if (!prev->ppms) in net_dim_stats_compare()
151 if (IS_SIGNIFICANT_DIFF(curr->ppms, prev->ppms)) in net_dim_stats_compare()
152 return (curr->ppms > prev->ppms) ? DIM_STATS_BETTER : in net_dim_stats_compare()
155 if (!prev->epms) in net_dim_stats_compare()
158 if (IS_SIGNIFICANT_DIFF(curr->epms, prev->epms)) in net_dim_stats_compare()
159 return (curr->epms < prev->epms) ? DIM_STATS_BETTER : in net_dim_stats_compare()
Drdma_dim.c27 struct dim_stats *prev) in rdma_dim_stats_compare() argument
30 if (!prev->cpms) in rdma_dim_stats_compare()
33 if (IS_SIGNIFICANT_DIFF(curr->cpms, prev->cpms)) in rdma_dim_stats_compare()
34 return (curr->cpms > prev->cpms) ? DIM_STATS_BETTER : in rdma_dim_stats_compare()
37 if (IS_SIGNIFICANT_DIFF(curr->cpe_ratio, prev->cpe_ratio)) in rdma_dim_stats_compare()
38 return (curr->cpe_ratio > prev->cpe_ratio) ? DIM_STATS_BETTER : in rdma_dim_stats_compare()
/lib/zlib_deflate/
Ddeflate.c155 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
233 s->prev = (Pos *) mem->prev_memory; in zlib_deflateInit2()
570 Pos *prev = s->prev; in longest_match() local
686 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()
780 p = &s->prev[n]; in fill_window()
Ddefutil.h104 Pos *prev; member