324 			      struct cma_init_memrange *mrp)  in revsizecmp()  argument
326 	return mlp->size > mrp->size;  in revsizecmp()
330 			   struct cma_init_memrange *mrp)  in basecmp()  argument
332 	return mlp->base < mrp->base;  in basecmp()
340 	struct cma_init_memrange *mrp,  in list_insert_sorted()  argument
347 		list_add(&mrp->list, ranges);  in list_insert_sorted()
351 			if (cmp(mlp, mrp))  in list_insert_sorted()
354 		__list_add(&mrp->list, mlp->list.prev, &mlp->list);  in list_insert_sorted()
535 	struct cma_init_memrange *mrp, *mlp, *failed;  in cma_declare_contiguous_multi()  local
609 			mrp = &memranges[nr++];  in cma_declare_contiguous_multi()
611 			mrp = list_last_entry(&ranges,  in cma_declare_contiguous_multi()
613 			if (size < mrp->size)  in cma_declare_contiguous_multi()
615 			list_del(&mrp->list);  in cma_declare_contiguous_multi()
616 			sizesum -= mrp->size;  in cma_declare_contiguous_multi()
618 				(u64)mrp->base, (u64)mrp->base + size);  in cma_declare_contiguous_multi()
620 		mrp->base = start;  in cma_declare_contiguous_multi()
621 		mrp->size = size;  in cma_declare_contiguous_multi()
626 		list_insert_sorted(&ranges, mrp, revsizecmp);  in cma_declare_contiguous_multi()
628 		    (u64)mrp->base, (u64)mrp->base + size);  in cma_declare_contiguous_multi()