]>
git.ipfire.org Git - people/ms/u-boot.git/blob - lib/lmb.c
2 * Procedures for maintaining information about logical memory blocks.
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
7 * SPDX-License-Identifier: GPL-2.0+
13 #define LMB_ALLOC_ANYWHERE 0
15 void lmb_dump_all(struct lmb
*lmb
)
20 debug("lmb_dump_all:\n");
21 debug(" memory.cnt = 0x%lx\n", lmb
->memory
.cnt
);
22 debug(" memory.size = 0x%llx\n",
23 (unsigned long long)lmb
->memory
.size
);
24 for (i
=0; i
< lmb
->memory
.cnt
;i
++) {
25 debug(" memory.reg[0x%lx].base = 0x%llx\n", i
,
26 (long long unsigned)lmb
->memory
.region
[i
].base
);
27 debug(" .size = 0x%llx\n",
28 (long long unsigned)lmb
->memory
.region
[i
].size
);
31 debug("\n reserved.cnt = 0x%lx\n",
33 debug(" reserved.size = 0x%llx\n",
34 (long long unsigned)lmb
->reserved
.size
);
35 for (i
=0; i
< lmb
->reserved
.cnt
;i
++) {
36 debug(" reserved.reg[0x%lx].base = 0x%llx\n", i
,
37 (long long unsigned)lmb
->reserved
.region
[i
].base
);
38 debug(" .size = 0x%llx\n",
39 (long long unsigned)lmb
->reserved
.region
[i
].size
);
44 static long lmb_addrs_overlap(phys_addr_t base1
,
45 phys_size_t size1
, phys_addr_t base2
, phys_size_t size2
)
47 return ((base1
< (base2
+size2
)) && (base2
< (base1
+size1
)));
50 static long lmb_addrs_adjacent(phys_addr_t base1
, phys_size_t size1
,
51 phys_addr_t base2
, phys_size_t size2
)
53 if (base2
== base1
+ size1
)
55 else if (base1
== base2
+ size2
)
61 static long lmb_regions_adjacent(struct lmb_region
*rgn
,
62 unsigned long r1
, unsigned long r2
)
64 phys_addr_t base1
= rgn
->region
[r1
].base
;
65 phys_size_t size1
= rgn
->region
[r1
].size
;
66 phys_addr_t base2
= rgn
->region
[r2
].base
;
67 phys_size_t size2
= rgn
->region
[r2
].size
;
69 return lmb_addrs_adjacent(base1
, size1
, base2
, size2
);
72 static void lmb_remove_region(struct lmb_region
*rgn
, unsigned long r
)
76 for (i
= r
; i
< rgn
->cnt
- 1; i
++) {
77 rgn
->region
[i
].base
= rgn
->region
[i
+ 1].base
;
78 rgn
->region
[i
].size
= rgn
->region
[i
+ 1].size
;
83 /* Assumption: base addr of region 1 < base addr of region 2 */
84 static void lmb_coalesce_regions(struct lmb_region
*rgn
,
85 unsigned long r1
, unsigned long r2
)
87 rgn
->region
[r1
].size
+= rgn
->region
[r2
].size
;
88 lmb_remove_region(rgn
, r2
);
91 void lmb_init(struct lmb
*lmb
)
93 /* Create a dummy zero size LMB which will get coalesced away later.
94 * This simplifies the lmb_add() code below...
96 lmb
->memory
.region
[0].base
= 0;
97 lmb
->memory
.region
[0].size
= 0;
102 lmb
->reserved
.region
[0].base
= 0;
103 lmb
->reserved
.region
[0].size
= 0;
104 lmb
->reserved
.cnt
= 1;
105 lmb
->reserved
.size
= 0;
108 /* This routine called with relocation disabled. */
109 static long lmb_add_region(struct lmb_region
*rgn
, phys_addr_t base
, phys_size_t size
)
111 unsigned long coalesced
= 0;
114 if ((rgn
->cnt
== 1) && (rgn
->region
[0].size
== 0)) {
115 rgn
->region
[0].base
= base
;
116 rgn
->region
[0].size
= size
;
120 /* First try and coalesce this LMB with another. */
121 for (i
=0; i
< rgn
->cnt
; i
++) {
122 phys_addr_t rgnbase
= rgn
->region
[i
].base
;
123 phys_size_t rgnsize
= rgn
->region
[i
].size
;
125 if ((rgnbase
== base
) && (rgnsize
== size
))
126 /* Already have this region, so we're done */
129 adjacent
= lmb_addrs_adjacent(base
,size
,rgnbase
,rgnsize
);
130 if ( adjacent
> 0 ) {
131 rgn
->region
[i
].base
-= size
;
132 rgn
->region
[i
].size
+= size
;
136 else if ( adjacent
< 0 ) {
137 rgn
->region
[i
].size
+= size
;
143 if ((i
< rgn
->cnt
-1) && lmb_regions_adjacent(rgn
, i
, i
+1) ) {
144 lmb_coalesce_regions(rgn
, i
, i
+1);
150 if (rgn
->cnt
>= MAX_LMB_REGIONS
)
153 /* Couldn't coalesce the LMB, so add it to the sorted table. */
154 for (i
= rgn
->cnt
-1; i
>= 0; i
--) {
155 if (base
< rgn
->region
[i
].base
) {
156 rgn
->region
[i
+1].base
= rgn
->region
[i
].base
;
157 rgn
->region
[i
+1].size
= rgn
->region
[i
].size
;
159 rgn
->region
[i
+1].base
= base
;
160 rgn
->region
[i
+1].size
= size
;
165 if (base
< rgn
->region
[0].base
) {
166 rgn
->region
[0].base
= base
;
167 rgn
->region
[0].size
= size
;
175 /* This routine may be called with relocation disabled. */
176 long lmb_add(struct lmb
*lmb
, phys_addr_t base
, phys_size_t size
)
178 struct lmb_region
*_rgn
= &(lmb
->memory
);
180 return lmb_add_region(_rgn
, base
, size
);
183 long lmb_free(struct lmb
*lmb
, phys_addr_t base
, phys_size_t size
)
185 struct lmb_region
*rgn
= &(lmb
->reserved
);
186 phys_addr_t rgnbegin
, rgnend
;
187 phys_addr_t end
= base
+ size
;
190 rgnbegin
= rgnend
= 0; /* supress gcc warnings */
192 /* Find the region where (base, size) belongs to */
193 for (i
=0; i
< rgn
->cnt
; i
++) {
194 rgnbegin
= rgn
->region
[i
].base
;
195 rgnend
= rgnbegin
+ rgn
->region
[i
].size
;
197 if ((rgnbegin
<= base
) && (end
<= rgnend
))
201 /* Didn't find the region */
205 /* Check to see if we are removing entire region */
206 if ((rgnbegin
== base
) && (rgnend
== end
)) {
207 lmb_remove_region(rgn
, i
);
211 /* Check to see if region is matching at the front */
212 if (rgnbegin
== base
) {
213 rgn
->region
[i
].base
= end
;
214 rgn
->region
[i
].size
-= size
;
218 /* Check to see if the region is matching at the end */
220 rgn
->region
[i
].size
-= size
;
225 * We need to split the entry - adjust the current one to the
226 * beginging of the hole and add the region after hole.
228 rgn
->region
[i
].size
= base
- rgn
->region
[i
].base
;
229 return lmb_add_region(rgn
, end
, rgnend
- end
);
232 long lmb_reserve(struct lmb
*lmb
, phys_addr_t base
, phys_size_t size
)
234 struct lmb_region
*_rgn
= &(lmb
->reserved
);
236 return lmb_add_region(_rgn
, base
, size
);
239 static long lmb_overlaps_region(struct lmb_region
*rgn
, phys_addr_t base
,
244 for (i
=0; i
< rgn
->cnt
; i
++) {
245 phys_addr_t rgnbase
= rgn
->region
[i
].base
;
246 phys_size_t rgnsize
= rgn
->region
[i
].size
;
247 if ( lmb_addrs_overlap(base
,size
,rgnbase
,rgnsize
) ) {
252 return (i
< rgn
->cnt
) ? i
: -1;
255 phys_addr_t
lmb_alloc(struct lmb
*lmb
, phys_size_t size
, ulong align
)
257 return lmb_alloc_base(lmb
, size
, align
, LMB_ALLOC_ANYWHERE
);
260 phys_addr_t
lmb_alloc_base(struct lmb
*lmb
, phys_size_t size
, ulong align
, phys_addr_t max_addr
)
264 alloc
= __lmb_alloc_base(lmb
, size
, align
, max_addr
);
267 printf("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
268 (ulong
)size
, (ulong
)max_addr
);
273 static phys_addr_t
lmb_align_down(phys_addr_t addr
, phys_size_t size
)
275 return addr
& ~(size
- 1);
278 static phys_addr_t
lmb_align_up(phys_addr_t addr
, ulong size
)
280 return (addr
+ (size
- 1)) & ~(size
- 1);
283 phys_addr_t
__lmb_alloc_base(struct lmb
*lmb
, phys_size_t size
, ulong align
, phys_addr_t max_addr
)
286 phys_addr_t base
= 0;
287 phys_addr_t res_base
;
289 for (i
= lmb
->memory
.cnt
-1; i
>= 0; i
--) {
290 phys_addr_t lmbbase
= lmb
->memory
.region
[i
].base
;
291 phys_size_t lmbsize
= lmb
->memory
.region
[i
].size
;
295 if (max_addr
== LMB_ALLOC_ANYWHERE
)
296 base
= lmb_align_down(lmbbase
+ lmbsize
- size
, align
);
297 else if (lmbbase
< max_addr
) {
298 base
= lmbbase
+ lmbsize
;
301 base
= min(base
, max_addr
);
302 base
= lmb_align_down(base
- size
, align
);
306 while (base
&& lmbbase
<= base
) {
307 j
= lmb_overlaps_region(&lmb
->reserved
, base
, size
);
309 /* This area isn't reserved, take it */
310 if (lmb_add_region(&lmb
->reserved
, base
,
316 res_base
= lmb
->reserved
.region
[j
].base
;
319 base
= lmb_align_down(res_base
- size
, align
);
325 int lmb_is_reserved(struct lmb
*lmb
, phys_addr_t addr
)
329 for (i
= 0; i
< lmb
->reserved
.cnt
; i
++) {
330 phys_addr_t upper
= lmb
->reserved
.region
[i
].base
+
331 lmb
->reserved
.region
[i
].size
- 1;
332 if ((addr
>= lmb
->reserved
.region
[i
].base
) && (addr
<= upper
))
338 __weak
void board_lmb_reserve(struct lmb
*lmb
)
340 /* please define platform specific board_lmb_reserve() */
343 __weak
void arch_lmb_reserve(struct lmb
*lmb
)
345 /* please define platform specific arch_lmb_reserve() */