t

Fork of mbed-dev by mbed official

Committer:
amithy
Date:
Thu Nov 09 22:14:37 2017 +0000
Revision:
178:c26431f84b0d
Parent:
150:02e0a0aed4ec
test export

Who changed what in which revision?

UserRevisionLine numberNew contents of line
<> 150:02e0a0aed4ec 1 /*******************************************************************************
<> 150:02e0a0aed4ec 2 * Copyright (C) 2016 Maxim Integrated Products, Inc., All Rights Reserved.
<> 150:02e0a0aed4ec 3 *
<> 150:02e0a0aed4ec 4 * Permission is hereby granted, free of charge, to any person obtaining a
<> 150:02e0a0aed4ec 5 * copy of this software and associated documentation files (the "Software"),
<> 150:02e0a0aed4ec 6 * to deal in the Software without restriction, including without limitation
<> 150:02e0a0aed4ec 7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
<> 150:02e0a0aed4ec 8 * and/or sell copies of the Software, and to permit persons to whom the
<> 150:02e0a0aed4ec 9 * Software is furnished to do so, subject to the following conditions:
<> 150:02e0a0aed4ec 10 *
<> 150:02e0a0aed4ec 11 * The above copyright notice and this permission notice shall be included
<> 150:02e0a0aed4ec 12 * in all copies or substantial portions of the Software.
<> 150:02e0a0aed4ec 13 *
<> 150:02e0a0aed4ec 14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
<> 150:02e0a0aed4ec 15 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
<> 150:02e0a0aed4ec 16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
<> 150:02e0a0aed4ec 17 * IN NO EVENT SHALL MAXIM INTEGRATED BE LIABLE FOR ANY CLAIM, DAMAGES
<> 150:02e0a0aed4ec 18 * OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
<> 150:02e0a0aed4ec 19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
<> 150:02e0a0aed4ec 20 * OTHER DEALINGS IN THE SOFTWARE.
<> 150:02e0a0aed4ec 21 *
<> 150:02e0a0aed4ec 22 * Except as contained in this notice, the name of Maxim Integrated
<> 150:02e0a0aed4ec 23 * Products, Inc. shall not be used except as stated in the Maxim Integrated
<> 150:02e0a0aed4ec 24 * Products, Inc. Branding Policy.
<> 150:02e0a0aed4ec 25 *
<> 150:02e0a0aed4ec 26 * The mere transfer of this software does not imply any licenses
<> 150:02e0a0aed4ec 27 * of trade secrets, proprietary technology, copyrights, patents,
<> 150:02e0a0aed4ec 28 * trademarks, maskwork rights, or any other form of intellectual
<> 150:02e0a0aed4ec 29 * property whatsoever. Maxim Integrated Products, Inc. retains all
<> 150:02e0a0aed4ec 30 * ownership rights.
<> 150:02e0a0aed4ec 31 *******************************************************************************
<> 150:02e0a0aed4ec 32 */
<> 150:02e0a0aed4ec 33
<> 150:02e0a0aed4ec 34 MEMORY
<> 150:02e0a0aed4ec 35 {
<> 150:02e0a0aed4ec 36 FLASH (rx) : ORIGIN = 0x00010000, LENGTH = 0x00070000
<> 150:02e0a0aed4ec 37 RAM (rwx) : ORIGIN = 0x20003100, LENGTH = 0x00024F00
<> 150:02e0a0aed4ec 38 }
<> 150:02e0a0aed4ec 39
<> 150:02e0a0aed4ec 40 /* Linker script to place sections and symbol values. Should be used together
<> 150:02e0a0aed4ec 41 * with other linker script that defines memory regions FLASH and RAM.
<> 150:02e0a0aed4ec 42 * It references following symbols, which must be defined in code:
<> 150:02e0a0aed4ec 43 * Reset_Handler : Entry of reset handler
<> 150:02e0a0aed4ec 44 *
<> 150:02e0a0aed4ec 45 * It defines following symbols, which code can use without definition:
<> 150:02e0a0aed4ec 46 * __exidx_start
<> 150:02e0a0aed4ec 47 * __exidx_end
<> 150:02e0a0aed4ec 48 * __etext
<> 150:02e0a0aed4ec 49 * __data_start__
<> 150:02e0a0aed4ec 50 * __preinit_array_start
<> 150:02e0a0aed4ec 51 * __preinit_array_end
<> 150:02e0a0aed4ec 52 * __init_array_start
<> 150:02e0a0aed4ec 53 * __init_array_end
<> 150:02e0a0aed4ec 54 * __fini_array_start
<> 150:02e0a0aed4ec 55 * __fini_array_end
<> 150:02e0a0aed4ec 56 * __data_end__
<> 150:02e0a0aed4ec 57 * __bss_start__
<> 150:02e0a0aed4ec 58 * __bss_end__
<> 150:02e0a0aed4ec 59 * __end__
<> 150:02e0a0aed4ec 60 * end
<> 150:02e0a0aed4ec 61 * __HeapLimit
<> 150:02e0a0aed4ec 62 * __StackLimit
<> 150:02e0a0aed4ec 63 * __StackTop
<> 150:02e0a0aed4ec 64 * __stack
<> 150:02e0a0aed4ec 65 */
<> 150:02e0a0aed4ec 66 ENTRY(Reset_Handler)
<> 150:02e0a0aed4ec 67
<> 150:02e0a0aed4ec 68 SECTIONS
<> 150:02e0a0aed4ec 69 {
<> 150:02e0a0aed4ec 70 .text :
<> 150:02e0a0aed4ec 71 {
<> 150:02e0a0aed4ec 72 KEEP(*(.isr_vector))
<> 150:02e0a0aed4ec 73 *(.text*)
<> 150:02e0a0aed4ec 74
<> 150:02e0a0aed4ec 75 KEEP(*(.init))
<> 150:02e0a0aed4ec 76 KEEP(*(.fini))
<> 150:02e0a0aed4ec 77
<> 150:02e0a0aed4ec 78 /* .ctors */
<> 150:02e0a0aed4ec 79 *crtbegin.o(.ctors)
<> 150:02e0a0aed4ec 80 *crtbegin?.o(.ctors)
<> 150:02e0a0aed4ec 81 *(EXCLUDE_FILE(*crtend?.o *crtend.o) .ctors)
<> 150:02e0a0aed4ec 82 *(SORT(.ctors.*))
<> 150:02e0a0aed4ec 83 *(.ctors)
<> 150:02e0a0aed4ec 84
<> 150:02e0a0aed4ec 85 /* .dtors */
<> 150:02e0a0aed4ec 86 *crtbegin.o(.dtors)
<> 150:02e0a0aed4ec 87 *crtbegin?.o(.dtors)
<> 150:02e0a0aed4ec 88 *(EXCLUDE_FILE(*crtend?.o *crtend.o) .dtors)
<> 150:02e0a0aed4ec 89 *(SORT(.dtors.*))
<> 150:02e0a0aed4ec 90 *(.dtors)
<> 150:02e0a0aed4ec 91
<> 150:02e0a0aed4ec 92 *(.rodata*)
<> 150:02e0a0aed4ec 93
<> 150:02e0a0aed4ec 94 KEEP(*(.eh_frame*))
<> 150:02e0a0aed4ec 95 } > FLASH
<> 150:02e0a0aed4ec 96
<> 150:02e0a0aed4ec 97 .ARM.extab :
<> 150:02e0a0aed4ec 98 {
<> 150:02e0a0aed4ec 99 *(.ARM.extab* .gnu.linkonce.armextab.*)
<> 150:02e0a0aed4ec 100 } > FLASH
<> 150:02e0a0aed4ec 101
<> 150:02e0a0aed4ec 102 __exidx_start = .;
<> 150:02e0a0aed4ec 103 .ARM.exidx :
<> 150:02e0a0aed4ec 104 {
<> 150:02e0a0aed4ec 105 *(.ARM.exidx* .gnu.linkonce.armexidx.*)
<> 150:02e0a0aed4ec 106 } > FLASH
<> 150:02e0a0aed4ec 107 __exidx_end = .;
<> 150:02e0a0aed4ec 108
<> 150:02e0a0aed4ec 109 __etext = .;
<> 150:02e0a0aed4ec 110
<> 150:02e0a0aed4ec 111 .data : AT (__etext)
<> 150:02e0a0aed4ec 112 {
<> 150:02e0a0aed4ec 113 __data_start__ = .;
<> 150:02e0a0aed4ec 114 *(vtable)
<> 150:02e0a0aed4ec 115 *(.data*)
<> 150:02e0a0aed4ec 116
<> 150:02e0a0aed4ec 117 . = ALIGN(4);
<> 150:02e0a0aed4ec 118 /* preinit data */
<> 150:02e0a0aed4ec 119 PROVIDE_HIDDEN (__preinit_array_start = .);
<> 150:02e0a0aed4ec 120 KEEP(*(.preinit_array))
<> 150:02e0a0aed4ec 121 PROVIDE_HIDDEN (__preinit_array_end = .);
<> 150:02e0a0aed4ec 122
<> 150:02e0a0aed4ec 123 . = ALIGN(4);
<> 150:02e0a0aed4ec 124 /* init data */
<> 150:02e0a0aed4ec 125 PROVIDE_HIDDEN (__init_array_start = .);
<> 150:02e0a0aed4ec 126 KEEP(*(SORT(.init_array.*)))
<> 150:02e0a0aed4ec 127 KEEP(*(.init_array))
<> 150:02e0a0aed4ec 128 PROVIDE_HIDDEN (__init_array_end = .);
<> 150:02e0a0aed4ec 129
<> 150:02e0a0aed4ec 130
<> 150:02e0a0aed4ec 131 . = ALIGN(4);
<> 150:02e0a0aed4ec 132 /* finit data */
<> 150:02e0a0aed4ec 133 PROVIDE_HIDDEN (__fini_array_start = .);
<> 150:02e0a0aed4ec 134 KEEP(*(SORT(.fini_array.*)))
<> 150:02e0a0aed4ec 135 KEEP(*(.fini_array))
<> 150:02e0a0aed4ec 136 PROVIDE_HIDDEN (__fini_array_end = .);
<> 150:02e0a0aed4ec 137
<> 150:02e0a0aed4ec 138 . = ALIGN(4);
<> 150:02e0a0aed4ec 139 /* All data end */
<> 150:02e0a0aed4ec 140 __data_end__ = .;
<> 150:02e0a0aed4ec 141
<> 150:02e0a0aed4ec 142 } > RAM
<> 150:02e0a0aed4ec 143
<> 150:02e0a0aed4ec 144 .bss :
<> 150:02e0a0aed4ec 145 {
<> 150:02e0a0aed4ec 146 __bss_start__ = .;
<> 150:02e0a0aed4ec 147 *(.bss*)
<> 150:02e0a0aed4ec 148 *(COMMON)
<> 150:02e0a0aed4ec 149 __bss_end__ = .;
<> 150:02e0a0aed4ec 150 } > RAM
<> 150:02e0a0aed4ec 151
<> 150:02e0a0aed4ec 152 .heap :
<> 150:02e0a0aed4ec 153 {
<> 150:02e0a0aed4ec 154 __end__ = .;
<> 150:02e0a0aed4ec 155 end = __end__;
<> 150:02e0a0aed4ec 156 *(.heap*)
<> 150:02e0a0aed4ec 157 __HeapLimit = .;
<> 150:02e0a0aed4ec 158 } > RAM
<> 150:02e0a0aed4ec 159
<> 150:02e0a0aed4ec 160 /* .stack_dummy section doesn't contains any symbols. It is only
<> 150:02e0a0aed4ec 161 * used for linker to calculate size of stack sections, and assign
<> 150:02e0a0aed4ec 162 * values to stack symbols later */
<> 150:02e0a0aed4ec 163 .stack_dummy :
<> 150:02e0a0aed4ec 164 {
<> 150:02e0a0aed4ec 165 *(.stack)
<> 150:02e0a0aed4ec 166 } > RAM
<> 150:02e0a0aed4ec 167
<> 150:02e0a0aed4ec 168 /* Set stack top to end of RAM, and stack limit move down by
<> 150:02e0a0aed4ec 169 * size of stack_dummy section */
<> 150:02e0a0aed4ec 170 __StackTop = ORIGIN(RAM) + LENGTH(RAM);
<> 150:02e0a0aed4ec 171 __StackLimit = __StackTop - SIZEOF(.stack_dummy);
<> 150:02e0a0aed4ec 172 PROVIDE(__stack = __StackTop);
<> 150:02e0a0aed4ec 173
<> 150:02e0a0aed4ec 174 /* Check if data + heap + stack exceeds RAM limit */
<> 150:02e0a0aed4ec 175 ASSERT(__StackLimit >= __HeapLimit, "region RAM overflowed with stack")
<> 150:02e0a0aed4ec 176 }