Home
last modified time | relevance | path

Searched refs:_iter (Results 1 – 17 of 17) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_iter.h159 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
161 _iter.sorted_idx++)
170 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
173 _iter.sorted_idx++)
201 for (_iter = 1; \
203 _iter++)
655 struct btree_iter _iter; \
783 bch2_trans_iter_exit((_trans), &(_iter)); \
795 struct btree_iter _iter; \
810 struct btree_iter _iter; \
[all …]
H A Dfifo.h113 #define fifo_for_each_entry(_entry, _fifo, _iter) \ argument
114 for (typecheck(typeof((_fifo)->front), _iter), \
115 (_iter) = (_fifo)->front; \
116 ((_iter != (_fifo)->back) && \
118 (_iter)++)
120 #define fifo_for_each_entry_ptr(_ptr, _fifo, _iter) \ argument
121 for (typecheck(typeof((_fifo)->front), _iter), \
122 (_iter) = (_fifo)->front; \
123 ((_iter != (_fifo)->back) && \
124 (_ptr = &(_fifo)->data[(_iter) & (_fifo)->mask], true)); \
[all …]
H A Dsubvolume.h48 #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 Dbtree_cache.h81 #define for_each_cached_btree(_b, _c, _tbl, _iter, _pos) \ argument
84 _iter = 0; _iter < (_tbl)->size; _iter++) \
85 rht_for_each_entry_rcu((_b), (_pos), _tbl, _iter, hash)
H A Dextents.h360 #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) = extent_entry_next(_iter))
378 #define bkey_for_each_crc(_k, _p, _crc, _iter) \ argument
[all …]
H A Dbtree_update.h283 #define bch2_bkey_make_mut_typed(_trans, _iter, _k, _flags, _type) \ argument
284 bkey_i_to_##_type(__bch2_bkey_make_mut(_trans, _iter, _k, _flags,\
350 #define bch2_bkey_get_mut_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\ argument
351 bkey_i_to_##_type(__bch2_bkey_get_mut(_trans, _iter, \
376 #define bch2_bkey_alloc(_trans, _iter, _flags, _type) \ argument
377 bkey_i_to_##_type(__bch2_bkey_alloc(_trans, _iter, _flags, \
H A Dbset.h345 #define btree_node_iter_for_each(_iter, _set) \ argument
346 for (_set = (_iter)->data; \
347 _set < (_iter)->data + ARRAY_SIZE((_iter)->data) && \
H A Dbtree_journal_iter.c525 static void btree_and_journal_iter_prefetch(struct btree_and_journal_iter *_iter) in btree_and_journal_iter_prefetch() argument
527 struct btree_and_journal_iter iter = *_iter; in btree_and_journal_iter_prefetch()
H A Dbset.c156 static void bch2_btree_node_iter_next_check(struct btree_node_iter *_iter, in bch2_btree_node_iter_next_check() argument
159 struct btree_node_iter iter = *_iter; in bch2_btree_node_iter_next_check()
183 btree_node_iter_for_each(_iter, set) { in bch2_btree_node_iter_next_check()
/linux-6.15/include/linux/
H A Dgeneric-radix-tree.h289 #define genradix_iter_peek(_iter, _radix) \ argument
291 __genradix_iter_peek(_iter, &(_radix)->tree, \
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
349 #define genradix_iter_rewind(_iter, _radix) \ argument
353 for (_iter = genradix_iter_init(_radix, _start); \
355 genradix_iter_advance(&_iter, _radix))
366 #define genradix_for_each(_radix, _iter, _p) \ argument
367 genradix_for_each_from(_radix, _iter, _p, 0)
[all …]
H A Dblk-mq.h1050 #define rq_for_each_segment(bvl, _rq, _iter) \ argument
1051 __rq_for_each_bio(_iter.bio, _rq) \
1052 bio_for_each_segment(bvl, _iter.bio, _iter.iter)
1054 #define rq_for_each_bvec(bvl, _rq, _iter) \ argument
1055 __rq_for_each_bio(_iter.bio, _rq) \
1056 bio_for_each_bvec(bvl, _iter.bio, _iter.iter)
1058 #define rq_iter_last(bvec, _iter) \ argument
1059 (_iter.bio->bi_next == NULL && \
1060 bio_iter_last(bvec, _iter.iter))
H A Dbio-integrity.h37 #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \ argument
39 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
/linux-6.15/drivers/dma/
H A Dmv_xor.c217 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-6.15/arch/x86/kvm/mmu/
H A Dtdp_mmu.c786 #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-6.15/tools/objtool/
H A Delf.c101 #define __sym_for_each(_iter, _tree, _start, _end) \ argument
102 for (_iter = __sym_iter_first((_tree), (_start), (_end)); \
103 _iter; _iter = __sym_iter_next(_iter, (_start), (_end)))
/linux-6.15/drivers/dma/ppc4xx/
H A Dadma.c1535 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, &ppc440spe_chan->chain, in ppc440spe_adma_free_chan_resources()
[all …]
/linux-6.15/scripts/coccinelle/api/
H A Dstream_open.cocci187 // XXX for simplicity require no .{read/write}_iter and no .splice_{read/write} for now.