hfscommon/Misc/VolumeAllocation.c

192 					Checks the embedded linked list structure of the red black tree for integrity.  The next pointer
262 	 * HFSDBG_UNMAP_ENABLED: Log events involving the trim list.
366                              u_int32_t numBlocks, struct jnl_trim_list *list);
368 static int hfs_issue_unmap (struct hfsmount *hfsmp, struct jnl_trim_list *list);
374                                 struct jnl_trim_list *list);
440  * Validation Routine to verify that the TRIM list maintained by the journal
442  * never encounter allocated blocks in the TRIM list, so if we ever encounter them,
569  ;  list            - The list of currently tracked trim ranges.
573                               u_int32_t numBlocks, struct jnl_trim_list *list) {
580         int extent_no = list->extent_count;
585         list->extents[extent_no].offset = offset;
586         list->extents[extent_no].length = length;
587         list->extent_count++;
588         if (list->extent_count == list->allocated_count) {
589             error = hfs_issue_unmap (hfsmp, list);
605  ;  list            - The list of currently tracked trim ranges.
609 static int hfs_issue_unmap (struct hfsmount *hfsmp, struct jnl_trim_list *list) {
613     if (list->extent_count > 0) {
615         unmap.extents = list->extents;
616         unmap.extentsCount = list->extent_count;
621         bzero (list->extents, (list->allocated_count * sizeof(dk_extent_t)));
622         list->extent_count = 0;
991 		 * that list when the higher level caller tried (and failed) a
1753 			/* Dump the list ? */
1756 			printf("HFS allocator: Done printing list on FS (%s). Min %d, Max %d, Tree still alive.\n",
2072 		 * subsequently, the journal's trim list) that we are allocating these
2074 		 * and the functions it calls will serialize behind the journal trim list lock
2076 		 * us manipulating the trim list, or we get there first and successfully remove
3295 		 * lets add this free block run to our free extent cache list
3443  * This function iterates through the red-black tree's nodes, and then verifies that the linked list
3805  * We may add it to the list of blocks to be UNMAP/TRIM'd or add it to allocator
3825                                 struct jnl_trim_list *list) {
3888                     hfs_track_unmap_blocks (hfsmp, offset, size, list);
3911         hfs_track_unmap_blocks (hfsmp, offset, size, list);
4125 	 * iterate through the tree quickly using its embedded linked list.  This results in tree
4270 					 * the last element in the tree in the linked list.
4282 			 * the offset tree.  We'll simply iterate through the tree linked list, removing the current
4354  * Remove an extent from the list of free extents.
4358  * match an extent already in the list; it will be removed, and any following
4359  * extents in the list will be shifted up.
4386  * Add an extent to the list of free extents.
4391  * If the list is full, this routine will handle either removing the last
4392  * extent in the list to make room for the new extent, or ignoring the
4393  * new extent if it is "worse" than the last extent in the list.
4401  *	if the extent was not inserted (the list was full, and the extent
4402  *	being added was "worse" than everything in the list).
4408 	/* ALLOC_DEBUG: Make sure no extents in the list overlap or are contiguous with the input extent. */
4424 			/* The list is sorted by increasing offset. */
4429 			/* The list is sorted by decreasing size. */
4439 		 * The new extent is worse than anything already in the list,
4440 		 * and the list is full, so just ignore the extent to be added.
4446 	 * Grow the list (if possible) to make room for an insert.
4528 			 * in the list.
4540 		 * the list.
4602  *	true		- if the extent was added successfully to the list
4603  *	false		- if the extent was not added to the list, maybe because
4667 			 * in the list.
4714 		 * very long for large extents that get added to the list.
4721 		 * restart if the list changed while we dropped the lock.)