Lines Matching refs:used

82 	uint16			used;		// defines how much memory is used by this node
123 uint16 space = used + header->tail_space;
622 dprintf(" node %p, offset %lu, used %u, header %u, tail %u, "
623 "header %p\n", node, node->offset, node->used, node->HeaderSpace(),
630 dump_block((char*)node->start, min_c(node->used, 64), " ");
683 size += node->used;
956 node->used = 0;
995 // Move all used and tail space to the header space, which is useful in case
1016 while (node != NULL && node->offset + node->used <= offset)
1048 if (append_data(dest, node->start, node->used) < B_OK) {
1056 int32 diff = node->offset + node->used - size;
1057 if (append_data(dest, node->start, node->used - diff) < B_OK) {
1195 if (append_data(duplicate, node->start, node->used) < B_OK) {
1281 node->used = sourceNode->used;
1286 // has to be used carefully
1421 with->size -= node->used;
1442 buffer->size += node->used;
1485 size_t written = min_c(size, node->used - offset);
1532 size_t bytesRead = min_c(size, node->used - offset);
1612 node->used += willConsume;
1624 offset += node->used;
1633 node->used += size;
1708 node->used += previousTailSpace;
1718 // last data_header and not all available space is used
1735 node->used = sizeUsed;
1764 *_contiguousBuffer = node->start + node->used;
1766 node->used += size;
1782 size_t used = buffer->size;
1796 write_data(buffer, used, data, size);
1832 if (node->used > left)
1837 left -= node->used;
1846 size_t cut = min_c(node->used, left);
1853 node->used -= cut;
1910 int32 diff = node->used + node->offset - newSize;
1912 node->used -= diff;
1914 if (node->used > 0)
1980 clone->used = min_c(bytes, node->used - offset);
1991 bytes -= clone->used;
1992 buffer->size += clone->used;
1993 sizeAppended += clone->used;
2203 if (size > node->used - offset)
2232 size_t bytes = min_c(size, node->used - offset);
2269 if (node->used > 0) {
2271 iovecs[count].iov_len = node->used;
2290 if (node->used > 0)