dtpage_t 111 fs/jfs/jfs_dtree.c #define DT_PAGE(IP, MP) BT_PAGE(IP, MP, dtpage_t, i_dtroot) dtpage_t 116 fs/jfs/jfs_dtree.c BT_GETPAGE(IP, BN, MP, dtpage_t, SIZE, P, RC, i_dtroot); \ dtpage_t 134 fs/jfs/jfs_dtree.c BT_GETSEARCH(IP, LEAF, BN, MP, dtpage_t, P, INDEX, i_dtroot) dtpage_t 143 fs/jfs/jfs_dtree.c struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rxdp); dtpage_t 152 fs/jfs/jfs_dtree.c dtpage_t * fp, struct btstack * btstack); dtpage_t 154 fs/jfs/jfs_dtree.c static int dtRelink(tid_t tid, struct inode *ip, dtpage_t * p); dtpage_t 161 fs/jfs/jfs_dtree.c static int dtCompare(struct component_name * key, dtpage_t * p, int si); dtpage_t 163 fs/jfs/jfs_dtree.c static int ciCompare(struct component_name * key, dtpage_t * p, int si, dtpage_t 166 fs/jfs/jfs_dtree.c static void dtGetKey(dtpage_t * p, int i, struct component_name * key, dtpage_t 169 fs/jfs/jfs_dtree.c static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp, dtpage_t 172 fs/jfs/jfs_dtree.c static void dtInsertEntry(dtpage_t * p, int index, struct component_name * key, dtpage_t 175 fs/jfs/jfs_dtree.c static void dtMoveEntry(dtpage_t * sp, int si, dtpage_t * dp, dtpage_t 179 fs/jfs/jfs_dtree.c static void dtDeleteEntry(dtpage_t * p, int fi, struct dt_lock ** dtlock); dtpage_t 181 fs/jfs/jfs_dtree.c static void dtTruncateEntry(dtpage_t * p, int ti, struct dt_lock ** dtlock); dtpage_t 183 fs/jfs/jfs_dtree.c static void dtLinelockFreelist(dtpage_t * p, int m, struct dt_lock ** dtlock); dtpage_t 574 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 814 fs/jfs/jfs_dtree.c dtpage_t *p; /* base B+-tree index page */ dtpage_t 924 fs/jfs/jfs_dtree.c dtpage_t *sp; /* split page */ dtpage_t 926 fs/jfs/jfs_dtree.c dtpage_t *rp; /* new right page split from sp */ dtpage_t 929 fs/jfs/jfs_dtree.c dtpage_t *lp; /* left child page */ dtpage_t 1319 fs/jfs/jfs_dtree.c struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rpxdp) dtpage_t 1323 fs/jfs/jfs_dtree.c dtpage_t *sp; dtpage_t 1325 fs/jfs/jfs_dtree.c dtpage_t *rp; /* new right page allocated */ dtpage_t 1328 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 1375 fs/jfs/jfs_dtree.c rp = (dtpage_t *) rmp->data; dtpage_t 1636 fs/jfs/jfs_dtree.c dtpage_t *sp, *pp; dtpage_t 1870 fs/jfs/jfs_dtree.c dtpage_t *rp; dtpage_t 2076 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 2087 fs/jfs/jfs_dtree.c dtpage_t *np; dtpage_t 2226 fs/jfs/jfs_dtree.c struct metapage * fmp, dtpage_t * fp, struct btstack * btstack) dtpage_t 2230 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 2438 fs/jfs/jfs_dtree.c dtpage_t *p, *pp, *rp = 0, *lp= 0; dtpage_t 2636 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 2735 fs/jfs/jfs_dtree.c static int dtRelink(tid_t tid, struct inode *ip, dtpage_t * p) dtpage_t 2914 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3006 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3336 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3413 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3579 fs/jfs/jfs_dtree.c dtpage_t * p, /* directory page */ dtpage_t 3655 fs/jfs/jfs_dtree.c dtpage_t * p, /* directory page */ dtpage_t 3762 fs/jfs/jfs_dtree.c static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp, dtpage_t 3829 fs/jfs/jfs_dtree.c static void dtGetKey(dtpage_t * p, int i, /* entry index */ dtpage_t 3893 fs/jfs/jfs_dtree.c static void dtInsertEntry(dtpage_t * p, int index, struct component_name * key, dtpage_t 4051 fs/jfs/jfs_dtree.c static void dtMoveEntry(dtpage_t * sp, int si, dtpage_t * dp, dtpage_t 4252 fs/jfs/jfs_dtree.c static void dtDeleteEntry(dtpage_t * p, int fi, struct dt_lock ** dtlock) dtpage_t 4347 fs/jfs/jfs_dtree.c static void dtTruncateEntry(dtpage_t * p, int ti, struct dt_lock ** dtlock) dtpage_t 4427 fs/jfs/jfs_dtree.c static void dtLinelockFreelist(dtpage_t * p, /* directory page */ dtpage_t 4513 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 742 fs/jfs/jfs_imap.c dtpage_t *p, *xp; dtpage_t 747 fs/jfs/jfs_imap.c p = (dtpage_t *) &jfs_ip->i_dtroot; dtpage_t 748 fs/jfs/jfs_imap.c xp = (dtpage_t *) & dp->di_dtroot;