Home
last modified time | relevance | path

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

12345678910>>...30

/linux-6.3-rc2/fs/xfs/libxfs/
A Dxfs_btree.c150 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
216 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock()
309 cur->bc_ino.whichfork, cur->bc_btnum, in xfs_btree_check_ptr()
413 error = cur->bc_ops->free_block(cur, bp); in xfs_btree_free_block()
457 kmem_cache_free(cur->bc_cache, cur); in xfs_btree_del_cursor()
482 new = cur->bc_ops->dup_cursor(cur); in xfs_btree_dup_cursor()
657 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset()
2409 ASSERT(cur->bc_ops->keys_inorder(cur, in xfs_btree_lshift()
2421 ASSERT(cur->bc_ops->recs_inorder(cur, in xfs_btree_lshift()
2949 args.cur = cur; in xfs_btree_split()
[all …]
A Dxfs_btree_staging.c454 cur->bc_ops->init_rec_from_cur(cur, block_rec); in xfs_btree_bload_leaf()
522 return cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_max_npb()
524 ret = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_max_npb()
573 maxnr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_level_geometry()
623 maxr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_ensure_slack()
624 minr = cur->bc_ops->get_minrecs(cur, level); in xfs_btree_bload_ensure_slack()
660 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()
665 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()
706 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()
722 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()
[all …]
A Dxfs_refcount.c48 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument
53 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_le()
73 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_ge()
93 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_eq()
182 trace_xfs_refcount_update(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_update()
210 trace_xfs_refcount_insert(cur->bc_mp, cur->bc_ag.pag->pag_agno, irec); in xfs_refcount_insert()
254 trace_xfs_refcount_delete(cur->bc_mp, cur->bc_ag.pag->pag_agno, &irec); in xfs_refcount_delete()
390 trace_xfs_refcount_split_extent(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_split_extent()
712 trace_xfs_refcount_find_left_extent(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_find_left_extents()
1268 trace_xfs_refcount_adjust_error(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_adjust()
[all …]
A Dxfs_alloc_btree.c27 struct xfs_btree_cur *cur) in xfs_allocbt_dup_cursor() argument
29 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_allocbt_dup_cursor()
30 cur->bc_ag.agbp, cur->bc_ag.pag, cur->bc_btnum); in xfs_allocbt_dup_cursor()
63 error = xfs_alloc_get_freelist(cur->bc_ag.pag, cur->bc_tp, in xfs_allocbt_alloc_block()
74 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_ag.pag, bno, 1, false); in xfs_allocbt_alloc_block()
92 error = xfs_alloc_put_freelist(cur->bc_ag.pag, cur->bc_tp, agbp, NULL, in xfs_allocbt_free_block()
161 xfs_alloc_log_agf(cur->bc_tp, cur->bc_ag.agbp, XFS_AGF_LONGEST); in xfs_allocbt_update_lastrec()
497 cur->bc_ag.pag = pag; in xfs_allocbt_init_common()
502 return cur; in xfs_allocbt_init_common()
527 return cur; in xfs_allocbt_init_cursor()
[all …]
A Dxfs_ialloc_btree.c29 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument
37 struct xfs_btree_cur *cur) in xfs_inobt_dup_cursor() argument
39 return xfs_inobt_init_cursor(cur->bc_ag.pag, cur->bc_tp, in xfs_inobt_dup_cursor()
40 cur->bc_ag.agbp, cur->bc_btnum); in xfs_inobt_dup_cursor()
104 args.tp = cur->bc_tp; in __xfs_inobt_alloc_block()
105 args.mp = cur->bc_mp; in __xfs_inobt_alloc_block()
452 cur->bc_ag.pag = pag; in xfs_inobt_init_common()
453 return cur; in xfs_inobt_init_common()
473 return cur; in xfs_inobt_init_cursor()
487 return cur; in xfs_inobt_stage_cursor()
[all …]
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()
661 cur->leaf->recs[i] = cur->leaf->recs[i - 1]; in xfs_iext_insert()
934 for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) { in xfs_iext_lookup_extent()
[all …]
A Dxfs_btree.h88 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
89 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat)
91 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val)
552 struct xfs_btree_cur *cur, in xfs_btree_islastblock() argument
590 struct xfs_btree_cur *cur; in xfs_btree_alloc_cursor() local
593 cur->bc_tp = tp; in xfs_btree_alloc_cursor()
594 cur->bc_mp = mp; in xfs_btree_alloc_cursor()
595 cur->bc_btnum = btnum; in xfs_btree_alloc_cursor()
596 cur->bc_maxlevels = maxlevels; in xfs_btree_alloc_cursor()
597 cur->bc_cache = cache; in xfs_btree_alloc_cursor()
[all …]
A Dxfs_refcount_btree.c29 struct xfs_btree_cur *cur) in xfs_refcountbt_dup_cursor() argument
31 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_refcountbt_dup_cursor()
32 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_refcountbt_dup_cursor()
68 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block()
69 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block()
80 trace_xfs_refcountbt_alloc_block(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcountbt_alloc_block()
111 trace_xfs_refcountbt_free_block(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcountbt_free_block()
344 cur->bc_ag.pag = pag; in xfs_refcountbt_init_common()
349 return cur; in xfs_refcountbt_init_common()
366 return cur; in xfs_refcountbt_init_cursor()
[all …]
A Dxfs_bmap_btree.c167 struct xfs_btree_cur *cur) in xfs_bmbt_dup_cursor() argument
171 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_bmbt_dup_cursor()
172 cur->bc_ino.ip, cur->bc_ino.whichfork); in xfs_bmbt_dup_cursor()
208 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block()
209 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block()
211 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block()
224 args.minleft = xfs_bmapi_minleft(cur->bc_tp, cur->bc_ino.ip, in xfs_bmbt_alloc_block()
249 cur->bc_ino.allocated++; in xfs_bmbt_alloc_block()
550 cur->bc_ino.ip = ip; in xfs_bmbt_init_cursor()
552 cur->bc_ino.flags = 0; in xfs_bmbt_init_cursor()
[all …]
A Dxfs_rmap_btree.c54 struct xfs_btree_cur *cur) in xfs_rmapbt_dup_cursor() argument
56 return xfs_rmapbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_rmapbt_dup_cursor()
57 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_rmapbt_dup_cursor()
62 struct xfs_btree_cur *cur, in xfs_rmapbt_set_root() argument
93 error = xfs_alloc_get_freelist(pag, cur->bc_tp, cur->bc_ag.agbp, in xfs_rmapbt_alloc_block()
118 struct xfs_btree_cur *cur, in xfs_rmapbt_free_block() argument
465 cur->bc_ag.pag = pag; in xfs_rmapbt_init_common()
467 return cur; in xfs_rmapbt_init_common()
483 cur->bc_ag.agbp = agbp; in xfs_rmapbt_init_cursor()
484 return cur; in xfs_rmapbt_init_cursor()
[all …]
A Dxfs_rmap.c35 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument
71 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument
94 struct xfs_btree_cur *cur, in xfs_rmap_update() argument
100 trace_xfs_rmap_update(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_rmap_update()
213 struct xfs_btree_cur *cur, in xfs_rmap_get_rec() argument
297 struct xfs_btree_cur *cur, in xfs_rmap_find_left_neighbor() argument
398 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le_range() argument
421 trace_xfs_rmap_lookup_le_range(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_rmap_lookup_le_range()
1366 cur->bc_rec.r = NEW; in xfs_rmap_convert()
1423 cur->bc_rec.r = NEW; in xfs_rmap_convert()
[all …]
/linux-6.3-rc2/fs/xfs/scrub/
A Dbtree.c129 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec() local
156 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec()
178 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key() local
202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key()
252 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling() local
313 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings() local
410 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner() local
483 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs() local
586 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys() local
657 bs->cur = cur; in xchk_btree()
[all …]
/linux-6.3-rc2/drivers/gpu/drm/amd/amdgpu/
A Damdgpu_res_cursor.h90 cur->node = block; in amdgpu_res_first()
100 cur->node = node; in amdgpu_res_first()
109 cur->start = start; in amdgpu_res_first()
110 cur->size = size; in amdgpu_res_first()
112 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()
155 node = cur->node; in amdgpu_res_next()
[all …]
/linux-6.3-rc2/security/selinux/ss/
A Davtab.c119 prev = cur, cur = cur->next) { in avtab_insert()
164 prev = cur, cur = cur->next) { in avtab_insert_nonunique()
193 for (cur = h->htable[hvalue]; cur; in avtab_search()
194 cur = cur->next) { in avtab_search()
229 for (cur = h->htable[hvalue]; cur; in avtab_search_node()
230 cur = cur->next) { in avtab_search_node()
259 for (cur = node->next; cur; cur = cur->next) { in avtab_search_node_next()
291 cur = cur->next; in avtab_destroy()
373 cur = cur->next; in avtab_hash_eval()
660 for (cur = a->htable[i]; cur; in avtab_write()
[all …]
A Dhashtab.c74 while (cur) { in hashtab_destroy()
75 temp = cur; in hashtab_destroy()
76 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()
116 if (cur) { in hashtab_stat()
121 cur = cur->next; in hashtab_stat()
152 for (cur = orig->htable[i]; cur; cur = cur->next) { in hashtab_duplicate()
176 for (cur = new->htable[i]; cur; cur = tmp) { in hashtab_duplicate()
[all …]
/linux-6.3-rc2/drivers/char/
A Dbsr.c162 kfree(cur); in bsr_cleanup_devs()
191 if (!cur) { in bsr_add_node()
200 kfree(cur); in bsr_add_node()
213 if (cur->bsr_len > 4096 && cur->bsr_len < PAGE_SIZE) in bsr_add_node()
236 cur->bsr_num = bsr_types[cur->bsr_type]; in bsr_add_node()
238 cur->bsr_bytes, cur->bsr_num); in bsr_add_node()
241 result = cdev_add(&cur->bsr_cdev, cur->bsr_dev, 1); in bsr_add_node()
243 kfree(cur); in bsr_add_node()
248 cur, "%s", cur->bsr_name); in bsr_add_node()
253 kfree(cur); in bsr_add_node()
[all …]
/linux-6.3-rc2/drivers/block/drbd/
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.3-rc2/kernel/
A Dcrash_core.c69 cur = tmp; in parse_crashkernel_mem()
74 cur++; in parse_crashkernel_mem()
83 cur = tmp; in parse_crashkernel_mem()
94 cur++; in parse_crashkernel_mem()
101 cur = tmp; in parse_crashkernel_mem()
115 while (*cur && *cur != ' ' && *cur != '@') in parse_crashkernel_mem()
116 cur++; in parse_crashkernel_mem()
118 cur++; in parse_crashkernel_mem()
151 *crash_base = memparse(cur+1, &cur); in parse_crashkernel_simple()
152 else if (*cur != ' ' && *cur != '\0') { in parse_crashkernel_simple()
[all …]
/linux-6.3-rc2/arch/mips/cavium-octeon/
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.3-rc2/drivers/mtd/nand/
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.3-rc2/arch/arm/boot/dts/
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 …]
/linux-6.3-rc2/tools/power/cpupower/
A Dcpupower-completion.sh11 local cur="${COMP_WORDS[COMP_CWORD]}"
21 local cur="${COMP_WORDS[COMP_CWORD]}"
39 local cur="${COMP_WORDS[COMP_CWORD]}"
41 idle-info) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
49 local cur="${COMP_WORDS[COMP_CWORD]}"
51 idle-set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
59 local cur="${COMP_WORDS[COMP_CWORD]}"
61 set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
69 local cur="${COMP_WORDS[COMP_CWORD]}"
71 monitor) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
[all …]
/linux-6.3-rc2/Documentation/driver-api/mtd/
A Dnand_ecc.rst554 cur = *bp++; tmppar = cur; rp4 ^= cur;
556 cur = *bp++; tmppar ^= cur; rp4 ^= cur;
559 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur;
560 cur = *bp++; tmppar ^= cur; rp6 ^= cur;
561 cur = *bp++; tmppar ^= cur; rp4 ^= cur;
564 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur; rp8 ^= cur;
565 cur = *bp++; tmppar ^= cur; rp6 ^= cur; rp8 ^= cur;
566 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp8 ^= cur;
567 cur = *bp++; tmppar ^= cur; rp8 ^= cur;
569 cur = *bp++; tmppar ^= cur; rp4 ^= cur; rp6 ^= cur;
[all …]
/linux-6.3-rc2/drivers/video/backlight/
A Dcr_bllcd.c63 u32 cur = inl(addr); in cr_backlight_set_intensity() local
68 outl(cur, addr); in cr_backlight_set_intensity()
72 outl(cur, addr); in cr_backlight_set_intensity()
81 u32 cur = inl(addr); in cr_backlight_get_intensity() local
100 u32 cur = inl(addr); in cr_panel_on() local
106 outl(cur, addr); in cr_panel_on()
110 cur |= CRVML_PANEL_ON; in cr_panel_on()
111 outl(cur, addr); in cr_panel_on()
125 u32 cur = inl(addr); in cr_panel_off() local
129 cur &= ~CRVML_LVDS_ON; in cr_panel_off()
[all …]
/linux-6.3-rc2/tools/perf/util/
A Dhashmap.h180 for (cur = map->buckets[bkt]; cur; cur = cur->next)
192 for (cur = map->buckets[bkt]; \
193 cur && ({tmp = cur->next; true; }); \
194 cur = tmp)
203 for (cur = map->buckets \
206 cur; \
207 cur = cur->next) \
208 if (map->equal_fn(cur->key, (_key), map->ctx))
211 for (cur = map->buckets \
214 cur && ({ tmp = cur->next; true; }); \
[all …]

Completed in 87 milliseconds

12345678910>>...30