56 	m->map_start = start;  in map_create()
106 		    (uintmax_t)n->map_start, (uintmax_t)n->map_size);  in map_add()
110 	while (n != NULL && n->map_start + n->map_size <= start)  in map_add()
118 	if (n->map_start + n->map_size < start + size) {  in map_add()
123 			    n->map_start, n->map_size, start, size);  in map_add()
127 	if (n->map_start == start && n->map_size == size) {  in map_add()
160 	if (start == n->map_start) {  in map_add()
168 		n->map_start += size;  in map_add()
170 	} else if (start + size == n->map_start + n->map_size) {  in map_add()
179 		p = map_create(n->map_start, start - n->map_start, n->map_type);  in map_add()
182 		n->map_start += p->map_size + m->map_size;  in map_add()
216 		if (m->map_type != MAP_TYPE_UNUSED || m->map_start < 2)  in map_alloc()
218 		if (start != 0 && m->map_start > start)  in map_alloc()
222 			delta = start - m->map_start;  in map_alloc()
223 		else if (alignment > 0 && m->map_start % alignment != 0)  in map_alloc()
224 			delta = (m->map_start + alignment) /  in map_alloc()
225 			        alignment * alignment - m->map_start;  in map_alloc()
240 			return map_add(gpt, m->map_start + delta, size,  in map_alloc()
292 			n->map_start += size - prevsize;  in map_resize()
312 			o = map_create(m->map_start + alignsize,  in map_resize()
325 			n->map_start -= alignsize;  in map_resize()
346 		n->map_start += alignsize - m->map_size;  in map_resize()
394 	while (m != NULL && m->map_start + m->map_size <= start)  in map_free()
399 		return (m->map_start + m->map_size >= start + size) ? 1 : 0;  in map_free()
400 	return m->map_size - (start - m->map_start);  in map_free()