Lines Matching refs:iter
201 static unsigned int iter_offset(const struct radix_tree_iter *iter)
203 return iter->index & RADIX_TREE_MAP_MASK;
929 const struct radix_tree_iter *iter,
932 __radix_tree_replace(root, iter->node, slot, item);
1054 * @iter: iterator state
1058 const struct radix_tree_iter *iter, unsigned int tag)
1060 node_tag_clear(root, iter->node, tag, iter_offset(iter));
1107 /* Construct iter->tags bit-mask from node->tags[tag] array */
1108 static void set_iter_tags(struct radix_tree_iter *iter,
1116 iter->tags = 1;
1120 iter->tags = node->tags[tag][tag_long] >> tag_bit;
1126 iter->tags |= node->tags[tag][tag_long + 1] <<
1129 iter->next_index = __radix_tree_iter_add(iter, BITS_PER_LONG);
1134 struct radix_tree_iter *iter)
1136 iter->index = __radix_tree_iter_add(iter, 1);
1137 iter->next_index = iter->index;
1138 iter->tags = 0;
1147 * @iter: iterator state
1152 struct radix_tree_iter *iter, unsigned flags)
1162 * Catch next_index overflow after ~0UL. iter->index never overflows
1164 * And we cannot overflow iter->next_index in a single step,
1170 index = iter->next_index;
1171 if (!index && iter->index)
1183 iter->index = index;
1184 iter->next_index = maxindex + 1;
1185 iter->tags = 1;
1186 iter->node = NULL;
1227 iter->index = (index &~ node_maxindex(node)) | offset;
1228 iter->next_index = (index | node_maxindex(node)) + 1;
1229 iter->node = node;
1232 set_iter_tags(iter, node, offset, tag);
1262 struct radix_tree_iter iter;
1269 radix_tree_for_each_slot(slot, root, &iter, first_index) {
1274 slot = radix_tree_iter_retry(&iter);
1303 struct radix_tree_iter iter;
1310 radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) {
1315 slot = radix_tree_iter_retry(&iter);
1344 struct radix_tree_iter iter;
1351 radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) {
1382 * @iter: iterator state
1392 struct radix_tree_iter *iter, void __rcu **slot)
1394 if (__radix_tree_delete(root, iter->node, slot))
1395 iter->index = iter->next_index;
1474 struct radix_tree_iter *iter, gfp_t gfp,
1479 unsigned long maxindex, start = iter->next_index;
1534 iter->index = start;
1536 iter->next_index = 1 + min(max, (start | node_maxindex(node)));
1538 iter->next_index = 1;
1539 iter->node = node;
1540 set_iter_tags(iter, node, offset, IDR_FREE);