Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
2d6f45b8 KK |
2 | /* |
3 | * Regression3 | |
4 | * Description: | |
5 | * Helper radix_tree_iter_retry resets next_index to the current index. | |
6 | * In following radix_tree_next_slot current chunk size becomes zero. | |
7 | * This isn't checked and it tries to dereference null pointer in slot. | |
8 | * | |
148deab2 | 9 | * Helper radix_tree_iter_resume reset slot to NULL and next_index to index + 1, |
7475851f KK |
10 | * for tagger iteraction it also must reset cached tags in iterator to abort |
11 | * next radix_tree_next_slot and go to slow-path into radix_tree_next_chunk. | |
12 | * | |
2d6f45b8 KK |
13 | * Running: |
14 | * This test should run to completion immediately. The above bug would | |
15 | * cause it to segfault. | |
16 | * | |
17 | * Upstream commit: | |
18 | * Not yet | |
19 | */ | |
20 | #include <linux/kernel.h> | |
21 | #include <linux/gfp.h> | |
22 | #include <linux/slab.h> | |
23 | #include <linux/radix-tree.h> | |
24 | #include <stdlib.h> | |
25 | #include <stdio.h> | |
26 | ||
27 | #include "regression.h" | |
28 | ||
29 | void regression3_test(void) | |
30 | { | |
31 | RADIX_TREE(root, GFP_KERNEL); | |
7475851f KK |
32 | void *ptr0 = (void *)4ul; |
33 | void *ptr = (void *)8ul; | |
2d6f45b8 KK |
34 | struct radix_tree_iter iter; |
35 | void **slot; | |
36 | bool first; | |
37 | ||
73bc029b | 38 | printv(1, "running regression test 3 (should take milliseconds)\n"); |
2d6f45b8 | 39 | |
7475851f | 40 | radix_tree_insert(&root, 0, ptr0); |
2d6f45b8 KK |
41 | radix_tree_tag_set(&root, 0, 0); |
42 | ||
43 | first = true; | |
44 | radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { | |
73bc029b | 45 | printv(2, "tagged %ld %p\n", iter.index, *slot); |
2d6f45b8 KK |
46 | if (first) { |
47 | radix_tree_insert(&root, 1, ptr); | |
48 | radix_tree_tag_set(&root, 1, 0); | |
49 | first = false; | |
50 | } | |
51 | if (radix_tree_deref_retry(*slot)) { | |
73bc029b | 52 | printv(2, "retry at %ld\n", iter.index); |
2d6f45b8 KK |
53 | slot = radix_tree_iter_retry(&iter); |
54 | continue; | |
55 | } | |
56 | } | |
57 | radix_tree_delete(&root, 1); | |
58 | ||
59 | first = true; | |
60 | radix_tree_for_each_slot(slot, &root, &iter, 0) { | |
73bc029b | 61 | printv(2, "slot %ld %p\n", iter.index, *slot); |
2d6f45b8 KK |
62 | if (first) { |
63 | radix_tree_insert(&root, 1, ptr); | |
64 | first = false; | |
65 | } | |
66 | if (radix_tree_deref_retry(*slot)) { | |
73bc029b | 67 | printv(2, "retry at %ld\n", iter.index); |
2d6f45b8 KK |
68 | slot = radix_tree_iter_retry(&iter); |
69 | continue; | |
70 | } | |
71 | } | |
72 | radix_tree_delete(&root, 1); | |
73 | ||
74 | first = true; | |
75 | radix_tree_for_each_contig(slot, &root, &iter, 0) { | |
73bc029b | 76 | printv(2, "contig %ld %p\n", iter.index, *slot); |
2d6f45b8 KK |
77 | if (first) { |
78 | radix_tree_insert(&root, 1, ptr); | |
79 | first = false; | |
80 | } | |
81 | if (radix_tree_deref_retry(*slot)) { | |
73bc029b | 82 | printv(2, "retry at %ld\n", iter.index); |
2d6f45b8 KK |
83 | slot = radix_tree_iter_retry(&iter); |
84 | continue; | |
85 | } | |
86 | } | |
87 | ||
7475851f | 88 | radix_tree_for_each_slot(slot, &root, &iter, 0) { |
73bc029b | 89 | printv(2, "slot %ld %p\n", iter.index, *slot); |
7475851f | 90 | if (!iter.index) { |
73bc029b | 91 | printv(2, "next at %ld\n", iter.index); |
148deab2 | 92 | slot = radix_tree_iter_resume(slot, &iter); |
7475851f KK |
93 | } |
94 | } | |
95 | ||
96 | radix_tree_for_each_contig(slot, &root, &iter, 0) { | |
73bc029b | 97 | printv(2, "contig %ld %p\n", iter.index, *slot); |
7475851f | 98 | if (!iter.index) { |
73bc029b | 99 | printv(2, "next at %ld\n", iter.index); |
148deab2 | 100 | slot = radix_tree_iter_resume(slot, &iter); |
7475851f KK |
101 | } |
102 | } | |
103 | ||
104 | radix_tree_tag_set(&root, 0, 0); | |
105 | radix_tree_tag_set(&root, 1, 0); | |
106 | radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { | |
73bc029b | 107 | printv(2, "tagged %ld %p\n", iter.index, *slot); |
7475851f | 108 | if (!iter.index) { |
73bc029b | 109 | printv(2, "next at %ld\n", iter.index); |
148deab2 | 110 | slot = radix_tree_iter_resume(slot, &iter); |
7475851f KK |
111 | } |
112 | } | |
113 | ||
2d6f45b8 KK |
114 | radix_tree_delete(&root, 0); |
115 | radix_tree_delete(&root, 1); | |
116 | ||
73bc029b | 117 | printv(1, "regression test 3 passed\n"); |
2d6f45b8 | 118 | } |