JPS58165154A - Instruction execution system of data processing device - Google Patents

Abstract

PURPOSE:To facilitate procedure for changing a tag and to economize memory, by generating a new tag each time a procedure is called, and adding this tag to an operand in the procedure. CONSTITUTION:Each time a procedure is called, a new tag is generated in a data flow type processing device and is added to an operand. A dynamic address constituted by combining tags, which distinguish procedures operated in parallel from one another, and the destination of the instruction of the succeeding procedure to be executed is defined as the first operand. Tags in the first operand are added to the value of the second operand which is set independently, and the destination in the dynamic address is sent. Tags are handled as data, and the original tag is changed to the new tag, and data is sent to the called-side procedure. Since return information including the original tag is processed as data on the basis of the new tag, it is unnecessary to store the original tag.

Description

DETAILED DESCRIPTION OF THE INVENTION (1) Technique of the Invention Generates a new round tag every time a glossary that indicates the functional information of an instruction is called in a data processing device of the 70-type. This relates to an instruction execution method that enables parallel processing of Glossia, by adding it to operands used in the procedure, returning to the original state, and adding the original tag.

(2) Prior art and viewing points In the conventional data 70-type data processing device, the #r9 tag is usually added to the 9th part of the parallel area of the 4th procedure every time the procedure is called. The process Jll has been carried out, and the original glossyiae has been changed to IIgl# so that a tag of 9 o'clock is attached. A form of this form is ``Data 7a-Calculation dD''POl-System''(Information@l&Field Society, Computer Architecture Air Study Group 42.1. Member in January 1981*). The threshold of this format is return information 11
O out, return) address.

In other words, use the glosigie air om*o address (destination) as the operand O value, and enter
□Ah, Yu, Eh. -7, -a, 1e1・) Store the given awareness O/〆 in the tag conversion memory and convert it to the original procedure K<[I! Then, take out the tag conversion memory KToru 07 and change the tag O.
We are doing a replacement. In this case, the tag conversion method may be complicated, and the operation to extract the tag is complicated, and the large size of one cell of the tag conversion memory requires a bit width of 11 ridges of the tag, so the tag conversion memory The purpose of the present invention is to use a data flow type data sensitive layer device to include a tag in the Glossy Air O return information, so that the tag can be replaced. It is an object of the present invention to provide nine data processing instructions and an instruction execution method, which facilitates the procedures associated with the invention and reduces its memory area.

<4) *ttsotmtt To achieve the above purpose, the instruction execution method of the data sensitive layer device of the present invention is to execute the instruction O in the data processor type data processing device.
A four-dimensional system that indicates a functional collection is called, generates a new tag, attaches it to the operand used in the glossary, returns to the original state, and adds the original tag at 9:00. In the 9-instruction execution method, it is possible to control the profsair in parallel, and the grossiji tools are operated in parallel.
Tags that distinguish each and O in Glossigea to be executed next
The destination address, which is a combination of the destinations of the instructions, is the value of the first operand, and the tag in the operand of the first operand is set separately and added to the value of the first operand, which is then sent to the destination of the target address. The problem lies in the fact that a means for executing nine instructions is provided, and the tags are treated sequentially as data to perform conversion between old and new MegO.

(~ departure - O 夷總例 J11 Figure shows the configuration of the embodiment of this IA beak, and shows an example of the data flow data escape m1ll placement. shows.

In the data type, the procedure is advanced by an instruction having an operand and an operand, and the result of the previous procedure is inputted as an argument to the next procedure, and the electric field is advanced in sequence. In this case, it is possible to perform parallel processing by waiting for a plurality of procedures using the same command), and control for returning to the original procedure is performed for each procedure.

In the same figure, the arithmetic unit (PUII) 1ot is operated by the glossier super unit 104 after the PUII is started.
Part 67) Data with the structure of 102Kamourei2i1gI■
receive> and decipher its opcode.

When the obecoder 5' is rOUTPUTJ O, the operand 0 of the data ■ is outputted to the output unit 10iSK. Otherwise, 0 o'clock is data ■ operand 1. Perform using operand 0
L, JIIzmKshowt#Jlkof-p@tcht part 1
Transfer to 02. The CAF unit 102 writes the instruction memo 'J (IM) 105. according to the procedure described below. Operanto Mechiri (OM) 104. The data ■ is set using the respective content data ■, Q, and @ (FIG. 2) in the memory (CM) 107 and sent to the PU unit 101. If Glossia is called by the multiplication table, it searches the tag memo 111 from the PU unit 101, and sets the address of the unused cell to a new tag, that is, the function fI! It is taken out as A Chokkogo (abbreviated as Kamo). This new tag will be assigned to the operands used in the newly called Pussy Shigea.

In the present invention, apart from the instruction memory (IM) 105 and the operand memory (OM) 104, the same instruction 0M104K stores the LpH control function and multiple intermittent O wait operands. OM 104 is Denita's Ml as shown in Figure 2 Φ.
) K The address to be searched next is 0M-1, and the address of the CM is exemplified. After first specifying and searching the operand 310M104 from the KIM 105 using the pointer, the end address is traced to search the operands stored in a chain, and the 9th operand is found through the tag's power. Tag memory 111 It is sufficient to have a cell for distinguishing between KFi used and unused, and it is sufficient that there is only a cell necessary for distinguishing between a plurality of procedures in which parallel processing is performed. Data human power 11108a each message IM 105.0M104.0
M107 O Used for internal power installation.

In the above configuration, as the C&Fill 102O horizontal function, the operation in the next Of-order is displayed in the row i.

:.

C&F1g102 receives f'-data from PUijlOl] and finds the cell of pair 2 1M105 from the destination in data.

(l) When the opcode in the cell is an instruction that requires one operand.

If the opcode is "aonata%t", the cell (happy 2
Extract the contents of 0M107 from the CMO address in wJ@) and put the value in operand 0 of data ■.

When the operation code is other than "00% eta%#", put operand 0 of data (2) into operand 0 of data (2).

And for both of these 1 gold, the n of data ■ is the data ■
Insert the I of the data ■ and the opcode of the data ■.

Destination iron, operation code of cell ZMI05 for each destination.

The number of rows fS is entered one row ahead, and the data ■ is transferred to the PU unit 101.

(2)) When the operation in a cell is an instruction that requires two operands.

# According to the J statement O pointer, find the cell 0M106 containing the first waiting obesi and do from the address in the cell. Mom 1-That 0M104 cell and data ■a
If % is incorrect, find the OM cell with the next waiting operand o6 from the next 0M address that is issued from that 0M104 cell or rDIllI state IllCm. Thereafter, the waiting operands are searched one after another until a matching waiting operand is found.

(4) Furthermore, the operation code of the cell of IM ic'5 is rf
gmeJ, that is, when it is set to ``pass only Sohatsu's data''.

0) As described above, when there is no waiting operand in the data ■Oas.

data jI@ as e operand as data■OGt&e
Put "f--feeling" into operation O and operate data ■;
-Put it in the IM105O seven le openide 1 destination 1
Enter the destination in the opcode of the data■, the destination in the first row, and press P.
Data is transferred to U section 101.

Serious, -2@For 00M104D7 Put the data ■a duck*”/1 e operand in the cell, wait for the address pointing to that cell, and then find the address of the next OOM in the last cell of the chain of operands. In other words, it means adding the data ■ operand to the @ structure.

(1') When there is a data ■ mouse and an electric break, and a nine-wait operand.

To the address of the gray OM of the OMO cell pointing to the match in the cell 0M104, the -Kinshi 9 wait operand Oh40M
Assign the address of the next OM to cell otpo. This means removing the OM cell with the 9-wait operand from the chain structure. Then, the tag indicating that it is in use in the OM cell in which the wait operand is located is made unused.

(6) When the IM cell openid is "other than f-.0.

(1) Data in unused OMO cells ■Oas@'/
1 Insert the @ operand and assign the address pointing to that O*le to the address of the 0th order OOM in the last cell of the waiting operand @. This means adding a data operand to the chain structure.

(1) When the data matches Nishiki of 0 and the friend wait operand is 'h'.

0M104 with +O operand p by μ of cell O
Assign the operand of data 0 to operand 1, and assign the operand of data I to data 1 @
OO/l of p data ■ is assigned to operand 1. Assign data ■Oas to data ■OaS. Then, the operation code of the cell 1M105, the number of destinations one line ahead, is substituted into the operation code of the data ■, the number of destinations two lines ahead.

This data ■ is transferred to the PU section 101. Also, as mentioned above, an OMO with a single chain structure and a nine-wait operand
Remove the cell, then O cell 01! There is no flag indicating the use!
Make it J@.

The above data is provided by C&jF Department 102 Ri@癲■【TI&
9 shows Sennari, which is determined, but the most important feature of Honjitsu's age is the method of adding tagana rope %a and O to each of these 7a data. When Glossynia is called, the If memory 11 assigns the address of a cell that is not in use as @duck to a new operand flowing through the Glossynia, and indicates that the cell in the corresponding tag memory is in use (II !2 Figure 0). When the gauge share reaches 9, the - is cleared by making the cell 1 pointing to the tag memory 110 address O, which is represented by .asO, unused.

Therefore, since it is only necessary to store tag memo V01 cells for use and unvalued tags, the amount of storage may be small.

An intermediate method for attaching tags is, for example, when a new WII tag is attached when Glossyia is called, but when processing is finished and the tag returns to the original Glossygea, the method is to convert it to the original tag. It is. As mentioned above, in the conventional example, the original tag is stored in the tag conversion memory, so it is necessary to pull out the tag conversion memo. The area of the mesh becomes larger.

In contrast, in the present invention, the original tag is used as data for IgL
Then, send the original tag to the new glossary and send the return information, and when you send IK to the former Opu, use the original tag in the return information. is being carried out. Therefore, there is no need to remember the original O tag in the tag memory, and the area of the tag memory becomes smaller.

□, 1゜The rounding will be described later as a special operand, ``5aslJ, naeadJ, 1sra.''
dJ t "jarryJ, pfa#-" etc. are provided. Among these, ``sra hat'' is an instruction to break the original tag during vIi return IIO, and ``moth'' which can omit the tag conversion memory from the present invention is also an important opcode.

Figure 5 is a functional explanatory diagram of the main parts of the 11) embodiment, page 1.
This is a flowchart showing the relationship between the opcodes and opcodes used in the arithmetic unit (PU unit), and is a drawing that clearly explains the data of the original Glysis and the new procedures.

11411gl (g) to (-) are the main opcodes used in the present invention! This is a clear diagram.

In FIG. 3, the upper part calls for a 2-person 2-output 2-output 2-man power system. Inside each 1i110 is #111
The operation code shown is written as 夷-〇70-i11, and the destination (arrow) for both Urama is indicated by a dotted 74-stitch. The alphabetic characters inside the oval indicate the opcodes shown in Table 1, and the values entered from the left are operands 0. The value entered from the tomb is operand 1. 70-The Q mark at the trout branch is 411! "O・ν" shown in l
y'' indicates Toru, and the square frame indicates the same < rsasstas.

This 4511g1K "-゛% atas * J Hiroproshige 71111I Shikoku 1" ゛ S L knee-9 Indicates the address required. In the same figure) is "g'at" which contains the input argument.
aJ OIM address In, (It) calls ts
.

The result of OR is the address of gatgJ, that is, the return address, and (0 is the address of yatsJo, which contains the return address of the called device.

With the above settings, the calling side first inputs the argument 1゜2, and the first input ratio, for example, rs through argument 1, is input on the rfmm.
Trigger with epyJ, output "sa*t, J yoper tag m)" and output "i"s+ossm1" (4
), output p constant a, and put both outputs into ``meadJ.''

As shown in Figure 114(&)K, for "爲-・d", the new @mouse is obtained from the operand O, the IMO address, and 110 are obtained from the operant tree, and these two are combined and a new tag is attached, resulting in the 9th operand. can get. Koya・Result O゛Operand Operand 1, reference ml as operantro, cr*. r
ryJK 7,. )':・□"5arriJ is s4
As shown in the figure (-), data Φ is created using both of them as data. In this case, - is treated as operand 10 data and is called a dynamic address. As a result, this “a
The output of a data is not attached to the new tag, but the X in the dynamic address.
Sent to address M. Even if argument 2 is argument 1! It is the same as JL1's II gold.

In the escape to the next return address "maytex
tmtJ(2) obtains a dynamic address with new I as data, similar to "-0%a-61&-"■, and operand 1
as ("enter into amrry J." In contrast, "
The inertia enters the return address 5 as shown in the 4th II (C) K, and adds the element 0III & to generate a nine dynamic address. With this, the original opening was established in the desire for restoration.

This return information is input as operand 0 to ``-Hata vryJ.So0IiIIlk-...'' It is changed to the output of ``Axis r de V'' and is changed to ``Iao%a藷S感J(C)O. The above IM(t) address is transparent.
1□ How to get "Unagi Dede V" called! The operan 1', l:II is set to 1 through the "g number -" of the 111O1 pair, while the result is 1. *If the operands 0 and 1 are set for button 2, 1 will be entered.
Then, add Oje Oas @ in operand 1 and output Nine Bows 1 to the return address. Note that the result of 1iII is 1. Result 20 output is "-〇-"
As shown in figure (4) of ``fa@tJ'', a new tag (S phantom is released) is shown in Figure (4).

As explained above, in the present invention, a new tag (8 tags) is generated in addition to the various opcodes O, such as the normally used "ad autot l"ss & J e-tai" shown in Table 1. Mame0rsa*tJ Create a dynamic address that stores the new tag ``regret-adJ'', create a dynamic address that includes the original tag ``groove axis dJ'', and attach the tag to perform the replacement.
e@rryJ Release e and tag "faotJ"
O opcode is provided in Wft9. This) conventional
As such, it is not necessary to store the original tag in the tag conversion field, and it is sufficient to provide a cell to represent use and overlay.

Adding an operation and an operation execution means is relatively harmful, so it is difficult to simplify the overall configuration.

s5 diagrams (8) to (-) are WI4 bright- in nine cases by applying an example to the procedure flow diagram of ts3 diagram.

) is the sum of 2 pardons and 1.
This is the 70-diagram of addask J, and the same figure (6),
(This is a flow diagram of the - line multiplication process. Same figure (&)), which inputs with the original tag and outputs with the new tag. tpJ m (s) Hiroki itgo is called!
Ill's flow diagram results JIk1゜m1k2o pK2 Human power punishment and difference It is also 6, same 11 (4) IE) New tag glue 11 input power, and former O tag glue %A Outputs 9-US.

Oka-ichi) inputs the Ku-ku-series of the Gang-O-O tag. In other words, 111 between the same figure (&) and the same figure (s) O
The device with 0 is configured to perform a call to Oka 1) and perform ft radio wave calculations.

Each of the opeds shown in (b) to (-) in the same figure is marked with 〇 - above the shoulder and below - and 9 ** is the beginning of the beak, but this is because p1 is filled with each address. Data associated with the data is stored in the IM 1051tCIIk. Broom 22 shows these O contents, and the operation code O 櫨 kind 2 line ahead 1 line ahead 1-Q/le corresponds to 74- in 's5 diagram.
Destination 2.0/1. It shows the Cy110M node v x p and is used to refer to the above-mentioned O data and create data (2).

Table 5 shows the address and value of CM 107 in this glossy air.

Now, let the original tag be represented by (10), the new tag be represented by (20), and the 2-row ridge be S (toL 2 (10)),
l”yslsJ 11 and jysl*J 1 in the same figure (&)
Can't enter 2. First input in the same procedure as in Figure 45, and then output 2G (10) with the new tag as data at 19 via rfa・sensation 15 and 91M address and 1 address. is written in the square frame and 9[・
sag·stJ 20-25 are triggered via rgeptJ 14-18 at the output of “-·tJ1j!
MO1g1stsstJ flQ Since the OCMO address is 1, it may be 0M107 (1), the value of VXj (1,
0) and outputs (1,,'o)- with the tag )[. )・.

From jjosatgslJ 21 to the same 4A (2e O)
Circle, 2nd table from the same as above.
l”5radJ!Q, l”sggdJ!
! 1゜"5rsjJ J$2.rsaatlJ 3s
Enter. Enter "9-0 sense". ＝So0＠釆、``
There is a wire break tag in ms@dJ.

``In 5radJ, each original tag is imported into an operand as data.

Therefore, in "Shizu-ichi" 28, (zo, 1.o) (m %
r inertia-・d” 29, (20s2*J(10), “
For ty+radJ 30 (10,58°0) (10)
, "In maadJ 31 (20, LO) (1G),
l"5radJ tade(10,3?,0)(10),"
In 5aadJ 33, (20, 4° "duck-・d"28's output (20, 1, 0) (1G) and "gagsJll's output! (1G)" are "aarryJ input to 54, 1 original tag and new tag The assignment is changed, outputting 3 (20), and inputting this to "gag."1.

Similarly, “O・derν”! Output 2 (2G) from I5 and input it to "t1111#-"2. l”
5rsJ 50 O output pieces ■-11 ■ --- (10, 38, 0) (10) and "maadJ 51 O
Output (20,5,0) (10) Tohar gsrryJ
56K is input, the original tag and *IIO tag are exchanged, % (10, 58, 0) (20) is output, and this is
Enter agaJ 5K. M hates “agrryJ”
Output (10, 5?, 0) (20) from s7 and input this to "g8#-"4.

"gtbgaJ 1 O output 3 (20) and rum abuse-"
2's output 2 (20) - 11 ----- is "atldJ5 is 5 (20) s rushJ 4 is 1
(10) is divided into two parts, one is "--"
7 via ``I・o$J 10 new tags have been released and now,
On the other hand, ``atldJ5゜(・ Output 5 (2G) is ``gagaJ 0 output, (10,3
8, 0) (20) and input it to r*5rryJ 8, and input it to "gagaJ5B." In the same way, [aar
ryJ? Outputs 1 (1G) from "gatJ 59
Enter K. “gagaJ!!8 O output 5 (10)
and “IatsJ!?O output 1 (10)” and “5sJ14
0 and multiply, and the output 5 (1G) is "*stpw
4 J 42 yh b When outputting, "f・-
The former tag is released in 41.

(More than the effect of the coincidence II! As a friend, according to the present invention, the data processing device is in the form of a gastrointestinal tract, and the data processing device is used as a gastrointestinal device.
111m1 is provided to generate an ifr tag and add it to the operand used in Glossigea, and use an opcode to attach the original tag to a new tag, and send it to Prosigea 11 when it is called. After the return information including the tag is sent as data and processed by the inverter, the return information is attached to the original tag so that it can be restored.

? - Since the original tag is included in the O-bai pigeon house return information, there is no need to remember the original tag in the tag conversion memory each time, thus saving memory. The place of the present invention is to round off by providing a memory that indicates only the use/unuse of the """'j tag and an opcode of llK櫨 in iIF9,
Since this requires only 0 additions including the execution means, it can be expected that the overall scale of O1IM will be reduced.

4i111iO111 Simple explanation No. 11 is Motoya - composition of the example - Kango, Ue 2 figure ■ ~ is JIH figure of the example 7g - data O@@1m, *ima
-11 of the main part of the example is shown in Figure 314 (a) - (
The gradient is all of the main opcodes used in the book, 1
1511 (- to (-) apply the example to 1115-, and the Kubakai O theory @-), 101 in 1 is the arithmetic unit, 102 is the executable instruction check/extract unit, 106 is the output unit, and 104 is the group. E!
105 is an instruction message, 106 is an operand memory, 107 is a constant memory, 108 is a data input section, and 111 is a tag memory.

Patent applicant Fujitsu Limited Fukudaibajinbenbanshi　m＊　Zenju e　■　■　■　■.

Claims (2)

[Claims] (1) In a data flow type data processing device, a glossary indicating a functional system of instructions is called, and a new tag is generated and added to the operands to be ignored in the glossary, and the tag is In the instruction execution method that enables the parallel IA field of Glossiture by adding the original tag when returning, the tag that distinguishes each GlossiGeair that is being created in parallel and the ProsiGeair circle to be executed next are added. The dynamic address consisting of a combination of the destinations of the instructions is set as the first operand, and the tag in the gi operand is added directly to the separately set j12 operand, and sent to the destination in the dynamic address. A command execution method for a data evacuation device is characterized in that it is provided with a cylindrical execution means configured as above, and handles the tag as data and replaces the new tag with the original tag. (2) A means is provided to create a dynamic address by attaching the new tag generated when calling the above procedure and the destination of the command that uses the argument in the procedure, and the value of the 1m1e interruption and its dynamic Claim S4: The execution means executes an instruction having an address as an operand, and sends an argument to a predetermined destination of a called procedure.
1. Instruction execution method of Kizou's data escape device. (A means is provided to create a dynamic address by combining the return address of the value of the 9th procedure 1A Oll, which is called the current tag of #4, and sends this as an argument to the program manager). When returning the value, an instruction having the value and the target address as operands is executed (by the initiating/executing means) so that the calling state is delayed in the return layer. An instruction execution method for the data sensitive layer device described in item sIi1g1.