Lines Matching refs:out
393 // if the node is out of duplicates, we go directly to the next one
703 // /* and write it out again. */
749 int32 out,in;
750 for (in = out = 0;in < node->all_key_count + 1;) {
756 if (keyIndex < out) {
763 out++;
766 out * (sizeof(uint16) + sizeof(off_t)) >= size) {
774 if (keyIndex >= out && in > 0)
780 //printf("put %ld keys in the other node (%ld, %ld, %ld) (in = %ld)\n",out,bytesBefore,bytes,bytesAfter,in);
785 other->all_key_count = out;
790 int32 keys = out > keyIndex ? keyIndex : out;
807 keys = out - keyIndex - 1;
814 if (in != out)
835 out = 0;
856 out++;
858 //printf("-> out = %ld, keylen = %ld, %ld bytes total\n",out,bytesBefore,round_up(sizeof(bplustree_node) + bytesBefore + bytesAfter + bytes) +
859 // out * (sizeof(uint16) + sizeof(off_t)));
866 if (keyIndex >= in && keyIndex - skip < out) {
879 node->all_key_count = out - 1;
885 //printf("put %ld keys in the first node (%ld, %ld, %ld) (in = %ld)\n",out,bytesBefore,bytes,bytesAfter,in);
890 keys = keyIndex <= skip ? out : keyIndex - skip;
900 in = out - keyIndex - 1;
1096 // never be taken out of the cache