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

132

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

fs/jfs/jfs_dtree.c

1324

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

fs/jfs/jfs_dtree.c

1328

dtpage_t *sp;

fs/jfs/jfs_dtree.c

1330

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

fs/jfs/jfs_dtree.c

1333

dtpage_t *p;

fs/jfs/jfs_dtree.c

1380

rp = (dtpage_t *) rmp->data;

fs/jfs/jfs_dtree.c

141

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

fs/jfs/jfs_dtree.c

150

dtpage_t * fp, struct btstack * btstack);

fs/jfs/jfs_dtree.c

152

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

fs/jfs/jfs_dtree.c

159

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

fs/jfs/jfs_dtree.c

161

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

fs/jfs/jfs_dtree.c

164

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

fs/jfs/jfs_dtree.c

1641

dtpage_t *sp, *pp;

fs/jfs/jfs_dtree.c

167

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

fs/jfs/jfs_dtree.c

170

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

fs/jfs/jfs_dtree.c

173

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

fs/jfs/jfs_dtree.c

177

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

fs/jfs/jfs_dtree.c

179

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

fs/jfs/jfs_dtree.c

181

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

fs/jfs/jfs_dtree.c

1875

dtpage_t *rp;

fs/jfs/jfs_dtree.c

2081

dtpage_t *p;

fs/jfs/jfs_dtree.c

2092

dtpage_t *np;

fs/jfs/jfs_dtree.c

2231

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

fs/jfs/jfs_dtree.c

2235

dtpage_t *p;

fs/jfs/jfs_dtree.c

2442

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

fs/jfs/jfs_dtree.c

2621

dtpage_t *p;

fs/jfs/jfs_dtree.c

2724

dtpage_t *p;

fs/jfs/jfs_dtree.c

3063

dtpage_t *p;

fs/jfs/jfs_dtree.c

3147

dtpage_t *p;

fs/jfs/jfs_dtree.c

3313

dtpage_t * p, /* directory page */

fs/jfs/jfs_dtree.c

3389

dtpage_t * p, /* directory page */

fs/jfs/jfs_dtree.c

3496

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

fs/jfs/jfs_dtree.c

3563

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

fs/jfs/jfs_dtree.c

3627

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

fs/jfs/jfs_dtree.c

3785

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

fs/jfs/jfs_dtree.c

3986

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

fs/jfs/jfs_dtree.c

4081

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

fs/jfs/jfs_dtree.c

4161

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

fs/jfs/jfs_dtree.c

4247

dtpage_t *p;

fs/jfs/jfs_dtree.c

4384

bool check_dtpage(dtpage_t *p)

fs/jfs/jfs_dtree.c

572

dtpage_t *p;

fs/jfs/jfs_dtree.c

817

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

fs/jfs/jfs_dtree.c

929

dtpage_t *sp; /* split page */

fs/jfs/jfs_dtree.c

931

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

fs/jfs/jfs_dtree.c

934

dtpage_t *lp; /* left child page */

fs/jfs/jfs_dtree.h

259

extern bool check_dtpage(dtpage_t *p);

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;