fs/ntfs3/bitmap.c

1031

e = rb_entry(cr, struct e_node, start.node);

fs/ntfs3/bitmap.c

1046

e = pr ? rb_entry(pr, struct e_node, start.node) : NULL;

fs/ntfs3/bitmap.c

1077

e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node);

fs/ntfs3/bitmap.c

137

rb_entry(node, struct e_node, start.node));

fs/ntfs3/bitmap.c

167

static inline bool rb_insert_count(struct rb_root *root, struct e_node *e)

fs/ntfs3/bitmap.c

175

struct e_node *k =

fs/ntfs3/bitmap.c

176

rb_entry(parent = *p, struct e_node, count.node);

fs/ntfs3/bitmap.c

200

static inline bool rb_insert_start(struct rb_root *root, struct e_node *e)

fs/ntfs3/bitmap.c

207

struct e_node *k;

fs/ntfs3/bitmap.c

211

k = rb_entry(parent, struct e_node, start.node);

fs/ntfs3/bitmap.c

234

struct e_node *e, *e0 = NULL;

fs/ntfs3/bitmap.c

252

e = rb_entry(n, struct e_node, start.node);

fs/ntfs3/bitmap.c

268

e = rb_entry(n, struct e_node, start.node);

fs/ntfs3/bitmap.c

320

e = rb_entry(n, struct e_node, count.node);

fs/ntfs3/bitmap.c

325

struct e_node *e2;

fs/ntfs3/bitmap.c

328

e2 = rb_entry(n, struct e_node, count.node);

fs/ntfs3/bitmap.c

365

struct e_node *e, *e3;

fs/ntfs3/bitmap.c

375

e = rb_entry(n, struct e_node, start.node);

fs/ntfs3/bitmap.c

395

e3 = rb_entry(n3, struct e_node, start.node);

fs/ntfs3/bitmap.c

421

n3 ? rb_entry(n3, struct e_node, count.node)->count.key :

fs/ntfs3/bitmap.c

436

e3 = rb_entry(n3, struct e_node, count.node);

fs/ntfs3/bitmap.c

44

sizeof(struct e_node), 0,

fs/ntfs3/bitmap.c

466

e = rb_entry(rb_last(&wnd->count_tree), struct e_node,

fs/ntfs3/bitmap.c

892

struct e_node *e;

fs/ntfs3/bitmap.c

901

e = rb_entry(n, struct e_node, start.node);

fs/ntfs3/bitmap.c

929

struct e_node *e;

fs/ntfs3/bitmap.c

939

e = rb_entry(n, struct e_node, start.node);

fs/ntfs3/bitmap.c

984

const struct e_node *e;