265 lines
9.0 KiB
Plaintext
265 lines
9.0 KiB
Plaintext
|
/*
|
||
|
|
** ###################################################################
|
||
|
|
** Processors: LPC54114J256_cm0plus
|
||
|
|
**
|
||
|
|
** Compiler: GNU C Compiler
|
||
|
|
** Reference manual: LPC54114 Series Reference Manual, Rev. 0 , 11/2016
|
||
|
|
** Version: rev. 1.0, 2016-11-02
|
||
|
|
** Build: b161214
|
||
|
|
**
|
||
|
|
** Abstract:
|
||
|
|
** Linker file for the GNU C Compiler
|
||
|
|
**
|
||
|
|
** The Clear BSD License
|
||
|
|
** Copyright (c) 2016 Freescale Semiconductor, Inc.
|
||
|
|
** Copyright (c) 2016 - 2017 , NXP
|
||
|
|
** All rights reserved.
|
||
|
|
**
|
||
|
|
**
|
||
|
|
** Redistribution and use in source and binary forms, with or without modification,
|
||
|
|
** are permitted (subject to the limitations in the disclaimer below) provided
|
||
|
|
** that the following conditions are met:
|
||
|
|
**
|
||
|
|
** o Redistributions of source code must retain the above copyright notice, this list
|
||
|
|
** of conditions and the following disclaimer.
|
||
|
|
**
|
||
|
|
** o Redistributions in binary form must reproduce the above copyright notice, this
|
||
|
|
** list of conditions and the following disclaimer in the documentation and/or
|
||
|
|
** other materials provided with the distribution.
|
||
|
|
**
|
||
|
|
** o Neither the name of copyright holder nor the names of its
|
||
|
|
** contributors may be used to endorse or promote products derived from this
|
||
|
|
** software without specific prior written permission.
|
||
|
|
**
|
||
|
|
** NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE.
|
||
|
|
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||
|
|
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||
|
|
** WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
|
** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
||
|
|
** ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||
|
|
** (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||
|
|
** LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
||
|
|
** ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
** SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
**
|
||
|
|
** http: www.freescale.com
|
||
|
|
** mail: support@freescale.com
|
||
|
|
**
|
||
|
|
** Copyright 2016 Freescale Semiconductor, Inc.
|
||
|
|
** Copyright 2016-2017 NXP
|
||
|
|
** Redistribution and use in source and binary forms, with or without modification,
|
||
|
|
** are permitted provided that the following conditions are met:
|
||
|
|
**
|
||
|
|
** 1. Redistributions of source code must retain the above copyright notice, this list
|
||
|
|
** of conditions and the following disclaimer.
|
||
|
|
**
|
||
|
|
** 2. Redistributions in binary form must reproduce the above copyright notice, this
|
||
|
|
** list of conditions and the following disclaimer in the documentation and/or
|
||
|
|
** other materials provided with the distribution.
|
||
|
|
**
|
||
|
|
** 3. Neither the name of the copyright holder nor the names of its
|
||
|
|
** contributors may be used to endorse or promote products derived from this
|
||
|
|
** software without specific prior written permission.
|
||
|
|
**
|
||
|
|
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||
|
|
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||
|
|
** WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
|
** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
||
|
|
** ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||
|
|
** (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||
|
|
** LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
||
|
|
** ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
** SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
**
|
||
|
|
** http: www.nxp.com
|
||
|
|
** mail: support@nxp.com
|
||
|
|
**
|
||
|
|
** ###################################################################
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* Entry Point */
|
||
|
|
ENTRY(Reset_Handler)
|
||
|
|
|
||
|
|
HEAP_SIZE = DEFINED(__heap_size__) ? __heap_size__ : 0x0400;
|
||
|
|
STACK_SIZE = DEFINED(__stack_size__) ? __stack_size__ : 0x0800;
|
||
|
|
RPMSG_SHMEM_SIZE = DEFINED(__use_shmem__) ? 0x1800 : 0;
|
||
|
|
|
||
|
|
/* Specify the memory areas */
|
||
|
|
MEMORY
|
||
|
|
{
|
||
|
|
m_interrupts (RX) : ORIGIN = 0x20010000, LENGTH = 0x000000C0
|
||
|
|
m_text (RX) : ORIGIN = 0x200100C0, LENGTH = 0x0000FF3F
|
||
|
|
m_data (RW) : ORIGIN = 0x20020000, LENGTH = 0x00007FFF - RPMSG_SHMEM_SIZE
|
||
|
|
rpmsg_sh_mem (RW) : ORIGIN = 0x20026800, LENGTH = RPMSG_SHMEM_SIZE
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Define output sections */
|
||
|
|
SECTIONS
|
||
|
|
{
|
||
|
|
/* NOINIT section for rpmsg_sh_mem */
|
||
|
|
.noinit_rpmsg_sh_mem (NOLOAD) : ALIGN(4)
|
||
|
|
{
|
||
|
|
*(.noinit.$rpmsg_sh_mem*)
|
||
|
|
. = ALIGN(4) ;
|
||
|
|
} > rpmsg_sh_mem
|
||
|
|
|
||
|
|
/* The startup code goes first into internal flash */
|
||
|
|
.interrupts :
|
||
|
|
{
|
||
|
|
. = ALIGN(4);
|
||
|
|
KEEP(*(.isr_vector)) /* Startup code */
|
||
|
|
. = ALIGN(4);
|
||
|
|
} > m_interrupts
|
||
|
|
|
||
|
|
/* The program code and other data goes into internal flash */
|
||
|
|
.text :
|
||
|
|
{
|
||
|
|
. = ALIGN(4);
|
||
|
|
*(.text) /* .text sections (code) */
|
||
|
|
*(.text*) /* .text* sections (code) */
|
||
|
|
*(.rodata) /* .rodata sections (constants, strings, etc.) */
|
||
|
|
*(.rodata*) /* .rodata* sections (constants, strings, etc.) */
|
||
|
|
*(.glue_7) /* glue arm to thumb code */
|
||
|
|
*(.glue_7t) /* glue thumb to arm code */
|
||
|
|
*(.eh_frame)
|
||
|
|
KEEP (*(.init))
|
||
|
|
KEEP (*(.fini))
|
||
|
|
. = ALIGN(4);
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.ARM.extab :
|
||
|
|
{
|
||
|
|
*(.ARM.extab* .gnu.linkonce.armextab.*)
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.ARM :
|
||
|
|
{
|
||
|
|
__exidx_start = .;
|
||
|
|
*(.ARM.exidx*)
|
||
|
|
__exidx_end = .;
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.ctors :
|
||
|
|
{
|
||
|
|
__CTOR_LIST__ = .;
|
||
|
|
/* gcc uses crtbegin.o to find the start of
|
||
|
|
the constructors, so we make sure it is
|
||
|
|
first. Because this is a wildcard, it
|
||
|
|
doesn't matter if the user does not
|
||
|
|
actually link against crtbegin.o; the
|
||
|
|
linker won't look for a file to match a
|
||
|
|
wildcard. The wildcard also means that it
|
||
|
|
doesn't matter which directory crtbegin.o
|
||
|
|
is in. */
|
||
|
|
KEEP (*crtbegin.o(.ctors))
|
||
|
|
KEEP (*crtbegin?.o(.ctors))
|
||
|
|
/* We don't want to include the .ctor section from
|
||
|
|
from the crtend.o file until after the sorted ctors.
|
||
|
|
The .ctor section from the crtend file contains the
|
||
|
|
end of ctors marker and it must be last */
|
||
|
|
KEEP (*(EXCLUDE_FILE(*crtend?.o *crtend.o) .ctors))
|
||
|
|
KEEP (*(SORT(.ctors.*)))
|
||
|
|
KEEP (*(.ctors))
|
||
|
|
__CTOR_END__ = .;
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.dtors :
|
||
|
|
{
|
||
|
|
__DTOR_LIST__ = .;
|
||
|
|
KEEP (*crtbegin.o(.dtors))
|
||
|
|
KEEP (*crtbegin?.o(.dtors))
|
||
|
|
KEEP (*(EXCLUDE_FILE(*crtend?.o *crtend.o) .dtors))
|
||
|
|
KEEP (*(SORT(.dtors.*)))
|
||
|
|
KEEP (*(.dtors))
|
||
|
|
__DTOR_END__ = .;
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.preinit_array :
|
||
|
|
{
|
||
|
|
PROVIDE_HIDDEN (__preinit_array_start = .);
|
||
|
|
KEEP (*(.preinit_array*))
|
||
|
|
PROVIDE_HIDDEN (__preinit_array_end = .);
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.init_array :
|
||
|
|
{
|
||
|
|
PROVIDE_HIDDEN (__init_array_start = .);
|
||
|
|
KEEP (*(SORT(.init_array.*)))
|
||
|
|
KEEP (*(.init_array*))
|
||
|
|
PROVIDE_HIDDEN (__init_array_end = .);
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
.fini_array :
|
||
|
|
{
|
||
|
|
PROVIDE_HIDDEN (__fini_array_start = .);
|
||
|
|
KEEP (*(SORT(.fini_array.*)))
|
||
|
|
KEEP (*(.fini_array*))
|
||
|
|
PROVIDE_HIDDEN (__fini_array_end = .);
|
||
|
|
} > m_text
|
||
|
|
|
||
|
|
__etext = .; /* define a global symbol at end of code */
|
||
|
|
__DATA_ROM = .; /* Symbol is used by startup for data initialization */
|
||
|
|
|
||
|
|
|
||
|
|
.data : AT(__DATA_ROM)
|
||
|
|
{
|
||
|
|
. = ALIGN(4);
|
||
|
|
__DATA_RAM = .;
|
||
|
|
__data_start__ = .; /* create a global symbol at data start */
|
||
|
|
*(.ramfunc*) /* for functions in ram */
|
||
|
|
*(.data) /* .data sections */
|
||
|
|
*(.data*) /* .data* sections */
|
||
|
|
KEEP(*(.jcr*))
|
||
|
|
. = ALIGN(4);
|
||
|
|
__data_end__ = .; /* define a global symbol at data end */
|
||
|
|
} > m_data
|
||
|
|
|
||
|
|
__DATA_END = __DATA_ROM + (__data_end__ - __data_start__);
|
||
|
|
text_end = ORIGIN(m_text) + LENGTH(m_text);
|
||
|
|
ASSERT(__DATA_END <= text_end, "region m_text overflowed with text and data")
|
||
|
|
|
||
|
|
/* Uninitialized data section */
|
||
|
|
.bss :
|
||
|
|
{
|
||
|
|
/* This is used by the startup in order to initialize the .bss section */
|
||
|
|
. = ALIGN(4);
|
||
|
|
__START_BSS = .;
|
||
|
|
__bss_start__ = .;
|
||
|
|
*(.bss)
|
||
|
|
*(.bss*)
|
||
|
|
*(COMMON)
|
||
|
|
. = ALIGN(4);
|
||
|
|
__bss_end__ = .;
|
||
|
|
__END_BSS = .;
|
||
|
|
} > m_data
|
||
|
|
|
||
|
|
.heap :
|
||
|
|
{
|
||
|
|
. = ALIGN(8);
|
||
|
|
__end__ = .;
|
||
|
|
PROVIDE(end = .);
|
||
|
|
__HeapBase = .;
|
||
|
|
. += HEAP_SIZE;
|
||
|
|
__HeapLimit = .;
|
||
|
|
__heap_limit = .; /* Add for _sbrk */
|
||
|
|
} > m_data
|
||
|
|
|
||
|
|
.stack :
|
||
|
|
{
|
||
|
|
. = ALIGN(8);
|
||
|
|
. += STACK_SIZE;
|
||
|
|
} > m_data
|
||
|
|
|
||
|
|
/* Initializes stack on the end of block */
|
||
|
|
__StackTop = ORIGIN(m_data) + LENGTH(m_data);
|
||
|
|
__StackLimit = __StackTop - STACK_SIZE;
|
||
|
|
PROVIDE(__stack = __StackTop);
|
||
|
|
|
||
|
|
.ARM.attributes 0 : { *(.ARM.attributes) }
|
||
|
|
|
||
|
|
ASSERT(__StackLimit >= __HeapLimit, "region m_data overflowed with stack and heap")
|
||
|
|
}
|
||
|
|
|