Lines Matching refs:dcp
106 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i);
1394 struct dmapctl *dcp;
1451 dcp = (struct dmapctl *) mp->data;
1452 budmin = dcp->budmin;
1454 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1480 if (l2nb > dcp->stree[ti])
1489 if (l2nb <= dcp->stree[m + n]) {
1513 ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;
1756 struct dmapctl *dcp;
1773 dcp = (struct dmapctl *) mp->data;
1774 budmin = dcp->budmin;
1776 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1788 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);
2542 struct dmapctl *dcp;
2552 dcp = (struct dmapctl *) mp->data;
2554 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
2563 leafno = BLKTOCTLLEAF(blkno, dcp->budmin);
2564 ti = leafno + le32_to_cpu(dcp->leafidx);
2569 oldval = dcp->stree[ti];
2570 oldroot = dcp->stree[ROOT];
2592 rc = dbBackSplit((dmtree_t *)dcp, leafno, true);
2595 oldval = dcp->stree[ti];
2597 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);
2599 rc = dbJoin((dmtree_t *) dcp, leafno, newval, true);
2611 if (dcp->stree[ROOT] != oldroot) {
2620 dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,
2627 dbJoin((dmtree_t *) dcp, leafno,
2636 if (dcp->stree[ti] == NOFREE)
2638 dcp, leafno, true);
2639 dbSplit((dmtree_t *) dcp, leafno,
2640 dcp->budmin, oldval, true);
2658 bmp->db_maxfreebud = dcp->stree[ROOT];
4009 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i)
4013 dcp->nleafs = cpu_to_le32(LPERCTL);
4014 dcp->l2nleafs = cpu_to_le32(L2LPERCTL);
4015 dcp->leafidx = cpu_to_le32(CTLLEAFIND);
4016 dcp->height = cpu_to_le32(5);
4017 dcp->budmin = L2BPERDMAP + L2LPERCTL * level;
4024 cp = &dcp->stree[CTLLEAFIND + i];
4029 return (dbInitTree((struct dmaptree *) dcp));