drivers/md/bcache/bcache.h

223

struct btree;

drivers/md/bcache/bcache.h

280

int (*cache_miss)(struct btree *b, struct search *s,

drivers/md/bcache/bcache.h

671

struct btree *root;

drivers/md/bcache/bcache.h

674

struct btree *verify_data;

drivers/md/bcache/btree.c

1005

struct btree *bch_btree_node_get(struct cache_set *c, struct btree_op *op,

drivers/md/bcache/btree.c

1007

struct btree *parent)

drivers/md/bcache/btree.c

1010

struct btree *b;

drivers/md/bcache/btree.c

1062

static void btree_node_prefetch(struct btree *parent, struct bkey *k)

drivers/md/bcache/btree.c

1064

struct btree *b;

drivers/md/bcache/btree.c

107

static inline struct bset *write_block(struct btree *b)

drivers/md/bcache/btree.c

1079

static void btree_node_free(struct btree *b)

drivers/md/bcache/btree.c

1119

struct btree *__bch_btree_node_alloc(struct cache_set *c, struct btree_op *op,

drivers/md/bcache/btree.c

112

static void bch_btree_init_next(struct btree *b)

drivers/md/bcache/btree.c

1121

struct btree *parent)

drivers/md/bcache/btree.c

1124

struct btree *b;

drivers/md/bcache/btree.c

1162

static struct btree *bch_btree_node_alloc(struct cache_set *c,

drivers/md/bcache/btree.c

1164

struct btree *parent)

drivers/md/bcache/btree.c

1169

static struct btree *btree_node_alloc_replacement(struct btree *b,

drivers/md/bcache/btree.c

1172

struct btree *n = bch_btree_node_alloc(b->c, op, b->level, b->parent);

drivers/md/bcache/btree.c

1184

static void make_btree_freeing_key(struct btree *b, struct bkey *k)

drivers/md/bcache/btree.c

1203

static int btree_check_reserve(struct btree *b, struct btree_op *op)

drivers/md/bcache/btree.c

1305

static bool btree_gc_mark_node(struct btree *b, struct gc_stat *gc)

drivers/md/bcache/btree.c

1350

struct btree *b;

drivers/md/bcache/btree.c

1354

static int bch_btree_insert_node(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

1359

static int btree_gc_coalesce(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

1363

struct btree *new_nodes[GC_MERGE_NODES];

drivers/md/bcache/btree.c

139

static uint64_t btree_csum_set(struct btree *b, struct bset *i)

drivers/md/bcache/btree.c

148

void bch_btree_node_read_done(struct btree *b)

drivers/md/bcache/btree.c

1530

static int btree_gc_rewrite_node(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

1531

struct btree *replace)

drivers/md/bcache/btree.c

1534

struct btree *n;

drivers/md/bcache/btree.c

1568

static unsigned int btree_gc_count_keys(struct btree *b)

drivers/md/bcache/btree.c

1606

static int btree_gc_recurse(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

1696

static int bch_btree_gc_root(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

1699

struct btree *n = NULL;

drivers/md/bcache/btree.c

1913

static int bch_btree_check_recurse(struct btree *b, struct btree_op *op)

drivers/md/bcache/btree.c

2163

static bool btree_insert_key(struct btree *b, struct bkey *k,

drivers/md/bcache/btree.c

2182

static size_t insert_u64s_remaining(struct btree *b)

drivers/md/bcache/btree.c

2195

static bool bch_btree_insert_keys(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

2237

static int btree_split(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

2242

struct btree *n1, *n2 = NULL, *n3 = NULL;

drivers/md/bcache/btree.c

2371

static int bch_btree_insert_node(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

2427

int bch_btree_insert_check_key(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

243

static void bch_btree_node_read(struct btree *b)

drivers/md/bcache/btree.c

2472

static int btree_insert_fn(struct btree_op *b_op, struct btree *b)

drivers/md/bcache/btree.c

2519

void bch_btree_set_root(struct btree *b)

drivers/md/bcache/btree.c

2545

static int bch_btree_map_nodes_recurse(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

2580

int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.c

2641

static int refill_keybuf_fn(struct btree_op *op, struct btree *b,

drivers/md/bcache/btree.c

281

static void btree_complete_write(struct btree *b, struct btree_write *w)

drivers/md/bcache/btree.c

298

closure_type(b, struct btree, io);

drivers/md/bcache/btree.c

305

closure_type(b, struct btree, io);

drivers/md/bcache/btree.c

320

closure_type(b, struct btree, io);

drivers/md/bcache/btree.c

329

struct btree *b = container_of(cl, struct btree, io);

drivers/md/bcache/btree.c

338

static void do_btree_node_write(struct btree *b)

drivers/md/bcache/btree.c

403

void __bch_btree_node_write(struct btree *b, struct closure *parent)

drivers/md/bcache/btree.c

434

void bch_btree_node_write(struct btree *b, struct closure *parent)

drivers/md/bcache/btree.c

452

static void bch_btree_node_write_sync(struct btree *b)

drivers/md/bcache/btree.c

467

struct btree *b = container_of(to_delayed_work(w), struct btree, work);

drivers/md/bcache/btree.c

475

static void bch_btree_leaf_dirty(struct btree *b, atomic_t *journal_ref)

drivers/md/bcache/btree.c

524

static void mca_data_free(struct btree *b)

drivers/md/bcache/btree.c

534

static void mca_bucket_free(struct btree *b)

drivers/md/bcache/btree.c

548

static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)

drivers/md/bcache/btree.c

566

const struct btree *a = container_of(_a, struct btree, lock.dep_map);

drivers/md/bcache/btree.c

567

const struct btree *b = container_of(_b, struct btree, lock.dep_map);

drivers/md/bcache/btree.c

574

const struct btree *b = container_of(map, struct btree, lock.dep_map);

drivers/md/bcache/btree.c

581

static struct btree *mca_bucket_alloc(struct cache_set *c,

drivers/md/bcache/btree.c

588

struct btree *b = kzalloc_obj(struct btree, gfp);

drivers/md/bcache/btree.c

606

static int mca_reap(struct btree *b, unsigned int min_order, bool flush)

drivers/md/bcache/btree.c

669

struct btree *b, *t;

drivers/md/bcache/btree.c

748

struct btree *b;

drivers/md/bcache/btree.c

769

b = list_first_entry(&c->btree_cache, struct btree, list);

drivers/md/bcache/btree.c

785

struct btree, list);

drivers/md/bcache/btree.c

853

static struct btree *mca_find(struct cache_set *c, struct bkey *k)

drivers/md/bcache/btree.c

855

struct btree *b;

drivers/md/bcache/btree.c

884

static struct btree *mca_cannibalize(struct cache_set *c, struct btree_op *op,

drivers/md/bcache/btree.c

887

struct btree *b;

drivers/md/bcache/btree.c

922

static struct btree *mca_alloc(struct cache_set *c, struct btree_op *op,

drivers/md/bcache/btree.c

925

struct btree *b;

drivers/md/bcache/btree.h

127

struct btree *parent;

drivers/md/bcache/btree.h

152

static inline bool btree_node_ ## flag(struct btree *b) \

drivers/md/bcache/btree.h

155

static inline void set_btree_node_ ## flag(struct btree *b) \

drivers/md/bcache/btree.h

170

static inline struct btree_write *btree_current_write(struct btree *b)

drivers/md/bcache/btree.h

175

static inline struct btree_write *btree_prev_write(struct btree *b)

drivers/md/bcache/btree.h

180

static inline struct bset *btree_bset_first(struct btree *b)

drivers/md/bcache/btree.h

185

static inline struct bset *btree_bset_last(struct btree *b)

drivers/md/bcache/btree.h

190

static inline unsigned int bset_block_offset(struct btree *b, struct bset *i)

drivers/md/bcache/btree.h

248

static inline void rw_lock(bool w, struct btree *b, int level)

drivers/md/bcache/btree.h

256

static inline void rw_unlock(bool w, struct btree *b)

drivers/md/bcache/btree.h

263

void bch_btree_node_read_done(struct btree *b);

drivers/md/bcache/btree.h

264

void __bch_btree_node_write(struct btree *b, struct closure *parent);

drivers/md/bcache/btree.h

265

void bch_btree_node_write(struct btree *b, struct closure *parent);

drivers/md/bcache/btree.h

267

void bch_btree_set_root(struct btree *b);

drivers/md/bcache/btree.h

268

struct btree *__bch_btree_node_alloc(struct cache_set *c, struct btree_op *op,

drivers/md/bcache/btree.h

270

struct btree *parent);

drivers/md/bcache/btree.h

271

struct btree *bch_btree_node_get(struct cache_set *c, struct btree_op *op,

drivers/md/bcache/btree.h

273

struct btree *parent);

drivers/md/bcache/btree.h

275

int bch_btree_insert_check_key(struct btree *b, struct btree_op *op,

drivers/md/bcache/btree.h

332

struct btree *_child = bch_btree_node_get((b)->c, op, key, l, \

drivers/md/bcache/btree.h

352

struct btree *_b = (c)->root; \

drivers/md/bcache/btree.h

377

typedef int (btree_map_nodes_fn)(struct btree_op *b_op, struct btree *b);

drivers/md/bcache/btree.h

395

typedef int (btree_map_keys_fn)(struct btree_op *op, struct btree *b,

drivers/md/bcache/btree.h

399

int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op,

drivers/md/bcache/debug.c

31

void bch_btree_verify(struct btree *b)

drivers/md/bcache/debug.c

33

struct btree *v = b->c->verify_data;

drivers/md/bcache/debug.h

11

void bch_btree_verify(struct btree *b);

drivers/md/bcache/debug.h

20

static inline void bch_btree_verify(struct btree *b) {}

drivers/md/bcache/extents.c

128

struct btree *b = container_of(keys, struct btree, keys);

drivers/md/bcache/extents.c

168

struct btree *b = container_of(bk, struct btree, keys);

drivers/md/bcache/extents.c

173

static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k)

drivers/md/bcache/extents.c

207

struct btree *b = container_of(bk, struct btree, keys);

drivers/md/bcache/extents.c

232

struct btree *b = container_of(bk, struct btree, keys);

drivers/md/bcache/extents.c

328

struct cache_set *c = container_of(b, struct btree, keys)->c;

drivers/md/bcache/extents.c

502

struct btree *b = container_of(bk, struct btree, keys);

drivers/md/bcache/extents.c

507

static bool bch_extent_bad_expensive(struct btree *b, const struct bkey *k,

drivers/md/bcache/extents.c

539

struct btree *b = container_of(bk, struct btree, keys);

drivers/md/bcache/extents.c

585

struct btree *b = container_of(bk, struct btree, keys);

drivers/md/bcache/journal.c

402

struct btree *b, *t, *btree_nodes[BTREE_FLUSH_NR];

drivers/md/bcache/request.c

1252

static int flash_dev_cache_miss(struct btree *b, struct search *s,

drivers/md/bcache/request.c

527

static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k)

drivers/md/bcache/request.c

892

static int cached_dev_cache_miss(struct btree *b, struct search *s,

drivers/md/bcache/super.c

1718

struct btree *b;

drivers/md/bcache/sysfs.c

621

static int bch_btree_bset_stats(struct btree_op *b_op, struct btree *b)

drivers/md/bcache/sysfs.c

661

struct btree *b;

drivers/md/bcache/sysfs.c

684

struct btree *b;

drivers/md/bcache/writeback.c

852

static int sectors_dirty_init_fn(struct btree_op *_op, struct btree *b,

drivers/md/bcache/writeback.c

979

struct btree *b = NULL;

fs/hpfs/alloc.c

466

f->btree.n_free_nodes = 8;

fs/hpfs/alloc.c

467

f->btree.first_free = cpu_to_le16(8);

fs/hpfs/alloc.c

483

a->btree.n_free_nodes = 40;

fs/hpfs/alloc.c

484

a->btree.n_used_nodes = 0;

fs/hpfs/alloc.c

485

a->btree.first_free = cpu_to_le16(8);

fs/hpfs/anode.c

101

le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length), fsecno,

fs/hpfs/anode.c

106

if (hpfs_alloc_if_possible(s, se = le32_to_cpu(btree->u.external[n].disk_secno) + le32_to_cpu(btree->u.external[n].length))) {

fs/hpfs/anode.c

107

le32_add_cpu(&btree->u.external[n].length, 1);

fs/hpfs/anode.c

124

fs = n < 0 ? 0 : le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length);

fs/hpfs/anode.c

125

if (!btree->n_free_nodes) {

fs/hpfs/anode.c

134

anode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

135

anode->btree.n_used_nodes = btree->n_used_nodes;

fs/hpfs/anode.c

136

anode->btree.first_free = btree->first_free;

fs/hpfs/anode.c

137

anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;

fs/hpfs/anode.c

138

memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);

fs/hpfs/anode.c

139

btree->flags |= BP_internal;

fs/hpfs/anode.c

140

btree->n_free_nodes = 11;

fs/hpfs/anode.c

141

btree->n_used_nodes = 1;

fs/hpfs/anode.c

142

btree->first_free = cpu_to_le16((char *)&(btree->u.internal[1]) - (char *)btree);

fs/hpfs/anode.c

143

btree->u.internal[0].file_secno = cpu_to_le32(-1);

fs/hpfs/anode.c

144

btree->u.internal[0].down = cpu_to_le32(na);

fs/hpfs/anode.c

15

struct bplus_header *btree, unsigned sec,

fs/hpfs/anode.c

155

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

157

btree->n_free_nodes--; n = btree->n_used_nodes++;

fs/hpfs/anode.c

158

le16_add_cpu(&btree->first_free, 12);

fs/hpfs/anode.c

159

btree->u.external[n].disk_secno = cpu_to_le32(se);

fs/hpfs/anode.c

160

btree->u.external[n].file_secno = cpu_to_le32(fs);

fs/hpfs/anode.c

161

btree->u.external[n].length = cpu_to_le32(1);

fs/hpfs/anode.c

172

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

175

btree = GET_BTREE_PTR(&fnode->btree);

fs/hpfs/anode.c

177

if (btree->n_free_nodes) {

fs/hpfs/anode.c

178

btree->n_free_nodes--; n = btree->n_used_nodes++;

fs/hpfs/anode.c

179

le16_add_cpu(&btree->first_free, 8);

fs/hpfs/anode.c

180

btree->u.internal[n].file_secno = cpu_to_le32(-1);

fs/hpfs/anode.c

181

btree->u.internal[n].down = cpu_to_le32(na);

fs/hpfs/anode.c

182

btree->u.internal[n-1].file_secno = cpu_to_le32(fs);

fs/hpfs/anode.c

190

anode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

192

anode->btree.flags &= ~BP_fnode_parent;

fs/hpfs/anode.c

199

btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/*fs*/-1);

fs/hpfs/anode.c

206

anode->btree.flags |= BP_internal;

fs/hpfs/anode.c

207

anode->btree.n_used_nodes = 1;

fs/hpfs/anode.c

208

anode->btree.n_free_nodes = 59;

fs/hpfs/anode.c

209

anode->btree.first_free = cpu_to_le16(16);

fs/hpfs/anode.c

210

GET_BTREE_PTR(&anode->btree)->u.internal[0].down = cpu_to_le32(a);

fs/hpfs/anode.c

211

GET_BTREE_PTR(&anode->btree)->u.internal[0].file_secno = cpu_to_le32(-1);

fs/hpfs/anode.c

224

anode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

233

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

239

btree = GET_BTREE_PTR(&fnode->btree);

fs/hpfs/anode.c

24

if (bp_internal(btree)) {

fs/hpfs/anode.c

242

memcpy(&ranode->btree, btree, le16_to_cpu(btree->first_free));

fs/hpfs/anode.c

244

ranode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

245

GET_BTREE_PTR(&ranode->btree)->n_free_nodes = (bp_internal(GET_BTREE_PTR(&ranode->btree)) ? 60 : 40) - GET_BTREE_PTR(&ranode->btree)->n_used_nodes;

fs/hpfs/anode.c

246

if (bp_internal(GET_BTREE_PTR(&ranode->btree))) for (n = 0; n < GET_BTREE_PTR(&ranode->btree)->n_used_nodes; n++) {

fs/hpfs/anode.c

25

for (i = 0; i < btree->n_used_nodes; i++)

fs/hpfs/anode.c

250

unode->btree.flags &= ~BP_fnode_parent;

fs/hpfs/anode.c

255

btree->flags |= BP_internal;

fs/hpfs/anode.c

256

btree->n_free_nodes = fnod ? 10 : 58;

fs/hpfs/anode.c

257

btree->n_used_nodes = 2;

fs/hpfs/anode.c

258

btree->first_free = cpu_to_le16((char *)&btree->u.internal[2] - (char *)btree);

fs/hpfs/anode.c

259

btree->u.internal[0].file_secno = cpu_to_le32(fs);

fs/hpfs/anode.c

26

if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) {

fs/hpfs/anode.c

260

btree->u.internal[0].down = cpu_to_le32(ra);

fs/hpfs/anode.c

261

btree->u.internal[1].file_secno = cpu_to_le32(-1);

fs/hpfs/anode.c

262

btree->u.internal[1].down = cpu_to_le32(na);

fs/hpfs/anode.c

27

a = le32_to_cpu(btree->u.internal[i].down);

fs/hpfs/anode.c

275

void hpfs_remove_btree(struct super_block *s, struct bplus_header *btree)

fs/hpfs/anode.c

277

struct bplus_header *btree1 = btree;

fs/hpfs/anode.c

295

btree1 = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

30

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

311

btree1 = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

312

} else btree1 = btree;

fs/hpfs/anode.c

336

return hpfs_bplus_lookup(s, NULL, GET_BTREE_PTR(&anode->btree), sec, bh);

fs/hpfs/anode.c

37

for (i = 0; i < btree->n_used_nodes; i++)

fs/hpfs/anode.c

38

if (le32_to_cpu(btree->u.external[i].file_secno) <= sec &&

fs/hpfs/anode.c

39

le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > sec) {

fs/hpfs/anode.c

392

hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree));

fs/hpfs/anode.c

40

a = le32_to_cpu(btree->u.external[i].disk_secno) + sec - le32_to_cpu(btree->u.external[i].file_secno);

fs/hpfs/anode.c

405

struct bplus_header *btree;

fs/hpfs/anode.c

411

btree = GET_BTREE_PTR(&fnode->btree);

fs/hpfs/anode.c

414

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

417

hpfs_remove_btree(s, btree);

fs/hpfs/anode.c

419

btree->n_free_nodes = 8;

fs/hpfs/anode.c

420

btree->n_used_nodes = 0;

fs/hpfs/anode.c

421

btree->first_free = cpu_to_le16(8);

fs/hpfs/anode.c

422

btree->flags &= ~BP_internal;

fs/hpfs/anode.c

428

while (bp_internal(btree)) {

fs/hpfs/anode.c

429

nodes = btree->n_used_nodes + btree->n_free_nodes;

fs/hpfs/anode.c

430

for (i = 0; i < btree->n_used_nodes; i++)

fs/hpfs/anode.c

431

if (le32_to_cpu(btree->u.internal[i].file_secno) >= secs) goto f;

fs/hpfs/anode.c

436

for (j = i + 1; j < btree->n_used_nodes; j++)

fs/hpfs/anode.c

437

hpfs_ea_remove(s, le32_to_cpu(btree->u.internal[j].down), 1, 0);

fs/hpfs/anode.c

438

btree->n_used_nodes = i + 1;

fs/hpfs/anode.c

439

btree->n_free_nodes = nodes - btree->n_used_nodes;

fs/hpfs/anode.c

440

btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes);

fs/hpfs/anode.c

442

if (btree->u.internal[i].file_secno == cpu_to_le32(secs)) {

fs/hpfs/anode.c

446

node = le32_to_cpu(btree->u.internal[i].down);

fs/hpfs/anode.c

452

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

454

nodes = btree->n_used_nodes + btree->n_free_nodes;

fs/hpfs/anode.c

455

for (i = 0; i < btree->n_used_nodes; i++)

fs/hpfs/anode.c

456

if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) >= secs) goto ff;

fs/hpfs/anode.c

460

if (secs <= le32_to_cpu(btree->u.external[i].file_secno)) {

fs/hpfs/anode.c

464

else if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > secs) {

fs/hpfs/anode.c

465

hpfs_free_sectors(s, le32_to_cpu(btree->u.external[i].disk_secno) + secs -

fs/hpfs/anode.c

466

le32_to_cpu(btree->u.external[i].file_secno), le32_to_cpu(btree->u.external[i].length)

fs/hpfs/anode.c

467

- secs + le32_to_cpu(btree->u.external[i].file_secno)); /* I hope gcc optimizes this :-) */

fs/hpfs/anode.c

468

btree->u.external[i].length = cpu_to_le32(secs - le32_to_cpu(btree->u.external[i].file_secno));

fs/hpfs/anode.c

47

hpfs_inode->i_file_sec = le32_to_cpu(btree->u.external[i].file_secno);

fs/hpfs/anode.c

470

for (j = i + 1; j < btree->n_used_nodes; j++)

fs/hpfs/anode.c

471

hpfs_free_sectors(s, le32_to_cpu(btree->u.external[j].disk_secno), le32_to_cpu(btree->u.external[j].length));

fs/hpfs/anode.c

472

btree->n_used_nodes = i + 1;

fs/hpfs/anode.c

473

btree->n_free_nodes = nodes - btree->n_used_nodes;

fs/hpfs/anode.c

474

btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes);

fs/hpfs/anode.c

48

hpfs_inode->i_disk_sec = le32_to_cpu(btree->u.external[i].disk_secno);

fs/hpfs/anode.c

489

if (!fnode_is_dir(fnode)) hpfs_remove_btree(s, GET_BTREE_PTR(&fnode->btree));

fs/hpfs/anode.c

49

hpfs_inode->i_n_secs = le32_to_cpu(btree->u.external[i].length);

fs/hpfs/anode.c

63

struct bplus_header *btree;

fs/hpfs/anode.c

75

btree = GET_BTREE_PTR(&fnode->btree);

fs/hpfs/anode.c

78

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

82

if ((n = btree->n_used_nodes - 1) < -!!fnod) {

fs/hpfs/anode.c

87

if (bp_internal(btree)) {

fs/hpfs/anode.c

88

a = le32_to_cpu(btree->u.internal[n].down);

fs/hpfs/anode.c

89

btree->u.internal[n].file_secno = cpu_to_le32(-1);

fs/hpfs/anode.c

95

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

99

if (le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length) != fsecno) {

fs/hpfs/ea.c

44

hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree));

fs/hpfs/file.c

55

GET_BTREE_PTR(&fnode->btree),

fs/hpfs/hpfs.h

474

struct bplus_header_fixed btree; /* b+ tree, 8 extents or 12 subtrees */

fs/hpfs/hpfs.h

516

struct bplus_header_fixed btree; /* b+tree, 40 extents or 60 subtrees */

fs/hpfs/map.c

180

if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes !=

fs/hpfs/map.c

181

(bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 12 : 8)) {

fs/hpfs/map.c

187

if (le16_to_cpu(fnode->btree.first_free) !=

fs/hpfs/map.c

188

8 + fnode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 8 : 12)) {

fs/hpfs/map.c

235

if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes !=

fs/hpfs/map.c

236

(bp_internal(GET_BTREE_PTR(&anode->btree)) ? 60 : 40)) {

fs/hpfs/map.c

240

if (le16_to_cpu(anode->btree.first_free) !=

fs/hpfs/map.c

241

8 + anode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&anode->btree)) ? 8 : 12)) {

fs/hpfs/namei.c

86

fnode->btree.n_free_nodes = 7;

fs/hpfs/namei.c

87

fnode->btree.n_used_nodes = 1;

fs/hpfs/namei.c

88

fnode->btree.first_free = cpu_to_le16(0x14);

fs/nilfs2/btree.c

1006

nilfs_btree_do_insert(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

1012

static __u64 nilfs_btree_find_near(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1024

node = nilfs_btree_get_node(btree, path, level, &ncmax);

fs/nilfs2/btree.c

1032

if (level <= nilfs_btree_height(btree) - 1) {

fs/nilfs2/btree.c

1033

node = nilfs_btree_get_node(btree, path, level, &ncmax);

fs/nilfs2/btree.c

1041

static __u64 nilfs_btree_find_target_v(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1047

ptr = nilfs_bmap_find_target_seq(btree, key);

fs/nilfs2/btree.c

1052

ptr = nilfs_btree_find_near(btree, path);

fs/nilfs2/btree.c

1058

return nilfs_bmap_find_target_in_group(btree);

fs/nilfs2/btree.c

1061

static int nilfs_btree_prepare_insert(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1076

if (NILFS_BMAP_USE_VBN(btree)) {

fs/nilfs2/btree.c

1078

nilfs_btree_find_target_v(btree, path, key);

fs/nilfs2/btree.c

1079

dat = nilfs_bmap_get_dat(btree);

fs/nilfs2/btree.c

1082

ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat);

fs/nilfs2/btree.c

1086

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1089

level < nilfs_btree_height(btree) - 1;

fs/nilfs2/btree.c

1098

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

1105

ret = nilfs_btree_get_block(btree, sibptr, &bh);

fs/nilfs2/btree.c

112

static int nilfs_btree_node_size(const struct nilfs_bmap *btree)

fs/nilfs2/btree.c

1123

ret = nilfs_btree_get_block(btree, sibptr, &bh);

fs/nilfs2/btree.c

114

return i_blocksize(btree->b_inode);

fs/nilfs2/btree.c

1140

ret = nilfs_bmap_prepare_alloc_ptr(btree,

fs/nilfs2/btree.c

1144

ret = nilfs_btree_get_new_block(btree,

fs/nilfs2/btree.c

1159

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1169

ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat);

fs/nilfs2/btree.c

117

static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree)

fs/nilfs2/btree.c

1172

ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr,

fs/nilfs2/btree.c

119

return btree->b_nchildren_per_block;

fs/nilfs2/btree.c

1195

nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat);

fs/nilfs2/btree.c

1199

nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat);

fs/nilfs2/btree.c

1203

nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat);

fs/nilfs2/btree.c

1210

static void nilfs_btree_commit_insert(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1219

if (NILFS_BMAP_USE_VBN(btree)) {

fs/nilfs2/btree.c

1220

nilfs_bmap_set_target_v(btree, key, ptr);

fs/nilfs2/btree.c

1221

dat = nilfs_bmap_get_dat(btree);

fs/nilfs2/btree.c

1225

nilfs_bmap_commit_alloc_ptr(btree,

fs/nilfs2/btree.c

1227

path[level].bp_op(btree, path, level, &key, &ptr);

fs/nilfs2/btree.c

1230

if (!nilfs_bmap_dirty(btree))

fs/nilfs2/btree.c

1231

nilfs_bmap_set_dirty(btree);

fs/nilfs2/btree.c

1234

static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr)

fs/nilfs2/btree.c

1244

ret = nilfs_btree_do_lookup(btree, path, key, NULL,

fs/nilfs2/btree.c

1252

ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats);

fs/nilfs2/btree.c

1255

nilfs_btree_commit_insert(btree, path, level, key, ptr);

fs/nilfs2/btree.c

1256

nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks);

fs/nilfs2/btree.c

1263

static void nilfs_btree_do_delete(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1270

if (level < nilfs_btree_height(btree) - 1) {

fs/nilfs2/btree.c

1272

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1278

nilfs_btree_promote_key(btree, path, level + 1,

fs/nilfs2/btree.c

1281

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1288

static void nilfs_btree_borrow_left(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1295

nilfs_btree_do_delete(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

1301

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1312

nilfs_btree_promote_key(btree, path, level + 1,

fs/nilfs2/btree.c

1320

static void nilfs_btree_borrow_right(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1327

nilfs_btree_do_delete(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

1333

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1345

nilfs_btree_promote_key(btree, path, level + 1,

fs/nilfs2/btree.c

1353

static void nilfs_btree_concat_left(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1360

nilfs_btree_do_delete(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

1364

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1379

static void nilfs_btree_concat_right(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1386

nilfs_btree_do_delete(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

1390

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1404

static void nilfs_btree_shrink(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1411

nilfs_btree_do_delete(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

1413

root = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1415

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1428

static void nilfs_btree_nop(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1434

static int nilfs_btree_prepare_delete(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1447

ncmin = NILFS_BTREE_NODE_NCHILDREN_MIN(nilfs_btree_node_size(btree));

fs/nilfs2/btree.c

1448

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1451

level < nilfs_btree_height(btree) - 1;

fs/nilfs2/btree.c

1456

ret = nilfs_bmap_prepare_end_ptr(btree,

fs/nilfs2/btree.c

1467

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

1475

ret = nilfs_btree_get_block(btree, sibptr, &bh);

fs/nilfs2/btree.c

1495

ret = nilfs_btree_get_block(btree, sibptr, &bh);

fs/nilfs2/btree.c

1521

WARN_ON(level != nilfs_btree_height(btree) - 2);

fs/nilfs2/btree.c

1542

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1547

ret = nilfs_bmap_prepare_end_ptr(btree, &path[level].bp_oldreq, dat);

fs/nilfs2/btree.c

1558

nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat);

fs/nilfs2/btree.c

1562

nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat);

fs/nilfs2/btree.c

1569

static void nilfs_btree_commit_delete(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1576

nilfs_bmap_commit_end_ptr(btree, &path[level].bp_oldreq, dat);

fs/nilfs2/btree.c

1577

path[level].bp_op(btree, path, level, NULL, NULL);

fs/nilfs2/btree.c

1580

if (!nilfs_bmap_dirty(btree))

fs/nilfs2/btree.c

1581

nilfs_bmap_set_dirty(btree);

fs/nilfs2/btree.c

1584

static int nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key)

fs/nilfs2/btree.c

1596

ret = nilfs_btree_do_lookup(btree, path, key, NULL,

fs/nilfs2/btree.c

1602

dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL;

fs/nilfs2/btree.c

1604

ret = nilfs_btree_prepare_delete(btree, path, &level, &stats, dat);

fs/nilfs2/btree.c

1607

nilfs_btree_commit_delete(btree, path, level, dat);

fs/nilfs2/btree.c

1608

nilfs_inode_sub_blocks(btree->b_inode, stats.bs_nblocks);

fs/nilfs2/btree.c

1615

static int nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start,

fs/nilfs2/btree.c

1626

ret = nilfs_btree_do_lookup(btree, path, start, NULL, minlevel, 0);

fs/nilfs2/btree.c

1630

ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);

fs/nilfs2/btree.c

1636

static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)

fs/nilfs2/btree.c

1645

ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);

fs/nilfs2/btree.c

1652

static int nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key)

fs/nilfs2/btree.c

1660

root = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1665

switch (nilfs_btree_height(btree)) {

fs/nilfs2/btree.c

1675

ret = nilfs_btree_get_block(btree, ptr, &bh);

fs/nilfs2/btree.c

1693

static int nilfs_btree_gather_data(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1703

root = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1704

switch (nilfs_btree_height(btree)) {

fs/nilfs2/btree.c

1715

ret = nilfs_btree_get_block(btree, ptr, &bh);

fs/nilfs2/btree.c

1719

ncmax = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1742

nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key,

fs/nilfs2/btree.c

1756

if (NILFS_BMAP_USE_VBN(btree)) {

fs/nilfs2/btree.c

1757

dreq->bpr_ptr = nilfs_btree_find_target_v(btree, NULL, key);

fs/nilfs2/btree.c

1758

dat = nilfs_bmap_get_dat(btree);

fs/nilfs2/btree.c

1761

ret = nilfs_attach_btree_node_cache(&NILFS_BMAP_I(btree)->vfs_inode);

fs/nilfs2/btree.c

1765

ret = nilfs_bmap_prepare_alloc_ptr(btree, dreq, dat);

fs/nilfs2/btree.c

1773

ret = nilfs_bmap_prepare_alloc_ptr(btree, nreq, dat);

fs/nilfs2/btree.c

1777

ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh);

fs/nilfs2/btree.c

1790

nilfs_bmap_abort_alloc_ptr(btree, nreq, dat);

fs/nilfs2/btree.c

1792

nilfs_bmap_abort_alloc_ptr(btree, dreq, dat);

fs/nilfs2/btree.c

1799

nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1813

if (btree->b_ops->bop_clear != NULL)

fs/nilfs2/btree.c

1814

btree->b_ops->bop_clear(btree);

fs/nilfs2/btree.c

1820

dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL;

fs/nilfs2/btree.c

1821

__nilfs_btree_init(btree);

fs/nilfs2/btree.c

1823

nilfs_bmap_commit_alloc_ptr(btree, dreq, dat);

fs/nilfs2/btree.c

1824

nilfs_bmap_commit_alloc_ptr(btree, nreq, dat);

fs/nilfs2/btree.c

1828

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

1833

if (!nilfs_bmap_dirty(btree))

fs/nilfs2/btree.c

1834

nilfs_bmap_set_dirty(btree);

fs/nilfs2/btree.c

1839

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1845

nilfs_bmap_commit_alloc_ptr(btree, dreq, dat);

fs/nilfs2/btree.c

1848

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

1854

if (!nilfs_bmap_dirty(btree))

fs/nilfs2/btree.c

1855

nilfs_bmap_set_dirty(btree);

fs/nilfs2/btree.c

1858

if (NILFS_BMAP_USE_VBN(btree))

fs/nilfs2/btree.c

1859

nilfs_bmap_set_target_v(btree, key, dreq->bpr_ptr);

fs/nilfs2/btree.c

1880

int nilfs_btree_convert_and_insert(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1893

nilfs_btree_node_size(btree))) {

fs/nilfs2/btree.c

1902

ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh,

fs/nilfs2/btree.c

1906

nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n,

fs/nilfs2/btree.c

1908

nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks);

fs/nilfs2/btree.c

1912

static int nilfs_btree_propagate_p(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1917

while ((++level < nilfs_btree_height(btree) - 1) &&

fs/nilfs2/btree.c

1924

static int nilfs_btree_prepare_update_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1931

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

1946

NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping,

fs/nilfs2/btree.c

1959

static void nilfs_btree_commit_update_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1968

btree->b_ptr_type == NILFS_BMAP_PTR_VS);

fs/nilfs2/btree.c

1972

NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping,

fs/nilfs2/btree.c

1978

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

1983

static void nilfs_btree_abort_update_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

1991

NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping,

fs/nilfs2/btree.c

1995

static int nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2004

ret = nilfs_btree_prepare_update_v(btree, path, level, dat);

fs/nilfs2/btree.c

2008

while ((++level < nilfs_btree_height(btree) - 1) &&

fs/nilfs2/btree.c

2012

ret = nilfs_btree_prepare_update_v(btree, path, level, dat);

fs/nilfs2/btree.c

2024

nilfs_btree_abort_update_v(btree, path, level, dat);

fs/nilfs2/btree.c

2026

nilfs_btree_abort_update_v(btree, path, level, dat);

fs/nilfs2/btree.c

2030

static void nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2039

nilfs_btree_commit_update_v(btree, path, minlevel, dat);

fs/nilfs2/btree.c

2042

nilfs_btree_commit_update_v(btree, path, level, dat);

fs/nilfs2/btree.c

2045

static int nilfs_btree_propagate_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2051

struct inode *dat = nilfs_bmap_get_dat(btree);

fs/nilfs2/btree.c

2057

ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel,

fs/nilfs2/btree.c

2063

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

2072

nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat);

fs/nilfs2/btree.c

2080

static int nilfs_btree_propagate(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2099

key = nilfs_bmap_data_get_key(btree, bh);

fs/nilfs2/btree.c

2103

ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0);

fs/nilfs2/btree.c

2106

nilfs_crit(btree->b_inode->i_sb,

fs/nilfs2/btree.c

2108

btree->b_inode->i_ino,

fs/nilfs2/btree.c

2115

ret = NILFS_BMAP_USE_VBN(btree) ?

fs/nilfs2/btree.c

2116

nilfs_btree_propagate_v(btree, path, level, bh) :

fs/nilfs2/btree.c

2117

nilfs_btree_propagate_p(btree, path, level, bh);

fs/nilfs2/btree.c

2125

static int nilfs_btree_propagate_gc(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2128

return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr);

fs/nilfs2/btree.c

2131

static void nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2148

nilfs_warn(btree->b_inode->i_sb,

fs/nilfs2/btree.c

2151

btree->b_inode->i_ino,

fs/nilfs2/btree.c

2166

static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2169

struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode;

fs/nilfs2/btree.c

2190

nilfs_btree_add_dirty_buffer(btree,

fs/nilfs2/btree.c

2204

static int nilfs_btree_assign_p(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2216

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

2224

NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping,

fs/nilfs2/btree.c

2229

NILFS_BMAP_I(btree)->i_assoc_inode->i_mapping,

fs/nilfs2/btree.c

2246

static int nilfs_btree_assign_v(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2254

struct inode *dat = nilfs_bmap_get_dat(btree);

fs/nilfs2/btree.c

2260

parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);

fs/nilfs2/btree.c

2277

static int nilfs_btree_assign(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2296

key = nilfs_bmap_data_get_key(btree, *bh);

fs/nilfs2/btree.c

2300

ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0);

fs/nilfs2/btree.c

2306

ret = NILFS_BMAP_USE_VBN(btree) ?

fs/nilfs2/btree.c

2307

nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) :

fs/nilfs2/btree.c

2308

nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo);

fs/nilfs2/btree.c

2316

static int nilfs_btree_assign_gc(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

2325

ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr,

fs/nilfs2/btree.c

2334

key = nilfs_bmap_data_get_key(btree, *bh);

fs/nilfs2/btree.c

2343

static int nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level)

fs/nilfs2/btree.c

2354

ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0);

fs/nilfs2/btree.c

2359

ret = nilfs_btree_get_block(btree, ptr, &bh);

fs/nilfs2/btree.c

2368

if (!nilfs_bmap_dirty(btree))

fs/nilfs2/btree.c

2369

nilfs_bmap_set_dirty(btree);

fs/nilfs2/btree.c

411

nilfs_btree_get_root(const struct nilfs_bmap *btree)

fs/nilfs2/btree.c

413

return (struct nilfs_btree_node *)btree->b_u.u_data;

fs/nilfs2/btree.c

428

static int nilfs_btree_height(const struct nilfs_bmap *btree)

fs/nilfs2/btree.c

430

return nilfs_btree_node_get_level(nilfs_btree_get_root(btree)) + 1;

fs/nilfs2/btree.c

434

nilfs_btree_get_node(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

440

if (level == nilfs_btree_height(btree) - 1) {

fs/nilfs2/btree.c

441

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

445

*ncmaxp = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

450

static int nilfs_btree_bad_node(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

455

nilfs_crit(btree->b_inode->i_sb,

fs/nilfs2/btree.c

457

btree->b_inode->i_ino,

fs/nilfs2/btree.c

471

static int __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr,

fs/nilfs2/btree.c

475

struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode;

fs/nilfs2/btree.c

523

nilfs_err(btree->b_inode->i_sb,

fs/nilfs2/btree.c

525

btree->b_inode->i_ino, (unsigned long long)ptr);

fs/nilfs2/btree.c

541

static int nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr,

fs/nilfs2/btree.c

544

return __nilfs_btree_get_block(btree, ptr, bhp, NULL);

fs/nilfs2/btree.c

547

static int nilfs_btree_do_lookup(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

557

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

568

ncmax = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

573

p.node = nilfs_btree_get_node(btree, path, level + 1,

fs/nilfs2/btree.c

579

ret = __nilfs_btree_get_block(btree, ptr, &path[level].bp_bh,

fs/nilfs2/btree.c

58

static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

585

if (nilfs_btree_bad_node(btree, node, level))

fs/nilfs2/btree.c

609

static int nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

61

struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode;

fs/nilfs2/btree.c

617

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

626

ncmax = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

629

ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh);

fs/nilfs2/btree.c

633

if (nilfs_btree_bad_node(btree, node, level))

fs/nilfs2/btree.c

657

static int nilfs_btree_get_next_key(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

662

int maxlevel = nilfs_btree_height(btree) - 1;

fs/nilfs2/btree.c

669

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

685

static int nilfs_btree_lookup(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

695

ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0);

fs/nilfs2/btree.c

702

static int nilfs_btree_lookup_contig(const struct nilfs_bmap *btree,

fs/nilfs2/btree.c

719

ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level, 1);

fs/nilfs2/btree.c

723

if (NILFS_BMAP_USE_VBN(btree)) {

fs/nilfs2/btree.c

724

dat = nilfs_bmap_get_dat(btree);

fs/nilfs2/btree.c

734

maxlevel = nilfs_btree_height(btree) - 1;

fs/nilfs2/btree.c

735

node = nilfs_btree_get_node(btree, path, level, &ncmax);

fs/nilfs2/btree.c

757

p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax);

fs/nilfs2/btree.c

769

ret = __nilfs_btree_get_block(btree, ptr2, &path[level].bp_bh,

fs/nilfs2/btree.c

774

ncmax = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

791

static void nilfs_btree_promote_key(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

795

if (level < nilfs_btree_height(btree) - 1) {

fs/nilfs2/btree.c

803

(++level < nilfs_btree_height(btree) - 1));

fs/nilfs2/btree.c

807

if (level == nilfs_btree_height(btree) - 1) {

fs/nilfs2/btree.c

808

nilfs_btree_node_set_key(nilfs_btree_get_root(btree),

fs/nilfs2/btree.c

813

static void nilfs_btree_do_insert(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

820

if (level < nilfs_btree_height(btree) - 1) {

fs/nilfs2/btree.c

822

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

829

nilfs_btree_promote_key(btree, path, level + 1,

fs/nilfs2/btree.c

833

node = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

840

static void nilfs_btree_carry_left(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

851

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

868

nilfs_btree_promote_key(btree, path, level + 1,

fs/nilfs2/btree.c

883

nilfs_btree_do_insert(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

886

static void nilfs_btree_carry_right(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

897

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

915

nilfs_btree_promote_key(btree, path, level + 1,

fs/nilfs2/btree.c

930

nilfs_btree_do_insert(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

933

static void nilfs_btree_split(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

943

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/nilfs2/btree.c

971

nilfs_btree_do_insert(btree, path, level, keyp, ptrp);

fs/nilfs2/btree.c

983

static void nilfs_btree_grow(struct nilfs_bmap *btree,

fs/nilfs2/btree.c

990

root = nilfs_btree_get_root(btree);

fs/nilfs2/btree.c

992

ncblk = nilfs_btree_nchildren_per_block(btree);

fs/xfs/libxfs/xfs_ag.c

55

uint64_t btree = 0;

fs/xfs/libxfs/xfs_ag.c

77

btree += pag->pagf_btreeblks;

fs/xfs/libxfs/xfs_ag.c

80

fdblocks = bfree + bfreelst + btree;

fs/xfs/libxfs/xfs_attr_leaf.c

1350

icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval;

fs/xfs/libxfs/xfs_attr_leaf.c

1351

icnodehdr.btree[0].before = cpu_to_be32(blkno);

fs/xfs/libxfs/xfs_da_btree.c

1051

btree1 = nodehdr1.btree;

fs/xfs/libxfs/xfs_da_btree.c

1052

btree2 = nodehdr2.btree;

fs/xfs/libxfs/xfs_da_btree.c

1077

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

1085

btree = nodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

1098

tmp = (nodehdr.count - oldblk->index) * (uint)sizeof(*btree);

fs/xfs/libxfs/xfs_da_btree.c

1099

memmove(&btree[oldblk->index + 1], &btree[oldblk->index], tmp);

fs/xfs/libxfs/xfs_da_btree.c

1101

btree[oldblk->index].hashval = cpu_to_be32(newblk->hashval);

fs/xfs/libxfs/xfs_da_btree.c

1102

btree[oldblk->index].before = cpu_to_be32(newblk->blkno);

fs/xfs/libxfs/xfs_da_btree.c

1104

XFS_DA_LOGRANGE(node, &btree[oldblk->index],

fs/xfs/libxfs/xfs_da_btree.c

1105

tmp + sizeof(*btree)));

fs/xfs/libxfs/xfs_da_btree.c

1116

oldblk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

1270

child = be32_to_cpu(oldroothdr.btree[0].before);

fs/xfs/libxfs/xfs_da_btree.c

1449

return be32_to_cpu(nodehdr.btree[nodehdr.count - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

1463

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

1495

btree = nodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

1496

if (be32_to_cpu(btree[blk->index].hashval) == lasthash)

fs/xfs/libxfs/xfs_da_btree.c

1499

btree[blk->index].hashval = cpu_to_be32(lasthash);

fs/xfs/libxfs/xfs_da_btree.c

1501

XFS_DA_LOGRANGE(node, &btree[blk->index],

fs/xfs/libxfs/xfs_da_btree.c

1502

sizeof(*btree)));

fs/xfs/libxfs/xfs_da_btree.c

1504

lasthash = be32_to_cpu(btree[nodehdr.count - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

1520

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

1533

btree = nodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

1537

memmove(&btree[index], &btree[index + 1], tmp);

fs/xfs/libxfs/xfs_da_btree.c

1539

XFS_DA_LOGRANGE(node, &btree[index], tmp));

fs/xfs/libxfs/xfs_da_btree.c

154

to->btree = from3->__btree;

fs/xfs/libxfs/xfs_da_btree.c

1542

memset(&btree[index], 0, sizeof(xfs_da_node_entry_t));

fs/xfs/libxfs/xfs_da_btree.c

1544

XFS_DA_LOGRANGE(node, &btree[index], sizeof(btree[index])));

fs/xfs/libxfs/xfs_da_btree.c

1553

drop_blk->hashval = be32_to_cpu(btree[index - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

1615

drop_btree = drop_hdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

1616

save_btree = save_hdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

162

to->btree = from->__btree;

fs/xfs/libxfs/xfs_da_btree.c

1684

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

1771

btree = nodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

1791

blk->hashval = be32_to_cpu(btree[max - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

1800

btreehashval = be32_to_cpu(btree[probe].hashval);

fs/xfs/libxfs/xfs_da_btree.c

1810

(be32_to_cpu(btree[probe].hashval) == hashval));

fs/xfs/libxfs/xfs_da_btree.c

1817

be32_to_cpu(btree[probe].hashval) >= hashval) {

fs/xfs/libxfs/xfs_da_btree.c

1821

be32_to_cpu(btree[probe].hashval) < hashval) {

fs/xfs/libxfs/xfs_da_btree.c

1830

blkno = be32_to_cpu(btree[max - 1].before);

fs/xfs/libxfs/xfs_da_btree.c

1833

blkno = be32_to_cpu(btree[probe].before);

fs/xfs/libxfs/xfs_da_btree.c

1910

btree1 = node1hdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

1911

btree2 = node2hdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

2139

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

2167

blkno = be32_to_cpu(nodehdr.btree[blk->index].before);

fs/xfs/libxfs/xfs_da_btree.c

2171

blkno = be32_to_cpu(nodehdr.btree[blk->index].before);

fs/xfs/libxfs/xfs_da_btree.c

2230

btree = nodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

2231

blk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

2236

blkno = be32_to_cpu(btree[blk->index].before);

fs/xfs/libxfs/xfs_da_btree.c

2436

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

2516

btree = deadhdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

2518

dead_hash = be32_to_cpu(btree[deadhdr.count - 1].hashval);

fs/xfs/libxfs/xfs_da_btree.c

2602

btree = par_hdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

2605

be32_to_cpu(btree[entno].hashval) < dead_hash;

fs/xfs/libxfs/xfs_da_btree.c

2613

par_blkno = be32_to_cpu(btree[entno].before);

fs/xfs/libxfs/xfs_da_btree.c

2626

be32_to_cpu(btree[entno].before) != last_blkno;

fs/xfs/libxfs/xfs_da_btree.c

2656

btree = par_hdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

2662

btree[entno].before = cpu_to_be32(dead_blkno);

fs/xfs/libxfs/xfs_da_btree.c

2664

XFS_DA_LOGRANGE(par_node, &btree[entno].before,

fs/xfs/libxfs/xfs_da_btree.c

2665

sizeof(btree[entno].before)));

fs/xfs/libxfs/xfs_da_btree.c

729

struct xfs_da_node_entry *btree;

fs/xfs/libxfs/xfs_da_btree.c

764

btree = icnodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

765

size = (int)((char *)&btree[icnodehdr.count] - (char *)oldroot);

fs/xfs/libxfs/xfs_da_btree.c

803

btree = nodehdr.btree;

fs/xfs/libxfs/xfs_da_btree.c

804

btree[0].hashval = cpu_to_be32(blk1->hashval);

fs/xfs/libxfs/xfs_da_btree.c

805

btree[0].before = cpu_to_be32(blk1->blkno);

fs/xfs/libxfs/xfs_da_btree.c

806

btree[1].hashval = cpu_to_be32(blk2->hashval);

fs/xfs/libxfs/xfs_da_btree.c

807

btree[1].before = cpu_to_be32(blk2->blkno);

fs/xfs/libxfs/xfs_da_btree.c

823

XFS_DA_LOGRANGE(node, btree, sizeof(xfs_da_node_entry_t) * 2));

fs/xfs/libxfs/xfs_da_btree.c

954

btree1 = nodehdr1.btree;

fs/xfs/libxfs/xfs_da_btree.c

955

btree2 = nodehdr2.btree;

fs/xfs/libxfs/xfs_da_btree.c

968

btree1 = nodehdr1.btree;

fs/xfs/libxfs/xfs_da_btree.c

969

btree2 = nodehdr2.btree;

fs/xfs/libxfs/xfs_da_btree.h

159

struct xfs_da_node_entry *btree;

fs/xfs/scrub/dabtree.c

110

return hdr.btree + blk->index;

fs/xfs/scrub/dabtree.c

337

struct xfs_da_node_entry *btree;

fs/xfs/scrub/dabtree.c

441

btree = nodehdr.btree;

fs/xfs/scrub/dabtree.c

443

blk->hashval = be32_to_cpu(btree[*pmaxrecs - 1].hashval);

fs/xfs/scrub/listxattr.c

139

struct xfs_da_node_entry *btree;

fs/xfs/scrub/listxattr.c

192

btree = nodehdr.btree;

fs/xfs/scrub/listxattr.c

193

blkno = be32_to_cpu(btree->before);

fs/xfs/xfs_attr_inactive.c

161

child_fsb = be32_to_cpu(ichdr.btree[0].before);

fs/xfs/xfs_attr_inactive.c

238

child_fsb = be32_to_cpu(ichdr.btree[0].before);

fs/xfs/xfs_attr_list.c

221

struct xfs_da_node_entry *btree;

fs/xfs/xfs_attr_list.c

269

btree = nodehdr.btree;

fs/xfs/xfs_attr_list.c

270

for (i = 0; i < nodehdr.count; btree++, i++) {

fs/xfs/xfs_attr_list.c

271

if (cursor->hashval <= be32_to_cpu(btree->hashval)) {

fs/xfs/xfs_attr_list.c

272

cursor->blkno = be32_to_cpu(btree->before);

fs/xfs/xfs_attr_list.c

274

btree);

fs/xfs/xfs_trace.h

616

struct xfs_da_node_entry *btree),

fs/xfs/xfs_trace.h

617

TP_ARGS(ctx, btree),

fs/xfs/xfs_trace.h

644

__entry->bt_hashval = be32_to_cpu(btree->hashval);

fs/xfs/xfs_trace.h

645

__entry->bt_before = be32_to_cpu(btree->before);

include/trace/events/bcache.h

258

TP_PROTO(struct btree *b),

include/trace/events/bcache.h

263

TP_PROTO(struct btree *b),

include/trace/events/bcache.h

283

TP_PROTO(struct btree *b),

include/trace/events/bcache.h

293

TP_PROTO(struct btree *b),

include/trace/events/bcache.h

333

TP_PROTO(struct btree *b, struct bkey *k, unsigned op, unsigned status),

include/trace/events/bcache.h

366

TP_PROTO(struct btree *b, unsigned keys),

include/trace/events/bcache.h

383

TP_PROTO(struct btree *b, unsigned keys),

include/trace/events/bcache.h

388

TP_PROTO(struct btree *b, unsigned keys),

include/trace/events/bcache.h

393

TP_PROTO(struct btree *b),

include/trace/events/bcache.h

64

TP_PROTO(struct btree *b),