Lines Matching defs:level
25 * level and move up through the dmap control pages (i.e.
29 * level and work down towards the dmaps.
35 * as it works it way up from a single dmap to the required level
48 * free block count, allocation group level free block counts).
71 int level);
89 static int dbFindCtl(struct bmap * bmp, int l2nb, int level, s64 * blkno);
106 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i);
1345 * search at the highest dmap control page level which
1347 * (i.e. the highest level at which the allocation group's
1349 * in addition, we start the search within this level at a
1358 * move the search to the next lower level dmap control page
1365 * group and attempt the allocation at this level.
1463 * control page at the control page level (i.e. L0, L1, L2) that
1472 * group may be described by 1 or 2 subtrees within the ag level
1516 * the next level of dmap control pages.
1521 * level dmap control pages. we need to if the number of
1523 * described at the next lower level.
1527 /* search the lower level dmap control pages to get
1571 * highest level (i.e. L0, L1, L2) control page. if free space
1594 /* starting with the top level dmap control page, search
1727 * FUNCTION: starting at a specified dmap control page level and block
1739 * level - starting dmap control page level.
1752 static int dbFindCtl(struct bmap * bmp, int l2nb, int level, s64 * blkno)
1760 /* starting at the specified dmap control page level and block
1765 for (lev = level, b = *blkno; lev >= 0; lev--) {
1767 * number and level (i.e. L0, L1, L2).
1797 if (lev != level) {
1811 /* we stop the search at this dmap control page level if
1814 * (lower) level.
1831 * this routine is called by higher level routines that search
2107 * if the adjustment of the upper level control pages fails,
2162 * if the adjustment of the upper level control pages fails,
2497 * FUNCTION: adjust a dmap control page at a specified level to reflect
2498 * the change in a lower level dmap or dmap control page's
2500 * of the lower level object's dmtree) due to the allocation
2504 * the lower level dmap or dmap control page root and the
2515 * control level by a recursive call to this routine, specifying
2516 * the new root value and the next dmap control page level to
2523 * newval - the new value of the lower level dmap or dmap control
2526 * level - current level of dmap control page (i.e. L0, L1, L2) to
2536 dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc, int level)
2546 * block number and control page level.
2548 lblkno = BLKTOCTL(blkno, bmp->db_l2nbperpage, level);
2566 /* save the current leaf value and the current root level (i.e.
2606 * the current top level (i.e. L0, L1, L2) of the map. if so (i.e.
2607 * root changed and this is not the top level), call this routine
2608 * again (recursion) for the next higher level of the mapping to
2612 /* are we below the top level of the map. if so,
2613 * bubble the root up to the next higher level.
2615 if (level < bmp->db_maxlevel) {
2617 * the next level.
2621 level + 1))) {
2649 /* we're at the top level of the map. update
2653 assert(level == bmp->db_maxlevel);
2880 * a join at the next higher level while the right
3020 * starting at the next level for the leftmost leaf that
3025 /* search the four nodes at this level, starting from
3030 * level (or quit if this is the last level).
3396 * if the adjustment of the upper level control pages fails,
3501 * update bit maps and corresponding level control pages;
3751 * at agheight level height (from leaf) with agwidth number of nodes
3923 * configure binary buddy system at the leaf level, then
3979 * Starting at the leaf node level, the four nodes described by
3980 * the higher level parent node are compared for a maximum free and
3982 * when all lower level nodes are processed in this fashion then
3983 * move up to the next level (parent becomes a lower level node) and
3984 * continue the process for that level.
3989 /* get index of 1st node of parent level */
3993 * of the four nodes of the current level.
4009 static int dbInitDmapCtl(struct dmapctl * dcp, int level, int i)
4017 dcp->budmin = L2BPERDMAP + L2LPERCTL * level;
4020 * initialize the leaves of current level that were not covered
4022 * low level dmapctl or dmap).
4078 * maximum number of map pages at each level including control pages
4084 * convert number of map pages to the zero origin top dmapctl level
4095 int level, i;
4100 level = BMAPPGTOLEV(npages);
4102 /* At each level, accumulate the number of dmap pages covered by
4104 * repeat for the last incomplete child level.
4108 /* skip higher level control pages above top level covered by map */
4109 npages -= (2 - level);
4110 npages--; /* skip top level's control page */
4111 for (i = level; i >= 0; i--) {
4120 /* skip incomplete child's level control page */