Home
last modified time | relevance | path

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

123

/include/linux/
A Dbvec.h101 #define __bvec_iter_bvec(bvec, iter) (&(bvec)[(iter).bi_idx]) argument
108 min((iter).bi_size, \
109 __bvec_iter_bvec((bvec), (iter))->bv_len - (iter).bi_bvec_done)
112 (__bvec_iter_bvec((bvec), (iter))->bv_offset + (iter).bi_bvec_done)
150 iter->bi_size = 0; in bvec_iter_advance()
154 iter->bi_size -= bytes; in bvec_iter_advance()
162 iter->bi_idx = idx; in bvec_iter_advance()
163 iter->bi_bvec_done = bytes; in bvec_iter_advance()
178 iter->bi_idx++; in bvec_iter_advance_single()
180 iter->bi_bvec_done = done; in bvec_iter_advance_single()
[all …]
A Diov_iter.h33 iter->count -= progress; in iterate_ubuf()
64 iter->nr_segs -= p - iter->__iov; in iterate_iovec()
65 iter->__iov = p; in iterate_iovec()
66 iter->iov_offset = skip; in iterate_iovec()
98 iter->nr_segs -= p - iter->kvec; in iterate_kvec()
99 iter->kvec = p; in iterate_kvec()
137 iter->nr_segs -= p - iter->bvec; in iterate_bvec()
138 iter->bvec = p; in iterate_bvec()
207 loff_t start = iter->xarray_start + iter->iov_offset; in iterate_xarray()
295 len = iter->count; in iterate_and_advance2()
[all …]
A Dradix-tree.h291 iter->index = 0; in radix_tree_iter_init()
292 iter->next_index = start; in radix_tree_iter_init()
342 iter->next_index = iter->index; in radix_tree_iter_retry()
343 iter->tags = 0; in radix_tree_iter_retry()
375 return iter->next_index - iter->index; in radix_tree_chunk_size()
401 iter->tags >>= 1; in radix_tree_next_slot()
405 iter->index = __radix_tree_iter_add(iter, 1); in radix_tree_next_slot()
412 iter->tags >>= offset++; in radix_tree_next_slot()
413 iter->index = __radix_tree_iter_add(iter, offset); in radix_tree_next_slot()
422 iter->index = __radix_tree_iter_add(iter, 1); in radix_tree_next_slot()
[all …]
A Dpage_ext.h130 iter->index = 0; in page_ext_iter_begin()
131 iter->start_pfn = pfn; in page_ext_iter_begin()
132 iter->page_ext = page_ext_lookup(pfn); in page_ext_iter_begin()
134 return iter->page_ext; in page_ext_iter_begin()
149 if (WARN_ON_ONCE(!iter->page_ext)) in page_ext_iter_next()
152 iter->index++; in page_ext_iter_next()
153 pfn = iter->start_pfn + iter->index; in page_ext_iter_next()
156 iter->page_ext = page_ext_next(iter->page_ext); in page_ext_iter_next()
158 iter->page_ext = page_ext_lookup(pfn); in page_ext_iter_next()
160 return iter->page_ext; in page_ext_iter_next()
[all …]
A Dbio.h37 #define bvec_iter_sectors(iter) ((iter).bi_size >> 9) argument
38 #define bvec_iter_end_sector(iter) ((iter).bi_sector + bvec_iter_sectors((iter))) argument
82 if (iter->idx >= bio->bi_vcnt) in bio_next_segment()
85 bvec_advance(&bio->bi_io_vec[iter->idx], iter); in bio_next_segment()
94 for (bvl = bvec_init_iter_all(&iter); bio_next_segment((bio), &iter); )
102 iter->bi_size -= bytes; in bio_advance_iter()
116 iter->bi_size -= bytes; in bio_advance_iter_single()
144 for (iter = (start); \
153 for (iter = (start); \
170 #define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len) argument
[all …]
A Ddevcoredump.h29 struct scatterlist *iter; in _devcd_free_sgtable() local
33 iter = table; in _devcd_free_sgtable()
34 for_each_sg(table, iter, sg_nents(table), i) { in _devcd_free_sgtable()
35 page = sg_page(iter); in _devcd_free_sgtable()
41 iter = table; in _devcd_free_sgtable()
43 while (!sg_is_last(iter)) { in _devcd_free_sgtable()
44 iter++; in _devcd_free_sgtable()
45 if (sg_is_chain(iter)) { in _devcd_free_sgtable()
46 iter = sg_chain_ptr(iter); in _devcd_free_sgtable()
48 delete_iter = iter; in _devcd_free_sgtable()
A Diomap.h177 int (*read_folio_range)(const struct iomap_iter *iter,
248 int iomap_iter_advance(struct iomap_iter *iter, u64 *count);
262 u64 end = iter->iomap.offset + iter->iomap.length; in iomap_length_trim()
264 if (iter->srcmap.type != IOMAP_HOLE) in iomap_length_trim()
265 end = min(end, iter->srcmap.offset + iter->srcmap.length); in iomap_length_trim()
275 static inline u64 iomap_length(const struct iomap_iter *iter) in iomap_length() argument
277 return iomap_length_trim(iter, iter->pos, iter->len); in iomap_length()
285 u64 length = iomap_length(iter); in iomap_iter_advance_full()
287 return iomap_iter_advance(iter, &length); in iomap_iter_advance_full()
335 return (iter->iomap.flags & IOMAP_F_SHARED) && in iomap_want_unshare_iter()
[all …]
A Dkmsg_dump.h71 bool kmsg_dump_get_line(struct kmsg_dump_iter *iter, bool syslog,
74 bool kmsg_dump_get_buffer(struct kmsg_dump_iter *iter, bool syslog,
77 void kmsg_dump_rewind(struct kmsg_dump_iter *iter);
89 static inline bool kmsg_dump_get_line(struct kmsg_dump_iter *iter, bool syslog, in kmsg_dump_get_line() argument
95 static inline bool kmsg_dump_get_buffer(struct kmsg_dump_iter *iter, bool syslog, in kmsg_dump_get_buffer() argument
101 static inline void kmsg_dump_rewind(struct kmsg_dump_iter *iter) in kmsg_dump_rewind() argument
A Ddma-fence-chain.h120 #define dma_fence_chain_for_each(iter, head) \ argument
121 for (iter = dma_fence_get(head); iter; \
122 iter = dma_fence_chain_walk(iter))
A Dgeneric-radix-tree.h315 if (iter->offset + obj_size < iter->offset) { in __genradix_iter_advance()
316 iter->offset = SIZE_MAX; in __genradix_iter_advance()
317 iter->pos = SIZE_MAX; in __genradix_iter_advance()
321 iter->offset += obj_size; in __genradix_iter_advance()
325 iter->offset = round_up(iter->offset, GENRADIX_NODE_SIZE); in __genradix_iter_advance()
327 iter->pos++; in __genradix_iter_advance()
336 if (iter->offset == 0 || in __genradix_iter_rewind()
337 iter->offset == SIZE_MAX) { in __genradix_iter_rewind()
338 iter->offset = SIZE_MAX; in __genradix_iter_rewind()
345 iter->offset -= obj_size; in __genradix_iter_rewind()
[all …]
A Dblk-mq-dma.h17 struct req_iterator iter; member
22 struct dma_iova_state *state, struct blk_dma_iter *iter);
24 struct dma_iova_state *state, struct blk_dma_iter *iter);
A Duio.h91 struct iov_iter iter; member
96 if (iter->iter_type == ITER_UBUF) in iter_iov()
97 return (const struct iovec *) &iter->__ubuf_iovec; in iter_iov()
98 return iter->__iov; in iter_iov()
101 #define iter_iov_addr(iter) (iter_iov(iter)->iov_base + (iter)->iov_offset) argument
115 static inline void iov_iter_save_state(struct iov_iter *iter, in iov_iter_save_state() argument
118 state->iov_offset = iter->iov_offset; in iov_iter_save_state()
119 state->count = iter->count; in iov_iter_save_state()
120 state->nr_segs = iter->nr_segs; in iov_iter_save_state()
413 return user_backed_iter(iter); in iov_iter_extract_will_pin()
[all …]
A Dbio-integrity.h34 #define bip_for_each_vec(bvl, bip, iter) \ argument
35 for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter)
76 int bio_integrity_map_user(struct bio *bio, struct iov_iter *iter);
91 static inline int bio_integrity_map_user(struct bio *bio, struct iov_iter *iter) in bio_integrity_map_user() argument
A Drolling_buffer.h27 struct iov_iter iter; /* Iterator tracking what's left in the buffer */ member
58 iov_iter_advance(&roll->iter, amount); in rolling_buffer_advance()
A Dnetfs.h334 struct iov_iter *iter,
342 struct iov_iter *iter,
392 ssize_t netfs_unbuffered_read_iter_locked(struct kiocb *iocb, struct iov_iter *iter);
393 ssize_t netfs_unbuffered_read_iter(struct kiocb *iocb, struct iov_iter *iter);
394 ssize_t netfs_buffered_read_iter(struct kiocb *iocb, struct iov_iter *iter);
395 ssize_t netfs_file_read_iter(struct kiocb *iocb, struct iov_iter *iter);
398 ssize_t netfs_perform_write(struct kiocb *iocb, struct iov_iter *iter,
403 ssize_t netfs_unbuffered_write_iter_locked(struct kiocb *iocb, struct iov_iter *iter,
409 ssize_t netfs_read_single(struct inode *inode, struct file *file, struct iov_iter *iter);
412 struct iov_iter *iter);
[all …]
A Dring_buffer.h159 void ring_buffer_read_finish(struct ring_buffer_iter *iter);
162 ring_buffer_iter_peek(struct ring_buffer_iter *iter, u64 *ts);
163 void ring_buffer_iter_advance(struct ring_buffer_iter *iter);
164 void ring_buffer_iter_reset(struct ring_buffer_iter *iter);
165 int ring_buffer_iter_empty(struct ring_buffer_iter *iter);
166 bool ring_buffer_iter_dropped(struct ring_buffer_iter *iter);
A Dbacking-file.h27 ssize_t backing_file_read_iter(struct file *file, struct iov_iter *iter,
30 ssize_t backing_file_write_iter(struct file *file, struct iov_iter *iter,
/include/linux/mtd/
A Dnand.h930 iter->req.dataoffs = nanddev_offs_to_pos(nand, offs, &iter->req.pos); in nanddev_io_page_iter_init()
941 iter->oobbytes_per_page - iter->req.ooboffs, in nanddev_io_page_iter_init()
971 iter->oobleft = 0; in nanddev_io_block_iter_init()
993 iter->dataleft -= iter->req.datalen; in nanddev_io_iter_next_page()
994 iter->req.databuf.in += iter->req.datalen; in nanddev_io_iter_next_page()
995 iter->oobleft -= iter->req.ooblen; in nanddev_io_iter_next_page()
996 iter->req.oobbuf.in += iter->req.ooblen; in nanddev_io_iter_next_page()
1001 iter->req.ooblen = min_t(unsigned int, iter->oobbytes_per_page, in nanddev_io_iter_next_page()
1017 iter->dataleft -= iter->req.datalen; in nanddev_io_iter_next_block()
1018 iter->req.databuf.in += iter->req.datalen; in nanddev_io_iter_next_block()
[all …]
/include/drm/
A Ddrm_damage_helper.h46 #define drm_atomic_for_each_plane_damage(iter, rect) \ argument
47 while (drm_atomic_helper_damage_iter_next(iter, rect))
74 drm_atomic_helper_damage_iter_init(struct drm_atomic_helper_damage_iter *iter,
78 drm_atomic_helper_damage_iter_next(struct drm_atomic_helper_damage_iter *iter,
/include/media/
A Dmedia-entity.h383 #define media_entity_for_each_pad(entity, iter) \ argument
384 for (iter = (entity)->pads; \
385 iter < &(entity)->pads[(entity)->num_pads]; \
386 ++iter)
1196 struct media_pipeline_pad_iter *iter,
1209 #define media_pipeline_for_each_pad(pipe, iter, pad) \ argument
1210 for (pad = __media_pipeline_pad_iter_next((pipe), iter, NULL); \
1212 pad = __media_pipeline_pad_iter_next((pipe), iter, pad))
1230 struct media_pipeline_entity_iter *iter);
1243 struct media_pipeline_entity_iter *iter,
[all …]
/include/linux/ceph/
A Dmessenger.h133 struct bvec_iter iter; member
140 BUG_ON(!(it)->iter.bi_size); \
147 (it)->iter = (it)->bio->bi_iter; \
167 __cur_iter = (it)->iter; \
177 struct bvec_iter iter; member
181 BUG_ON((n) > (it)->iter.bi_size); \
200 __cur_iter = (it)->iter; \
207 BUG_ON((n) > (it)->iter.bi_size); \
208 (it)->iter.bi_size = (n); \
228 struct iov_iter iter; member
[all …]
/include/linux/io_uring/
A Dcmd.h40 struct iov_iter *iter,
46 int ddir, struct iov_iter *iter,
76 struct iov_iter *iter, struct io_uring_cmd *ioucmd, in io_uring_cmd_import_fixed() argument
84 int ddir, struct iov_iter *iter, in io_uring_cmd_import_fixed_vec() argument
/include/trace/
A Dtrace_custom_events.h79 trace_custom_raw_output_##call(struct trace_iterator *iter, int flags, \
82 struct trace_seq *s = &iter->seq; \
83 struct trace_seq __maybe_unused *p = &iter->tmp_seq; \
87 field = (typeof(field))iter->ent; \
89 ret = trace_raw_output_prep(iter, trace_event); \
93 trace_event_printf(iter, print); \
A Dtrace_events.h205 trace_raw_output_##call(struct trace_iterator *iter, int flags, \
208 struct trace_seq *s = &iter->seq; \
209 struct trace_seq __maybe_unused *p = &iter->tmp_seq; \
213 field = (typeof(field))iter->ent; \
215 ret = trace_raw_output_prep(iter, trace_event); \
219 trace_event_printf(iter, print); \
233 trace_raw_output_##call(struct trace_iterator *iter, int flags, \
238 struct trace_seq *p = &iter->tmp_seq; \
240 entry = iter->ent; \
250 return trace_output_call(iter, #call, print); \
/include/net/
A Dbonding.h83 #define bond_for_each_slave(bond, pos, iter) \ argument
406 struct list_head *iter; in bond_slave_state_change() local
409 bond_for_each_slave(bond, tmp, iter) { in bond_slave_state_change()
419 struct list_head *iter; in bond_slave_state_notify() local
422 bond_for_each_slave(bond, tmp, iter) { in bond_slave_state_notify()
643 struct list_head *iter; in bond_slave_link_notify() local
646 bond_for_each_slave(bond, tmp, iter) { in bond_slave_link_notify()
741 struct list_head *iter; in bond_slave_has_mac() local
744 bond_for_each_slave(bond, tmp, iter) in bond_slave_has_mac()
754 struct list_head *iter; in bond_slave_has_mac_rcu() local
[all …]

Completed in 825 milliseconds

123