Lines Matching defs:bno
51 xfs_agblock_t bno,
105 xfs_agblock_t bno;
110 bno = roundup(foundbno, alignment);
111 diff = bno - foundbno;
114 bno = foundbno;
117 *resbno = bno;
541 * Type and bno are used to determine where in the allocation group the
622 * Allocate a variable extent at exactly agno/bno.
625 * Return the starting a.g. block (bno), or NULLAGBLOCK if we can't do it.
653 * Lookup bno and minlen in the btree (minlen is irrelevant, really).
654 * Look for the closest free block <= bno, it must contain bno
728 * Allocate a variable extent near bno in the allocation group agno.
737 xfs_btree_cur_t *bno_cur_gt; /* cursor for bno btree, right side */
738 xfs_btree_cur_t *bno_cur_lt; /* cursor for bno btree, left side */
743 xfs_agblock_t gtbno; /* start bno of right side entry */
748 xfs_agblock_t gtnew; /* useful start bno of right side */
752 xfs_agblock_t ltbno; /* start bno of left side entry */
756 xfs_agblock_t ltend; /* end bno of left side entry */
759 xfs_agblock_t ltnew; /* useful start bno of left side */
897 * Set up a cursor for the by-bno tree.
914 * Search in the by-bno tree to the left and to the right
930 * Lookup <= bno to find the leftward search's starting point.
1268 xfs_btree_cur_t *bno_cur; /* cursor for bno btree */
1504 * Free the extent starting at agno/bno for length.
1511 xfs_agblock_t bno, /* starting block number */
1543 if ((error = xfs_alloc_lookup_le(bno_cur, bno, len, &haveleft)))
1555 if (ltbno + ltlen < bno)
1563 XFS_WANT_CORRUPTED_GOTO(ltbno + ltlen <= bno, error0);
1582 if (bno + len < gtbno)
1590 XFS_WANT_CORRUPTED_GOTO(gtbno >= bno + len, error0);
1702 nbno = bno;
1712 nbno = bno;
1757 agno, bno, len, isfl);
1770 xfs_alloc_mark_busy(tp, agno, bno, len);
1774 TRACE_FREE("error", agno, bno, len, isfl);
1821 xfs_agblock_t bno; /* freelist block */
1926 if ((error = xfs_alloc_get_freelist(tp, agbp, &bno)))
1928 if ((error = xfs_free_ag_extent(tp, agbp, args->agno, bno, 1, 1)))
1930 bp = xfs_btree_get_bufs(mp, tp, args->agno, bno, 0);
1975 for (bno = targs.agbno; bno < targs.agbno + targs.len; bno++) {
1977 bno)))
1999 xfs_agblock_t bno; /* block number returned */
2026 bno = be32_to_cpu(agfl->agfl_bno[be32_to_cpu(agf->agf_flfirst)]);
2037 *bnop = bno;
2047 xfs_alloc_search_busy(tp, be32_to_cpu(agf->agf_seqno), bno, 1);
2109 xfs_agblock_t bno) /* block being freed */
2137 *blockp = cpu_to_be32(bno);
2335 * Start with allocation group given by bno.
2454 xfs_fsblock_t bno, /* starting block number of extent */
2464 args.agno = XFS_FSB_TO_AGNO(args.mp, bno);
2466 args.agbno = XFS_FSB_TO_AGBNO(args.mp, bno);
2496 xfs_agblock_t bno,
2519 TRACE_BUSY("xfs_alloc_mark_busy", "got", agno, bno, len, n, tp);
2520 bsy->busy_start = bno;
2525 TRACE_BUSY("xfs_alloc_mark_busy", "FULL", agno, bno, len, -1, tp);
2566 * returns non-zero if any of (agno,bno):len is in a busy list
2571 xfs_agblock_t bno,
2587 uend = bno + len - 1;
2598 if ((bno > bend) ||
2603 "found1", agno, bno, len, n,
2615 TRACE_BUSYSEARCH("xfs_alloc_search_busy", "found", agno, bno, len, n, tp);
2620 TRACE_BUSYSEARCH("xfs_alloc_search_busy", "not-found", agno, bno, len, n, tp);