| /linux-master/arch/x86/kvm/mmu/ |
| H A D | tdp_mmu.c | 654 #define tdp_root_for_each_pte(_iter, _root, _start, _end) \
655 for_each_tdp_pte(_iter, _root, _start, _end)
657 #define tdp_root_for_each_leaf_pte(_iter, _root, _start, _end) \
658 tdp_root_for_each_pte(_iter, _root, _start, _end) \
659 if (!is_shadow_present_pte(_iter.old_spte) || \
660 !is_last_spte(_iter.old_spte, _iter.level)) \
664 #define tdp_mmu_for_each_pte(_iter, _mmu, _start, _end) \
665 for_each_tdp_pte(_iter, root_to_sp(_mmu->root.hpa), _start, _end)
|
| /linux-master/drivers/dma/ |
| H A D | mv_xor.c | 217 struct mv_xor_desc_slot *iter, *_iter; local
220 list_for_each_entry_safe(iter, _iter, &mv_chan->completed_slots,
265 struct mv_xor_desc_slot *iter, *_iter; local
280 list_for_each_entry_safe(iter, _iter, &mv_chan->chain,
630 struct mv_xor_desc_slot *iter, *_iter; local
637 list_for_each_entry_safe(iter, _iter, &mv_chan->chain,
642 list_for_each_entry_safe(iter, _iter, &mv_chan->completed_slots,
647 list_for_each_entry_safe(iter, _iter, &mv_chan->allocated_slots,
653 iter, _iter, &mv_chan->free_slots, node) {
|
| /linux-master/drivers/dma/ppc4xx/ |
| H A D | adma.c | 1535 struct ppc440spe_adma_desc_slot *iter, *_iter, *group_start = NULL; local
1554 list_for_each_entry_safe(iter, _iter, &chan->chain,
1562 prefetch(_iter);
1563 prefetch(&_iter->async_tx);
1687 struct ppc440spe_adma_desc_slot *iter = NULL, *_iter; local
1706 list_for_each_entry_safe_continue(iter, _iter, &chan->all_slots,
1708 prefetch(_iter);
1709 prefetch(&_iter->async_tx);
3535 struct ppc440spe_adma_desc_slot *iter, *_iter; local
3542 list_for_each_entry_safe(iter, _iter,
[all...] |
| /linux-master/fs/bcachefs/ |
| H A D | bset.c | 159 static void bch2_btree_node_iter_next_check(struct btree_node_iter *_iter, argument
162 struct btree_node_iter iter = *_iter;
186 btree_node_iter_for_each(_iter, set) {
|
| H A D | bset.h | 343 #define btree_node_iter_for_each(_iter, _set) \
344 for (_set = (_iter)->data; \
345 _set < (_iter)->data + ARRAY_SIZE((_iter)->data) && \
|
| H A D | btree_cache.h | 71 #define for_each_cached_btree(_b, _c, _tbl, _iter, _pos) \
74 _iter = 0; _iter < (_tbl)->size; _iter++) \
75 rht_for_each_entry_rcu((_b), (_pos), _tbl, _iter, hash)
|
| H A D | btree_iter.h | 138 #define trans_for_each_path_idx_inorder(_trans, _iter) \
139 for (_iter = (struct trans_for_each_path_inorder_iter) { 0 }; \
140 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
141 _iter.sorted_idx < (_trans)->nr_sorted); \
142 _iter.sorted_idx++)
149 #define trans_for_each_path_inorder(_trans, _path, _iter) \
150 for (_iter = (struct trans_for_each_path_inorder_iter) { 0 }; \
151 (_iter.path_idx = trans->sorted[_iter
[all...] |
| H A D | btree_journal_iter.c | 389 static void btree_and_journal_iter_prefetch(struct btree_and_journal_iter *_iter) argument
391 struct btree_and_journal_iter iter = *_iter;
|
| H A D | btree_update.h | 269 #define bch2_bkey_make_mut_typed(_trans, _iter, _k, _flags, _type) \
270 bkey_i_to_##_type(__bch2_bkey_make_mut(_trans, _iter, _k, _flags,\
333 #define bch2_bkey_get_mut_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
334 bkey_i_to_##_type(__bch2_bkey_get_mut(_trans, _iter, \
358 #define bch2_bkey_alloc(_trans, _iter, _flags, _type) \
359 bkey_i_to_##_type(__bch2_bkey_alloc(_trans, _iter, _flags, \
|
| H A D | extents.h | 358 #define bkey_crc_next(_k, _start, _end, _crc, _iter) \
360 __bkey_extent_entry_for_each_from(_iter, _end, _iter) \
361 if (extent_entry_is_crc(_iter)) { \
363 entry_to_crc(_iter)); \
367 (_iter) < (_end); \
370 #define __bkey_for_each_crc(_k, _start, _end, _crc, _iter) \
372 (_iter) = (_start); \
373 bkey_crc_next(_k, _start, _end, _crc, _iter); \
374 (_iter)
[all...] |
| H A D | fifo.h | 113 #define fifo_for_each_entry(_entry, _fifo, _iter) \
114 for (typecheck(typeof((_fifo)->front), _iter), \
115 (_iter) = (_fifo)->front; \
116 ((_iter != (_fifo)->back) && \
117 (_entry = (_fifo)->data[(_iter) & (_fifo)->mask], true)); \
118 (_iter)++)
120 #define fifo_for_each_entry_ptr(_ptr, _fifo, _iter) \
121 for (typecheck(typeof((_fifo)->front), _iter), \
122 (_iter) = (_fifo)->front; \
123 ((_iter !
[all...] |
| /linux-master/include/linux/ |
| H A D | bio.h | 722 #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
724 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
|
| H A D | blk-mq.h | 1016 #define rq_for_each_segment(bvl, _rq, _iter) \
1017 __rq_for_each_bio(_iter.bio, _rq) \
1018 bio_for_each_segment(bvl, _iter.bio, _iter.iter)
1020 #define rq_for_each_bvec(bvl, _rq, _iter) \
1021 __rq_for_each_bio(_iter.bio, _rq) \
1022 bio_for_each_bvec(bvl, _iter.bio, _iter.iter)
1024 #define rq_iter_last(bvec, _iter) \
1025 (_iter
[all...] |
| H A D | generic-radix-tree.h | 183 * @_iter: a genradix_iter
186 * If no more entries exist at or above @_iter's current position, returns NULL
188 #define genradix_iter_peek(_iter, _radix) \
190 __genradix_iter_peek(_iter, &(_radix)->tree, \
199 * @_iter: a genradix_iter
202 * If no more entries exist at or below @_iter's current position, returns NULL
204 #define genradix_iter_peek_prev(_iter, _radix) \
206 __genradix_iter_peek_prev(_iter, &(_radix)->tree, \
229 #define genradix_iter_advance(_iter, _radix) \
230 __genradix_iter_advance(_iter, __genradix_obj_siz
[all...] |
| /linux-master/mm/ |
| H A D | z3fold.c | 191 #define for_each_unbuddied_list(_iter, _begin) \
192 for ((_iter) = (_begin); (_iter) < NCHUNKS; (_iter)++)
|
| H A D | zbud.c | 132 #define for_each_unbuddied_list(_iter, _begin) \
133 for ((_iter) = (_begin); (_iter) < NCHUNKS; (_iter)++)
|
| /linux-master/tools/objtool/ |
| H A D | elf.c | 101 #define __sym_for_each(_iter, _tree, _start, _end) \
102 for (_iter = __sym_iter_first((_tree), (_start), (_end)); \
103 _iter; _iter = __sym_iter_next(_iter, (_start), (_end)))
|