Lines Matching defs:bno
126 * - the AGF (bno and cnt) and AGI btree root blocks, and optionally
154 * Lookup the record equal to [bno, len] in the btree given by cur.
159 xfs_agblock_t bno, /* starting block of extent */
165 cur->bc_rec.a.ar_startblock = bno;
173 * Lookup the first record greater than or equal to [bno, len]
179 xfs_agblock_t bno, /* starting block of extent */
185 cur->bc_rec.a.ar_startblock = bno;
193 * Lookup the first record less than or equal to [bno, len]
199 xfs_agblock_t bno, /* starting block of extent */
204 cur->bc_rec.a.ar_startblock = bno;
220 * by [bno, len].
226 xfs_agblock_t bno, /* starting block of extent */
231 rec.alloc.ar_startblock = cpu_to_be32(bno);
288 xfs_agblock_t *bno, /* output: starting block of extent */
306 *bno = irec.ar_startblock;
324 xfs_agblock_t bno = foundbno;
330 busy = xfs_extent_busy_trim(args, &bno, &len, busy_gen);
336 if (bno < args->min_agbno && bno + len > args->min_agbno) {
337 diff = args->min_agbno - bno;
339 bno += diff;
345 xfs_agblock_t aligned_bno = roundup(bno, args->alignment);
347 diff = aligned_bno - bno;
352 *resbno = bno;
798 xfs_agblock_t bno; /* alloc bno */
800 xfs_extlen_t diff; /* diff from search bno */
821 acur->bno = 0;
884 xfs_agblock_t bno, bnoa, bnew;
893 error = xfs_alloc_get_rec(cur, &bno, &len, &i);
908 busy = xfs_alloc_compute_aligned(args, bno, len, &bnoa, &lena,
947 acur->rec_bno = bno;
949 acur->bno = bnew;
964 trace_xfs_alloc_cur_check(args->mp, cur->bc_btnum, bno, len, diff,
982 ASSERT(acur->bno >= acur->rec_bno);
983 ASSERT(acur->bno + acur->len <= acur->rec_bno + acur->rec_len);
987 acur->rec_len, acur->bno, acur->len, 0);
991 args->agbno = acur->bno;
1001 * bno optimized lookup to search for extents with ideal size and locality.
1009 xfs_agblock_t bno;
1024 error = xfs_alloc_get_rec(cur, &bno, &len, &i);
1042 if (bno > args->agbno) {
1045 error = xfs_alloc_get_rec(cur, &bno, &len, &i);
1176 * Allocate a variable extent at exactly agno/bno.
1179 * Return the starting a.g. block (bno), or NULLAGBLOCK if we can't do it.
1206 * Lookup bno and minlen in the btree (minlen is irrelevant, really).
1207 * Look for the closest free block <= bno, it must contain bno
1345 * Search the by-bno and by-size btrees in parallel in search of an extent with
1477 xfs_agblock_t *bno,
1499 error = xfs_alloc_get_rec(acur->cnt, bno, len, &i);
1532 * Allocate a variable extent near bno in the allocation group agno.
1545 xfs_agblock_t bno;
1571 error = xfs_alloc_ag_vextent_small(args, acur.cnt, &bno,
1595 error = xfs_alloc_ag_vextent_lastblock(args, &acur, &bno, &len,
1890 * Free the extent starting at agno/bno for length.
1897 xfs_agblock_t bno,
1921 error = xfs_rmap_free(tp, agbp, pag, bno, len, oinfo);
1934 if ((error = xfs_alloc_lookup_le(bno_cur, bno, len, &haveleft)))
1949 if (ltbno + ltlen < bno)
1957 if (XFS_IS_CORRUPT(mp, ltbno + ltlen > bno)) {
1982 if (bno + len < gtbno)
1990 if (XFS_IS_CORRUPT(mp, bno + len > gtbno)) {
2141 nbno = bno;
2151 nbno = bno;
2191 trace_xfs_free_extent(mp, agno, bno, len, type, haveleft, haveright);
2196 trace_xfs_free_extent(mp, agno, bno, len, type, -1, -1);
2299 /* space needed by-bno freespace btree */
2528 xfs_fsblock_t bno,
2540 ASSERT(bno != NULLFSBLOCK);
2543 ASSERT(!isnullstartblock(bno));
2544 agno = XFS_FSB_TO_AGNO(mp, bno);
2545 agbno = XFS_FSB_TO_AGBNO(mp, bno);
2554 if (XFS_IS_CORRUPT(mp, !xfs_verify_fsbext(mp, bno, len)))
2559 xefi->xefi_startblock = bno;
2576 XFS_FSB_TO_AGNO(tp->t_mountp, bno), 0,
2577 XFS_FSB_TO_AGBNO(tp->t_mountp, bno), len);
2640 xfs_agblock_t bno; /* freelist block */
2738 error = xfs_alloc_get_freelist(pag, tp, agbp, &bno, 0);
2743 error = xfs_defer_agfl_block(tp, args->agno, bno, &targs.oinfo);
2794 for (bno = targs.agbno; bno < targs.agbno + targs.len; bno++) {
2796 agflbp, bno, 0);
2829 xfs_agblock_t bno;
2854 bno = be32_to_cpu(agfl_bno[be32_to_cpu(agf->agf_flfirst)]);
2855 if (XFS_IS_CORRUPT(tp->t_mountp, !xfs_verify_agbno(pag, bno)))
2875 *bnop = bno;
2931 xfs_agblock_t bno,
2969 *blockp = cpu_to_be32(bno);
3898 xfs_agblock_t bno,
3906 low.a.ar_startblock = bno;
3908 high.a.ar_startblock = bno + len - 1;