| /linux/include/linux/ |
| H A D | generic-radix-tree.h | 284 * @_iter: a genradix_iter
287 * If no more entries exist at or above @_iter's current position, returns NULL
289 #define genradix_iter_peek(_iter, _radix) \ argument
291 __genradix_iter_peek(_iter, &(_radix)->tree, \
300 * @_iter: a genradix_iter
303 * If no more entries exist at or below @_iter's current position, returns NULL
305 #define genradix_iter_peek_prev(_iter, _radix) \ argument
307 __genradix_iter_peek_prev(_iter, &(_radix)->tree, \
330 #define genradix_iter_advance(_iter, _radix) \ argument
331 __genradix_iter_advance(_iter, __genradix_obj_siz
349 genradix_iter_rewind(_iter,_radix) global() argument
352 genradix_for_each_from(_radix,_iter,_p,_start) global() argument
366 genradix_for_each(_radix,_iter,_p) global() argument
381 genradix_for_each_reverse(_radix,_iter,_p) global() argument
[all...] |
| H A D | blk-mq.h | 1058 #define rq_for_each_segment(bvl, _rq, _iter) \ argument
1059 __rq_for_each_bio(_iter.bio, _rq) \
1060 bio_for_each_segment(bvl, _iter.bio, _iter.iter)
1062 #define rq_for_each_bvec(bvl, _rq, _iter) \ argument
1063 __rq_for_each_bio(_iter.bio, _rq) \
1064 bio_for_each_bvec(bvl, _iter.bio, _iter.iter)
1066 #define rq_iter_last(bvec, _iter) \ argument
1067 (_iter
[all...] |
| H A D | bio-integrity.h | 37 #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \ argument
39 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
|
| /linux/fs/bcachefs/ |
| H A D | subvolume.h | 48 #define for_each_btree_key_in_subvolume_max_continue(_trans, _iter, \ argument
56 (_k) = bch2_btree_iter_peek_in_subvolume_max_type(trans, &(_iter),\
63 } while (!_ret3 && bch2_btree_iter_advance(_trans, &(_iter))); \
65 bch2_trans_iter_exit((_trans), &(_iter)); \
69 #define for_each_btree_key_in_subvolume_max(_trans, _iter, _btree_id, \ argument
72 struct btree_iter _iter; \
73 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
76 for_each_btree_key_in_subvolume_max_continue(_trans, _iter, \
|
| H A D | fast_list.h | 27 #define fast_list_for_each_from(_list, _iter, _i, _start) \ argument
28 for (_iter = genradix_iter_init(&(_list)->items, _start); \
29 (_i = fast_list_iter_peek(&(_iter), _list)) != NULL; \
30 genradix_iter_advance(&(_iter), &(_list)->items))
32 #define fast_list_for_each(_list, _iter, _i) \ argument
33 fast_list_for_each_from(_list, _iter, _i, 0)
|
| H A D | btree_cache.h | 82 #define for_each_cached_btree(_b, _c, _tbl, _iter, _pos) \ argument
85 _iter = 0; _iter < (_tbl)->size; _iter++) \
86 rht_for_each_entry_rcu((_b), (_pos), _tbl, _iter, hash)
|
| H A D | extents.h | 360 #define bkey_crc_next(_k, _end, _crc, _iter) \ argument
362 __bkey_extent_entry_for_each_from(_iter, _end, _iter) \
363 if (extent_entry_is_crc(_iter)) { \
365 entry_to_crc(_iter)); \
369 (_iter) < (_end); \
372 #define __bkey_for_each_crc(_k, _start, _end, _crc, _iter) \ argument
374 (_iter) = (_start); \
375 bkey_crc_next(_k, _end, _crc, _iter); \
376 (_iter)
378 bkey_for_each_crc(_k,_p,_crc,_iter) global() argument
[all...] |
| H A D | btree_update.h | 332 #define bch2_bkey_make_mut_typed(_trans, _iter, _k, _flags, _type) \ argument
333 bkey_i_to_##_type(__bch2_bkey_make_mut(_trans, _iter, _k, _flags,\
399 #define bch2_bkey_get_mut_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\ argument
400 bkey_i_to_##_type(__bch2_bkey_get_mut(_trans, _iter, \
425 #define bch2_bkey_alloc(_trans, _iter, _flags, _type) \ argument
426 bkey_i_to_##_type(__bch2_bkey_alloc(_trans, _iter, _flags, \
|
| H A D | bset.h | 345 #define btree_node_iter_for_each(_iter, _set) \ argument
346 for (_set = (_iter)->data; \
347 _set < (_iter)->data + ARRAY_SIZE((_iter)->data) && \
|
| H A D | btree_journal_iter.c | 530 static void btree_and_journal_iter_prefetch(struct btree_and_journal_iter *_iter) in btree_and_journal_iter_prefetch() argument
532 struct btree_and_journal_iter iter = *_iter; in btree_and_journal_iter_prefetch()
|
| H A D | bset.c | 154 static void __bch2_btree_node_iter_next_check(struct btree_node_iter *_iter, in __bch2_btree_node_iter_next_check() argument
157 struct btree_node_iter iter = *_iter; in __bch2_btree_node_iter_next_check()
181 btree_node_iter_for_each(_iter, set) { in __bch2_btree_node_iter_next_check()
|
| /linux/drivers/dma/ |
| H A D | mv_xor.c | 217 struct mv_xor_desc_slot *iter, *_iter; in mv_chan_clean_completed_slots() local
220 list_for_each_entry_safe(iter, _iter, &mv_chan->completed_slots, in mv_chan_clean_completed_slots()
265 struct mv_xor_desc_slot *iter, *_iter; in mv_chan_slot_cleanup() local
280 list_for_each_entry_safe(iter, _iter, &mv_chan->chain, in mv_chan_slot_cleanup()
630 struct mv_xor_desc_slot *iter, *_iter; in mv_xor_free_chan_resources() local
637 list_for_each_entry_safe(iter, _iter, &mv_chan->chain, in mv_xor_free_chan_resources()
642 list_for_each_entry_safe(iter, _iter, &mv_chan->completed_slots, in mv_xor_free_chan_resources()
647 list_for_each_entry_safe(iter, _iter, &mv_chan->allocated_slots, in mv_xor_free_chan_resources()
653 iter, _iter, &mv_chan->free_slots, node) { in mv_xor_free_chan_resources()
|
| /linux/arch/x86/kvm/mmu/ |
| H A D | tdp_mmu.c | 786 #define tdp_root_for_each_pte(_iter, _kvm, _root, _start, _end) \ argument
787 for_each_tdp_pte(_iter, _kvm, _root, _start, _end)
789 #define tdp_root_for_each_leaf_pte(_iter, _kvm, _root, _start, _end) \ argument
790 tdp_root_for_each_pte(_iter, _kvm, _root, _start, _end) \
791 if (!is_shadow_present_pte(_iter.old_spte) || \
792 !is_last_spte(_iter.old_spte, _iter.level)) \
|
| /linux/drivers/dma/ppc4xx/ |
| H A D | adma.c | 1535 struct ppc440spe_adma_desc_slot *iter, *_iter, *group_start = NULL; in __ppc440spe_adma_slot_cleanup() local
1554 list_for_each_entry_safe(iter, _iter, &chan->chain, in __ppc440spe_adma_slot_cleanup()
1562 prefetch(_iter); in __ppc440spe_adma_slot_cleanup()
1563 prefetch(&_iter->async_tx); in __ppc440spe_adma_slot_cleanup()
1687 struct ppc440spe_adma_desc_slot *iter = NULL, *_iter; in ppc440spe_adma_alloc_slots() local
1706 list_for_each_entry_safe_continue(iter, _iter, &chan->all_slots, in ppc440spe_adma_alloc_slots()
1708 prefetch(_iter); in ppc440spe_adma_alloc_slots()
1709 prefetch(&_iter->async_tx); in ppc440spe_adma_alloc_slots()
3535 struct ppc440spe_adma_desc_slot *iter, *_iter; in ppc440spe_adma_free_chan_resources() local
3542 list_for_each_entry_safe(iter, _iter, in ppc440spe_adma_free_chan_resources()
[all...] |
| /linux/scripts/coccinelle/api/ |
| H A D | stream_open.cocci | 187 // XXX for simplicity require no .{read/write}_iter and no .splice_{read/write} for now.
|