| /haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/ |
| H A D | Index.cpp | 120 IndexIterator::Next(void* buffer, size_t* _keyLength) argument
122 return fIterator != NULL ? fIterator->Next(buffer, _keyLength) : NULL;
|
| H A D | IndexImpl.h | 20 virtual Node* Next(void* buffer, size_t* _keyLength) = 0;
42 virtual Node* Next(void* buffer, size_t* _keyLength);
90 GenericIndexIterator<Policy>::Next(void* buffer, size_t* _keyLength) argument
97 TreePolicy::GetTreeNodeValue(fNextTreeNode, buffer, _keyLength);
241 size_t* _keyLength)
243 Policy::GetNodeValue(GetNode(treeNode), buffer, _keyLength); local
240 GetTreeNodeValue(TreeNode* treeNode, void* buffer, size_t* _keyLength) argument
|
| H A D | NameIndex.cpp | 98 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength) argument
101 *_keyLength = strlen(node->Name());
|
| H A D | Index.h | 81 Node* Next(void* buffer, size_t* _keyLength);
|
| H A D | LastModifiedIndex.cpp | 118 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength) argument
121 *_keyLength = sizeof(time_t);
|
| H A D | SizeIndex.cpp | 117 static void GetNodeValue(Node* node, void* buffer, size_t* _keyLength) argument
120 *_keyLength = sizeof(off_t);
|
| H A D | AttributeIndex.cpp | 143 size_t* _keyLength)
147 *_keyLength = node->length;
142 GetTreeNodeValue(TreeNode* node, void* buffer, size_t* _keyLength) argument
|
| /haiku-fatelf/src/bin/bfs_tools/lib/ |
| H A D | BPlusTree.cpp | 717 status_t BPlusTree::SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value) argument
722 //printf("before (insert \"%s\" (%d bytes) at %d):\n\n",key,*_keyLength,*_keyIndex);
750 bytes = *_keyLength;
838 bytes = *_keyLength;
939 *_keyLength = length;
|
| H A D | BPlusTree.h | 155 status_t SplitNode(bplustree_node *node, off_t nodeOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength, off_t *_value);
|
| /haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/ |
| H A D | BPlusTree.cpp | 856 off_t otherOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength, off_t *_value)
883 bytes = *_keyLength;
957 newLength = *_keyLength;
992 bytes = *_keyLength;
1066 *_keyLength = newLength;
855 SplitNode(bplustree_node *node, off_t nodeOffset, bplustree_node *other, off_t otherOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength, off_t *_value) argument
|
| H A D | BPlusTree.h | 232 off_t otherOffset, uint16 *_keyIndex, uint8 *key, uint16 *_keyLength,
|
| /haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
| H A D | Query.cpp | 123 IndexIterator::GetNextEntry(uint8 *buffer, uint16 *_keyLength, argument
137 *_keyLength = keyLength;
|
| /haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
| H A D | Query.cpp | 110 IndexIterator::GetNextEntry(uint8 *buffer, uint16 *_keyLength, argument
124 *_keyLength = keyLength;
|
| /haiku-fatelf/src/add-ons/kernel/file_systems/bfs/ |
| H A D | BPlusTree.cpp | 1355 uint16* _keyLength, off_t* _value)
1390 bytes = *_keyLength;
1472 newLength = *_keyLength;
1511 bytes = *_keyLength;
1598 *_keyLength = newLength;
1353 _SplitNode(bplustree_node* node, off_t nodeOffset, bplustree_node* other, off_t otherOffset, uint16* _keyIndex, uint8* key, uint16* _keyLength, off_t* _value) argument
|
| H A D | BPlusTree.h | 289 uint8* key, uint16* _keyLength,
|