--- /dev/null
+/****************************************************************************\r
+* Copyright (c) 2006 by Michael Fischer. All rights reserved.\r
+*\r
+* Redistribution and use in source and binary forms, with or without \r
+* modification, are permitted provided that the following conditions \r
+* are met:\r
+* \r
+* 1. Redistributions of source code must retain the above copyright \r
+* notice, this list of conditions and the following disclaimer.\r
+* 2. Redistributions in binary form must reproduce the above copyright\r
+* notice, this list of conditions and the following disclaimer in the \r
+* documentation and/or other materials provided with the distribution.\r
+* 3. Neither the name of the author nor the names of its contributors may \r
+* be used to endorse or promote products derived from this software \r
+* without specific prior written permission.\r
+*\r
+* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \r
+* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT \r
+* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS \r
+* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL \r
+* THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, \r
+* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, \r
+* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS \r
+* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED \r
+* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, \r
+* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF \r
+* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF \r
+* SUCH DAMAGE.\r
+*\r
+****************************************************************************\r
+*\r
+* History:\r
+*\r
+* 26.01.08 mifi First Version\r
+****************************************************************************/\r
+\r
+\r
+ENTRY(ResetHandler)\r
+SEARCH_DIR(.)\r
+\r
+/*\r
+ * Define stack size here\r
+ */\r
+FIQ_STACK_SIZE = 0x0100;\r
+IRQ_STACK_SIZE = 0x0100;\r
+ABT_STACK_SIZE = 0x0100;\r
+UND_STACK_SIZE = 0x0100;\r
+SVC_STACK_SIZE = 0x0400;\r
+\r
+\r
+MEMORY\r
+{\r
+ rom : org = 0x00100000, len = 256k\r
+ ram : org = 0x00200000, len = 64k\r
+}\r
+\r
+/*\r
+ * Do not change the next code\r
+ */\r
+SECTIONS\r
+{\r
+ .text :\r
+ {\r
+ *(.vectors);\r
+ . = ALIGN(4);\r
+ *(.init);\r
+ . = ALIGN(4);\r
+ *(.text);\r
+ . = ALIGN(4);\r
+ *(.rodata);\r
+ . = ALIGN(4);\r
+ *(.rodata*);\r
+ . = ALIGN(4);\r
+ *(.glue_7t);\r
+ . = ALIGN(4);\r
+ *(.glue_7);\r
+ . = ALIGN(4);\r
+ etext = .;\r
+ } > rom\r
+\r
+ .data :\r
+ {\r
+ PROVIDE (__data_start = .);\r
+ *(.data)\r
+ . = ALIGN(4);\r
+ edata = .;\r
+ _edata = .;\r
+ PROVIDE (__data_end = .);\r
+ } > ram\r
+\r
+ .bss :\r
+ {\r
+ PROVIDE (__bss_start = .);\r
+ *(.bss)\r
+ *(COMMON)\r
+ . = ALIGN(4);\r
+ PROVIDE (__bss_end = .);\r
+ \r
+ . = ALIGN(256);\r
+ \r
+ PROVIDE (__stack_start = .);\r
+ \r
+ PROVIDE (__stack_fiq_start = .);\r
+ . += FIQ_STACK_SIZE;\r
+ . = ALIGN(4);\r
+ PROVIDE (__stack_fiq_end = .);\r
+\r
+ PROVIDE (__stack_irq_start = .);\r
+ . += IRQ_STACK_SIZE;\r
+ . = ALIGN(4);\r
+ PROVIDE (__stack_irq_end = .);\r
+\r
+ PROVIDE (__stack_abt_start = .);\r
+ . += ABT_STACK_SIZE;\r
+ . = ALIGN(4);\r
+ PROVIDE (__stack_abt_end = .);\r
+\r
+ PROVIDE (__stack_und_start = .);\r
+ . += UND_STACK_SIZE;\r
+ . = ALIGN(4);\r
+ PROVIDE (__stack_und_end = .);\r
+\r
+ PROVIDE (__stack_svc_start = .);\r
+ . += SVC_STACK_SIZE;\r
+ . = ALIGN(4);\r
+ PROVIDE (__stack_svc_end = .);\r
+ PROVIDE (__stack_end = .);\r
+ PROVIDE (__heap_start = .); \r
+ } > ram\r
+ \r
+}\r
+/*** EOF ***/\r
+\r