DOCSLIB.ORG

A File Formats

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A File Formats FileFile FormatsFormats AA A.1 DATA FILES (.DAT) The .DAT file format is used for data buffer initialization. The .DAT extension is a DOS convention only and is not required by the assembler or simulator. These files contain ASCII text only: the characters for hexadecimal or floating-point data. Any standard text editor can be used to create the files. A.1.1 Assembler Buffer Initialization Files The .VAR assembler directive has the option of naming a file from which to initialize a data buffer. You must create this file and specify it in source code with the .VAR directive. The file should be located in the directory from which the assembler is invoked (the current directory), or the path to the file’s directory must be given in the .VAR directive. The assembler reads this file and initializes the buffer in the *.EXE memory image file. The data file may be any length. A.1.1.1Floating-Point Data Buffer initialization files can contain floating-point numbers, one per line. A floating-point value consists of a decimal mantissa value, which must contain a decimal point and can be signed, followed optionally by an uppercase or lowercase E and a decimal integer exponent value, which can be signed as well. For example: 1.2345e12 567.8e–3 –7.1234 are all valid floating-point values. A – 1 AA FileFile FormatsFormats The assembler converts these decimal representations to floating-point format, either standard IEEE 32-bit single precision or 40-bit extended precision. The source code file in which a .VAR initialization occurs specifies the format (32-bit or 40-bit) for floating-point numbers using the .PRECISION directives. If a floating-point number in an initialization file cannot fit in the specified format, it will be rounded. The rounding mode is also specified in the source code file, using the .ROUND directives. See the Assembler chapter for a description of the .PRECISION and .ROUND directives. A.1.1.2Fixed-Point Data The standard fixed-point format for a buffer initialization file is a single integer value per line. Each value can be decimal, hexadecimal, octal or binary. Decimal integers are designated by signed decimal values with no decimal points. The most significant digit cannot be a zero (otherwise, the number is interpreted as an octal value; see below). The assembler loads the equivalent 32-bit value into the most significant 32 bits into the 40-bit memory location and zero-fills the lower eight bits. Hexadecimal numbers should have the “ 0x ” or “ H# ” prefix to indicate hexadecimal. A value can have any number of digits but will be stored in memory as a 32-bit number (MSBs are zero-filled or LSBs are truncated if necessary) that occupies the upper 32 bits of a 40-bit location, and the lower eight bits are zero-filled. The exception is that 10-digit values are stored as 40-bit numbers. Normally you will not use 10-digit numbers because the processor reads in only 32-bit fixed-point data. However, if you wanted to load memory with the exact value of an extended floating-point number, specifying each bit, you could accomplish this by initializing with a 10-digit hexadecimal number. Here is an example. If your data file contains these lines: 0x1122334455 0xCCBBAA99 0x8000 0x8877665544332211 0xA5A5A5 0xFF A – 2 FileFile FormatsFormats AA the data loaded into 40-bit data memory would be: 1122334455 CCBBAA9900 0000800000 8877665500 00A5A5A500 000000FF00 or the data loaded into 48-bit program memory would be: 112233445500 CCBBAA990000 000080000000 887766550000 00A5A5A50000 000000FF0000 An octal value is designated by octal digits, the first of which must be 0. A value can have any number of digits but will be stored in memory as a 32-bit number (MSBs are zero-filled or LSBs are truncated if necessary) that occupies the upper 32 bits of a 40-bit location, and the lower eight bits are zero-filled. A binary value is designated by binary digits (0s and 1s) preceded by an identifier B#. The digits and the identifier are case insensitive. A value can have any number of digits but will be stored in memory as a 32-bit number (MSBs are zero-filled or LSBs are truncated if necessary) that occupies the upper 32 bits of a 40-bit location, and the lower eight bits are zero-filled. A.2 OBJECT (.OBJ) & MEMORY IMAGE (.EXE) FILES The *.OBJ object file is created by the assembler. It contains relocatable code in a binary COFF format. The COFF file format is a standard file exchange format and is not described here. The *.EXE memory image file is created by the linker. This file contains the memory images of your executable system. The memory image file is used to load executable code into the simulator, emulator and PROM splitter. The memory image file is also in the binary COFF A – 3 AA FileFile FormatsFormats format. A.2.1 COFF File Conversion Executable files created with UNIX tools have a different format from those created on a PC. A COFF utility program named CSWAP is provided to convert executable files from UNIX to PC format. Use the following syntax to convert executable files: cswap sun.exe [-o] dos.exe A utility program named CDUMP accepts an executable file as input and dumps an ASCII representation of the COFF file. This utility displays the contents of a COFF object file or executable file. Use the following syntax to display COFF files: cdump file.exe > output.fil A.3 PROM IMAGE FILES PROM image files are generated by the PROM splitter. The files are used with an industry-standard PROM programmer to program memory devices for your hardware system. One file is needed for each memory chip to be programmed. The files can be generated in either Intel Hex format or Motorola S format. The file format depends on which switch options you choose when invoking the PROM splitter. See the PROM Splitter chapter. In all formats, the ASCII characters represent hexadecimal (not decimal) digits. A.3.1 Intel Hex-32 Format The examples below show the Intel Hex-32 format. This file format is obtained by invoking the PROM splitter with the –h switch. Assuming the file was created for an 8-bit wide PROM, it contains one byte of each 48-bit program memory word. Each line in an Intel Hex-32 file contains either a data record, an extended linear address record or the end of file record: A – 4 :020000040010E9 extended linear address record FileFile FormatsFormats AA :0A0004003C40343434261422260850 data record :00000401FB end of file record The extended linear address record is used because a data record has only a 4-character (16-bit) address field. The ADSP-21xxxprocessors, however, require 32 bits to address data memory and 24 bits to address program memory. The extended linear address record specifies address bits 16-31 for the data records that follow it. Data records are organized into the following fields: :0A0004003C40343434261422260850 : .................................... start character 0A .................................. byte count of this record 0004 .............................. address of first data byte 00 ............................ record type 3C .......................... first data byte 08 ....... last data byte 50 ..... checksum: twos complement negation of binary summation (least significant 8 bits) of preceding bytes, including byte count, address and data bytes Extended linear address records have the following fields: :02000000340850 : .................................... start character 02 .................................. byte count (always 02) 0000 .............................. address (always 0000) 04 ............................ record type 3408 ........................ offset address F9 ...................... checksum The end of file record looks like this: :00000001FF : ............................... start character 00 ............................. byte count (zero for this record) 0000 ......................... address of first byte 01 ....................... record type A – 5 AA FileFile FormatsFormats FF ..................... checksum A.3.2 Motorola S Format Motorola S Record format is similar to the Intel standard. The PROM splitter supports three file formats which differ only in the width of the address field: S1 (16 bits), S2 (24 bits) or S3 (32 bits). Each S Record file starts with a header record and ends with a termination record. In between are data records, one per line. Here are some examples: S00600004844521B header record S10D00043C4034343426142226084C data record (S1) S903000DEF termination record (S1) A header record has the following fields: S00600004844521B S0 .............................. start character (always S0) 06 ............................ byte count of this record 0000 ........................ address of the first data byte 484452 .................. arbitrary data field identifying records that follow 1B ................ checksum: ones complement of binary summation (least significant 8 bits) of preceding bytes, including byte count, address and data bytes The S1 data record has the following format: S10D00043C4034343426142226084C S1 .............................. start character 0D ............................ byte count of this record 0004 ........................ address of the first data byte 3C ...................... first data byte 08 .... last data byte 4C .. checksum: ones complement of binary summation (least significant 8 bits) of preceding A – 6 FileFile FormatsFormats AA bytes, including byte count, address and data bytes The S2 data record has the same format, except that the start character is S2 and the address field is six characters wide. The S3 data record is
Load more

Recommended publications
  • The “Stabs” Debug Format
    The \stabs" debug format Julia Menapace, Jim Kingdon, David MacKenzie Cygnus Support Cygnus Support Revision TEXinfo 2017-08-23.19 Copyright c 1992{2021 Free Software Foundation, Inc. Contributed by Cygnus Support. Written by Julia Menapace, Jim Kingdon, and David MacKenzie. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License". i Table of Contents 1 Overview of Stabs ::::::::::::::::::::::::::::::: 1 1.1 Overview of Debugging Information Flow ::::::::::::::::::::::: 1 1.2 Overview of Stab Format ::::::::::::::::::::::::::::::::::::::: 1 1.3 The String Field :::::::::::::::::::::::::::::::::::::::::::::::: 2 1.4 A Simple Example in C Source ::::::::::::::::::::::::::::::::: 3 1.5 The Simple Example at the Assembly Level ::::::::::::::::::::: 4 2 Encoding the Structure of the Program ::::::: 7 2.1 Main Program :::::::::::::::::::::::::::::::::::::::::::::::::: 7 2.2 Paths and Names of the Source Files :::::::::::::::::::::::::::: 7 2.3 Names of Include Files:::::::::::::::::::::::::::::::::::::::::: 8 2.4 Line Numbers :::::::::::::::::::::::::::::::::::::::::::::::::: 9 2.5 Procedures ::::::::::::::::::::::::::::::::::::::::::::::::::::: 9 2.6 Nested Procedures::::::::::::::::::::::::::::::::::::::::::::: 11 2.7 Block Structure
    [Show full text]
  • Portable Executable File Format
    Chapter 11 Portable Executable File Format IN THIS CHAPTER + Understanding the structure of a PE file + Talking in terms of RVAs + Detailing the PE format + The importance of indices in the data directory + How the loader interprets a PE file MICROSOFT INTRODUCED A NEW executable file format with Windows NT. This for- mat is called the Portable Executable (PE) format because it is supposed to be portable across all 32-bit operating systems by Microsoft. The same PE format exe- cutable can be executed on any version of Windows NT, Windows 95, and Win32s. Also, the same format is used for executables for Windows NT running on proces- sors other than Intel x86, such as MIPS, Alpha, and Power PC. The 32-bit DLLs and Windows NT device drivers also follow the same PE format. It is helpful to understand the PE file format because PE files are almost identi- cal on disk and in RAM. Learning about the PE format is also helpful for under- standing many operating system concepts. For example, how operating system loader works to support dynamic linking of DLL functions, the data structures in- volved in dynamic linking such as import table, export table, and so on. The PE format is not really undocumented. The WINNT.H file has several struc- ture definitions representing the PE format. The Microsoft Developer's Network (MSDN) CD-ROMs contain several descriptions of the PE format. However, these descriptions are in bits and pieces, and are by no means complete. In this chapter, we try to give you a comprehensive picture of the PE format.
    [Show full text]
  • Common Object File Format (COFF)
    Application Report SPRAAO8–April 2009 Common Object File Format ..................................................................................................................................................... ABSTRACT The assembler and link step create object files in common object file format (COFF). COFF is an implementation of an object file format of the same name that was developed by AT&T for use on UNIX-based systems. This format encourages modular programming and provides powerful and flexible methods for managing code segments and target system memory. This appendix contains technical details about the Texas Instruments COFF object file structure. Much of this information pertains to the symbolic debugging information that is produced by the C compiler. The purpose of this application note is to provide supplementary information on the internal format of COFF object files. Topic .................................................................................................. Page 1 COFF File Structure .................................................................... 2 2 File Header Structure .................................................................. 4 3 Optional File Header Format ........................................................ 5 4 Section Header Structure............................................................. 5 5 Structuring Relocation Information ............................................... 7 6 Symbol Table Structure and Content........................................... 11 SPRAAO8–April 2009
    [Show full text]
  • Linkers and Loaders Do?
    Linkers & Loaders by John R. Levine Table of Contents 1 Table of Contents Chapter 0: Front Matter ........................................................ 1 Dedication .............................................................................................. 1 Introduction ............................................................................................ 1 Who is this book for? ......................................................................... 2 Chapter summaries ............................................................................. 3 The project ......................................................................................... 4 Acknowledgements ............................................................................ 5 Contact us ........................................................................................... 6 Chapter 1: Linking and Loading ........................................... 7 What do linkers and loaders do? ............................................................ 7 Address binding: a historical perspective .............................................. 7 Linking vs. loading .............................................................................. 10 Tw o-pass linking .............................................................................. 12 Object code libraries ........................................................................ 15 Relocation and code modification .................................................... 17 Compiler Drivers .................................................................................
    [Show full text]
  • Mach-O Internals
    Mach-O Internals William Woodru February 10, 2016 1 / 31 General Agenda 1. Who are you? 2. What is Mach-O? 3. An Extremely Brief History of Mach and Mach-O 4. Structure of a Mach-O File 5. Quirks Encountered 6. Concluding Notes 2 / 31 Who are you? My name is William Woodru. I'm a Computer Science major and Philosophy minor at the University of Maryland, College Park. Outside of school, I'm a member of the Homebrew project and a regular contributor to several open source groups. My work for Homebrew is largely concerned with the underlying system interface and reconciling OS X's intricacies/irregularities with the package manager. 3 / 31 What is Mach-O? Mach-O is the Mach Object binary format. Mach-O is used primarily by Apple in OS X and iOS. Apps on both platforms are really just directory trees containing Mach-O binaries and resources (fonts, icons, congurations). Metadata is stored in a number of places, but mainly within bundled plists (XML) and the binaries themselves. Like its cousins on Linux (ELF) and Windows (PE), Mach-O supports multiple object types: I Executable I Core dump I Shared library/object I Prelinked object le I etc. 4 / 31 . and multiple architectures: I m68k/m88k (yes, it's still supported!*) I x86 I AMD64 I POWER I ARMv6/7/8 Unlike ELF or PE, Mach-O has been extended to allow multi-architecture fat binaries. This has resulted in some interesting properties not shared by the other two. More on that later.
    [Show full text]
  • Compiling, Linking
    Compiling, linking,... • Let’s see what happens when we compile a program using gcc • Some of this material is based on section 7 of Computer Systems, A Programmer’s Perspective, by Bryant O’Hallaron. 1 /* main.c */ /* swap.c */ void swap(); extern int buf[] int buf[2] = {1,2}; int *bufp0 = &buf[0]; int main() int *bufp1; { { swap(); int temp; return 0; bufp1 = &buf[1]; } temp = *bufp0; *bufp0 = *bufp1; *bufp1 = temp; } 2 Compiling, linking,... • What happens when you use the compiler driver gcc: gcc -O2 -g -o test main.c swap.c 3 Step1: Preprocessor (cpp) • The C preprocessor translates the C source file main.c into an ASCII intermediate file main.i • cpp [other args] main.c /tmp/main.i 4 Step2: C compiler (cc1) • Driver runs C compiler cc1 • translates main.i into an ASCII assembly language file main.s • cc1 /tmp/main.i main.c -O2 [other args] -o /tmp/main.s 5 Step3: assembler (as) • driver runs assembler as to translate main.s into relocatable object file main.o • as [other args] -o /tmp/main.o /tmp/main.s • Same 3 steps are executed for swap.c 6 Step4: Linker (ld) • driver runs linker ld to combine main.o and swap.o into the executable file test • ld -o test [sys obj files and args] /tmp/main.o / tmp/swap.o 7 Overview main.c swap.c Source files! Translators! Translators! (cpp, cc1, as)! (cpp, cc1, as)! Relocatable! main.o swap.o object files! Linker (ld)! Fully linked! p! executable object file! 8 Run executable test • unix> ./test • shell invokes function in OS called loader • copy code and data of executable test into memory • then transfers control to the beginning of the program 9 Static linking • What does the static linker all do? • takes as input a collection of relocatable object files and command-line arguments • generates fully linked executable object file that can be loaded and run 10 Static linking • Linker performs two tasks: • symbol resolution: associates each symbol reference with exactly one symbol definition • relocation: compiler and assembler generate code and data sections that start at address 0.
    [Show full text]
  • Outline Executable/Object File Formats Brief History of Binary File Formats
    Outline CSci 5980/8980 ELF basics Manual and Automated Binary Reverse Engineering Slides 5: The ELF Binary File Format Stephen McCamant Static and dynamic linking University of Minnesota Executable/object file formats Brief history of binary file formats (Unix) Modern systems usually use a common format for Early Unix had a simple a.out format relocatable object files during compilation and final Lasted until early days of free Linux/BSD, now obsolete executables AT&T’s second try was named COFF Mostly binary data representing code and data Still limited, but widely adopted with changes Plus metadata allowing the data to be linked and AT&T’s third try was ELF, now used in almost all Unix loaded systems Brief history of binary file formats (non-Unix) Compile-time and run-time Early DOS and Windows had several limited formats Some file features are used during compilation Since the 32-bit era, Windows uses the PE (Portable Typically first created by assembler, then used/modified Executable) format by the linker Partially derived from COFF Other features are used when the program runs OS X era Apple (including iOS, etc) uses a format By the OS when the program starts named Mach-O And now also by runtime linking First developed for the Mach microkernel used on the NeXT Static and dynamic/shared linking ELF Traditional “static” linking happens all at compile time Executable (or Extensible) and Linking (or Linkable) Libraries become indistinguishable from the rest of the Format program First appeared in System V Release 4 Unix, c. 1989 For efficiency and flexibility, it is now more common to postpone library linking until runtime Linux switched to ELF c.
    [Show full text]
  • Novel Framework for Hidden Data in the Image Page Within Executable File Using Computation Between Advanced Encryption Standard and Distortion Techniques
    (IJCSIS) International Journal of Computer Science and Information Security, Vol. 3, No. 1, 2009 Novel Framework for Hidden Data in the Image Page within Executable File Using Computation between Advanced Encryption Standard and Distortion Techniques A.W. Naji*, Shihab A. Hameed, , B.B.Zaidan**, Wajdi F. Al-Khateeb, Othman O. Khalifa, A.A.Zaidan and Teddy S. Gunawan, Department of Electrical and Computer Engineering, Faculty of Engineering, International Islamic University Malaysia, P.O. Box 10, 50728 Kuala Lumpur, Malaysia * [email protected], ** [email protected] message. In doing this, we make it far less likely that an ABSTRACT----- The hurried development of multimedia and encrypted message will be found [2],[3]. Also, if a message internet allows for wide distribution of digital media data. It concealed through Steganography is discovered, the becomes much easier to edit, modify and duplicate digital discoverer is still faced with the formidable task of information. In additional, digital document is also easy to copy and distribute, therefore it may face many threats. It deciphering it. Also the strength of the combination between became necessary to find an appropriate protection due to the hiding and encryption science is due to the non-existence of significance, accuracy and sensitivity of the information. standard algorithms to be used in (hiding and encryption) Furthermore, there is no formal method to be followed to secret messages. Also there is randomness in hiding discover a hidden data. In this paper, a new information hiding methods such as combining several media (covers) with framework is presented.The proposed framework aim is different methods to pass a secret message.
    [Show full text]
  • Effective File Format Fuzzing
    Effective file format fuzzing Thoughts, techniques and results Mateusz “j00ru” Jurczyk Black Hat Europe 2016, London PS> whoami • Project Zero @ Google • Part time developer and frequent user of the fuzzing infrastructure. • Dragon Sector CTF team vice captain. • Low-level security researcher with interest in all sorts of vulnerability research and software exploitation. • http://j00ru.vexillium.org/ • @j00ru Agenda • What constitutes real-life offensive fuzzing (techniques and mindset). • How each of the stages is typically implemented and how to improve them for maximized effectiveness. • Tips & tricks on the examples of software I’ve fuzzed during the past few years: Adobe Reader, Adobe Flash, Windows Kernel, Oracle Java, Hex-Rays IDA Pro, FreeType2, FFmpeg, pdfium, Wireshark, … Fuzzing Fuzz testing or fuzzing is a software testing technique, often automated or semi-automated, that involves providing invalid, unexpected, or random data to the inputs of a computer program. http://en.wikipedia.org/wiki/Fuzz_testing In my (and this talk’s) case • Software = commonly used programs and libraries, both open and closed-source, written in native languages (C/C++ etc.), which may be used as targets for memory corruption-style 0-day attacks. • Inputs = files of different (un)documented formats processed by the target software (e.g. websites, applets, images, videos, documents etc.). On a scheme START choose input mutate input feed to target yes no target save input crashed Easy to learn, hard to master. Key questions • How do we choose the fuzzing
    [Show full text]
  • Advanced Programming in the UNIX Environment – Dæmon Processes, Shared Libraries
    CS631-AdvancedProgrammingintheUNIXEnvironment Slide1 CS631 - Advanced Programming in the UNIX Environment – Dæmon Processes, Shared Libraries Department of Computer Science Stevens Institute of Technology Jan Schaumann [email protected] https://stevens.netmeister.org/631/ Lecture 11: Dæmon Processes, Shared Libraries November 11, 2019 CS631-AdvancedProgrammingintheUNIXEnvironment Slide2 Dæmon processes So... what’s a dæmon process anyway? Lecture 11: Dæmon Processes, Shared Libraries November 11, 2019 CS631-AdvancedProgrammingintheUNIXEnvironment Slide3 Dæmon characteristics Commonly, dæmon processes are created to offer a specific service. Dæmon processes usually live for a long time are started at boot time terminate only during shutdown have no controlling terminal Lecture 11: Dæmon Processes, Shared Libraries November 11, 2019 CS631-AdvancedProgrammingintheUNIXEnvironment Slide4 Dæmon characteristics The previously listed characteristics have certain implications: do one thing, and one thing only no (or only limited) user-interaction possible resource leaks eventually surface consider current working directory how to create (debugging) output Lecture 11: Dæmon Processes, Shared Libraries November 11, 2019 CS631-AdvancedProgrammingintheUNIXEnvironment Slide5 Writing a dæmon fork off the parent process change file mode mask (umask) create a unique Session ID (SID) change the current working directory to a safe place close (or redirect) standard file descriptors open any logs for writing enter actual dæmon code Lecture 11: Dæmon Processes,
    [Show full text]
  • CS 449 – Executables and Linking
    Executables and Linking CS449 Spring 2016 Remember External Linkage Scope? #include <stdio.h> >> gcc ./main.c ./foo.c int global = 0; >> ./a.out void foo(); global=10 int main() { foo(); printf(“global=%d\n”, global); • How did global in foo.c find global in main.c? return 0; • How did foo() in main.c find foo() in foo.c? } • Where is the code for printf() and how does the call to printf() find it? <main.c> • What does a.out look like in the file system? extern int global; How does it look like while executing in memory? void foo() { global += 10; } <foo.c> 2 Compiler gcc Preprocessed Object C source source files Executable .c cpp cc1 .o ld Preprocessor Compiler Linker Preprocessor gcc Preprocessed Object C source source files Executable .c cpp cc1 .o ld Preprocessor Compiler Linker Preprocessor • Input: A C source file with directives • Output: A C source file after directives have been processed and comments stripped off. • #include directive – #include <...> or #include “...” – Copies the contents of the file to source file – Contain function/variable declarations and type definitions – <...> searches for file under standard include path (usually /usr/include) – “....” searches for file under local directory or paths given as –I arguments (e.g. gcc –I ~/local/include main.c) Preprocessor • #define directive – Defines a macro (a symbol that is expanded to some other text) – #define PI 3.14 • All instances of PI gets replaced by 3.14 in source – #define AVG(a, b) (((a) + (b)) / 2) • AVG(2, 4) in source gets replaced by ((2 + 4) / 2) – No type checking • CPP is just a text translator; no concept of types • Will even work on AVG(“Hello”, “World”) Compiler gcc Preprocessed Object C source source files Executable .c cpp cc1 .o ld Preprocessor Compiler Linker Compiler • Input: A preprocessed C source file • Output: An object file in machine language • In the process it performs: – Syntax and type checking – Compiler optimizations to reduce execution time and memory footprint • E.g.
    [Show full text]
  • Using OFD Utility to Create a DSP Boot Image
    Application Report SPRAA64 − November 2004 Using OFD Utility to Create a DSP Boot Image Jelena Nikolic-Popovic DSP Field Applications ABSTRACT The object file display (OFD) utility processes common object file format (COFF) files and converts the information contained in such files into XML format. This application note describes how to create a DSP boot image using COFF and XML files, and a simple Perl script. The resulting image is a C source file, which can be included into the host processor’s application program and downloaded to the DSP via HPI or PCI interfaces. The OFD utility is available in Code Composer Studio Release 3.0 or greater. This application report contains project code that can be downloaded from this link. http://www−s.ti.com/sc/psheets/spraa64/spraa64.zip Contents 1 Motivation . 1 2 COFF Format . 3 3 OFD Text Output . 4 4 OFD XML Output . 6 5 Tools for Processing OFD Output. 9 6 Creating a Host Image. 10 7 Summary and Conclusion. 12 8 References . 13 List of Figures Figure 1. COFF File Structure. 4 Figure 2. OFD Output (Text Format). 5 Figure 3. Tree Representation of XML Tags Generated by OFD. 8 Figure 4. Sample OFD XML Output. 9 Figure 5. Boot image .h file . 10 Figure 6. Boot image .c file . 11 1 Motivation In a signal processing system consisting of one or more DSPs and a host processor where the DSP code initially resides in host’s memory space, the DSP code needs to be converted into a particular format; so that, it can be included into host’s application program, and then copied to the DSP memory space upon system startup.
    [Show full text]