Lines Matching defs:dcp
118 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i);
1368 struct dmapctl *dcp;
1426 dcp = (struct dmapctl *) mp->data;
1427 budmin = dcp->budmin;
1429 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1456 if (l2nb > dcp->stree[ti])
1465 if (l2nb <= dcp->stree[m + n]) {
1489 ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;
1624 struct dmapctl *dcp;
1641 dcp = (struct dmapctl *) mp->data;
1642 budmin = dcp->budmin;
1644 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1656 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);
2408 struct dmapctl *dcp;
2418 dcp = (struct dmapctl *) mp->data;
2420 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
2430 leafno = BLKTOCTLLEAF(blkno, dcp->budmin);
2431 ti = leafno + le32_to_cpu(dcp->leafidx);
2436 oldval = dcp->stree[ti];
2437 oldroot = dcp->stree[ROOT];
2459 rc = dbBackSplit((dmtree_t *) dcp, leafno);
2462 oldval = dcp->stree[ti];
2464 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);
2466 rc = dbJoin((dmtree_t *) dcp, leafno, newval);
2478 if (dcp->stree[ROOT] != oldroot) {
2487 dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,
2494 dbJoin((dmtree_t *) dcp, leafno,
2503 if (dcp->stree[ti] == NOFREE)
2505 dcp, leafno);
2506 dbSplit((dmtree_t *) dcp, leafno,
2507 dcp->budmin, oldval);
2526 bmp->db_maxfreebud = dcp->stree[ROOT];
3870 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i)
3874 dcp->nleafs = cpu_to_le32(LPERCTL);
3875 dcp->l2nleafs = cpu_to_le32(L2LPERCTL);
3876 dcp->leafidx = cpu_to_le32(CTLLEAFIND);
3877 dcp->height = cpu_to_le32(5);
3878 dcp->budmin = L2BPERDMAP + L2LPERCTL * level;
3885 cp = &dcp->stree[CTLLEAFIND + i];
3890 return (dbInitTree((struct dmaptree *) dcp));