src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

102

const bplustree_node* fNode;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1071

BPlusTree::_FindKey(const bplustree_node* node, const uint8* key,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1145

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1185

const bplustree_node* node, CachedNode& cached,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1186

off_t* _offset, bplustree_node** _fragment, uint32* _index)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1193

if (bplustree_node::LinkType(value) != BPLUSTREE_DUPLICATE_FRAGMENT)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1196

const bplustree_node* fragment = cached.SetTo(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1197

bplustree_node::FragmentOffset(value), false);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1205

uint32 num = bplustree_node::MaxFragments(fNodeSize);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1215

*_offset = bplustree_node::FragmentOffset(value);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1227

const bplustree_node* node, uint16 index, off_t value)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1235

if (bplustree_node::IsDuplicate(oldValue)) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1239

if (bplustree_node::LinkType(oldValue)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1241

bplustree_node* duplicate = cachedDuplicate.SetToWritable(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1242

transaction, bplustree_node::FragmentOffset(oldValue), false);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1247

bplustree_node::FragmentIndex(oldValue));

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1252

(int)bplustree_node::FragmentIndex(oldValue),

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1253

bplustree_node::FragmentOffset(oldValue), arrayCount,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1266

offset = bplustree_node::FragmentOffset(oldValue);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1282

bplustree_node* newDuplicate;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1304

= HOST_ENDIAN_TO_BFS_INT64(bplustree_node::MakeLink(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1316

const bplustree_node* duplicate;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1319

duplicateOffset = bplustree_node::FragmentOffset(oldValue);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1335

bplustree_node* writableDuplicate

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1346

bplustree_node* newDuplicate;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1367

bplustree_node* fragment;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1385

values[index] = HOST_ENDIAN_TO_BFS_INT64(bplustree_node::MakeLink(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1393

BPlusTree::_InsertKey(bplustree_node* node, uint16 index, uint8* key,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1445

BPlusTree::_SplitNode(bplustree_node* node, off_t nodeOffset,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1446

bplustree_node* other, off_t otherOffset, uint16* _keyIndex, uint8* key,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1491

if (key_align(sizeof(bplustree_node) + bytes + keyLengths)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1727

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1754

bplustree_node* writableNode = cached.MakeWritable(transaction);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1759

if (int32(key_align(sizeof(bplustree_node)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1777

bplustree_node* root;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1792

bplustree_node* other;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1826

bplustree_node* root = cachedNewRoot.Node();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1857

const bplustree_node* node, CachedNode& cached, uint16 index,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1864

off_t duplicateOffset = bplustree_node::FragmentOffset(oldValue);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1865

bplustree_node* duplicate = cachedDuplicate.SetToWritable(transaction,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1871

if (bplustree_node::LinkType(oldValue) == BPLUSTREE_DUPLICATE_FRAGMENT) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1873

bplustree_node::FragmentIndex(oldValue));

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1879

(int)bplustree_node::FragmentIndex(oldValue), duplicateOffset,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

1975

bplustree_node::MakeLink(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2025

bplustree_node* fragment = NULL;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2048

values[index] = HOST_ENDIAN_TO_BFS_INT64(bplustree_node::MakeLink(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2062

BPlusTree::_RemoveKey(bplustree_node* node, uint16 index)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2140

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2156

if (bplustree_node::IsDuplicate(BFS_ENDIAN_TO_HOST_INT64(

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2181

bplustree_node* writableNode = cached.MakeWritable(transaction);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2223

bplustree_node* other = otherCached.SetToWritable(transaction,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2264

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2274

bplustree_node* writableNode = cached.MakeWritable(transaction);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2322

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2361

const bplustree_node* parent)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2407

if (bplustree_node::IsDuplicate(childOffset)) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2409

off_t duplicateOffset = bplustree_node::FragmentOffset(childOffset);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2413

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2426

bool isFragmentNode = bplustree_node::LinkType(childOffset)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2453

bplustree_node::FragmentIndex(childOffset));

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2506

const bplustree_node* previous = cached.SetTo(lastOffset, true);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2553

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2620

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2690

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2698

node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode),

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2800

uint8 type = bplustree_node::LinkType(offset);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2805

node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode),

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2853

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

290

const bplustree_node*

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2923

bplustree_node::FragmentOffset(fDuplicateNode), fDuplicateNode,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

293

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2949

bplustree_node::Initialize()

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2959

bplustree_node::KeyAt(int32 index, uint16* keyLength) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2977

bplustree_node::CountDuplicates(off_t offset, bool isFragment) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2992

bplustree_node::DuplicateAt(off_t offset, bool isFragment, int8 index) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

3010

bplustree_node::FragmentsUsed(uint32 nodeSize) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

302

CachedNode::SetTo(off_t offset, const bplustree_node** _node, bool check)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

3023

bplustree_node::CheckIntegrity(uint32 nodeSize) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

338

bplustree_node*

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

374

bplustree_node*

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

494

fNode = (bplustree_node*)(block + offset

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

548

CachedNode::Allocate(Transaction& transaction, bplustree_node** _node,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

78

NodeChecker(const bplustree_node* node, int32 nodeSize, const char* text)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

802

const bplustree_node* node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

835

const bplustree_node* root;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

886

bplustree_node* node = cached.SetToWritable(transaction, NodeSize(), false);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

898

bplustree_node* node = cached.SetToWritable(transaction, offset, false);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

208

const bplustree_node* SetTo(off_t offset, bool check = true);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

210

const bplustree_node** _node,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

217

bplustree_node* SetToWritable(Transaction& transaction,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

219

bplustree_node* MakeWritable(Transaction& transaction);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

226

bplustree_node** _node, off_t* _offset);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

230

bplustree_node* Node() const { return fNode; }

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

237

bplustree_node* fNode;

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

28

struct bplustree_node;

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

320

status_t _FindKey(const bplustree_node* node,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

329

const bplustree_node* node,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

331

bplustree_node** _fragment, uint32* _index);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

334

const bplustree_node* node, uint16 index,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

336

void _InsertKey(bplustree_node* node, uint16 index,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

338

status_t _SplitNode(bplustree_node* node,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

339

off_t nodeOffset, bplustree_node* other,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

345

const bplustree_node* node,

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

348

void _RemoveKey(bplustree_node* node, uint16 index);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

359

const bplustree_node* parent);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

53

inline bool CheckNode(const bplustree_node* node) const;

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

546

bplustree_header::CheckNode(const bplustree_node* node) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

569

bplustree_node::KeyLengths() const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

571

return (Unaligned<uint16>*)(((char*)this) + key_align(sizeof(bplustree_node)

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

577

bplustree_node::Values() const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

585

bplustree_node::Keys() const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

587

return (uint8*)this + sizeof(bplustree_node);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

592

bplustree_node::Used() const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

594

return key_align(sizeof(bplustree_node) + AllKeyLength()) + NumKeys()

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

600

bplustree_node::IsLeaf() const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

607

bplustree_node::FragmentAt(int8 index) const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

614

bplustree_node::DuplicateArray() const

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

621

bplustree_node::LinkType(off_t link)

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

628

bplustree_node::MakeLink(uint8 type, off_t link, uint32 fragmentIndex)

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

636

bplustree_node::IsDuplicate(off_t link)

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

644

bplustree_node::FragmentOffset(off_t link)

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

651

bplustree_node::FragmentIndex(off_t link)

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

658

bplustree_node::MaxFragments(uint32 nodeSize)

src/add-ons/kernel/file_systems/bfs/Debug.cpp

197

dump_bplustree_node(const bplustree_node* node, const bplustree_header* header,

src/add-ons/kernel/file_systems/bfs/Debug.cpp

256

if (bplustree_node::LinkType(*value)

src/add-ons/kernel/file_systems/bfs/Debug.cpp

260

} else if (bplustree_node::LinkType(*value)

src/add-ons/kernel/file_systems/bfs/Debug.cpp

429

bplustree_node* node = (bplustree_node*)parse_expression(argv[1]);

src/add-ons/kernel/file_systems/bfs/Debug.h

85

struct bplustree_node;

src/add-ons/kernel/file_systems/bfs/Debug.h

98

extern void dump_bplustree_node(const bplustree_node *node,

src/bin/bfs_tools/bfsinfo.cpp

45

bplustree_node *node = (bplustree_node *)(buffer + nodeSize);

src/bin/bfs_tools/bfsinfo.cpp

57

node = (bplustree_node *)((addr_t)node + nodeSize);

src/bin/bfs_tools/chkindex.cpp

322

if (bplustree_node::LinkType(value) == BPLUSTREE_NODE)

src/bin/bfs_tools/lib/BPlusTree.cpp

1004

bplustree_node *rootNode = NULL;

src/bin/bfs_tools/lib/BPlusTree.cpp

1053

bplustree_node *node;

src/bin/bfs_tools/lib/BPlusTree.cpp

1077

BPlusTree::CheckNode(bplustree_node *node)

src/bin/bfs_tools/lib/BPlusTree.cpp

1089

bplustree_node *BPlusTree::Node(off_t nodeOffset,bool check)

src/bin/bfs_tools/lib/BPlusTree.cpp

1103

bplustree_node *node = (bplustree_node *)malloc(fNodeSize);

src/bin/bfs_tools/lib/BPlusTree.cpp

1149

uint8 *bplustree_node::KeyAt(int32 index,uint16 *keyLength) const

src/bin/bfs_tools/lib/BPlusTree.cpp

1165

uint8 bplustree_node::CountDuplicates(off_t offset,bool isFragment) const

src/bin/bfs_tools/lib/BPlusTree.cpp

1180

off_t bplustree_node::DuplicateAt(off_t offset,bool isFragment,int8 index) const

src/bin/bfs_tools/lib/BPlusTree.cpp

205

bplustree_node *node = fCache.Get(header.root_node_pointer);

src/bin/bfs_tools/lib/BPlusTree.cpp

25

CacheableNode(off_t offset,bplustree_node *node)

src/bin/bfs_tools/lib/BPlusTree.cpp

266

bplustree_node *node;

src/bin/bfs_tools/lib/BPlusTree.cpp

308

bplustree_node *node = fCache.Get(offset);

src/bin/bfs_tools/lib/BPlusTree.cpp

323

void BPlusTree::SetCurrentNode(bplustree_node *node,off_t offset,int8 to)

src/bin/bfs_tools/lib/BPlusTree.cpp

340

bplustree_node *node;

src/bin/bfs_tools/lib/BPlusTree.cpp

377

bplustree_node *node;

src/bin/bfs_tools/lib/BPlusTree.cpp

386

node = fCache.Get(bplustree_node::FragmentOffset(fDuplicateNode));

src/bin/bfs_tools/lib/BPlusTree.cpp

44

bplustree_node *fNode;

src/bin/bfs_tools/lib/BPlusTree.cpp

464

uint8 type = bplustree_node::LinkType(offset);

src/bin/bfs_tools/lib/BPlusTree.cpp

469

node = fCache.Get(bplustree_node::FragmentOffset(fDuplicateNode));

src/bin/bfs_tools/lib/BPlusTree.cpp

565

status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next)

src/bin/bfs_tools/lib/BPlusTree.cpp

62

bplustree_node *

src/bin/bfs_tools/lib/BPlusTree.cpp

626

bplustree_node *node;

src/bin/bfs_tools/lib/BPlusTree.cpp

652

void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index)

src/bin/bfs_tools/lib/BPlusTree.cpp

691

status_t BPlusTree::InsertDuplicate(bplustree_node */*node*/,uint16 /*index*/)

src/bin/bfs_tools/lib/BPlusTree.cpp

722

status_t BPlusTree::SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value)

src/bin/bfs_tools/lib/BPlusTree.cpp

732

bplustree_node *other = fCache.Get(otherOffset = fHeader->maximum_size); //Node(otherOffset = fHeader->maximum_size/*,false*/);

src/bin/bfs_tools/lib/BPlusTree.cpp

766

if (round_up(sizeof(bplustree_node) + bytesBefore + bytesAfter + bytes) +

src/bin/bfs_tools/lib/BPlusTree.cpp

931

bplustree_node *left = fCache.Get(other->left_link);

src/bin/bfs_tools/lib/BPlusTree.cpp

970

bplustree_node *node;

src/bin/bfs_tools/lib/BPlusTree.cpp

992

if (int32(round_up(sizeof(bplustree_node) + node->all_key_length + keyLength)

src/bin/bfs_tools/lib/BPlusTree.h

149

void SetCurrentNode(bplustree_node *node,off_t offset,int8 to = BPLUSTREE_BEGIN);

src/bin/bfs_tools/lib/BPlusTree.h

153

status_t FindKey(bplustree_node *node, uint8 *key, uint16 keyLength, uint16 *index = NULL, off_t *next = NULL);

src/bin/bfs_tools/lib/BPlusTree.h

156

status_t SplitNode(bplustree_node *node, off_t nodeOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength, off_t *_value);

src/bin/bfs_tools/lib/BPlusTree.h

158

void InsertKey(bplustree_node *node, uint8 *key, uint16 keyLength, off_t value, uint16 index);

src/bin/bfs_tools/lib/BPlusTree.h

159

status_t InsertDuplicate(bplustree_node *node,uint16 index);

src/bin/bfs_tools/lib/BPlusTree.h

161

bool CheckNode(bplustree_node *node);

src/bin/bfs_tools/lib/BPlusTree.h

165

bplustree_node *Node(off_t nodeoffset,bool check = true);

src/bin/bfs_tools/lib/BPlusTree.h

264

inline uint16 *bplustree_node::KeyLengths() const

src/bin/bfs_tools/lib/BPlusTree.h

266

return (uint16 *)(((char *)this) + round_up(sizeof(bplustree_node) + all_key_length));

src/bin/bfs_tools/lib/BPlusTree.h

269

inline off_t *bplustree_node::Values() const

src/bin/bfs_tools/lib/BPlusTree.h

274

inline uint8 *bplustree_node::Keys() const

src/bin/bfs_tools/lib/BPlusTree.h

276

return (uint8 *)this + sizeof(bplustree_node);

src/bin/bfs_tools/lib/BPlusTree.h

279

inline int32 bplustree_node::Used() const

src/bin/bfs_tools/lib/BPlusTree.h

281

return round_up(sizeof(bplustree_node) + all_key_length) + all_key_count * (sizeof(uint16) + sizeof(off_t));

src/bin/bfs_tools/lib/BPlusTree.h

284

inline uint8 bplustree_node::LinkType(off_t link)

src/bin/bfs_tools/lib/BPlusTree.h

289

inline off_t bplustree_node::FragmentOffset(off_t link)

src/bin/bfs_tools/lib/BPlusTree.h

95

bplustree_node *Get(off_t offset);

src/bin/bfs_tools/lib/dump.cpp

213

dump_bplustree_node(const bplustree_node* node, const bplustree_header* header,

src/bin/bfs_tools/lib/dump.cpp

274

if (bplustree_node::LinkType(*value)

src/bin/bfs_tools/lib/dump.cpp

278

} else if (bplustree_node::LinkType(*value)

src/bin/bfs_tools/lib/dump.h

12

struct bplustree_node;

src/bin/bfs_tools/lib/dump.h

28

extern void dump_bplustree_node(const bplustree_node* node,

src/tests/add-ons/kernel/file_systems/bfs/btree/test.cpp

72

bplustree_node* node = (bplustree_node*)gBlocks.ItemAt(i);