Lines Matching defs:out
560 // else it will fail because the requested node is out of bounds
883 // It's not important to write it out in a single transaction; just
1431 FATAL(("key index out of bounds: %d, num keys: %u, inode %" B_PRIdOFF
1446 int32 out, in;
1448 for (in = out = 0; in < node->NumKeys() + 1;) {
1456 if (keyIndex < out)
1461 out++;
1464 + out * (sizeof(uint16) + sizeof(off_t)) >= size) {
1473 if (keyIndex >= out && in > 0)
1475 else if (keyIndex + 1 < out)
1485 other->all_key_count = HOST_ENDIAN_TO_BFS_INT16(out);
1489 int32 keys = out > keyIndex ? keyIndex : out;
1507 keys = out - keyIndex - 1;
1519 if (in != out)
1567 out = 0;
1577 out++;
1590 out++;
1610 node->all_key_count = HOST_ENDIAN_TO_BFS_INT16(out);
1619 keys = keyIndex <= skip ? out : keyIndex - skip;
1621 in = out - keyIndex - 1;
2168 // if we've made a leaf node out of the root node, we need
2677 // If the node is out of duplicates, we go directly to the next