dmtree_t           76 fs/jfs/jfs_dmap.c static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
dmtree_t           77 fs/jfs/jfs_dmap.c static int dbBackSplit(dmtree_t * tp, int leafno);
dmtree_t           78 fs/jfs/jfs_dmap.c static int dbJoin(dmtree_t * tp, int leafno, int newval);
dmtree_t           79 fs/jfs/jfs_dmap.c static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
dmtree_t          100 fs/jfs/jfs_dmap.c static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
dmtree_t         1655 fs/jfs/jfs_dmap.c 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);
dmtree_t         1903 fs/jfs/jfs_dmap.c 	if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx))
dmtree_t         2039 fs/jfs/jfs_dmap.c 			dbBackSplit((dmtree_t *) & dp->tree, word);
dmtree_t         2074 fs/jfs/jfs_dmap.c 	dmtree_t *tp = (dmtree_t *) & dp->tree;
dmtree_t         2221 fs/jfs/jfs_dmap.c 	dmtree_t *tp = (dmtree_t *) & dp->tree;
dmtree_t         2458 fs/jfs/jfs_dmap.c 			rc = dbBackSplit((dmtree_t *) dcp, leafno);
dmtree_t         2463 fs/jfs/jfs_dmap.c 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);
dmtree_t         2465 fs/jfs/jfs_dmap.c 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);
dmtree_t         2493 fs/jfs/jfs_dmap.c 					dbJoin((dmtree_t *) dcp, leafno,
dmtree_t         2503 fs/jfs/jfs_dmap.c 						dbBackSplit((dmtree_t *)
dmtree_t         2505 fs/jfs/jfs_dmap.c 					dbSplit((dmtree_t *) dcp, leafno,
dmtree_t         2555 fs/jfs/jfs_dmap.c static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)
dmtree_t         2620 fs/jfs/jfs_dmap.c static int dbBackSplit(dmtree_t * tp, int leafno)
dmtree_t         2699 fs/jfs/jfs_dmap.c static int dbJoin(dmtree_t * tp, int leafno, int newval)
dmtree_t         2793 fs/jfs/jfs_dmap.c static void dbAdjTree(dmtree_t * tp, int leafno, int newval)
dmtree_t         2867 fs/jfs/jfs_dmap.c static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx)