Lines Matching refs:uint16

93 			uint16				all_key_count;
94 uint16 all_key_length;
105 uint16 NumKeys() const
108 uint16 AllKeyLength() const
112 inline Unaligned<uint16>* KeyLengths() const;
116 uint8* KeyAt(int32 index, uint16* keyLength) const;
170 uint16 keyIndex;
279 const uint8* key, uint16 keyLength,
282 const uint8* key, uint16 keyLength,
303 const uint8* key, uint16 keyLength,
307 status_t Find(const uint8* key, uint16 keyLength,
327 const uint8* key, uint16 keyLength,
328 uint16* index = NULL, off_t* next = NULL);
331 const uint8* key, uint16 keyLength);
340 const bplustree_node* node, uint16 index,
342 void _InsertKey(bplustree_node* node, uint16 index,
343 uint8* key, uint16 keyLength, off_t value);
346 off_t otherOffset, uint16* _keyIndex,
347 uint8* key, uint16* _keyLength,
352 CachedNode& cached, uint16 keyIndex,
354 void _RemoveKey(bplustree_node* node, uint16 index);
357 uint16 keyIndex, uint16 splitAt,
364 const uint8* largestKey, uint16 keyLength,
370 uint16 keyLength);
402 uint16* keyLength, uint16 maxLength,
403 off_t* value, uint16* duplicate = NULL);
404 status_t Find(const uint8* key, uint16 keyLength);
407 status_t GetNextEntry(void* key, uint16* keyLength,
408 uint16 maxLength, off_t* value,
409 uint16* duplicate = NULL);
410 status_t GetPreviousEntry(void* key, uint16* keyLength,
411 uint16 maxLength, off_t* value,
412 uint16* duplicate = NULL);
426 uint16 keyIndex, uint16 splitAt,
436 uint16 fDuplicate;
437 uint16 fNumDuplicates;
531 TreeIterator::GetNextEntry(void* key, uint16* keyLength, uint16 maxLength,
532 off_t* value, uint16* duplicate)
540 TreeIterator::GetPreviousEntry(void* key, uint16* keyLength, uint16 maxLength,
541 off_t* value, uint16* duplicate)
574 inline Unaligned<uint16>*
577 return (Unaligned<uint16>*)(((char*)this) + key_align(sizeof(bplustree_node)
586 (char*)KeyLengths() + NumKeys() * sizeof(uint16));
601 * (sizeof(uint16) + sizeof(off_t));