Lines Matching refs:dcp
106 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i);
1326 struct dmapctl *dcp;
1383 dcp = (struct dmapctl *) mp->data;
1384 budmin = dcp->budmin;
1386 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1412 if (l2nb > dcp->stree[ti])
1421 if (l2nb <= dcp->stree[m + n]) {
1445 ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;
1688 struct dmapctl *dcp;
1705 dcp = (struct dmapctl *) mp->data;
1706 budmin = dcp->budmin;
1708 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1720 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);
2474 struct dmapctl *dcp;
2484 dcp = (struct dmapctl *) mp->data;
2486 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
2495 leafno = BLKTOCTLLEAF(blkno, dcp->budmin);
2496 ti = leafno + le32_to_cpu(dcp->leafidx);
2501 oldval = dcp->stree[ti];
2502 oldroot = dcp->stree[ROOT];
2524 rc = dbBackSplit((dmtree_t *)dcp, leafno, true);
2529 oldval = dcp->stree[ti];
2531 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);
2533 rc = dbJoin((dmtree_t *) dcp, leafno, newval, true);
2547 if (dcp->stree[ROOT] != oldroot) {
2556 dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,
2563 dbJoin((dmtree_t *) dcp, leafno,
2572 if (dcp->stree[ti] == NOFREE)
2574 dcp, leafno, true);
2575 dbSplit((dmtree_t *) dcp, leafno,
2576 dcp->budmin, oldval, true);
2594 bmp->db_maxfreebud = dcp->stree[ROOT];
3945 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i)
3949 dcp->nleafs = cpu_to_le32(LPERCTL);
3950 dcp->l2nleafs = cpu_to_le32(L2LPERCTL);
3951 dcp->leafidx = cpu_to_le32(CTLLEAFIND);
3952 dcp->height = cpu_to_le32(5);
3953 dcp->budmin = L2BPERDMAP + L2LPERCTL * level;
3960 cp = &dcp->stree[CTLLEAFIND + i];
3965 return (dbInitTree((struct dmaptree *) dcp));