Home
last modified time | relevance | path

Searched refs:cur (Results 1 – 25 of 835) sorted by relevance

12345678910>>...34

/linux-6.15/drivers/gpu/drm/xe/
H A Dxe_res_cursor.h94 cur->sgl = NULL; in xe_res_first()
128 cur->mm = mm; in xe_res_first()
164 cur->sgl = sgl; in __xe_res_sg_next()
184 while (cur->dma_seg_size - start < cur->remaining) { in __xe_res_dma_next()
185 if (cur->dma_start + cur->dma_seg_size != addr[1].addr || in __xe_res_dma_next()
194 cur->size = cur->dma_seg_size - start; in __xe_res_dma_next()
215 cur->size = 0; in xe_res_first_sg()
245 cur->size = 0; in xe_res_first_dma()
284 if (cur->sgl) { in xe_res_next()
326 return cur->dma_start + cur->start; in xe_res_dma()
[all …]
/linux-6.15/fs/xfs/libxfs/
H A Dxfs_btree.c148 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock_hdr()
250 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_agblock()
491 error = cur->bc_ops->free_block(cur, bp); in xfs_btree_free_block()
534 kmem_cache_free(cur->bc_cache, cur); in xfs_btree_del_cursor()
585 new = cur->bc_ops->dup_cursor(cur); in xfs_btree_dup_cursor()
754 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset()
2506 ASSERT(cur->bc_ops->keys_inorder(cur, in xfs_btree_lshift()
3073 args.cur = cur; in xfs_btree_split()
3121 cur->bc_ops->broot_realloc(cur, 0); in xfs_btree_promote_leaf_iroot()
3206 cur->bc_ops->broot_realloc(cur, 1); in xfs_btree_promote_node_iroot()
[all …]
H A Dxfs_btree_staging.c444 return cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_max_npb()
446 ret = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_max_npb()
500 maxnr = cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_level_geometry()
502 maxnr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_level_geometry()
552 maxr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_ensure_slack()
553 minr = cur->bc_ops->get_minrecs(cur, level); in xfs_btree_bload_ensure_slack()
590 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()
595 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()
638 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()
654 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()
[all …]
H A Dxfs_refcount.c53 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument
73 struct xfs_btree_cur *cur, in xfs_refcount_lookup_ge() argument
93 struct xfs_btree_cur *cur, in xfs_refcount_lookup_eq() argument
173 struct xfs_btree_cur *cur, in xfs_refcount_check_btrec() argument
201 xfs_btree_mark_sick(cur); in xfs_refcount_complain_bad_rec()
283 xfs_btree_mark_sick(cur); in xfs_refcount_insert()
302 struct xfs_btree_cur *cur, in xfs_refcount_delete() argument
313 xfs_btree_mark_sick(cur); in xfs_refcount_delete()
320 xfs_btree_mark_sick(cur); in xfs_refcount_delete()
1199 cur->bc_refc.nr_ops++; in xfs_refcount_adjust_extents()
[all …]
H A Dxfs_btree.h549 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0; in xfs_btree_keycmp_lt()
558 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0; in xfs_btree_keycmp_gt()
567 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0; in xfs_btree_keycmp_eq()
605 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0; in xfs_btree_masked_keycmp_lt()
615 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0; in xfs_btree_masked_keycmp_gt()
631 struct xfs_btree_cur *cur, in xfs_btree_islastblock() argument
682 cur->bc_ops = ops; in xfs_btree_alloc_cursor()
683 cur->bc_tp = tp; in xfs_btree_alloc_cursor()
684 cur->bc_mp = mp; in xfs_btree_alloc_cursor()
686 cur->bc_cache = cache; in xfs_btree_alloc_cursor()
[all …]
H A Dxfs_iext_tree.c142 return &cur->leaf->recs[cur->pos]; in cur_rec()
150 if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp)) in xfs_iext_valid()
231 ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF); in xfs_iext_next()
239 cur->pos++; in xfs_iext_next()
242 cur->leaf = cur->leaf->next; in xfs_iext_next()
253 ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF); in xfs_iext_prev()
263 cur->pos--; in xfs_iext_prev()
269 cur->leaf = cur->leaf->prev; in xfs_iext_prev()
667 cur->leaf->recs[i] = cur->leaf->recs[i - 1]; in xfs_iext_insert_raw()
951 for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) { in xfs_iext_lookup_extent()
[all …]
H A Dxfs_rmap.c39 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument
64 xfs_btree_mark_sick(cur); in xfs_rmap_lookup_le()
77 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument
100 struct xfs_btree_cur *cur, in xfs_rmap_update() argument
366 xfs_btree_mark_sick(cur); in xfs_rmap_complain_bad_rec()
375 struct xfs_btree_cur *cur, in xfs_rmap_get_rec() argument
432 struct xfs_btree_cur *cur, in xfs_rmap_find_left_neighbor() argument
860 trace_xfs_rmap_insert(cur, cur->bc_rec.r.rm_startblock, in xfs_rmap_unmap()
1591 cur->bc_rec.r = NEW; in xfs_rmap_convert()
1649 cur->bc_rec.r = NEW; in xfs_rmap_convert()
[all …]
H A Dxfs_ialloc_btree.c30 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument
38 struct xfs_btree_cur *cur) in xfs_inobt_dup_cursor() argument
40 return xfs_inobt_init_cursor(to_perag(cur->bc_group), cur->bc_tp, in xfs_inobt_dup_cursor()
41 cur->bc_ag.agbp); in xfs_inobt_dup_cursor()
46 struct xfs_btree_cur *cur) in xfs_finobt_dup_cursor() argument
48 return xfs_finobt_init_cursor(to_perag(cur->bc_group), cur->bc_tp, in xfs_finobt_dup_cursor()
49 cur->bc_ag.agbp); in xfs_finobt_dup_cursor()
113 args.tp = cur->bc_tp; in __xfs_inobt_alloc_block()
114 args.mp = cur->bc_mp; in __xfs_inobt_alloc_block()
494 return cur; in xfs_inobt_init_cursor()
[all …]
H A Dxfs_alloc_btree.c28 struct xfs_btree_cur *cur) in xfs_bnobt_dup_cursor() argument
30 return xfs_bnobt_init_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ag.agbp, in xfs_bnobt_dup_cursor()
31 to_perag(cur->bc_group)); in xfs_bnobt_dup_cursor()
36 struct xfs_btree_cur *cur) in xfs_cntbt_dup_cursor() argument
38 return xfs_cntbt_init_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ag.agbp, in xfs_cntbt_dup_cursor()
39 to_perag(cur->bc_group)); in xfs_cntbt_dup_cursor()
44 struct xfs_btree_cur *cur, in xfs_allocbt_set_root() argument
78 error = xfs_alloc_get_freelist(to_perag(cur->bc_group), cur->bc_tp, in xfs_allocbt_alloc_block()
107 error = xfs_alloc_put_freelist(to_perag(cur->bc_group), cur->bc_tp, in xfs_allocbt_free_block()
502 return cur; in xfs_bnobt_init_cursor()
[all …]
H A Dxfs_bmap_btree.c182 struct xfs_btree_cur *cur) in xfs_bmbt_dup_cursor() argument
186 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_bmbt_dup_cursor()
187 cur->bc_ino.ip, cur->bc_ino.whichfork); in xfs_bmbt_dup_cursor()
218 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block()
219 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block()
221 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block()
234 args.minleft = xfs_bmapi_minleft(cur->bc_tp, cur->bc_ino.ip, in xfs_bmbt_alloc_block()
259 cur->bc_bmap.allocated++; in xfs_bmbt_alloc_block()
625 return xfs_bmap_broot_realloc(cur->bc_ino.ip, cur->bc_ino.whichfork, in xfs_bmbt_broot_realloc()
690 cur->bc_ino.ip = ip; in xfs_bmbt_init_cursor()
[all …]
H A Dxfs_btree_mem.c26 struct xfs_btree_cur *cur, in xfbtree_set_root() argument
39 struct xfs_btree_cur *cur, in xfbtree_init_ptr_from_cur() argument
50 struct xfs_btree_cur *cur) in xfbtree_dup_cursor() argument
56 ncur = xfs_btree_alloc_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ops, in xfbtree_dup_cursor()
57 cur->bc_maxlevels, cur->bc_cache); in xfbtree_dup_cursor()
58 ncur->bc_flags = cur->bc_flags; in xfbtree_dup_cursor()
61 if (cur->bc_group) in xfbtree_dup_cursor()
163 struct xfs_btree_cur *cur, in xfbtree_alloc_block() argument
190 struct xfs_btree_cur *cur, in xfbtree_free_block() argument
210 struct xfs_btree_cur *cur, in xfbtree_get_minrecs() argument
[all …]
H A Dxfs_refcount_btree.c30 struct xfs_btree_cur *cur) in xfs_refcountbt_dup_cursor() argument
32 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_refcountbt_dup_cursor()
33 cur->bc_ag.agbp, to_perag(cur->bc_group)); in xfs_refcountbt_dup_cursor()
38 struct xfs_btree_cur *cur, in xfs_refcountbt_set_root() argument
58 struct xfs_btree_cur *cur, in xfs_refcountbt_alloc_block() argument
69 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block()
70 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block()
100 struct xfs_btree_cur *cur, in xfs_refcountbt_free_block() argument
116 struct xfs_btree_cur *cur, in xfs_refcountbt_get_minrecs() argument
371 cur->bc_ag.agbp = agbp; in xfs_refcountbt_init_cursor()
[all …]
/linux-6.15/fs/xfs/scrub/
H A Dbtree.c140 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec() local
156 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
190 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key() local
261 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling() local
322 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings() local
422 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner() local
495 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs() local
500 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) in xchk_btree_check_minrecs()
546 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_keys() local
638 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys() local
[all …]
H A Drcbag.c78 struct xfs_btree_cur *cur; in rcbag_add() local
114 xfs_btree_del_cursor(cur, 0); in rcbag_add()
124 xfs_btree_del_cursor(cur, error); in rcbag_add()
156 struct xfs_btree_cur *cur; in rcbag_next_edge() local
198 xfs_btree_del_cursor(cur, 0); in rcbag_next_edge()
204 xfs_btree_del_cursor(cur, error); in rcbag_next_edge()
217 struct xfs_btree_cur *cur; in rcbag_remove_ending_at() local
223 memset(&cur->bc_rec, 0xFF, sizeof(cur->bc_rec)); in rcbag_remove_ending_at()
257 xfs_btree_del_cursor(cur, 0); in rcbag_remove_ending_at()
260 xfs_btree_del_cursor(cur, error); in rcbag_remove_ending_at()
[all …]
/linux-6.15/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_res_cursor.h90 cur->node = block; in amdgpu_res_first()
101 cur->node = node; in amdgpu_res_first()
110 cur->start = start; in amdgpu_res_first()
111 cur->size = size; in amdgpu_res_first()
113 cur->node = NULL; in amdgpu_res_first()
137 cur->size -= size; in amdgpu_res_next()
138 if (cur->size) { in amdgpu_res_next()
145 block = cur->node; in amdgpu_res_next()
152 cur->size = min(amdgpu_vram_mgr_block_size(block), cur->remaining); in amdgpu_res_next()
156 node = cur->node; in amdgpu_res_next()
[all …]
/linux-6.15/drivers/char/
H A Dbsr.c165 kfree(cur); in bsr_cleanup_devs()
194 if (!cur) { in bsr_add_node()
203 kfree(cur); in bsr_add_node()
216 if (cur->bsr_len > 4096 && cur->bsr_len < PAGE_SIZE) in bsr_add_node()
239 cur->bsr_num = bsr_types[cur->bsr_type]; in bsr_add_node()
241 cur->bsr_bytes, cur->bsr_num); in bsr_add_node()
244 result = cdev_add(&cur->bsr_cdev, cur->bsr_dev, 1); in bsr_add_node()
246 kfree(cur); in bsr_add_node()
251 cur, "%s", cur->bsr_name); in bsr_add_node()
256 kfree(cur); in bsr_add_node()
[all …]
/linux-6.15/kernel/
H A Dcrash_reserve.c82 cur = tmp; in parse_crashkernel_mem()
87 cur++; in parse_crashkernel_mem()
96 cur = tmp; in parse_crashkernel_mem()
107 cur++; in parse_crashkernel_mem()
114 cur = tmp; in parse_crashkernel_mem()
128 while (*cur && *cur != ' ' && *cur != '@') in parse_crashkernel_mem()
129 cur++; in parse_crashkernel_mem()
131 cur++; in parse_crashkernel_mem()
164 *crash_base = memparse(cur+1, &cur); in parse_crashkernel_simple()
165 else if (*cur != ' ' && *cur != '\0') { in parse_crashkernel_simple()
[all …]
/linux-6.15/kernel/printk/
H A Dnbcon.c255 if (ctxt->prio <= cur->prio || ctxt->prio <= cur->req_prio) in nbcon_context_try_acquire_direct()
258 if (cur->unsafe) in nbcon_context_try_acquire_direct()
363 new.atom = cur->atom; in nbcon_context_try_acquire_requested()
431 WARN_ON_ONCE(ctxt->prio <= cur->prio || ctxt->prio <= cur->req_prio); in nbcon_context_try_acquire_handover()
435 if (cur->cpu == cpu) in nbcon_context_try_acquire_handover()
453 new.atom = cur->atom; in nbcon_context_try_acquire_handover()
458 cur->atom = new.atom; in nbcon_context_try_acquire_handover()
542 WARN_ON_ONCE(ctxt->prio <= cur->prio || ctxt->prio <= cur->req_prio); in nbcon_context_try_acquire_hostile()
722 if (cur->unsafe) in nbcon_context_can_proceed()
726 WARN_ON_ONCE(cur->req_prio <= cur->prio); in nbcon_context_can_proceed()
[all …]
/linux-6.15/drivers/block/drbd/
H A Ddrbd_vli.h201 cur->b = s; in bitstream_cursor_reset()
202 cur->bit = 0; in bitstream_cursor_reset()
209 bits += cur->bit; in bitstream_cursor_advance()
210 cur->b = cur->b + (bits >> 3); in bitstream_cursor_advance()
211 cur->bit = bits & 7; in bitstream_cursor_advance()
216 struct bitstream_cursor cur; member
250 unsigned char *b = bs->cur.b; in bitstream_put_bits()
256 if ((bs->cur.b + ((bs->cur.bit + bits -1) >> 3)) - bs->buf >= bs->buf_len) in bitstream_put_bits()
289 if (bs->cur.b + ((bs->cur.bit + bs->pad_bits + bits -1) >> 3) - bs->buf >= bs->buf_len) in bitstream_get_bits()
291 - bs->cur.bit - bs->pad_bits; in bitstream_get_bits()
[all …]
/linux-6.15/security/selinux/ss/
H A Dhashtab.c75 while (cur) { in hashtab_destroy()
76 temp = cur; in hashtab_destroy()
77 cur = cur->next; in hashtab_destroy()
96 while (cur) { in hashtab_map()
97 ret = apply(cur->key, cur->datum, args); in hashtab_map()
100 cur = cur->next; in hashtab_map()
118 if (cur) { in hashtab_stat()
121 while (cur) { in hashtab_stat()
123 cur = cur->next; in hashtab_stat()
184 for (cur = new->htable[i]; cur; cur = tmp) { in hashtab_duplicate()
[all …]
H A Davtab.c131 for (prev = NULL, cur = h->htable[hvalue]; cur; in avtab_insert()
132 prev = cur, cur = cur->next) { in avtab_insert()
164 for (prev = NULL, cur = h->htable[hvalue]; cur; in avtab_insert_nonunique()
165 prev = cur, cur = cur->next) { in avtab_insert_nonunique()
188 for (cur = h->htable[hvalue]; cur; cur = cur->next) { in avtab_search_node()
191 return cur; in avtab_search_node()
209 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
231 cur = cur->next; in avtab_destroy()
303 if (cur) { in avtab_hash_eval()
308 cur = cur->next; in avtab_hash_eval()
[all …]
/linux-6.15/tools/testing/selftests/filesystems/statmount/
H A Dlistmount_test.c36 for (size_t cur = 0; cur < nr_mounts; cur++) { in TEST() local
37 if (cur < nr_mounts - 1) in TEST()
38 ASSERT_LT(list[cur], list[cur + 1]); in TEST()
39 last_mnt_id = list[cur]; in TEST()
58 for (size_t cur = 0; cur < nr_mounts; cur++) { in TEST() local
59 if (cur < nr_mounts - 1) in TEST()
60 ASSERT_GT(list[cur], list[cur + 1]); in TEST()
61 last_mnt_id = list[cur]; in TEST()
/linux-6.15/arch/mips/cavium-octeon/
H A Dcsrc-octeon.c146 u64 cur, end, inc; in __udelay() local
151 end = cur + inc; in __udelay()
153 while (end > cur) in __udelay()
160 u64 cur, end, inc; in __ndelay() local
165 end = cur + inc; in __ndelay()
167 while (end > cur) in __ndelay()
174 u64 cur, end; in __delay() local
179 while (end > cur) in __delay()
195 u64 cur, end; in octeon_io_clk_delay() local
207 end = cur + end; in octeon_io_clk_delay()
[all …]
/linux-6.15/drivers/mtd/nand/
H A Decc-sw-hamming.c121 u32 cur; in ecc_sw_hamming_calculate() local
154 rp4 ^= cur; in ecc_sw_hamming_calculate()
160 rp4 ^= cur; in ecc_sw_hamming_calculate()
167 rp4 ^= cur; in ecc_sw_hamming_calculate()
168 rp6 ^= cur; in ecc_sw_hamming_calculate()
171 rp6 ^= cur; in ecc_sw_hamming_calculate()
174 rp4 ^= cur; in ecc_sw_hamming_calculate()
181 rp4 ^= cur; in ecc_sw_hamming_calculate()
182 rp6 ^= cur; in ecc_sw_hamming_calculate()
183 rp8 ^= cur; in ecc_sw_hamming_calculate()
[all …]
/linux-6.15/arch/arm/boot/dts/ti/omap/
H A Domap3-echo.dts158 led-cur = /bits/ 8 <12>;
159 max-cur = /bits/ 8 <15>;
165 led-cur = /bits/ 8 <12>;
166 max-cur = /bits/ 8 <15>;
172 led-cur = /bits/ 8 <12>;
173 max-cur = /bits/ 8 <15>;
185 led-cur = /bits/ 8 <12>;
186 max-cur = /bits/ 8 <15>;
192 led-cur = /bits/ 8 <12>;
193 max-cur = /bits/ 8 <15>;
[all …]

12345678910>>...34