hfscommon/Misc/HybridAllocator.c

116 alloc_node(u_int32_t length, u_int32_t offset) {
122 		node->length = length;
142  * search functions that operate on extent_node_t's and use cmp_length_node to do length searches.
189  * the offset and length information.  Its link fields are not used in the underlying
200  * the offset and length information.  Its link fields are not used in the underlying
213  * the offset and length information.  Its link fields are not used in the underlying
221 	u_int32_t min_size = key->length;
226 		if (current->length >= min_size) {
240  * the offset and length information.  Its link fields are not used in the underlying
286  * length of the extent represented by node.  The node pointer must point to an
298 			assert ((size <= node->length));
311 		 * If node A has offset B, with length C, in the offset tree, by definition, there
321 		if (node->length == size) {
331 			node->length -= size;
355 	if (node && (node->length < size)) {
358 			printf("HFS Allocator: internal_alloc_space, ptr (%p) node->length (%d), node->offset (%d), off(%d), size (%d) \n",
359 				   node, node->length, node->offset, offset, size);
388 	if (node && (node->length < size)) {
391 			printf("HFS Allocator: internal_alloc_space, ptr (%p) node->length (%d), node->offset (%d), off(%d), size (%d) \n",
392 				   node, node->length, node->offset, offset, size);
401 			assert ((offset + size) <= (node->offset + node->length));
407 		u_int32_t end = node->offset + node->length;
408 		node->length = offset - node->offset;
412 		 * the current extent's length, then yes - we do.
440  * the length of our extent to be freed to its offset.  If something exists at
466         node->length += size;
481 	if (prev && (prev->offset + prev->length) == offset) {
484         node->length += prev->length;
518  * For each node in the tree, print out its length and block offset.
527 		printf("length: %u, offset: %u\n", node->length, node->offset);