JPH034327A - Central arithmetic processing unit - Google Patents

Central arithmetic processing unit

Info

Publication number
JPH034327A
JPH034327A JP1139555A JP13955589A JPH034327A JP H034327 A JPH034327 A JP H034327A JP 1139555 A JP1139555 A JP 1139555A JP 13955589 A JP13955589 A JP 13955589A JP H034327 A JPH034327 A JP H034327A
Authority
JP
Japan
Prior art keywords
cycle
instruction
processing unit
conditions
prebyte
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.)
Pending
Application number
JP1139555A
Other languages
Japanese (ja)
Inventor
Shinichi Yamaura
山浦 慎一
Keiichi Yoshioka
圭一 吉岡
Takashi Yasui
隆 安井
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.)
Ricoh Co Ltd
Original Assignee
Ricoh Co Ltd
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 Ricoh Co Ltd filed Critical Ricoh Co Ltd
Priority to JP1139555A priority Critical patent/JPH034327A/en
Publication of JPH034327A publication Critical patent/JPH034327A/en
Pending legal-status Critical Current

Links

Landscapes

  • Executing Machine-Instructions (AREA)

Abstract

PURPOSE:To reduce the kinds of succeeding operational codes and to reduce a hardware quantity by storing the instruction of conditions to change the execution condition of the instruction, etc., in a prebyte. CONSTITUTION:In the central arithmetic processing unit, the object is a processing system in which data called a prebyte 33 are fetched before the instruction composed of an operational code 31 and an operand 32, and the conditions of the execution condition in the central arithmetic processing unit, etc., is stored in the prebyte 33. When such an instruction format is executed, the action of the central arithmetic processing unit is indicated by the flow of a figure, the prebyte 33 is fetched in a cycle 1, and whether the conditions fetched in the cycle 1 are real or not is checked at the same time of the fetch of the operational code 31 in a cycle 2. When the conditions are real, the operand 32 to succeed to the operational code 31 is read in a cycle 3 and thereafter, the prescribed instruction execution is performed, and on the other hand, the above-mentioned conditions are not real, the cycle 3 is jumped, and the fetch of the next operational code is executed in a next cycle 1 '.

Description

【発明の詳細な説明】[Detailed description of the invention] 【産業上の利用分野】[Industrial application field]

この発明は、命令処理情報の前に特定のデータの読み込
みが可能な中央演算処理装置に関する。
The present invention relates to a central processing unit capable of reading specific data before instruction processing information.

【従来の技術】[Conventional technology]

中央演算処理装置で扱う命令語は、オペコード、及びこ
のオペコードに続くオペランドよりなっており、命令の
実行状態を変える条件及び、分岐。 サブルーチン等の実行あるいは未実行の制御条件等は、
オペコード内、もしくはオペランド内の情報(ポストバ
イト)に格納される(ポストバイト方式と呼ばれる)。
The instruction words handled by the central processing unit consist of an opcode and the operands that follow the opcode, including conditions and branches that change the execution state of the instruction. Control conditions for execution or non-execution of subroutines, etc.
Information is stored in the opcode or in the operand (post-byte) (called post-byte method).

【発明が解決しようとする課題】[Problem to be solved by the invention]

従って、上述のような従来の命令実行処理装置において
は、オペコードの種類が増加してハードウェア量が増大
し、又、前記の各条件を読み込むためのサイクルを必要
としために命令実行速度が低下した。 この発明は、上述した問題点をなくすためになされたも
のであり、オペコードを増加させず、余分な処理サイク
ルを省略できる中央演算処理装置を提供することを目的
とする。
Therefore, in the conventional instruction execution processing device as described above, the number of types of opcodes increases, the amount of hardware increases, and the instruction execution speed decreases because a cycle is required to read each of the above conditions. did. The present invention has been made to eliminate the above-mentioned problems, and an object of the present invention is to provide a central processing unit that can omit extra processing cycles without increasing the number of operation codes.

【課題を解決するための手段】[Means to solve the problem]

第1の発明になる中央演算処理装置は、命令処理情報の
前に特定の情報の読み込みが可能な中央演算処理装置に
おいて、前記特定情報が、次に実行される命令の実行状
態を変える条件であることを特徴とする。 第2の発明になる中央演算処理装置は、命令処理情報の
前に特定の情報の読み込みが可能な中央演算処理装置に
おいて、前記特定情報が、次に実行される命令に対して
分岐、サブルーチン等の実行あるいは未実行の条件であ
ることを特徴とする。
A central processing unit according to a first aspect of the present invention is a central processing unit that can read specific information before instruction processing information, and is provided with a condition that the specific information changes the execution state of an instruction to be executed next. characterized by something. A central processing unit according to a second invention is a central processing unit that can read specific information before instruction processing information, and in which the specific information is used for branching, subroutine, etc. for the next instruction to be executed. It is characterized by being a condition for execution or non-execution.

【実施例】【Example】

以下、この発明を一実施例を基に説明する。 この発明の中央演算処理装置は、第3図に示すように、
オペコード21及びオペランド32よりなる命令の前に
プリバイト33と呼ばれるデータがフェッチされる処理
ンステムを対象としており、プリバイト33に、該中央
演算処理装置における実行状態の条件等を格納する。こ
のような命令フォーマットとすれば、中央演算処理装置
の動作は、第1図のフローで示すように、サイクルlで
プリバイト33をフェッチし、サイクル2で、オペコー
ド31のフェッチと同時に、サイクルIでフェッチした
条件か真か否かを調べる。条件が真であれば、サイクル
3以降にて、オペコード31に続くオペランド32を読
み込み、所定の命令実行を行うが、一方、前記条件が真
でなければ、サイクル3をとばし、次のサイクル1′に
て次のオペコードのフェッチを行う。 このような動作とすることにより、中央演算処理装置は
、条件の内容により、命令の実行あるいは未実行を選択
できる。又、このような条件が不要の場合は、サイクル
2のオペコードからフェッチし、条件を常に真として実
行することで通常の動作となる。 次にサブルーチンの応用について第2図のフローを参照
して説明する。この場合のプログラム例を、二−モニッ
ク表示で表すと次のようになる。 I      LD    RO1234H2CEQ 
  JSR5UBI 3      LD    RO100OH60ADR
RO#30H CEQは、Zフラグ(ゼロフラグ)が“ビなら真を示す
プリバイト、JSR5UBIは、5UBI番地へサブル
ーチンコールを行うオペランドを示す。 サイクルlでプリバイトとしてCEQをフェッチし、サ
イクル2では、オペコードとしてJSRをフェッチする
と同時に、プリバイト有無のチエツクを行い、Zフラグ
が“ビであるかチエツクする。 プリバイト無し、あるいはZフラグが“l”のときは、
サイクル3で5UBIのアドレス下位8ビット取り込み
、サイクル4でアドレス上位4ビット取り込み、サイク
ル5でプログラムカウンタの下位8ビツトのスタックへ
退避させ、サイクル6でプログラムカウンタの上位8ビ
ツトのスタックへ退避させる。次にプログラムカウンタ
を5UBIの値にすることで、次のサイクルで5UBI
の最初の命令ADDをフェッチする。 一方、プリバイトが有りで、Zフラグが1でないならば
、命令の実行は行わずに、プログラムカウンタに“3”
加算して次の命令LDをフェッチする。この動作でサブ
ルーチンコール実行時6サイクル、未実行時2サイクル
となり、未実行時には処理時間が短縮される。 尚、通常の条件無しのJSRの場合は、CEQは追加せ
ずにプログラムすることで、プリバイト無しにしてオペ
コードを取り込むことにより、サイクル2から始まるの
と同等となる。
This invention will be explained below based on one embodiment. As shown in FIG. 3, the central processing unit of this invention has the following features:
The target is a processing system in which data called a prebyte 33 is fetched before an instruction consisting of an operation code 21 and an operand 32, and the prebyte 33 stores the conditions of the execution state in the central processing unit. With this instruction format, the operation of the central processing unit is to fetch the prebyte 33 in cycle l, fetch the opcode 31 in cycle 2, and simultaneously fetch the opcode 31 in cycle I, as shown in the flowchart in Figure 1. Check whether the fetched condition is true or not. If the condition is true, the operand 32 following the opcode 31 is read from cycle 3 onward, and the predetermined instruction is executed. On the other hand, if the condition is not true, cycle 3 is skipped and the next cycle 1' is executed. Fetch the next opcode. By performing such an operation, the central processing unit can select execution or non-execution of the instruction depending on the content of the condition. If such a condition is unnecessary, normal operation is achieved by fetching from the operation code of cycle 2 and executing with the condition always true. Next, the application of the subroutine will be explained with reference to the flow shown in FIG. An example program in this case is expressed in mnemonic representation as follows. ILD RO1234H2CEQ
JSR5UBI 3 LD RO100OH60ADR
RO#30H CEQ is a prebyte that indicates true if the Z flag (zero flag) is "BI", and JSR5UBI indicates an operand that makes a subroutine call to address 5UBI. In cycle 1, CEQ is fetched as a prebyte, and in cycle 2, it is fetched as an opcode. At the same time as fetching JSR, a check is made to see if there is a pre-byte, and a check is made to see if the Z flag is "BI". If there is no prebyte or the Z flag is “l”,
In cycle 3, the lower 8 bits of the address of 5UBI are fetched, in cycle 4, the upper 4 bits of the address are fetched, in cycle 5, the lower 8 bits of the program counter are saved to the stack, and in cycle 6, the lower 8 bits of the program counter are saved to the stack. Next, by setting the program counter to a value of 5UBI, 5UBI will be generated in the next cycle.
fetch the first instruction ADD. On the other hand, if there is a pre-byte and the Z flag is not 1, the instruction is not executed and the program counter is set to "3".
Add and fetch the next instruction LD. This operation results in 6 cycles when a subroutine call is executed and 2 cycles when it is not executed, and the processing time is shortened when it is not executed. Note that in the case of a normal JSR without conditions, by programming without adding CEQ and by taking in the opcode without pre-byte, it becomes equivalent to starting from cycle 2.

【発明の効果】【Effect of the invention】

以上説明したように、この発明は、命令の実行状態を変
える条件等の命令をプリバイトに格納するようにしたの
で、次に続くオペコードの種類を低減できハードウェア
量を減少でき、又、プリバイトにて前記条件を判断でき
るために余分な処理サイクルがなく、処理の高速化を図
れる。
As explained above, this invention stores instructions such as conditions that change the execution state of the instruction in the prebyte, so the types of subsequent opcodes can be reduced and the amount of hardware can be reduced. Since the conditions can be determined based on the above information, no extra processing cycles are required, and processing speed can be increased.

【図面の簡単な説明】 第1図はこの発明の中央演算処理装置による命令の実行
状態を変える処理の一例を示すフローチャート、第2図
は、サブルーチンの処理を含む場合のフローチャート、
第3図は、この発明に用いた命令語の構成を示す図であ
る。 3I・・・オペコード、 32・・・オペランド、 33・・・プリバイト。
[BRIEF DESCRIPTION OF THE DRAWINGS] FIG. 1 is a flowchart showing an example of processing for changing the execution state of instructions by the central processing unit of the present invention, and FIG. 2 is a flowchart showing an example of processing including subroutine processing.
FIG. 3 is a diagram showing the structure of command words used in the present invention. 3I...Opcode, 32...Operand, 33...Prebyte.

Claims (2)

【特許請求の範囲】[Claims] (1)命令処理情報の前に特定の情報の読み込みが可能
な中央演算処理装置において、前記特定情報が、次に実
行される命令の実行状態を変える条件であることを特徴
とする中央演算処理装置。
(1) A central processing unit capable of reading specific information before instruction processing information, wherein the specific information is a condition for changing the execution state of the next executed instruction. Device.
(2)命令処理情報の前に特定の情報の読み込みが可能
な中央演算処理装置において、前記特定情報が、次に実
行される命令に対して分岐、サブルーチン等の実行ある
いは未実行の条件であることを特徴とする中央演算処理
装置。
(2) In a central processing unit that can read specific information before instruction processing information, the specific information is a condition for execution or non-execution of a branch, subroutine, etc. for the next instruction to be executed. A central processing unit characterized by:
JP1139555A 1989-06-01 1989-06-01 Central arithmetic processing unit Pending JPH034327A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP1139555A JPH034327A (en) 1989-06-01 1989-06-01 Central arithmetic processing unit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP1139555A JPH034327A (en) 1989-06-01 1989-06-01 Central arithmetic processing unit

Publications (1)

Publication Number Publication Date
JPH034327A true JPH034327A (en) 1991-01-10

Family

ID=15247992

Family Applications (1)

Application Number Title Priority Date Filing Date
JP1139555A Pending JPH034327A (en) 1989-06-01 1989-06-01 Central arithmetic processing unit

Country Status (1)

Country Link
JP (1) JPH034327A (en)

Similar Documents

Publication Publication Date Title
KR20060063790A (en) Predication instruction within a data processing system
JP3486690B2 (en) Pipeline processor
JPH056894B2 (en)
JPS645330B2 (en)
JP3599499B2 (en) Central processing unit
JP3452989B2 (en) Central processing unit
JPH034327A (en) Central arithmetic processing unit
CA1155231A (en) Pipelined digital processor arranged for conditional operation
US6233675B1 (en) Facility to allow fast execution of and, or, and test instructions
US8392893B2 (en) Emulation method and computer system
JPS6217773B2 (en)
JP2531791B2 (en) Abnormality handling method when accessing Fetch
JPS6116334A (en) Data processor
EP0211487A1 (en) Conditional operations in computers
KR100329780B1 (en) Interrupt processing apparatus reducing interrupt response time
JP3651099B2 (en) Programmable controller
KR100240590B1 (en) Apparatus and Methed for decoding instruction in superscalar Microprocessor
JPH0715662B2 (en) Information processing device for prefetching instructions
JPS6411973B2 (en)
JP2597744B2 (en) Branch control method
JPH04167027A (en) Parallel arithmetic processing unit
JPS63206834A (en) System for detecting and processing error in instruction control
JPS61273637A (en) Information processor
JPH06110687A (en) Information processing device and information processing method
JPH05181671A (en) Emulation system for software instruction