| /lib/ |
| D | rhashtable.c | 665 void rhashtable_walk_enter(struct rhashtable *ht, struct rhashtable_iter *iter) in rhashtable_walk_enter() argument
667 iter->ht = ht; in rhashtable_walk_enter()
668 iter->p = NULL; in rhashtable_walk_enter()
669 iter->slot = 0; in rhashtable_walk_enter()
670 iter->skip = 0; in rhashtable_walk_enter()
671 iter->end_of_table = 0; in rhashtable_walk_enter()
674 iter->walker.tbl = in rhashtable_walk_enter()
676 list_add(&iter->walker.list, &iter->walker.tbl->walkers); in rhashtable_walk_enter()
687 void rhashtable_walk_exit(struct rhashtable_iter *iter) in rhashtable_walk_exit() argument
689 spin_lock(&iter->ht->lock); in rhashtable_walk_exit()
[all …]
|
| D | plist.c | 75 struct plist_node *first, *iter, *prev = NULL; in plist_add() local
85 first = iter = plist_first(head); in plist_add()
88 if (node->prio < iter->prio) { in plist_add()
89 node_next = &iter->node_list; in plist_add()
93 prev = iter; in plist_add()
94 iter = list_entry(iter->prio_list.next, in plist_add()
96 } while (iter != first); in plist_add()
99 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
147 struct plist_node *iter; in plist_requeue() local
157 iter = plist_next(node); in plist_requeue()
[all …]
|
| D | radix-tree.c | 201 static unsigned int iter_offset(const struct radix_tree_iter *iter) in iter_offset() argument
203 return iter->index & RADIX_TREE_MAP_MASK; in iter_offset()
930 const struct radix_tree_iter *iter, in radix_tree_iter_replace() argument
933 __radix_tree_replace(root, iter->node, slot, item); in radix_tree_iter_replace()
1059 const struct radix_tree_iter *iter, unsigned int tag) in radix_tree_iter_tag_clear() argument
1061 node_tag_clear(root, iter->node, tag, iter_offset(iter)); in radix_tree_iter_tag_clear()
1109 static void set_iter_tags(struct radix_tree_iter *iter, in set_iter_tags() argument
1117 iter->tags = 1; in set_iter_tags()
1121 iter->tags = node->tags[tag][tag_long] >> tag_bit; in set_iter_tags()
1127 iter->tags |= node->tags[tag][tag_long + 1] << in set_iter_tags()
[all …]
|
| D | dynamic_debug.c | 787 static struct _ddebug *ddebug_iter_first(struct ddebug_iter *iter) in ddebug_iter_first() argument
790 iter->table = NULL; in ddebug_iter_first()
791 iter->idx = 0; in ddebug_iter_first()
794 iter->table = list_entry(ddebug_tables.next, in ddebug_iter_first()
796 iter->idx = 0; in ddebug_iter_first()
797 return &iter->table->ddebugs[iter->idx]; in ddebug_iter_first()
806 static struct _ddebug *ddebug_iter_next(struct ddebug_iter *iter) in ddebug_iter_next() argument
808 if (iter->table == NULL) in ddebug_iter_next()
810 if (++iter->idx == iter->table->num_ddebugs) { in ddebug_iter_next()
812 iter->idx = 0; in ddebug_iter_next()
[all …]
|
| D | test_meminit.c | 200 int iter; in do_kmem_cache_size() local
208 for (iter = 0; iter < 10; iter++) { in do_kmem_cache_size()
276 int i, iter, maxiter = 1024; in do_kmem_cache_rcu_persistent() local
298 for (iter = 0; iter < maxiter; iter++) { in do_kmem_cache_rcu_persistent()
300 used_objects[iter] = buf; in do_kmem_cache_rcu_persistent()
303 for (i = 0; i <= iter; i++) in do_kmem_cache_rcu_persistent()
321 int i, iter, maxiter = 1024; in do_kmem_cache_size_bulk() local
327 for (iter = 0; (iter < maxiter) && !fail; iter++) { in do_kmem_cache_size_bulk()
|
| D | generic-radix-tree.c | 162 void *__genradix_iter_peek(struct genradix_iter *iter, in __genradix_iter_peek() argument
177 if (ilog2(iter->offset) >= genradix_depth_shift(level)) in __genradix_iter_peek()
183 i = (iter->offset >> genradix_depth_shift(level)) & in __genradix_iter_peek()
188 iter->offset = round_down(iter->offset + in __genradix_iter_peek()
191 iter->pos = (iter->offset >> PAGE_SHIFT) * in __genradix_iter_peek()
200 return &n->data[iter->offset & (PAGE_SIZE - 1)]; in __genradix_iter_peek()
|
| D | idr.c | 36 struct radix_tree_iter iter; in idr_alloc_u32() local
45 radix_tree_iter_init(&iter, id); in idr_alloc_u32()
46 slot = idr_get_free(&idr->idr_rt, &iter, gfp, max - base); in idr_alloc_u32()
50 *nextid = iter.index + base; in idr_alloc_u32()
52 radix_tree_iter_replace(&idr->idr_rt, &iter, slot, ptr); in idr_alloc_u32()
53 radix_tree_iter_tag_clear(&idr->idr_rt, &iter, IDR_FREE); in idr_alloc_u32()
198 struct radix_tree_iter iter; in idr_for_each() local
202 radix_tree_for_each_slot(slot, &idr->idr_rt, &iter, 0) { in idr_for_each()
204 unsigned long id = iter.index + base; in idr_for_each()
229 struct radix_tree_iter iter; in idr_get_next_ul() local
[all …]
|
| D | error-inject.c | 61 struct error_injection_entry *iter; in populate_error_injection_list() local
66 for (iter = start; iter < end; iter++) { in populate_error_injection_list()
67 entry = arch_deref_entry_point((void *)iter->addr); in populate_error_injection_list()
81 ent->etype = iter->etype; in populate_error_injection_list()
|
| D | test_lockup.c | 352 unsigned int iter = 0; in test_lockup() local
361 while (iter++ < iterations && !signal_pending(main_task)) { in test_lockup()
|
| /lib/math/ |
| D | cordic.c | 50 unsigned iter; in cordic_calc_iq() local
71 for (iter = 0; iter < CORDIC_NUM_ITER; iter++) { in cordic_calc_iq()
73 valtmp = coord.i - (coord.q >> iter); in cordic_calc_iq()
74 coord.q += (coord.i >> iter); in cordic_calc_iq()
75 angle += arctan_table[iter]; in cordic_calc_iq()
77 valtmp = coord.i + (coord.q >> iter); in cordic_calc_iq()
78 coord.q -= (coord.i >> iter); in cordic_calc_iq()
79 angle -= arctan_table[iter]; in cordic_calc_iq()
|