Cross Reference: /src/sys/uvm/uvm

Lines Matching refs:gap
371  * uvm_rb_gap: return the gap size between our entry and next entry.
385 	vsize_t maxgap = entry->gap;
388 	 * We need maxgap to be the largest gap of us or any of our
390 	 * cached value of their largest gap of themselves or their
408 	KASSERT(entry->gap == uvm_rb_gap(entry));
413 		vsize_t maxgap = parent->gap;
416 		KDASSERT(parent->gap == uvm_rb_gap(parent));
427 			KDASSERT(brother->gap == uvm_rb_gap(brother));
443 	entry->gap = entry->maxgap = uvm_rb_gap(entry);
445 		entry->prev->gap = uvm_rb_gap(entry->prev);
485 		 * Update the previous entry's gap due to our absence.
487 		entry->prev->gap = uvm_rb_gap(entry->prev);
573 		if (tmp->gap != uvm_rb_gap(tmp)) {
574 			printf("%d/%d gap %#lx != %#lx %s\n",
576 			    (ulong)tmp->gap, (ulong)uvm_rb_gap(tmp),
581 		 * If any entries are out of order, tmp->gap will be unsigned
584 		if (tmp->gap >= vm_map_max(map) - vm_map_min(map)) {
585 			printf("too large gap %zu\n", (size_t)tmp->gap);
1395 		 * and our gap has shrunk.  Then fix the tree.
1398 		prev_entry->gap -= size;
1525 				prev_entry->gap -= size;
1526 				KASSERT(prev_entry->gap == uvm_rb_gap(prev_entry));
1751  * See if the range between start and start + length fits in the gap
2011 			/* Start from lower gap. */
2022 			/* "hint" address is gap but too small */
2028 			 * See if given hint fits in this gap.
2046 				/* Start from higher gap. */
2099 		KASSERT(tmp->next->start == tmp->end + tmp->gap);
2103 				if (tmp->gap >= length)
2112 				if (tmp->gap >= length)
2124 			if (tmp->gap >= length)
2159 		if (tmp->gap >= length)
2184 	if (prev->gap >= length)
2204 		if (tmp->gap >= length)
2239 	 * the gap between existing regions, or after the very last region.
2240 	 * note: entry->end = base VA of current gap,
2241 	 *	 entry->next->start = VA of end of current gap
2246 		/* Update hint for current gap. */
2262 		/* Advance to next/previous gap */
OpenGrok
