1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/* arch/arm/mach-msm/memory.c
*
* Copyright (C) 2007 Google, Inc.
* Copyright (c) 2009-2014, The Linux Foundation. All rights reserved.
*
* This software is licensed under the terms of the GNU General Public
* License version 2, as published by the Free Software Foundation, and
* may be copied, distributed, and modified under those terms.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
*/
#include <linux/mm.h>
#include <linux/mm_types.h>
#include <linux/bootmem.h>
#include <linux/module.h>
#include <linux/memblock.h>
#include <asm/memblock.h>
#include <asm/pgtable.h>
#include <asm/io.h>
#include <asm/mach/map.h>
#include <asm/cacheflush.h>
#include <asm/setup.h>
#include <mach/msm_memtypes.h>
#include <mach/memory.h>
#include <linux/hardirq.h>
#include <mach/msm_iomap.h>
#include <soc/qcom/socinfo.h>
#include <linux/sched.h>
#include <linux/of_fdt.h>
char *memtype_name[] = {
"EBI0",
"EBI1"
};
static int __init check_for_compat(unsigned long node)
{
char **start = __compat_exports_start;
for ( ; start < __compat_exports_end; start++)
if (of_flat_dt_is_compatible(node, *start))
return 1;
return 0;
}
int __init dt_scan_for_memory_reserve(unsigned long node, const char *uname,
int depth, void *data)
{
const unsigned int *memory_remove_prop;
int memory_remove_prop_length;
const unsigned int *memory_reserve_prop;
int memory_reserve_prop_length;
unsigned int memory_size;
unsigned int memory_start;
unsigned int num_holes = 0;
int i;
int ret;
memory_remove_prop = of_get_flat_dt_prop(node,
"qcom,memblock-remove",
&memory_remove_prop_length);
memory_reserve_prop = of_get_flat_dt_prop(node,
"qcom,memblock-reserve",
&memory_reserve_prop_length);
if (memory_remove_prop || memory_reserve_prop) {
if (!check_for_compat(node))
goto out;
} else {
goto out;
}
if (memory_remove_prop) {
if (!memory_remove_prop_length || (memory_remove_prop_length %
(2 * sizeof(unsigned int)) != 0)) {
WARN(1, "Memory remove malformed\n");
goto mem_reserve;
}
num_holes = memory_remove_prop_length /
(2 * sizeof(unsigned int));
for (i = 0; i < (num_holes * 2); i += 2) {
memory_start = be32_to_cpu(memory_remove_prop[i]);
memory_size = be32_to_cpu(memory_remove_prop[i+1]);
ret = memblock_remove(memory_start, memory_size);
if (ret)
WARN(1, "Failed to remove memory %x-%x\n",
memory_start, memory_start+memory_size);
else
pr_info("Node %s removed memory %x-%x\n", uname,
memory_start, memory_start+memory_size);
}
}
mem_reserve:
if (memory_reserve_prop) {
if (memory_reserve_prop_length != (2*sizeof(unsigned int))) {
WARN(1, "Memory reserve malformed\n");
goto out;
}
memory_start = be32_to_cpu(memory_reserve_prop[0]);
memory_size = be32_to_cpu(memory_reserve_prop[1]);
ret = memblock_reserve(memory_start, memory_size);
if (ret)
WARN(1, "Failed to reserve memory %x-%x\n",
memory_start, memory_start+memory_size);
else
pr_info("Node %s memblock_reserve memory %x-%x\n",
uname, memory_start, memory_start+memory_size);
}
out:
return 0;
}
|
