mirror of
https://github.com/BobTheBlinker/android_kernel_motorola_sm6375.git
synced 2026-10-29 19:21:31 -04:00
memblock: Rename memblock_region to memblock_type and memblock_property to memblock_region
Signed-off-by: Benjamin Herrenschmidt <[email protected]>
This commit is contained in:
Benjamin Herrenschmidt
parent
f1c2c19c49
commit
e3239ff92a
10 changed files with 118 additions and 120 deletions
168
mm/memblock.c
168
mm/memblock.c
|
|
@ -29,7 +29,7 @@ static int __init early_memblock(char *p)
|
|||
}
|
||||
early_param("memblock", early_memblock);
|
||||
|
||||
static void memblock_dump(struct memblock_region *region, char *name)
|
||||
static void memblock_dump(struct memblock_type *region, char *name)
|
||||
{
|
||||
unsigned long long base, size;
|
||||
int i;
|
||||
|
|
@ -37,8 +37,8 @@ static void memblock_dump(struct memblock_region *region, char *name)
|
|||
pr_info(" %s.cnt = 0x%lx\n", name, region->cnt);
|
||||
|
||||
for (i = 0; i < region->cnt; i++) {
|
||||
base = region->region[i].base;
|
||||
size = region->region[i].size;
|
||||
base = region->regions[i].base;
|
||||
size = region->regions[i].size;
|
||||
|
||||
pr_info(" %s[0x%x]\t0x%016llx - 0x%016llx, 0x%llx bytes\n",
|
||||
name, i, base, base + size - 1, size);
|
||||
|
|
@ -74,34 +74,34 @@ static long memblock_addrs_adjacent(u64 base1, u64 size1, u64 base2, u64 size2)
|
|||
return 0;
|
||||
}
|
||||
|
||||
static long memblock_regions_adjacent(struct memblock_region *rgn,
|
||||
static long memblock_regions_adjacent(struct memblock_type *type,
|
||||
unsigned long r1, unsigned long r2)
|
||||
{
|
||||
u64 base1 = rgn->region[r1].base;
|
||||
u64 size1 = rgn->region[r1].size;
|
||||
u64 base2 = rgn->region[r2].base;
|
||||
u64 size2 = rgn->region[r2].size;
|
||||
u64 base1 = type->regions[r1].base;
|
||||
u64 size1 = type->regions[r1].size;
|
||||
u64 base2 = type->regions[r2].base;
|
||||
u64 size2 = type->regions[r2].size;
|
||||
|
||||
return memblock_addrs_adjacent(base1, size1, base2, size2);
|
||||
}
|
||||
|
||||
static void memblock_remove_region(struct memblock_region *rgn, unsigned long r)
|
||||
static void memblock_remove_region(struct memblock_type *type, unsigned long r)
|
||||
{
|
||||
unsigned long i;
|
||||
|
||||
for (i = r; i < rgn->cnt - 1; i++) {
|
||||
rgn->region[i].base = rgn->region[i + 1].base;
|
||||
rgn->region[i].size = rgn->region[i + 1].size;
|
||||
for (i = r; i < type->cnt - 1; i++) {
|
||||
type->regions[i].base = type->regions[i + 1].base;
|
||||
type->regions[i].size = type->regions[i + 1].size;
|
||||
}
|
||||
rgn->cnt--;
|
||||
type->cnt--;
|
||||
}
|
||||
|
||||
/* Assumption: base addr of region 1 < base addr of region 2 */
|
||||
static void memblock_coalesce_regions(struct memblock_region *rgn,
|
||||
static void memblock_coalesce_regions(struct memblock_type *type,
|
||||
unsigned long r1, unsigned long r2)
|
||||
{
|
||||
rgn->region[r1].size += rgn->region[r2].size;
|
||||
memblock_remove_region(rgn, r2);
|
||||
type->regions[r1].size += type->regions[r2].size;
|
||||
memblock_remove_region(type, r2);
|
||||
}
|
||||
|
||||
void __init memblock_init(void)
|
||||
|
|
@ -109,13 +109,13 @@ void __init memblock_init(void)
|
|||
/* Create a dummy zero size MEMBLOCK which will get coalesced away later.
|
||||
* This simplifies the memblock_add() code below...
|
||||
*/
|
||||
memblock.memory.region[0].base = 0;
|
||||
memblock.memory.region[0].size = 0;
|
||||
memblock.memory.regions[0].base = 0;
|
||||
memblock.memory.regions[0].size = 0;
|
||||
memblock.memory.cnt = 1;
|
||||
|
||||
/* Ditto. */
|
||||
memblock.reserved.region[0].base = 0;
|
||||
memblock.reserved.region[0].size = 0;
|
||||
memblock.reserved.regions[0].base = 0;
|
||||
memblock.reserved.regions[0].size = 0;
|
||||
memblock.reserved.cnt = 1;
|
||||
}
|
||||
|
||||
|
|
@ -126,24 +126,24 @@ void __init memblock_analyze(void)
|
|||
memblock.memory.size = 0;
|
||||
|
||||
for (i = 0; i < memblock.memory.cnt; i++)
|
||||
memblock.memory.size += memblock.memory.region[i].size;
|
||||
memblock.memory.size += memblock.memory.regions[i].size;
|
||||
}
|
||||
|
||||
static long memblock_add_region(struct memblock_region *rgn, u64 base, u64 size)
|
||||
static long memblock_add_region(struct memblock_type *type, u64 base, u64 size)
|
||||
{
|
||||
unsigned long coalesced = 0;
|
||||
long adjacent, i;
|
||||
|
||||
if ((rgn->cnt == 1) && (rgn->region[0].size == 0)) {
|
||||
rgn->region[0].base = base;
|
||||
rgn->region[0].size = size;
|
||||
if ((type->cnt == 1) && (type->regions[0].size == 0)) {
|
||||
type->regions[0].base = base;
|
||||
type->regions[0].size = size;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* First try and coalesce this MEMBLOCK with another. */
|
||||
for (i = 0; i < rgn->cnt; i++) {
|
||||
u64 rgnbase = rgn->region[i].base;
|
||||
u64 rgnsize = rgn->region[i].size;
|
||||
for (i = 0; i < type->cnt; i++) {
|
||||
u64 rgnbase = type->regions[i].base;
|
||||
u64 rgnsize = type->regions[i].size;
|
||||
|
||||
if ((rgnbase == base) && (rgnsize == size))
|
||||
/* Already have this region, so we're done */
|
||||
|
|
@ -151,61 +151,59 @@ static long memblock_add_region(struct memblock_region *rgn, u64 base, u64 size)
|
|||
|
||||
adjacent = memblock_addrs_adjacent(base, size, rgnbase, rgnsize);
|
||||
if (adjacent > 0) {
|
||||
rgn->region[i].base -= size;
|
||||
rgn->region[i].size += size;
|
||||
type->regions[i].base -= size;
|
||||
type->regions[i].size += size;
|
||||
coalesced++;
|
||||
break;
|
||||
} else if (adjacent < 0) {
|
||||
rgn->region[i].size += size;
|
||||
type->regions[i].size += size;
|
||||
coalesced++;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if ((i < rgn->cnt - 1) && memblock_regions_adjacent(rgn, i, i+1)) {
|
||||
memblock_coalesce_regions(rgn, i, i+1);
|
||||
if ((i < type->cnt - 1) && memblock_regions_adjacent(type, i, i+1)) {
|
||||
memblock_coalesce_regions(type, i, i+1);
|
||||
coalesced++;
|
||||
}
|
||||
|
||||
if (coalesced)
|
||||
return coalesced;
|
||||
if (rgn->cnt >= MAX_MEMBLOCK_REGIONS)
|
||||
if (type->cnt >= MAX_MEMBLOCK_REGIONS)
|
||||
return -1;
|
||||
|
||||
/* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */
|
||||
for (i = rgn->cnt - 1; i >= 0; i--) {
|
||||
if (base < rgn->region[i].base) {
|
||||
rgn->region[i+1].base = rgn->region[i].base;
|
||||
rgn->region[i+1].size = rgn->region[i].size;
|
||||
for (i = type->cnt - 1; i >= 0; i--) {
|
||||
if (base < type->regions[i].base) {
|
||||
type->regions[i+1].base = type->regions[i].base;
|
||||
type->regions[i+1].size = type->regions[i].size;
|
||||
} else {
|
||||
rgn->region[i+1].base = base;
|
||||
rgn->region[i+1].size = size;
|
||||
type->regions[i+1].base = base;
|
||||
type->regions[i+1].size = size;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (base < rgn->region[0].base) {
|
||||
rgn->region[0].base = base;
|
||||
rgn->region[0].size = size;
|
||||
if (base < type->regions[0].base) {
|
||||
type->regions[0].base = base;
|
||||
type->regions[0].size = size;
|
||||
}
|
||||
rgn->cnt++;
|
||||
type->cnt++;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
long memblock_add(u64 base, u64 size)
|
||||
{
|
||||
struct memblock_region *_rgn = &memblock.memory;
|
||||
|
||||
/* On pSeries LPAR systems, the first MEMBLOCK is our RMO region. */
|
||||
if (base == 0)
|
||||
memblock.rmo_size = size;
|
||||
|
||||
return memblock_add_region(_rgn, base, size);
|
||||
return memblock_add_region(&memblock.memory, base, size);
|
||||
|
||||
}
|
||||
|
||||
static long __memblock_remove(struct memblock_region *rgn, u64 base, u64 size)
|
||||
static long __memblock_remove(struct memblock_type *type, u64 base, u64 size)
|
||||
{
|
||||
u64 rgnbegin, rgnend;
|
||||
u64 end = base + size;
|
||||
|
|
@ -214,34 +212,34 @@ static long __memblock_remove(struct memblock_region *rgn, u64 base, u64 size)
|
|||
rgnbegin = rgnend = 0; /* supress gcc warnings */
|
||||
|
||||
/* Find the region where (base, size) belongs to */
|
||||
for (i=0; i < rgn->cnt; i++) {
|
||||
rgnbegin = rgn->region[i].base;
|
||||
rgnend = rgnbegin + rgn->region[i].size;
|
||||
for (i=0; i < type->cnt; i++) {
|
||||
rgnbegin = type->regions[i].base;
|
||||
rgnend = rgnbegin + type->regions[i].size;
|
||||
|
||||
if ((rgnbegin <= base) && (end <= rgnend))
|
||||
break;
|
||||
}
|
||||
|
||||
/* Didn't find the region */
|
||||
if (i == rgn->cnt)
|
||||
if (i == type->cnt)
|
||||
return -1;
|
||||
|
||||
/* Check to see if we are removing entire region */
|
||||
if ((rgnbegin == base) && (rgnend == end)) {
|
||||
memblock_remove_region(rgn, i);
|
||||
memblock_remove_region(type, i);
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Check to see if region is matching at the front */
|
||||
if (rgnbegin == base) {
|
||||
rgn->region[i].base = end;
|
||||
rgn->region[i].size -= size;
|
||||
type->regions[i].base = end;
|
||||
type->regions[i].size -= size;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Check to see if the region is matching at the end */
|
||||
if (rgnend == end) {
|
||||
rgn->region[i].size -= size;
|
||||
type->regions[i].size -= size;
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
|
@ -249,8 +247,8 @@ static long __memblock_remove(struct memblock_region *rgn, u64 base, u64 size)
|
|||
* We need to split the entry - adjust the current one to the
|
||||
* beginging of the hole and add the region after hole.
|
||||
*/
|
||||
rgn->region[i].size = base - rgn->region[i].base;
|
||||
return memblock_add_region(rgn, end, rgnend - end);
|
||||
type->regions[i].size = base - type->regions[i].base;
|
||||
return memblock_add_region(type, end, rgnend - end);
|
||||
}
|
||||
|
||||
long memblock_remove(u64 base, u64 size)
|
||||
|
|
@ -265,25 +263,25 @@ long __init memblock_free(u64 base, u64 size)
|
|||
|
||||
long __init memblock_reserve(u64 base, u64 size)
|
||||
{
|
||||
struct memblock_region *_rgn = &memblock.reserved;
|
||||
struct memblock_type *_rgn = &memblock.reserved;
|
||||
|
||||
BUG_ON(0 == size);
|
||||
|
||||
return memblock_add_region(_rgn, base, size);
|
||||
}
|
||||
|
||||
long memblock_overlaps_region(struct memblock_region *rgn, u64 base, u64 size)
|
||||
long memblock_overlaps_region(struct memblock_type *type, u64 base, u64 size)
|
||||
{
|
||||
unsigned long i;
|
||||
|
||||
for (i = 0; i < rgn->cnt; i++) {
|
||||
u64 rgnbase = rgn->region[i].base;
|
||||
u64 rgnsize = rgn->region[i].size;
|
||||
for (i = 0; i < type->cnt; i++) {
|
||||
u64 rgnbase = type->regions[i].base;
|
||||
u64 rgnsize = type->regions[i].size;
|
||||
if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
|
||||
break;
|
||||
}
|
||||
|
||||
return (i < rgn->cnt) ? i : -1;
|
||||
return (i < type->cnt) ? i : -1;
|
||||
}
|
||||
|
||||
static u64 memblock_align_down(u64 addr, u64 size)
|
||||
|
|
@ -311,7 +309,7 @@ static u64 __init memblock_alloc_nid_unreserved(u64 start, u64 end,
|
|||
base = ~(u64)0;
|
||||
return base;
|
||||
}
|
||||
res_base = memblock.reserved.region[j].base;
|
||||
res_base = memblock.reserved.regions[j].base;
|
||||
if (res_base < size)
|
||||
break;
|
||||
base = memblock_align_down(res_base - size, align);
|
||||
|
|
@ -320,7 +318,7 @@ static u64 __init memblock_alloc_nid_unreserved(u64 start, u64 end,
|
|||
return ~(u64)0;
|
||||
}
|
||||
|
||||
static u64 __init memblock_alloc_nid_region(struct memblock_property *mp,
|
||||
static u64 __init memblock_alloc_nid_region(struct memblock_region *mp,
|
||||
u64 (*nid_range)(u64, u64, int *),
|
||||
u64 size, u64 align, int nid)
|
||||
{
|
||||
|
|
@ -350,7 +348,7 @@ static u64 __init memblock_alloc_nid_region(struct memblock_property *mp,
|
|||
u64 __init memblock_alloc_nid(u64 size, u64 align, int nid,
|
||||
u64 (*nid_range)(u64 start, u64 end, int *nid))
|
||||
{
|
||||
struct memblock_region *mem = &memblock.memory;
|
||||
struct memblock_type *mem = &memblock.memory;
|
||||
int i;
|
||||
|
||||
BUG_ON(0 == size);
|
||||
|
|
@ -358,7 +356,7 @@ u64 __init memblock_alloc_nid(u64 size, u64 align, int nid,
|
|||
size = memblock_align_up(size, align);
|
||||
|
||||
for (i = 0; i < mem->cnt; i++) {
|
||||
u64 ret = memblock_alloc_nid_region(&mem->region[i],
|
||||
u64 ret = memblock_alloc_nid_region(&mem->regions[i],
|
||||
nid_range,
|
||||
size, align, nid);
|
||||
if (ret != ~(u64)0)
|
||||
|
|
@ -402,8 +400,8 @@ u64 __init __memblock_alloc_base(u64 size, u64 align, u64 max_addr)
|
|||
max_addr = MEMBLOCK_REAL_LIMIT;
|
||||
|
||||
for (i = memblock.memory.cnt - 1; i >= 0; i--) {
|
||||
u64 memblockbase = memblock.memory.region[i].base;
|
||||
u64 memblocksize = memblock.memory.region[i].size;
|
||||
u64 memblockbase = memblock.memory.regions[i].base;
|
||||
u64 memblocksize = memblock.memory.regions[i].size;
|
||||
|
||||
if (memblocksize < size)
|
||||
continue;
|
||||
|
|
@ -423,7 +421,7 @@ u64 __init __memblock_alloc_base(u64 size, u64 align, u64 max_addr)
|
|||
return 0;
|
||||
return base;
|
||||
}
|
||||
res_base = memblock.reserved.region[j].base;
|
||||
res_base = memblock.reserved.regions[j].base;
|
||||
if (res_base < size)
|
||||
break;
|
||||
base = memblock_align_down(res_base - size, align);
|
||||
|
|
@ -442,7 +440,7 @@ u64 memblock_end_of_DRAM(void)
|
|||
{
|
||||
int idx = memblock.memory.cnt - 1;
|
||||
|
||||
return (memblock.memory.region[idx].base + memblock.memory.region[idx].size);
|
||||
return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
|
||||
}
|
||||
|
||||
/* You must call memblock_analyze() after this. */
|
||||
|
|
@ -450,7 +448,7 @@ void __init memblock_enforce_memory_limit(u64 memory_limit)
|
|||
{
|
||||
unsigned long i;
|
||||
u64 limit;
|
||||
struct memblock_property *p;
|
||||
struct memblock_region *p;
|
||||
|
||||
if (!memory_limit)
|
||||
return;
|
||||
|
|
@ -458,24 +456,24 @@ void __init memblock_enforce_memory_limit(u64 memory_limit)
|
|||
/* Truncate the memblock regions to satisfy the memory limit. */
|
||||
limit = memory_limit;
|
||||
for (i = 0; i < memblock.memory.cnt; i++) {
|
||||
if (limit > memblock.memory.region[i].size) {
|
||||
limit -= memblock.memory.region[i].size;
|
||||
if (limit > memblock.memory.regions[i].size) {
|
||||
limit -= memblock.memory.regions[i].size;
|
||||
continue;
|
||||
}
|
||||
|
||||
memblock.memory.region[i].size = limit;
|
||||
memblock.memory.regions[i].size = limit;
|
||||
memblock.memory.cnt = i + 1;
|
||||
break;
|
||||
}
|
||||
|
||||
if (memblock.memory.region[0].size < memblock.rmo_size)
|
||||
memblock.rmo_size = memblock.memory.region[0].size;
|
||||
if (memblock.memory.regions[0].size < memblock.rmo_size)
|
||||
memblock.rmo_size = memblock.memory.regions[0].size;
|
||||
|
||||
memory_limit = memblock_end_of_DRAM();
|
||||
|
||||
/* And truncate any reserves above the limit also. */
|
||||
for (i = 0; i < memblock.reserved.cnt; i++) {
|
||||
p = &memblock.reserved.region[i];
|
||||
p = &memblock.reserved.regions[i];
|
||||
|
||||
if (p->base > memory_limit)
|
||||
p->size = 0;
|
||||
|
|
@ -494,9 +492,9 @@ int __init memblock_is_reserved(u64 addr)
|
|||
int i;
|
||||
|
||||
for (i = 0; i < memblock.reserved.cnt; i++) {
|
||||
u64 upper = memblock.reserved.region[i].base +
|
||||
memblock.reserved.region[i].size - 1;
|
||||
if ((addr >= memblock.reserved.region[i].base) && (addr <= upper))
|
||||
u64 upper = memblock.reserved.regions[i].base +
|
||||
memblock.reserved.regions[i].size - 1;
|
||||
if ((addr >= memblock.reserved.regions[i].base) && (addr <= upper))
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
|
|
@ -511,7 +509,7 @@ int memblock_is_region_reserved(u64 base, u64 size)
|
|||
* Given a <base, len>, find which memory regions belong to this range.
|
||||
* Adjust the request and return a contiguous chunk.
|
||||
*/
|
||||
int memblock_find(struct memblock_property *res)
|
||||
int memblock_find(struct memblock_region *res)
|
||||
{
|
||||
int i;
|
||||
u64 rstart, rend;
|
||||
|
|
@ -520,8 +518,8 @@ int memblock_find(struct memblock_property *res)
|
|||
rend = rstart + res->size - 1;
|
||||
|
||||
for (i = 0; i < memblock.memory.cnt; i++) {
|
||||
u64 start = memblock.memory.region[i].base;
|
||||
u64 end = start + memblock.memory.region[i].size - 1;
|
||||
u64 start = memblock.memory.regions[i].base;
|
||||
u64 end = start + memblock.memory.regions[i].size - 1;
|
||||
|
||||
if (start > rend)
|
||||
return -1;
|
||||
|
|
|
|||
Loading…
Reference in a new issue