fs/jfs/jfs_dtree.c

111

#define DT_PAGE(IP, MP) BT_PAGE(IP, MP, dtpage_t, i_dtroot)

fs/jfs/jfs_dtree.c

116

BT_GETPAGE(IP, BN, MP, dtpage_t, SIZE, P, RC, i_dtroot); \

fs/jfs/jfs_dtree.c

1327

struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rpxdp)

fs/jfs/jfs_dtree.c

1331

dtpage_t *sp;

fs/jfs/jfs_dtree.c

1333

dtpage_t *rp; /* new right page allocated */

fs/jfs/jfs_dtree.c

1336

dtpage_t *p;

fs/jfs/jfs_dtree.c

135

BT_GETSEARCH(IP, LEAF, BN, MP, dtpage_t, P, INDEX, i_dtroot)

fs/jfs/jfs_dtree.c

1383

rp = (dtpage_t *) rmp->data;

fs/jfs/jfs_dtree.c

144

struct metapage ** rmpp, dtpage_t ** rpp, pxd_t * rxdp);

fs/jfs/jfs_dtree.c

153

dtpage_t * fp, struct btstack * btstack);

fs/jfs/jfs_dtree.c

155

static int dtRelink(tid_t tid, struct inode *ip, dtpage_t * p);

fs/jfs/jfs_dtree.c

162

static int dtCompare(struct component_name * key, dtpage_t * p, int si);

fs/jfs/jfs_dtree.c

164

static int ciCompare(struct component_name * key, dtpage_t * p, int si,

fs/jfs/jfs_dtree.c

1644

dtpage_t *sp, *pp;

fs/jfs/jfs_dtree.c

167

static void dtGetKey(dtpage_t * p, int i, struct component_name * key,

fs/jfs/jfs_dtree.c

170

static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp,

fs/jfs/jfs_dtree.c

173

static void dtInsertEntry(dtpage_t * p, int index, struct component_name * key,

fs/jfs/jfs_dtree.c

176

static void dtMoveEntry(dtpage_t * sp, int si, dtpage_t * dp,

fs/jfs/jfs_dtree.c

180

static void dtDeleteEntry(dtpage_t * p, int fi, struct dt_lock ** dtlock);

fs/jfs/jfs_dtree.c

182

static void dtTruncateEntry(dtpage_t * p, int ti, struct dt_lock ** dtlock);

fs/jfs/jfs_dtree.c

184

static void dtLinelockFreelist(dtpage_t * p, int m, struct dt_lock ** dtlock);

fs/jfs/jfs_dtree.c

1878

dtpage_t *rp;

fs/jfs/jfs_dtree.c

2084

dtpage_t *p;

fs/jfs/jfs_dtree.c

2095

dtpage_t *np;

fs/jfs/jfs_dtree.c

2234

struct metapage * fmp, dtpage_t * fp, struct btstack * btstack)

fs/jfs/jfs_dtree.c

2238

dtpage_t *p;

fs/jfs/jfs_dtree.c

2445

static int dtRelink(tid_t tid, struct inode *ip, dtpage_t * p)

fs/jfs/jfs_dtree.c

2624

dtpage_t *p;

fs/jfs/jfs_dtree.c

2727

dtpage_t *p;

fs/jfs/jfs_dtree.c

3066

dtpage_t *p;

fs/jfs/jfs_dtree.c

3150

dtpage_t *p;

fs/jfs/jfs_dtree.c

3316

dtpage_t * p, /* directory page */

fs/jfs/jfs_dtree.c

3392

dtpage_t * p, /* directory page */

fs/jfs/jfs_dtree.c

3499

static int ciGetLeafPrefixKey(dtpage_t * lp, int li, dtpage_t * rp,

fs/jfs/jfs_dtree.c

3566

static void dtGetKey(dtpage_t * p, int i, /* entry index */

fs/jfs/jfs_dtree.c

3630

static void dtInsertEntry(dtpage_t * p, int index, struct component_name * key,

fs/jfs/jfs_dtree.c

3788

static void dtMoveEntry(dtpage_t * sp, int si, dtpage_t * dp,

fs/jfs/jfs_dtree.c

3989

static void dtDeleteEntry(dtpage_t * p, int fi, struct dt_lock ** dtlock)

fs/jfs/jfs_dtree.c

4084

static void dtTruncateEntry(dtpage_t * p, int ti, struct dt_lock ** dtlock)

fs/jfs/jfs_dtree.c

4164

static void dtLinelockFreelist(dtpage_t * p, /* directory page */

fs/jfs/jfs_dtree.c

4250

dtpage_t *p;

fs/jfs/jfs_dtree.c

575

dtpage_t *p;

fs/jfs/jfs_dtree.c

820

dtpage_t *p; /* base B+-tree index page */

fs/jfs/jfs_dtree.c

932

dtpage_t *sp; /* split page */

fs/jfs/jfs_dtree.c

934

dtpage_t *rp; /* new right page split from sp */

fs/jfs/jfs_dtree.c

937

dtpage_t *lp; /* left child page */

fs/jfs/jfs_imap.c

744

dtpage_t *p, *xp;

fs/jfs/jfs_imap.c

749

p = (dtpage_t *) &jfs_ip->i_dtroot;

fs/jfs/jfs_imap.c

750

xp = (dtpage_t *) & dp->di_dtroot;