Home
last modified time | relevance | path

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

12345678910>>...42

/linux/fs/udf/
A Ddirectory.c115 iter->name = iter->namebuf; in udf_copy_fi()
135 if (iter->loffset + ralen > (iter->elen >> iter->dir->i_blkbits)) in udf_readahead_dir()
136 ralen = (iter->elen >> iter->dir->i_blkbits) - iter->loffset; in udf_readahead_dir()
177 err = udf_next_aext(iter->dir, &iter->epos, &iter->eloc, in udf_fiiter_advance_blk()
202 if (!iter->bh[0] && iter->elen) { in udf_fiiter_load_bhs()
240 iter->bh[0] = iter->bh[1] = NULL; in udf_fiiter_load_bhs()
270 &iter->eloc, &iter->elen, &iter->loffset, &etype); in udf_fiiter_init()
305 iter->bh[0] = iter->bh[1]; in udf_fiiter_advance()
428 iter->name == iter->namebuf ? iter->name : NULL); in udf_fiiter_write_fi()
453 udf_write_aext(iter->dir, &iter->epos, &iter->eloc, iter->elen, 1); in udf_fiiter_update_elen()
[all …]
/linux/arch/x86/kvm/mmu/
A Dtdp_iter.c14 iter->sptep = iter->pt_path[iter->level - 1] + in tdp_iter_refresh_sptep()
15 SPTE_INDEX(iter->gfn << PAGE_SHIFT, iter->level); in tdp_iter_refresh_sptep()
26 iter->yielded_gfn = iter->next_last_level_gfn; in tdp_iter_restart()
27 iter->level = iter->root_level; in tdp_iter_restart()
29 iter->gfn = gfn_round_for_level(iter->next_last_level_gfn, iter->level); in tdp_iter_restart()
82 if (iter->level == iter->min_level) in try_step_down()
96 iter->pt_path[iter->level - 1] = child_pt; in try_step_down()
97 iter->gfn = gfn_round_for_level(iter->next_last_level_gfn, iter->level); in try_step_down()
121 iter->next_last_level_gfn = iter->gfn; in try_step_side()
135 if (iter->level == iter->root_level) in try_step_up()
[all …]
A Dtdp_mmu.c588 handle_changed_spte(kvm, iter->as_id, iter->gfn, iter->old_spte, in tdp_mmu_set_spte_atomic()
629 handle_changed_spte(kvm, iter->as_id, iter->gfn, iter->old_spte, in tdp_mmu_zap_spte_atomic()
673 iter->old_spte = tdp_mmu_set_spte(kvm, iter->as_id, iter->sptep, in tdp_mmu_iter_set_spte()
675 iter->gfn, iter->level); in tdp_mmu_iter_set_spte()
867 !is_last_spte(iter.old_spte, iter.level)) in tdp_mmu_zap_leafs()
1041 !is_last_spte(iter->old_spte, iter->level)) in tdp_mmu_map_handle_target_level()
1262 trace_kvm_tdp_mmu_spte_changed(iter->as_id, iter->gfn, iter->level, in age_gfn_range()
1520 !is_last_spte(iter.old_spte, iter.level)) in clear_dirty_gfn_range()
1593 trace_kvm_tdp_mmu_spte_changed(iter.as_id, iter.gfn, iter.level, in clear_dirty_pt_masked()
1643 if (is_last_spte(iter.old_spte, iter.level)) in zap_collapsible_spte_range()
[all …]
/linux/lib/
A Dinterval_tree.c63 iter->last_hole = iter->nodes[1]->start - 1; in interval_tree_span_iter_first()
73 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_first()
84 if (!iter->nodes[0] && !iter->nodes[1]) { in interval_tree_span_iter_next()
90 iter->start_used = iter->last_hole + 1; in interval_tree_span_iter_next()
91 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_next()
92 if (iter->last_used >= iter->last_index) { in interval_tree_span_iter_next()
93 iter->last_used = iter->last_index; in interval_tree_span_iter_next()
103 iter->start_hole = iter->nodes[0]->last + 1; in interval_tree_span_iter_next()
104 iter->last_hole = iter->last_index; in interval_tree_span_iter_next()
111 iter->start_hole = iter->nodes[0]->last + 1; in interval_tree_span_iter_next()
[all …]
/linux/fs/iomap/
A Diter.c34 iter->pos += iter->processed; in iomap_iter_advance()
35 iter->len -= iter->processed; in iomap_iter_advance()
42 memset(&iter->iomap, 0, sizeof(iter->iomap)); in iomap_iter_advance()
43 memset(&iter->srcmap, 0, sizeof(iter->srcmap)); in iomap_iter_advance()
49 WARN_ON_ONCE(iter->iomap.offset > iter->pos); in iomap_iter_done()
51 WARN_ON_ONCE(iter->iomap.offset + iter->iomap.length <= iter->pos); in iomap_iter_done()
79 ret = ops->iomap_end(iter->inode, iter->pos, iomap_length(iter), in iomap_iter()
80 iter->processed > 0 ? iter->processed : 0, in iomap_iter()
81 iter->flags, &iter->iomap); in iomap_iter()
91 ret = ops->iomap_begin(iter->inode, iter->pos, iter->len, iter->flags, in iomap_iter()
[all …]
A Dseek.c18 switch (iter->iomap.type) { in iomap_seek_hole_iter()
21 iter->pos, iter->pos + length, SEEK_HOLE); in iomap_seek_hole_iter()
26 *hole_pos = iter->pos; in iomap_seek_hole_iter()
37 struct iomap_iter iter = { in iomap_seek_hole() local
48 iter.len = size - pos; in iomap_seek_hole()
50 iter.processed = iomap_seek_hole_iter(&iter, &pos); in iomap_seek_hole()
69 iter->pos, iter->pos + length, SEEK_DATA); in iomap_seek_data_iter()
74 *hole_pos = iter->pos; in iomap_seek_data_iter()
83 struct iomap_iter iter = { in iomap_seek_data() local
94 iter.len = size - pos; in iomap_seek_data()
[all …]
/linux/arch/arm64/kvm/vgic/
A Dvgic-debug.c50 if (iter->lpi_idx < iter->nr_lpis) in iter_next()
60 ++iter->vcpu_id < iter->nr_cpus) in iter_next()
99 memset(iter, 0, sizeof(*iter)); in iter_init()
114 iter->vcpu_id == iter->nr_cpus && in end_of_vgic()
116 (!iter->nr_lpis || iter->lpi_idx > iter->nr_lpis); in end_of_vgic()
125 iter = kvm->arch.vgic.iter; in vgic_debug_start()
131 iter = kmalloc(sizeof(*iter), GFP_KERNEL); in vgic_debug_start()
138 kvm->arch.vgic.iter = iter; in vgic_debug_start()
150 struct vgic_state_iter *iter = kvm->arch.vgic.iter; in vgic_debug_next() local
172 iter = kvm->arch.vgic.iter; in vgic_debug_stop()
[all …]
/linux/drivers/gpu/drm/
A Ddrm_displayid.c78 memset(iter, 0, sizeof(*iter)); in displayid_iter_edid_begin()
88 if (!iter->section) in displayid_iter_block()
91 block = (const struct displayid_block *)&iter->section[iter->idx]; in displayid_iter_block()
93 if (iter->idx + sizeof(*block) <= iter->length && in displayid_iter_block()
94 iter->idx + sizeof(*block) + block->num_bytes <= iter->length) in displayid_iter_block()
105 if (!iter->drm_edid) in __displayid_iter_next()
108 if (iter->section) { in __displayid_iter_next()
129 iter->section = drm_find_displayid_extension(iter->drm_edid, in __displayid_iter_next()
142 base = displayid_get_header(iter->section, iter->length, in __displayid_iter_next()
143 iter->idx); in __displayid_iter_next()
[all …]
A Ddrm_vma_manager.c145 struct rb_node *iter; in drm_vma_offset_lookup_locked() local
155 iter = iter->rb_right; in drm_vma_offset_lookup_locked()
160 iter = iter->rb_left; in drm_vma_offset_lookup_locked()
262 parent = *iter; in vma_node_allow()
270 iter = &(*iter)->rb_right; in vma_node_allow()
272 iter = &(*iter)->rb_left; in vma_node_allow()
375 iter = iter->rb_right; in drm_vma_node_revoke()
377 iter = iter->rb_left; in drm_vma_node_revoke()
412 iter = iter->rb_right; in drm_vma_node_is_allowed()
414 iter = iter->rb_left; in drm_vma_node_is_allowed()
[all …]
/linux/net/netlabel/
A Dnetlabel_addrlist.c52 if (iter->valid && (addr & iter->mask) == iter->addr) in netlbl_af4list_search()
53 return iter; in netlbl_af4list_search()
77 if (iter->valid && iter->addr == addr && iter->mask == mask) in netlbl_af4list_search_exact()
78 return iter; in netlbl_af4list_search_exact()
102 if (iter->valid && in netlbl_af6list_search()
103 ipv6_masked_addr_cmp(&iter->addr, &iter->mask, addr) == 0) in netlbl_af6list_search()
104 return iter; in netlbl_af6list_search()
128 if (iter->valid && in netlbl_af6list_search_exact()
131 return iter; in netlbl_af6list_search_exact()
154 iter->addr == entry->addr && iter->mask == entry->mask) in netlbl_af4list_add()
[all …]
/linux/include/linux/
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 Dbvec.h98 #define __bvec_iter_bvec(bvec, iter) (&(bvec)[(iter).bi_idx]) argument
105 min((iter).bi_size, \
106 __bvec_iter_bvec((bvec), (iter))->bv_len - (iter).bi_bvec_done)
109 (__bvec_iter_bvec((bvec), (iter))->bv_offset + (iter).bi_bvec_done)
147 iter->bi_size = 0; in bvec_iter_advance()
151 iter->bi_size -= bytes; in bvec_iter_advance()
159 iter->bi_idx = idx; in bvec_iter_advance()
160 iter->bi_bvec_done = bytes; in bvec_iter_advance()
175 iter->bi_idx++; in bvec_iter_advance_single()
177 iter->bi_bvec_done = done; in bvec_iter_advance_single()
[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 …]
/linux/kernel/
A Dkallsyms.c579 &iter->value, &iter->type, in get_ksymbol_mod()
580 iter->name, iter->module_name, in get_ksymbol_mod()
583 iter->pos_mod_end = iter->pos; in get_ksymbol_mod()
598 &iter->value, &iter->type, in get_ksymbol_ftrace_mod()
599 iter->name, iter->module_name, in get_ksymbol_ftrace_mod()
602 iter->pos_ftrace_mod_end = iter->pos; in get_ksymbol_ftrace_mod()
616 &iter->value, &iter->type, in get_ksymbol_bpf()
619 iter->pos_bpf_end = iter->pos; in get_ksymbol_bpf()
636 &iter->value, &iter->type, in get_ksymbol_kprobe()
702 iter->nameoff += get_ksymbol_core(iter); in update_iter()
[all …]
A Ducount.c235 for (iter = ucounts; iter; iter = tns->ucounts) { in inc_ucount()
237 tns = iter->ns; in inc_ucount()
244 bad = iter; in inc_ucount()
245 for (iter = ucounts; iter != bad; iter = iter->ns->ucounts) in inc_ucount()
255 for (iter = ucounts; iter; iter = iter->ns->ucounts) { in dec_ucount()
268 for (iter = ucounts; iter; iter = iter->ns->ucounts) { in inc_rlimit_ucounts()
283 for (iter = ucounts; iter; iter = iter->ns->ucounts) { in dec_rlimit_ucounts()
296 for (iter = ucounts; iter != last; iter = next) { in do_dec_rlimit_put_ucounts()
301 put_ucounts(iter); in do_dec_rlimit_put_ucounts()
318 for (iter = ucounts; iter; iter = iter->ns->ucounts) { in inc_rlimit_get_ucounts()
[all …]
/linux/fs/bcachefs/
A Dbkey_sort.c15 return !iter->used; in sort_iter_end()
24 i + 1 < iter->used && in sort_iter_sift()
25 cmp(iter->b, iter->data[i].k, iter->data[i + 1].k) > 0; in sort_iter_sift()
27 swap(iter->data[i], iter->data[i + 1]); in sort_iter_sift()
32 unsigned i = iter->used; in sort_iter_sort()
40 return !sort_iter_end(iter) ? iter->data->k : NULL; in sort_iter_peek()
47 BUG_ON(!iter->used); in sort_iter_advance()
54 array_remove_item(iter->data, iter->used, 0); in sort_iter_advance()
88 return iter->used >= 2 && in should_drop_next_key()
90 iter->data[0].k, in should_drop_next_key()
[all …]
A Dbtree_journal_iter.c308 if (iter->idx < iter->keys->size) { in bch2_journal_iter_advance()
310 if (iter->idx == iter->keys->gap) in bch2_journal_iter_advance()
311 iter->idx += iter->keys->size - iter->keys->nr; in bch2_journal_iter_advance()
319 while (iter->idx < iter->keys->size) { in bch2_journal_iter_peek()
320 struct journal_key *k = iter->keys->data + iter->idx; in bch2_journal_iter_peek()
358 iter->b, &iter->unpacked); in bch2_journal_iter_peek_btree()
363 bch2_btree_node_iter_advance(&iter->node_iter, iter->b); in bch2_journal_iter_advance_btree()
371 iter->pos = bpos_successor(iter->pos); in bch2_btree_and_journal_iter_advance()
404 if (iter->prefetch && iter->journal.level) in bch2_btree_and_journal_iter_peek()
452 memset(iter, 0, sizeof(*iter)); in __bch2_btree_and_journal_iter_init_node_iter()
[all …]
A Dbtree_iter.c271 iter->pos.snapshot != iter->snapshot); in bch2_btree_iter_verify_entry_exit()
274 bkey_gt(iter->pos, iter->k.p)); in bch2_btree_iter_verify_entry_exit()
1864 return bch2_btree_path_traverse(iter->trans, iter->path, iter->flags); in __bch2_btree_iter_traverse()
1880 ret = bch2_btree_path_traverse(iter->trans, iter->path, iter->flags); in bch2_btree_iter_traverse()
1913 iter->k.p = iter->pos = b->key.k.p; in bch2_btree_iter_peek_node()
2007 iter->k.p = iter->pos = b->key.k.p; in bch2_btree_iter_next_node()
2356 iter->update_path = iter->path; in bch2_btree_iter_peek_upto()
2422 iter->pos.snapshot = iter->snapshot; in bch2_btree_iter_peek_upto()
2426 bch2_btree_iter_set_pos(iter, iter->pos); in bch2_btree_iter_peek_upto()
2577 iter->pos.snapshot = iter->snapshot; in bch2_btree_iter_peek_prev()
[all …]
/linux/block/
A Dt10-pi.c43 for (i = 0 ; i < iter->data_size ; i += iter->interval) { in t10_pi_generate()
58 iter->data_buf += iter->interval; in t10_pi_generate()
60 iter->seed++; in t10_pi_generate()
70 for (i = 0 ; i < iter->data_size ; i += iter->interval) { in t10_pi_verify()
92 csum = t10_pi_csum(0, iter->data_buf, iter->interval, in t10_pi_verify()
107 iter->data_buf += iter->interval; in t10_pi_verify()
109 iter->seed++; in t10_pi_verify()
236 iter->data_buf += iter->interval; in ext_pi_crc64_generate()
255 for (i = 0; i < iter->data_size; i += iter->interval) { in ext_pi_crc64_verify()
285 iter->disk_name, (unsigned long long)iter->seed, in ext_pi_crc64_verify()
[all …]
/linux/drivers/gpu/drm/etnaviv/
A Detnaviv_dump.c74 hdr->file_offset = cpu_to_le32(iter->data - iter->start); in etnaviv_core_dump_header()
77 iter->hdr++; in etnaviv_core_dump_header()
105 etnaviv_core_dump_header(iter, ETDUMP_BUF_MMU, iter->data + mmu_size); in etnaviv_core_dump_mmu()
115 etnaviv_core_dump_header(iter, type, iter->data + size); in etnaviv_core_dump_mem()
163 if (!iter.start) { in etnaviv_core_dump()
170 iter.hdr = iter.start; in etnaviv_core_dump()
171 iter.data = &iter.hdr[n_obj]; in etnaviv_core_dump()
173 memset(iter.hdr, 0, iter.data - iter.start); in etnaviv_core_dump()
226 etnaviv_core_dump_header(&iter, ETDUMP_BUF_BO, iter.data + in etnaviv_core_dump()
230 etnaviv_core_dump_header(&iter, ETDUMP_BUF_END, iter.data); in etnaviv_core_dump()
[all …]
/linux/kernel/trace/
A Dtrace_output.c304 entry = iter->ent; in trace_raw_output_prep()
323 trace_check_vprintf(iter, trace_event_format(iter, fmt), ap); in trace_event_printf()
554 unsigned long long abs_ts = iter->ts - iter->array_buffer->time_start; in lat_print_timestamp()
571 ns2usecs(iter->ts), in lat_print_timestamp()
633 trace_print_time(s, iter, iter->ts); in trace_print_context()
649 next_ts = iter->ts; in trace_print_lat_context()
652 entry = iter->ent; in trace_print_lat_context()
879 if (!iter->fmt_size) in print_fields()
888 pos, iter->fmt); in print_fields()
987 trace_seq_printf(&iter->seq, "type: %d\n", iter->ent->type); in trace_nop_print()
[all …]
/linux/drivers/gpu/drm/panfrost/
A Dpanfrost_dump.c68 hdr->file_offset = iter->data - iter->start; in panfrost_core_dump_header()
71 iter->hdr++; in panfrost_core_dump_header()
72 iter->data += hdr->file_size; in panfrost_core_dump_header()
165 if (!iter.start) { in panfrost_core_dump()
171 iter.hdr = iter.start; in panfrost_core_dump()
172 iter.data = &iter.hdr[n_obj]; in panfrost_core_dump()
174 memset(iter.hdr, 0, iter.data - iter.start); in panfrost_core_dump()
233 iter.hdr->bomap.valid = 1; in panfrost_core_dump()
235 dump_header: panfrost_core_dump_header(&iter, PANFROSTDUMP_BUF_BO, iter.data + in panfrost_core_dump()
238 panfrost_core_dump_header(&iter, PANFROSTDUMP_BUF_TRAILER, iter.data); in panfrost_core_dump()
[all …]
/linux/tools/testing/selftests/bpf/progs/
A Diters_state_safety.c36 struct bpf_iter_num iter; in create_and_destroy() local
59 struct bpf_iter_num iter; in create_and_forget_to_destroy_fail() local
80 struct bpf_iter_num iter; in destroy_without_creating_fail() local
97 struct bpf_iter_num iter; in compromise_iter_w_direct_write_fail() local
124 struct bpf_iter_num iter; in compromise_iter_w_direct_write_and_skip_destroy_fail() local
149 struct bpf_iter_num iter; in compromise_iter_w_helper_write_fail() local
178 struct bpf_iter_num iter; in subprog_with_iter() local
202 struct bpf_iter_num iter; in valid_stack_reuse() local
236 struct bpf_iter_num iter; in double_create_fail() local
264 struct bpf_iter_num iter; in double_destroy_fail() local
[all …]
A Dbpf_iter_ksym.c32 struct kallsym_iter *iter = ctx->ksym; in dump_ksym() local
37 if (!iter) in dump_ksym()
45 BPF_SEQ_PRINTF(seq, "0x%x\n", iter->value - last_sym_value); in dump_ksym()
49 value = iter->show_value ? iter->value : 0; in dump_ksym()
53 type = iter->type; in dump_ksym()
55 if (iter->module_name[0]) { in dump_ksym()
56 type = iter->exported ? to_upper(type) : to_lower(type); in dump_ksym()
58 value, type, iter->name, iter->module_name); in dump_ksym()
62 if (!iter->pos_mod_end || iter->pos_mod_end > iter->pos) in dump_ksym()
64 else if (!iter->pos_ftrace_mod_end || iter->pos_ftrace_mod_end > iter->pos) in dump_ksym()
[all …]
/linux/drivers/net/ethernet/mellanox/mlx4/
A Dicm.h99 iter->icm = icm; in mlx4_icm_first()
103 iter->page_idx = 0; in mlx4_icm_first()
108 return !iter->chunk; in mlx4_icm_last()
113 if (++iter->page_idx >= iter->chunk->nsg) { in mlx4_icm_next()
114 if (iter->chunk->list.next == &iter->icm->chunk_list) { in mlx4_icm_next()
119 iter->chunk = list_entry(iter->chunk->list.next, in mlx4_icm_next()
121 iter->page_idx = 0; in mlx4_icm_next()
128 return iter->chunk->buf[iter->page_idx].dma_addr; in mlx4_icm_addr()
130 return sg_dma_address(&iter->chunk->sg[iter->page_idx]); in mlx4_icm_addr()
136 return iter->chunk->buf[iter->page_idx].size; in mlx4_icm_size()
[all …]

Completed in 79 milliseconds

12345678910>>...42