| /haiku/src/add-ons/kernel/file_systems/ramfs/ |
| H A D | AttributeIndex.cpp | 8 AttributeIndex(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
|
| H A D | Index.cpp | 119 IndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
140 IndexEntryIterator::GetNext(uint8 *buffer, size_t *keyLength) argument
15 Index(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
|
| H A D | SizeIndex.cpp | 261 SizeIndex::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
|
| H A D | LastModifiedIndex.cpp | 262 LastModifiedIndex::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
|
| H A D | NameIndex.cpp | 258 NameIndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
|
| H A D | AttributeIndexImpl.cpp | 377 AttributeIndexImpl::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
196 AttributeIndexImpl(Volume *volume, const char *name, uint32 type, size_t keyLength) argument
|
| H A D | Query.cpp | 47 IndexIterator::Find(const uint8 *const key, size_t keyLength) argument
86 size_t keyLength; local
|
| /haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
| H A D | Index.cpp | 35 Init(Volume* volume, const char* name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
|
| H A D | AttributeIndex.cpp | 271 Init(Volume* volume, const char* name, uint32 type, size_t keyLength) argument
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | CheckVisitor.cpp | 762 size_t keyLength = sizeof(key); local
|
| H A D | BPlusTree.h | 531 GetNextEntry(void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument
540 GetPreviousEntry(void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument
[all...] |
| H A D | BPlusTree.cpp | 1043 _FindKey(const bplustree_node* node, const uint8* key, uint16 keyLength, uint16* _index, off_t* _next) argument
1109 _SeekDown(Stack<node_and_key>& stack, const uint8* key, uint16 keyLength) argument
1365 _InsertKey(bplustree_node* node, uint16 index, uint8* key, uint16 keyLength, off_t value) argument
1678 Insert(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument
2098 Remove(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument
2221 Replace(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument
2277 Find(const uint8* key, uint16 keyLength, off_t* _value) argument
2365 uint16 keyLength; local
2521 _ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level, off_t offset, off_t lastOffset, off_t nextOffset, const uint8* key, uint16 keyLength) argument
2640 Traverse(int8 direction, void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument
2808 Find(const uint8* key, uint16 keyLength) argument
[all...] |
| /haiku/src/bin/bfs_tools/ |
| H A D | chkindex.cpp | 214 uint16 keyLength = 0; local
|
| /haiku/src/bin/bfs_tools/lib/ |
| H A D | BPlusTree.h | 190 inline status_t BPlusTree::GetNextEntry(void *key,uint16 *keyLength,uint1 argument
195 GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument
[all...] |
| H A D | BPlusTree.cpp | 370 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument
564 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next) argument
619 status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint16 keyLength) argument
651 void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index) argument
950 Insert(uint8 *key,uint16 keyLength,off_t value) argument
1040 Find(uint8 *key,uint16 keyLength,off_t *value) argument
[all...] |