Deepa Dinamani | 28c0ffe | 2012-09-24 11:45:21 -0700 | [diff] [blame^] | 1 | /* Copyright (c) 2012, The Linux Foundation. All rights reserved. |
| 2 | * |
| 3 | * Redistribution and use in source and binary forms, with or without |
| 4 | * modification, are permitted provided that the following conditions are |
| 5 | * met: |
| 6 | * * Redistributions of source code must retain the above copyright |
| 7 | * notice, this list of conditions and the following disclaimer. |
| 8 | * * Redistributions in binary form must reproduce the above |
| 9 | * copyright notice, this list of conditions and the following |
| 10 | * disclaimer in the documentation and/or other materials provided |
| 11 | * with the distribution. |
| 12 | * * Neither the name of The Linux Foundation nor the names of its |
| 13 | * contributors may be used to endorse or promote products derived |
| 14 | * from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED |
| 17 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 18 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS |
| 20 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 23 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
| 25 | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
| 26 | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | #include <reg.h> |
| 30 | #include <debug.h> |
| 31 | #include <malloc.h> |
| 32 | #include <smem.h> |
| 33 | #include <stdint.h> |
| 34 | #include <libfdt.h> |
| 35 | #include <platform/iomap.h> |
| 36 | #include <dev_tree.h> |
| 37 | |
| 38 | #define SIZE_1M (1024 * 1024) |
| 39 | |
| 40 | typedef struct { |
| 41 | uint32_t size; |
| 42 | uint32_t start_addr; |
| 43 | }mem_info; |
| 44 | |
| 45 | mem_info mdm9625_default_fixed_memory[] = { |
| 46 | { .size = (29 * SIZE_1M), |
| 47 | .start_addr = SDRAM_START_ADDR + |
| 48 | (2 * SIZE_1M) |
| 49 | }, |
| 50 | { .size = (10 * SIZE_1M), |
| 51 | .start_addr = SDRAM_START_ADDR + |
| 52 | (118 * SIZE_1M) |
| 53 | }, |
| 54 | }; |
| 55 | |
| 56 | int target_add_first_mem_bank(void *fdt, |
| 57 | uint32_t offset, |
| 58 | mem_info usable_mem_map[], |
| 59 | uint32_t num_regions) |
| 60 | { |
| 61 | uint32_t i; |
| 62 | int ret; |
| 63 | |
| 64 | ASSERT(num_regions); |
| 65 | |
| 66 | dprintf(SPEW, "Number of HLOS regions in 1st bank = %u\n", num_regions); |
| 67 | |
| 68 | for (i = 0; i < num_regions; i++) |
| 69 | { |
| 70 | ret = dev_tree_add_mem_info(fdt, |
| 71 | offset, |
| 72 | usable_mem_map[i].start_addr, |
| 73 | usable_mem_map[i].size); |
| 74 | } |
| 75 | return ret; |
| 76 | } |
| 77 | |
| 78 | /* Funtion to add the ram partition entries into device tree. |
| 79 | * The function assumes that all the entire fixed memory regions should |
| 80 | * be listed in the first bank of the passed in ddr regions. |
| 81 | */ |
| 82 | uint32_t target_dev_tree_mem(void *fdt, uint32_t memory_node_offset) |
| 83 | { |
| 84 | struct smem_ram_ptable ram_ptable; |
| 85 | uint32_t last_fixed_addr; |
| 86 | int n; |
| 87 | unsigned int i; |
| 88 | int ret; |
| 89 | |
| 90 | /* Make sure RAM partition table is initialized */ |
| 91 | ASSERT(smem_ram_ptable_init(&ram_ptable)); |
| 92 | |
| 93 | n = ARRAY_SIZE(mdm9625_default_fixed_memory); |
| 94 | |
| 95 | last_fixed_addr = mdm9625_default_fixed_memory[n-1].start_addr + |
| 96 | mdm9625_default_fixed_memory[n-1].size; |
| 97 | |
| 98 | for (i = 0; i < ram_ptable.len; i++) |
| 99 | { |
| 100 | if((ram_ptable.parts[i].category == SDRAM) && |
| 101 | (ram_ptable.parts[i].type == SYS_MEMORY)) |
| 102 | { |
| 103 | if((ram_ptable.parts[i].start <= last_fixed_addr) && |
| 104 | ((ram_ptable.parts[i].start + ram_ptable.parts[i].size) >= last_fixed_addr)) |
| 105 | { |
| 106 | |
| 107 | /* Pass along all fixed memory regions to Linux */ |
| 108 | ret = target_add_first_mem_bank(fdt, |
| 109 | memory_node_offset, |
| 110 | mdm9625_default_fixed_memory, |
| 111 | ARRAY_SIZE(mdm9625_default_fixed_memory)); |
| 112 | |
| 113 | if (ret) |
| 114 | { |
| 115 | dprintf(CRITICAL, "Failed to add first bank fixed memory addresses\n"); |
| 116 | goto target_dev_tree_mem_err; |
| 117 | } |
| 118 | |
| 119 | if((ram_ptable.parts[i].start + ram_ptable.parts[i].size) != last_fixed_addr) |
| 120 | { |
| 121 | /* Pass the memory beyond the fixed memory present in the partition */ |
| 122 | ret = dev_tree_add_mem_info(fdt, |
| 123 | memory_node_offset, |
| 124 | ram_ptable.parts[i].start + last_fixed_addr, |
| 125 | ram_ptable.parts[i].size - last_fixed_addr); |
| 126 | |
| 127 | if (ret) |
| 128 | { |
| 129 | dprintf(CRITICAL, "Failed to add first bank memory addresses\n"); |
| 130 | goto target_dev_tree_mem_err; |
| 131 | } |
| 132 | } |
| 133 | } |
| 134 | else |
| 135 | { |
| 136 | /* Pass along all other usable memory regions to Linux */ |
| 137 | ret = dev_tree_add_mem_info(fdt, |
| 138 | memory_node_offset, |
| 139 | ram_ptable.parts[i].start, |
| 140 | ram_ptable.parts[i].size); |
| 141 | |
| 142 | if (ret) |
| 143 | { |
| 144 | dprintf(CRITICAL, "Failed to add secondary banks memory addresses\n"); |
| 145 | goto target_dev_tree_mem_err; |
| 146 | } |
| 147 | } |
| 148 | } |
| 149 | } |
| 150 | |
| 151 | target_dev_tree_mem_err: |
| 152 | |
| 153 | return ret; |
| 154 | } |
| 155 | |
| 156 | void *target_get_scratch_address(void) |
| 157 | { |
| 158 | return ((void *)SCRATCH_ADDR); |
| 159 | } |
| 160 | |
| 161 | unsigned target_get_max_flash_size(void) |
| 162 | { |
| 163 | return (28 * 1024 * 1024); |
| 164 | } |