JPS58137048A - Branch instruction control system - Google Patents

Branch instruction control system

Info

Publication number
JPS58137048A
JPS58137048A JP1862382A JP1862382A JPS58137048A JP S58137048 A JPS58137048 A JP S58137048A JP 1862382 A JP1862382 A JP 1862382A JP 1862382 A JP1862382 A JP 1862382A JP S58137048 A JPS58137048 A JP S58137048A
Authority
JP
Japan
Prior art keywords
instruction
address
branch
prefetch
information
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
JP1862382A
Other languages
Japanese (ja)
Inventor
Mitsuo Ouchi
大内 光郎
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.)
NEC Corp
Original Assignee
NEC Corp
Nippon Electric 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 NEC Corp, Nippon Electric Co Ltd filed Critical NEC Corp
Priority to JP1862382A priority Critical patent/JPS58137048A/en
Publication of JPS58137048A publication Critical patent/JPS58137048A/en
Pending 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
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3802Instruction prefetching
    • G06F9/3804Instruction prefetching for branches, e.g. hedging, branch folding

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Advance Control (AREA)
  • Executing Machine-Instructions (AREA)

Abstract

PURPOSE:To improve the performance of information processing remarkably, by changing the memory address of an instruction to be prefetched in response to the prefetch address information. CONSTITUTION:When the instruction of an instruction register 9 inputted at an instruction decoder 10 is interpreted other than the address instruction with a discrimination bit 1 of an instruction code, a signal line 29 is set off and an instruction buffer 3 is renewed with a signal line 24. In case of a prefetch address designation instruction, the signal line 29 is set on, and the prefetch address information and branch success/failure information are given to prefetch discrimination section 12. The section 12 compares the information 2 with the success/failure of branch due to execution and transmits a signal being set on when coincident and off when dissident to signal lines 27, 28. Thus, the memory address of the instruction to be prefetched is changed in response to the prefetch address information.

Description

【発明の詳細な説明】 この発明は情報処理4fc#に於ける分岐命令の制御方
式に関するものである。
DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a control system for branch instructions in information processing 4fc#.

一般に情報処4fi、*のプロセッサは仄の4つのステ
ップ(命令によっては+2) 、 +4)が抜ける場合
もある)を繰り返すことによってプログラムを実行する
In general, an information processor 4fi, * processor executes a program by repeating the remaining four steps (+2), +4) may be omitted depending on the instruction).

+1)  メモリから次の命令をフェッチする(2) 
 オペランドを続出す (3)命令を実行する (4)結果を書き込む 従来のプロセッサの実行7−ケンスとして次の2つがあ
った。第1はこれらのステップを順次直列に実行するも
ので、第2はメモリからより多くの連続した命令を7エ
ツチし、命令バッファと呼ばれる先取り専用の内部凡人
Mに格納し、順次これを実行するものである。alの方
法の場合、現在実行中の命令が完全に終了した後に次の
命令をメモリからフェッチするのに対し、第2の方法の
場合は、前の命令の実行後プログラムメモリをアクセス
することなくただちにすでに命令バッファに格納されて
いる命令を実行できるため、フェッチに要する時間を大
幅に短縮することができる。
+1) Fetch the next instruction from memory (2)
(3) Execute an instruction (4) Write a result There are two types of conventional processor execution steps: (3) execute an instruction one after another; and (4) write a result. The first is to execute these steps in series, and the second is to fetch 7 more consecutive instructions from memory, store them in an internal memory dedicated to prefetching called an instruction buffer, and execute them sequentially. It is something. In the case of method al, the next instruction is fetched from memory after the currently executing instruction is completely completed, whereas in the case of the second method, the next instruction is fetched from memory after the execution of the previous instruction without accessing the program memory. Since the instructions already stored in the instruction buffer can be executed immediately, the time required for fetching can be significantly reduced.

しかし1.ig2の方法の場合に於いて、命令を実行す
る流れを変更する分岐岐令を実行する際には、命令バッ
ファに蓄えておいた分岐命令より後の後続する命令スト
リームを全て無効とし、分岐先アドレスから新たに命令
をフェッチしなおさなければiらない。ま九、命令のオ
ペランドを演算し、その結果によって分岐の成功、不成
功を決定する条件付き分岐命令は特にその先行制御が難
かしい。
But 1. In the case of method ig2, when executing a branch instruction that changes the flow of instruction execution, all subsequent instruction streams after the branch instruction stored in the instruction buffer are invalidated, and the branch destination is There is no need to fetch a new instruction from the address. Furthermore, it is particularly difficult to control in advance conditional branch instructions that operate on the operands of an instruction and determine whether or not the branch is successful or unsuccessful based on the result.

上記の欠点を屯服するために従来の技術では、命令の先
取り用に2個以上の命令バッファと、その制御回路及び
分岐命令の検出回路を設けることによって分岐命令以後
の先取りに効果的に対処する方式が考えられている。す
なわち、命令を先取りし九時点でその命令が分岐命令か
否かを検出し、無条件分岐命令ならば分岐先アドレスを
計算し、そのアドレスから引き続き先取りを行ない、条
件付き分岐命令の場合には、分岐の成功、不成功の両方
の場合を考慮して、それぞれ分岐先アドレスからの先取
りすなわち副命令ストリーム及び分岐しない場合の先取
りすなわち主命令ストリームを並行して2つの命令バッ
ファに取り込むように行なうものである。従って、実際
に条件付き分岐命令を実行する際には、分岐の成功、不
成功によって2つの命令ストIJ−ムのうち一方を選択
し、以後の実行をそのストリームで行なうことになる。
In order to overcome the above-mentioned drawbacks, in the conventional technology, two or more instruction buffers for prefetching instructions, a control circuit thereof, and a detection circuit for branch instructions are provided, thereby effectively dealing with prefetching after a branch instruction. A method is being considered. That is, it prefetches an instruction, detects whether the instruction is a branch instruction at point 9, calculates the branch destination address if it is an unconditional branch instruction, and continues prefetching from that address. , taking both cases of branch success and failure into account, the prefetch from the branch destination address, i.e., the sub-instruction stream, and the prefetch in the case of no branch, i.e., the main instruction stream, are carried out in parallel into two instruction buffers. It is something. Therefore, when actually executing a conditional branch instruction, one of the two instruction streams is selected depending on whether the branch is successful or unsuccessful, and subsequent execution is performed using that stream.

゛この方式は同時に何命令も並列【処理するいわゆるパ
イプライン制御方式とあわせて、高速な処理を要求され
る大型計算機に用いられることが多いが、パイプライン
処理では並列実行を行なうために分岐命令実行後に実行
されなければならない主命令ストリームまでもが分岐成
功によって全て無効化されてしまうため、分岐先の命令
から再実行しなければならないという欠点があった。
゛This method is often used in large computers that require high-speed processing, along with the so-called pipeline control method that processes many instructions in parallel. Since even the main instruction stream that must be executed after execution is completely invalidated by a successful branch, there is a drawback that the instruction must be re-executed from the branch destination instruction.

本発明の目的は分岐命令による副ストリームを実行する
場合であってもその副ストリームの実行後には実行すべ
き主ストリームへ高速に復涜できる分岐命令制御方式を
提供することにめシ、先取りする命令のメモリ・アドレ
スが、分岐しない場合すなわち通常のアドレスかあるい
は分岐先アドレスかを指定する先取りアドレス情報を命
令コード内に保有する分岐命令がセットされたメモリを
有し、前記先取シアドレス情報に応じて先取プすべき命
令の)モリ・アドレスを変更可能とするようにしたもの
であり、これによりて分岐による主命令ストリームの先
取9分の無効化を効果的に防ぎ、分岐命令実行以後の主
命令ストリームの再フェツチあるいは再実行に要する時
間を短縮し、分岐処理後連続して主命令ストリームの続
きを実行でき、情報処理の性能を大幅に向上できるよう
にした分岐命令制御方式を得ることができる0次に本発
明の一実施例について図面を用いて詳細に説明する。第
1図は命令語形疵を示す命令コード図、第2図は本発明
の一実施例である命令バッファを一つだけ用いた処理装
置の概略でブロック図、第3図(al)はループを含む
プロゲラ五例を示すフロー図、第3図(b)はそのプロ
グラムを実行した時の先取りの様子を示す7a−図であ
る。
An object of the present invention is to provide a branch instruction control method that can quickly return to the main stream to be executed after execution of the sub-stream even when executing a sub-stream by a branch instruction. If the memory address of the instruction does not branch, that is, whether it is a normal address or a branch destination address, the memory has a memory set with a branch instruction that has prefetch address information in the instruction code, and the prefetch address information This makes it possible to change the memory address (of the instruction to be preempted accordingly), which effectively prevents the invalidation of the preempted 9 minutes of the main instruction stream due to a branch, and To obtain a branch instruction control method capable of shortening the time required for re-fetching or re-executing a main instruction stream, allowing the continuation of the main instruction stream to be executed continuously after branch processing, and greatly improving information processing performance. An embodiment of the present invention that can perform the following will be described in detail with reference to the drawings. Fig. 1 is an instruction code diagram showing instruction word format defects, Fig. 2 is a schematic block diagram of a processing device using only one instruction buffer, which is an embodiment of the present invention, and Fig. 3 (al) shows a loop. FIG. 3(b) is a flowchart showing five examples of progera programs including FIG. 3(b), and FIG.

第1図に於いて、メモリにセットされる命令語は命令コ
ード部及びオペランド部から構成されており、命令コー
ド部内には先取シアドレスを指定する命令か否かを示す
判別ピッ)1%及び先取シアドレスが分岐しない場合の
アドレスかあるいは分岐先アドレスかを指定するための
ビット2金保有していることを示す。第2図に於いて、
3は命令バッファ、4及び11はオペランド演算部、5
は検出回路、6は先取9アドレス#lJ#回路、7は7
)’レス待避、−(ッファ、8は先取少命令レジスタ、
9は命令レジスタ、10は命令デコーダ、12は先取多
判定回路% 13は先取〕アドレスレジスタ、14から
23はバス、24から32は制御信号線である。
In FIG. 1, the instruction word set in the memory consists of an instruction code part and an operand part, and the instruction code part contains a discrimination pin (1%) and 1% (1%) indicating whether or not the instruction specifies a preemptive sea address. Indicates that 2 bits are held for specifying whether the preemptive address is an address in case no branch is taken or a branch destination address. In Figure 2,
3 is an instruction buffer, 4 and 11 are operand calculation units, 5
is the detection circuit, 6 is the pre-emption 9 address #lJ# circuit, 7 is 7
)'res save, -(ffa, 8 is pre-emption small instruction register,
9 is an instruction register, 10 is an instruction decoder, 12 is a preemption determination circuit, 13 is a prefetch address register, 14 to 23 are buses, and 24 to 32 are control signal lines.

命令コード内の判別ビットlは先取)アドレス指定命令
の場合は111%その他の命令の場合は101である。
The determination bit l in the instruction code is 111 for a preemption addressing instruction and 101 for other instructions.

また、判別ビット2は、先取りアドレスの指定が分岐先
ならば111、通常のアドレスならばa □ Iである
Further, determination bit 2 is 111 if the prefetch address designation is a branch destination, and is a □ I if it is a normal address.

メモリよプパス16を介して先取9命令を先取9命令レ
ジスアドレス指定分岐命令か否かを、判別ピッ)1を参
照して検出回路5で検出する。もし検出されれば分岐先
アドレスをオペランド演算部4にて計算してパス18へ
転送し、1+、通常の先4L#)アドレスを保持し九先
取9アドレスレジスタ13からその内容をバス17を介
して転送し。
The detection circuit 5 detects whether or not the prefetched 9 instructions are register address specified branch instructions via the memory path 16, with reference to determination pin 1. If detected, the branch destination address is calculated by the operand calculation unit 4 and transferred to the path 18, the 1+, normal destination 4L#) address is held, and its contents are transferred from the 9 first 9 address register 13 via the bus 17. and forward it.

それぞれを先取9アドレス制御回路6に入力する。Each of these is input to the pre-emption nine address control circuit 6.

さらに検出回路5より先取りアドレス指定命令か否かの
情報l及び先取9指定が分岐先かあるいは通常のアドレ
スかを判別する先取りアドレス情報2をそれぞれ信号線
25.26を介して先取シアドレス制御回路6に入力す
る。この先取りアドレス制御回路6では、信号IIIz
sがOFF、すなわち先取9アドレス指定命令ではなか
った場合には、バス17より入力された前の先取りアド
レスをインクリメントしてバス14.15に出力する。
Furthermore, the detection circuit 5 sends information 1 indicating whether or not it is a prefetch address designation command and prefetch address information 2 that determines whether the prefetch 9 designation is a branch destination or a normal address to the prefetch address control circuit via signal lines 25 and 26, respectively. Enter 6. In this prefetch address control circuit 6, the signal IIIz
If s is OFF, that is, it is not a pre-fetch 9 address designation command, the previous pre-fetch address input from bus 17 is incremented and output to bus 14.15.

信号線25.26が共KON、すなわち、先取りアドレ
スI指定命令でかつ先取)アドレス情報2が分岐先なら
ばバス14.15にバス18よシ入力した分岐先アドレ
スを出力し、同時にバス17よ〕入力した通常の先取9
アドレスをバス23を介してアドレス待避バッファ7に
待避しておく◎信号線25がONで、信号線26がOF
F、すなわち、先取りアドレス指定命令でかつ先取9ア
ドレス情報2が通常の先取りアドレスならば、前述し九
信号線26がONの場合とは逆に、バス14゜15にバ
ス17より入力した通常の先取りアドレスを出力し、同
時にバス18より入力した分岐先7YVスfAス23を
介してアドレス待避バッファ7に待避しておく。この様
にして先取シアドレス制御回路6より出力された先取り
アドレスは、/(Jl 5を介して先取りアドレスレジ
スタ13にラッチされ、またバス14を介してメモリを
アクセスし、それによって読み出された次の先堆り命令
をバス16を介して先取り命令レジスタ8に7エツチす
る◎この際、先取りアドレスレジスタ8にフェッチされ
ていた前の命令の内容はバス19を介して命令バッファ
3に格納される。
If the signal lines 25 and 26 are both KON, that is, the prefetch address I designation instruction and the prefetch address information 2 is the branch destination, the branch destination address input from the bus 18 is output to the bus 14 and 15, and at the same time, the branch destination address input from the bus 18 is output to the bus 14 and 15. ]Entered normal pre-emption 9
Save the address in the address save buffer 7 via the bus 23 ◎Signal line 25 is ON and signal line 26 is OFF
F, that is, if it is a prefetch address designation command and the prefetch 9 address information 2 is a normal prefetch address, contrary to the case where the 9 signal line 26 is ON, the normal data input from the bus 17 to buses 14 and 15 is The prefetched address is output and saved in the address save buffer 7 via the branch destination 7YV bus 23 input from the bus 18 at the same time. The prefetch address output from the prefetch address control circuit 6 in this manner is latched into the prefetch address register 13 via / The next prefetch instruction is fetched into the prefetch instruction register 8 via the bus 16. At this time, the contents of the previous instruction fetched into the prefetch address register 8 are stored into the instruction buffer 3 via the bus 19. Ru.

以上の先取りは、命令バッファが満杯になるまでは連続
的に行なわれ、満杯になると命令バッファ3よりAxz
xを介して命令レジス/9に出力されるごとにこの失地
]゛が1回づつ行なわれる。
The above prefetching is performed continuously until the instruction buffer is full, and when it is full, Axz is read from the instruction buffer 3.
This loss of place is performed once every time the instruction is output to the instruction register/9 via x.

次に命令レジスタ9にラッチされた命令が実行され九場
合の動作について説明する。まず命令デコーダlOに於
いて、バス22を介して入力された命令レジスタ9の命
令が命令コードの判定ビットlによって先取りアドレス
指定命令以外であると解読され九場合は信号線29がO
F、Fとなシ、これによって通常の先取りを続行するこ
とを信号線32を介して先取りアドレス制御回路6に知
ら、せ、信号線24を介して命令バッフ・ア3の更新を
行なう。解読の結果、先取りアドレス指定命令であり九
場合には、信号線29がONとなり、先取りアドレス情
報2が信号線30を介して、またオベフ/ド演算部11
によって判断された分岐の成功、不成功の情報が信号線
31を介して先取9判定部12に入力される。先取9判
定部12では信号線29,30.31の情報を受けて指
定があったこ′とを信号線33.34に出力し、先取り
アドレス情報2と、実行による分岐の成功、不成功とを
比較し、一致していればOFF、不一致ならばONとす
る信号を信号線27.28に出力する。
Next, the operation when the instruction latched in the instruction register 9 is executed will be described. First, in the instruction decoder lO, if the instruction in the instruction register 9 input via the bus 22 is decoded as other than a prefetch address designation instruction by the judgment bit l of the instruction code, the signal line 29 is
F, F, this notifies the prefetch address control circuit 6 via the signal line 32 that normal prefetching is to be continued, and updates the instruction buffer 3 via the signal line 24. As a result of the decoding, if it is a prefetch address designation command, the signal line 29 is turned ON, and the prefetch address information 2 is transmitted via the signal line 30 to the obef/de arithmetic unit 11.
Information on whether the branch is successful or unsuccessful is input to the pre-emption 9 determination unit 12 via the signal line 31. The preemption 9 determination unit 12 receives the information on the signal lines 29, 30.31, outputs the fact that there is a specification to the signal line 33.34, and outputs the preemption address information 2 and the success or failure of the execution branch. A signal is output to the signal lines 27 and 28 to turn the signals OFF and OFF if they match, and to turn ON if they do not match.

信号線2BがONならば命令バッファ3は指定による先
取りが失敗したことを知り、貯えておいた命令ストリー
ムを全て無効とする。この場合同時に信号線27もON
であり%これを受けて先取りアドレス制御回路6はアド
レス待避バッファ7に待避しておいたアドレスをバッフ
ァ14.15に出力し新たに命令バッファ3の再充填を
始める。
If the signal line 2B is ON, the instruction buffer 3 knows that the specified prefetch has failed, and invalidates all stored instruction streams. In this case, signal line 27 is also turned on at the same time.
In response to this, the prefetch address control circuit 6 outputs the address saved in the address save buffer 7 to the buffer 14.15, and starts refilling the instruction buffer 3 anew.

上記の動作を、同じ処理を固定回路教練り返し実行する
ループを含むプログラムを例に説明する。
The above operation will be explained using an example of a program including a loop that repeatedly executes the same process in a fixed circuit.

ループを含むプログラムフローの一例を第3図(a)に
示す◇プログラムの流れは100,101番地の命令を
実行後、102,103,104番地の命令をある定数
N回縁9返した後、105,106番地を実行するもの
である。104番地の命令(LOOP  102)は厳
初から(N−1)回までの実行では102番地への分岐
を成功させ、N回目の実行で分岐を不成功にし、さらに
、先取りアドレスを102番地に指定する命令である。
An example of a program flow including a loop is shown in Fig. 3 (a). ◇The program flow is as follows: After executing the instructions at addresses 100 and 101, after returning the instructions at addresses 102, 103, and 104 for a constant N times, 105 and 106 are executed. The instruction at address 104 (LOOP 102) makes the branch to address 102 successful in the first (N-1) executions, makes the branch unsuccessful in the Nth execution, and sets the prefetch address to address 102. This is an instruction to specify.

この命令が先取り命令レジスタ8に先取シされた際、先
取シアドレス指定命令であることが検出され、先取りア
ドレスを102番地にして以後の先取りを行ない、待避
アドレスを105番地としてアドレス待避バッファ7に
待避する0(LOOP  102)以後の先取シは先取
9アドレスが分岐先に指定されているため常に102番
地から行なわれる◇この先取りの様子を第3図+b)に
示す。命令(LOOP102〕のN回の実行のうち最後
の1回のみ先*aした命令ストリームを無効にし、アド
レス待避バッファ7に待避しておいたアドレス105を
参照して命令バッファの再充填を105番地の命令より
行なうことになるが、(N−1)回は先取)を指定した
ことによって高速に処理が行なわれる。
When this instruction is prefetched into the prefetch instruction register 8, it is detected that it is a prefetch address designation instruction, and the prefetch address is set to address 102 for subsequent prefetching, and the save address is set to address 105 and stored in the address save buffer 7. The prefetch after 0 (LOOP 102) to be saved is always performed from address 102 because the prefetch 9 address is specified as the branch destination. This prefetch is shown in FIG. 3+b). Out of the N executions of the instruction (LOOP102), only the last instruction stream *a is invalidated, and the instruction buffer is refilled at address 105 by referring to the address 105 saved in the address save buffer 7. However, by specifying (preemption (N-1) times), processing is performed at high speed.

上で述べた(LOOP)のように命令の性格上分岐する
確率の高いことが判明している場合は、処理の種類によ
らず先取)アドレスを分岐先に指定すればよい。また、
一般の条件付き分岐命令、例えば中ヤリ−・クラブをみ
て、それがI 1 gならば分岐するというような命令
の場合は、処理の種類によって分岐する確率が高いか低
いかが異なるため、その確率によって先取)アドレスを
分岐先にするか通常のアドレスにするかを決定すればよ
いO 以上の実施例は命令バッファを一つだけ用いたものであ
るが、命令バッファを2個以上用いたパイプライン地理
装置に於いても、本発明によれば、主命令ス) IJ−
ム上に存在する分岐命令の実行によって、副命令ストリ
ームに分岐する確率が減少し、それに伴りて分岐命令以
後の予め先取シされていた主命令×ドリームが全て無効
化される確率も減少することは明らかである。□ 以上の説明から明らかなように1本発明によって、分岐
が成功するか否かの確率が事前に判明している場合に一
分岐命令以後の命令ストリームの無効化を効果的に防ぐ
ことが可能であり、これによって情報処理装置の性能を
大幅に改善す名ことができる。
If it is known that there is a high probability of branching due to the nature of the instruction, such as (LOOP) mentioned above, the preemption address may be designated as the branch destination regardless of the type of processing. Also,
In the case of a general conditional branch instruction, for example, an instruction that branches if it is I 1 g, the probability of branching is high or low depending on the type of processing, so the probability All you have to do is decide whether to use the preemption address as a branch destination or a normal address.The above example uses only one instruction buffer, but a pipeline using two or more instruction buffers can be used. According to the present invention, even in a geographical device, the main commands) IJ-
By executing a branch instruction existing on the stream, the probability of branching to the sub-instruction stream decreases, and accordingly, the probability that all pre-empted main instructions x dreams after the branch instruction will be invalidated also decreases. That is clear. □ As is clear from the above explanation, according to the present invention, it is possible to effectively prevent invalidation of the instruction stream after one branch instruction when the probability of whether or not a branch will succeed is known in advance. This can greatly improve the performance of information processing devices.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は命令語形式を示す図、第2図は本発明の実施例
を示すブロック図、第3図1)はループを含むプログラ
ム例を示すフロー図、第3図1b)は先取りの様子を示
すフロー図である。 1・・・・・・先取りアドレス指定命令判別ビット、2
・・・・・・先取炉アドレス指定ビット、3・・°・・
・命令バッファ1.4.11・・・・・・オペランド演
算部、5・・・・・・検出回路、6・・・・・・先取シ
アドレス制御回路、7・・・・・・テドレス待避レジス
タ、8・・・・・・先取り命令レジスタ、9・・・・・
・命令レジスタ、10・・・・・・命令デコーダ、12
・・?・・・先取プ判定回路、13・・・・・・先取り
アドレスレジスタ。 第 1 凶 命令コーF# 才XランF# 05 1ρδ 會 手続補正書(自発) 57.6−3 昭和  年  月  日 特許庁長官 殿 1、事件の表示   昭和S7年特 許願第1862:
1号2、発明の名称   分岐命令制御方式3、補正を
する者 事件との関係       出 願 人東京都港区芝五
丁目33番1号 4、代理人 〒108  東京都港区芝五丁目37番8号 住友三田
ビル日本電気株式会社内 (6591)  弁理士 内 原   1電話東京(0
3)456−3111 (大代表)(連絡先 日本電気
株式会社特許部) 明細書の「発明の詳細な説明」の欄 6、補正の内容 イ)明細書画1頁10行目の「解説」を「解読」に訂正
する。 口)明細書第4頁13乃至15行目の「による・・・・
・・・・・復帰」を「以後の命令先取りを行なう場合の
主ストリームあるいは副ストリームの選択を効果的に行
なうことが」に訂正する。
Fig. 1 is a diagram showing the instruction word format, Fig. 2 is a block diagram showing an embodiment of the present invention, Fig. 3 1) is a flow diagram showing a program example including a loop, and Fig. 3 1b) is a state of prefetching. FIG. 1... Prefetch address specification instruction determination bit, 2
...Preemptive furnace address specification bit, 3...°...
・Instruction buffer 1.4.11...Operand calculation unit, 5...Detection circuit, 6...Preemptive seat address control circuit, 7...Tedless save Register, 8... Prefetch instruction register, 9...
・Instruction register, 10...Instruction decoder, 12
...? . . . Preemption determination circuit, 13 . . . Preemption address register. No. 1 Bad Order Cor F# Saix Run F# 05 1ρδ Amendment of Meeting Procedures (Voluntary) 57.6-3 Showa Year Month Date Commissioner of the Japan Patent Office 1, Indication of the Case 1939 Patent Application No. 1862:
No. 1, No. 2, Title of the invention: Branch instruction control method 3, Relationship with the amended person case Applicant: 5-33-1-4, Shiba 5-chome, Minato-ku, Tokyo, Agent: 5-37 Shiba, Minato-ku, Tokyo 108 No. 8 Sumitomo Sanda Building NEC Corporation (6591) Patent Attorney Uchihara 1 Telephone Tokyo (0
3) 456-3111 (Main representative) (Contact information: NEC Corporation Patent Department) Contents of amendment in column 6 of "Detailed explanation of the invention" of the specification a) "Explanation" on page 1, line 10 of the specification Correct to "decipher". (Example) Page 4 of the specification, lines 13 to 15, ``According to...''
. . . "Return" is corrected to "It is possible to effectively select the main stream or sub stream when prefetching future instructions."

Claims (1)

【特許請求の範囲】[Claims] 先取りして読みだした後に処理を行なうように構成さn
た情報処理装置−において、先取りする命令のメモリ・
アドレスが分岐しない場合のアドレスかあるいは分岐先
アドレスかを指定する先取りアドレス情報を有する分岐
命令を解説して、前記先取りアドレス情報に応じて先取
りすべき命令のメモリーアドレスを変更可能にすること
を特徴とする分岐命令制御方式。
It is configured to perform processing after reading in advance.
In an information processing device, the memory of the instruction to be prefetched
A branch instruction having prefetch address information that specifies whether the address is an address when no branch is taken or a branch destination address is explained, and the memory address of the instruction to be prefetched can be changed according to the prefetch address information. A branch instruction control method.
JP1862382A 1982-02-08 1982-02-08 Branch instruction control system Pending JPS58137048A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP1862382A JPS58137048A (en) 1982-02-08 1982-02-08 Branch instruction control system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP1862382A JPS58137048A (en) 1982-02-08 1982-02-08 Branch instruction control system

Publications (1)

Publication Number Publication Date
JPS58137048A true JPS58137048A (en) 1983-08-15

Family

ID=11976744

Family Applications (1)

Application Number Title Priority Date Filing Date
JP1862382A Pending JPS58137048A (en) 1982-02-08 1982-02-08 Branch instruction control system

Country Status (1)

Country Link
JP (1) JPS58137048A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6290725A (en) * 1985-10-16 1987-04-25 Fuji Electric Co Ltd Crt display system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5081040A (en) * 1973-11-15 1975-07-01
JPS5222841A (en) * 1975-08-15 1977-02-21 Hitachi Ltd Micro program control method
JPS5566028A (en) * 1978-11-10 1980-05-19 Nec Corp Information processing unit
JPS5663651A (en) * 1979-10-26 1981-05-30 Nec Corp Program control unit

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5081040A (en) * 1973-11-15 1975-07-01
JPS5222841A (en) * 1975-08-15 1977-02-21 Hitachi Ltd Micro program control method
JPS5566028A (en) * 1978-11-10 1980-05-19 Nec Corp Information processing unit
JPS5663651A (en) * 1979-10-26 1981-05-30 Nec Corp Program control unit

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6290725A (en) * 1985-10-16 1987-04-25 Fuji Electric Co Ltd Crt display system
JPH0426490B2 (en) * 1985-10-16 1992-05-07 Fuji Denki Kk

Similar Documents

Publication Publication Date Title
US4477872A (en) Decode history table for conditional branch instructions
JP3794917B2 (en) Branch selectors associated with byte ranges in the instruction cache to quickly identify branch predictions
US6553488B2 (en) Method and apparatus for branch prediction using first and second level branch prediction tables
US4200927A (en) Multi-instruction stream branch processing mechanism
JP2640454B2 (en) Digital instruction processor controller and method for executing a branch in one cycle
US4827402A (en) Branch advanced control apparatus for advanced control of a branch instruction in a data processing system
US4775927A (en) Processor including fetch operation for branch instruction with control tag
US6081887A (en) System for passing an index value with each prediction in forward direction to enable truth predictor to associate truth value with particular branch instruction
JPS6125169B2 (en)
US5146570A (en) System executing branch-with-execute instruction resulting in next successive instruction being execute while specified target instruction is prefetched for following execution
JP2001527233A (en) Branch prediction using return select bits to classify the type of branch prediction
US3553655A (en) Short forward conditional skip hardware
US20040172518A1 (en) Information processing unit and information processing method
US4812970A (en) Microprogram control system
CA2060137C (en) Circuit for executing conditional branch instructions in pipeline process
US4870567A (en) Microprogram control system
US6978361B2 (en) Effectively infinite branch prediction table mechanism
JPS58137048A (en) Branch instruction control system
KR920008142B1 (en) Microprogram processor
US20020169945A1 (en) Microprocessor
JP2772100B2 (en) Parallel instruction fetch mechanism
JPH04245334A (en) Instruction prereading control system for information processor
JPH01263830A (en) Information processor
EP0101759B1 (en) Data processing system having branch instruction prefetching performance
US6289439B1 (en) Method, device and microprocessor for performing an XOR clear without executing an XOR instruction