Lines Matching defs:cur
154 * Lookup the record equal to [bno, len] in the btree given by cur.
158 struct xfs_btree_cur *cur, /* btree cursor */
165 cur->bc_rec.a.ar_startblock = bno;
166 cur->bc_rec.a.ar_blockcount = len;
167 error = xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
168 cur->bc_ag.abt.active = (*stat == 1);
174 * in the btree given by cur.
178 struct xfs_btree_cur *cur, /* btree cursor */
185 cur->bc_rec.a.ar_startblock = bno;
186 cur->bc_rec.a.ar_blockcount = len;
187 error = xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
188 cur->bc_ag.abt.active = (*stat == 1);
194 * in the btree given by cur.
198 struct xfs_btree_cur *cur, /* btree cursor */
204 cur->bc_rec.a.ar_startblock = bno;
205 cur->bc_rec.a.ar_blockcount = len;
206 error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat);
207 cur->bc_ag.abt.active = (*stat == 1);
213 struct xfs_btree_cur *cur)
215 return cur && cur->bc_ag.abt.active;
219 * Update the record referred to by cur to the value given
225 struct xfs_btree_cur *cur, /* btree cursor */
233 return xfs_btree_update(cur, &rec);
249 struct xfs_btree_cur *cur,
252 struct xfs_perag *pag = cur->bc_ag.pag;
266 struct xfs_btree_cur *cur,
270 struct xfs_mount *mp = cur->bc_mp;
274 cur->bc_btnum == XFS_BTNUM_BNO ? "Block" : "Size",
275 cur->bc_ag.pag->pag_agno, fa);
287 struct xfs_btree_cur *cur, /* btree cursor */
297 error = xfs_btree_get_rec(cur, &rec, stat);
302 fa = xfs_alloc_check_irec(cur, &irec);
304 return xfs_alloc_complain_bad_rec(cur, fa, &irec);
880 struct xfs_btree_cur *cur,
889 bool isbnobt = cur->bc_btnum == XFS_BTNUM_BNO;
893 error = xfs_alloc_get_rec(cur, &bno, &len, &i);
963 cur->bc_ag.abt.active = false;
964 trace_xfs_alloc_cur_check(args->mp, cur->bc_btnum, bno, len, diff,
1008 struct xfs_btree_cur *cur = acur->cnt;
1014 if (!xfs_alloc_cur_active(cur))
1019 error = xfs_alloc_lookup_ge(cur, args->agbno, cur_len, &i);
1024 error = xfs_alloc_get_rec(cur, &bno, &len, &i);
1029 error = xfs_alloc_cur_check(args, acur, cur, &i);
1043 error = xfs_btree_decrement(cur, 0, &i);
1045 error = xfs_alloc_get_rec(cur, &bno, &len, &i);
1047 error = xfs_alloc_cur_check(args, acur, cur,
1300 struct xfs_btree_cur *cur,
1316 while (xfs_alloc_cur_active(cur) && count) {
1317 error = xfs_alloc_cur_check(args, acur, cur, &i);
1325 if (!xfs_alloc_cur_active(cur))
1329 error = xfs_btree_increment(cur, 0, &i);
1331 error = xfs_btree_decrement(cur, 0, &i);
1335 cur->bc_ag.abt.active = false;
3842 struct xfs_btree_cur *cur,
3851 fa = xfs_alloc_check_irec(cur, &irec);
3853 return xfs_alloc_complain_bad_rec(cur, fa, &irec);
3855 return query->fn(cur, &irec, query->priv);
3861 struct xfs_btree_cur *cur,
3871 ASSERT(cur->bc_btnum == XFS_BTNUM_BNO);
3872 return xfs_btree_query_range(cur, &low_brec, &high_brec,
3879 struct xfs_btree_cur *cur,
3885 ASSERT(cur->bc_btnum == XFS_BTNUM_BNO);
3888 return xfs_btree_query_all(cur, xfs_alloc_query_range_helper, &query);
3897 struct xfs_btree_cur *cur,
3910 return xfs_btree_has_records(cur, &low, &high, NULL, outcome);