Searched defs:keyLength (Results 1 - 25 of 27) sorted by relevance

12

/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DAttributeIndex.cpp6 AttributeIndex(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DIndex.cpp116 IndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
137 IndexEntryIterator::GetNext(uint8 *buffer, size_t *keyLength) argument
12 Index(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DLastModifiedIndex.cpp259 LastModifiedIndex::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
H A DNameIndex.cpp255 NameIndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
H A DSizeIndex.cpp258 SizeIndex::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
H A DAttributeIndexImpl.cpp372 AttributeIndexImpl::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
191 AttributeIndexImpl(Volume *volume, const char *name, uint32 type, size_t keyLength) argument
H A DQuery.cpp95 IndexIterator::Find(const uint8 *const key, size_t keyLength) argument
135 size_t keyLength; local
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DAttributeIndex.cpp6 AttributeIndex(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DIndex.cpp114 IndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
135 IndexEntryIterator::GetNext(uint8 *buffer, size_t *keyLength) argument
12 Index(Volume *volume, const char *name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DLastModifiedIndex.cpp259 LastModifiedIndex::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
H A DNameIndex.cpp255 NameIndexEntryIterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
H A DSizeIndex.cpp258 SizeIndex::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
H A DAttributeIndexImpl.cpp376 AttributeIndexImpl::Iterator::GetCurrent(uint8 *buffer, size_t *keyLength) argument
195 AttributeIndexImpl(Volume *volume, const char *name, uint32 type, size_t keyLength) argument
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/
H A DIndex.cpp36 Init(Volume* volume, const char* name, uint32 type, bool fixedKeyLength, size_t keyLength) argument
H A DAttributeIndex.cpp256 Init(Volume* volume, const char* name, uint32 type, size_t keyLength) argument
/haiku-fatelf/src/add-ons/locale/collators/
H A DFrench.cpp129 size_t keyLength = PrimaryKeyLength(length) + length + 1; local
/haiku-fatelf/src/bin/bfs_tools/
H A Dchkindex.cpp213 uint16 keyLength = 0; local
/haiku-fatelf/src/bin/bfs_tools/lib/
H A DBPlusTree.h189 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
560 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next) argument
615 status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint16 keyLength) argument
647 void BPlusTree::InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index) argument
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.cpp292 BPlusTree::FindKey(bplustree_node *node, const uint8 *key, uint16 keyLength, uint16 *index, argument
351 BPlusTree::SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength) argument
433 BPlusTree::Find(const uint8 *key, uint16 keyLength, off_t *_value) argument
538 TreeIterator::Traverse(int8 direction, void *key, uint16 *keyLength, uint16 maxLength, argument
692 Find(const uint8 *key, uint16 keyLength) argument
[all...]
H A DBPlusTree.h261 TreeIterator::GetNextEntry(void *key, uint16 *keyLength, uint16 maxLength, argument
268 GetPreviousEntry(void *key, uint16 *keyLength, uint16 maxLength, off_t *value, uint16 *duplicate) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/ipw2100/
H A Dipw2100.cpp102 uint32 keyLength = 0; local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DBPlusTree.h380 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
590 BPlusTree::SeekDown(Stack<node_and_key> &stack, const uint8 *key, uint16 keyLength) argument
813 BPlusTree::InsertKey(bplustree_node *node, uint16 index, uint8 *key, uint16 keyLength, argument
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/bfs/
H A DBPlusTree.h471 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...]

Completed in 161 milliseconds

12