hfscommon/Misc/VolumeAllocation.c

465 				numblocks = trim->extents[i].length / hfsmp->blockSize;
507 	u_int64_t length;
523 		length = (u_int64_t) numBlocks * hfsmp->blockSize;
526 		if ((offset >= device_sz) || ((offset + length) > device_sz)) {
527 			printf("hfs_unmap_free_ext: ignoring trim @ off %lld len %lld \n", offset, length);
532 			err = journal_trim_add_extent(hfsmp->jnl, offset, length);
576     u_int64_t length;
582         length = (u_int64_t) numBlocks * hfsmp->blockSize;
586         list->extents[extent_no].length = length;
648 	u_int64_t length;
656 		length = (u_int64_t) numBlocks * hfsmp->blockSize;
658 		err = journal_trim_remove_extent(hfsmp->jnl, offset, length);
710 		numBlocks = extents[i].length / hfsmp->blockSize;
1031 		//	Adding in the length of the current allocation might reduce the next allocate
1606 		*actualNumBlocks = node->length;
1621 				printf("bad node: %p, offset %d, length %d\n", node, node->offset,node->length);
1655 	 * we'll start by searching the offset tree rather than the normal length
1660 	search_sentinel.length = minBlocks;
1681 			 * means no node existed at that offset.  If the previous node's offset + length crosses
1689 				u_int32_t node_end = metaend_node->offset + metaend_node->length;
1698 						tempnode.length = MIN(minBlocks, node_end - tempnode.offset);
1710 		search_sentinel.length = minBlocks;
1715 	if ((node) && (node->length >= minBlocks)) {
1717 		if (node->length >= maxBlocks) {
1721 			*actualNumBlocks = node->length;
3379 		len1 = node1->length;
3385 		 * matching this start and length.  Alloc != 0 means some portion of the extent
3499 	search_sentinel.length = numBlocks;
3517 		if ((node->offset + node->length) >= (startBlock + numBlocks)) {
4249 				if ((node->offset + node->length) > new_end_block) {
4254 					node->length = new_end_block - node->offset;
4620 	 * to the red-black tree, where it will get sorted by offset and length.  The only special