Lines Matching defs:cur
32 * Lookup a record by ino in the btree given by cur.
36 struct xfs_btree_cur *cur, /* btree cursor */
41 cur->bc_rec.i.ir_startino = ino;
42 cur->bc_rec.i.ir_holemask = 0;
43 cur->bc_rec.i.ir_count = 0;
44 cur->bc_rec.i.ir_freecount = 0;
45 cur->bc_rec.i.ir_free = 0;
46 return xfs_btree_lookup(cur, dir, stat);
50 * Update the record referred to by cur to the value given.
55 struct xfs_btree_cur *cur, /* btree cursor */
61 if (xfs_has_sparseinodes(cur->bc_mp)) {
70 return xfs_btree_update(cur, &rec);
101 struct xfs_btree_cur *cur,
107 if (!xfs_verify_agino(cur->bc_ag.pag, irec->ir_startino))
109 if (!xfs_verify_agino(cur->bc_ag.pag,
131 struct xfs_btree_cur *cur,
135 struct xfs_mount *mp = cur->bc_mp;
139 cur->bc_btnum == XFS_BTNUM_INO ? "Used" : "Free",
140 cur->bc_ag.pag->pag_agno, fa);
153 struct xfs_btree_cur *cur,
157 struct xfs_mount *mp = cur->bc_mp;
162 error = xfs_btree_get_rec(cur, &rec, stat);
167 fa = xfs_inobt_check_irec(cur, irec);
169 return xfs_inobt_complain_bad_rec(cur, fa, irec);
179 struct xfs_btree_cur *cur,
186 cur->bc_rec.i.ir_holemask = holemask;
187 cur->bc_rec.i.ir_count = count;
188 cur->bc_rec.i.ir_freecount = freecount;
189 cur->bc_rec.i.ir_free = free;
190 return xfs_btree_insert(cur, stat);
205 struct xfs_btree_cur *cur;
210 cur = xfs_inobt_init_cursor(pag, tp, agbp, btnum);
215 error = xfs_inobt_lookup(cur, thisino, XFS_LOOKUP_EQ, &i);
217 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
222 error = xfs_inobt_insert_rec(cur, XFS_INOBT_HOLEMASK_FULL,
227 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
233 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
244 struct xfs_btree_cur *cur)
246 if (cur->bc_nlevels == 1) {
252 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
257 error = xfs_inobt_get_rec(cur, &rec, &i);
263 error = xfs_btree_increment(cur, 0, &i);
269 if (!xfs_is_shutdown(cur->bc_mp))
270 ASSERT(freecount == cur->bc_ag.pag->pagi_freecount);
275 #define xfs_check_agi_freecount(cur) 0
550 struct xfs_btree_cur *cur;
555 cur = xfs_inobt_init_cursor(pag, tp, agbp, btnum);
558 error = xfs_inobt_lookup(cur, nrec->ir_startino, XFS_LOOKUP_EQ, &i);
563 error = xfs_inobt_insert_rec(cur, nrec->ir_holemask,
581 error = xfs_inobt_get_rec(cur, &rec, &i);
617 error = xfs_inobt_update(cur, nrec);
622 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
625 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
927 struct xfs_btree_cur *cur,
936 error = xfs_btree_decrement(cur, 0, &i);
938 error = xfs_btree_increment(cur, 0, &i);
944 error = xfs_inobt_get_rec(cur, rec, &i);
947 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
956 struct xfs_btree_cur *cur,
964 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_EQ, &i);
969 error = xfs_inobt_get_rec(cur, rec, &i);
972 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1015 struct xfs_btree_cur *cur, *tcur;
1028 cur = xfs_inobt_init_cursor(pag, tp, agbp, XFS_BTNUM_INO);
1036 error = xfs_check_agi_freecount(cur);
1047 error = xfs_inobt_lookup(cur, pagino, XFS_LOOKUP_LE, &i);
1055 error = xfs_inobt_get_rec(cur, &rec, &j);
1077 error = xfs_btree_dup_cursor(cur, &tcur);
1093 error = xfs_ialloc_get_rec(cur, pag->pagl_rightrec,
1103 /* search right with cur, go forward 1 record. */
1104 error = xfs_ialloc_next_rec(cur, &rec, &doneright, 0);
1126 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1127 cur = tcur;
1151 error = xfs_ialloc_next_rec(cur, &rec,
1180 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1190 error = xfs_inobt_lookup(cur, be32_to_cpu(agi->agi_newino),
1196 error = xfs_inobt_get_rec(cur, &rec, &j);
1213 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
1222 error = xfs_inobt_get_rec(cur, &rec, &i);
1231 error = xfs_btree_increment(cur, 0, &i);
1249 error = xfs_inobt_update(cur, &rec);
1256 error = xfs_check_agi_freecount(cur);
1260 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1267 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1366 struct xfs_btree_cur *cur,
1373 error = xfs_inobt_lookup(cur, be32_to_cpu(agi->agi_newino),
1378 error = xfs_inobt_get_rec(cur, rec, &i);
1381 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1390 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
1393 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1396 error = xfs_inobt_get_rec(cur, rec, &i);
1399 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1411 struct xfs_btree_cur *cur, /* inobt cursor */
1419 error = xfs_inobt_lookup(cur, frec->ir_startino, XFS_LOOKUP_EQ, &i);
1422 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1425 error = xfs_inobt_get_rec(cur, &rec, &i);
1428 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1430 ASSERT((XFS_AGINO_TO_OFFSET(cur->bc_mp, rec.ir_startino) %
1436 if (XFS_IS_CORRUPT(cur->bc_mp,
1441 return xfs_inobt_update(cur, &rec);
1463 struct xfs_btree_cur *cur; /* finobt cursor */
1481 cur = xfs_inobt_init_cursor(pag, tp, agbp, XFS_BTNUM_FINO);
1483 error = xfs_check_agi_freecount(cur);
1493 error = xfs_dialloc_ag_finobt_near(pagino, &cur, &rec);
1495 error = xfs_dialloc_ag_finobt_newino(agi, cur, &rec);
1512 error = xfs_inobt_update(cur, &rec);
1514 error = xfs_btree_delete(cur, &i);
1547 error = xfs_check_agi_freecount(cur);
1552 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1559 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1927 struct xfs_btree_cur *cur;
1940 cur = xfs_inobt_init_cursor(pag, tp, agbp, XFS_BTNUM_INO);
1942 error = xfs_check_agi_freecount(cur);
1949 if ((error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i))) {
1958 error = xfs_inobt_get_rec(cur, &rec, &i);
2006 if ((error = xfs_btree_delete(cur, &i))) {
2018 error = xfs_inobt_update(cur, &rec);
2034 error = xfs_check_agi_freecount(cur);
2039 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
2043 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
2059 struct xfs_btree_cur *cur;
2065 cur = xfs_inobt_init_cursor(pag, tp, agbp, XFS_BTNUM_FINO);
2067 error = xfs_inobt_lookup(cur, ibtrec->ir_startino, XFS_LOOKUP_EQ, &i);
2081 error = xfs_inobt_insert_rec(cur, ibtrec->ir_holemask,
2099 error = xfs_inobt_get_rec(cur, &rec, &i);
2131 error = xfs_btree_delete(cur, &i);
2136 error = xfs_inobt_update(cur, &rec);
2142 error = xfs_check_agi_freecount(cur);
2146 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
2150 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
2243 struct xfs_btree_cur *cur;
2262 cur = xfs_inobt_init_cursor(pag, tp, agbp, XFS_BTNUM_INO);
2263 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i);
2266 error = xfs_inobt_get_rec(cur, &rec, &i);
2272 xfs_btree_del_cursor(cur, error);
2653 struct xfs_btree_cur *cur,
2663 error = xfs_inobt_lookup(cur, low, XFS_LOOKUP_LE, &has_record);
2670 error = xfs_inobt_get_rec(cur, &irec, &has_record);
2687 error = xfs_btree_increment(cur, 0, &has_record);
2699 struct xfs_btree_cur *cur,
2709 agino = XFS_AGB_TO_AGINO(cur->bc_mp, bno);
2710 last_agino = XFS_AGB_TO_AGINO(cur->bc_mp, bno + len) - 1;
2712 error = xfs_ialloc_count_ondisk(cur, agino, last_agino, &allocated);
2733 struct xfs_btree_cur *cur,
2741 xfs_inobt_btrec_to_irec(cur->bc_mp, rec, &irec);
2742 fa = xfs_inobt_check_irec(cur, &irec);
2744 return xfs_inobt_complain_bad_rec(cur, fa, &irec);
2755 struct xfs_btree_cur *cur,
2762 ASSERT(cur->bc_btnum == XFS_BTNUM_INO);
2763 error = xfs_btree_query_all(cur, xfs_ialloc_count_inodes_rec, &ci);
2971 struct xfs_btree_cur *cur;
2979 cur = xfs_inobt_init_cursor(pag, tp, agibp, XFS_BTNUM_INO);
2983 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &has);
2987 error = xfs_inobt_get_rec(cur, &rec, &has);
3002 xfs_btree_del_cursor(cur, error);