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_sb_version_hassparseinodes(&cur->bc_mp->m_sb)) {
70 return xfs_btree_update(cur, &rec);
103 struct xfs_btree_cur *cur,
107 struct xfs_mount *mp = cur->bc_mp;
108 xfs_agnumber_t agno = cur->bc_ag.agno;
113 error = xfs_btree_get_rec(cur, &rec, stat);
140 cur->bc_btnum == XFS_BTNUM_INO ? "Used" : "Free", agno);
153 struct xfs_btree_cur *cur,
160 cur->bc_rec.i.ir_holemask = holemask;
161 cur->bc_rec.i.ir_count = count;
162 cur->bc_rec.i.ir_freecount = freecount;
163 cur->bc_rec.i.ir_free = free;
164 return xfs_btree_insert(cur, stat);
179 struct xfs_btree_cur *cur;
186 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, btnum);
191 error = xfs_inobt_lookup(cur, thisino, XFS_LOOKUP_EQ, &i);
193 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
198 error = xfs_inobt_insert_rec(cur, XFS_INOBT_HOLEMASK_FULL,
203 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
209 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
220 struct xfs_btree_cur *cur,
223 if (cur->bc_nlevels == 1) {
229 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
234 error = xfs_inobt_get_rec(cur, &rec, &i);
240 error = xfs_btree_increment(cur, 0, &i);
246 if (!XFS_FORCED_SHUTDOWN(cur->bc_mp))
252 #define xfs_check_agi_freecount(cur, agi) 0
527 struct xfs_btree_cur *cur;
534 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, btnum);
537 error = xfs_inobt_lookup(cur, nrec->ir_startino, XFS_LOOKUP_EQ, &i);
542 error = xfs_inobt_insert_rec(cur, nrec->ir_holemask,
560 error = xfs_inobt_get_rec(cur, &rec, &i);
596 error = xfs_inobt_update(cur, nrec);
601 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
604 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1048 struct xfs_btree_cur *cur,
1057 error = xfs_btree_decrement(cur, 0, &i);
1059 error = xfs_btree_increment(cur, 0, &i);
1065 error = xfs_inobt_get_rec(cur, rec, &i);
1068 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1077 struct xfs_btree_cur *cur,
1085 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_EQ, &i);
1090 error = xfs_inobt_get_rec(cur, rec, &i);
1093 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1137 struct xfs_btree_cur *cur, *tcur;
1150 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_INO);
1158 error = xfs_check_agi_freecount(cur, agi);
1169 error = xfs_inobt_lookup(cur, pagino, XFS_LOOKUP_LE, &i);
1177 error = xfs_inobt_get_rec(cur, &rec, &j);
1199 error = xfs_btree_dup_cursor(cur, &tcur);
1215 error = xfs_ialloc_get_rec(cur, pag->pagl_rightrec,
1225 /* search right with cur, go forward 1 record. */
1226 error = xfs_ialloc_next_rec(cur, &rec, &doneright, 0);
1248 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1249 cur = tcur;
1273 error = xfs_ialloc_next_rec(cur, &rec,
1302 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1312 error = xfs_inobt_lookup(cur, be32_to_cpu(agi->agi_newino),
1318 error = xfs_inobt_get_rec(cur, &rec, &j);
1335 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
1344 error = xfs_inobt_get_rec(cur, &rec, &i);
1353 error = xfs_btree_increment(cur, 0, &i);
1371 error = xfs_inobt_update(cur, &rec);
1378 error = xfs_check_agi_freecount(cur, agi);
1382 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1389 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1488 struct xfs_btree_cur *cur,
1495 error = xfs_inobt_lookup(cur, be32_to_cpu(agi->agi_newino),
1500 error = xfs_inobt_get_rec(cur, rec, &i);
1503 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1512 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
1515 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1518 error = xfs_inobt_get_rec(cur, rec, &i);
1521 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1533 struct xfs_btree_cur *cur, /* inobt cursor */
1541 error = xfs_inobt_lookup(cur, frec->ir_startino, XFS_LOOKUP_EQ, &i);
1544 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1547 error = xfs_inobt_get_rec(cur, &rec, &i);
1550 if (XFS_IS_CORRUPT(cur->bc_mp, i != 1))
1552 ASSERT((XFS_AGINO_TO_OFFSET(cur->bc_mp, rec.ir_startino) %
1558 if (XFS_IS_CORRUPT(cur->bc_mp,
1563 return xfs_inobt_update(cur, &rec);
1585 struct xfs_btree_cur *cur; /* finobt cursor */
1603 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_FINO);
1605 error = xfs_check_agi_freecount(cur, agi);
1615 error = xfs_dialloc_ag_finobt_near(pagino, &cur, &rec);
1617 error = xfs_dialloc_ag_finobt_newino(agi, cur, &rec);
1634 error = xfs_inobt_update(cur, &rec);
1636 error = xfs_btree_delete(cur, &i);
1669 error = xfs_check_agi_freecount(cur, agi);
1674 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1681 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1938 struct xfs_btree_cur *cur;
1951 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_INO);
1953 error = xfs_check_agi_freecount(cur, agi);
1960 if ((error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i))) {
1969 error = xfs_inobt_get_rec(cur, &rec, &i);
2019 if ((error = xfs_btree_delete(cur, &i))) {
2029 error = xfs_inobt_update(cur, &rec);
2045 error = xfs_check_agi_freecount(cur, agi);
2050 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
2054 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
2071 struct xfs_btree_cur *cur;
2077 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_FINO);
2079 error = xfs_inobt_lookup(cur, ibtrec->ir_startino, XFS_LOOKUP_EQ, &i);
2093 error = xfs_inobt_insert_rec(cur, ibtrec->ir_holemask,
2111 error = xfs_inobt_get_rec(cur, &rec, &i);
2144 error = xfs_btree_delete(cur, &i);
2149 error = xfs_inobt_update(cur, &rec);
2155 error = xfs_check_agi_freecount(cur, agi);
2159 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
2163 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
2259 struct xfs_btree_cur *cur;
2278 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno, XFS_BTNUM_INO);
2279 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i);
2282 error = xfs_inobt_get_rec(cur, &rec, &i);
2288 xfs_btree_del_cursor(cur, error);
2691 struct xfs_btree_cur *cur,
2704 error = xfs_inobt_lookup(cur, low, XFS_LOOKUP_LE, &has_record);
2706 error = xfs_inobt_get_rec(cur, &irec, &has_record);
2723 error = xfs_btree_increment(cur, 0, &has_record);
2731 struct xfs_btree_cur *cur,
2739 low = XFS_AGB_TO_AGINO(cur->bc_mp, bno);
2740 high = XFS_AGB_TO_AGINO(cur->bc_mp, bno + len) - 1;
2742 return xfs_ialloc_has_inode_record(cur, low, high, exists);
2753 struct xfs_btree_cur *cur,
2760 xfs_inobt_btrec_to_irec(cur->bc_mp, rec, &irec);
2770 struct xfs_btree_cur *cur,
2777 ASSERT(cur->bc_btnum == XFS_BTNUM_INO);
2778 error = xfs_btree_query_all(cur, xfs_ialloc_count_inodes_rec, &ci);