| /Linux-v5.15/fs/xfs/libxfs/ |
| D | xfs_btree.c | 60 struct xfs_btree_cur *cur, in __xfs_btree_check_lblock() argument
65 struct xfs_mount *mp = cur->bc_mp; in __xfs_btree_check_lblock()
66 xfs_btnum_t btnum = cur->bc_btnum; in __xfs_btree_check_lblock()
84 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
87 !xfs_btree_check_lptr(cur, be64_to_cpu(block->bb_u.l.bb_leftsib), in __xfs_btree_check_lblock()
91 !xfs_btree_check_lptr(cur, be64_to_cpu(block->bb_u.l.bb_rightsib), in __xfs_btree_check_lblock()
101 struct xfs_btree_cur *cur, in xfs_btree_check_lblock() argument
106 struct xfs_mount *mp = cur->bc_mp; in xfs_btree_check_lblock()
109 fa = __xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_lblock()
125 struct xfs_btree_cur *cur, in __xfs_btree_check_sblock() argument
[all …]
|
| D | xfs_btree_staging.c | 47 struct xfs_btree_cur *cur) in xfs_btree_fakeroot_dup_cursor() argument
62 struct xfs_btree_cur *cur, in xfs_btree_fakeroot_alloc_block() argument
77 struct xfs_btree_cur *cur, in xfs_btree_fakeroot_free_block() argument
87 struct xfs_btree_cur *cur, in xfs_btree_fakeroot_init_ptr_from_cur() argument
92 ASSERT(cur->bc_flags & XFS_BTREE_STAGING); in xfs_btree_fakeroot_init_ptr_from_cur()
94 afake = cur->bc_ag.afake; in xfs_btree_fakeroot_init_ptr_from_cur()
115 struct xfs_btree_cur *cur, in xfs_btree_afakeroot_set_root() argument
119 struct xbtree_afakeroot *afake = cur->bc_ag.afake; in xfs_btree_afakeroot_set_root()
121 ASSERT(cur->bc_flags & XFS_BTREE_STAGING); in xfs_btree_afakeroot_set_root()
133 struct xfs_btree_cur *cur, in xfs_btree_stage_afakeroot() argument
[all …]
|
| D | xfs_refcount.c | 46 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument
50 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, bno, in xfs_refcount_lookup_le()
52 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_le()
53 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_le()
54 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_refcount_lookup_le()
63 struct xfs_btree_cur *cur, in xfs_refcount_lookup_ge() argument
67 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, bno, in xfs_refcount_lookup_ge()
69 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_ge()
70 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_ge()
71 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); in xfs_refcount_lookup_ge()
[all …]
|
| D | xfs_alloc_btree.c | 26 struct xfs_btree_cur *cur) in xfs_allocbt_dup_cursor() argument
28 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_allocbt_dup_cursor()
29 cur->bc_ag.agbp, cur->bc_ag.pag, cur->bc_btnum); in xfs_allocbt_dup_cursor()
34 struct xfs_btree_cur *cur, in xfs_allocbt_set_root() argument
38 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_allocbt_set_root()
40 int btnum = cur->bc_btnum; in xfs_allocbt_set_root()
46 cur->bc_ag.pag->pagf_levels[btnum] += inc; in xfs_allocbt_set_root()
48 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); in xfs_allocbt_set_root()
53 struct xfs_btree_cur *cur, in xfs_allocbt_alloc_block() argument
62 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_ag.agbp, in xfs_allocbt_alloc_block()
[all …]
|
| D | xfs_ialloc_btree.c | 27 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument
30 return M_IGEO(cur->bc_mp)->inobt_mnr[level != 0]; in xfs_inobt_get_minrecs()
35 struct xfs_btree_cur *cur) in xfs_inobt_dup_cursor() argument
37 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_inobt_dup_cursor()
38 cur->bc_ag.agbp, cur->bc_ag.pag, cur->bc_btnum); in xfs_inobt_dup_cursor()
43 struct xfs_btree_cur *cur, in xfs_inobt_set_root() argument
47 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_inobt_set_root()
52 xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL); in xfs_inobt_set_root()
57 struct xfs_btree_cur *cur, in xfs_finobt_set_root() argument
61 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_finobt_set_root()
[all …]
|
| D | xfs_iext_tree.c | 140 static inline struct xfs_iext_rec *cur_rec(struct xfs_iext_cursor *cur) in cur_rec() argument
142 return &cur->leaf->recs[cur->pos]; in cur_rec()
146 struct xfs_iext_cursor *cur) in xfs_iext_valid() argument
148 if (!cur->leaf) in xfs_iext_valid()
150 if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp)) in xfs_iext_valid()
152 if (xfs_iext_rec_is_empty(cur_rec(cur))) in xfs_iext_valid()
199 struct xfs_iext_cursor *cur) in xfs_iext_first() argument
201 cur->pos = 0; in xfs_iext_first()
202 cur->leaf = xfs_iext_find_first_leaf(ifp); in xfs_iext_first()
208 struct xfs_iext_cursor *cur) in xfs_iext_last() argument
[all …]
|
| D | xfs_refcount_btree.c | 26 struct xfs_btree_cur *cur) in xfs_refcountbt_dup_cursor() argument
28 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_refcountbt_dup_cursor()
29 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_refcountbt_dup_cursor()
34 struct xfs_btree_cur *cur, in xfs_refcountbt_set_root() argument
38 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_refcountbt_set_root()
48 xfs_alloc_log_agf(cur->bc_tp, agbp, in xfs_refcountbt_set_root()
54 struct xfs_btree_cur *cur, in xfs_refcountbt_alloc_block() argument
59 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_refcountbt_alloc_block()
65 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block()
66 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block()
[all …]
|
| D | xfs_btree.h | 90 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
91 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat)
92 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ argument
93 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val)
108 void (*set_root)(struct xfs_btree_cur *cur,
112 int (*alloc_block)(struct xfs_btree_cur *cur,
116 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
119 void (*update_lastrec)(struct xfs_btree_cur *cur,
125 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
126 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
[all …]
|
| D | xfs_bmap_btree.c | 164 struct xfs_btree_cur *cur) in xfs_bmbt_dup_cursor() argument
168 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_bmbt_dup_cursor()
169 cur->bc_ino.ip, cur->bc_ino.whichfork); in xfs_bmbt_dup_cursor()
175 new->bc_ino.flags = cur->bc_ino.flags; in xfs_bmbt_dup_cursor()
196 struct xfs_btree_cur *cur, in xfs_bmbt_alloc_block() argument
205 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block()
206 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block()
207 args.fsbno = cur->bc_tp->t_firstblock; in xfs_bmbt_alloc_block()
208 xfs_rmap_ino_bmbt_owner(&args.oinfo, cur->bc_ino.ip->i_ino, in xfs_bmbt_alloc_block()
209 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block()
[all …]
|
| D | xfs_rmap_btree.c | 52 struct xfs_btree_cur *cur) in xfs_rmapbt_dup_cursor() argument
54 return xfs_rmapbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_rmapbt_dup_cursor()
55 cur->bc_ag.agbp, cur->bc_ag.pag); in xfs_rmapbt_dup_cursor()
60 struct xfs_btree_cur *cur, in xfs_rmapbt_set_root() argument
64 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_rmapbt_set_root()
66 int btnum = cur->bc_btnum; in xfs_rmapbt_set_root()
72 cur->bc_ag.pag->pagf_levels[btnum] += inc; in xfs_rmapbt_set_root()
74 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); in xfs_rmapbt_set_root()
79 struct xfs_btree_cur *cur, in xfs_rmapbt_alloc_block() argument
84 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_rmapbt_alloc_block()
[all …]
|
| D | xfs_rmap.c | 33 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument
41 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_le()
42 cur->bc_rec.r.rm_blockcount = len; in xfs_rmap_lookup_le()
43 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_le()
44 cur->bc_rec.r.rm_offset = offset; in xfs_rmap_lookup_le()
45 cur->bc_rec.r.rm_flags = flags; in xfs_rmap_lookup_le()
46 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_rmap_lookup_le()
55 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument
63 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_eq()
64 cur->bc_rec.r.rm_blockcount = len; in xfs_rmap_lookup_eq()
[all …]
|
| /Linux-v5.15/fs/xfs/scrub/ |
| D | btree.c | 28 struct xfs_btree_cur *cur, in __xchk_btree_process_error() argument
49 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_process_error()
50 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
53 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
63 struct xfs_btree_cur *cur, in xchk_btree_process_error() argument
67 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
74 struct xfs_btree_cur *cur, in xchk_btree_xref_process_error() argument
78 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
86 struct xfs_btree_cur *cur, in __xchk_btree_set_corrupt() argument
93 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_set_corrupt()
[all …]
|
| D | trace.c | 21 struct xfs_btree_cur *cur, in xchk_btree_cur_fsbno() argument
24 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()
25 return XFS_DADDR_TO_FSB(cur->bc_mp, in xchk_btree_cur_fsbno()
26 xfs_buf_daddr(cur->bc_bufs[level])); in xchk_btree_cur_fsbno()
27 if (level == cur->bc_nlevels - 1 && cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_cur_fsbno()
28 return XFS_INO_TO_FSB(cur->bc_mp, cur->bc_ino.ip->i_ino); in xchk_btree_cur_fsbno()
29 if (!(cur->bc_flags & XFS_BTREE_LONG_PTRS)) in xchk_btree_cur_fsbno()
30 return XFS_AGB_TO_FSB(cur->bc_mp, cur->bc_ag.pag->pag_agno, 0); in xchk_btree_cur_fsbno()
|
| /Linux-v5.15/security/selinux/ss/ |
| D | avtab.c | 70 struct avtab_node *prev, struct avtab_node *cur, in avtab_insert_node() argument
110 struct avtab_node *prev, *cur, *newnode; in avtab_insert() local
117 for (prev = NULL, cur = h->htable[hvalue]; in avtab_insert()
118 cur; in avtab_insert()
119 prev = cur, cur = cur->next) { in avtab_insert()
120 if (key->source_type == cur->key.source_type && in avtab_insert()
121 key->target_type == cur->key.target_type && in avtab_insert()
122 key->target_class == cur->key.target_class && in avtab_insert()
123 (specified & cur->key.specified)) { in avtab_insert()
129 if (key->source_type < cur->key.source_type) in avtab_insert()
[all …]
|
| D | hashtab.c | 62 struct hashtab_node *cur, *temp; in hashtab_destroy() local
65 cur = h->htable[i]; in hashtab_destroy()
66 while (cur) { in hashtab_destroy()
67 temp = cur; in hashtab_destroy()
68 cur = cur->next; in hashtab_destroy()
84 struct hashtab_node *cur; in hashtab_map() local
87 cur = h->htable[i]; in hashtab_map()
88 while (cur) { in hashtab_map()
89 ret = apply(cur->key, cur->datum, args); in hashtab_map()
92 cur = cur->next; in hashtab_map()
[all …]
|
| /Linux-v5.15/drivers/char/ |
| D | bsr.c | 154 struct bsr_dev *cur, *n; in bsr_cleanup_devs() local
156 list_for_each_entry_safe(cur, n, &bsr_devs, bsr_list) { in bsr_cleanup_devs()
157 if (cur->bsr_device) { in bsr_cleanup_devs()
158 cdev_del(&cur->bsr_cdev); in bsr_cleanup_devs()
159 device_del(cur->bsr_device); in bsr_cleanup_devs()
161 list_del(&cur->bsr_list); in bsr_cleanup_devs()
162 kfree(cur); in bsr_cleanup_devs()
186 struct bsr_dev *cur = kzalloc(sizeof(struct bsr_dev), in bsr_add_node() local
191 if (!cur) { in bsr_add_node()
200 kfree(cur); in bsr_add_node()
[all …]
|
| /Linux-v5.15/drivers/gpu/drm/amd/amdgpu/ |
| D | amdgpu_res_cursor.h | 53 struct amdgpu_res_cursor *cur) in amdgpu_res_first() argument
58 cur->start = start; in amdgpu_res_first()
59 cur->size = size; in amdgpu_res_first()
60 cur->remaining = size; in amdgpu_res_first()
61 cur->node = NULL; in amdgpu_res_first()
72 cur->start = (node->start << PAGE_SHIFT) + start; in amdgpu_res_first()
73 cur->size = min((node->size << PAGE_SHIFT) - start, size); in amdgpu_res_first()
74 cur->remaining = size; in amdgpu_res_first()
75 cur->node = node; in amdgpu_res_first()
86 static inline void amdgpu_res_next(struct amdgpu_res_cursor *cur, uint64_t size) in amdgpu_res_next() argument
[all …]
|
| /Linux-v5.15/include/linux/ |
| D | iversion.h | 126 u64 cur, old; in inode_set_max_iversion_raw() local
128 cur = inode_peek_iversion_raw(inode); in inode_set_max_iversion_raw()
130 if (cur > val) in inode_set_max_iversion_raw()
132 old = atomic64_cmpxchg(&inode->i_version, cur, val); in inode_set_max_iversion_raw()
133 if (likely(old == cur)) in inode_set_max_iversion_raw()
135 cur = old; in inode_set_max_iversion_raw()
200 u64 cur, old, new; in inode_maybe_inc_iversion() local
213 cur = inode_peek_iversion_raw(inode); in inode_maybe_inc_iversion()
216 if (!force && !(cur & I_VERSION_QUERIED)) in inode_maybe_inc_iversion()
220 new = (cur & ~I_VERSION_QUERIED) + I_VERSION_INCREMENT; in inode_maybe_inc_iversion()
[all …]
|
| /Linux-v5.15/drivers/block/drbd/ |
| D | drbd_vli.h | 199 static inline void bitstream_cursor_reset(struct bitstream_cursor *cur, void *s) in bitstream_cursor_reset() argument
201 cur->b = s; in bitstream_cursor_reset()
202 cur->bit = 0; in bitstream_cursor_reset()
207 static inline void bitstream_cursor_advance(struct bitstream_cursor *cur, unsigned int bits) in bitstream_cursor_advance() argument
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
231 bitstream_cursor_reset(&bs->cur, bs->buf); in bitstream_init()
236 bitstream_cursor_reset(&bs->cur, bs->buf); in bitstream_rewind()
[all …]
|
| /Linux-v5.15/lib/zstd/ |
| D | zstd_opt.h | 440 U32 cur, match_num, last_pos, litlen, price; in ZSTD_compressBlock_opt_generic() local
457 cur = 0; in ZSTD_compressBlock_opt_generic()
482 cur = 0; in ZSTD_compressBlock_opt_generic()
515 for (cur = 1; cur <= last_pos; cur++) { in ZSTD_compressBlock_opt_generic()
516 inr = ip + cur; in ZSTD_compressBlock_opt_generic()
518 if (opt[cur - 1].mlen == 1) { in ZSTD_compressBlock_opt_generic()
519 litlen = opt[cur - 1].litlen + 1; in ZSTD_compressBlock_opt_generic()
520 if (cur > litlen) { in ZSTD_compressBlock_opt_generic()
521 price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen); in ZSTD_compressBlock_opt_generic()
526 price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1); in ZSTD_compressBlock_opt_generic()
[all …]
|
| /Linux-v5.15/kernel/ |
| D | crash_core.c | 44 char *cur = cmdline, *tmp; in parse_crashkernel_mem() local
51 start = memparse(cur, &tmp); in parse_crashkernel_mem()
52 if (cur == tmp) { in parse_crashkernel_mem()
56 cur = tmp; in parse_crashkernel_mem()
57 if (*cur != '-') { in parse_crashkernel_mem()
61 cur++; in parse_crashkernel_mem()
64 if (*cur != ':') { in parse_crashkernel_mem()
65 end = memparse(cur, &tmp); in parse_crashkernel_mem()
66 if (cur == tmp) { in parse_crashkernel_mem()
70 cur = tmp; in parse_crashkernel_mem()
[all …]
|
| /Linux-v5.15/arch/mips/cavium-octeon/ |
| D | csrc-octeon.c | 146 u64 cur, end, inc; in __udelay() local
148 cur = read_c0_cvmcount(); in __udelay()
151 end = cur + inc; in __udelay()
153 while (end > cur) in __udelay()
154 cur = read_c0_cvmcount(); in __udelay()
160 u64 cur, end, inc; in __ndelay() local
162 cur = read_c0_cvmcount(); in __ndelay()
165 end = cur + inc; in __ndelay()
167 while (end > cur) in __ndelay()
168 cur = read_c0_cvmcount(); in __ndelay()
[all …]
|
| /Linux-v5.15/drivers/mtd/nand/ |
| D | ecc-sw-hamming.c | 121 u32 cur; in ecc_sw_hamming_calculate() local
152 cur = *bp++; in ecc_sw_hamming_calculate()
153 tmppar = cur; in ecc_sw_hamming_calculate()
154 rp4 ^= cur; in ecc_sw_hamming_calculate()
155 cur = *bp++; in ecc_sw_hamming_calculate()
156 tmppar ^= cur; in ecc_sw_hamming_calculate()
158 cur = *bp++; in ecc_sw_hamming_calculate()
159 tmppar ^= cur; in ecc_sw_hamming_calculate()
160 rp4 ^= cur; in ecc_sw_hamming_calculate()
161 cur = *bp++; in ecc_sw_hamming_calculate()
[all …]
|
| /Linux-v5.15/arch/arm/boot/dts/ |
| D | omap3-echo.dts | 158 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-v5.15/tools/lib/bpf/ |
| D | hashmap.h | 155 #define hashmap__for_each_entry(map, cur, bkt) \ argument
157 for (cur = map->buckets[bkt]; cur; cur = cur->next)
167 #define hashmap__for_each_entry_safe(map, cur, tmp, bkt) \ argument
169 for (cur = map->buckets[bkt]; \
170 cur && ({tmp = cur->next; true; }); \
171 cur = tmp)
179 #define hashmap__for_each_key_entry(map, cur, _key) \ argument
180 for (cur = map->buckets \
183 cur; \
184 cur = cur->next) \
[all …]
|
