CA1205564A - Program counter stacking method and apparatus for nested subroutines and interrupts - Google Patents

Program counter stacking method and apparatus for nested subroutines and interrupts

Info

Publication number
CA1205564A
CA1205564A CA000441392A CA441392A CA1205564A CA 1205564 A CA1205564 A CA 1205564A CA 000441392 A CA000441392 A CA 000441392A CA 441392 A CA441392 A CA 441392A CA 1205564 A CA1205564 A CA 1205564A
Authority
CA
Canada
Prior art keywords
address
return
microinstruction
register
interrupt
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
CA000441392A
Other languages
French (fr)
Inventor
Ming T. Miu
John J. Bradley
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bull HN Information Systems Inc
Original Assignee
Honeywell Information Systems Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Honeywell Information Systems Inc filed Critical Honeywell Information Systems Inc
Application granted granted Critical
Publication of CA1205564A publication Critical patent/CA1205564A/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003Arrangements for executing specific machine instructions
    • G06F9/3005Arrangements for executing specific machine instructions to perform operations for flow control
    • G06F9/30054Unconditional branch instructions
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/22Microcontrol or microprogram arrangements
    • G06F9/26Address formation of the next micro-instruction ; Microprogram storage or retrieval arrangements
    • G06F9/262Arrangements for next microinstruction selection
    • G06F9/268Microinstruction selection not based on processing results, e.g. interrupt, patch, first cycle store, diagnostic programs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/448Execution paradigms, e.g. implementations of programming paradigms
    • G06F9/4482Procedural
    • G06F9/4484Executing subprograms
    • G06F9/4486Formation of subprogram jump address

Abstract

ABSTRACT OF THE DISCLOSURE

A computer system which facilitates the execution of nested subroutines and interrupts is disclosed. As each branch transfer within the program is executed by a control area logic, a microcommand initiates the transfer of the return address, which has been derived from the address in the present routine, to a first register of a push down stack. In addition, the microcommand also pushes down one level the contents of all of the registers in the stack containing previously stored return addresses. Thus, a sequential return to unfinished routines or subroutines is provided. When the subroutine or hardware interrupt service routine is completed, a code in the address field enables the return address of the previously branched from or interrupted routine to be retrieved from the first register in the push down stack and to provide it as the address of the next instruction to be executed. The retrieval of the return address from the push down stack also pops all other stored return addresses one level in the stack. In addition to providing multiple levels of subroutine and interrupt nesting, any number of subroutines or hardware interrupts may be partially completed since the last operating subroutine or hardware interrupt service routine is always the first one to be completed. Logic is also provided to detect the occurrence of a hardware interrupt during a return sequence such that the requirement to simultaneously push and pop the stack is properly handled.

Description

;564 BACKGRO~ND OF THE INVENTION

Field of the Invention This invention relates to data processing systems and more specifically to a data processing system which provides for execution of nested aubroutines and interrupts.

Description of the Prior Art The operations carried out in a data processing system and the order in which they occur are stated by means of a program stored in a memory. To alleviate the programmer's problem of complet~ely specifying each series of operations to be performed and to better utilize the capabilities of a data processor, common functions which may be required s~veral times in one program or may be utilized in other programs are usually provided. Each common function may be specified as a subroutine wherein a subroutine includes a sequence of instructions.

Subroutines may be utilized for a nurnber of common functions, for example, tri~onometric functions using mathematical approximations. ~ather than rewrite the series of operations several times, the programlner merely has to write one set of instructions to perform the operation and call it a number of times. Thus1 for a
-2- ~ 5 6 ~

routine requiring a value of a trigonometric function, such as cosine, a branch operation to the cosine subroutine in the digital data processor is executed.

Often times it has been found that one subroutine will call another subroutine in order to complete its operation. When this situation occurs, complications arise since the return address, i.e., the next address from the branching subroutine must be stored and recalled by the data processor. Thus while the efficiency of the overall program is enhanced by providing for a particular function in only one place in the data processor, it is often times found that inefficiencies arise in c-alling and returning from the various subroutines both as to tirne considerations and hardware and/or space iimitations.

In the prior art, a number of solutions for transferring to and from subroutines have been provided.
One solution involves the transferral of the next instruction location to the first location of the subroutine. In this design, the last subroutine instruction accesses the first location of the subroutine.
This first location contains the return address to the next instruction (i.e., one instruction past the instruction that branched to the subroutine) thus enabling the data processor to continue sequencing through the program. This method suffers disadvantages since handling _3_ ~ S ~ 4 of several co~mon transfers complicates the situation.
For example, it is often advantageous to transfer operations from a first subroutine to a second subroutine which utilizes the first subroutine. In other situations, it may be advantageous if the first subroutine recalls itself. These transfers are difficult, and sornetimes impossible to achieve with data processing systems of the above types without modification or without increasing the number of instructions. ~Ihen the first subroutine is called for a first time, the the address of next microinstruction in the main rou~ine is transferred to the first subroutine location. When the first subroutine is recalled by an intermediate routine, the address of the next instruction in the intermediate routine is transferred to the same location in the first subroutine thus destroying the original contents. As a result, while the first subroutine can return to the intermediate routine, it cannot return to the main routine.

in data processing systems which permit a first or second subroutine to recall the first subroutine, an instruction may be provided to move the return address to a specified storage location. The last subroutine instruction is then altered so as to include the address of the specified storage location. Although this system permits one subroutine to call another subroutine, i.e., to have the latter subroutine nest, and permit a partially completed subroutine to be subsequently used for o~her purposes, one reserve memory location and several instructions are required for each nesting level.
Increasing the number of these memory locations for each nested subroutine increases the complexity of the control circuitry. In addition, programming complexity is increased because the last subroutine instruction rnust be modified to address the proper memory location for each subroutine. Therefore, this approach becomes more cumbersome as the number of nesting levels are increased.

Another type of data processing system: utili~es vacant locations in memory for storing the return addresses of the subroutine or routine previously executed. The last instruction of the subroutine branches to a designated memory location. In order to exploit this system, however, two registers, one a pointer to the vacant memory locations and another which provides for the current value of the register and the memory address, are required. While this type of data processing unit overcomes some of the previous problems, it still results in supplemental instructions to indicate each new level of subroutines with a concurrent ereater execution time required.

;5~
A more recent solution to this problem is found in U.S. Patent
3,909,797 entitled, "Data Processing System Utilizing ~ontrol Store Unit and Push Down Stack for ~ested Subroutines". In this patent, the data pro-cessing system has a microprogrammed control store unit which enables the sequencing of the central processing subsystem. This patent provides for the nesting of subroutines programmed within the firmware that controls the control store unit, but the principles of the invention are equally applic-able to software programs or firmware microprograms. The control store unit provides a branching microinstruction to a microprogram subroutine via a microcommand for enabling the return address of the current operating microprogram routine to be stored. The microcommand also enables a push down stack such that previously stored return microprogram addresses are moved down (pushed) one level. ~pon completion of the microprogram subroutine, the control store unit provides a branch field for enabling a multiplexer to select the return address contained on the top of the push down stack and provide it to the current address register in the system.
The branch field also raises one level the previously stored return addresses in the push down stack.

5~
Interrupts are used in a data processing system to make it responsive to events that occur asynchronously to the execution of the program. These asynchronous events may be faults within the data processing system or change of status of devices controlled by the data processing system. For example, by interrupting the data processing system, an input/output (I/O) device can signal that it requires attention or service by the data processing system. Such interrupts can be used to signal the completion of an I/O operation or a system fault such as a memory error. As in the case of subroutines, interrupts can divert the program flow. In the case of interrupts, program flow is diverted to ann interrupt service routine which is programmed to handle the type of event that caused the interrupt. ~pon completion of the execution of the interrupt service routine, the interrupt service routine must cause the data processor to resume execution of the program at the return address that was stored upon interruption.

One method for storing the return address is to assign fixed locations within memory to each type of interrupt for storing the return address of the prograrn that was interrupted. ~sing this method~ when the interrupt service routine is completed, it can reload the data processor's program counter from the fixed memory 5S~
location associated with a particular type of interrupt and resume execution of the program that was executing just prior to the occurrence of the interrupt. lhis method has the disadvantage that interrupt service routines can not easily share common program instructions because in order to return to the interrupted program, the service routine must retrieve the interrupt return address from a fixed memory location that difEers with each interrupt.
A different approach to handling interrupt return addresses is found in U.S. Patent 4,340,933 entitled "Data Processing System Having Centralized Nonexistent Memory Address Detection". In this patent, which deals with hardware interrupts that interrupt the execution of a firmware microprogram, the microporgram return address is stored in a special register (the hardware interrupt return address register) and further hardware interrupts are prevented until completion of the microprogram hardware interrupt service routine. Inhibiting subsequent interrupts insures that the first microprogram return address stored in the hardware interrupt return address register will not be destroyed by a second return address being stored over it by the occurrence of a second hardware interrupt. This method, although allowing interrupt service routines to -8- lZ~SS64 share common program instructions because all interrupt service routines restore execution to the interrupted program by reloading the program counter from the one interrupt return address register, still has the S disadvantage that interrupts and subroutines can not easily share common program instructions.

Therefore, what is needed is a method of storing return addresses that will allow the nesting of subroutine calls and the servicing of interrupts in a comrnon and efficient manner.

9 lZ~5564 OBJECTS OF T~E INVENTION

Accordingly, it is a primary object of this invention to provide an improved data processing system wherein subroutine transfers and interrupts are expedited.

It is another object of this invention to provide a new and improved system for storing return addresses when branching to subroutines or responding to asynchronous interrupts and for automatically enabling the branched to subroutine or the interrupt response routine, upon completion, to resume program execution at a return address.
., It is a further object of the invention to provide an improved technique for employing nested subroutines and interrupts for use in data processing and cornputing systems which technique is efficient, reliable and results in overall time saving.

This invention is pointed out with particularity in the appended claims. An understanding of the above and further objects and advantages of this invention can be obtained by referring to the following description taken in conjunction with the drawings.

~_2~15564 SUMMARY OF THE IN~ENTION
The foregoing objects are achieved according to one embodiment of the invention according to one mode of operation thereof, by providing in a data processing system microprocessor, a control area which enables the sequencing of the microprocessor. The control area provides a branching microinstruction to the subroutine via a microcommand for enabling the return address of the current operating routine to be stored. The microcolnmand also enables a push-down stack so that the previously stored return addresses are pushed down one level. The control area further provides for generating vectored interrupt addresses which correspond to the highest priority non-inhibited pending interrupt. These vectored interrupt addresses are provided to the next address register in place of the address generated by the current microinstruction and the address generated by the current microinstruction is pushed onto the push-down stack one level upon the occurrence of an interrupt. Upon completion Or a subroutine or an interrupt service routine, the control area provides an address field for enabling a multiplexer to select the return address contained in the top of the push-down stack to be provided to the next address register in the control area. This popping o~ the push-down stack also raises one level the previously stored return addresses. Means are also 955~i~
provided so that if an interrupt occurs when returning from a sub-routine or interrupt service routine, the push-down stack is neither popped nor pushed and the vectored address is provided to the next address register as the address of the next micro-instruction to be executed. In the preferred embodiment, the push-down stack is implemented using shift registers.
In accordance with the present invention, there is pro-vided in a data processor controlled by a microprogrammed control store, wherein said control store executes different sequences of microinstructions held in addressable locations of a storage unit thereof, and wherein said processor is provided with a pushdown stack for holding a plurality of addresses of said storage unit;
apparatus for controlling said data processor to enable intermix-ed subroutine branching and entry into interrupt service routines from said sequences of microinstructions, comprising: means con-trolled while executing a first microinstruction which denotes a transfe:r to a specified subroutine from the routine/subroutine in execution for incrementing the address of said first microinstruc-tion and pushing such incremented address onto the top of said stack, means controlled while executing a second microinstruction during which an interrupt occurs for pushing onto the top of said stack the next address being developed during execution of said second microinstruction and for transferring operation to a micro-instruction service routine whose first address is determined by the nature of said interrupt, and means controlled by the last microinstruction in each subroutine and said service routine to pop up said stack, and use the address received from the top of said stack as a return address to re-enter the routine/subroutine from which said subroutine or service routine was entered.
In accordance with the present invention, there is fur-ther provided a method of effecting transfers to and from sub-routines and interrupt service routines comprising the steps of:

3.2(js~6~
A. generating a first microinstruction of a routine from a memory which identifies a branch to subroutine; B. executing a branch to a subroutine; said branch executing step including: a. inhibiting the occurrence of inhibitable interrupts, b. transferring a cur-rent address of said first microinstruction in a current address register to an incrementer, c. incrementing said current address to produce an incremented address, d. storing said incremented address, which is a return address, in a first register of a push-down stack, e. transferring previous return addresses into adja-cent registers one level down in said push-down stack simultaneous with the storing of said incremented address, f. transferring a next address in said Eirst microinstruction into a next address register if no interrupt is pending or if all pending interrupts are inhibited, g. transferring said next address in said next ad-dress register into said current address xegister, and h. generat-ing a second microinstruction, which is a first microinstruction of a subroutine, from said memory using said next address from said next address register, C. generating an interrupt to an in-terrupt service routine, said interrupt generating step including:
a. generating a ~ectored interrupt address of a highest priority non-inhibited pending interrupt if a pending non-inhibited inter-rupt exists, b. transferring said vectored interrupt address into said next address register if interrupts are not inhihited, c.
storing a next address from a current microinstruction, which is said return address, into said first register of said push-down stack if interrupts are not inhibited, d. transferring previous return addresses into adjacent registers one level down in said push-down stack simultaneous with the storing of said return ad-dress, e. transferring said vectored interrupt address in said next address register into said current address register, and f. generating a third microinstruction, which is a first micro-instruction of a first interrupt service routine, from said memory - 11a -~ ~:~556~

using said vectored interrupt address from said next address reg-ister, D. generating a microinstruction from said memory which identifies a return from said subroutines or said interrupts; and E. executing a return from said subroutines or interrupts, said return executing step including: a. transferring said return ad-dress from said first register in said push-down stack to said next address register if no interrupts are pending or if all pend-ing interrupts are inhibited, b. transferring previous return ad-dresses into said ad~acent registers one level up in said push-down stack simultaneous with said transferring said return address to said next address register, c. generating said vectored inter-rupt address of said highest priority non-inhibited pending inter-rupt if a pending non-inhibited interrupt exists, d. transEerring said vectored interrupt address into said next address register if interrupts are not inhibited, and e. generating a fourth micro-instruction, which is a subsequent microinstruction to the micro-instruction which branches to a subroutine, if no non-inhibited interrupts are pending, or a first microinstruction of a subse-quent interrupt service routine if said pending non-inhibited interrupt exists, from said memory using an address from said next address register.
In accordance with the present invention, there is fur-ther provided a data processing system for executing a routine which accesses a plurality of subroutines and for executing a plurality of interrupt service routines in response to a plurality of interrupts, said system comprising: A. means for providing a sequence of microinstructions, each microinstruction containing address fields to define an address of a microinstruction of said providing means and command fields to define transfer paths, one type of said microinstruction specifying a branch to said sub-routines and a second type of said microinstructions specifying a return from said subroutines or interrupt service routines;

- 11b -~, ~.Zf`556~

B. means for altering said sequence o-f microinstructions provided by said providing means in response to an uninhibited interrupt occurring, said means for altering providing a vectored interrupt address to said providing means which is used as a starting ad-dress of an interrupt service routine; C. storing means including:
a. a plurality of registers serially intercoupled, one of said plurality of registers being a top end, another of said plurality of registers being a bottom end, the remaining of said plurality of registers being intermediate said top and said bottom end, each of said plurality of registers being adapted to hold one return address, b. first means coupled to said top end and said remaining registers and responsive to said providing means for serially propagating the return addresses to said bottom end of said plurality of registers and, c. bottom means coupled to said bottom end and said remaining registers and responsive to said providing means for serially propagating the return addresses to said top end of said plurality of registers, wherein said storing means is responsive to said one type of microinstruction and to the occurrence of non-inhibited interrupts for sequentially stor-ing return addresses of prevlous routines and subroutines in said top end register; and means responsive to a series of said second type microinstruction for sequentially transferring to said pro-viding means from said top end register of said storing means in a reverse order said return addresses.
In accordance with the present invention, there is fur-ther provided a data processing system for sequentially accessing routines and subroutines and for accessing interrupt service routines; said system comprising: A. means for providing a se-quence of microinstructions, each microinstruction address being addressed by an address within said providing means, each micro-instruction containing address fields to define a next address of a microinstruction of said providing means and command fields to - 1 1 c ~ 2~55~i4 de-Eine transfer paths, a first address field of said address fields having a first value which specifies a branch to said sub-routines and a second value which specifies a return from said subroutines or interrupt service routines, a first command field of said command fields having a first value specifying a transfer of return addresses and a second command field of said command fields having a first value specifying an inhibiting of interrupts and a second value specifying an enabling of interrupts; B. means . for receiving an address from said provi,ding means, said address from said receiving means being a next address; C. storing means including: a. a plurality of registers serially intercoupled, one of said plurality of registers being a top end register, an-other of said plurality of registers being a bottom end register, the remaining oE said plurality of registers being intermediate said top and said bottom end registers, each of said plurality of registers being adapted to hold one return address; b. first means coupled to said top end and said remaining registers and respons-ive to said first command field having a first value for serially propagating said return addresses to said bottom end of said plur-ality of registers; c. second means coupled to said bottom end and said remaining registers and responsive to said first address field having said second value for serially propagating said re-turn addresses to said top end of said plurality of registers;
d. said top end register receiving said return address in response to said first address field having said first value and to said first command field having said first value; and D. means for transferring responsive to said first address field having said second value for transferring said return address from said top end register to said receiving means, said return address becoming said next address.

- 11d --12- 12~15564 BRIEF DESCRIPTION OF Ti~E DRAWINGS

The manner in which the method of the present invention is performed and the manner in which the apparatus of the present invention is constructed and its mode of operation can best be understood in light of the following deta1led description together with the accompanyin~ drawings in which like reference numbers identify like elements in the several figures and in which FIG. 1 is a general block diagram of a data processing system utilizing the present invention;

FIC. 2 is a block diagram of a portion of` the control area of the microprocessor of FIG. 1 which carries out, the principles of the present invention;

FIG. 3 illustrates the firmware microinstruction word fields of the microprocessor of FIG. 1;

FIG. 4 illustrates a flow diagram of the execution of microinstructions of a microprogram beginning in a main . routin~ and continuing through two subroutines and two hardware interrupt service routines in accordance with the present invention; and, ~I Z~569~

FIG. 5 is a logic block diagram of circuitry utilized in the control area of FIG. 2 in accordance with the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT

Although the above discussion of the invention background has been primarily in terms of software and the "esting of software routines and interrupts, the principles are equally applicable to firmware routines and interrupts. The following discussion of the invention will be in terms of 'che preferred embodiment in which the invention is embodied within a microprocessor for use in nesting firmware subroutines and interrupts.

Prior to describing the structure and operation of the invention in conjunction with the drawings, it is to be noted that for conven~ence of explanation, the embodiment depicted in the drawing is shown to be capable of nesting four subroutine or interrupt levels. ~lowever, it is of course realized that in actual practice the number of subroutine or interrupt levels may be much more than four with an appropriate incrcase in the hardware which is employed. Alternatively, rather than effecting an enlargement of the hardware, an overflow procedure may be employed. In the latter situation, in the event that it were desired to nest subroutine or interrupt levels in excess of four, the microprocessor could revert to other implemented mechanisms for handling subroutines or interrupts in excess of four.

15- ~.ZV5564 The implementation of the embodiment described in the drawings is effected with a given arrangernent of circuitry. However, it is understood that other logic arrangements may be employed in carrying out the invention to adapt the invention to various types of data processors. Accordingly, it is not intended to be limited to the specific schemes shown in the drawing.

Referring now to the drawings, FIG. 1 illustrates the overall system in which the nested subroutine and interrupt implementation of the present invention rnay be used. More particularly, FIG. 1 shows a main memory subsystem 10, a central processing unit (CPU) ~0 and an input/output (I/0) unit 40. The main memory subsystem 10 consists of three metal oxide semiconductor modules 12, 14 lS and 16. The three modules are inter~aced f o the central processor bus 20 and the input/output bus 40 via main bus 26. The main bus 26 gives the capability of providing access to and control of all memory modules and input/output units.

The central prvcessing unit 20 executes word oriented instructions that operate on fixed and variable length fields. The basic unit of information in the central processor is a 16-bil word consisting of two ~-blt bytes.
These words of information are used in groups of one, two or four for instructions or fixed or floating point 1 6- ~.2~35564 operands. Bytes are also used in variable length fields as decimal or alphanumeric data.

CPU 20 is comprised of microprocessor 30, monitor logic 22, and Read Only Storage (ROS) 24. Microprocessor 30 is an NMOS, 16-bit chip capable of arithmetic, logic~
and control operations, driven by a a 48-bit external firmware microinstruction words which in the preferred embodiment are contained in ROS 24. The rnicroprocessor 30 design permits the execution of the CPU 20 16-bit software instruction repertoire.

Microprocessor 30 is designed to directly control input/output (I/O) and memoryu operation for ease in inteBrated system designs. The microprocessor 30 design permits greater control and integrat,ion by use of a 48-bit external firmware microinstruction word that provides true horizontal microprogramming allowing up to 12 sirnultaneous micro-operations per 48-bit microinstruction word. The microprocessor 30 design also permits 8 external hardware interrupts which generate vectors to firmware microprogram routines as well as allowing 5 external software interrupts that are handled under firmware control. In addition, microprocessor 30 provides for 10 external monitor bits originated in monitor logic 22 that are sensed and controlled by sophisticated test branch and major branch operations by logic within microprocessor -17- ~ 2(jSS 6 4 control area 36 which allows for sophisticated branching operations to be performed within the firmware.

Microprocessor 30 is comprised of 5 major internal hardware logic area as shown in Figure 1. The five major logic areas are the data manipulation area 32 which includes the arithmetic logic unit (ALU), the memory management unit (MMU 34), the control area 36, the processor bus 37, and internal bus 38.

The processor bus 37 consists of 20 address/data lines, one memory address violation line and three general purpose control lines. Processor bus 37 is connected to main bus 26 and is used to provide addresses to the main memory 10 and input/output unit 40 and to receive and send data to main memory 10 and input/output unit 40.

internal bus 38 is t'ne major path for communications of information between the other four areas of the microprocessor chip. Internal bus 38 is 20-bit wide.
There are 12 sources Or information to internal bus 38 under control of the 11 micro-ops within the 48-bit microinstruction word. The ALU is the default source to internal bus 38 if none of the eleven defined micro-ops are used.

The data manipulation area 32 performs arithmetic and logic operations on data and does memory address 1 8- ~.2~3556~

generation. Data manipulation area 32 is comprised of an indicator register, various discreet registers, a register file, and arith~metic logic unit (AL~), and a shifting mechanism. One of these discreet registers is used as a 20-bit memory address register for the CPU. This program counter contains the 20-bit memory address of the software instruction that is being executed by the central processing unit 20. The register files contains seven 16-bit software addressab e data address registers, 7 software addressable base registers, and a variety of other registers all of which are associated with the software program being executed by the CPU 20. The register file also contains a variety of work registers which are used by the firmware prograrn from ~OS 24 for temporary storage of information during firmware operations. The shifting mechanism is used to ability to perform various shift operations ~i.e., open/close, arithmetic/logical, left/right) on either 16-bit or 32-bit operands.

The control area 36 of microprocessor 30 is logically divided into 3 areas: input latches for control, testable registers, and the next address generation. Control area 36 is described in greater detail in reference to Figure 2 below.

19 - J Z~ 5564 The MMU 34 section of microprocessor 30 is comprised primarily of: a register file a 12-bit address for base relocation, a 9-bit comparator for checking the size of a memory segment several 2-bit ring comparators for evaluating access rights to a given segment, and storage flip-flops for indicating potential memory violations.
During any CPU generated memory address cycle, the MMU 34 translates the software logical address containing a segment number, a block number and an offset value presented by internal bus 38 into a physical address which is placed on processor bus 37 which in turn is transmitted to main memory 10 via main bus 26.

,, As can be appreciated as the description so ~ar, CPU
20 executes software programs, the instructions of which are fetched form main memory 10, and performs arithmetic and logical operations on data also contained in main memory 10. The software program executed by CPU 20 has the ability to manipulate general and base address registers that are software visible and the current ~0 software instruction is pointed to by a program counter.
These general registers, base address registers and program counter, which are visible to the software beinB
executed by CPU 20, are physically contained within the data manipulation area 32 of microprocessor 30.

~.2~556~
Detailed operation of CPU 20 of Figure 1 is controlled by microprocessor 30 under the control of firmware microinstructions stored in ROS 24. Each location in ROS 24 can be interpreted as controlling one S microprocessor machine cycle. ~s each location of ROS 24 is read, the contents are decoded by control area 36 resulting in a specific operation within microprocessor 30. By grouping ROS locations, firmware microinstruction sequences are obtained that can perform a specific operation or software instruction associated with CPU 20.
As each software instruction is initiated, certain bits within the operation code field of the software instruction are used to determi,ne the starting address of the firmware microinstruction routine contained within ROS
24. The testing of certain flip-flops which are set or rest by software instruction decoding done by microprocessor 30 allow the microprocessor to branch to a more specific firmware microinstruction sequence within ROS 24 when necessary.

Connected to main bus 26 is a input/output unit 40.
The input/output controller 42 is that portion of the input/output unit 40 which completes a data path from a peripheral device 44 to main memory 10 via main bus 260 I/O controller 42 provides a path through which the ~z~S564 peripheral commands are initiated, in addition to controlling resulting data transfers.

Referring now to Figure 2 which illustrates the control area 36 of Figure 1 in greater detail. Control area 36 contains additional logic and circuitry, but for the purposes of the invention, the logic has been limited to that shown in Figure 2. Figure 2 also illustrates internal bus 38, monitor logic 22 and read only storage (ROS) 24.

In Figure 2, the number next to the upper right hand corner of the blocks represents the number of bits of information contained in the register represented by the block.

ROS 24 may be a read only memory (R^~) or a random access memory (RAM) or any other form of memory device capable of holding firmware microinstructions. The ROS 24 contains the firmware microinstructions (or control words) which are used by microprocessor 30 to control the operation of' central processing unit and more particularly to execute the software instructions of CPU 20. For each microprocessor machine cycle, a control word is fetched out of ROS 24.

ROS 24 is coupled to ROS data register 65 which receives the microinstruction word fetched from read only -22- ~ 2f35S6~

storage 24. Each microinstruction contains an address portion and a command portion. The address portion in the microinstruction word identifies the address of the next location to be read from read only storage 24 which will be the next microinstruction to be executed by microprocessor 30. The command portion of the microinstruction identifies the operations to be performed by the microprocessor during the execution of the current microinstruction The address portion of the microinstruction word may be contained in a predetermined number of bits, for example, in the preferred embodiment it is contained in bits 0 through 12 of the microinstruction word (see Figure 3). The command portion of the microinstruction may also be contained in a predetermined number of bits, for example, in the preferred embodiment it is contained in bits 13 through 47 (see Figure 3). The command portion may be further broken down into a number of fields which comprise subcommands of the microinstruction.

~efore describing the microinstruction word in greater detail with respect to Figure 3, the other elements of Figure 2 will be described. Monitor logic 22 provides status information with respect to CPU 20 and is loaded into test flip-flops 50 such that the status may be tested by the firmware. In addition to holding ten bits -23- ~.2(~5S6~

of dynamic status information from monitor logic 22, test flip-flop 50 hold five bits which sample the status of various CP~ options. The CPU option bits should be thought of as static in nature and indicate whether or not S a specific hardware option is present or not within the data processing system. In addition, test flip-flop 50 contains four control flip-flops which are available to be set or reset or to have a bit transferred under control of the firmware. These four control flip-flops are testable by the firmware. There are also ten temporary flip-flops in flip-flops 50 which are loaded during each firmware cycle with dynamic information such as whether there has been a carry or overflow fro~'bit 16 of the A~U or a carry or overflow from bit 20 of the ~LU or whether certain bits on the internal bus 38 are equal to 0, etc. These ten temporary flip-flops are also testable by firrnware.

The F-register 51 is a 16-bit instruction register that is loaded form internal bus 38. All bits of the F-register are testable by firmware. The low-order four bits of F-register 51 also constitute the low-order four bits of the five-bit counter F-counter 52. F-counter 52 is a five-bit counter that can be loaded form internal bus 38. F-counter 52 can be incremented or decremented. The four low-order bits of F-counter 52 are also decoded such ~2~5S64 that a 16-bit mask can be placed on internal bu~-38 under firmware control.

There are five possible conditions that can cause a software interrupt. These conditions are latched in - software interrupt register 53. Software interrupt prinet 54 prioritizes these conditions and generates a vectored address for input into majcr branch logic 57.

The next address generation section 55 of control area 36 contains the logic necessary for sequencing the read only storage (ROS) 24. Test branch logic 56 is used to test 64 test conditions which can result in a 2-way branch address for ROS address register 63. These 64 test conditions are testable under firmware control and with the output of the test branch logic 56 being one bit of information into address multiplexer 1 60. Inputs to test branch logic 56 are provided by test flip-flops 50, F-register 51 and F-counter 52.

~ajor branch logic 57 provides 15 rna~jor test branch matrixes. The majority of the inputs to these matrixes are from F-register 51 tin various combinations). Other inputs are from the monitor and option bits of test flip-flops 50. The output of major branch lo~ic 57 is four bits of address information which is provided to address multiplexer 1 60.

-25- ~05~64 Register 58 provides the bits of information that correspond to the ten possible conditions that can cause a hardware interrupt. Hardware interrupt prinet 59 prioritizes these ten possible conditions and produces a four-bit output that is used by address multiplexer 2 62 to produce the 12-bit vectored hardware interrupt address when one of these ten possible conditions occur.

The output of address multiplexer 1 60 provides the 12-bit nominal next address which will be loaded into ROS
address register 63 and used to fetch the next microinstruction from ROS 24. This 12-bit address is nominal in the sense that this nominal next address will be used as the next address o~nly i~ a hardware interrupt does not occur. A hardware interrupt will not occur if no hardware interrupts are pending or if pending hardware inte~rupts are inhibited by the setting of the interrupt inhibit bit within the microinstruction word (see bit 34 in Figure 3).

Address multiplexer 2 62 is used to select between the 12-bit nominal next address generated by multiplexer l 60 and the vectored hardware interrupt address that is produced by combining the 4-bits from hardware interrupt prinet 59 with ~ leading O bits. The output of address multiplexer 2 62 is the 12-bit next address which is loaded into ROS address register (RAR) 63. The output of _26- ~z~ss64 RAR 63 is used to provide the address of the next microinstruction to be fetched from ROS 24. The output of RAR 63 is also input to ROS address history register 66.

ROS address history register 66 is provided so that early in the execution of the current microinstruction contained in ROS data register 65, while the next microinstruction address is being developed and transferred to ROS address register 63, ROS address history register holds the address of the current microinstruction. This current microinstruction address i5 used in developing the next microinstruction address if the current microinstruction calls for its use. The current address from ROS address history register 66 is also used after being increlnented by incrementer 64 as the return address from microsubroutines and hardware interrupt service routines.

Incrementer 64 increments by a predetermined number (e.g., by 1 in the preferred embodiment) the address contained in RAR address history register h6. Incrementer 64 is a 12-bit incrementer which will be used to source the return address stack 70 via return multiplexer 61 during a PUSH microcommand. The output o~ incrementer h4 is also used to provide the next ROS address value to RAR
63 for INC and INCK microcommands via address multiplexer 1 60 and address multiplexer 2 62. The INC microcommand -27- ~ ~ S~

specifies that the next ROS address is to be the current ROS address incremented by one and the INCK microcommand specifies that the next ROS address value is to be the current address value plus 1 and in addition a constant, as specified in other unused addres~s field bits within the microinstruction, is to be placed on internal bus 38.

Return address stack 70 is a 4 by 12-bit last in first out (LIFO) array used for storing the return addresses of subroutines and hardware interrupts. Return address stack 70 is initialized to hexadecimal value of 001 during clear time and its bottom location is set to 001 (hexadecimal) during each POP (return) microcommand.
A PUSH microcommand causes thp top of return address stack 70 to be sourced by the out~ut of incrementer 64. A
hardware interrupt causes the top of stack 70 to be sourced by the output o~ address multiplex~r 1 60, which is the nominal next address. Incrementer 64 transfers to return address stack 70 the incrernented address history from ROS address history re~ister 66 when one subfie1d of the next command portion of the ROS data re~ister 65 specifies a PUSl~ microcommand. This PUSII microcommand enables the storing of the return address of the microprogram microinstruction that is being executed while branching to a microprogram subroutine.

-28- 31 2~35S64 In response to the PUSH microcommand, incrementer 64 provides that the incremented current ROS address from ROS
address history register 66 to return address stack 70, which comprises a plurality of registers 71 through 74.
Functionally, return address stack 70 is a push down storage device which comprises a plurality of work registers arrayed in a column. The only output from the stack is from top register 71 which is connected to address multiplexer 1 60. The only inputs return address stack 70 are from the top and bottom. When an address is pushed onto stack 70, it goes into register 71 after the other addresses already in the stack are pushed down the column one register. As an address is removed from the column (popped up), it is provided by top register 71 to address multiplex,er 1 60 and each address stored in return address stack 70 moves up one hardware register in the column. During this pop operation, the bottom register 74, which is vacated, is loaded with the address 001 (hexadecimal). The stack can be visualized as a deck of cards, wherein access to the cards of the deck is only possible by adding or removing cards one at a time to or from the top of the deck and wherein a predetermined card (hexadecimal value 001) is added to the bottom of the deck as each card is removed from the top of the deck.

~.2~564 Return address stack 70 thus stores the incremented current address as is pro~Jided from ROS address history register 66 when the executlng microprogram branches to a subroutine. In addition, return address stac~ 70 stores the nominal next address output by address multiplexer 1 60 whenever a hardware interrupt occurs which vectors the execution of the firmware to a predetermined location within ROS 24 as determined by the particular har~ware interrupt that has occurred. These addresses stored in return address stack 70 point to the next step of the micropro~ram which would have been executed except for the occurrence of a branch to a microprogram subroutine or a branch to a microprogram 'interrupt handling routine.
Since these addresses will be stored when a branch to a microprogram subroutine occurs, or when a hardware interrup~ occurs, the addresses in return address stack 7O
will, upon the execution of the last microinstruction in a subroutine or hardware interrupt handling routine return the microprogram to the proper sequence. This can be better illustrated by reference to Figure Ll as described below.

Figure 3 illustrates the firmware microinstruction word fields of microprocessor 30 of the preferred embodiment. This microinstruction word is comprised of 4~
bits (bits O-47). Bits O through 12 are used as the ROS

_30- ~ s~64 address field, bits 13 through 17 are used to select registers in the register file, bits 18 through 22 are used to control the arithmetic and logic functions of the ALU and the inputs to its ports, bits 23 through 25 are used as bus control, bits 26 through 30 are used as a register modification field, bits 31 through 33 are used as memory management unit control, bit 34 is used to inhibit the occurrence of a hardware interrupt and bits 35 through 47 are used as a special control field.

The special control field (RDDT bits 35 through 47) is used to modify as well as supplement certain of the other fields in the microinstruction firmware .word. The special control field provides up to three simultaneous microcommands during a given microcycle. The special control field is divided into L~ subfields (A through D) as illustrated in Figure 3. With the interpretation of some of the subfields dependent upon the contents of other subfields.

The 48 bits of the microinstructions are loaded into the ROS data register 65 at the beginning of the execution of the microinstruction. These 48 bits are referred to as signals RDDT00 through RDDT47.

The ROS address field contains 13 bits (RDDT00 through RDDT12) and is used to generate the address of the next firmware step in a given microprogram sequence. The method for generating this next address is defined by the first five bits of the ROS address field as shown below in Table 1.

Table _ RDDT Bits 0 1 2 3 4 Operation 1 X X X X Jump 0 1 X X X Test Branch O 0 1 X X Major ~ranch O O 0 1 X Increment With Constant O O O 0 1 Incrernent ~ithout Constant O O O O O Return (POP microcomrnand) A PUSH microcommand can be used in conjunction with any of the first five operations listed in Ta~le 1. The PUSH microcommand, when used in combination with a jump or branch microcommand, allows the microprogrammer to store away into return address stack 70 a return address to which the microprogrammer will wish to return upon completion of the subroutine which was branched to. To facilitate the storing aw~y of this return address by the person writing a microprogram, the PUSH microcommand pushes the contents of the ROS history address register 66 --32- ~ 205564 incremented by 1 by incrementer 64 onto the top of return address stack 70. The return (POP) microcommand is then used by the microprogrammer as the last firmware step of the called subroutine to return to the first location after the microinstruction which called the microprogram subroutine.

One exception to the next address eeneration being defined by the six operations described in Table 1 is that of a hardware interrupt. When a hardware interrupt is initiated, the next ~OS address will be provided as a hardware vector and the ROS address generated by the ROS
address field of the present firmware word will:be placed on the top of the return address stack 70 by the output of address multiplexer 1 60 being selected as the output of return multiplexer 61 and pushed onto return address stack 70. If a PUSH microcommand (as specified by special control field C in bits RDDT42 through RDDT44 in conjunction with a special coding of subfields A and B) is used in conjunction with one of the first five operations shown in Tab~e 1, then the microprogrammer must also inhibit hardware interrupts by specifying that RDDT bit 34 is a binary ONE in order to prevent a conflicting push operation being performed as the result of the occurrence of a hardware interrupt. Since a hardware interrupt can occur (normally by the occurrence of an external ~33- 1 2Cl5s 6 4 asynchronous event) at any time prior to the completion of a given firmware microprogram sequence, special consideration must be given to allow for the occurrence of a hardware interrupt.

The branching capabilities of the six operations defined in Table l are referred to as page branching and bank branching. A page is defined as 64 consecutive memory locations within ROS 24 and a bank is defined as 1024 memory locations within ROS 24 (16 Pages). The branch boundaries for the test branch operation is restricted to any location within a page. The branch boundaries for the major branch are restricted to any location within a bank. The'remaining four operations of Table 1 are capable of branching or incrementing from one bank to another.

The jump operation is the only next address generation method of Table l that allows a branch to any of the possible 4096 locations of ROS 24. This is accomplished by providing, within the ROS address field, a 12-bit direct address of the next firmware microinstruction to be executed.

When RDDT bit 0 equals a binary ONE, RDDT bits 1 through 12 of the present ROS data word (firmware microinstruction) as contained in ROS data register 65 are I.Z~95564 delivered directly to ROS address register 63 via address multiplexer 1 60 and address multiplexer 2 62 as the next address in the firmware microprogram, assuming of course, no intervening hardware interrupt occurs. Should a hardware interrupt occur, this nominal next address would be pushed onto the top of return address stack 70 and the generated hardware interrupt vector address, as generated by concatenating eight high order binary ZERO bits with the four bit output of 'nardware interrupt prinet 59, as output by address multiplexer 2 62 will be loaded into ROS
address register 63 as the next ROS address.

A PUSH rnicrocommand (as defined by special control field C) can be used along` with the jump operation.
Hardware interrupt inhibit hit RDDT34 must be set to a binary ONE to inhibit hardware interrupts when the PUSH
microcommand is used in conjunction with a jump operation.
During a PUSH microcommand, the current ROS address held in ROS address history register 66 is incremented by 1 and pushed onto the top of return address stack 70 by return multiplexer 61 before the ncxt address as specified in RDDT bits 1 through 12 is loaded into ROS address register 63.

The test branch operation of Table 1 is a two-way branch using the result of one of 64 test conditions specified as part of the ROS address field in bits 3 ~ 2~
through 8. All test branches are restricted to branching within the current page, that is, the next ROS address generated as a result of the test will always be one of two locations (depending upon the results of the test:
i.e., true or false) eight locations apart but within (64 locations) currently bein~ address by ROS address register 63. That is, depending upon the results of the test branch, the next microinstruction will be fetched from the location determined by taking the six hi~h-order bits from ~0 the current ROS address (from ROS address history register 66) concatenated witll the six low-order bits which come from bits 2, 9, 10, 11 and 12 of the ROS address field which are used for bits posi.tions 7, 8, 10, 11 and 12 respectively within ~he nominal next ROS address and with the result of the t2st ~1 or 0 corresponding to true or false respectively) being used as bit position 9 within the nominal next ROS address.

This nominal next ROS address composed of the bits as described above, generated as the ~esult of the test ~0 branch as specified in bits 0 throu~h 13 in the current firmware microinstruction word, is the next ROS address assuming no intervening hardware interrupt occurs. Should a hardware interrupt occur, this address is placed on the top of return address stack 70 and the generated hardware -36- ~ Zci556 4 interrupt vector address replaces it as the contents of the next ROS address in ROS address register 63.

The PUSH nicrocommand can also be used along with test branch operations. As indicated above, hardware interrupts must be inhibited (by setting RDDT bit 34 equal to a binary ONE) if the P~SH microcommand is used. If the PUSH microcommand is used in conjunction with a test branch operation, the current ROS address, which is the address of the test branch microinstruction (from ROS
address history register 66) incremented by 1, will be placed on the top of return address stack 70 and the microprogram will branch to the nominal next;address as determined by the output of test branch lo~ic 56.

The major branch operation is a 16-way branch using the results of 15 test groups specified as part of the ROS
address field in bits 5 through 8. All major branches are restricted to branching within the current bank (1024 locations). That is, the nominal next ROS address generated as a result of the major branch test will always be in one of 16 locations (depending on the output of the major branch matrix) 16 locations apart but within the bank (1024 1ocations) currently being addressed hy RO.S
address history register 66. The nominal next ROS address is generated by taking bit O and 1 frorn the current ~OS
address and using them as bit O and 1 in the nominal next ~.ZCl~5~4 ROS address and taking bits 3, 4, 9, 10, 11 and 1~ from the ROS address field and using them as bits 2, 3, ~, 9, 10 and 11 in the nominal next ROS address respectively.
In addition, bits 4 through 7 in the nominal next ROS
address are determined by the four-bit output by ma~jor branch logic 57.

The nominal next ROS address as described above is Benerated as the result of the major branch operation specified in bit O through 12 of the current firmware microinstruction word contained in ROS data re~,ister 65 is the next ROS address assuming that no intervening hardware interrupt occurs. Should a hardware interrupt occur, this newly generated nominal next ROS address will be placed on top of the return address stack 70 and the generated hardware interrupt vector address replaces it as the next ROS address in RAR 63.

As in the case of test branch operation, the PUSH
microcommand can be used along with major branch operations. Again, as indicated above, hardware interrupts must be inhibited by settin~ bit RDDT3~1 to a binary ONE. If a PUSH microcommand is used in conjunction with a major branch operation, the current ROS address which is the address of the major branch microinstruction itself (from ROS address history register 66) plus 1 will be placed on top of the return address stack 70 and the ... . ... _ _, . . .... . ... . .

-38- ~ ZC~5564 microprogram will branch to the nominal next address as determined by the output of major branch logic 57.

The incrementing with a constant operation (I~CK
microcommand) as specified in ROS address field (bit O
through 3 of the 13-bit field) of the current microinstruction causes the current value of the ROS
address history register 66 incremented by 1 to be placed in the ROS address register for the next microcycle. In addition to this next address generation1 the remaining 9 bits (RDDT bits 4 through 12) are used to generate an 8-bit constant plus a filler to the 20-bit wide internal bus 38 during the current microcycle.

The current ROS address contained in ROS address history register 66 is incremented by incrementer 64 and the result is returned to the ROS address register 63 via address multiplexer 1 60 and address multiplexer 2 62 when an increment with constant microcommand is specified in the ROS address field of a microinstruction. Should a hardware interrupt occur, this newly generated next address will be placed on the top of return address stack 70 via return multiplexer 61 and the hardware ~enerated interrupt veotor address will be placed in ROS address register 63 to be used as the next ROS address. The PUSH
subcommand can be used along with the increment operations. As with all PUSH subcommands, the hardware ~39~ 1 Z~ SS 6 4 interrupts must be inhibited by setting RDDT bit 34 to a binary ONE when using a P~SH subcommand in conjunction with an increment operation. If a PUSH microcommand is used in conjunction with an increment operation, the current ROS address incremented by one will be placed on the top of return address stack 70, in addition to becoming the next ROS address.

The increment operation (INC) subcommand as specified in the ROS address field of the microinstruction initiates the same operation as described above for the increment with constant (INCK microcommand) operation except that no constant is generated onto internal bus 38.

The return operation (POP microcommand) causes the contents of the top of return address stack 70 to be loaded into ROS address register 63 via address multiplexer 1 60 and address multiplexer 2 62 to be used as the ROS address for the next microcycle. In addition, a ROS address of 001 (!.exadecimal) is loaded into the bottom of the stack into register 74 each tirne return address stack 70 is popped one location. This loading of the bottom of return address stack 70 with the ROS address of l is used to detect the case of overpoppinR of the stack. The overpopping of the stack will result in the microprocessor being vectored to microprogram error sequence which begins at ROS location 1. ~ecause a return -40- lZ05564 operation (POP microcommand) is fully specified by bit 0 through 4 of the ROS address field, bits 5 through 12 of the ROS address field are unused as part of the return operation.

When a return operation is specified in bit O through
4 of the ROS address field, ROS address register 63 receives the contents of the top of return address stack assuming no intervening hardware interrupt occurs. Should a hardware interrupt occur, the return (or pop) operation will effectively be bypassed or cancelled. This cancelling of the pop stack operation when a hardware interrupt occurs during a return operation is .the logical equivalent of the popping the 'return address from the top of return address stack 70 and immediately, within the same microcycle, pushing it back onto the top of return address stack 70. It is this cancelling or bypassing of popping return address stack 70 when a hardware interrupt occurs during a return operation that allows the return address stack to be used to contain the return addresses for both microprogram subroutine calls and for hardware interrupts.

By having the push operation onto the stack associated with storing the return address for the hardware interrupt routine cancel the pop operation performed on the stack wh~n returning from a microprogram -41- i Z~5564 subroutine or upon completion of a hardware interrupt service routine, the return address stack 70 does not have to be able to simultaneously move in opposite directions or to first pop up and then push down during one microcycle. The method by which this simultaneous movement in opposite directions is prevented, (i.e., the method by which the push o~eration cancels out the pop operation) will be explained in greater detail with respect to Figure 5 below. As will be seen below in the discussion of Figure 4, this cancelling of the stack pop operation associated with a return operation by the occurrence of the push operation associated with the occurrence of a hardware intçrrupt does not adversely affect the flow of control within the microprograrn because the hardware interrupt routine will perform a return operation as the last step in its microprogrammed interrupt service routine.

The PUSH microcommand which is coded in the special control field (RDDT bits 35 through 47) must not be used in the same microinstruction with a return operation which i5 coded within the ROS address field (RDDT bit 0 through 12) because the results within microprocessor 3O in the preferred embodiment are unspecified.

As described above, a hardware interrupt forces a branch to a fixed ROS address. This ROS address is -42- ~ Z~S564 determined by a priority network (prinet 59) which has various error signals and interrupt requests as inputs from register 58. Hardware interrupts cause the next firmware generated ROS address to be pushed onto the top of return address stack 70. If the next ROS address was to have been generated from the return address stack via a return microcommand, popping of the return address stack is inhibited. Hardware interrupts must be inhibited whenever a PUSH micro-operation is performed in order to prevent the requirement to doubly push the stack, the first push being associated with the PUSH microcommand itself and the second push being associated with the saving of the return address fo,r the hardware interrupt.

When the hardware interrupt inhibit field (RDDT bit 34) is a binary ONE, hardware interrupts are inhibited, non-error condition hardware interrupts (such as those associated with memory refresh and data request) are inhibited (prevented from intervening between the execution of the current microinstruction and the execution of the next microinstruction). Hardware error condition inputs to prinet 59 (such as system clear, an attempt to access a nonexistent resource, an access violation, or a memory parity error) are not under the control of RDDT bit 34 and can intervene between any two given microcycles. The fact that hardware interrupts -43~ 556~

interrupts associated with these error conditions can not be inhibited and therefore could occur during a microinstruction which contains a PUSH microcommand does not cause a problem, because the hardware interrupt -~ service routines associated with these noninhibitable error conditions does not do a return operation at the end and therefore do not depend upon the contents of return address stack 70 to be valid. When RDDT bit 34 is a binary ZERQ, all hardware interrupts are allowed.

Figure 4 is a firmware microinstruction sequence which forms the main routine in a microprogram as indicated by 100. Main routine 100 may itselP ,be a main microprogram routine or a micro'subpro~ram routine and is any common sequence of microinstructions designed to perform a function. It is desired to be able to perform branches to any common sequence of microinstructions. For exemplory purposes, two microsubroutines indicated at 102 for a first level subroutine and 104 for a second level subroutine are shown. ~ranches to these subroutines may occur anywhere in the routine or subroutines. In addition, it is desired to be able to perform hardware interrupt service routines to process any hardware interrupts that occur during the execution of rnicroroutine 100 or any of its associated microsubroutines. For exemplory purposes, two hardware interrupt service _44_ ~ 2~5564 routines indicated at 106 for a first hardware interrupt service routine and 108 for a second hardware interrupt service routine are shown. In Figure 4, the rectangular boxes in the microprogram indicate microinstructions. The cor,tents of a microinstruction is indicated by the output of ROS 24 as contained in ROS data register 65.

In Figure 4, the microinstruction which determines the jump to the first level subroutine is found at microinstruction P. This microinstruction consists of a ROS address field having a conditional or unconditional branch to microinstruction Q and a special control field indicating a PUSH microcommand along with th;e hardware interrupt bit being set to inhibit hardware interrupts.
This firmware microinstruction which branches to microinstruction Q, pushes the return address, and inhibits hardware interrupts, is shown in rectangular box P. When this microinstruction is reached during the sequencing of the microprogram, the following operations occur. The ROS address field of the microinstruction indicates that a branch operation is to be performed. The special control field indicates that the current ROS
address in ROS address history register 66 is to be incremented by incrementer 64 and pushed onto the top of return address stack 70 via return multiplexer 61. This is accomplished by incrementer 64 taking the contents of -Ll5_ ~.2~556~

ROS address history register 66, which at this point in time contains the ROS address of instruction P, and incrementing it by 1 so that the output of incrementer 64 is the address associated wi-th instruction P + 1 and storing it via return multiplexer 61 into the top register of return address stack 70, which is register 71. Thus, at this point in time, register 71 will contain the address P + 1. This microinstruction, which resides at address P in ROS 24, also has the hardware interrupt bit set to inhibit the occurrence of a hardware interrupt between the execution of tne microinstruction at location P and the first instruction of the first level subroutine, which is the microinstruction at location Q.

Subsequent to the occurrence .~ the branch, as shown at Q, normal sequencing of the microsubroutine occurs. I~
the first level subroutine 102 requires another subroutine as shown at rectangular box R, then another branch to a mic osubroutine is executed. Thus, the same steps as occurred at instruction P will be applicable to instruction R when the first level subroutine 102 branches to the second level subroutine 104. ~hus, at instruction R, a conditional or unconditional branch is performed to the second level subroutine 10LI which begins at address S
in ROS 24. When instruction R is executed, the current ROS address in ROS address history register 66 is lZ~5S691 incremented by l by incrementer 64 and is transferred to return address register stack 70 and held in the top reeister 71 and the previous contents of register 71 are pushed down into register 72. Thus, at this point in the execution of the microprogram, register 71 contains the address R + 1 and the register 72 contains the address P +
1. Address R + 1 being the instruction within the first level subroutine to which the second level subroutine is to return upon its completion and address P + l being the àddress within the main routine to which the first level subroutine is to return upon its cornpletion. The ROS
address field of the microinstruction at location R has a value which will cause the ,microprogram to branch to rectangular box (microinstruction) S.

As shown in Figure 4, a first hardware interrupt becomes pending during the execution of the microinstruction associated with rectangular box R. This first interrupt is of the type that can be inhibited by setting the hardware interrupt inhibit bit (RDDT3ll) equal to a binary ONE and therefore the hardware interrupt is not allowed to divert the normal flow of the firmware following microinstruction R. Therefore, upon the completion of the execution of microinstruction R, the branch to location S will be cornpleted and the microinstruction associated with rectangular box S will be -47~ 12~5S6~
executed. If the first interrupt had been of the error interrupt type, the hardware interrupt would have occurred upon the completion of microinstruction R and the flow of the execution of th~ microprogram would have been vectored to the location associated with the hardware error interrupt.

During the execution of microinstruction S, the ROS
address on the next microinstruction to be fetched from ROS 24 is computed as can be seen from examination of Figure 4. Absence the occurrence of the hardware interrupt, which vectors the execution of the firmware to first service routine 106 beginning at location ~, the normal next address would be ~ 1. This address would be determined either by using the ROS address field of the S
microinstruction as is contained in ROS data register 65 which could indicate a jump or branch operation in which case bits within the ROS address field in ROS data register 65 would be multiplexed through address multiplexer 1 60 with or without the addition of bits from test branch logic 56 or major branch logic 57.
Alternatively, if an increment operation is indicated in ROS address field of th~ microinstruction S, the contents of ROS address history register 66 will be incremented by 1 by incrementer 64 and the 12 bit output will be multiplexed through multiplexer 1 60. In any case, the 48- ~ 2~5564 output of address multiplexer 1 60 will be the address S +
1.

Because the microinstruction S does not inhibit interrupts and the hardware interrupt is p~nding, the output of address multiplexer l 60 will be multiplexed through return multiplexer 61 and pushed onto the top of return address 70 into register 71 and address P + 1 will be pushed from register 72 into register 73 and address R
+ 1 will be pushed from register 71 into register 72. At ~ the same time, address multiplexer 2 62 will multiplex through the output of prinet 59 such that the address associated with the first hardware interrupt ~ill be input into ~GS address register `63 such that ROS address register 63 will contain the address associated with rectangular box V and that microinstruction will be fetched from ROS 24. Upon the completion of the execution of microinstruction S, microinstruction V will have been fetched from ROS 24 and be available for decoding and execution in ROS data register 65.

Before discussing the execution of the first hardware interrupt service routine 106 which contains microinstructions V throueh X, it should be noted that if microinstruction R did not contain the hardware interrupt inhibit microcommand, during the execution of microinstruction R, the situation would arise in which a 49- ~ 205564 double push of the return address stack 70 would be required in order to preserve the proper execution sequence of the microprogram. That is, both address R + 1 as output by incrementer 64 into return multiplexer 61 would have to be pushed onto return address stack 70 followed by address S as output by address multiplexer 1 60 via return multiplexer ~1. Because a double push operation is not possible during the execution of one mi~rocycle, the inhibiting of hardware interrupts is required.

If the first interrupt which becomes pending during the execution of microinstruction R was a hardware error interrupt which i.s not inhibitable by the setting of hard~,~are inhibit bit 34, after microinstruction R was executed, the microprocessor would branch to microinstructio.. V and the first hardware interrupt service routine would begin execution without the intervening execution of rnicroinstruction S. In this case, however, the first hardware service 106 would be different from that shown i.n Figure 4 in that service routines associated with hardware error interrupts do not terminate with a pop operation. Instead, they terminate by branching to a predefined point after doing some system reinitialization function. These hardware error interrupts do not do a pop operation because a pop .

~.Z~5564 indicates the intent to resume execution of the microprogram where it was interrupted. These hardware errors that are not inhibitable are not of the type from which a recovery can be done and therefore a return of control to the point of interruption is not done.

Now returning to the first hardware service routine 106 which comprises microinstructions V through X, it will be noted that instruction V and W and all instructions thereinbetween have the inhibit hardware interrupt microcode within them (i.e., bit 34 set to a binary ONE).
By inhibiting the occurrence of a hardware interrupt during all but the last (POP) microinstru~tion of a hardware interrupt service ro'utine, the microprogrammer insures that the occurrence of a second or subsequent hardware interrupt will not interrupt the processing of the first hardware interrupt. This insures that any time dependent sequences which are initiated in by one microinstruction can be completed by a subsequent microinstruction without any intervening hardware interrupt~ expanding the time between the initiating and the completing microinstructions. It also has the advantage that because in the preferred embodiment, the return address stack is only four deep, that three levels of the stack may be used for calling rnicroprogram subroutines and the fourth level can be reserved for
-5 1- ~2~.~'5564 hardware interrupts without the possibility that hardware interrupts will have to be nested more than one deep. It will be appreciated that the logic in Figure 2 would in fact permit the nesting of hardware interrupts and if the stack was of sufficient depth to permit all of the hardware interrupts to occur without exceeding the depth of the stack, plus the depth of the maximum nesting depth of microprogram subroutine calls which is permitted, that this inhibiting of interrupts during hardware interrupt service routines would not be required (based on the assumption that a given hardware interrupt may not interrupt itself).

During the execution of the first hardware interrupt service routine 106, microinstructions V through W are executed sequentially without interruption.
Microinstruction X follows the execution of microinstruction W without interruption because of the inhibit microcommand present in microinstruction W. It should be understood that microinstructions V through W
contain other microcommands in addition to the INH
(inhibit) microcommand which perform operations associated with servicing the particular hardware interrupt which has occurred. Likewise, microinstruction X can contain other microcommands besides the POP microcommand.

-52- ~ 5564 During the execution of microinstruction X, ROS data register 65 contains microinstruction X which has within it a return (pop) operation coded in the ~OS address field. This return operation causes the popping of return address stack 70 which as indicated above contains address S + 1 in address register 71, R + 1 in register 72, P + 1 in register 73, and the address 001 (hexadecimal) in register 74 prior to the POP microcommand being performed.
The POP microcommand in microinstruction X causes the return address stacks 70 to be popped one location. The POP microcommand of microinstruction X causes address S +
1 to be popped out of return address stack 70 from register 71 and for the conten,ts of 72 to be loaded into register 71 the contents of register 73 to be loaded into register 72 and the contents of register 74 to be loaded into register 73 and the value 001 (hexadecimal) to be loaded into register 74. Address S+1 is loaded via address multiplexer 1 60 and address multiplexer 2 62 into ROS address register 63 where it is used to fetch the S +
1 microinstruction from ROS ~4 which is then loaded into ROS data register 65. Thus, following the execution of microinstruction X, execution of the second level subroutine 104 resumes with the execution of microinstruction S + 1.

-53- ~ 2fjSS 6 4 The execution of second level subroutine 104 continues from microinstruction S + 1 on an instruction by instruction basis until microinstruction T is reached.
Aft~r the execution of microinstruction X and prior to the execution of microinstruction T, return address stack 70 contains the address R + 1 in register 71, the address P +
l in register 72, and the address 001 (hexadecimal) in registers 73 and 74.

Figure 4 illustrates that a second hardware interrupt becomes pending during the execution of microinstrùction T

which contains a POP subcommand which, absent the occurrence of the second interrupt, would return the execution of the microprogralh to microinstruction R+l by popping the address R+1 from the top of return address stack 70. ~owever, as indicated above, when a POP

microcommand occurs simultaneously with a hardware interrupt command, the popping of the return address stack is cancelled by the implicit pushing associated with responding to the hardware interrupt. There~ore, return address stack 70 is neither popped nor pushed during the execution of microinstruction T and the stack remains unchanged such that register 71 contains the address R +
1, register 72 contains the address P + 1 and re~isters '13 and 74 contain the addresses 001 (hexadecimal).

-54- ~.2~j55 6 4 During the execution Or microinstruction T, prinet 59 generates the vectored address to the second hardware interrupt service routine so that address Y is loaded into ROS address register 63 via address multiplexer 2 62. The execution of the microprogram continues with the execution of microinstruction Y which is the first instruction in the second hardware interrupt service routine 108 which is comprised of instruction Y and instruction Z. ~gain, as indicated above, each instruction within hardware interrupt service routine must inhibit hardware interrupts except for the last microinstruction. Also, as indicated above, instruction Y will contain other microcommands in addition to the inhibit microc,ommand and microinstruction Z can similarly contain other microcommands besides the POP microcommand.

During the execution of microinstruction Z, ROS data register 65 will contain the return ~peration in the ROS
address field. This return (POP) microcommand causes return address stack 70 to be popped one location thus caùsing the address R + 1 in register 71 to be loaded into ROS address register 61 via address multiplexer 1 ~0 and address multiplexer 2 62~ In addition, the contents of register 72 replace the contents of register 71, and the contents of register 73 replace the contents of register 72, and the contents of register 74 replace the contents -55- ~ 2f~5~64 of register 73, and the address 001 is loaded into register 74. Thus, at the completion of microinstruction Z, return address stack 70 will contain the address P + 1 in register 71, and the address 001 (hexadecimal) in registers 72, 73 and 74.

The popping of return address stack 70 by the POP
microcommand in microinstruction Z will cause the microprogram execution to continue with the execution of microinstruction R + 1 in the first level subroutine 102.
The first level subroutine 102 continues executing its microinstructions until it reaches microinstruction U
which contains a POP microcommand which returns the execution of the microprogra'm to the microinstruction after the microinstruction which branched to the first level subroutine. The POP microcommand of microinstruction U pops return address stack 70 one location and causes the address P + 1 to be loaded via address multiplexer l 60 and address multiplexer 2 62 into ROS address register 63. This will cause the microinstruction located at location P ~ 1 in ~OS 24 to be loaded into ROS data register 65 and executed. Thus, execution of the microprogram will continue with microinstruction P + 1 in the main routine 100, followed by the next microinstruction which is addressed by the ROS
address field of microinstruction P + 1.

-56- 1 Z~r~ss 6 4 As can be appreciated from the above discussion of the example illustrated in Figure 4, each explicitly microcoded PUSH microcommand associated with the branching to a subroutine causes the return address stack 70 to be pushed down one location as does each implicitly per~ormed push operation which is associated with responding to a hardware interrupt. From the above example, it can be appreciated that the return address stack was only pushed to a level of three deep, the first push occurring when instruction P branched to the first level subroutine, the second push occurring when instruction R branched to the second level subroutine, and the third push occurring during instruction S in prep,aration of vectoring to the first hardware interrupt service routine.

In the example in Figure 4, popping of the return address stack 70 occurs th~ee times, the first time during microinstruction X at the completion of the first hardware service routine, the second time occurring at the end of the second hardware interrupt service routine during the execution of microinstruction Z and the third time occurring during the execution of rnicroinstruction U when the first level subroutine returns to the main routine.
The pop operation which would normally have been performed at the end of the second level subroutine by microinstruction T was cancelled by the irnplicit push ~ 57 ~ ~2~15S~

operation associated with the vectoring to the second hardware interrupt service routine and beginning execution with microinstruction Y.
Referring now to the detailed circuitry shown in Figure 5, the same reference numerals used previously are shown in addition to the detailed circuitry required for the operation of the hardware mechanism. In Figure 5, the little circles at some of the inputs and outputs of the various elements are used to represent inverting inputs or outputs respectively.
In Figure 5, return address stack 70 is shown as being comprised of twelve 4-bit bi-directional universal shift registers of the type SN74LS194 manufactured by Texas Instruments Incorporated and described in their book, The TTL Data Book for Design Rngineers, Second Edition, copy-righted 1976. In Figure 5, only shift register 70A, which holds the most significant bits of the four 12-bit addresses in return address stack 70 and shift register 70K which holds the next to least significant bits of the four 12-bit addresses and shift register 70L which holds the least signifi-cant bits of the four 12-bit addresses stored in return address stack 70 are actually illustrated and registers 70B through 70J are not shown for simplicity. Registers 71 through 74 of return address . ;~

-58- ~ 2~35S~

shown in Figure 5 because one bit of each of registers 71 through 74 is stored in shift registers 70A through 70L
respectively. ~he method by which the twelve 4-bit shift registers are used as a push down stack will be described in greater detail below.

Figure 5 shows read only storage 24 which stores the microinstructions to be executed by the various units which comprise the microprocessor 30. During a cycle of operation, read only storage 24 is addressed by the contents of ROS address register 63. This causes the contents of the location specified by the address to be read into ROS data register 65.

In Figure 5, ROS data register 65 is illustrated as containing three separate microinstructions which illustrate the three different cases of interest to be described with respect to Figure 5. In actual operation, only one of these microinstructions would be present at any given instance in time within ROS data register 65.
The top microin~truction which performs a jump to microinstruction S and also contains a PUSH microcommand.
This microinstruction represents microinstruction R of Figure 4 which does the branch to the second level subroutine 104. The middle microinstruction is any microinstruction which does not have hardware interrupts inhibited by the setting of the hardware interrupt (HI) ~59~ ~ zsj~56~
bit within the microinstruction to a binary ONE. The bottom microinstruction is a ~nicroinstruction which contains a POP microcommand within the ROS address field and could be any one o~ the POP instructions of Figure 4 such as microinstruction U, T, X or Z. This POR
microinstruction is used to do a return from a subroutine or a hardware interrupt service routine.

Fields of the microinstruction word containing the next address to be accessed and the next commands to control the microprocessor 30 subsystem are transferred and decoded by the functional units illustrated in Figures 1 and 2. Each functional unit includes lo~ic cir,cuits for decoding the requisite subcommands specified by the rnicroinstruction word under the control of the system lS timing operations.

When first level subroutine 102 calls second level subroutine 104 by performing a branch to S
microinstruction with a PUSH and inhibit (INH) microcommands, the following sequence occurs. The branch microinstruction is read out from read only store 24 and loaded into ROS data register 65 and the branching takes place in the cycle following the read out and it is developed from the ROS address field having a binary ONE
in bit position ZERO. The branch microinstruction word also has a PUSH microcommand and an inhibit hardware q Zt3 ~
interrupt microcommand which stores the return address into return address stack 70 and inhibits hardware interrupts respectively.

More specifically, the JUMP microcommand is decoded by inverter 87 receiving the binary ONE from ROS address field bit position O and producing at its output a binary ZERO such that signal JUMP-, which is connected to the output enable (F) input of driver 60A, enables driver's 60A inputs onto its outputs thus making the output of address multiplexer 1 60 to be the bits 1 through 12 of the ROS address field which contain the address of the S
microinstructionO Driver 60A is a bus driver o~ the type that has 3-state outputs such'that only one of the bus drivers that comprise address multiplexer 1 60 will have its outputs enabled at any given time. It should be noted that address multiplexer 1 60 is comprised of more than driver 60A and 60B which are illustrated in Figure 5 and contains other inputs besides those illustrated in Figure 5 but only those of interest with respect to the present invention are illustrated in Figure 5.

The output of address multiplexer 1 60 which appears at the A input of address multiplexer 2 62 will be selected by the select input (SEL) being in the binary ONE
state such that the output of address multiplexer 2 62 will be the address of microinstruction S which appears in -61- ~2Q~

bits 1 through 12 of the ROS address field. This output of address multiplexer 2 62 will be loaded into ROS
address register 63 so that instruction S will be addressed in read only s~orage 24.

The select input signal LDRSAR+ which appears at the select (SEL) input of address multiplexer 2 62 and return multiplexer 61 is used to select between the A and B
inputs of multiplexers 62 and 61. Signal LDRSAR+ which appears at the output active (P) output of hardware interrupt prinet encoder 54 will be in the binary ZERO
state if one of the outputs Q1 through Q8 of encoder 54 is in the binary ZERO state. One of the outputs Q.1 through Q8 of encoder 54 will be in the`binary ZERO state i~ one of the inputs IO through I10 is in the binary ZERO state and input enable signal DISHIP+ which is attached to the enable input (EI) of encoder 54 is in the binary ZERO
state.

In the preferred embodiment, hardware interrupt prinet encoder 54 is comprised of two cascaded type SN74148 8-line to 3-line priority encoders manufactured by Texas Instruments and described in their publication entitled, The TTL Data Book for Design Engineers, Second Edition. the IO input of encoder 54 is connected to receive signal CLEARX- which is a signal which will be a binary ZERO during a hardware clear condition. The other ~ 2~5~ ~ ~
input signals, I1 through I10, are connected to the various signals which indicate a hardware interrupt request or a nardware error condition. Whenever one of these input signals, I0 through I10, is in the binary ZERO
condition, encoder 54 will produce on outputs Q1 through Q8, which are binary encoded, a signal corresponding to the highest priority hardware interrupt or hardware error requesting servicing.

Because the first microinstruction illustrated in ROS
data register 65 contains a binary ONE in the hardware interrupt inhibit field, signal RDDT34+ will be a binary ONE partially enabling AND gate 84. Signal CLE~RX- will also be a binary ONE because it ls not a clear condition.
The third input of AND gate 84, signal STOPIT+, will also be a binary ONE because if no hardware error condition is present, therefore the output of AND gate 84, signal DISHIP+, will be a binary ONE and disable the outputs of encoder 54 thereby making signal LDRSAR+ a binary ONE.

The PUSH microcommand of th~ first microinstruction is decoded by NOR gates 80, 81 and 82 along with NAND gate 83 and inverter 85. The PUS~I subcommand is specified in the special control field of the microinstruction word by having an A subfield of 000 binary, a B field of X0X0 binary (where X bits are can1t care conditions), and a C
subfield of 100 binary. The A subfield is decoded by -63- ~ Z~556~

inputting bits 35 through 37 into NOR gate 82, the output of which will be a binary ONE if a PUSH subcommand is specified. The B subfield is decoded by inputting bits 39 and 41 into NOR gate 81, the output of which ~ill be a binary ONE if a PUSH subcommand is specified. The C
subfield is decoded by inverter 85 inverting bit 42 and using its output along with bits 43 and 44 as inputs into NOR gate 80. The output of NOR gate 80 will be a binary ONE if a PUSH subcommand is specified. If a PUSH

subcommand is specified in the special control field, all three inputs to NAND gate 83 will be a binary ONE and cause the output thereof, signal PUSHOP- to be a binary ZERO.

With the PUSH signal, PUSHOP-, being a binary ZERO at one input to NAND gate 90, and the other input thereto, signal LDRSAR+, being a binary ONE indicating that no hardware interrupt is both pending and enabled, the output of NAND gate 90, signal PUSHNT+ will be a binary ONE
indicating that a push operation on return address stack 70 is to be conducted either because a PUSH microcommand i9 encoded within ROS data register 65 or a hardware interrupt is pending and hardware interrupts are enabled.
Signal PUSHNT+ is one input of NAND gate 91. The other input to NAND gate 91 is POPOP+ which is output by lZ~5564 inverter 88 which receives as input signal POPOP- which is the output of OR gate 86~

Bits O through 4 of the ROS address field are input into OR gate 86 which is used to decode POP microcornmands.
If bits 0 through 4 are binary ZEROs, the output of OR 8 will be a binary ZERO which indicates that a pop operation is to be performed. B~cause bit 0 of the JUMP S
microinstruction contains a binary ONE, the output of OR
gate 86 will be a binary ONE causing the output of inverter 88 to be a binary ZERO.

Signal P0P0P~ being a binary ZERO at one input of NAND gate 91 will cause the output thereof, signal PUSPOP-, to be a binary ONE indicating that both a push and pop operation are not being requested simultaneously.
With both inputs of AND gate 92 equal to a binary ONE, the output thereof, signal PUSNOT+, will be a binary ONE
indicating that a push operation is to be performed on return address stack 70. With signal PUSNOT+ being a binary ONE at one input of OR gate 94, the output thereof, signal PUSNEN+, will be a binary ONE indicating that a push operation is to be performed on return address stack 7o.

The pop operation signal, POPOP+, is also one input to AND gate 93. ~lith both inputs to AND gate 93 being a binary ZERO, the output thereof, signal POPNOT+, will be a binary ZERO indicating that a pop operation is not to be performed on return address stack 70. Because a clear operation is not being performed, the output of inverter &9, signal CLEARX+, will be a binary ZERO, and therefore both inputs to OR gate 95 will be binary ZEROs causing the output thereof, signal POPNEN~ to be a binary ZERO
indicating that a pop operation is not to be performed on return address stack 70.

Signal PUSNEN~ is connected to the SO shift mode input of each of the twelve 4-bit bi-directional shift registers 70A through 70L. Sirnilarly, signal ,POPNEN+ is connected to the Sl shift rnode`input of the twelve 4-bit bi-directional shift registers 70A through 70L. Shift mode inputs SO and Sl are binary encoded such that when SO
and Sl are equal to binary ZEROs, no shifting or parallel loading of the shift register occurs when the clocking signal at the clock (C) input of the shift register transitions from the binary ZERO to the binary ONE state.

When SO is a binary ZERO and Sl i~, a binary ONE, a left shift (pop) operation will be performed when the shift registers are clocked. When SO is a binary ONE and S1 is a binary ZERO, a right shift (push) operation will be performed when the shift registers are clocked. When both SO and S1 are binary ONEs, a parallel loading of all four ~.2~5564 bit positions within each shift register will be done when the clock transitions from the binary ZERO to the binary ONE state. The reset (R) input of each of the twelve 4-bit shift registers is set to a binary ONE because the registers are not reset (cleared) during operation of the system.

Late within the execution of the currer~t microinstruction in ROS data register 65, and after the address of the next microinstruction has been loaded into ROS address register 63, clocking signal PSTROB+, is used to clock return address stack 70 by clocking shift registers 70A through 70L is also used t~ clock (~oad) ROS
address history register 66. 'Therefore, simultaneously with the clocking of the return address into return address stack 70 by signal PSTROB+ transitioning from the binary ZERO to the binary ONE state, the address of the next location in read only storage 24 that is to be fetched using the next address found in ROS address register 63 will be loaded into ROS address history register 66 for use as the current address early in the execution of the next microinstru~tion.

Early in the execution of the current microinstruction, which is prior to clocking address S
from ROS address register 63 into ROS address history register 66, ROS address history register 66 contains the -67- ~ 2~ SS~ ~

address of the microinstruction in the ROS data register which specified the jump to location S (in Figure 4 this is microinstruction R). Thus, early in the execution of microinstruction R, ROS address history register 66 would contain the current address R and the output of incrementer 64 would be the address of R + 1 which appears at the A input of the return multiplexer 61. As seen above, the select signal LDRSAR~ during the JUMP S
microinstruction is a binary ONE causing the A output of return multiplexer 61 to be enabled onto the Q output thereof. Thus, signals STKIOO through STKI11 which appear at the shift right serial inputs (RI) of shift register 70A through 70L will correspond, to tl.e binary address R +

1. Thus, when clocking signal PSTRO~ occurs late during the execution of the JUMP S microin:truction, the address R ~ 1 will be pushed into return address ~tack 70 by shifting shift register 70A through 70L right one position.

Having described the functioning of the logic of Figure 5 with respect to the JUMP S microinstruction which also inhibits interrupts and does a PUSH microcommand, the execution of the second and third microinstructions illustrated in ROS data register 65 will now be discussed.
~oth the second and third microinstructions illustrated in Figure 5 do not contain a pus'n operation in the special - 68- ~2~:;'5S64 control field. Therefore, during the execution of both these instructions, the output of NAND gate 83 which is used to decode the PUSH microcommand will be a binary ONE
indicating that a push operation is not encoded within the microinstruction.

Turning now to the second microinstruction, we see that the hardware interrupt inhibit bit in bit position 34 is a binary ZERO indicating that hardware interrupts are permitted. This binary ZERO appears as signal RDDT34+ at the middle input of AND gate ~4 and causes the output thereo~ signal DISHIP~, to be a binary ZERO thereby enabling the inputs to hardware interrupt prinet encoder 54. If there are no hardware interrupt signals in the binary ZERO state and no hardware error signals in the binary ZERO state and a clear condition does not exist, all inputs IO through I10 of encoder 54 will be in the binary ONE state and therefore the output active signal at the P output of encoder 54, signal LSRSAR~, will be a binary ONE.

20With signal LDRSAR+ being a binary ONE and signal PUSHOP- being a binary ONE indicating that a push operation is not specified, the output of NAND gate 90, signal PUSHNT+, will be a binary ZERO indicating that a push operation is not to be performed because neither a 25PUSH microcommand is present, nor is a hardware interrupt -69- 1 ~'~ ~

pending. With one input of AND gate 92 being a binary ZERO, the output thereof, signal PUSNOT+, will be a binary ZERO at one input of OR gate 94. The other input of OR
gate 94, signal CLEARX~, will be a binary ZERO if a clear operation is not being performed. Therefore, the output of OR gate 94, signal PUSNEN+, will be a binary ZERO.

Because a pop operation is not specified in the ROS
address field of the second microinstruction, the output of inverter 88, signal POPOP+, will be a binary ZERO
indicating that a pop operation has not been specified.
Signal POPOP+ being a binary ZERO at one input o~ AND gate 93 will cause the output thereof, signal POPNOT+, to be a binary ZERO. With both inputs to OR gate 95 being binary ZEROs, the output thereof, signal POPNEN+, will be a binary ZERO. Because both shift mode signals, SO and S1, at the inputs of shift register 70A through 70L are binary ZEROs, the shift registers will not shift nor parallel load when they are clocked by signal PSTROB+ transitioning from the binary ZERO to the binary ONE state and therefore neither a push nor pop nor load operation will be performed during the execution of this microinstruction.

During the execution of this microinstruction, the A
inputs to address multiplexer 2 62 will be gated onto the Q output thereof because the selection signal, LDRSAR+, is a binary ONE as seen above. Therefore, the output of ;~ Z~`~5564 address multiplexer 1 60 will be loaded into ROS address register 63. Late in the execution of the current microinstruction when the output of return multiplexer 61 is strobed by signal PSTROB+ transitioning from the binary ZERO to the binary ONE state, the output of ROS address register 63 which contains the next address is loaded into ROS address history register 66 and thereafter incremented by one by incrementer 64. Thereafter, when the next microinstruction is executed as the current microinstruction, ROS address history register 66 will contain the current address and the current address + 1 as generated by incrementer 64 will be at the A input of return multiplexer 61.

If during the execution of this second microinstruction in which hardware interrupts are enabled by bit 34 being a binary ZERO, a hardware interrupt occurs. The output active signal, LDRSAR+, from the P
output of encoder 54 will be a binary ZERO indicating that a h,,rdware interrupt or error condition or clear condition has occurred and the B input of address multiplexer 2 62 will be enabled onto the Q output thereof. The B input to address multiplexer 2 h2 is comprised of the binary encoded bits Q1 through Q8 from encoder 54 along with eight leading binary ZEROs in the eight most significant bits such that the Q output of address multiplexer 2 62 -7 1- ;~2,~iS56~

will be a 12-bit binary address corresponding to the starting location of a hardware interrupt service routine which is preprogrammed to handle a particular hardware interrupt or hardware error or clear condition.

The output of address multiplexer 2 62 is input into ROS address register 63 and from there output to read only storage 24 so that the first word of the hardware interrupt service routine may be fetched and executed.
The address of the first word of the hardware interrupt service routine is also loaded into address history register 66 from ROS address register 63 during the execution of the second microinstruction in ROS data register 65 when signal PSTROB~' clocks (transitions from the binary ZERO to the binary ONE state~. At the same tii,le that the address is clocked from ROS address register 63 into ROS address history register 66, the output of return multiplexer 61 is pushed onto return address stack 7o.

The output of return multiplexer 61 will be the output of address multiplexer 1 60 which will be the nominal next microinstruction address which appears ak the B input of return multlplexer 61. As seen above, the B
input of return multiplexer 61 is placed on the Q output thereof because select signal LDRSAR+ is a binary ZERO
whenever there is an active output from encoder 54. Shift -72- l ~?~

register 70A through 70L do a push operation (right shift) because signal PUSNEN+ from OR 94 is a binary ONE and signal POPNEN+ from OR gate 95 is a binary ZERO. Signal PUSNEN+ is a binary ONE and POPNEN+ is a binary ZERO
because signal LDRSAR+ is a binary ZERO, signal CLEARX+ is a binary ZERO, signal PUSHOP- is a binary ONE and signal POPOP+ is a binary ZERO at the inputs to gates 90 through 95, the operation of which is described above.

During the execution of the third microinstruction illustrated in ROS data register 65 in Figure 5, a pop operation is performed as specified in the ROS address field. The pop operation indicated above is decoqed by OR
gate 86, the output of which, 'signal POPOP-, will be a binary ZERO indicating that a pop operation is to be performed. Signal POPOP- being a binary ZERO will enable the output of driver 60B within address ~nultiplexer 1 60 such that the A input of address multiplexer 2 will be the signals STKOOO through STK011 which are the twelve bits which correspond to the QA outputs of shift registers 70A
through 70L. These twelve signals correspond to the top address within the return address stack 70. The outputs of driver 60A are disabled by signal JUMP- being a binary ONE. Thus, the output of address ~ultiplexer 1 60 will be the top address in return address stack 70 which corresponds to the contents of register 71 in Figure 4.

12~)5S64 No hardware interrupt occurs during the execution of this POP microinstruction. The A inputs of address multiplexer 2 62 will be selected to be output as the Q
output- ar,~ thereby loaded into ROS address registers 63 which specifies the address of the next instruction to be fetched from read only store 24. As in this case of a POP
instruction without the occurrence of a hardware interrupt, the next instruction read from read only store 24 will be the instruction which was addressed by the top location within return address stack 70. If no hardware interrupt occurs during the execution of this POP
microinstruction, signal LDRSAR+ output by encoder 54 will be a binary ONE indicating th,at none of its outputs are active. Because a push operation was not specified in the special control field, signal PUSHOP- from NAND gate 83 will be a binary ONE and therefore the output of NAND gate 90, signal PUSHNT+, will be a binary ZERO indicating that no push operation is to be performed. If a clear operation is not taking place as indicated by signal CLEARX+ being a binary ZERO, the output of OR gate 94, signal PUSNEN+, will be a binary ZERO and the output of OR
gate 95, signal POPNEN+, will be binary ONE indicating that a left shift (pop) operation is to be performed by shift registers 70A through 70L. This will pop the return address stack 70 one location when signal PUSTROB+
transitions from the binary ZERO to the binary ONE state.

_74_ ~ 2~ ~ 6 ~

When this left shift operation of shift registers 70A
through 70L occurs, the bits at the shift left serial input (LI) of the twelve 4-bit shift registers are loaded into the shift registers. As can be seen in Figure 5, shift registers 70A through 70K contain a binary ZERO at this input, and shift register 70L contains a binary ONE
at this input thus resulting in the bottom location within return address stack (register 74) in Figure 4 being loaded with the hexadecimal value is used 001. This 001 value is used as an address within read only storage 24 of a routine that is microprogrammed to handle the case of overpopping the stack which will occur if this 001 hexadecimal is ever popped off,the top of the stack.

This same ROS address of 001 hexadeci~al is simultaneously loaded into registers 71 through 74 of return address stack 70 wnen a clear operation is performed by parallel loading all four inputs of shift registers 70A through 70K with binary ZEROs by having a binary ZERO at the PIA, PIB, PIC and PID lnputs of registers'70A through 70K and binary ONEs at the corresponding inputs of register 70L and doing a parallel load by having signals PUSNEN~ and POPNEN+ equal to binary ZEROs when these registers are clocked by PSTROB+
transitioning from the binary ZERO to the binary ONE state during a clear operation. This is accomplished because -75- ~.2QSS64 signal CLEARX+ is a binary ONE during a clear operation forcing the outputs of OR gates 94 and 95 to be binary ONEs thereby setting the shift mode select signals SO and S1 both equal to binary ONEs.

As discussed above with respect to Figure 4, if a hardware interrupt occurs during the execution of a microinstruction which contains a pop operation as does the third microinstruction illustrated in Figure 5, the push operation associated with the hardware interrupt cancels the pop operation of the microinstruction and the return address stack is neither pushed nor popped. The method by which this is accomplished will now be; discussed with respect to Figure 5.

If the third microinstruction which contains the pop operation in the ROS address field also contains a hardware interrupt inhibit bit of binary ZERO, a hardware interrupt can occur during the execution of the POP
microinstruction. As seen above, durine the execution of a microinstruction which contains the POP microcommand, the output of driver 60B will be enabled such that the output of address multiplexer 1 60 will be the return address which is contained in the top of return address stack 70. The output of address multiplexer 1 60 is presented to the A input of address multiplexer 2 62 and the B input of return multiplexer 61. As seen above, if a -76- 12~556~

hardware interrupt occurs, signal LDRSAR+ from encoder 54 is a binary ZERO selecting the B input of both address multiplexer 2 62 and return multiplexer 61. Thus, the output of address multiplexer 2 will be the vectored address as determined by encoder 54 at which is located the hardware interrupt service routine. The output of return multiplexer 61 will be the output of driver 60B
which is the output of the top of return address stack 70.

Thus, the ROS address register 63 will be loaded with the starting address of the hardware interrupt service routine associated with the highest priority interrupt pending and that location ~ill be fetched fro~ read only storage 24 to begin the éxecution of the hardware interrupt service routine. With signal LDRSAR+ being a binary ZERO, the output of N~.ND gate 90, signal PUSNNT+, will be a binary ONE indicating that a push operation should be performed on return address stack 70. Because a POP microcommand is encoded in ROS address field, the output of OR gate 86, signal POPOP-, will be a binary ZERO
thereby causing the output of inverter 88, signal POPOP~, to be a binary ONE indicating that a pop operation should be performed on return address stack 70. With both inputs to NAND gate 91 being binary ONEs, the output thereof, signal PUSPOP-, will be a binary Z~RO indicating that both 77~ 3 2~ 556 4 a push and pop operation is to be performed simultaneously on return address stack 70.

Signal PUSPOP- being a binary ZE~O will disable AND
gates 92 and 93 and cause signals PUSNOT~ and POPNOT+ to be binary ZE~0s indicating that neither a push nor pop operation is to be performed. Because a clear operation is not being performed, signal CLEARX+ will be a binary ZERO and therefore the output of OR gates 94 and 95 will be binary ZER0s indicating that neither a shift nor load operation is to be performed on shift registers 70A
through 70L. Therefore, a POP microcommand within the microinstruction cancels the implicit push operation of the hardware interrupt resulti~g in neither the pushing nor the popping nor the parallel loading of return address st~ck 70.

From the above discussion it can appreciated that NAND gate 91 is used to detect the simultaneous occurrence of a push and pop operation and to inhibit the simultaneous pushing and popping of return address stack 70 when this condition occurs. This condition can occur when a P0P microcommand is encoded within a microinstruction and a hardware interrupt occurs the combination of which prevents the movement of the stack in either direction. From the above discussion, it can also be appreciated how the stack is loaded at the bottom 7~ ~ 2QSS~4 register each time it is popped with an address of a routine which is used to detect the overpopping of the stack and how the stack is initialized during a clear operation so that each register within the stack contains this address of the overpopping service routine.

While a preferred embodiment has been described, other modifications will be readily suggested by those of ordinary skill in the art. For example, if hardware interrupts are not inhibited during a hardware interrupt service routine, the stacking mechanism of the invention can be used to nest hardware interrupts. Also, although the preferred embodiment has been described i,n terrns of 4-bit shift reeisters, if a re~ister containing more bits is utilized, the push down depth of the stack will be equal to the number of bits in the expanded shift register thus allowing greater nesting depth of subroutines and interrupts. In addition, a stack mechanism comprised of registers comprised of flip-flops as described in U.S.
Patent 3,909,797 could be used in lieu of the shift registers of the preferred embodiment, provided that the logic of the present invention which is used to detect an attempt to do a simultaneous push and pop operation is utilized so that neither a push nor pop operation is done.

It should be noted that the ROS address field to the subroutine can be either a conditional or unconditional ~79~ ~2~5564 branch. This is especially advantageous with the system described since the next address is continually provided by the ROS address field of microinstructions from read only storage 24. Nevertheless, it would be equally applicable in those addressing methods in where a sequence counter is used. Both addressing methods require the utilization of the PUSH microcommand to enable the storing of the address of the next instruction which would otherwise be executed if a branch was not made to the subroutine.

While the invention has been shown and described with reference to the preferred embodiment thereof, it will be understood by those skilled in 'the art that the above and other changes in form and detail may be made therein without departing from the spirit and scope of the invention.

What is claimed is:

Claims (10)

THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. In a data processor controlled by a microprogrammed con-trol store, wherein said control store executes different sequen-ces of microinstructions held in addressable locations of a stor-age unit thereof, and wherein said processor is provided with a pushdown stack for holding a plurality of addresses of said stor-age unit; apparatus for controlling said data processor to enable intermixed subroutine branching and entry into interrupt service routines from said sequences of microinstructions, comprising:
means controlled while executing a first microinstruction which denotes a transfer to a specified subroutine from the routine/sub-routine in execution for incrementing the address of said first microinstruction and pushing such incremented address onto the top of said stack, means controlled while executing a second micro-instruction during which an interrupt occurs for pushing onto the top of said stack the next address being developed during execu-tion of said second microinstruction and for transferring opera-tion to a microinstruction service routine whose first address is determined by the nature of said interrupt, and means controlled by the last microinstruction in each subroutine and said service routine to pop up said stack, and use the address received from the top of said stack as a return address to re-enter the routine/
subroutine from which said subroutine or service routine was enter-ed.
2. The apparatus of Claim 1 further including means enabled by the concurrent execution of said last microinstruction in a subroutine and the occurrence of an interrupt for inhibiting the popping up of said stack.
3. The apparatus of Claim 1 further including means respon-sive to said first microinstruction for inhibiting said apparatus from responding to certain interrupts.
4. A method of effecting transfers to and from subroutines and interrupt service routines comprising the steps of:
A. generating a first microinstruction of a routine from a memory which identifies a branch to subroutine;
B. executing a branch to a subroutine; said branch exec-uting step including:
a. inhibiting the occurrence of inhibitable interrupts, b. transferring a current address of said first micro-instruction in a current address register to an incrementer, c. incrementing said current address to produce an in-cremented address, d. storing said incremented address, which is a return address, in a first register of a push-down stack, e. transferring previous return addresses into adjacent registers one level down in said push-down stack simultaneous with the storing of said incremented address, f. transferring a next address in said first microin-struction into a next address register if no interrupt is pending or if all pending interrupts are inhibited, g. transferring said next address in said next address register into said current address register, and h. generating a second microinstruction, which is a first microinstruction of a subroutine, from said memory using said next address from said next address register, C. generating an interrupt to an interrupt service routine, said interrupt generating step including:
a. generating a vectored interrupt address of a highest priority non-inhibited pending interrupt if a pending non-inhibit-ed interrupt exists, b. transferring said vectored interrupt address into said next address register if interrupts are not inhibited, c. storing a next address from a current microinstruc-tion, which is said return address, into said first register of said push-down stack if interrupts are not inhibited, d. transferring previous return addresses into adjacent registers one level down in said push-down stack simultaneous with the storing of said return address, e. transferring said vectored interrupt address in said next address register into said current address register, and f. generating a third microinstruction, which is a first microinstruction of a first interrupt service routine, from said memory using said vectored interrupt address from said next ad-dress register, D. generating a microinstruction from said memory which identifies a return from said subroutines or said interrupts; and E. executing a return from said subroutines or inter-rupts, said return executing step including:
a. transferring said return address from said first register in said push-down stack to said next address register if no interrupts are pending or if all pending interrupts are inhib-ited, b. transferring previous return addresses into said adjacent registers one level up in said push-down stack simultan-eous with said transferring said return address to said next ad-dress register, c. generating said vectored interrupt address of said highest priority non-inhibited pending interrupt if a pending non-inhibited interrupt exists, d. transferring said vectored interrupt address into said next address register if interrupts are not inhibited, and e. generating a fourth microinstruction, which is a subsequent microinstruction to the microinstruction which branches to a subroutine, if no non-inhibited interrupts are pending, or a first microinstruction of a subsequent interrupt service routine if said pending non-inhibited interrupt exists, from said memory using an address from said next address register.
5. A data processing system for executing a routine which accesses a plurality of subroutines and for executing a plurality of interrupt service routines in response to a plurality of inter-rupts, said system comprising:
A. means for providing a sequence of microinstructions, each microinstruction containing address fields to define an ad-dress of a microinstruction of said providing means and command fields to define transfer paths, one type of said microinstruc-tion specifying a branch to said subroutines and a second type of said microinstructions specifying a return from said subroutines or interrupt service routines;
B. means for altering said sequence of microinstructions provided by said providing means in response to an uninhibited interrupt occurring, said means for altering providing a vectored interrupt address to said providing means which is used as a start-ing address of an interrupt service routine;
C. storing means including:
a. a plurality of registers serially intercoupled, one of said plurality of registers being a top end, another of said plurality of registers being a bottom end, the remaining of said plurality of registers being intermediate said top and said bot-tom end, each of said plurality of registers being adapted to hold one return address, b. first means coupled to said top end and said remain-ing registers and responsive to said providing means for serially propagating the return addresses to said bottom end of said plur-ality of registers and, c. bottom means coupled to said bottom end and said remaining registers and responsive to said providing means for serially propagating the return addresses to said top end of said plurality of registers, wherein said storing means is responsive to said one type of microinstruction and to the occurrence of non-inhibited interrupts for sequentially storing return addresses of previous routines and subroutines in said top end register; and means responsive to a series of said second type microinstruction for sequentially transferring to said providing means from said top end register of said storing means in a reverse order said return addresses.
6. A system as defined in claim 5 wherein a first command field of said command fields of said microinstructions has a first value for enabling said storing means to receive said return ad-dresses from said transferring means and wherein a first address field of said address fields of said microinstruction has a first value for enabling said storing means to deliver said return ad-dresses to said transferring means.
7. A system as defined in claim 6 further including means for incrementing said address of said providng means by a prede-termined number, and wherein said top end register receives said incremented address from said incrementer means in response to said first value in said first command field.
8. A system as defined in claim 7 further including a means for disabling said storing means from transferring to said provid-ing means said return address from said top end register if a non-inhibited interrupt occurs during said second type of said micro-instructions that specify a return from said subroutines or inter-rupt service routines.
9. A data processing system for sequentially accessing routines and subroutines and for accessing interrupt service routines; said system comprising:

A. means for providing a sequence of microinstructions, each microinstruction address being addressed by an address within said providing means, each microinstruction containing address fields to define a next address of a microinstruction of said providing means and command fields to define transfer paths, a first address field of said address fields having a first value which specifies a branch to said subroutines and a second value which specifies a return from said subroutines or interrupt ser-vice routines, a first command field of said command fields having a first value specifying a transfer of return addresses and a second com-mand field of said command fields having a first value specifying an inhibiting of interrupts and a second value specifying an en-abling of interrupts;
B. means for receiving an address from said providing means, said address from said receiving means being a next ad-dress;
C. storing means including:
a. a plurality of registers serially intercoupled, one of said plurality of registers being a top end register, another of said plurality of registers being a bottom end register, the remaining of said plurality of registers being intermediate said top and said bottom end registers, each of said plurality of registers being adapted to hold one return address;
b. first means coupled to said top end and said remain-ing registers and responsive to said first command field having a first value for serially propagating said return addresses to said bottom end of said plurality of registers;
c. second means coupled to said bottom end and said remaining registers and responsive to said first address field having said second value for serially propagating said return ad-dresses to said top end of said plurality of registers;
d. said top end register receiving said return address in response to said first address field having said first value and to said first command field having said first value; and D. means for transferring responsive to said first ad-dress field having said second value for transferring said return address from said top end register to said receiving means, said return address becoming said next address.
10. A system as defined in claim 9 wherein said storing means further includes first means responsive to said first ad-dress field having said second value, and said second command field having said second value and the occurrence of a non-inhib-ited interrupt for holding said return addresses contained in said top end, bottom end, and remaining registers of said plural-ity of registers.
CA000441392A 1982-12-03 1983-11-17 Program counter stacking method and apparatus for nested subroutines and interrupts Expired CA1205564A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US06/446,748 US4488227A (en) 1982-12-03 1982-12-03 Program counter stacking method and apparatus for nested subroutines and interrupts
US446,748 1982-12-03

Publications (1)

Publication Number Publication Date
CA1205564A true CA1205564A (en) 1986-06-03

Family

ID=23773700

Family Applications (1)

Application Number Title Priority Date Filing Date
CA000441392A Expired CA1205564A (en) 1982-12-03 1983-11-17 Program counter stacking method and apparatus for nested subroutines and interrupts

Country Status (11)

Country Link
US (1) US4488227A (en)
EP (1) EP0111407B1 (en)
JP (1) JPH0666051B2 (en)
KR (1) KR900007565B1 (en)
AU (1) AU573194B2 (en)
BR (1) BR8306655A (en)
CA (1) CA1205564A (en)
FI (1) FI83458C (en)
HK (1) HK64292A (en)
SG (1) SG67692G (en)
YU (1) YU45579B (en)

Families Citing this family (79)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4636944A (en) * 1984-01-17 1987-01-13 Concurrent Computer Corporation Multi-level priority micro-interrupt controller
US4792890A (en) * 1985-12-31 1988-12-20 International Business Machines Corp. Method for resolving conflicts between interrupt sources sharing the same priority level
US5161217A (en) * 1986-10-14 1992-11-03 Bull Hn Information Systems Inc. Buffered address stack register with parallel input registers and overflow protection
JPS63108457A (en) * 1986-10-24 1988-05-13 Brother Ind Ltd Data processor
US4800491A (en) * 1986-11-17 1989-01-24 General Electric Company Register-stack apparatus
US5179688A (en) * 1987-06-30 1993-01-12 Tandem Computers Incorporated Queue system with uninterrupted transfer of data through intermediate locations to selected queue location
US5193205A (en) * 1988-03-01 1993-03-09 Mitsubishi Denki Kabushiki Kaisha Pipeline processor, with return address stack storing only pre-return processed address for judging validity and correction of unprocessed address
US4965716A (en) * 1988-03-11 1990-10-23 International Business Machines Corporation Fast access priority queue for managing multiple messages at a communications node or managing multiple programs in a multiprogrammed data processor
US5287483A (en) * 1988-07-06 1994-02-15 Kabushiki Kaisha Toshiba Prefetched operand storing system for an information processor
US5321823A (en) * 1988-07-20 1994-06-14 Digital Equipment Corporation Digital processor with bit mask for counting registers for fast register saves
US5117498A (en) * 1988-08-19 1992-05-26 Motorola, Inc. Processer with flexible return from subroutine
US5043879A (en) * 1989-01-12 1991-08-27 International Business Machines Corporation PLA microcode controller
JPH02190937A (en) * 1989-01-19 1990-07-26 Sanyo Electric Co Ltd Interruption circuit for microcomputer
US5155809A (en) * 1989-05-17 1992-10-13 International Business Machines Corp. Uncoupling a central processing unit from its associated hardware for interaction with data handling apparatus alien to the operating system controlling said unit and hardware
US5440749A (en) * 1989-08-03 1995-08-08 Nanotronics Corporation High performance, low cost microprocessor architecture
DE69114321T2 (en) * 1990-02-20 1996-07-18 Nec Corp Interrupt control device suitable for performing the interrupt interleaving function.
JPH0437927A (en) * 1990-06-01 1992-02-07 Sony Corp Processor processing method
US5175853A (en) * 1990-10-09 1992-12-29 Intel Corporation Transparent system interrupt
JP2507833B2 (en) * 1990-12-25 1996-06-19 三菱電機株式会社 Micro computer
US5455949A (en) * 1991-09-06 1995-10-03 International Business Machines Corporation Method for representing and signaling run-time program conditions
JPH0831041B2 (en) * 1991-09-06 1996-03-27 インターナショナル・ビジネス・マシーンズ・コーポレイション Program condition processing method and computer system
JP3182438B2 (en) * 1991-10-28 2001-07-03 株式会社日立製作所 Data processor
US5448707A (en) * 1991-10-29 1995-09-05 Intel Corporation Mechanism to protect data saved on a local register cache during inter-subsystem calls and returns
US5274817A (en) * 1991-12-23 1993-12-28 Caterpillar Inc. Method for executing subroutine calls
JP3211423B2 (en) * 1992-10-13 2001-09-25 ソニー株式会社 Branch instruction execution method and branch instruction execution device
US5640548A (en) * 1992-10-19 1997-06-17 Motorola, Inc. Method and apparatus for unstacking registers in a data processing system
US5450349A (en) * 1992-10-27 1995-09-12 Digital Equipment Corporation Computer system performance evaluation system and method
JPH0749790A (en) * 1993-06-01 1995-02-21 Matsushita Electric Ind Co Ltd Method and circuit for interrupt control in processor
US5396616A (en) * 1993-06-15 1995-03-07 Xerox Corporation System for emulating multi-tasking pipelines in a single tasking environment
US5701479A (en) * 1993-06-15 1997-12-23 Xerox Corporation Pipelined image processing system for a single application environment
US5995996A (en) * 1993-06-15 1999-11-30 Xerox Corporation Pipelined image processing system for a single application environment
US5553259A (en) * 1993-07-16 1996-09-03 Unisys Corporation Apparatus and method for synchronizing the simultaneous loading of cache program word addresses in dual slice registers
US5922070A (en) * 1994-01-11 1999-07-13 Texas Instruments Incorporated Pipelined data processing including program counter recycling
US5537541A (en) * 1994-08-16 1996-07-16 Digital Equipment Corporation System independent interface for performance counters
US5671422A (en) * 1994-11-14 1997-09-23 Intel Corporation Method and apparatus for switching between the modes of a processor
JP3504355B2 (en) * 1994-12-06 2004-03-08 松下電器産業株式会社 Processor
US6081880A (en) * 1995-03-09 2000-06-27 Lsi Logic Corporation Processor having a scalable, uni/multi-dimensional, and virtually/physically addressed operand register file
US6052801A (en) * 1995-05-10 2000-04-18 Intel Corporation Method and apparatus for providing breakpoints on a selectable address range
US5966529A (en) * 1995-05-15 1999-10-12 Zsp Corporation Processor having auxiliary operand register file and complementary arrangements for non-disruptively performing adjunct execution
US5659679A (en) * 1995-05-30 1997-08-19 Intel Corporation Method and apparatus for providing breakpoints on taken jumps and for providing software profiling in a computer system
US5621886A (en) * 1995-06-19 1997-04-15 Intel Corporation Method and apparatus for providing efficient software debugging
US5740413A (en) * 1995-06-19 1998-04-14 Intel Corporation Method and apparatus for providing address breakpoints, branch breakpoints, and single stepping
KR100381876B1 (en) * 1995-07-03 2003-07-18 텍사스 인스트루먼츠 인코포레이티드 Incrementing and Decrementing a Microprocessor Program Counter
US5732272A (en) * 1995-07-31 1998-03-24 Apple Computer, Inc. Subroutine execution time tracer
US5900025A (en) * 1995-09-12 1999-05-04 Zsp Corporation Processor having a hierarchical control register file and methods for operating the same
DE19535546B4 (en) * 1995-09-25 2004-04-08 Siemens Ag Method for operating a real-time computer system controlled by a real-time operating system
CA2159979C (en) * 1995-10-05 1999-05-25 Arthur Lai Methology to link any pci rom based device using a single software or hardware interrupt vector in pc system at runtime
JP2850808B2 (en) * 1995-10-31 1999-01-27 日本電気株式会社 Data processing device and data processing method
US5606703A (en) * 1995-12-06 1997-02-25 International Business Machines Corporation Interrupt protocol system and method using priority-arranged queues of interrupt status block control data structures
US5761491A (en) * 1996-04-15 1998-06-02 Motorola Inc. Data processing system and method for storing and restoring a stack pointer
US6070218A (en) * 1998-01-16 2000-05-30 Lsi Logic Corporation Interrupt capture and hold mechanism
US6065088A (en) 1998-08-31 2000-05-16 International Business Machines Corporation System and method for interrupt command queuing and ordering
US6633969B1 (en) 2000-08-11 2003-10-14 Lsi Logic Corporation Instruction translation system and method achieving single-cycle translation of variable-length MIPS16 instructions
US6934939B2 (en) * 2001-02-28 2005-08-23 International Business Machines Corporation Method for unwinding a program call stack
US7231511B2 (en) * 2001-12-20 2007-06-12 Intel Corporation Microinstruction pointer stack including speculative pointers for out-of-order execution
US7206884B2 (en) * 2004-02-11 2007-04-17 Arm Limited Interrupt priority control within a nested interrupt system
US7607133B2 (en) * 2004-02-11 2009-10-20 Arm Limited Interrupt processing control
GB2478733B (en) 2010-03-15 2013-08-14 Advanced Risc Mach Ltd Apparatus and method for handling exception events
DE102011005209B4 (en) 2011-03-07 2016-06-23 Infineon Technologies Ag Program instruction-controlled instruction flow control
US10210349B2 (en) 2012-02-08 2019-02-19 Arm Limited Data processing apparatus and method using secure domain and less secure domain
US9202071B2 (en) 2012-02-08 2015-12-01 Arm Limited Exception handling in a data processing apparatus having a secure domain and a less secure domain
US9116711B2 (en) 2012-02-08 2015-08-25 Arm Limited Exception handling in a data processing apparatus having a secure domain and a less secure domain
US9213828B2 (en) * 2012-02-08 2015-12-15 Arm Limited Data processing apparatus and method for protecting secure data and program code from non-secure access when switching between secure and less secure domains
US9477834B2 (en) 2012-02-08 2016-10-25 Arm Limited Maintaining secure data isolated from non-secure access when switching between domains
US9442737B2 (en) 2012-06-15 2016-09-13 International Business Machines Corporation Restricting processing within a processor to facilitate transaction completion
US9348642B2 (en) 2012-06-15 2016-05-24 International Business Machines Corporation Transaction begin/end instructions
US9361115B2 (en) 2012-06-15 2016-06-07 International Business Machines Corporation Saving/restoring selected registers in transactional processing
US10437602B2 (en) 2012-06-15 2019-10-08 International Business Machines Corporation Program interruption filtering in transactional execution
US9367323B2 (en) 2012-06-15 2016-06-14 International Business Machines Corporation Processor assist facility
US8682877B2 (en) 2012-06-15 2014-03-25 International Business Machines Corporation Constrained transaction execution
US8688661B2 (en) 2012-06-15 2014-04-01 International Business Machines Corporation Transactional processing
US9384004B2 (en) 2012-06-15 2016-07-05 International Business Machines Corporation Randomized testing within transactional execution
US9772854B2 (en) 2012-06-15 2017-09-26 International Business Machines Corporation Selectively controlling instruction execution in transactional processing
US9336046B2 (en) 2012-06-15 2016-05-10 International Business Machines Corporation Transaction abort processing
US9436477B2 (en) 2012-06-15 2016-09-06 International Business Machines Corporation Transaction abort instruction
US9317460B2 (en) * 2012-06-15 2016-04-19 International Business Machines Corporation Program event recording within a transactional environment
US9740549B2 (en) 2012-06-15 2017-08-22 International Business Machines Corporation Facilitating transaction completion subsequent to repeated aborts of the transaction
US9448796B2 (en) 2012-06-15 2016-09-20 International Business Machines Corporation Restricted instructions in transactional execution
US20130339680A1 (en) 2012-06-15 2013-12-19 International Business Machines Corporation Nontransactional store instruction

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2253425A5 (en) * 1973-11-30 1975-06-27 Honeywell Bull Soc Ind
US3909797A (en) * 1973-12-13 1975-09-30 Honeywell Inf Systems Data processing system utilizing control store unit and push down stack for nested subroutines
JPS50128429A (en) * 1974-03-28 1975-10-09
US4287559A (en) * 1977-02-09 1981-09-01 Texas Instruments Incorporated Electronic microprocessor system having two cycle branch logic
JPS54106142A (en) * 1978-02-08 1979-08-20 Nec Corp Data processor
JPS5552152A (en) * 1978-10-13 1980-04-16 Hitachi Ltd Control system for program address
US4340933A (en) * 1979-02-12 1982-07-20 Honeywell Information Systems Inc. Data processing system having centralized nonexistent memory address detection
JPS564943A (en) * 1979-06-26 1981-01-19 Nec Corp Noise removing unit
US4398244A (en) * 1980-05-07 1983-08-09 Fairchild Camera & Instrument Corporation Interruptible microprogram sequencing unit and microprogrammed apparatus utilizing same
US4438492A (en) * 1980-08-01 1984-03-20 Advanced Micro Devices, Inc. Interruptable microprogram controller for microcomputer systems

Also Published As

Publication number Publication date
FI834414A0 (en) 1983-12-02
AU573194B2 (en) 1988-06-02
HK64292A (en) 1992-09-04
YU236183A (en) 1986-10-31
JPS59111542A (en) 1984-06-27
AU2160783A (en) 1984-06-07
FI83458C (en) 1991-07-10
US4488227A (en) 1984-12-11
SG67692G (en) 1992-12-04
JPH0666051B2 (en) 1994-08-24
KR840007187A (en) 1984-12-05
KR900007565B1 (en) 1990-10-15
YU45579B (en) 1992-07-20
FI834414A (en) 1984-06-04
EP0111407A3 (en) 1984-07-18
FI83458B (en) 1991-03-28
EP0111407B1 (en) 1992-04-29
BR8306655A (en) 1984-07-17
EP0111407A2 (en) 1984-06-20

Similar Documents

Publication Publication Date Title
CA1205564A (en) Program counter stacking method and apparatus for nested subroutines and interrupts
US3970999A (en) Memory expansion apparatus
US4604695A (en) Nibble and word addressable memory arrangement
US3909797A (en) Data processing system utilizing control store unit and push down stack for nested subroutines
US4016545A (en) Plural memory controller apparatus
US3889243A (en) Stack mechanism for a data processor
US4363091A (en) Extended address, single and multiple bit microprocessor
US3739352A (en) Variable word width processor control
US4297743A (en) Call and stack mechanism for procedures executing in different rings
US4041462A (en) Data processing system featuring subroutine linkage operations using hardware controlled stacks
US4486831A (en) Multi-programming data processing system process suspension
US4296470A (en) Link register storage and restore system for use in an instruction pre-fetch micro-processor interrupt system
US3389380A (en) Signal responsive apparatus
US4103329A (en) Data processing system with improved bit field handling
US3753236A (en) Microprogrammable peripheral controller
US4095278A (en) Instruction altering system
US3222649A (en) Digital computer with indirect addressing
US4713750A (en) Microprocessor with compact mapped programmable logic array
JPS5911943B2 (en) Trap mechanism for data processing equipment
US5905881A (en) Delayed state writes for an instruction processor
US3701977A (en) General purpose digital computer
US5097407A (en) Artificial intelligence processor
US4279016A (en) Instruction pre-fetch microprocessor interrupt system
US3286236A (en) Electronic digital computer with automatic interrupt control
US4638450A (en) Equal nine apparatus for supporting absolute value subtracts on decimal operands of unequal length

Legal Events

Date Code Title Description
MKEX Expiry