leafno             66 fs/jfs/jfs_dmap.c static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
leafno             67 fs/jfs/jfs_dmap.c static int dbBackSplit(dmtree_t * tp, int leafno);
leafno             68 fs/jfs/jfs_dmap.c static int dbJoin(dmtree_t * tp, int leafno, int newval);
leafno             69 fs/jfs/jfs_dmap.c static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
leafno           2502 fs/jfs/jfs_dmap.c 	int rc, leafno, ti;
leafno           2522 fs/jfs/jfs_dmap.c 	leafno = BLKTOCTLLEAF(blkno, dcp->budmin);
leafno           2523 fs/jfs/jfs_dmap.c 	ti = leafno + le32_to_cpu(dcp->leafidx);
leafno           2551 fs/jfs/jfs_dmap.c 			rc = dbBackSplit((dmtree_t *) dcp, leafno);
leafno           2556 fs/jfs/jfs_dmap.c 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);
leafno           2558 fs/jfs/jfs_dmap.c 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);
leafno           2586 fs/jfs/jfs_dmap.c 					dbJoin((dmtree_t *) dcp, leafno,
leafno           2597 fs/jfs/jfs_dmap.c 							    dcp, leafno);
leafno           2598 fs/jfs/jfs_dmap.c 					dbSplit((dmtree_t *) dcp, leafno,
leafno           2647 fs/jfs/jfs_dmap.c static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)
leafno           2655 fs/jfs/jfs_dmap.c 	if (leaf[leafno] > tp->dmt_budmin) {
leafno           2661 fs/jfs/jfs_dmap.c 		cursz = leaf[leafno] - 1;
leafno           2669 fs/jfs/jfs_dmap.c 			dbAdjTree(tp, leafno ^ budsz, cursz);
leafno           2681 fs/jfs/jfs_dmap.c 	dbAdjTree(tp, leafno, newval);
leafno           2712 fs/jfs/jfs_dmap.c static int dbBackSplit(dmtree_t * tp, int leafno)
leafno           2721 fs/jfs/jfs_dmap.c 	assert(leaf[leafno] == NOFREE);
leafno           2731 fs/jfs/jfs_dmap.c 	    LITOL2BSZ(leafno, le32_to_cpu(tp->dmt_l2nleafs),
leafno           2742 fs/jfs/jfs_dmap.c 	while (leaf[leafno] == NOFREE) {
leafno           2745 fs/jfs/jfs_dmap.c 		for (w = leafno, bsz = budsz;; bsz <<= 1,
leafno           2769 fs/jfs/jfs_dmap.c 	if (leaf[leafno] != size) {
leafno           2791 fs/jfs/jfs_dmap.c static int dbJoin(dmtree_t * tp, int leafno, int newval)
leafno           2823 fs/jfs/jfs_dmap.c 			buddy = leafno ^ budsz;
leafno           2843 fs/jfs/jfs_dmap.c 			if (leafno < buddy) {
leafno           2851 fs/jfs/jfs_dmap.c 				dbAdjTree(tp, leafno, NOFREE);
leafno           2852 fs/jfs/jfs_dmap.c 				leafno = buddy;
leafno           2864 fs/jfs/jfs_dmap.c 	dbAdjTree(tp, leafno, newval);
leafno           2885 fs/jfs/jfs_dmap.c static void dbAdjTree(dmtree_t * tp, int leafno, int newval)
leafno           2892 fs/jfs/jfs_dmap.c 	lp = leafno + le32_to_cpu(tp->dmt_leafidx);