Home
last modified time | relevance | path

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

12345

/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
110 if (!xfs_btree_check_sptr(cur, sibling, level + 1)) in xfs_btree_check_sblock_siblings()
125 struct xfs_btree_cur *cur, in __xfs_btree_check_lblock() argument
130 struct xfs_mount *mp = cur->bc_mp; in __xfs_btree_check_lblock()
131 xfs_btnum_t btnum = cur->bc_btnum; in __xfs_btree_check_lblock()
151 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
157 fa = xfs_btree_check_lblock_siblings(mp, cur, level, fsb, in __xfs_btree_check_lblock()
160 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.c46 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 …]
Dxfs_alloc_btree.c26 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 …]
Dxfs_ialloc_btree.c27 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 …]
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_refcount_btree.c26 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 …]
Dxfs_bmap_btree.c164 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 …]
Dxfs_rmap_btree.c52 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 …]
Dxfs_btree.h90 #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 …]
Dxfs_rmap.c33 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 …]
Dxfs_ialloc.c36 struct xfs_btree_cur *cur, /* btree cursor */ in xfs_inobt_lookup() argument
41 cur->bc_rec.i.ir_startino = ino; in xfs_inobt_lookup()
42 cur->bc_rec.i.ir_holemask = 0; in xfs_inobt_lookup()
43 cur->bc_rec.i.ir_count = 0; in xfs_inobt_lookup()
44 cur->bc_rec.i.ir_freecount = 0; in xfs_inobt_lookup()
45 cur->bc_rec.i.ir_free = 0; in xfs_inobt_lookup()
46 return xfs_btree_lookup(cur, dir, stat); in xfs_inobt_lookup()
55 struct xfs_btree_cur *cur, /* btree cursor */ in xfs_inobt_update() argument
61 if (xfs_has_sparseinodes(cur->bc_mp)) { in xfs_inobt_update()
70 return xfs_btree_update(cur, &rec); in xfs_inobt_update()
[all …]
Dxfs_bmap.c109 struct xfs_btree_cur *cur, in xfs_bmbt_lookup_eq() argument
113 cur->bc_rec.b = *irec; in xfs_bmbt_lookup_eq()
114 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat); in xfs_bmbt_lookup_eq()
119 struct xfs_btree_cur *cur, in xfs_bmbt_lookup_first() argument
122 cur->bc_rec.b.br_startoff = 0; in xfs_bmbt_lookup_first()
123 cur->bc_rec.b.br_startblock = 0; in xfs_bmbt_lookup_first()
124 cur->bc_rec.b.br_blockcount = 0; in xfs_bmbt_lookup_first()
125 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); in xfs_bmbt_lookup_first()
158 struct xfs_btree_cur *cur, in xfs_bmbt_update() argument
164 return xfs_btree_update(cur, &rec); in xfs_bmbt_update()
[all …]
Dxfs_inode_fork.h155 void xfs_iext_insert(struct xfs_inode *, struct xfs_iext_cursor *cur,
163 struct xfs_iext_cursor *cur,
167 struct xfs_iext_cursor *cur,
170 struct xfs_iext_cursor *cur,
173 struct xfs_iext_cursor *cur,
182 struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) in xfs_iext_next_extent() argument
184 xfs_iext_next(ifp, cur); in xfs_iext_next_extent()
185 return xfs_iext_get_extent(ifp, cur, gotp); in xfs_iext_next_extent()
189 struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) in xfs_iext_prev_extent() argument
191 xfs_iext_prev(ifp, cur); in xfs_iext_prev_extent()
[all …]
Dxfs_btree_staging.h22 void xfs_btree_stage_afakeroot(struct xfs_btree_cur *cur,
24 void xfs_btree_commit_afakeroot(struct xfs_btree_cur *cur, struct xfs_trans *tp,
49 void xfs_btree_stage_ifakeroot(struct xfs_btree_cur *cur,
52 void xfs_btree_commit_ifakeroot(struct xfs_btree_cur *cur, struct xfs_trans *tp,
56 typedef int (*xfs_btree_bload_get_record_fn)(struct xfs_btree_cur *cur, void *priv);
57 typedef int (*xfs_btree_bload_claim_block_fn)(struct xfs_btree_cur *cur,
59 typedef size_t (*xfs_btree_bload_iroot_size_fn)(struct xfs_btree_cur *cur,
118 int xfs_btree_bload_compute_geometry(struct xfs_btree_cur *cur,
120 int xfs_btree_bload(struct xfs_btree_cur *cur, struct xfs_btree_bload *bbl,
Dxfs_rmap.h124 int xfs_rmap_lookup_le(struct xfs_btree_cur *cur, xfs_agblock_t bno,
127 int xfs_rmap_lookup_eq(struct xfs_btree_cur *cur, xfs_agblock_t bno,
133 int xfs_rmap_get_rec(struct xfs_btree_cur *cur, struct xfs_rmap_irec *irec,
137 struct xfs_btree_cur *cur,
141 int xfs_rmap_query_range(struct xfs_btree_cur *cur,
145 int xfs_rmap_query_all(struct xfs_btree_cur *cur, xfs_rmap_query_range_fn fn,
187 int xfs_rmap_find_left_neighbor(struct xfs_btree_cur *cur, xfs_agblock_t bno,
190 int xfs_rmap_lookup_le_range(struct xfs_btree_cur *cur, xfs_agblock_t bno,
198 int xfs_rmap_has_record(struct xfs_btree_cur *cur, xfs_agblock_t bno,
200 int xfs_rmap_record_exists(struct xfs_btree_cur *cur, xfs_agblock_t bno,
[all …]
Dxfs_refcount.h16 extern int xfs_refcount_lookup_le(struct xfs_btree_cur *cur,
18 extern int xfs_refcount_lookup_ge(struct xfs_btree_cur *cur,
20 extern int xfs_refcount_lookup_eq(struct xfs_btree_cur *cur,
22 extern int xfs_refcount_get_rec(struct xfs_btree_cur *cur,
51 extern int xfs_refcount_find_shared(struct xfs_btree_cur *cur,
78 extern int xfs_refcount_has_record(struct xfs_btree_cur *cur,
83 extern int xfs_refcount_insert(struct xfs_btree_cur *cur,
/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 …]
Dtrace.c21 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()
Dialloc.c106 struct xfs_mount *mp = bs->cur->bc_mp; in xchk_iallocbt_chunk()
107 xfs_agnumber_t agno = bs->cur->bc_ag.pag->pag_agno; in xchk_iallocbt_chunk()
114 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_iallocbt_chunk()
151 struct xfs_mount *mp = bs->cur->bc_mp; in xchk_iallocbt_check_cluster_ifree()
167 fsino = XFS_AGINO_TO_INO(mp, bs->cur->bc_ag.pag->pag_agno, agino); in xchk_iallocbt_check_cluster_ifree()
172 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_iallocbt_check_cluster_ifree()
176 error = xfs_icache_inode_is_allocated(mp, bs->cur->bc_tp, fsino, in xchk_iallocbt_check_cluster_ifree()
195 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_iallocbt_check_cluster_ifree()
214 struct xfs_mount *mp = bs->cur->bc_mp; in xchk_iallocbt_check_cluster()
217 xfs_agnumber_t agno = bs->cur->bc_ag.pag->pag_agno; in xchk_iallocbt_check_cluster()
[all …]
Dagheader_repair.c72 struct xfs_btree_cur *cur, in xrep_agf_walk_allocbt() argument
242 struct xfs_btree_cur *cur = NULL; in xrep_agf_calc_from_btrees() local
250 cur = xfs_allocbt_init_cursor(mp, sc->tp, agf_bp, in xrep_agf_calc_from_btrees()
252 error = xfs_alloc_query_all(cur, xrep_agf_walk_allocbt, &raa); in xrep_agf_calc_from_btrees()
255 error = xfs_btree_count_blocks(cur, &blocks); in xrep_agf_calc_from_btrees()
258 xfs_btree_del_cursor(cur, error); in xrep_agf_calc_from_btrees()
264 cur = xfs_allocbt_init_cursor(mp, sc->tp, agf_bp, in xrep_agf_calc_from_btrees()
266 error = xfs_btree_count_blocks(cur, &blocks); in xrep_agf_calc_from_btrees()
269 xfs_btree_del_cursor(cur, error); in xrep_agf_calc_from_btrees()
273 cur = xfs_rmapbt_init_cursor(mp, sc->tp, agf_bp, sc->sa.pag); in xrep_agf_calc_from_btrees()
[all …]
Drmap.c93 struct xfs_mount *mp = bs->cur->bc_mp; in xchk_rmapbt_rec()
95 xfs_agnumber_t agno = bs->cur->bc_ag.pag->pag_agno; in xchk_rmapbt_rec()
103 if (!xchk_btree_process_error(bs->sc, bs->cur, 0, &error)) in xchk_rmapbt_rec()
108 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
118 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
127 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
137 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
140 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
143 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
146 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); in xchk_rmapbt_rec()
[all …]
Dtrace.h328 TP_PROTO(struct xfs_scrub *sc, struct xfs_btree_cur *cur,
330 TP_ARGS(sc, cur, level, error, ret_ip),
343 xfs_fsblock_t fsbno = xchk_btree_cur_fsbno(cur, level);
347 __entry->btnum = cur->bc_btnum;
349 __entry->agno = XFS_FSB_TO_AGNO(cur->bc_mp, fsbno);
350 __entry->bno = XFS_FSB_TO_AGBNO(cur->bc_mp, fsbno);
351 __entry->ptr = cur->bc_ptrs[level];
368 TP_PROTO(struct xfs_scrub *sc, struct xfs_btree_cur *cur,
370 TP_ARGS(sc, cur, level, error, ret_ip),
385 xfs_fsblock_t fsbno = xchk_btree_cur_fsbno(cur, level);
[all …]
/fs/xfs/
Dxfs_trans_ail.c166 struct xfs_ail_cursor *cur) in xfs_trans_ail_cursor_init() argument
168 cur->item = NULL; in xfs_trans_ail_cursor_init()
169 list_add_tail(&cur->list, &ailp->ail_cursors); in xfs_trans_ail_cursor_init()
179 struct xfs_ail_cursor *cur) in xfs_trans_ail_cursor_next() argument
181 struct xfs_log_item *lip = cur->item; in xfs_trans_ail_cursor_next()
186 cur->item = xfs_ail_next(ailp, lip); in xfs_trans_ail_cursor_next()
196 struct xfs_ail_cursor *cur) in xfs_trans_ail_cursor_done() argument
198 cur->item = NULL; in xfs_trans_ail_cursor_done()
199 list_del_init(&cur->list); in xfs_trans_ail_cursor_done()
215 struct xfs_ail_cursor *cur; in xfs_trans_ail_cursor_clear() local
[all …]
/fs/cifs/
Dsmb2file.c109 struct smb2_lock_element *buf, *cur; in smb2_unlock_range() local
133 cur = buf; in smb2_unlock_range()
158 cur->Length = cpu_to_le64(li->length); in smb2_unlock_range()
159 cur->Offset = cpu_to_le64(li->offset); in smb2_unlock_range()
160 cur->Flags = cpu_to_le32(SMB2_LOCKFLAG_UNLOCK); in smb2_unlock_range()
186 cur = buf; in smb2_unlock_range()
189 cur++; in smb2_unlock_range()
215 struct smb2_lock_element *cur = buf; in smb2_push_mand_fdlocks() local
219 cur->Length = cpu_to_le64(li->length); in smb2_push_mand_fdlocks()
220 cur->Offset = cpu_to_le64(li->offset); in smb2_push_mand_fdlocks()
[all …]

12345