dmtree_t           66 fs/jfs/jfs_dmap.c static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
dmtree_t           67 fs/jfs/jfs_dmap.c static int dbBackSplit(dmtree_t * tp, int leafno);
dmtree_t           68 fs/jfs/jfs_dmap.c static int dbJoin(dmtree_t * tp, int leafno, int newval);
dmtree_t           69 fs/jfs/jfs_dmap.c static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
dmtree_t           90 fs/jfs/jfs_dmap.c static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
dmtree_t         1750 fs/jfs/jfs_dmap.c 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);
dmtree_t         1997 fs/jfs/jfs_dmap.c 	if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx))
dmtree_t         2133 fs/jfs/jfs_dmap.c 			dbBackSplit((dmtree_t *) & dp->tree, word);
dmtree_t         2168 fs/jfs/jfs_dmap.c 	dmtree_t *tp = (dmtree_t *) & dp->tree;
dmtree_t         2315 fs/jfs/jfs_dmap.c 	dmtree_t *tp = (dmtree_t *) & dp->tree;
dmtree_t         2551 fs/jfs/jfs_dmap.c 			rc = dbBackSplit((dmtree_t *) dcp, leafno);
dmtree_t         2556 fs/jfs/jfs_dmap.c 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);
dmtree_t         2558 fs/jfs/jfs_dmap.c 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);
dmtree_t         2586 fs/jfs/jfs_dmap.c 					dbJoin((dmtree_t *) dcp, leafno,
dmtree_t         2596 fs/jfs/jfs_dmap.c 						dbBackSplit((dmtree_t *)
dmtree_t         2598 fs/jfs/jfs_dmap.c 					dbSplit((dmtree_t *) dcp, leafno,
dmtree_t         2647 fs/jfs/jfs_dmap.c static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)
dmtree_t         2712 fs/jfs/jfs_dmap.c static int dbBackSplit(dmtree_t * tp, int leafno)
dmtree_t         2791 fs/jfs/jfs_dmap.c static int dbJoin(dmtree_t * tp, int leafno, int newval)
dmtree_t         2885 fs/jfs/jfs_dmap.c static void dbAdjTree(dmtree_t * tp, int leafno, int newval)
dmtree_t         2959 fs/jfs/jfs_dmap.c static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx)