Method and apparatus for processor code optimization using code compression

Abstract

An improved method of optimizing the instruction set of a digital processor using code compression. In one embodiment, the method comprises obtaining an assembly language program to be used for the optimization process; calculating the static frequency of each instruction type from the base instruction set; sorting the instruction types by frequency; determining the number and type of instructions necessary for correct program execution; creating a compressed instruction set encoding; re-evaluating the compressed instruction according to the foregoing steps; and generating an instruction set encoding for the compressed instruction set. Improved compressed instruction formats and register structures useful in a processor are also disclosed. A computer program and apparatus for synthesizing logic implementing the aforementioned data cache architecture and pipeline performance enhancements are further disclosed.

Description

COPYRIGHT

[0003] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.

BACKGROUND OF THE INVENTION

[0004] 1. Field of the Invention

[0005] The present invention relates to the field of integrated circuit design, specifically to the use of optimized instruction sets within a pipelined central processing unit (CPU) or user-customizable microprocessor.

[0006] 2. Description of Related Technology

[0007] RISC (or reduced instruction set computer) processors are well known in the computing arts. RISC processors generally have the fundamental characteristic of utilizing a substantially reduced instruction set as compared to non-RISC (commonly known as “CISC”) processors. Typically, RISC processor machine instructions are not all micro-coded, but rather may be executed immediately without decoding, thereby affording significant economies in terms of processing speed. This “streamlined” instruction handling capability furthermore allows greater simplicity in the design of the processor (as compared to non-RISC devices), thereby allowing smaller silicon and reduced cost of fabrication.

[0008] RISC processors are also typically characterized by (i) load/store memory architecture (i.e., only the load and store instructions have access to memory; other instructions operate via internal registers within the processor); (ii) unity of processor and compiler; and (iii) pipelining. RISC processors typically enjoy relatively high performance due to their simplicity of design. But RISC processors also sometimes suffer from a larger program size as compared to CISC processors. Since a RISC processor employs a reduced number of instructions and more limited addressing modes as compared to a CISC processor, it is common for programs targeted for a RISC processor will be larger than one targeted for a CISC processor. This fact is a consequence of requiring additional instructions to do the same function. For example, a RISC processor lacking a multiply-accumulate instruction with auto-indexing addressing modes will require two instructions to implement the multiply-accumulate and four instructions to implement the addressing modes. A CISC processor that includes this instruction will perform the operation in a single instruction.

[0009] Compressing the instruction set of a RISC processor (particularly in the case of an embedded applications such as consumer electronics) is important for reasons relating to memory and die space limitations, as well as others. A number of varying compression techniques have been proposed to reduce instruction set size. However, increased instruction set compression carries an accompanying performance loss, due to any number of factors including (i) the need to “decompress” the instructions before execution; (ii) reduced clock frequency through the extra hardware added to support the code compression; and (iii) an increased number of unused clock cycles by the compressed instructions (e.g., unused delay slots that would otherwise be used by the non-compressed analogs of the compressed instructions). The common metric for measuring compression is compression ratio (CR), which is defined generally by the formula:

CR =compressed size/original size  (Eqn. 1)

[0010] In the typical RISC device, the designer may generally choose from either 16-bit or 32-bit instructions. Sixteen-bit instructions are more restricted in functionality than 32-bit instructions, which generally causes the number of instructions executed in the 16-bit instruction programs to increase comparatively. However, 16-bit instructions may generally also be fetched more efficiently, thereby creating a trade-off with the increased execution time of the greater number of 16-bit instructions. The THUMB® approach of ARM is an example of such a 16-bit instruction set. Programs compiled for THUMB achieve roughly 30% smaller (as compared to the standard ARM processor instruction set), but also run on the order of 15%-20% slower on systems with 32-bit buses and no wait states. See, e.g., “Evaluation of a High Performance Code Compression Method”, C. Lefurgy, et al, University of Michigan (1999).

[0011] Another prior art approach, sometimes referred to as “CCRP”, is to specifically modify the instruction cache to run compressed programs. At the time of program compiling, the cache code lines are compressed using any number of different coding schemes (e.g., 48-bit segments compressed using Huffman codes) and stored in the processor main memory. At run-time, the cache lines are fetched from the main memory, decompressed, and loaded into the instruction cache. Accordingly, using this scheme, instructions fetched from the instruction cache are in decompressed form, and have the same addresses as those in the original program. This approach has the benefit of obviating most all modification to the core in support of the compression. However, one significant drawback relates to cache “misses” (i.e., a request to read from memory which cannot be satisfied from cache, for which the main memory must be accessed); such missed instructions do not reside at the same address in memory, and accordingly the processor must correlate or map missed instruction cache addresses to the main memory addresses where the compressed code is stored.

[0012] A somewhat similar technique known as “Codepack” (employed primarily by IBM Corporation) utilizes a separate logic mapping unit to map between the native instruction set addresses and the compressed instruction set addresses. The decompression unit accepts L1-cache (i.e., primary or on-chip cache) miss addresses, and subsequently retrieves the corresponding compressed instruction bytes from the main memory. The retrieved compressed bytes are decompressed and subsequently provides the native (decompressed) instructions to the L1-cache for use thereafter. It has been reported that such techniques may result in a compression level of 60% with a performance degradation on the order of 10% of the native program.

[0013] In “Codepack”, each 32-bit instruction word is first divided into 16-bit high and low half-words. These two half-words are then translated into a variable-length bit codeword (e.g., length ranging from 2 to 11 bits). Codepack uses two separate dictionaries for the aforementioned translation to the variable bit codewords, since half-words may have different values, and also distribution frequencies (i.e., some much more likely than others). Furthermore, the more commonly used half-word values are assigned shorter codewords. The codewords are divided into 2 sections; the first being a 2- or 3-bit tag indicative of codeword size, and a second section for indexing the translation dictionaries. The value “0” occurring in the lower half-word is encoded using only a 2-bit tag (no low index bits) based on its comparatively high frequency of occurrence. The dictionaries are fixed at time of program loading, and may be adapted for use with specific programs. Half-words not present within the dictionaries are annotated with a 3-bit marker to identify them as not being compressed bytes.

[0014] Each group of 16 instructions is combined into a so-called “compression block.” The whole compression block is fetched and decompressed if a requested instruction cache line (8 instructions) is present within the block. Note that the compressed instructions are stored at different memory locations from the non-compressed native instructions. The instruction address from the cache miss is mapped to the corresponding compressed instruction address by correlation table which is created during the compression of the instructions; each index is 32-bits long in the IBM processor. Furthermore, each entry in the correlation table maps one compression group, each compression group comprising two compression “blocks” (32 instructions in total). The first compression block of 16 instructions is specified as a byte offset into the compressed memory, while the second block is specified using a different offset from the first block.

[0015] While good overall performance (i.e., high compression ratio and low percentage loss of performance may be achieved, one of the more significant drawbacks of both CCRP and “Codepack” prior art methods described above is the increased complexity associated with compressed instruction decode. This complexity manifests itself in, among other things, the need for additional decompression, address mapping, and translation logic (as well as codeword “dictionaries” in the case of Codepack), thereby increasing the complexity and cost of any RISC design incorporating these features.

[0016] Based on the foregoing, there is a need for an improved method and apparatus for compressing the instruction sets of RISC (and other) processors, while not significantly sacrificing the benefits inherent in the design of the processor. Such improved apparatus and method would ideally result in significant compression of the base instruction set, require no processor mode switching between pure 32-bit instruction mode execution and pure 16-bit instruction mode execution, utilize comparatively simple instruction decode logic, allow for normal operation of existing exceptions/interrupts and call/return functions within the core, add no restrictions to program address range, and result in only a very small loss (i.e., on the order of 10% or less) of overall performance resulting from reduced clock frequency and other factors.

SUMMARY OF THE INVENTION

[0017] In a first aspect of the invention, an improved method of optimizing a processor instruction set using code compression is disclosed. In one embodiment, the method comprises obtaining an assembly language program to be used for the optimization process; calculating the static frequency of each instruction type from the base instruction set; sorting the instruction types by frequency; determining the number and type of instructions necessary for correct program execution; creating a compressed instruction set encoding; re-evaluating the compressed instruction according to the foregoing steps; and generating an instruction set encoding for the compressed instruction set.

[0018] In a second aspect of the invention, an improved compressed instruction format useful in a digital processor is disclosed. In one embodiment, the compressed format comprises two paired 14-bit instruction words (ISA1). In a second embodiment, a 15-bit ISA2 format is disclosed.

[0019] In a third aspect of the invention, an improved storage device having the compressed processor instruction set described above is disclosed. In a first embodiment, the improved storage device comprises a random access memory (RAM) or read-only memory (ROM) having all or a portion of the compressed instruction set stored therein for subsequent access by a processor core. In a second embodiment, the storage device comprises a magnetic medium such as a floppy disk or magnetic tape spool having an object code representation of a computer program incorporating compressed instructions disposed thereon.

[0020] In a fourth aspect of the invention, an improved method of synthesizing the design of an integrated circuit incorporating the aforementioned compressed instruction set is disclosed. In one exemplary embodiment, the method comprises obtaining user input regarding the design and instruction set configuration; creating a customized HDL functional block description based on the user input and existing libraries of functions; determining a design hierarchy based on the user input and existing libraries; running a makefile to create the structural HDL and script; running the script to create a makefile for the simulator and a synthesis script; and synthesizing and/or simulating the design from the simulation makefile or synthesis script, respectively.

[0021] In a fifth aspect of the invention, an improved computer program useful for synthesizing processor designs and embodying the aforementioned compressed instruction set and instruction format(s) is disclosed. In one exemplary embodiment, the computer program comprises an object code representation stored on the magnetic storage device of a microcomputer, and adapted to run on the central processing unit thereof. The computer program further comprises an interactive, menu-driven graphical user interface (GUI), thereby facilitating ease of use.

[0022] In a sixth aspect of the invention, an improved apparatus for running the aforementioned synthesis program is disclosed. In one exemplary embodiment, the system comprises a stand-alone microcomputer system having a display, central processing unit, data storage device(s), and input device.

[0023] In a seventh aspect of the invention, an improved processor architecture utilizing the foregoing optimized and compressed instruction set is disclosed. In one exemplary embodiment, the processor comprises an extensible reduced instruction set computer (RISC) having a four stage pipeline.

BRIEF DESCRIPTION OF THE DRAWINGS

[0024] FIG. 1 is logical block diagram illustrating one embodiment of the method of optimizing an instruction set using code compression according to the present invention.

[0025] FIG. 2 is a graphical representation of one exemplary encoding structure according to the invention, comprising a “compressed paired instruction” op-code and two compressed 14-bit instructions.

[0026] FIG. 3 is a graphical representation of one exemplary PC/Status register structure used in conjunction with the present invention, wherein a single bit (“L-bit”) is used to indicate which of the pair of compressed instructions is to be executed (e.g. instruction 1 or instruction 2).

[0027] FIG. 4 is a graphical representation of an exemplary 8-bit signed offset, 14-bit conditional branch instruction encoding according to the invention.

[0028] FIG. 5 is a graphical representation of an exemplary register-register multi-use opcode (CMP/ ADD.F/ SUB.F/ AND.F/ OR.F/ XOR.F/ ASL.F/ LSR.F/ ASR.F/ MUL64.F/ MULU64.F/ EXTB.F/ EXTW.F/ SEXB.F/ SEXW.F/ NEG.F/ NOT.F/ MOV/ ADD/ SUB/ ASL) 14-bit instruction encoding according to the invention.

[0029] FIG. 6 is a graphical representation of an exemplary single source register opcode (Single_op a) 14-bit instruction encoding according to the invention.

[0030] FIG. 7 is a graphical representation of an exemplary implied register opcode 14-bit instruction encoding according to the invention.

[0031] FIG. 8 is a graphical representation of an exemplary 4-bit offset, 14-bit LD/LDB/LDW instruction encoding according to the invention.

[0032] FIG. 9 is a graphical representation of an exemplary 4-bit offset, 14-bit ST/STB instruction encoding according to the invention.

[0033] FIG. 10 is a graphical representation of an exemplary 7-bit offset, 14-bit LOAD/STORE instruction encoding according to the invention.

[0034] FIG. 11 is a graphical representation of an exemplary 7-bit integer, 14-bit MOVE/COMPARE instruction encoding according to the invention.

[0035] FIG. 12 is a graphical representation of an exemplary 5-bit integer, 14-bit ADD.F/ SUB.F/ ASL.F/ ASR.F/ LSR.F instruction encoding according to the invention.

[0036] FIG. 13 is a graphical representation of an exemplary 14-bit MOV.F/ CMP/ADD.F instruction encoding according to the invention.

[0037] FIG. 14 is a graphical representation of an exemplary 8-bit signed offset conditional branch, 15-bit instruction encoding according to the invention.

[0038] FIG. 15 is a graphical representation of an exemplary 15-bit register-register multi-use opcode AND.F/ OR.F/ XOR.F/ ASL.F/ LSR.F/ ASR.F/ MUL64.F/ MULU64.F/ EXTB.F/ EXTW.F/ SEXB.F/ SEXW.F/ NEG.F/ NOT.F/ MOV/ ADD/ SUB/ ASL/ instruction encoding according to the invention.

[0039] FIG. 16 is a graphical representation of an exemplary 15-bit single source register opcode (Single op) instruction encoding according to the invention.

[0040] FIG. 17 is a graphical representation of an exemplary 15-bit implied opcode (Implied op) instruction encoding according to the invention.

[0041] FIG. 18 is a graphical representation of an exemplary 5-bit offset, 15-bit LOAD instruction encoding according to the invention.

[0042] FIG. 19 is a graphical representation of an exemplary 5-bit offset, 15-bit STORE instruction encoding according to the invention.

[0043] FIG. 20 is a graphical representation of an exemplary 7-bit offset, 15-bit LOAD/ STORE instruction encoding according to the invention.

[0044] FIG. 21 is a graphical representation of an exemplary 7-bit integer, 15-bit MOV/ CMP instruction encoding according to the invention.

[0045] FIG. 22 is a graphical representation of an exemplary 5-bit integer, ASL.F/ ASR.F/ LSR.F 15-bit instruction encoding according to the invention.

[0046] FIG. 23 is a graphical representation of an exemplary 15-bit MOV.F instruction encoding according to the invention.

[0047] FIG. 24 is a graphical representation of an exemplary 15-bit ADD.F/ SUB.F instruction encoding according to the invention.

[0048] FIG. 25 is a graphical representation of an exemplary 3-bit integer, 15-bit ADD.F/ SUB.F instruction encoding according to the invention.

[0049] FIG. 26 is a graphical representation of an exemplary 7-bit integer, 15-bit ADD.F/ SUB.F instruction encoding according to the invention.

[0050] FIG. 27 is a graphical representation of an exemplary 4-bit offset, 15-bit LDB/ LDW instruction encoding according to the invention.

[0051] FIG. 28 is a graphical representation of an exemplary 4-bit offset, 15-bit STB/ STW instruction encoding according to the invention.

[0052] FIG. 29 is a graphical representation of an exemplary 7-bit integer, 15-bit LOAD instruction encoding according to the invention.

[0053] FIG. 30 is a graphical representation of an exemplary 7-bit integer, 15-bit ADD instruction encoding according to the invention.

[0054] FIG. 31 is a graphical representation of an exemplary 11-bit signed offset branch-and-link, 15-bit instruction encoding according to the invention.

[0055] FIG. 32 is a graphical representation of an exemplary 15-bit instruction encoding reserved for future expansion according to the invention.

[0056] FIG. 33 is a logical flow diagram illustrating the generalized methodology of synthesizing processor logic which incorporates the compressed instruction set and instruction coding of the present invention.

[0057] FIG. 34 is a block diagram of a pipelined processor design incorporating the compressed instruction set and instruction coding of the present invention.

[0058] FIG. 35 is a functional block diagram of one exemplary embodiment of a computer system useful for synthesizing a processor design incorporating the compressed instruction set and instruction coding of the invention.

DETAILED DESCRIPTION

[0059] Reference is now made to the drawings wherein like numerals refer to like parts throughout.

[0060] As used herein, the term “processor” is meant to include any integrated circuit or other electronic device capable of performing an operation on at least one instruction word including, without limitation, reduced instruction set core (RISC) processors such as the ARC™ user-configurable and extensible core manufactured by the Assignee hereof, central processing units (CPUs), and digital signal processors (DSPs). The hardware of such devices may be integrated onto a single piece of silicon (“die”), or distributed among two or more die. Furthermore, various functional aspects of the processor may be implemented solely as software or firmware associated with the processor.

[0061] Additionally, it will be recognized by those of ordinary skill in the art that the term “stage” as used herein refers to various successive stages within a pipelined processor; i.e., stage 1 refers to the first pipelined stage, stage 2 to the second pipelined stage, and so forth.

[0062] It is also noted that while the following description is cast in terms of VHSIC hardware description language (VHDL), other hardware description languages such as Verilog® may be used to describe various embodiments of the invention with equal success. Furthermore, while an exemplary Synopsys® synthesis engine such as the Design Compiler 2000.05 (DC00) is used to synthesize the various embodiments set forth herein, other synthesis engines such as Buildgates® available from, inter alia, Cadence Design Systems, Inc., may be used. IEEE std. 1076.3-1997, IEEE Standard VHDL Synthesis Packages, describe an industry-accepted language for specifying a Hardware Definition Language-based design and the synthesis capabilities that may be expected to be available to one of ordinary skill in the art.

[0063] Overview

[0064] The present invention overcomes the limitations associated with prior art non-optimized and non-compressed instruction sets, and provides users with the additional benefit of tailoring the instruction set to be specific with regard to both their application and the specific programming language employed. Optimal instruction set encoding using a compressed instruction encoding of the base instruction set (i.e., the set of instructions of the core processor less any optional or user configured instructions) is used by the present invention to reduce the code size of programs. The compressed instruction set is in addition to the base instruction set of the processor (such as the ARC™ user-customizable processors supplied by the Applicant herein), although it will be recognized that the compressed instruction set(s) described herein may also constitute a partial or complete replacement for the base instruction set. Compressed and base instruction sets are further combined to achieve flexibility in software coding while providing a high density representation for the majority of the program.

[0065] The compressed instruction encoding of the present invention satisfies the foregoing needs, and provides the following attributes: (i) reduces code size; (ii) avoids processor 32/16-bit mode changing; (iii) fairly simple decode (hardware limits on number of gates and processor speed); (iv) small performance loss; (v) exceptions, interrupts and call/return function normally; (vi) no reduction in program address range; and (vii) minimal use of extension instruction slots.

[0066] (i) Code Size Reduction

[0067] The compression obtained depends at least in part on the application code size and how much instruction space is allocated to the compressed instruction. For example, in the case of the exemplary unpaired eight (8) instruction slot method described subsequently herein, the compression achieved by the Assignee hereof was on the order of 25-30%. For the paired two (2) instruction slot method, the compression achieved was on the order of 15-25%.

[0068] (ii) 32/16-bit Mode Changing

[0069] In the invention described herein, no processor mode switching is required between pure 32-bit instruction mode execution and pure 16-bit instruction mode execution. This attribute is driven by the need to freely intermix the 32-bit and 16-bit instructions by virtue of the instruction size being encoded in the instruction.

[0070] (iii) Simplified Decode

[0071] This attribute results from the need to balance the compressed instruction decode logic complexity with the hardware cost of increased gate count and increased power requirements (and increased manufacturing cost associated therewith) and a decrease in clock frequency. Accordingly, the decode logic used in the present invention to decode the compressed instructions strikes an optimal balance between these competing factors.

[0072] (iv) Comparatively Small Performance Loss

[0073] Overall performance loss resulting from reduced clock frequency through the extra hardware added to support the code compression; and increase in the number of unused clock cycles by the compressed instructions (e.g., unused delay slots that would otherwise be used by the non-compressed analogs of the compressed instructions). This reduction in performance is purposely minimized; i.e., on the order of 10% or less, although even smaller performance reductions may be dictated during design.

[0074] (v) Normal Function of Exceptions/Interrupts and Call/Return

[0075] The present invention advantageously does not affect the operation of exceptions, interrupts, or call/return operations, thereby making integration of the compressed instruction set into existing designs transparent in that regard.

[0076] (vi) Program Address Range

[0077] The present invention imposes no reduction on program address range, in that it requires no use of one or more program address bits or other such means to select between compressed and non-compressed instruction execution. This provides the maximum degree of flexibility to the designer/programmer, since no address bits are used, and a broader range of addresses is available.

[0078] (vii) Minimal Use of Extension Instruction Slots

[0079] In order to maximize the availability of unused processor extension instruction slots for other functions within the core, the compressed code of the present invention makes only minimal use of such slots.

[0080] Method Of Optimization

[0081] Referring now to FIG. 1, one exemplary embodiment of the generalized method of optimizing an instruction set according to the present invention is described. It will be recognized that while the following discussion is cast in terms of scripts acting on assembly language source code derived from a high-level language (e.g. C/C++) compiler of the type well known in the programming arts, other approaches may be substituted. For example, the same analysis may be performed on a similar binary or hexadecimal encoding of assembly language.

[0082] In the first step 102 of the method 100, an assembly language program to be subjected to the optimization process is obtained. Assembly language programs adapted for use on digital processors are well known in the computer arts, and will not be described further herein. Next, in step 104, the static frequency of each instruction type from the base instruction set is determined. As used herein the term “static” refers to a simple count of each instruction type as it exists in the program. The static count is in contrast to the dynamic number of instructions, which refers to the number of times each instruction is executed during a typical execution of the program, which is typically (but not necessarily) different. Furthermore, the term “base instruction set” refers to the core set of instructions of the core processor less any optional or user configured instructions. The static and dynamic counts may be accomplished in any number of different ways readily apparent to those of ordinary skill. Appendix II provides one exemplary script for analyzing a processor (e.g., ARCTM) assembler file and printing the frequency of usage statistics for various processor instruction formats.

[0083] Next, in step 106, the instruction types are sorted by frequency of occurrence as determined in step 104. The number and type of instructions necessary for correct program execution are next determined in step 108. If the instructions can be reduced to a power of 2 that is smaller than that of the full instruction set, then the issue is one of whether or not the instruction set can be reduced by a further factor of 2. The ultimate determination is made by calculating the program size using the proposed new instruction set. If the size is sufficiently small, the compressed instruction set is selected. Criteria used to evaluate the sufficiency of the size of the proposed instruction set can include, for example, (i) the fixed memory requirements of the application (e.g., 128 kilobyte code ROM), or (ii) a code-size change threshold between instruction set iterations (e.g., code size change between iterations less than a certain percentage). Other criteria may be used in place or in conjunction with the foregoing, however, depending on the particular application under evaluation.

[0084] A compressed instruction set encoding is next created in step 110 by selecting the ‘N’ instructions with the highest frequency that permit the test program to be compiled with the desired size. The selection of the N instructions depend specifically upon the maximum number of compressed instructions that are allowed by the processor instruction set architecture (ISA). Some instruction formats may be fixed, while others may have a selectable immediate size.

[0085] The compressed instruction set of step 110 is then re-evaluated in step 112 using the method of steps 104 through 110. Lastly, in step 114, an instruction set encoding for the compressed instruction set is generated.

[0086] FIG. 2 illustrates one exemplary compressed encoding structure 200 using the core instruction set from a pipelined RISC processor (i.e., the ARC™ core produced by the Applicant herein). The instruction structure was constrained to only use 2 extension instruction slots, as only 2 slots are currently available in the aforementioned processor architecture. It will be appreciated, however, that other numbers of instruction slots and encoding structures may be used as compatible with the host processor's architecture. See, for example, the discussion relating to Table 1 herein.

[0087] The encoding structure 200 of FIG. 2 comprises encoding two 14-bit compressed instructions 202, 204, within an aligned 32-bit instruction word 206 having an opcode 207 in the last 4-bits of the 32-bit instruction word 206. The compressed 14-bit instructions 202, 204 of the instruction word 206 use the most frequent statically occurring instructions only. They also utilize a reduced register range (e.g., 8 regs: r0-r4, r13-r16 vs. 32 or 64 registers), and implied registers (e.g., blink, sp, gp, fp). This approach advantageously reduces the number of bits needed to encode a register from 5 or 6 bits down to only 3 bits (or zero bits for implied). As used herein, the term “implied” register refers to registers that are used by an instruction but not specified in the instruction encoding.

[0088] Furthermore, the compressed instructions 202, 204 of the illustrated embodiment mostly only specify 2 operands (i.e., “destructive” two-operand instructions where the destination register and a source register are the same). A reduced conditional branch range (8-bit) is also used. The instructions 202, 204 use no branch delay slot execution modes and allow no conditional execution, thereby simplifying their implementation. No flag setting option is available; rather the flags are always set by the instructions.

[0089] FIG. 3 illustrates one embodiment of the structure 300 of a status register used within the processor to indicate whether the high/low compressed instruction 202, 204 is being executed. Specifically, one bit (the “L bit”) 302 indicates the selected compressed instruction 202, 204 (i.e., “0” or “1”). This register structure 300 allows the 32-bit jumps, interrupts and branch-and-links to function normally, yet can make dynamic jump calculation somewhat more complicated since the L bit should be before bit 0. Specifically, for the unpaired compressed instruction format, the complexity arises from the low address bit (L) being in the wrong bit position for a simple address calculation. For example, consider the following PC register format:

bit 24, L bit bits 23-0, PC address bits (32-bit aligned)

[0090] A simpler register format enabling easy dynamic jump address calculation would be to make the L bit the least significant bit, as follows:

bits 24-1, PC address bits (32-bit aligned) bit 0, L-bit

[0091] For the paired compressed instruction format, the address calculation is somewhat complicated by having to perform a “logical-or” operation in the correct target address compressed instruction high/low selection bit (L). The simpler register format which repositions the L-bit as shown above does not provide any benefit in this case.

[0092] It is noted that greater compression is possible through the use of (i) more instruction slots allowing more bits per compressed instruction, and (ii) independent single 16-bit instruction words (i.e., “single” format; no need to pair as in the preceding examples). Table 1 illustrates this relationship:

TABLE 1
Instruction slots	Paired format	Single format
used	(32 bit)	(16 bit)
2 (4 opcode bits)	2 × 14 bits	1 × 12 bits
4 (3 opcode bits)	(not possible)	1 × 13 bits
8 (2 opcode bits)	2 × 15 bits	1 × 14 bits

[0093] Note that a paired format is not possible in the 4 instruction slot case listed in Table 1 above, as there are an odd number of bits left to divide between the two instructions (e.g., 32 bits−3 bits=29 bits, which does not produce a whole number when divided by two).

[0094] Note that for the paired instruction format, only a moderate level of compression (approx. 15-25%) is achieved, using fetch-aligned 32 bit instructions. This format, however, has the advantage of utilizing only two instruction slots, thereby making a maximum number of unused slots available for other purposes. In contrast, the single instruction format achieves a higher level of instruction set compression (approx. 20-30%) using fetch-unaligned 32 bit instructions, at the price, however, of using more slots.

[0095] In one embodiment of the compressed encoding of the invention, the compressed ISA uses only three bits for register encoding. In another embodiment, four bits are utilized. Note, however, that the use of 4 bits for register encoding would reduce the number of opcodes possible and the size of immediate data.

[0096] The most frequently used registers, i.e., those registers most frequently statically referenced by instructions, are r0-r3 (ABI argument regs.) and r13-r16 (ABI saved registers). Table 2 illustrates the compressed instruction set architecture (ISA) 3-bit register encodings according to the present invention. Table 4 illustrates an alternate 4-bit register encoding.

TABLE 2
3-bit
Compressed
ISA register 32-bit ISA
encoding     register
0            R0
1            R1
2            R2
3            R3
4            R13
5            R14
6            R15
7            R16

[0097]

TABLE 3
4-bit
Compressed
ISA register 32-bit ISA
encoding     register
0            R0
1            R1
2            R2
3            R3
4            R4
5            R5
6            R6
7            R7
8            R8
9            R9
10           R10
11           R11
12           R12
13           R13
14           R14
15           R15

[0098] FIGS. 4-13 illustrate exemplary ISA1 14-bit instruction encodings according to the invention. FIGS. 15-32 illustrate alternative (ISA2) 15-bit instruction encodings. Table 4 below provides a key for the symbology used in FIGS. 4-32.

TABLE 4
Symbol Meaning
a      destination and source register (r0-r3, r13-r16)
b      source register (r0-r3, r13-r16)
c      source register (r0-r3, r13-r16)
cc     condition code (al/eq/ne/lt/le/gt/ge/pnz)
h      high register access (r0-r31)
op     Opcode
s7     signed 7-bit integer
u5     unsigned 5-bit integer

[0099] The exemplary encodings of FIGS. 4-32 advantageously provide faster and simpler instruction decode, since all of the major instruction opcodes are encoded within the top five bits (i.e., the major opcode bits). The major opcode bits determine the format of the rest of the instruction bits (e.g. whether it is a 32 or 16-bit instruction, where the source/destination register fields are, where the immediate data field is, etc.). Within the selectetd instruction format there may be further opcode bits.

[0100] Furthermore, almost all instruction formats have the source register fields located in the same position (i.e., bits 5-7). All of the various sized immediate data fields start from the least significant bit, thereby further enhancing extraction.

[0101] The most frequent compressible instruction functions associated with the exemplary ARC core previously referenced herein include the MOVE (mov), LOAD (Id [reg+offset]), COMPARE (cmp), BRANCH (bcc), STORE (st [reg+offset]), and ADD (add). It will be recognized, however, that the general methods of the present invention may readily be applied to other instructions and ISAs.

[0102] Bcc Offset

[0103] Offset is a signed word aligned offset. cc is the condition. All possible 16 base case conditions could be allowed if a shorter 7-bit range used. BAL (“Branch Always”) may be special format with longer range.

[0104] LD/LDB/LDW a,[b,u4] /ST/BSTW a,[b,u3]

[0105] The primary use of these LOAD/STORE instructions is for data structure access. The 3- or 4-bit unsigned offset is shifted left as required by the data access alignment (e.g. 2 for long word access, 1 for word access and 0 for byte access). This means that structure elements should be designed so that the most frequently accessed items are within the 16 byte offset range for byte accesses, 32 byte offset range for aligned word accesses and 64 byte offset range for aligned long word accesses.

[0106] LD/ST a,[gp, s7]

[0107] Global small data area long word aligned LOAD/STORE access. If a compiled program does not make optimal use of this global variable area, then these instruction slots are wasted. The signed 7-bit offset is a long word aligned offset which is selected so that it can access the whole of the current 512 byte global small data area.

[0108] MOV/CMP a,u7

[0109] This type of instruction occurs very frequently in the above referenced application. Note that the size of immediate data can be reduced to 5 or 6 bits to allow more room for other opcodes. CMP is a special encoding of SUB.F 0,a,u7 with no destination register.

[0110] op a,a,b

[0111] Frequent ops. NEG is a special encoding of “SUB.F a,0,b”. NOT is a special encoding of “XOR.F a, b, −1”.

[0112] “Single_ops” is used to encode single source register operand instructions using the b field as a sub-opcode.

[0113] Frequent implied operand instructions may be encoded off of one of the single_op “op a,b” slots, using the a field as the sub-opcode when b=7. For example:

[0114] st blink,[sp, 4]??; push blink to stack on function call entry

[0115] j[blink]; return from function call

[0116] brk; breakpoint

[0117] op a,a,u5

[0118] Immediate shifts (NB shifts by more than one bit are extension instructions). ADD/SUB with immediate data occurs very frequently. CMP is a special encoding of “SUB.F 0,a,b” with no destination register.

[0119] MOV.F a, h/ MOV.F h,a/CMP a, h/ CMP h,a/ADD.F a, h/ ADD.F h,a

[0120] h is a register in the range r0-r31. It is important in this context to have MOVE/CMP/ADD able to access to all base case registers r0-r31.

[0121] Appendix I describes one possible compressed instruction set encoding that is produced as a result of running the scripts in Appendix II-VII and following the method of synthesis.

[0122] Appendices II and III provides an exemplary script for analyzing a processor (e.g., ARC™) assembler file and printing the frequency of usage statistics for various existing and proposed processor instruction formats.

[0123] Appendix IV provides an exemplary script for marking pairs of compressed instructions for a processor assembler file.

[0124] Appendix V provides an exemplary script for printing the paired ISA format compression ratio. The script is called from a “.bat” (batch) command script to calculate the compression ratio (CR):

CR=n c /n t   (Eqn. 2)

[0125] where:

[0126] nc=number of compressed instructions

[0127] nt=total number of original (uncompressed) instructions

[0128] Appendices VI and VII provide exemplary script to generate a report on analysis of an ARC assembler file.

[0129] Appendix VIII provides an exemplary script for printing a report for usage of specified processor instruction formats from an ISA file and a processor assembler file.

[0130] Appendices IX and X provide exemplary script to strip out more non-instruction lines from an ARC assembler file.

[0131] Appendix XI provides an exemplary script for moving instructions that are in a branch delay slot to before the branch instruction and removing the delay slot mode syntax from the branch instruction of a processor. The syntax is removed since the compressed branch instructions of the illustrated embodiment have only one delay slot mode (i.e., .nd=no delay slot).

[0132] Appendix XII provides an exemplary set of instruction formats according to the present invention.

[0133] Method of Synthesizing

[0134] Referring now to FIG. 33, the method 3300 of synthesizing a processor design incorporating the compressed instruction set previously discussed is described. The generalized method of synthesizing integrated circuits having a user-customized (i.e., “soft”) instruction set is disclosed in Applicant's co-pending U.S. patent application Ser. No. 09/418,663 entitled “Method And Apparatus For Managing The Configuration And Functionality Of A Semiconductor Design” filed Oct. 14, 1999, which is incorporated herein by reference in its entirety.

[0135] While the following description is presented in terms of an algorithm or computer program running on a microcomputer or other similar processing device, it can be appreciated that other hardware environments (including minicomputers, workstations, networked computers, “supercomputers”, and mainframes) may be used to practice the method. Additionally, one or more portions of the computer program may be embodied in hardware or firmware as opposed to software if desired, such alternate embodiments being well within the skill of the computer artisan.

[0136] Initially, user input is obtained regarding the design configuration in the first step 3302. Specifically, desired modules or functions for the design are selected by the user, and instructions relating to the design are added, subtracted, or generated as necessary. For example, in signal processing applications, it is often advantageous for CPUs to include a single “multiply and accumulate” (MAC) instruction. In the present invention, the instruction set of the synthesized design is modified so as to incorporate the foregoing instruction set compression (or other comparable compression techniques) therein.

[0137] The technology library location for each VHDL file is also defined by the user in step 3302. The technology library files in the present invention store all of the information related to cells necessary for the synthesis process, including for example logical function, input/output timing, and any associated constraints. In the present invention, each user can define his/her own library name and location(s), thereby adding further flexibility.

[0138] Next, in step 3303, the user creates customized HDL functional blocks based on the user's input and the existing library of functions specified in step 3302.

[0139] In step 3304, the design hierarchy is determined based on user input and the aforementioned library files. A hierarchy file, new library file, and makefile are subsequently generated based on the design hierarchy. The term “makefile” as used herein refers to the commonly used UNIX makefile function or similar function of a computer system well known to those of skill in the computer programming arts. The makefile function causes other programs or algorithms resident in the computer system to be executed in the specified order. In addition, it further specifies the names or locations of data files and other information necessary to the successful operation of the specified programs. It is noted, however, that the invention disclosed herein may utilize file structures other than the “makefile” type to produce the desired functionality.

[0140] In one embodiment of the makefile generation process of the present invention, the user is interactively asked via display prompts to input information relating to the desired design such as the type of “build” (e.g., overall device or system configuration), width of the external memory system data bus, different types of extensions, cache type/size, etc. Many other configurations and sources of input information may be used, however, consistent with the invention.

[0141] In step 3306, the user runs the makefile generated in step 3304 to create the structural HDL. This structural HDL ties the discrete functional block in the design together so as to make a complete design.

[0142] Next, in step 3308, the script generated in step 3306 is run to create a makefile for the simulator. The user also runs the script to generate a synthesis script in step 3308.

[0143] At this point in the program, a decision is made whether to synthesize or simulate the design (step 3310). If simulation is chosen, the user runs the simulation using the generated design and simulation makefile (and user program) in step 3312. Alternatively, if synthesis is chosen, the user runs the synthesis using the synthesis script(s) and generated design in step 3314. After completion of the synthesis/simulation scripts, the adequacy of the design is evaluated in step 3316. For example, a synthesis engine may create a specific physical layout of the design that meets the performance criteria of the overall design process yet does not meet the die size requirements. In this case, the designer will make changes to the control files, libraries, or other elements that can affect the die size. The resulting set of design information is then used to re-run the synthesis script.

[0144] If the generated design is acceptable, the design process is completed. If the design is not acceptable, the process steps beginning with step 3302 are re-performed until an acceptable design is achieved. In this fashion, the method 3300 is iterative.

[0145] FIG. 34 illustrates an exemplary pipelined processor fabricated using a 1.0 um process and incorporating the aforementioned compressed instruction set. As shown in FIG. 34, the processor 3400 is an ARC microprocessor-like CPU device having, inter alia, a processor core 3402, on-chip memory 3404 (including program memory), and an external interface 3406. The device is fabricated using the customized VHDL design obtained using the method 3300 of the present invention, which is subsequently synthesized into a logic level representation, and then reduced to a physical device using compilation, layout and fabrication techniques well known in the semiconductor arts.

[0146] It will be appreciated by one skilled in the art that the processor of FIG. 34 may contain any commonly available peripheral such as serial communications devices, parallel ports, timers, counters, high current drivers, analog to digital (A/D) converters, digital to analog converters (D/A), interrupt processors, LCD drivers, memories and other similar devices. Further, the processor may also include custom or application specific circuitry. The present invention is not limited to the type, number or complexity of peripherals and other circuitry that may be combined using the method and apparatus. Rather, any limitations are imposed by the physical capacity of the extant semiconductor processes which improve over time. Therefore it is anticipated that the complexity and degree of integration possible employing the present invention will further increase as semiconductor processes improve.

[0147] It is also noted that many IC designs currently use a microprocessor core and a DSP core. The DSP however, might only be required for a limited number of DSP functions, or for the IC's fast DMA architecture. The invention disclosed herein can support many DSP instruction functions, and its fast local RAM system gives immediate access to data. Appreciable cost savings may be realized by using the methods disclosed herein for both the CPU & DSP functions of the IC.

[0148] Additionally, it will be noted that the methodology (and associated computer program) as previously described herein can readily be adapted to newer manufacturing technologies with a comparatively simple re-synthesis instead of the lengthy and expensive process typically required to adapt such technologies using “hard” macro prior art systems. For example, the present invention is compatible with 0.35, 0.18, and 0.1 micron processes, and ultimately may be applied to processes of even smaller or other resolution. An exemplary process for fabrication of the device is the 0.1 micron “Blue Logic” Cu-11 process offered by International Business Machines Corporation, although others may be used.

[0149] Referring now to FIG. 35, one embodiment of a computing device capable of synthesizing compressed instruction set processor designs using the methodology discussed with respect to FIG. 33 herein is described. The computing device 3500 comprises a motherboard 3501 having a central processing unit (CPU) 3502, random access memory (RAM) 3504, and memory controller 3505. A storage device 3506 (such as a hard disk drive or CD-ROM), input device 3507 (such as a keyboard or mouse), and display device 3508 (such as a CRT, plasma, or TFT display), as well as buses necessary to support the operation of the host and peripheral components, are also provided. The aforementioned VHDL descriptions and synthesis engine are stored in the form of an object code representation of a computer program in the RAM 3504 and/or storage device 3506 for use by the CPU 3502 during design synthesis, the latter being well known in the computing arts. The user (not shown) synthesizes logic designs by inputting design configuration specifications into the synthesis program via the program displays and the input device 3507 during system operation. Synthesized designs generated by the program are stored in the storage device 3506 for later retrieval, displayed on the graphic display device 3508, or output to an external device such as a printer, data storage unit, other peripheral component via a serial or parallel port 3512 if desired.

[0150] It will be recognized that while certain aspects of the invention are described in terms of a specific sequence of steps of a method, these descriptions are only illustrative of the broader methods of the invention, and may be modified as required by the particular application. Certain steps may be rendered unnecessary or optional under certain circumstances. Additionally, certain steps or functionality may be added to the disclosed embodiments, or the order of performance of two or more steps permuted. All such variations are considered to be encompassed within the invention disclosed and claimed herein.

[0151] While the above detailed description has shown, described, and pointed out novel features of the invention as applied to various embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the device or process illustrated may be made by those skilled in the art without departing from the invention. The foregoing description is of the best mode presently contemplated of carrying out the invention. This description is in no way meant to be limiting, but rather should be taken as illustrative of the general principles of the invention. The scope of the invention should be determined with reference to the claims.

APPENDIX I

[0152] Copyright© 2000-2001 ARC International plc. All rights reserved.

bl
b
beq
bgt
bhi
stblink
jblink
jr
jlr
movr
movf0r
movf0h
movrh
movhr
cmprh
cmphr
cmpr
cmpi64
movi64
addi32
subi32
addabi8
subabi8
subneaaa
subhhh
subaaa
subaab
subrrr
addaab
addrrr
addrrh
asli8
aslab1
aslab2
asri8
asrab1
asrab2
lsri8
lsrab1
lsrab2
andi32
andfi32
andaab
andfab
mul0ab
muli32
ldabc
ldr64
ldwr32
ldbr16
str64
stbr8
stwr16
ldrpc
addrpc
ldfp32
stfp32
addfpi32
ldgp

APPENDIX II

[0153] Copyright© 2000-2001 ARC International plc. All rights reserved.

#	Confidential Information
#	Limited Distribution to Authorized Persons Only
#	Created 2000 and Protected as an Unpublished Work
#	Under the U.S.Copyright act of 1976.
#	Copyright © 2000-2001 ARC CORES LTD
#	All Rights Reserved
#	SCCS release	: %M% %I% %G%
#	Description	: Script to analyse an ARC assembler file and
#	print frequency of usage stats for various
#	ARC instruction formats
#
#
#
#--
========================================================================
===========================--#
BEGIN {
}
{op[$1]++}
END {
	OFS=“\t”
	for (i in op) print i, op[i], int(op[i]*1000/NR)/10
}
#/ (j)|jl|b|bl) (ge|gt|le|lt|ne|eq|pl|mi|hi|hs|lo|ls) ?\.d/ {
#	stored = $0
#	sub(/\.d/, “”, stored)
#	getline
#	print $0
#	print stored
#	next
#}
#
#{ print $0 }

APPENDIX III

[0154] Copyright© 2000-2001 ARC International plc. All rights reserved.

APPENDIX IV

[0155] Copyright© 2000-2001 ARC International plc. All rights reserved.

#	Confidential Information
#	Limited Distribution to Authorized Persons Only
#	Created 2000 and Protected as an Unpublished Work
#	Under the U.S.Copyright act of 1976.
#	Copyright © 2000-2001 ARC CORES LTD
#	All Rights Reserved
#
#	SCCS release	: %M% %I% %G%
#
#	Description	: Script to mark pairs of compress instructions
#	for an ARC assembler file.
#
#
#
#--
========================================================================
===========================--#
/ˆ c/ {
	a=$0
	hra=NR
	getline b
	if (b ˜ /ˆ c/) {
	c++
	print “p” a
	print “p” b
	next
	} else {
	print a
	print b
	next
	}
}
{
	print $0
}
END {
# print c
}

APPENDIX V

[0156] Copyright© 2000-2001 ARC International plc. All rights reserved.

#	Confidential Information
#	Limited Distribution to Authorized Persons Only
#	Created 2000 and Protected as an Unpublished Work
#	Under the U.S.Copyright act of 1976.
#	Copyright © 2000-2001 ARC CORES LTD
#	All Rights Reserved
#
#	SCCS release	: %M% %I% %G%
#	Description	: Script to print the “paired” ISA format compression
ratio
#
#
#
#--
========================================================================
===========================--#
BEGIN {
system (“grep -c \”ˆ pc\“ cp >ta”)
getline a <“ta”
system (“grep -c \”.\“ cp >tb”)
getline b <“tb”
print int (a*1000/b) /10
}
□

APPENDIX VI

[0157] Copyright© 2000-2001 ARC International plc. All rights reserved.

rem
rem	Confidential Information
rem	Limited Distribution to Authorized Persons Only
rem	Created 2000 and Protected as an Unpublished Work
rem	Under the U.S.Copyright act of 1976.
rem	Copyright © 2000-2001 ARC CORES LTD
rem	All Rights Reserved
rem
rem	SCCS release	: %M% %I% %G%
rem
rem	Description	: Script to generate a report on analysis of
rem	an ARC assembler file
rem
rem
rem
rem--
========================================================================
===========================--#
@echo off
del /q *.r
for %x in (@%1) do echo %x >%x.r
for %x in (@%1) do awk -f \awk\REPORT.AWK %x\f >>%x.r
for %x in (@%1) do (pushd ˆ cd %x ˆ awk -f \awk\ratio.AWK %x\cp
>>.. \%x.r ˆ popd)
rem awk ‘ {printf “\t%5s” $1 } ’ %1
cat nl isa14 >i
pr -m -t i *.r
□

APPENDIX VII

[0158] Copyright© 2000-2001 ARC International plc. All rights reserved.

rem
rem	Confidential Information
rem	Limited Distribution to Authorized Persons Only
rem	Created 2000 and Protected as an Unpublished Work
rem	Under the U.S.Copyright act of 1976.
rem	Copyright © 2000-2001 ARC CORES LTD
rem	All Rights Reserved
rem
rem	SCCS release	: %M% %I% %G%
rem
rem	Description	: Script to generate a report on analysis of
rem	an ARC assembler file
rem
rem
rem
rem--
========================================================================
===========================--#
call rep apps1 >t1
call rep apps2 >t2
pr -w 160 -s -m -t t1 t2 >t
expand -t 8 t >tt
□

APPENDIX VIII

[0159] Copyright© 2000-2001 ARC International plc. All rights reserved.

#
#	Confidential Information
#	Limited Distribution to Authorized Persons Only
#	Created 2000 and Protected as an Unpublished Work
#	Under the U.S.Copyright act of 1976.
#	Copyright © 2000-2001 ARC CORES LTD4
#	All Rights Reserved
#
#	SCCS release	: %M% %I% %G%
#
#	Description	: Script to print a report for usage of
#	specified ARC instruction formats from an ISA file
#	and an ARC assembler file.
#
#
#
#--
========================================================================
===========================--#
BEGIN {
	isa = “isa14”
	while (getline <isa) { format [$1] =1 }
	OFS=“\t”
}
{
	for (i in format) {
	if ($1 == i) {
	t += $3
	if ($3 == “”) {print “0”) else {print $3}
	#	if ($3 == “”) {print $1, “0”} else {print $1,$3}
	}
	}
}
END {
	print t
# for (i in format) { print i}
}
□

APPENDIX IX

[0160] Copyright© 2000-2001 ARC International plc. All rights reserved.

rem
rem	Confidential Information
rem	Limited Distribution to Authorized Persons Only
rem	Created 2000 and Protected as an Unpublished Work
rem	Under the U.S.Copyright act of 1976.
rem	Copyright © 2000-2001 ARC CORES LTD
rem	All Rights Reserved
rem
rem	SCCS release	: %M% %I% %G%
rem
rem	Description	: Script to strip out non-instruction lines
rem	from an ARC assembler file
rem
rem
rem
rem--
========================================================================
==========================--#
@echo off
egrep -v “ˆ ($|;|.\.|\.|[˜a-zA-Z] |. [0-9])” d >dd
wc −1 dd
grep -c “ˆ \[” dd
grep -c “<= Compressable” dd
□

APPENDIX X

[0161] Copyright© 2000-2001 ARC International plc. All rights reserved.

rem
rem	Confidential Information
rem	Limited Distribution to Authorized Persons Only
rem	Created 2000 and Protected as an Unpublished Work
rem	Under the U.S.Copyright act of 1976.
rem	Copyright © 2000-2001 ARC CORES LTD
rem	All Rights Reserved
rem
rem	SCCS release	: %M% %I% %G%
rem
rem	Description	: Script to strip out more non-instruction lines
rem	from an ARC assembler file
rem
rem
rem
rem--
=======================================================================
===========================--#
sed “s/ˆ \[//” dd |sed “s/ \] $//” |grep -v “ˆ .;” |tr “|” “\n” |sed “s/ˆ
//” |sed “s/ ;.*//” |awk -f delay.awk >dds

APPENDIX XI

[0162] Copyright© 2000-2001 ARC International plc. All rights reserved.

#
#	Confidential Information
#	Limited Distribution to Authorized Persons Only
#	Created 2000 and Protected as an Unpublished Work
#	Under the U.S.Copyright act of 1976.
#	Copyright © 2000-2001 ARC CORES LTD
#	All Rights Reserved
#
#	SCCS release	: %M% %I% %G%
#
#	Description	: Script to place instructions that are in a delay
#	slot to before the branch and remove the “.d”
#	from the branch of an ARC assembler file
#
#
#
#--
========================================================================
===========================--#
/ (j|jl|b|bl) (ge|gt|le|lt|ne|eq|pl|mi|hi|hs|lo|ls|pnz) ?\.d/ {
	stored = $0
	sub(/\.d/, “”, stored)
	getline
	print $0
	print stored
	next
}
{print $0 }

APPENDIX XII

[0163] Copyright© 2000-2001 ARC International plc. All rights reserved.

Instruction formats
1 = instruction opcode
a = register (r0-3, r13-16)
b = register (r0-3, r13-16)
c = register (r0-3, r13-16)
h = register high (r0-r31)
q = condition code
u = unsigned immediate
s = signed immediate
Op	Format	Instruction	Operands	Comment
0	iiiiqqssssssss	bal/beq/bne	s8	;	if cc pc=(pc&0xfffffffc) + (s8<<1)
	iiiillqqssssss	bgt/bge/blt/ble	s6	;	if cc pc=(pc&0xfffffffc) + (s6<<1)
1	iiiissssssssss	bl	s10	;	blink=pc; pc=(pc&0xfffffffc) + (s10<<2)
2	iiiiaaabbbiiii	op	a,a,b	;	op =	sub/and/or/xor/asl/asr/lsr/
			a,b,1	;		as11/asr1/
			a,b,2	;		as12/asr2/
			0,a,b	;		and.f/mul64/?/?/s_op
	iiiiaaaiiillll	s_op	a,a	;	s_op=extb/extw/sexb/sexw/
	[a]	;	j/jl/
	a,a,a	;	sub.ne/i_op
	iiiiiii1111111	i_op3		;	i_op=brk/j [blink]/st blink[sp,4]/
3	iiiiaaaiuuuuuu	mov/cmp	a,u6
4	iiiiaaaiiuuuuu	add/sub/?/?	a,a,u5
5	iiiiaaahhh00hh	mov	a,h
	iiiiaaahhh01hh	add	a,a,h
	iiiiaaahhh1ihh	mov/cmp	h,a
6	iiiiaaa000iuuu	ld/st	a, [fp, −u3]	;	a=mem[fp − (u3 << 2)]
	iiiiaaa00iiuuu	add/?	a, [fp, −u3]	;	a=fp − (u3 << 2)
	iiiiaaaiiuuuuu	asl/asr/lsr	a,a,u5
7	iiiiaaabbbuuuu	ld	a, [b,u4]	;	a=mem[b + (u4 << 2)]
8	iiiiaaabbbuuuu	ldb	a, [b,u4]	;	a=mem[b + u4]
9	iiiiaaabbbuuuu	ldw	a, [b,u4]	;	a=mem[b + (u4<<1)]
A	iiiiaaabbbuuuu	st	a, [b,u4]	;	a=mem[b + (u4<<2)]
B	iiiiaaabbb0uuu	stb	a, [b,u3]	;	a=mem8 [b + u3]
	iiiiaaabbb1uuu	stw	a, [b,u3]	;	a=mem[b + (u3<<1)]
C	iiiiaaabbbiuuu	add/sub	a,b,u3	;	a=b op u3
D	iiiiaaauuuuuuu	ld	a, [pc,u7]	;	a=mem[(pc&0xfffffffc) + (u7 << 2)]
E	iiiiaaauuuuuuu	ld	a, [gp,u7]	;	a=mem[gp + (u7 << 2)]
F	iiiixxxxxxxxxx	reserved
	Other possible formats:
	iiiiaaabbb0ccc	ld	a, [b, c]	;	a=mem[b + c]
	iiiiaaabbb1ccc	add	a,b,c	;	a=b+c
	iiiiaaauuuuuuu	add	a,pc,u7	;	a=(pc&0xfffffffc) + (u7 << 2)

Claims

1. A method of optimizing the instruction set of a digital processor, comprising: (i) providing a program having a plurality of different instruction types; (ii) determining the frequency of each of said instruction types from a base instruction set; (iii) determining the number and type of instructions necessary for correct instruction set execution based at least in part on said act of determining the frequency; and (iv) creating a compressed instruction set encoding to generate a compressed instruction set based at least in part on said act of determining.

2. The method of claim 1, further comprising: re-evaluating said compressed instruction set using at least said steps (i), (ii), and (iii); and generating an instruction set encoding for said compressed instruction set.

3. The method of claim 1, wherein the act of providing a program comprises providing an assembly language program.

4. The method of claim 3, further comprising sorting said instruction types by frequency of usage.

5. The method of claim 4, wherein said digital processor includes an extension logic unit adapted to execute at least one extension instruction, and the act of providing comprises providing a program having said at least one extension instruction, aid at least one execution instruction being executable by said extension logic unit.

6. The method of claim 1, wherein the act of creating a compressed instruction set comprises selecting those “N” instructions having the greatest frequency of occurrence, said selected “N” instructions permitting said program to be compiled with a predetermined size.

7. The method of claim 6, further comprising the act of determining a compression ratio for said compressed instruction set, said compression ratio being related to the ratio of the number of compressed instructions to the total number of original instructions.

8. A pipelined digital processor, comprising: a processor core having an instruction pipeline comprising at least instruction fetch, decode, and execute stages; a data interface in data communication with said processor core, said interface adapted for data communication with a storage device configured to hold a plurality of program instructions; and an optimized instruction set comprising a base instruction set and a compressed instruction set, said compressed instruction set being generated by the method comprising: determining the frequency of each of said instruction types from said base instruction set; determining the number and type of instructions necessary for instruction set execution based at least in part on said act of determining the frequency; and creating a compressed instruction set encoding to generate said compressed instruction set.

9. The processor of claim 8, wherein the act of creating a compressed instruction set comprises selecting those “N” instructions having the greatest frequency of occurrence, said selected “N” instructions permitting said program to be compiled with a predetermined size.

10. The processor of claim 8, wherein said optimized instruction set also comprises at least one extension instruction adapted to perform a predetermined function, said processor further comprises an extension logic unit adapted to execute said at least one extension instruction.

11. The processor of claim 9, further comprising an encoding structure having an opcode and a plurality of instruction slots.

12. The processor of claim 11, wherein said plurality of instruction slots comprise two slots, each of said slots having two 14-bit instructions.

13. The processor of claim 11, wherein said encoding structure comprises 32 bits, and said opcode is disposed within the last four bits thereof.

14. A digital processor, comprising: a processor core having a pipeline comprising at least instruction fetch, decode, and execute stages; a memory interface adapted to at least read program instructions from a program memory and provide said instructions to said pipeline; and an optimized instruction set comprising a base instruction set and a compressed instruction set, said compressed instruction set having a predetermined number and type of instructions necessary for correct instruction set execution on said processor core, said predetermined number and type based at least in part on the frequency of occurrence of instructions within said base instruction set.

15. The processor of claim 14, further comprising an encoding structure having an opcode and a plurality of instruction slots.

16. The processor of claim 15, wherein said instruction set includes at least one extension instruction, said at least one extension instruction adapted to perform a predetermined function upon execution within said processor.

17. The processor of claim 16, further comprising an extension logic unit adapted to execute said at least one extension instruction.

18. A method of synthesizing the design of an integrated circuit digital processor comprising: obtaining input regarding the configuration of said design; creating a functional description based on said input and existing libraries of functions, said functional description comprising an optimized instruction set comprising a base instruction set and a compressed instruction set, said compressed instruction set having a predetermined number and type of instructions necessary for correct instruction set execution on said processor, said predetermined number and type based at least in part on the frequency of occurrence of instructions within said base instruction set; determining a design hierarchy based on said input and existing libraries; generating structural HDL and a script associated therewith; running said script to create a synthesis script; and synthesizing said design using synthesis script.

19. A method of enhancing the performance of a reduced instruction set processor, said processor having a multi-stage instruction pipeline and an instruction set having at least a base instruction set, said base instruction set having a plurality of instruction types associated therewith; comprising: providing a program having a plurality of instructions; determining the frequency of each of said instruction types within said plurality of instructions of said program; selecting those “N” instructions having the greatest frequency of occurrence, said selected “N” instructions allowing said program to be compiled with a predetermined size; and compiling said program based at least in part on said “N” instructions.

20. An application specific integrated circuit (ASIC), comprising: a first processor core, said processor core having a pipeline with at least instruction fetch, decode, and execute stages associated therewith; an optimized instruction set comprising a base instruction set and a compressed instruction set, said compressed instruction set having a predetermined number and type of instructions, said predetermined number and type based at least in part on the frequency of occurrence of instructions within said base instruction set, said optimized instruction set further comprising at least one extension instruction adapted to perform at least one specific operation; at least one storage device adapted to store a plurality of data bytes therein, said at least one storage device being accessible by said first processor core; and at least one extension logic unit adapted to facilitate execution of said at least one execution instruction.

21. The ASIC of claim 20, further comprising a second processor core, said second processor core being disposed on the same die as said first processor core.

22. The ASIC of claim 21, wherein said second processor core comprises a digital signal processor (DSP), said DSP being adapted to perform at least one operation on data provided to said ASIC.

23. The ASIC of claim 22; wherein said DSP is adapted for initiation by an instruction from said first processor core.

24. The ASIC of claim 22, wherein at least a portion of the operation of said DSP is controlled by extension registers associated with said first processor core.

25. A pipelined digital processor, comprising: processor means having an instruction pipeline comprising at least means for instruction fetch, means for instruction decode, and means for instruction execution; means for data interface, said means for data interface being in data communication with said processor core, said means for data interface adapted for data communication with a storage device configured to hold a plurality of program instructions; and optimized instruction means comprising base instruction means and compressed instruction means, said compressed instruction means being generated by the method comprising: determining the frequency of each of said instruction types from said base instruction means; determining the number and type of instructions necessary for instruction execution based at least in part on said act of determining the frequency; and creating a compressed instruction set encoding to generate said compressed instruction means.

26. A method of operating a pipelined digital processor having an instruction pipeline comprising at least instruction fetch, decode, and execute stages, a storage device configured to hold a plurality of program instructions, and an optimized instruction set, the method comprising: providing a base instruction set having a plurality of instructions; providing a compressed instruction set derived at least in part from said base instruction set; assigning one of a plurality of predetermined values to at least one bit within a status register within said processor; executing at least one instruction from said base instruction set within said pipeline based on a first predetermined value present in said status register; and executing at least one instruction from said compressed instruction set within said pipeline based on a second predetermined value present in said status register.

27. The method of claim 26, wherein the act of assigning comprises assigning a “1” or “0” value to a low address (L) bit within said register.

28. The method of claim 27, wherein the act of providing a compressed instruction set comprises encoding at least a portion of the instruction operation codes (opcodes) for the compressed instructions within the “n” most significant bits.

29. The method of claim 27, wherein the act of providing a compressed instruction set further comprises encoding a plurality of said compressed instructions with source register fields located in a predetermined relationship to one another.

30. The method of claim 29, wherein the act of encoding with said predetermined relationship comprises encoding the source register fields for respective ones of said plurality of compressed instructions at identical locations.

31. The method of claim 26, wherein the act of providing a compressed instruction set comprises encoding all of the immediate data fields such that they start from the least significant bit (LSB).