Home
last modified time | relevance | path

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

12345678910>>...30

/linux-6.1.9/fs/xfs/libxfs/
Dxfs_btree.c68 struct xfs_btree_cur *cur, in xfs_btree_check_lblock_siblings() argument
82 if (!xfs_btree_check_lptr(cur, sibling, level + 1)) in xfs_btree_check_lblock_siblings()
95 struct xfs_btree_cur *cur, in xfs_btree_check_sblock_siblings() argument
109 if (!xfs_btree_check_sptr(cur, sibling, level + 1)) in xfs_btree_check_sblock_siblings()
124 struct xfs_btree_cur *cur, in __xfs_btree_check_lblock() argument
129 struct xfs_mount *mp = cur->bc_mp; in __xfs_btree_check_lblock()
130 xfs_btnum_t btnum = cur->bc_btnum; in __xfs_btree_check_lblock()
150 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
156 fa = xfs_btree_check_lblock_siblings(mp, cur, level, fsb, in __xfs_btree_check_lblock()
159 fa = xfs_btree_check_lblock_siblings(mp, cur, level, fsb, in __xfs_btree_check_lblock()
[all …]
Dxfs_btree_staging.c47 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 …]
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()
56 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_le()
57 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_le()
58 cur->bc_rec.rc.rc_domain = domain; in xfs_refcount_lookup_le()
59 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_refcount_lookup_le()
68 struct xfs_btree_cur *cur, in xfs_refcount_lookup_ge() argument
73 trace_xfs_refcount_lookup(cur->bc_mp, cur->bc_ag.pag->pag_agno, in xfs_refcount_lookup_ge()
76 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_ge()
77 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_ge()
[all …]
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()
35 struct xfs_btree_cur *cur, in xfs_allocbt_set_root() argument
39 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_allocbt_set_root()
41 int btnum = cur->bc_btnum; in xfs_allocbt_set_root()
47 cur->bc_ag.pag->pagf_levels[btnum] += inc; in xfs_allocbt_set_root()
49 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); in xfs_allocbt_set_root()
54 struct xfs_btree_cur *cur, in xfs_allocbt_alloc_block() argument
63 error = xfs_alloc_get_freelist(cur->bc_ag.pag, cur->bc_tp, in xfs_allocbt_alloc_block()
[all …]
Dxfs_ialloc_btree.c29 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument
32 return M_IGEO(cur->bc_mp)->inobt_mnr[level != 0]; in xfs_inobt_get_minrecs()
37 struct xfs_btree_cur *cur) in xfs_inobt_dup_cursor() argument
39 return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_inobt_dup_cursor()
40 cur->bc_ag.agbp, cur->bc_ag.pag, cur->bc_btnum); in xfs_inobt_dup_cursor()
45 struct xfs_btree_cur *cur, in xfs_inobt_set_root() argument
49 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_inobt_set_root()
54 xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL); in xfs_inobt_set_root()
59 struct xfs_btree_cur *cur, in xfs_finobt_set_root() argument
63 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_finobt_set_root()
[all …]
Dxfs_iext_tree.c140 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 …]
Dxfs_btree.h88 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
89 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat)
90 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ argument
91 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val)
104 void (*set_root)(struct xfs_btree_cur *cur,
108 int (*alloc_block)(struct xfs_btree_cur *cur,
112 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
115 void (*update_lastrec)(struct xfs_btree_cur *cur,
121 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
122 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
[all …]
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()
37 struct xfs_btree_cur *cur, in xfs_refcountbt_set_root() argument
41 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_refcountbt_set_root()
51 xfs_alloc_log_agf(cur->bc_tp, agbp, in xfs_refcountbt_set_root()
57 struct xfs_btree_cur *cur, in xfs_refcountbt_alloc_block() argument
62 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_refcountbt_alloc_block()
68 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block()
69 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block()
[all …]
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
66 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_rmapbt_set_root()
68 int btnum = cur->bc_btnum; in xfs_rmapbt_set_root()
74 cur->bc_ag.pag->pagf_levels[btnum] += inc; in xfs_rmapbt_set_root()
76 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); in xfs_rmapbt_set_root()
81 struct xfs_btree_cur *cur, in xfs_rmapbt_alloc_block() argument
86 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_rmapbt_alloc_block()
[all …]
Dxfs_rmap.c35 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument
46 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_le()
47 cur->bc_rec.r.rm_blockcount = 0; in xfs_rmap_lookup_le()
48 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_le()
49 cur->bc_rec.r.rm_offset = offset; in xfs_rmap_lookup_le()
50 cur->bc_rec.r.rm_flags = flags; in xfs_rmap_lookup_le()
52 error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_rmap_lookup_le()
56 error = xfs_rmap_get_rec(cur, irec, &get_stat); in xfs_rmap_lookup_le()
71 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument
79 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_eq()
[all …]
Dxfs_bmap_btree.c166 struct xfs_btree_cur *cur) in xfs_bmbt_dup_cursor() argument
170 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, in xfs_bmbt_dup_cursor()
171 cur->bc_ino.ip, cur->bc_ino.whichfork); in xfs_bmbt_dup_cursor()
177 new->bc_ino.flags = cur->bc_ino.flags; in xfs_bmbt_dup_cursor()
198 struct xfs_btree_cur *cur, in xfs_bmbt_alloc_block() argument
207 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block()
208 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block()
209 args.fsbno = cur->bc_tp->t_firstblock; in xfs_bmbt_alloc_block()
210 xfs_rmap_ino_bmbt_owner(&args.oinfo, cur->bc_ino.ip->i_ino, in xfs_bmbt_alloc_block()
211 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block()
[all …]
/linux-6.1.9/fs/xfs/scrub/
Dbtree.c28 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 …]
/linux-6.1.9/drivers/gpu/drm/amd/amdgpu/
Damdgpu_res_cursor.h56 struct amdgpu_res_cursor *cur) in amdgpu_res_first() argument
67 cur->mem_type = res->mem_type; in amdgpu_res_first()
69 switch (cur->mem_type) { in amdgpu_res_first()
87 cur->start = amdgpu_vram_mgr_block_start(block) + start; in amdgpu_res_first()
88 cur->size = min(amdgpu_vram_mgr_block_size(block) - start, size); in amdgpu_res_first()
89 cur->remaining = size; in amdgpu_res_first()
90 cur->node = block; in amdgpu_res_first()
97 cur->start = (node->start << PAGE_SHIFT) + start; in amdgpu_res_first()
98 cur->size = min((node->size << PAGE_SHIFT) - start, size); in amdgpu_res_first()
99 cur->remaining = size; in amdgpu_res_first()
[all …]
/linux-6.1.9/security/selinux/ss/
Davtab.c110 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()
131 if (key->source_type == cur->key.source_type && in avtab_insert()
[all …]
Dhashtab.c70 struct hashtab_node *cur, *temp; in hashtab_destroy() local
73 cur = h->htable[i]; in hashtab_destroy()
74 while (cur) { in hashtab_destroy()
75 temp = cur; in hashtab_destroy()
76 cur = cur->next; in hashtab_destroy()
92 struct hashtab_node *cur; in hashtab_map() local
95 cur = h->htable[i]; in hashtab_map()
96 while (cur) { in hashtab_map()
97 ret = apply(cur->key, cur->datum, args); in hashtab_map()
100 cur = cur->next; in hashtab_map()
[all …]
/linux-6.1.9/drivers/char/
Dbsr.c154 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-6.1.9/drivers/block/drbd/
Ddrbd_vli.h199 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-6.1.9/kernel/
Dcrash_core.c48 char *cur = cmdline, *tmp; in parse_crashkernel_mem() local
64 start = memparse(cur, &tmp); in parse_crashkernel_mem()
65 if (cur == tmp) { in parse_crashkernel_mem()
69 cur = tmp; in parse_crashkernel_mem()
70 if (*cur != '-') { in parse_crashkernel_mem()
74 cur++; in parse_crashkernel_mem()
77 if (*cur != ':') { in parse_crashkernel_mem()
78 end = memparse(cur, &tmp); in parse_crashkernel_mem()
79 if (cur == tmp) { in parse_crashkernel_mem()
83 cur = tmp; in parse_crashkernel_mem()
[all …]
/linux-6.1.9/arch/mips/cavium-octeon/
Dcsrc-octeon.c146 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-6.1.9/drivers/mtd/nand/
Decc-sw-hamming.c121 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-6.1.9/arch/arm/boot/dts/
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.1.9/tools/lib/bpf/
Dhashmap.h155 #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 …]
/linux-6.1.9/tools/perf/util/
Dhashmap.h155 #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 …]
/linux-6.1.9/tools/power/cpupower/
Dcpupower-completion.sh11 local cur="${COMP_WORDS[COMP_CWORD]}"
13 frequency-info) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
21 local cur="${COMP_WORDS[COMP_CWORD]}"
25 …s -d /sys/devices/system/cpu/cpufreq/policy* | head -1)/scaling_available_frequencies)' -- "$cur"))
29 …(ls -d /sys/devices/system/cpu/cpufreq/policy* | head -1)/scaling_available_governors)' -- "$cur"))
31 frequency-set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
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")) ;;
[all …]
/linux-6.1.9/Documentation/driver-api/mtd/
Dnand_ecc.rst216 unsigned char cur;
229 cur = *bp++;
230 par ^= cur;
231 if (i & 0x01) rp1 ^= cur; else rp0 ^= cur;
232 if (i & 0x02) rp3 ^= cur; else rp2 ^= cur;
233 if (i & 0x04) rp5 ^= cur; else rp4 ^= cur;
234 if (i & 0x08) rp7 ^= cur; else rp6 ^= cur;
235 if (i & 0x10) rp9 ^= cur; else rp8 ^= cur;
236 if (i & 0x20) rp11 ^= cur; else rp10 ^= cur;
237 if (i & 0x40) rp13 ^= cur; else rp12 ^= cur;
[all …]

12345678910>>...30