Home
last modified time | relevance | path

Searched refs:iter (Results 1 – 6 of 6) sorted by relevance

/lib/
Didr.c14 struct radix_tree_iter iter; in idr_alloc_cmn() local
20 radix_tree_iter_init(&iter, start); in idr_alloc_cmn()
22 slot = idr_get_free_ext(&idr->idr_rt, &iter, gfp, end); in idr_alloc_cmn()
24 slot = idr_get_free(&idr->idr_rt, &iter, gfp, end); in idr_alloc_cmn()
28 radix_tree_iter_replace(&idr->idr_rt, &iter, slot, ptr); in idr_alloc_cmn()
29 radix_tree_iter_tag_clear(&idr->idr_rt, &iter, IDR_FREE); in idr_alloc_cmn()
32 *index = iter.index; in idr_alloc_cmn()
87 struct radix_tree_iter iter; in idr_for_each() local
90 radix_tree_for_each_slot(slot, &idr->idr_rt, &iter, 0) { in idr_for_each()
91 int ret = fn(iter.index, rcu_dereference_raw(*slot), data); in idr_for_each()
[all …]
Dcordic.c59 unsigned iter; in cordic_calc_iq() local
80 for (iter = 0; iter < CORDIC_NUM_ITER; iter++) { in cordic_calc_iq()
82 valtmp = coord.i - (coord.q >> iter); in cordic_calc_iq()
83 coord.q += (coord.i >> iter); in cordic_calc_iq()
84 angle += arctan_table[iter]; in cordic_calc_iq()
86 valtmp = coord.i + (coord.q >> iter); in cordic_calc_iq()
87 coord.q -= (coord.i >> iter); in cordic_calc_iq()
88 angle -= arctan_table[iter]; in cordic_calc_iq()
Dplist.c76 struct plist_node *first, *iter, *prev = NULL; in plist_add() local
86 first = iter = plist_first(head); in plist_add()
89 if (node->prio < iter->prio) { in plist_add()
90 node_next = &iter->node_list; in plist_add()
94 prev = iter; in plist_add()
95 iter = list_entry(iter->prio_list.next, in plist_add()
97 } while (iter != first); in plist_add()
100 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
148 struct plist_node *iter; in plist_requeue() local
158 iter = plist_next(node); in plist_requeue()
[all …]
Dradix-tree.c254 static unsigned int iter_offset(const struct radix_tree_iter *iter) in iter_offset() argument
256 return (iter->index >> iter_shift(iter)) & RADIX_TREE_MAP_MASK; in iter_offset()
1242 const struct radix_tree_iter *iter, in radix_tree_iter_replace() argument
1245 __radix_tree_replace(root, iter->node, slot, item, NULL, NULL); in radix_tree_iter_replace()
1458 const struct radix_tree_iter *iter, unsigned int tag) in radix_tree_iter_tag_set() argument
1460 node_tag_set(root, iter->node, tag, iter_offset(iter)); in radix_tree_iter_tag_set()
1529 const struct radix_tree_iter *iter, unsigned int tag) in radix_tree_iter_tag_clear() argument
1531 node_tag_clear(root, iter->node, tag, iter_offset(iter)); in radix_tree_iter_tag_clear()
1578 static inline void __set_iter_shift(struct radix_tree_iter *iter, in __set_iter_shift() argument
1582 iter->shift = shift; in __set_iter_shift()
[all …]
Ddynamic_debug.c690 static struct _ddebug *ddebug_iter_first(struct ddebug_iter *iter) in ddebug_iter_first() argument
693 iter->table = NULL; in ddebug_iter_first()
694 iter->idx = 0; in ddebug_iter_first()
697 iter->table = list_entry(ddebug_tables.next, in ddebug_iter_first()
699 iter->idx = 0; in ddebug_iter_first()
700 return &iter->table->ddebugs[iter->idx]; in ddebug_iter_first()
709 static struct _ddebug *ddebug_iter_next(struct ddebug_iter *iter) in ddebug_iter_next() argument
711 if (iter->table == NULL) in ddebug_iter_next()
713 if (++iter->idx == iter->table->num_ddebugs) { in ddebug_iter_next()
715 iter->idx = 0; in ddebug_iter_next()
[all …]
Drhashtable.c711 void rhashtable_walk_enter(struct rhashtable *ht, struct rhashtable_iter *iter) in rhashtable_walk_enter() argument
713 iter->ht = ht; in rhashtable_walk_enter()
714 iter->p = NULL; in rhashtable_walk_enter()
715 iter->slot = 0; in rhashtable_walk_enter()
716 iter->skip = 0; in rhashtable_walk_enter()
719 iter->walker.tbl = in rhashtable_walk_enter()
721 list_add(&iter->walker.list, &iter->walker.tbl->walkers); in rhashtable_walk_enter()
732 void rhashtable_walk_exit(struct rhashtable_iter *iter) in rhashtable_walk_exit() argument
734 spin_lock(&iter->ht->lock); in rhashtable_walk_exit()
735 if (iter->walker.tbl) in rhashtable_walk_exit()
[all …]