Lines Matching refs:dp
64 static void dbAllocBits(struct bmap * bmp, struct dmap * dp, s64 blkno,
73 static int dbAllocNext(struct bmap * bmp, struct dmap * dp, s64 blkno,
75 static int dbAllocNear(struct bmap * bmp, struct dmap * dp, s64 blkno,
78 static int dbAllocDmap(struct bmap * bmp, struct dmap * dp, s64 blkno,
80 static int dbAllocDmapLev(struct bmap * bmp, struct dmap * dp, int nblocks,
91 static int dbFreeBits(struct bmap * bmp, struct dmap * dp, s64 blkno,
93 static int dbFreeDmap(struct bmap * bmp, struct dmap * dp, s64 blkno,
101 static int dbAllocDmapBU(struct bmap * bmp, struct dmap * dp, s64 blkno,
103 static int dbInitDmap(struct dmap * dp, s64 blkno, int nblocks);
104 static int dbInitDmapTree(struct dmap * dp);
321 struct dmap *dp; in dbFree() local
364 dp = (struct dmap *) mp->data; in dbFree()
372 if ((rc = dbFreeDmap(bmp, dp, blkno, nb))) { in dbFree()
419 struct dmap *dp; in dbUpdatePMap() local
458 dp = (struct dmap *) mp->data; in dbUpdatePMap()
491 dp->pmap[word] &= in dbUpdatePMap()
494 dp->pmap[word] |= in dbUpdatePMap()
510 memset(&dp->pmap[word], 0, in dbUpdatePMap()
513 memset(&dp->pmap[word], (int) ONES, in dbUpdatePMap()
694 struct dmap *dp; in dbAlloc() local
773 dp = (struct dmap *) mp->data; in dbAlloc()
778 if ((rc = dbAllocNext(bmp, dp, blkno, (int) nblocks)) in dbAlloc()
805 dbAllocNear(bmp, dp, blkno, (int) nblocks, l2nb, results)) in dbAlloc()
817 if ((rc = dbAllocDmapLev(bmp, dp, (int) nblocks, l2nb, results)) in dbAlloc()
885 struct dmap *dp; in dbAllocExact() local
916 dp = (struct dmap *) mp->data; in dbAllocExact()
919 rc = dbAllocNext(bmp, dp, blkno, nblocks); in dbAllocExact()
1019 struct dmap *dp; in dbExtend() local
1073 dp = (struct dmap *) mp->data; in dbExtend()
1078 rc = dbAllocNext(bmp, dp, extblkno, (int) addnblocks); in dbExtend()
1112 static int dbAllocNext(struct bmap * bmp, struct dmap * dp, s64 blkno, in dbAllocNext() argument
1120 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNext()
1127 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1173 if ((mask & ~le32_to_cpu(dp->wmap[word])) != mask) in dbAllocNext()
1212 return (dbAllocDmap(bmp, dp, blkno, nblocks)); in dbAllocNext()
1245 struct dmap * dp, s64 blkno, int nblocks, int l2nb, s64 * results) in dbAllocNear() argument
1250 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNear()
1255 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1275 blkno = le64_to_cpu(dp->start) + (word << L2DBWORD); in dbAllocNear()
1284 dbFindBits(le32_to_cpu(dp->wmap[word]), l2nb); in dbAllocNear()
1288 if ((rc = dbAllocDmap(bmp, dp, blkno, nblocks)) == 0) in dbAllocNear()
1838 struct dmap *dp; in dbAllocCtl() local
1849 dp = (struct dmap *) mp->data; in dbAllocCtl()
1853 rc = dbAllocDmapLev(bmp, dp, (int) nblocks, l2nb, results); in dbAllocCtl()
1878 dp = (struct dmap *) mp->data; in dbAllocCtl()
1882 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
1896 if ((rc = dbAllocDmap(bmp, dp, b, nb))) { in dbAllocCtl()
1935 dp = (struct dmap *) mp->data; in dbAllocCtl()
1939 if (dbFreeDmap(bmp, dp, b, BPERDMAP)) { in dbAllocCtl()
1985 struct dmap * dp, int nblocks, int l2nb, s64 * results) in dbAllocDmapLev() argument
1997 if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx)) in dbAllocDmapLev()
2003 blkno = le64_to_cpu(dp->start) + (leafidx << L2DBWORD); in dbAllocDmapLev()
2009 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2010 blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb); in dbAllocDmapLev()
2013 if ((rc = dbAllocDmap(bmp, dp, blkno, nblocks)) == 0) in dbAllocDmapLev()
2047 static int dbAllocDmap(struct bmap * bmp, struct dmap * dp, s64 blkno, in dbAllocDmap() argument
2056 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2059 dbAllocBits(bmp, dp, blkno, nblocks); in dbAllocDmap()
2062 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2069 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0))) in dbAllocDmap()
2070 dbFreeBits(bmp, dp, blkno, nblocks); in dbAllocDmap()
2102 static int dbFreeDmap(struct bmap * bmp, struct dmap * dp, s64 blkno, in dbFreeDmap() argument
2111 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()
2114 rc = dbFreeBits(bmp, dp, blkno, nblocks); in dbFreeDmap()
2117 if (rc || (dp->tree.stree[ROOT] == oldroot)) in dbFreeDmap()
2124 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) { in dbFreeDmap()
2132 if (dp->tree.stree[word] == NOFREE) in dbFreeDmap()
2133 dbBackSplit((dmtree_t *) & dp->tree, word); in dbFreeDmap()
2135 dbAllocBits(bmp, dp, blkno, nblocks); in dbFreeDmap()
2164 static void dbAllocBits(struct bmap * bmp, struct dmap * dp, s64 blkno, in dbAllocBits() argument
2168 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbAllocBits()
2173 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()
2210 dp->wmap[word] |= cpu_to_le32(ONES << (DBWORD - nb) in dbAllocBits()
2219 dbMaxBud((u8 *) & dp->wmap[word])); in dbAllocBits()
2229 memset(&dp->wmap[word], (int) ONES, nwords * 4); in dbAllocBits()
2269 le32_add_cpu(&dp->nfree, -nblocks); in dbAllocBits()
2311 static int dbFreeBits(struct bmap * bmp, struct dmap * dp, s64 blkno, in dbFreeBits() argument
2315 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbFreeBits()
2359 dp->wmap[word] &= in dbFreeBits()
2366 dbMaxBud((u8 *) & dp->wmap[word])); in dbFreeBits()
2377 memset(&dp->wmap[word], 0, nwords * 4); in dbFreeBits()
2413 le32_add_cpu(&dp->nfree, nblocks); in dbFreeBits()
3198 struct dmap *dp; in dbAllocBottomUp() local
3226 dp = (struct dmap *) mp->data; in dbAllocBottomUp()
3234 if ((rc = dbAllocDmapBU(bmp, dp, blkno, nb))) { in dbAllocBottomUp()
3250 static int dbAllocDmapBU(struct bmap * bmp, struct dmap * dp, s64 blkno, in dbAllocDmapBU() argument
3256 struct dmaptree *tp = (struct dmaptree *) & dp->tree; in dbAllocDmapBU()
3298 dp->wmap[word] |= cpu_to_le32(ONES << (DBWORD - nb) in dbAllocDmapBU()
3309 memset(&dp->wmap[word], (int) ONES, nwords * 4); in dbAllocDmapBU()
3318 le32_add_cpu(&dp->nfree, -nblocks); in dbAllocDmapBU()
3321 dbInitDmapTree(dp); in dbAllocDmapBU()
3348 dbFreeBits(bmp, dp, blkno, nblocks); in dbAllocDmapBU()
3380 struct dmap *dp; in dbExtendFS() local
3557 dp = (struct dmap *) mp->data; in dbExtendFS()
3558 *l0leaf = dbInitDmap(dp, blkno, n); in dbExtendFS()
3561 agno = le64_to_cpu(dp->start) >> l2agsize; in dbExtendFS()
3734 static int dbInitDmap(struct dmap * dp, s64 Blkno, int nblocks) in dbInitDmap() argument
3742 dp->nblocks = dp->nfree = cpu_to_le32(nblocks); in dbInitDmap()
3743 dp->start = cpu_to_le64(Blkno); in dbInitDmap()
3746 memset(&dp->wmap[0], 0, LPERDMAP * 4); in dbInitDmap()
3747 memset(&dp->pmap[0], 0, LPERDMAP * 4); in dbInitDmap()
3751 le32_add_cpu(&dp->nblocks, nblocks); in dbInitDmap()
3752 le32_add_cpu(&dp->nfree, nblocks); in dbInitDmap()
3772 dp->wmap[w] &= cpu_to_le32(~(ONES << (DBWORD - nb) in dbInitDmap()
3774 dp->pmap[w] &= cpu_to_le32(~(ONES << (DBWORD - nb) in dbInitDmap()
3782 memset(&dp->wmap[w], 0, nw * 4); in dbInitDmap()
3783 memset(&dp->pmap[w], 0, nw * 4); in dbInitDmap()
3806 dp->wmap[w] = dp->pmap[w] = cpu_to_le32(ONES >> b); in dbInitDmap()
3812 dp->pmap[i] = dp->wmap[i] = cpu_to_le32(ONES); in dbInitDmap()
3818 return (dbInitDmapTree(dp)); in dbInitDmap()
3836 static int dbInitDmapTree(struct dmap * dp) in dbInitDmapTree() argument
3843 tp = &dp->tree; in dbInitDmapTree()
3856 *cp++ = dbMaxBud((u8 *) & dp->wmap[i]); in dbInitDmapTree()