Home
last modified time | relevance | path

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

/lib/
A Dlist_debug.c29 CHECK_DATA_CORRUPTION(next->prev != prev, next, in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, prev, in __list_add_valid_or_report()
34 next, prev->next, prev) || in __list_add_valid_or_report()
37 new, prev, next)) in __list_add_valid_or_report()
47 struct list_head *prev, *next; in __list_del_entry_valid_or_report() local
49 prev = entry->prev; in __list_del_entry_valid_or_report()
59 CHECK_DATA_CORRUPTION(prev == LIST_POISON2, prev, in __list_del_entry_valid_or_report()
62 CHECK_DATA_CORRUPTION(prev->next != entry, prev, in __list_del_entry_valid_or_report()
64 entry, prev->next, prev) || in __list_del_entry_valid_or_report()
[all …]
A Dlist_sort.c59 a->prev = tail; in merge_final()
66 b->prev = tail; in merge_final()
88 b->prev = tail; in merge_final()
95 head->prev = tail; in merge_final()
198 head->prev->next = NULL; in list_sort()
224 tail = &(*tail)->prev; in list_sort()
227 struct list_head *a = *tail, *b = a->prev; in list_sort()
231 a->prev = b->prev; in list_sort()
236 list->prev = pending; in list_sort()
245 pending = pending->prev; in list_sort()
[all …]
A 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()
48 plist_check_prev_next(top, prev, next); in plist_check_list()
50 WRITE_ONCE(prev, next); in plist_check_list()
51 WRITE_ONCE(next, prev->next); in plist_check_list()
52 plist_check_prev_next(top, prev, next); in plist_check_list()
93 prev = reverse_iter; in plist_add()
101 prev = iter; in plist_add()
[all …]
A Dcpumask.c137 unsigned int next, prev; in cpumask_any_and_distribute() local
140 prev = __this_cpu_read(distribute_cpu_mask_prev); in cpumask_any_and_distribute()
142 next = cpumask_next_and_wrap(prev, src1p, src2p); in cpumask_any_and_distribute()
158 unsigned int next, prev; in cpumask_any_distribute() local
161 prev = __this_cpu_read(distribute_cpu_mask_prev); in cpumask_any_distribute()
162 next = cpumask_next_wrap(prev, srcp); in cpumask_any_distribute()
A 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()
A Drhashtable.c123 union nested_table __rcu **prev, in nested_table_alloc() argument
129 ntbl = rcu_dereference(*prev); in nested_table_alloc()
141 if (cmpxchg((union nested_table **)prev, NULL, ntbl) == NULL) in nested_table_alloc()
145 return rcu_dereference(*prev); in nested_table_alloc()
A Dlru_cache.c319 n = lc->lru.prev; in lc_prepare_for_change()
A Diov_iter.c591 folioq = folioq->prev; in iov_iter_folioq_revert()
A Dmaple_tree.c5288 struct maple_tree *mt, struct maple_enode *prev, unsigned char offset) in mte_destroy_descend() argument
5307 node->piv_parent = prev; in mte_destroy_descend()
5311 prev = *enode; in mte_destroy_descend()
A Dxarray.c2419 node->array, node->private_list.prev, node->private_list.next); in xa_dump_node()
/lib/dim/
A 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()
A Dnet_dim.c270 struct dim_stats *prev) in net_dim_stats_compare() argument
272 if (!prev->bpms) in net_dim_stats_compare()
275 if (IS_SIGNIFICANT_DIFF(curr->bpms, prev->bpms)) in net_dim_stats_compare()
276 return (curr->bpms > prev->bpms) ? DIM_STATS_BETTER : in net_dim_stats_compare()
279 if (!prev->ppms) in net_dim_stats_compare()
283 if (IS_SIGNIFICANT_DIFF(curr->ppms, prev->ppms)) in net_dim_stats_compare()
284 return (curr->ppms > prev->ppms) ? DIM_STATS_BETTER : in net_dim_stats_compare()
287 if (!prev->epms) in net_dim_stats_compare()
290 if (IS_SIGNIFICANT_DIFF(curr->epms, prev->epms)) in net_dim_stats_compare()
291 return (curr->epms < prev->epms) ? DIM_STATS_BETTER : in net_dim_stats_compare()
/lib/tests/
A Dtest_list_sort.c88 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()
A Dlist-test.c57 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_add()
71 KUNIT_EXPECT_PTR_EQ(test, a.prev, &list); in list_test_list_add_tail()
88 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_del()
104 KUNIT_EXPECT_PTR_EQ(test, b.prev, &a_new); in list_test_list_replace()
122 KUNIT_EXPECT_PTR_EQ(test, b.prev, &a_new); in list_test_list_replace_init()
143 KUNIT_EXPECT_PTR_EQ(test, &a, list.prev); in list_test_list_swap()
146 KUNIT_EXPECT_PTR_EQ(test, &list, b.prev); in list_test_list_swap()
149 KUNIT_EXPECT_PTR_EQ(test, &b, a.prev); in list_test_list_swap()
165 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_del_init()
185 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_del_init_careful()
[all …]
A Dkunit_iov_iter.c393 p->next->prev = p; in iov_kunit_load_folioq()
/lib/zlib_deflate/
A Ddeflate.c173 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
259 s->prev = (Pos *) mem->prev_memory; in zlib_deflateInit2()
578 Pos *prev = s->prev; in longest_match() local
694 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()
787 p = &s->prev[n]; in fill_window()
A Ddefutil.h106 Pos *prev; member
/lib/zstd/compress/
A Dzstd_opt.c1233 U32 const prev = cur - prevMatch.mlen; in ZSTD_compressBlock_opt_generic() local
1234 … Repcodes_t const newReps = ZSTD_newRep(opt[prev].rep, prevMatch.off, opt[prev].litlen==0); in ZSTD_compressBlock_opt_generic()
1259 U32 const prev = cur - opt[cur].mlen; in ZSTD_compressBlock_opt_generic() local
1260 … Repcodes_t const newReps = ZSTD_newRep(opt[prev].rep, opt[cur].off, opt[prev].litlen==0); in ZSTD_compressBlock_opt_generic()

Completed in 45 milliseconds