diff options
Diffstat (limited to 'include/linux/radix-tree.h')
| -rw-r--r-- | include/linux/radix-tree.h | 12 |
1 files changed, 11 insertions, 1 deletions
diff --git a/include/linux/radix-tree.h b/include/linux/radix-tree.h index b8ce2b444bb5..a916c6660dfa 100644 --- a/include/linux/radix-tree.h +++ b/include/linux/radix-tree.h | |||
| @@ -99,12 +99,15 @@ do { \ | |||
| 99 | * | 99 | * |
| 100 | * The notable exceptions to this rule are the following functions: | 100 | * The notable exceptions to this rule are the following functions: |
| 101 | * radix_tree_lookup | 101 | * radix_tree_lookup |
| 102 | * radix_tree_lookup_slot | ||
| 102 | * radix_tree_tag_get | 103 | * radix_tree_tag_get |
| 103 | * radix_tree_gang_lookup | 104 | * radix_tree_gang_lookup |
| 105 | * radix_tree_gang_lookup_slot | ||
| 104 | * radix_tree_gang_lookup_tag | 106 | * radix_tree_gang_lookup_tag |
| 107 | * radix_tree_gang_lookup_tag_slot | ||
| 105 | * radix_tree_tagged | 108 | * radix_tree_tagged |
| 106 | * | 109 | * |
| 107 | * The first 4 functions are able to be called locklessly, using RCU. The | 110 | * The first 7 functions are able to be called locklessly, using RCU. The |
| 108 | * caller must ensure calls to these functions are made within rcu_read_lock() | 111 | * caller must ensure calls to these functions are made within rcu_read_lock() |
| 109 | * regions. Other readers (lock-free or otherwise) and modifications may be | 112 | * regions. Other readers (lock-free or otherwise) and modifications may be |
| 110 | * running concurrently. | 113 | * running concurrently. |
| @@ -159,6 +162,9 @@ void *radix_tree_delete(struct radix_tree_root *, unsigned long); | |||
| 159 | unsigned int | 162 | unsigned int |
| 160 | radix_tree_gang_lookup(struct radix_tree_root *root, void **results, | 163 | radix_tree_gang_lookup(struct radix_tree_root *root, void **results, |
| 161 | unsigned long first_index, unsigned int max_items); | 164 | unsigned long first_index, unsigned int max_items); |
| 165 | unsigned int | ||
| 166 | radix_tree_gang_lookup_slot(struct radix_tree_root *root, void ***results, | ||
| 167 | unsigned long first_index, unsigned int max_items); | ||
| 162 | unsigned long radix_tree_next_hole(struct radix_tree_root *root, | 168 | unsigned long radix_tree_next_hole(struct radix_tree_root *root, |
| 163 | unsigned long index, unsigned long max_scan); | 169 | unsigned long index, unsigned long max_scan); |
| 164 | int radix_tree_preload(gfp_t gfp_mask); | 170 | int radix_tree_preload(gfp_t gfp_mask); |
| @@ -173,6 +179,10 @@ unsigned int | |||
| 173 | radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results, | 179 | radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results, |
| 174 | unsigned long first_index, unsigned int max_items, | 180 | unsigned long first_index, unsigned int max_items, |
| 175 | unsigned int tag); | 181 | unsigned int tag); |
| 182 | unsigned int | ||
| 183 | radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results, | ||
| 184 | unsigned long first_index, unsigned int max_items, | ||
| 185 | unsigned int tag); | ||
| 176 | int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag); | 186 | int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag); |
| 177 | 187 | ||
| 178 | static inline void radix_tree_preload_end(void) | 188 | static inline void radix_tree_preload_end(void) |
