Lines Matching refs:bno
46 xfs_agblock_t bno, xfs_extlen_t len);
63 * Lookup the record equal to [bno, len] in the btree given by cur.
68 xfs_agblock_t bno, /* starting block of extent */
72 cur->bc_rec.a.ar_startblock = bno;
78 * Lookup the first record greater than or equal to [bno, len]
84 xfs_agblock_t bno, /* starting block of extent */
88 cur->bc_rec.a.ar_startblock = bno;
94 * Lookup the first record less than or equal to [bno, len]
100 xfs_agblock_t bno, /* starting block of extent */
104 cur->bc_rec.a.ar_startblock = bno;
111 * by [bno, len].
117 xfs_agblock_t bno, /* starting block of extent */
122 rec.alloc.ar_startblock = cpu_to_be32(bno);
133 xfs_agblock_t *bno, /* output: starting block of extent */
142 *bno = be32_to_cpu(rec->alloc.ar_startblock);
161 xfs_agblock_t bno;
166 bno = roundup(foundbno, alignment);
167 diff = bno - foundbno;
170 bno = foundbno;
173 *resbno = bno;
477 * Type and bno are used to determine where in the allocation group the
558 * Allocate a variable extent at exactly agno/bno.
561 * Return the starting a.g. block (bno), or NULLAGBLOCK if we can't do it.
586 * Lookup bno and minlen in the btree (minlen is irrelevant, really).
587 * Look for the closest free block <= bno, it must contain bno
662 * Allocate a variable extent near bno in the allocation group agno.
671 xfs_btree_cur_t *bno_cur_gt; /* cursor for bno btree, right side */
672 xfs_btree_cur_t *bno_cur_lt; /* cursor for bno btree, left side */
674 xfs_agblock_t gtbno; /* start bno of right side entry */
679 xfs_agblock_t gtnew; /* useful start bno of right side */
683 xfs_agblock_t ltbno; /* start bno of left side entry */
688 xfs_agblock_t ltnew; /* useful start bno of left side */
825 * Set up a cursor for the by-bno tree.
843 * Search in the by-bno tree to the left and to the right
859 * Lookup <= bno to find the leftward search's starting point.
1201 xfs_btree_cur_t *bno_cur; /* cursor for bno btree */
1432 * Free the extent starting at agno/bno for length.
1439 xfs_agblock_t bno, /* starting block number */
1467 if ((error = xfs_alloc_lookup_le(bno_cur, bno, len, &haveleft)))
1479 if (ltbno + ltlen < bno)
1487 XFS_WANT_CORRUPTED_GOTO(ltbno + ltlen <= bno, error0);
1506 if (bno + len < gtbno)
1514 XFS_WANT_CORRUPTED_GOTO(gtbno >= bno + len, error0);
1625 nbno = bno;
1635 nbno = bno;
1679 trace_xfs_free_extent(mp, agno, bno, len, isfl, haveleft, haveright);
1692 xfs_alloc_busy_insert(tp, agno, bno, len);
1696 trace_xfs_free_extent(mp, agno, bno, len, isfl, -1, -1);
1762 xfs_agblock_t bno; /* freelist block */
1864 error = xfs_alloc_get_freelist(tp, agbp, &bno, 0);
1867 if ((error = xfs_free_ag_extent(tp, agbp, args->agno, bno, 1, 1)))
1869 bp = xfs_btree_get_bufs(mp, tp, args->agno, bno, 0);
1914 for (bno = targs.agbno; bno < targs.agbno + targs.len; bno++) {
1916 agflbp, bno, 0);
1940 xfs_agblock_t bno; /* block number returned */
1965 bno = be32_to_cpu(agfl->agfl_bno[be32_to_cpu(agf->agf_flfirst)]);
1985 *bnop = bno;
2000 if (xfs_alloc_busy_search(mp, be32_to_cpu(agf->agf_seqno), bno, 1))
2066 xfs_agblock_t bno, /* block being freed */
2105 *blockp = cpu_to_be32(bno);
2328 * Start with allocation group given by bno.
2449 xfs_fsblock_t bno, /* starting block number of extent */
2459 args.agno = XFS_FSB_TO_AGNO(args.mp, bno);
2461 args.agbno = XFS_FSB_TO_AGBNO(args.mp, bno);
2574 xfs_agblock_t bno,
2592 trace_xfs_alloc_busy(tp, agno, bno, len, 1);
2598 new->bno = bno;
2605 trace_xfs_alloc_busy(tp, agno, bno, len, 0);
2618 if (new->bno < busyp->bno) {
2621 if (new->bno + new->length > busyp->bno)
2623 } else if (new->bno > busyp->bno) {
2626 if (bno < busyp->bno + busyp->length)
2645 if (busyp->bno == new->bno) {
2654 new->length = max(busyp->bno + busyp->length,
2655 new->bno + new->length) -
2656 min(busyp->bno, new->bno);
2657 new->bno = min(busyp->bno, new->bno);
2683 xfs_agblock_t bno,
2696 /* find closest start bno overlap */
2699 if (bno < busyp->bno) {
2701 if (bno + len > busyp->bno)
2704 } else if (bno > busyp->bno) {
2706 if (bno < busyp->bno + busyp->length)
2710 /* bno matches busyp, length determines exact match */
2716 trace_xfs_alloc_busysearch(mp, agno, bno, len, !!match);
2728 trace_xfs_alloc_unbusy(mp, busyp->agno, busyp->bno,
2731 ASSERT(xfs_alloc_busy_search(mp, busyp->agno, busyp->bno,