Lines Matching refs:bytes
245 // Since BFS supports block sizes of 1024 bytes or greater, and the node size
246 // is hard-coded to 1024 bytes, that's not an issue now.
1440 // "bytes" is the number of bytes written for the new key,
1441 // "bytesBefore" are the bytes before that key
1442 // "bytesAfter" are the bytes after the new key, if any
1443 int32 bytes = 0, bytesBefore = 0, bytesAfter = 0;
1451 if (in == keyIndex && !bytes) {
1452 bytes = *_keyLength;
1463 if (key_align(sizeof(bplustree_node) + bytes + keyLengths)
1483 other->all_key_length = HOST_ENDIAN_TO_BFS_INT16(bytes + bytesBefore
1497 if (bytes) {
1499 memcpy(outKeys + bytesBefore, key, bytes);
1500 outKeyLengths[keyIndex] = HOST_ENDIAN_TO_BFS_INT16(bytes + bytesBefore);
1505 memcpy(outKeys + bytesBefore + bytes, inKeys + bytesBefore,
1511 + bytes);
1566 bytesBefore = bytesAfter = bytes = 0;
1570 if (in == keyIndex && !bytes) {
1576 bytes = *_keyLength;
1583 if (bytes) {
1585 BFS_ENDIAN_TO_HOST_INT16(inKeyLengths[in]) + bytes);
1588 - bytesBefore - bytes;
1608 node->all_key_length = HOST_ENDIAN_TO_BFS_INT16(bytes + bytesBefore
1623 // went to the other node. But in this case bytes and bytesAfter are
1629 memmove(inKeys + bytesBefore + bytes, inKeys + total + bytesBefore,
1648 if (bytes) {
1650 memcpy(inKeys + bytesBefore, key, bytes);
1651 outKeyLengths[keyIndex] = HOST_ENDIAN_TO_BFS_INT16(bytes + bytesBefore);
2633 That's not too nice, but saves the 256 bytes that would be needed to
2952 // of 1024 bytes - with future versions of BFS, this may be a problem