| /linux/fs/xfs/libxfs/ |
| H A D | xfs_btree.c | 126 struct xfs_btree_cur *cur, in __xfs_btree_check_lblock_hdr() argument
131 struct xfs_mount *mp = cur->bc_mp; in __xfs_btree_check_lblock_hdr()
143 if (be32_to_cpu(block->bb_magic) != xfs_btree_magic(mp, cur->bc_ops)) in __xfs_btree_check_lblock_hdr()
148 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock_hdr()
160 struct xfs_btree_cur *cur, in __xfs_btree_check_fsblock() argument
165 struct xfs_mount *mp = cur->bc_mp; in __xfs_btree_check_fsblock()
169 fa = __xfs_btree_check_lblock_hdr(cur, block, level, bp); in __xfs_btree_check_fsblock()
200 struct xfs_btree_cur *cur, in __xfs_btree_check_memblock() argument
205 struct xfs_buftarg *btp = cur->bc_mem.xfbtree->target; in __xfs_btree_check_memblock()
209 fa = __xfs_btree_check_lblock_hdr(cur, block, level, bp); in __xfs_btree_check_memblock()
[all …]
|
| H A D | xfs_btree_staging.c | 60 struct xfs_btree_cur *cur, in xfs_btree_stage_afakeroot() argument
63 ASSERT(!(cur->bc_flags & XFS_BTREE_STAGING)); in xfs_btree_stage_afakeroot()
64 ASSERT(cur->bc_ops->type != XFS_BTREE_TYPE_INODE); in xfs_btree_stage_afakeroot()
65 ASSERT(cur->bc_tp == NULL); in xfs_btree_stage_afakeroot()
67 cur->bc_ag.afake = afake; in xfs_btree_stage_afakeroot()
68 cur->bc_nlevels = afake->af_levels; in xfs_btree_stage_afakeroot()
69 cur->bc_flags |= XFS_BTREE_STAGING; in xfs_btree_stage_afakeroot()
80 struct xfs_btree_cur *cur, in xfs_btree_commit_afakeroot() argument
84 ASSERT(cur->bc_flags & XFS_BTREE_STAGING); in xfs_btree_commit_afakeroot()
85 ASSERT(cur->bc_tp == NULL); in xfs_btree_commit_afakeroot()
[all …]
|
| H A D | xfs_refcount.c | 53 struct xfs_btree_cur *cur, in xfs_refcount_lookup_le() argument
58 trace_xfs_refcount_lookup(cur, in xfs_refcount_lookup_le()
61 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_le()
62 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_le()
63 cur->bc_rec.rc.rc_domain = domain; in xfs_refcount_lookup_le()
64 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_refcount_lookup_le()
73 struct xfs_btree_cur *cur, in xfs_refcount_lookup_ge() argument
78 trace_xfs_refcount_lookup(cur, in xfs_refcount_lookup_ge()
81 cur->bc_rec.rc.rc_startblock = bno; in xfs_refcount_lookup_ge()
82 cur->bc_rec.rc.rc_blockcount = 0; in xfs_refcount_lookup_ge()
[all …]
|
| H A D | xfs_btree.h | 81 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
82 XFS_STATS_INC_OFF((cur)->bc_mp, \
83 (cur)->bc_ops->statoff + __XBTS_ ## stat)
84 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ argument
85 XFS_STATS_ADD_OFF((cur)->bc_mp, \
86 (cur)->bc_ops->statoff + __XBTS_ ## stat, val)
147 void (*set_root)(struct xfs_btree_cur *cur,
151 int (*alloc_block)(struct xfs_btree_cur *cur,
155 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
158 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
[all …]
|
| H A 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 …]
|
| H A D | xfs_rmap.c | 39 struct xfs_btree_cur *cur, in xfs_rmap_lookup_le() argument
50 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_le()
51 cur->bc_rec.r.rm_blockcount = 0; in xfs_rmap_lookup_le()
52 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_le()
53 cur->bc_rec.r.rm_offset = offset; in xfs_rmap_lookup_le()
54 cur->bc_rec.r.rm_flags = flags; in xfs_rmap_lookup_le()
56 error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat); in xfs_rmap_lookup_le()
60 error = xfs_rmap_get_rec(cur, irec, &get_stat); in xfs_rmap_lookup_le()
64 xfs_btree_mark_sick(cur); in xfs_rmap_lookup_le()
77 struct xfs_btree_cur *cur, in xfs_rmap_lookup_eq() argument
[all …]
|
| H A D | xfs_ialloc_btree.c | 30 struct xfs_btree_cur *cur, in xfs_inobt_get_minrecs() argument
33 return M_IGEO(cur->bc_mp)->inobt_mnr[level != 0]; in xfs_inobt_get_minrecs()
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()
54 struct xfs_btree_cur *cur, in xfs_inobt_set_root() argument
58 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_inobt_set_root()
[all …]
|
| H A D | xfs_alloc_btree.c | 28 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
48 struct xfs_perag *pag = to_perag(cur->bc_group); in xfs_allocbt_set_root()
49 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_allocbt_set_root()
54 if (xfs_btree_is_bno(cur->bc_ops)) { in xfs_allocbt_set_root()
[all …]
|
| H A D | xfs_bmap_btree.c | 182 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()
188 new->bc_flags |= (cur->bc_flags & in xfs_bmbt_dup_cursor()
209 struct xfs_btree_cur *cur, in xfs_bmbt_alloc_block() argument
218 args.tp = cur->bc_tp; in xfs_bmbt_alloc_block()
219 args.mp = cur->bc_mp; in xfs_bmbt_alloc_block()
220 xfs_rmap_ino_bmbt_owner(&args.oinfo, cur->bc_ino.ip->i_ino, in xfs_bmbt_alloc_block()
221 cur->bc_ino.whichfork); in xfs_bmbt_alloc_block()
223 args.wasdel = cur->bc_flags & XFS_BTREE_BMBT_WASDEL; in xfs_bmbt_alloc_block()
[all …]
|
| H A D | xfs_btree_mem.c | 26 struct xfs_btree_cur *cur, in xfbtree_set_root() argument
30 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_set_root()
32 cur->bc_mem.xfbtree->root = *ptr; in xfbtree_set_root()
33 cur->bc_mem.xfbtree->nlevels += inc; in xfbtree_set_root()
39 struct xfs_btree_cur *cur, in xfbtree_init_ptr_from_cur() argument
42 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_init_ptr_from_cur()
44 *ptr = cur->bc_mem.xfbtree->root; in xfbtree_init_ptr_from_cur()
50 struct xfs_btree_cur *cur) in xfbtree_dup_cursor() argument
54 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_dup_cursor()
56 ncur = xfs_btree_alloc_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ops, in xfbtree_dup_cursor()
[all …]
|
| H A D | xfs_refcount_btree.c | 30 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
42 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_refcountbt_set_root()
52 xfs_alloc_log_agf(cur->bc_tp, agbp, in xfs_refcountbt_set_root()
58 struct xfs_btree_cur *cur, in xfs_refcountbt_alloc_block() argument
63 struct xfs_buf *agbp = cur->bc_ag.agbp; in xfs_refcountbt_alloc_block()
69 args.tp = cur->bc_tp; in xfs_refcountbt_alloc_block()
70 args.mp = cur->bc_mp; in xfs_refcountbt_alloc_block()
[all …]
|
| /linux/drivers/gpu/drm/xe/ |
| H A D | xe_res_cursor.h | 92 struct xe_res_cursor *cur) in xe_res_first() argument
94 cur->sgl = NULL; in xe_res_first()
95 cur->dma_addr = NULL; in xe_res_first()
101 cur->mem_type = res->mem_type; in xe_res_first()
103 switch (cur->mem_type) { in xe_res_first()
128 cur->mm = mm; in xe_res_first()
129 cur->start = drm_buddy_block_offset(block) + start; in xe_res_first()
130 cur->size = min(drm_buddy_block_size(mm, block) - start, in xe_res_first()
132 cur->remaining = size; in xe_res_first()
133 cur->node = block; in xe_res_first()
[all …]
|
| /linux/fs/xfs/scrub/ |
| H A D | btree.c | 28 struct xfs_btree_cur *cur, in __xchk_btree_process_error() argument
50 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) in __xchk_btree_process_error()
51 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
54 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
64 struct xfs_btree_cur *cur, in xchk_btree_process_error() argument
68 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
75 struct xfs_btree_cur *cur, in xchk_btree_xref_process_error() argument
79 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
87 struct xfs_btree_cur *cur, in __xchk_btree_set_corrupt() argument
94 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) in __xchk_btree_set_corrupt()
[all …]
|
| H A D | rcbag.c | 78 struct xfs_btree_cur *cur; in rcbag_add() local
82 cur = rcbagbt_mem_cursor(mp, tp, &bag->xfbtree); in rcbag_add()
83 error = rcbagbt_lookup_eq(cur, rmap, &has); in rcbag_add()
88 error = rcbagbt_get_rec(cur, &bagrec, &has); in rcbag_add()
97 error = rcbagbt_update(cur, &bagrec); in rcbag_add()
105 error = rcbagbt_insert(cur, &bagrec, &has); in rcbag_add()
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
164 cur = rcbagbt_mem_cursor(mp, tp, &bag->xfbtree); in rcbag_next_edge()
[all …]
|
| /linux/drivers/gpu/drm/amd/amdgpu/ |
| H A D | amdgpu_res_cursor.h | 56 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()
99 cur->start = (node->start << PAGE_SHIFT) + start; in amdgpu_res_first()
100 cur->size = min((node->size << PAGE_SHIFT) - start, size); in amdgpu_res_first()
101 cur->remaining = size; in amdgpu_res_first()
[all …]
|
| /linux/drivers/char/ |
| H A D | bsr.c | 157 struct bsr_dev *cur, *n; in bsr_cleanup_devs() local
159 list_for_each_entry_safe(cur, n, &bsr_devs, bsr_list) { in bsr_cleanup_devs()
160 if (cur->bsr_device) { in bsr_cleanup_devs()
161 cdev_del(&cur->bsr_cdev); in bsr_cleanup_devs()
162 device_del(cur->bsr_device); in bsr_cleanup_devs()
164 list_del(&cur->bsr_list); in bsr_cleanup_devs()
165 kfree(cur); in bsr_cleanup_devs()
189 struct bsr_dev *cur = kzalloc(sizeof(struct bsr_dev), in bsr_add_node() local
194 if (!cur) { in bsr_add_node()
203 kfree(cur); in bsr_add_node()
[all …]
|
| /linux/kernel/ |
| H A D | crash_reserve.c | 63 char *cur = cmdline, *tmp; in parse_crashkernel_mem() local
79 start = memparse(cur, &tmp); in parse_crashkernel_mem()
80 if (cur == tmp) { in parse_crashkernel_mem()
84 cur = tmp; in parse_crashkernel_mem()
85 if (*cur != '-') { in parse_crashkernel_mem()
89 cur++; in parse_crashkernel_mem()
92 if (*cur != ':') { in parse_crashkernel_mem()
93 end = memparse(cur, &tmp); in parse_crashkernel_mem()
94 if (cur == tmp) { in parse_crashkernel_mem()
98 cur = tmp; in parse_crashkernel_mem()
[all …]
|
| /linux/kernel/printk/ |
| H A D | nbcon.c | 152 static inline bool nbcon_state_try_cmpxchg(struct console *con, struct nbcon_state *cur, in nbcon_state_try_cmpxchg() argument
155 return atomic_try_cmpxchg(&ACCESS_PRIVATE(con, nbcon_state), &cur->atom, new->atom); in nbcon_state_try_cmpxchg()
240 struct nbcon_state *cur, bool is_reacquire) in nbcon_context_try_acquire_direct() argument
259 (!is_reacquire || cur->unsafe_takeover)) { in nbcon_context_try_acquire_direct()
263 if (ctxt->prio <= cur->prio || ctxt->prio <= cur->req_prio) in nbcon_context_try_acquire_direct()
266 if (cur->unsafe) in nbcon_context_try_acquire_direct()
273 WARN_ON_ONCE(cur->unsafe_takeover); in nbcon_context_try_acquire_direct()
275 new.atom = cur->atom; in nbcon_context_try_acquire_direct()
278 new.unsafe = cur->unsafe_takeover; in nbcon_context_try_acquire_direct()
281 } while (!nbcon_state_try_cmpxchg(con, cur, &new)); in nbcon_context_try_acquire_direct()
[all …]
|
| /linux/drivers/block/drbd/ |
| H A 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/security/selinux/ss/ |
| H A D | hashtab.c | 72 struct hashtab_node *cur, *temp; in hashtab_destroy() local
75 cur = h->htable[i]; in hashtab_destroy()
76 while (cur) { in hashtab_destroy()
77 temp = cur; in hashtab_destroy()
78 cur = cur->next; in hashtab_destroy()
93 struct hashtab_node *cur; in hashtab_map() local
96 cur = h->htable[i]; in hashtab_map()
97 while (cur) { in hashtab_map()
98 ret = apply(cur->key, cur->datum, args); in hashtab_map()
101 cur = cur->next; in hashtab_map()
[all …]
|
| H A D | avtab.c | 124 struct avtab_node *prev, *cur, *newnode; in avtab_insert() local
131 for (prev = NULL, cur = h->htable[hvalue]; cur; in avtab_insert()
132 prev = cur, cur = cur->next) { in avtab_insert()
133 cmp = avtab_node_cmp(key, &cur->key); in avtab_insert()
158 struct avtab_node *prev, *cur; in avtab_insert_nonunique() local
164 for (prev = NULL, cur = h->htable[hvalue]; cur; in avtab_insert_nonunique()
165 prev = cur, cur = cur->next) { in avtab_insert_nonunique()
166 cmp = avtab_node_cmp(key, &cur->key); in avtab_insert_nonunique()
181 struct avtab_node *cur; in avtab_search_node() local
188 for (cur = h->htable[hvalue]; cur; cur = cur->next) { in avtab_search_node()
[all …]
|
| /linux/arch/arm/boot/dts/ti/omap/ |
| H A 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/drivers/mtd/nand/ |
| H A 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/arch/mips/cavium-octeon/ |
| H A 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/tools/testing/selftests/filesystems/statmount/ |
| H A D | listmount_test.c | 36 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()
|