Lines Matching defs:maxgap

385 	vsize_t maxgap = entry->gap;
388 	 * We need maxgap to be the largest gap of us or any of our
389 	 * descendents.  Since each of our children's maxgap is the
394 	if ((child = LEFT_ENTRY(entry)) != NULL && maxgap < child->maxgap)
395 		maxgap = child->maxgap;
397 	if ((child = RIGHT_ENTRY(entry)) != NULL && maxgap < child->maxgap)
398 		maxgap = child->maxgap;
400 	return maxgap;
409 	entry->maxgap = uvm_rb_maxgap(entry);
413 		vsize_t maxgap = parent->gap;
417 		if (maxgap < entry->maxgap)
418 			maxgap = entry->maxgap;
420 		 * Since we work towards the root, we know entry's maxgap
428 			brother->maxgap = uvm_rb_maxgap(brother);
429 			if (maxgap < brother->maxgap)
430 				maxgap = brother->maxgap;
433 		parent->maxgap = maxgap;
443 	entry->gap = entry->maxgap = uvm_rb_gap(entry);
598 		if (tmp->maxgap != uvm_rb_maxgap(tmp)) {
599 			printf("maxgap %#lx != %#lx\n",
600 			    (ulong)tmp->maxgap,
2092 	if (tmp == NULL || tmp->maxgap < length)
2106 				    && child->maxgap >= length)
2115 				    && child->maxgap >= length)
2131 		if (child == NULL || child->maxgap < length)
2193 		KASSERTMSG(tmp->maxgap >= length,
2194 		    "tmp->maxgap=0x%"PRIxVSIZE" length=0x%"PRIxVSIZE,
2195 		    tmp->maxgap, length);
2200 		if (child && child->maxgap >= length) {