dtpage_t 123 fs/jfs/jfs_dtree.c #define DT_PAGE(IP, MP) BT_PAGE(IP, MP, dtpage_t, i_dtroot) dtpage_t 128 fs/jfs/jfs_dtree.c BT_GETPAGE(IP, BN, MP, dtpage_t, SIZE, P, RC, i_dtroot)\ dtpage_t 146 fs/jfs/jfs_dtree.c BT_GETSEARCH(IP, LEAF, BN, MP, dtpage_t, P, INDEX, i_dtroot) dtpage_t 155 fs/jfs/jfs_dtree.c struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rxdp); dtpage_t 164 fs/jfs/jfs_dtree.c dtpage_t * fp, struct btstack * btstack); dtpage_t 166 fs/jfs/jfs_dtree.c static int dtRelink(tid_t tid, struct inode *ip, dtpage_t * p); dtpage_t 173 fs/jfs/jfs_dtree.c static int dtCompare(struct component_name * key, dtpage_t * p, int si); dtpage_t 175 fs/jfs/jfs_dtree.c static int ciCompare(struct component_name * key, dtpage_t * p, int si, dtpage_t 178 fs/jfs/jfs_dtree.c static void dtGetKey(dtpage_t * p, int i, struct component_name * key, dtpage_t 181 fs/jfs/jfs_dtree.c static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp, dtpage_t 184 fs/jfs/jfs_dtree.c static void dtInsertEntry(dtpage_t * p, int index, struct component_name * key, dtpage_t 187 fs/jfs/jfs_dtree.c static void dtMoveEntry(dtpage_t * sp, int si, dtpage_t * dp, dtpage_t 191 fs/jfs/jfs_dtree.c static void dtDeleteEntry(dtpage_t * p, int fi, struct dt_lock ** dtlock); dtpage_t 193 fs/jfs/jfs_dtree.c static void dtTruncateEntry(dtpage_t * p, int ti, struct dt_lock ** dtlock); dtpage_t 195 fs/jfs/jfs_dtree.c static void dtLinelockFreelist(dtpage_t * p, int m, struct dt_lock ** dtlock); dtpage_t 586 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 825 fs/jfs/jfs_dtree.c dtpage_t *p; /* base B+-tree index page */ dtpage_t 935 fs/jfs/jfs_dtree.c dtpage_t *sp; /* split page */ dtpage_t 937 fs/jfs/jfs_dtree.c dtpage_t *rp; /* new right page split from sp */ dtpage_t 940 fs/jfs/jfs_dtree.c dtpage_t *lp; /* left child page */ dtpage_t 1331 fs/jfs/jfs_dtree.c struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rpxdp) dtpage_t 1335 fs/jfs/jfs_dtree.c dtpage_t *sp; dtpage_t 1337 fs/jfs/jfs_dtree.c dtpage_t *rp; /* new right page allocated */ dtpage_t 1340 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 1386 fs/jfs/jfs_dtree.c rp = (dtpage_t *) rmp->data; dtpage_t 1647 fs/jfs/jfs_dtree.c dtpage_t *sp, *pp; dtpage_t 1881 fs/jfs/jfs_dtree.c dtpage_t *rp; dtpage_t 2085 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 2096 fs/jfs/jfs_dtree.c dtpage_t *np; dtpage_t 2235 fs/jfs/jfs_dtree.c struct metapage * fmp, dtpage_t * fp, struct btstack * btstack) dtpage_t 2239 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 2447 fs/jfs/jfs_dtree.c dtpage_t *p, *pp, *rp = 0, *lp= 0; dtpage_t 2645 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 2744 fs/jfs/jfs_dtree.c static int dtRelink(tid_t tid, struct inode *ip, dtpage_t * p) dtpage_t 2923 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3015 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3338 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3415 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 3581 fs/jfs/jfs_dtree.c dtpage_t * p, /* directory page */ dtpage_t 3657 fs/jfs/jfs_dtree.c dtpage_t * p, /* directory page */ dtpage_t 3764 fs/jfs/jfs_dtree.c static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp, dtpage_t 3831 fs/jfs/jfs_dtree.c static void dtGetKey(dtpage_t * p, int i, /* entry index */ dtpage_t 3895 fs/jfs/jfs_dtree.c static void dtInsertEntry(dtpage_t * p, int index, struct component_name * key, dtpage_t 4053 fs/jfs/jfs_dtree.c static void dtMoveEntry(dtpage_t * sp, int si, dtpage_t * dp, dtpage_t 4254 fs/jfs/jfs_dtree.c static void dtDeleteEntry(dtpage_t * p, int fi, struct dt_lock ** dtlock) dtpage_t 4349 fs/jfs/jfs_dtree.c static void dtTruncateEntry(dtpage_t * p, int ti, struct dt_lock ** dtlock) dtpage_t 4429 fs/jfs/jfs_dtree.c static void dtLinelockFreelist(dtpage_t * p, /* directory page */ dtpage_t 4515 fs/jfs/jfs_dtree.c dtpage_t *p; dtpage_t 761 fs/jfs/jfs_imap.c dtpage_t *p, *xp; dtpage_t 766 fs/jfs/jfs_imap.c p = (dtpage_t *) &jfs_ip->i_dtroot; dtpage_t 767 fs/jfs/jfs_imap.c xp = (dtpage_t *) & dp->di_dtroot;