| /lib/ |
| D | list_debug.c | 20 bool __list_add_valid(struct list_head *new, struct list_head *prev, in __list_add_valid() argument
23 if (CHECK_DATA_CORRUPTION(prev == NULL, in __list_add_valid()
27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
29 prev, next->prev, next) || in __list_add_valid()
30 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
32 next, prev->next, prev) || in __list_add_valid()
33 CHECK_DATA_CORRUPTION(new == prev || new == next, in __list_add_valid()
35 new, prev, next)) in __list_add_valid()
44 struct list_head *prev, *next; in __list_del_entry_valid() local
46 prev = entry->prev; in __list_del_entry_valid()
[all …]
|
| D | list_sort.c | 62 a->prev = tail; in merge_final()
69 b->prev = tail; in merge_final()
91 b->prev = tail; in merge_final()
98 head->prev = tail; in merge_final()
190 if (list == head->prev) /* Zero or one elements */ in list_sort()
194 head->prev->next = NULL; in list_sort()
220 tail = &(*tail)->prev; in list_sort()
223 struct list_head *a = *tail, *b = a->prev; in list_sort()
227 a->prev = b->prev; in list_sort()
232 list->prev = pending; in list_sort()
[all …]
|
| D | plist.c | 35 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 …]
|
| D | klist.c | 337 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()
|
| D | cpumask.c | 249 int next, prev; in cpumask_any_and_distribute() local
252 prev = __this_cpu_read(distribute_cpu_mask_prev); in cpumask_any_and_distribute()
254 next = cpumask_next_and(prev, src1p, src2p); in cpumask_any_and_distribute()
267 int next, prev; in cpumask_any_distribute() local
270 prev = __this_cpu_read(distribute_cpu_mask_prev); in cpumask_any_distribute()
272 next = cpumask_next(prev, srcp); in cpumask_any_distribute()
|
| D | list-test.c | 56 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_add()
70 KUNIT_EXPECT_PTR_EQ(test, a.prev, &list); in list_test_list_add_tail()
87 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_del()
103 KUNIT_EXPECT_PTR_EQ(test, b.prev, &a_new); in list_test_list_replace()
119 KUNIT_EXPECT_PTR_EQ(test, b.prev, &a_new); in list_test_list_replace_init()
138 KUNIT_EXPECT_PTR_EQ(test, &a, list.prev); in list_test_list_swap()
141 KUNIT_EXPECT_PTR_EQ(test, &list, b.prev); in list_test_list_swap()
144 KUNIT_EXPECT_PTR_EQ(test, &b, a.prev); in list_test_list_swap()
160 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_del_init()
317 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_rotate_left()
|
| D | lockref.c | 17 struct lockref new = old, prev = old; \
22 if (likely(old.lock_count == prev.lock_count)) { \
|
| D | test_list_sort.c | 88 KUNIT_ASSERT_PTR_EQ_MSG(test, cur->next->prev, cur, in list_sort_test()
104 KUNIT_EXPECT_PTR_EQ_MSG(test, head.prev, cur, "list is corrupted"); in list_sort_test()
|
| D | rhashtable.c | 123 union nested_table __rcu **prev, in nested_table_alloc() argument
129 ntbl = rcu_dereference(*prev); in nested_table_alloc()
140 if (cmpxchg((union nested_table **)prev, NULL, ntbl) == NULL) in nested_table_alloc()
144 return rcu_dereference(*prev); in nested_table_alloc()
|
| D | lru_cache.c | 330 n = lc->lru.prev; in lc_prepare_for_change()
|
| D | xarray.c | 2240 node->array, node->private_list.prev, node->private_list.next); in xa_dump_node()
|
| /lib/dim/ |
| D | net_dim.c | 138 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()
|
| D | rdma_dim.c | 27 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/ |
| D | deflate.c | 176 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
262 s->prev = (Pos *) mem->prev_memory; in zlib_deflateInit2()
574 Pos *prev = s->prev; in longest_match() local
690 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()
784 p = &s->prev[n]; in fill_window()
|
| D | defutil.h | 106 Pos *prev; member
|