Searched refs:keyLength (Results 1 - 25 of 44) sorted by relevance

12

/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DAttributeIndex.cpp7 bool fixedKeyLength, size_t keyLength)
8 : Index(volume, name, type, fixedKeyLength, keyLength)
6 AttributeIndex(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DIndex.cpp13 bool fixedKeyLength, size_t keyLength)
18 fKeyLength(keyLength),
116 IndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
118 return (fIterator ? fIterator->GetCurrent(buffer, keyLength) : NULL);
137 IndexEntryIterator::GetNext(uint8 *buffer, size_t *keyLength) argument
141 entry = GetCurrent(buffer, keyLength);
12 Index(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DAttributeIndex.h13 bool fixedKeyLength, size_t keyLength = 0);
H A DIndex.h20 bool fixedKeyLength, size_t keyLength = 0);
64 Entry *GetCurrent(uint8 *buffer, size_t *keyLength);
67 Entry *GetNext(uint8 *buffer, size_t *keyLength);
H A DAttributeIndexImpl.h12 size_t keyLength);
H A DIndexImpl.h16 virtual Entry *GetCurrent(uint8 *buffer, size_t *keyLength) = 0;
35 virtual Entry *GetCurrent(uint8 *buffer, size_t *keyLength) = 0;
H A DQuery.h60 status_t Find(const uint8 *const key, size_t keyLength);
62 status_t GetNextEntry(uint8 *buffer, uint16 *keyLength, size_t bufferSize,
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DAttributeIndex.cpp7 bool fixedKeyLength, size_t keyLength)
8 : Index(volume, name, type, fixedKeyLength, keyLength)
6 AttributeIndex(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DIndex.cpp13 bool fixedKeyLength, size_t keyLength)
18 fKeyLength(keyLength),
114 IndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
116 return (fIterator ? fIterator->GetCurrent(buffer, keyLength) : NULL);
135 IndexEntryIterator::GetNext(uint8 *buffer, size_t *keyLength) argument
139 entry = GetCurrent(buffer, keyLength);
12 Index(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DAttributeIndex.h13 bool fixedKeyLength, size_t keyLength = 0);
H A DIndex.h20 bool fixedKeyLength, size_t keyLength = 0);
64 Entry *GetCurrent(uint8 *buffer, size_t *keyLength);
67 Entry *GetNext(uint8 *buffer, size_t *keyLength);
H A DAttributeIndexImpl.h12 size_t keyLength);
H A DIndexImpl.h16 virtual Entry *GetCurrent(uint8 *buffer, size_t *keyLength) = 0;
35 virtual Entry *GetCurrent(uint8 *buffer, size_t *keyLength) = 0;
H A DQuery.h60 status_t Find(const uint8 *const key, size_t keyLength);
61 status_t GetNextEntry(uint8 *buffer, uint16 *keyLength, size_t bufferSize,
/haiku-fatelf/src/bin/bfs_tools/lib/
H A DBPlusTree.h63 uint8 *KeyAt(int32 index,uint16 *keyLength) const;
120 status_t GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
121 status_t GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
123 status_t Insert(uint8 *key, uint16 keyLength, off_t value);
133 status_t Find(uint8 *key, uint16 keyLength, off_t *value);
149 status_t Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
152 status_t FindKey(bplustree_node *node, uint8 *key, uint16 keyLength, uint16 *index = NULL, off_t *next = NULL);
153 status_t SeekDown(Stack<node_and_key> &stack, uint8 *key, uint16 keyLength);
157 void InsertKey(bplustree_node *node, uint8 *key, uint16 keyLength, off_t value, uint16 index);
189 inline status_t BPlusTree::GetNextEntry(void *key,uint16 *keyLength,uint1 argument
194 GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument
[all...]
H A DBPlusTree.cpp366 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument
454 *keyLength = length;
560 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next) argument
582 int32 cmp = CompareKeys(key,keyLength,searchKey,searchLength);
615 status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint16 keyLength) argument
633 status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex,&nextOffset);
647 void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index) argument
658 node->all_key_length += keyLength;
671 newKeyLengths[i] = keyLengths[i - 1] + keyLength;
675 newKeyLengths[index] = keyLength
946 Insert(uint8 *key,uint16 keyLength,off_t value) argument
1036 Find(uint8 *key,uint16 keyLength,off_t *value) argument
[all...]
/haiku-fatelf/src/system/boot/loader/file_systems/bfs/
H A DBPlusTree.h77 uint8 *KeyAt(int32 index,uint16 *keyLength) const;
184 status_t Find(const uint8 *key, uint16 keyLength, off_t *value);
195 status_t FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength,
197 status_t SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength);
225 status_t Traverse(int8 direction, void *key, uint16 *keyLength, uint16 maxLength,
227 status_t Find(const uint8 *key, uint16 keyLength);
230 status_t GetNextEntry(void *key, uint16 *keyLength, uint16 maxLength,
232 status_t GetPreviousEntry(void *key, uint16 *keyLength, uint16 maxLength,
261 TreeIterator::GetNextEntry(void *key, uint16 *keyLength, uint16 maxLength, argument
264 return Traverse(BPLUSTREE_FORWARD, key, keyLength, maxLengt
268 GetPreviousEntry(void *key, uint16 *keyLength, uint16 maxLength, off_t *value, uint16 *duplicate) argument
[all...]
H A DBPlusTree.cpp292 BPlusTree::FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength, uint16 *index, argument
318 int32 cmp = CompareKeys(key, keyLength, searchKey, searchLength);
351 BPlusTree::SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength) argument
370 status_t status = FindKey(node, key, keyLength, &nodeAndKey.keyIndex, &nextOffset);
433 BPlusTree::Find(const uint8 *key, uint16 keyLength, off_t *_value) argument
435 if (keyLength < BPLUSTREE_MIN_KEY_LENGTH || keyLength > BPLUSTREE_MAX_KEY_LENGTH
451 status_t status = FindKey(node, key, keyLength, &keyIndex, &nextOffset);
538 TreeIterator::Traverse(int8 direction, void *key, uint16 *keyLength, uint16 maxLength, argument
647 *keyLength
692 Find(const uint8 *key, uint16 keyLength) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.h91 uint8* KeyAt(int32 index, uint16* keyLength) const;
226 const uint8* key, uint16 keyLength,
229 const uint8* key, uint16 keyLength,
250 const uint8* key, uint16 keyLength,
252 status_t Find(const uint8* key, uint16 keyLength,
270 const uint8* key, uint16 keyLength,
273 const uint8* key, uint16 keyLength);
285 uint8* key, uint16 keyLength, off_t value);
306 const uint8* largestKey, uint16 keyLength,
312 uint16 keyLength);
471 GetNextEntry(void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument
480 GetPreviousEntry(void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument
[all...]
H A DBPlusTree.cpp983 uint16 keyLength, uint16* _index, off_t* _next)
1013 int32 cmp = _CompareKeys(key, keyLength, searchKey, searchLength);
1046 uint16 keyLength)
1065 status_t status = _FindKey(node, key, keyLength, &nodeAndKey.keyIndex,
1302 uint16 keyLength, off_t value)
1314 + keyLength);
1329 BFS_ENDIAN_TO_HOST_INT16(keyLengths[i - 1]) + keyLength);
1334 newKeyLengths[index] = HOST_ENDIAN_TO_BFS_INT16(keyLength
1342 memmove(keys + length, keys + length - keyLength, size);
1344 memcpy(keys + keyStart, key, keyLength);
982 _FindKey(const bplustree_node* node, const uint8* key, uint16 keyLength, uint16* _index, off_t* _next) argument
1045 _SeekDown(Stack<node_and_key>& stack, const uint8* key, uint16 keyLength) argument
1301 _InsertKey(bplustree_node* node, uint16 index, uint8* key, uint16 keyLength, off_t value) argument
1613 Insert(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument
2035 Remove(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument
2158 Replace(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument
2213 Find(const uint8* key, uint16 keyLength, off_t* _value) argument
2297 uint16 keyLength; local
2453 _ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level, off_t offset, off_t lastOffset, off_t nextOffset, const uint8* key, uint16 keyLength) argument
2565 Traverse(int8 direction, void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument
2716 Find(const uint8* key, uint16 keyLength) argument
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DBPlusTree.h80 uint8 *KeyAt(int32 index, uint16 *keyLength) const;
197 status_t Remove(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value);
198 status_t Insert(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value);
209 status_t Replace(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value);
210 status_t Find(const uint8 *key, uint16 keyLength, off_t *value);
221 status_t FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength,
223 status_t SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength);
229 void InsertKey(bplustree_node *node, uint16 index, uint8 *key, uint16 keyLength,
270 status_t Traverse(int8 direction, void *key, uint16 *keyLength, uint16 maxLength,
272 status_t Find(const uint8 *key, uint16 keyLength);
380 GetNextEntry(void *key, uint16 *keyLength, uint16 maxLength, off_t *value, uint16 *duplicate) argument
387 GetPreviousEntry(void *key, uint16 *keyLength, uint16 maxLength, off_t *value, uint16 *duplicate) argument
[all...]
H A DBPlusTree.cpp531 BPlusTree::FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength, uint16 *index, argument
557 int32 cmp = CompareKeys(key, keyLength, searchKey, searchLength);
590 BPlusTree::SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength) argument
609 status_t status = FindKey(node, key, keyLength, &nodeAndKey.keyIndex, &nextOffset);
813 BPlusTree::InsertKey(bplustree_node *node, uint16 index, uint8 *key, uint16 keyLength, argument
825 node->all_key_length = HOST_ENDIAN_TO_BFS_INT16(node->AllKeyLength() + keyLength);
838 newKeyLengths[i] = HOST_ENDIAN_TO_BFS_INT16(BFS_ENDIAN_TO_HOST_INT16(keyLengths[i - 1]) + keyLength);
842 newKeyLengths[index] = HOST_ENDIAN_TO_BFS_INT16(keyLength + (keyStart = index > 0 ? BFS_ENDIAN_TO_HOST_INT16(newKeyLengths[index - 1]) : 0));
848 memmove(keys + length, keys + length - keyLength, size);
850 memcpy(keys + keyStart, key, keyLength);
1077 Insert(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value) argument
1446 Remove(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value) argument
1553 Replace(Transaction *transaction, const uint8 *key, uint16 keyLength, off_t value) argument
1603 Find(const uint8 *key, uint16 keyLength, off_t *_value) argument
1729 Traverse(int8 direction, void *key, uint16 *keyLength, uint16 maxLength, off_t *value, uint16 *duplicate) argument
1870 Find(const uint8 *key, uint16 keyLength) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/
H A DIndex.cpp37 size_t keyLength)
45 fKeyLength = keyLength;
36 Init(Volume* volume, const char* name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DAttributeIndex.h24 uint32 type, size_t keyLength);
/haiku-fatelf/src/bin/bfs_tools/
H A Dchkindex.cpp213 uint16 keyLength = 0; local
238 keyLength = sizeof(off_t);
243 keyLength = strlen(key);
251 keyLength = sizeof(off_t);
267 keyLength = length > B_FILE_NAME_LENGTH ? B_FILE_NAME_LENGTH : length;
277 if (tree.Find((uint8 *)key,keyLength,&value) < B_OK)
338 if (keyLength == length && !memcmp(key,name,keyLength))

Completed in 277 milliseconds

12