15 	unsigned long end;  member
32 void accept_memory(phys_addr_t start, phys_addr_t end)  in accept_memory()  argument
52 	if (end < unaccepted->phys_base)  in accept_memory()
57 	end -= unaccepted->phys_base;  in accept_memory()
76 	 * 1. Implicitly extend the range_contains_unaccepted_memory(start, end)  in accept_memory()
77 	 *    checks up to end+unit_size if 'end' is aligned on a unit_size  in accept_memory()
80 	 * 2. Implicitly extend accept_memory(start, end) to end+unit_size if  in accept_memory()
81 	 *    'end' is aligned on a unit_size boundary. (immediately following  in accept_memory()
84 	if (!(end % unit_size))  in accept_memory()
85 		end += unit_size;  in accept_memory()
88 	if (end > unaccepted->size * unit_size * BITS_PER_BYTE)  in accept_memory()
89 		end = unaccepted->size * unit_size * BITS_PER_BYTE;  in accept_memory()
92 	range.end = DIV_ROUND_UP(end, unit_size);  in accept_memory()
104 		if (entry->end <= range.start)  in accept_memory()
106 		if (entry->start >= range.end)  in accept_memory()
126 				   range.end) {  in accept_memory()
155 bool range_contains_unaccepted_memory(phys_addr_t start, phys_addr_t end)  in range_contains_unaccepted_memory()  argument
174 	if (end < unaccepted->phys_base)  in range_contains_unaccepted_memory()
179 	end -= unaccepted->phys_base;  in range_contains_unaccepted_memory()
185 	if (!(end % unit_size))  in range_contains_unaccepted_memory()
186 		end += unit_size;  in range_contains_unaccepted_memory()
189 	if (end > unaccepted->size * unit_size * BITS_PER_BYTE)  in range_contains_unaccepted_memory()
190 		end = unaccepted->size * unit_size * BITS_PER_BYTE;  in range_contains_unaccepted_memory()
193 	while (start < end) {  in range_contains_unaccepted_memory()