Searched refs:bplustree_node (Results 1 - 11 of 11) sorted by relevance

/haiku/src/bin/bfs_tools/lib/
H A Ddump.h12 struct bplustree_node;
28 extern void dump_bplustree_node(const bplustree_node* node,
H A DBPlusTree.h53 struct __attribute((packed)) bplustree_node {
95 bplustree_node *Get(off_t offset);
96 // void SetOffset(bplustree_node *, off_t offset);
149 void SetCurrentNode(bplustree_node *node,off_t offset,int8 to = BPLUSTREE_BEGIN);
153 status_t FindKey(bplustree_node *node, uint8 *key, uint16 keyLength, uint16 *index = NULL, off_t *next = NULL);
156 status_t SplitNode(bplustree_node *node, off_t nodeOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength, off_t *_value);
158 void InsertKey(bplustree_node *node, uint8 *key, uint16 keyLength, off_t value, uint16 index);
159 status_t InsertDuplicate(bplustree_node *node,uint16 index);
161 bool CheckNode(bplustree_node *node);
165 bplustree_node *Nod
[all...]
H A DBPlusTree.cpp25 CacheableNode(off_t offset,bplustree_node *node)
44 bplustree_node *fNode;
62 bplustree_node *
204 bplustree_node *node = fCache.Get(header.root_node_pointer);
265 bplustree_node *node;
307 bplustree_node *node = fCache.Get(offset);
322 void BPlusTree::SetCurrentNode(bplustree_node *node,off_t offset,int8 to)
339 bplustree_node *node;
376 bplustree_node *node;
385 node = fCache.Get(bplustree_node
[all...]
H A Ddump.cpp212 dump_bplustree_node(const bplustree_node* node, const bplustree_header* header,
215 Print("bplustree_node (%s node):\n",
273 if (bplustree_node::LinkType(*value)
277 } else if (bplustree_node::LinkType(*value)
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.h28 struct bplustree_node;
53 inline bool CheckNode(const bplustree_node* node) const;
89 struct bplustree_node { struct in namespace:BFS
212 const bplustree_node* SetTo(off_t offset, bool check = true);
214 const bplustree_node** _node,
221 bplustree_node* SetToWritable(Transaction& transaction,
223 bplustree_node* MakeWritable(Transaction& transaction);
230 bplustree_node** _node, off_t* _offset);
234 bplustree_node* Node() const { return fNode; }
237 bplustree_node* InternalSetT
[all...]
H A DBPlusTree.cpp78 NodeChecker(const bplustree_node* node, int32 nodeSize, const char* text)
102 const bplustree_node* fNode;
288 const bplustree_node*
291 const bplustree_node* node;
300 CachedNode::SetTo(off_t offset, const bplustree_node** _node, bool check)
332 bplustree_node*
363 bplustree_node*
422 bplustree_node*
470 fNode = (bplustree_node*)(block + offset
522 CachedNode::Allocate(Transaction& transaction, bplustree_node** _nod
[all...]
H A DDebug.h85 struct bplustree_node;
98 extern void dump_bplustree_node(const bplustree_node *node,
H A DDebug.cpp197 dump_bplustree_node(const bplustree_node* node, const bplustree_header* header,
200 kprintf("bplustree_node:\n");
256 if (bplustree_node::LinkType(*value)
260 } else if (bplustree_node::LinkType(*value)
429 bplustree_node* node = (bplustree_node*)parse_expression(argv[1]);
/haiku/src/bin/bfs_tools/
H A Dbfsinfo.cpp45 bplustree_node *node = (bplustree_node *)(buffer + nodeSize);
57 node = (bplustree_node *)((addr_t)node + nodeSize);
H A Dchkindex.cpp322 if (bplustree_node::LinkType(value) == BPLUSTREE_NODE)
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dtest.cpp72 bplustree_node* node = (bplustree_node*)gBlocks.ItemAt(i);

Completed in 103 milliseconds