forked from torvalds/linux
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
radix-tree tests: add regression3 test
After calling radix_tree_iter_retry(), 'slot' will be set to NULL. This can cause radix_tree_next_slot() to dereference the NULL pointer. Add Konstantin Khlebnikov's test to the regression framework. Signed-off-by: Matthew Wilcox <[email protected]> Reported-by: Konstantin Khlebnikov <[email protected]> Signed-off-by: Andrew Morton <[email protected]> Signed-off-by: Linus Torvalds <[email protected]>
- Loading branch information
Showing
5 changed files
with
90 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -3,5 +3,6 @@ | |
|
||
void regression1_test(void); | ||
void regression2_test(void); | ||
void regression3_test(void); | ||
|
||
#endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,86 @@ | ||
/* | ||
* Regression3 | ||
* Description: | ||
* Helper radix_tree_iter_retry resets next_index to the current index. | ||
* In following radix_tree_next_slot current chunk size becomes zero. | ||
* This isn't checked and it tries to dereference null pointer in slot. | ||
* | ||
* Running: | ||
* This test should run to completion immediately. The above bug would | ||
* cause it to segfault. | ||
* | ||
* Upstream commit: | ||
* Not yet | ||
*/ | ||
#include <linux/kernel.h> | ||
#include <linux/gfp.h> | ||
#include <linux/slab.h> | ||
#include <linux/radix-tree.h> | ||
#include <stdlib.h> | ||
#include <stdio.h> | ||
|
||
#include "regression.h" | ||
|
||
void regression3_test(void) | ||
{ | ||
RADIX_TREE(root, GFP_KERNEL); | ||
void *ptr = (void *)4ul; | ||
struct radix_tree_iter iter; | ||
void **slot; | ||
bool first; | ||
|
||
printf("running regression test 3 (should take milliseconds)\n"); | ||
|
||
radix_tree_insert(&root, 0, ptr); | ||
radix_tree_tag_set(&root, 0, 0); | ||
|
||
first = true; | ||
radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { | ||
// printk("tagged %ld %p\n", iter.index, *slot); | ||
if (first) { | ||
radix_tree_insert(&root, 1, ptr); | ||
radix_tree_tag_set(&root, 1, 0); | ||
first = false; | ||
} | ||
if (radix_tree_deref_retry(*slot)) { | ||
// printk("retry %ld\n", iter.index); | ||
slot = radix_tree_iter_retry(&iter); | ||
continue; | ||
} | ||
} | ||
radix_tree_delete(&root, 1); | ||
|
||
first = true; | ||
radix_tree_for_each_slot(slot, &root, &iter, 0) { | ||
// printk("slot %ld %p\n", iter.index, *slot); | ||
if (first) { | ||
radix_tree_insert(&root, 1, ptr); | ||
first = false; | ||
} | ||
if (radix_tree_deref_retry(*slot)) { | ||
// printk("retry %ld\n", iter.index); | ||
slot = radix_tree_iter_retry(&iter); | ||
continue; | ||
} | ||
} | ||
radix_tree_delete(&root, 1); | ||
|
||
first = true; | ||
radix_tree_for_each_contig(slot, &root, &iter, 0) { | ||
// printk("contig %ld %p\n", iter.index, *slot); | ||
if (first) { | ||
radix_tree_insert(&root, 1, ptr); | ||
first = false; | ||
} | ||
if (radix_tree_deref_retry(*slot)) { | ||
// printk("retry %ld\n", iter.index); | ||
slot = radix_tree_iter_retry(&iter); | ||
continue; | ||
} | ||
} | ||
|
||
radix_tree_delete(&root, 0); | ||
radix_tree_delete(&root, 1); | ||
|
||
printf("regression test 3 passed\n"); | ||
} |