109 static inline void tag_set(struct radix_tree_node *node, unsigned int tag,  in tag_set()  argument
112 	__set_bit(offset, node->tags[tag]);  in tag_set()
115 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag,  in tag_clear()  argument
118 	__clear_bit(offset, node->tags[tag]);  in tag_clear()
121 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag,  in tag_get()  argument
124 	return test_bit(offset, node->tags[tag]);  in tag_get()
127 static inline void root_tag_set(struct radix_tree_root *root, unsigned tag)  in root_tag_set()  argument
129 	root->xa_flags |= (__force gfp_t)(1 << (tag + ROOT_TAG_SHIFT));  in root_tag_set()
132 static inline void root_tag_clear(struct radix_tree_root *root, unsigned tag)  in root_tag_clear()  argument
134 	root->xa_flags &= (__force gfp_t)~(1 << (tag + ROOT_TAG_SHIFT));  in root_tag_clear()
142 static inline int root_tag_get(const struct radix_tree_root *root, unsigned tag)  in root_tag_get()  argument
144 	return (__force int)root->xa_flags & (1 << (tag + ROOT_TAG_SHIFT));  in root_tag_get()
162 							unsigned int tag)  in any_tag_set()  argument
166 		if (node->tags[tag][idx])  in any_tag_set()
172 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag)  in all_tag_set()  argument
174 	bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE);  in all_tag_set()
189 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag,  in radix_tree_find_next_bit()  argument
192 	const unsigned long *addr = node->tags[tag];  in radix_tree_find_next_bit()
422 	int tag;  in radix_tree_extend()  local
447 			for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) {  in radix_tree_extend()
448 				if (root_tag_get(root, tag))  in radix_tree_extend()
449 					tag_set(node, tag, 0);  in radix_tree_extend()
845 				unsigned int tag, unsigned int offset)  in node_tag_get()  argument
848 		return tag_get(node, tag, offset);  in node_tag_get()
849 	return root_tag_get(root, tag);  in node_tag_get()
948 				unsigned int tag, unsigned int offset)  in node_tag_set()  argument
951 		if (tag_get(node, tag, offset))  in node_tag_set()
953 		tag_set(node, tag, offset);  in node_tag_set()
958 	if (!root_tag_get(root, tag))  in node_tag_set()
959 		root_tag_set(root, tag);  in node_tag_set()
976 			unsigned long index, unsigned int tag)  in radix_tree_tag_set()  argument
991 		if (!tag_get(parent, tag, offset))  in radix_tree_tag_set()
992 			tag_set(parent, tag, offset);  in radix_tree_tag_set()
996 	if (!root_tag_get(root, tag))  in radix_tree_tag_set()
997 		root_tag_set(root, tag);  in radix_tree_tag_set()
1005 				unsigned int tag, unsigned int offset)  in node_tag_clear()  argument
1008 		if (!tag_get(node, tag, offset))  in node_tag_clear()
1010 		tag_clear(node, tag, offset);  in node_tag_clear()
1011 		if (any_tag_set(node, tag))  in node_tag_clear()
1019 	if (root_tag_get(root, tag))  in node_tag_clear()
1020 		root_tag_clear(root, tag);  in node_tag_clear()
1038 			unsigned long index, unsigned int tag)  in radix_tree_tag_clear()  argument
1056 		node_tag_clear(root, parent, tag, offset);  in radix_tree_tag_clear()
1069 			const struct radix_tree_iter *iter, unsigned int tag)  in radix_tree_iter_tag_clear()  argument
1071 	node_tag_clear(root, iter->node, tag, iter_offset(iter));  in radix_tree_iter_tag_clear()
1090 			unsigned long index, unsigned int tag)  in radix_tree_tag_get()  argument
1095 	if (!root_tag_get(root, tag))  in radix_tree_tag_get()
1108 		if (!tag_get(parent, tag, offset))  in radix_tree_tag_get()
1121 				unsigned tag)  in set_iter_tags()  argument
1131 	iter->tags = node->tags[tag][tag_long] >> tag_bit;  in set_iter_tags()
1137 			iter->tags |= node->tags[tag][tag_long + 1] <<  in set_iter_tags()
1166 	unsigned tag = flags & RADIX_TREE_ITER_TAG_MASK;  in radix_tree_next_chunk()  local
1170 	if ((flags & RADIX_TREE_ITER_TAGGED) && !root_tag_get(root, tag))  in radix_tree_next_chunk()
1207 				!tag_get(node, tag, offset) : !child) {  in radix_tree_next_chunk()
1213 				offset = radix_tree_find_next_bit(node, tag,  in radix_tree_next_chunk()
1244 		set_iter_tags(iter, node, offset, tag);  in radix_tree_next_chunk()
1313 		unsigned int tag)  in radix_tree_gang_lookup_tag()  argument
1322 	radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) {  in radix_tree_gang_lookup_tag()
1354 		unsigned int max_items, unsigned int tag)  in radix_tree_gang_lookup_tag_slot()  argument
1363 	radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) {  in radix_tree_gang_lookup_tag_slot()
1379 	int tag;  in __radix_tree_delete()  local
1384 		for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++)  in __radix_tree_delete()
1385 			node_tag_clear(root, node, tag, offset);  in __radix_tree_delete()
1465 int radix_tree_tagged(const struct radix_tree_root *root, unsigned int tag)  in radix_tree_tagged()  argument
1467 	return root_tag_get(root, tag);  in radix_tree_tagged()