www.ti.com
Performance Characterization Rules
Rule 25 — All C6x algorithms must be supplied in
Rule 26 — All C6x algorithms must access all static and global data as far data. (See Section 5.3.2)
Rule 27 — C6x algorithms must never assume placement in
Rule 28 — On processors that support large program model compilation, all function accesses to independently relocatable object modules must be far references. For example, intersection function references within algorithm and external function references to other
Rule 29 — On processors that support large program model compilation, all independently relocatable object module functions must be declared as far functions; for example, on the C54x, callers must push both the XPC and the current PC and the algorithm functions must perform a far return. (See Section 5.4.2)
Rule 30 — On processors that support an extended program address space (paged memory), the code size of any independently relocatable object module should never exceed the code space available on a page when overlays are enabled. (See Section 5.4.2)
Rule 31 — All C55x algorithms must document the content of the stack configuration register that they follow. (See Section 5.5.1)
Rule 32 — All C55x algorithms must access all static and global data as far data; also the algorithms should be instantiable in a large memory model. (See Section 5.5.2)
Rule 33 — C55x algorithms must never assume placement in
Rule 34 — All C55x algorithms that access data by
Rule 35 — All TMX320C28x algorithms must access all static and global data as far data; also, the algorithm should be instantiable in a large memory model. (See Section 5.7.1)
A.2 Performance Characterization Rules
Rule 19 — All algorithms must characterize their
Rule 20 — All algorithms must characterize their
Rule 21 — Algorithms must characterize their static data memory requirements. (See Section 4.1.3) Rule 22 — All algorithms must characterize their program memory requirements. (See Section 4.2)
Rule 23 — All algorithms must characterize their
Rule 24 — All algorithms must characterize the typical period and
A.3 DMA Rules
DMA Rule 1 — All data transfer must be completed before return to caller. (See Section 6.6)
DMA Rule 2 — All algorithms using the DMA resource must implement the IDMA2 interface. (See Section 6.7)
SPRU352G | Rules and Guidelines | 77 |