stack.cmd

来自「FFT算法的DSP的实现。DSP芯片的出现使FFT的实现方法变得更为方便.由于多」· CMD 代码 · 共 34 行

/* fft.cmd */
MEMORY
{
        PAGE 0: 
                      ROM(RIX)    :origin=5000H,length=1000H
                      ROM1        :origin=6000H,length=0200H
        PAGE 1: 
                      B2A(RW)     :origin=0060H,length=10H
                      B2B(RW)     :origin=0070H,length=10H
                      INTRAM1(RW) :origin=0400H,length=0200H
                      INTRAM2(RW) :origin=0800H,length=0200H
                      INTRAM3(RW) :origin=1400H,length=0800H
                      OTHER       :origin=2000H,length=0800H
}

SECTIONS
{
       .text    :               {}>ROM     PAGE 0
       INPUT    :               {}>ROM1    PAGE 0
       .data    :               {}>INTRAM3 PAGE 1
       twiddle1 :               {}>INTRAM1 PAGE 1
       twiddle2 :               {}>INTRAM2 PAGE 1
       tempv    :               {}>B2A     PAGE 1
       stack    :               {}>B2B     PAGE 1
       OUTPUT   :               {}>OTHER   PAGE 1
       .stack   :               {}>OTHER   PAGE 1
}
/* 数据在存储器空间的分配情况               */
/* TWI1:     0x400  ~ 0x5FF      正弦系数表 */
/* TWI2:     0x800  ~ 0x9FF      余弦系数表 */
/* OUTPUT:   0x2000 ~ 0x20FF     输出数据   */
/* _c_int00: 0x5000 ~ 0x50dc     程序代码   */
/* INPUT:    0x6000 ~ 0x60ff     输入数据   */