Searched refs:tags (Results 1 – 3 of 3) sorted by relevance
| /lib/ |
| A D | radix-tree.c | 103 __set_bit(offset, node->tags[tag]); in tag_set()
109 __clear_bit(offset, node->tags[tag]); in tag_clear()
115 return test_bit(offset, node->tags[tag]); in tag_get()
157 if (node->tags[tag][idx]) in any_tag_set()
183 const unsigned long *addr = node->tags[tag]; in radix_tree_find_next_bit()
301 memset(node->tags, 0, sizeof(node->tags)); in radix_tree_node_rcu_free()
1119 iter->tags = 1; in set_iter_tags()
1123 iter->tags = node->tags[tag][tag_long] >> tag_bit; in set_iter_tags()
1129 iter->tags |= node->tags[tag][tag_long + 1] << in set_iter_tags()
1141 iter->tags = 0; in radix_tree_iter_resume()
[all …]
|
| A D | alloc_tag.c | 123 size_t alloc_tag_top_users(struct codetag_bytes *tags, size_t count, bool can_sleep) in alloc_tag_top_users() argument
146 if (n.bytes > tags[i].bytes) in alloc_tag_top_users()
151 memmove(&tags[i + 1], in alloc_tag_top_users()
152 &tags[i], in alloc_tag_top_users()
153 sizeof(tags[0]) * (nr - i)); in alloc_tag_top_users()
155 tags[i] = n; in alloc_tag_top_users()
|
| A D | sbitmap.c | 643 int *tags, int nr_tags) in sbitmap_queue_clear_batch() argument
652 const int tag = tags[i] - offset; in sbitmap_queue_clear_batch()
673 tags[nr_tags - 1] - offset); in sbitmap_queue_clear_batch()
|
Completed in 10 milliseconds