fs/jfs/jfs_dmap.c

1717

rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);

fs/jfs/jfs_dmap.c

1969

if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false))

fs/jfs/jfs_dmap.c

2108

dbBackSplit((dmtree_t *)&dp->tree, word, false);

fs/jfs/jfs_dmap.c

2143

dmtree_t *tp = (dmtree_t *) & dp->tree;

fs/jfs/jfs_dmap.c

2290

dmtree_t *tp = (dmtree_t *) & dp->tree;

fs/jfs/jfs_dmap.c

2526

rc = dbBackSplit((dmtree_t *)dcp, leafno, true);

fs/jfs/jfs_dmap.c

2533

dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);

fs/jfs/jfs_dmap.c

2535

rc = dbJoin((dmtree_t *) dcp, leafno, newval, true);

fs/jfs/jfs_dmap.c

2565

dbJoin((dmtree_t *) dcp, leafno,

fs/jfs/jfs_dmap.c

2575

dbBackSplit((dmtree_t *)

fs/jfs/jfs_dmap.c

2577

dbSplit((dmtree_t *) dcp, leafno,

fs/jfs/jfs_dmap.c

2626

static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl)

fs/jfs/jfs_dmap.c

2691

static int dbBackSplit(dmtree_t *tp, int leafno, bool is_ctl)

fs/jfs/jfs_dmap.c

2770

static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl)

fs/jfs/jfs_dmap.c

2864

static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl)

fs/jfs/jfs_dmap.c

2947

static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl)

fs/jfs/jfs_dmap.c

66

static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl);

fs/jfs/jfs_dmap.c

67

static int dbBackSplit(dmtree_t *tp, int leafno, bool is_ctl);

fs/jfs/jfs_dmap.c

68

static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl);

fs/jfs/jfs_dmap.c

69

static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl);

fs/jfs/jfs_dmap.c

90

static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);