JPS584452A - Function type information processor - Google Patents

Abstract

PURPOSE:To shorten an access time during which the value of a large region variable is retrieved, by providing an associative buffer in addition to a main storage device. CONSTITUTION:For a function type information processor, the real subtracting number is connected to the tentative subtracting number of the functions F2 and F3 to be called by the structure of a program and the style of execution. The called function carries out a prescribed procedure with reference to the transferred real subtracting number and a large region variable and sends the function value back to the calling side to perform a process of information. An associative buffer is provided in addition to a main storage device. Then a variable is registered to the associative buffer in case the first access is given to a certain large region variable. Thus the subsequent accesses can be accelerated.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention provides an Lls
Regarding functional information processing devices for functional languages such as Li5t Processor), in particular the environment in which the function is executed (what to use as the value of the variable), the internal memory circuit of the When storing it in a stack structure, its stack.

The present invention relates to a functional information processing apparatus characterized in that an associative dlatte is provided outside the stack memory in order to shorten the search time for variables stored in the memory.

Lisp handles the binary list shown in Figure 1, that is, the tree structure (Figure 1 (a)), which is a collection of nodes and branches that do not contain cycles, in which symbols are connected. In other words, the connections between the symbols arranged in a tree structure like IWA (a) can be converted into a binary representation with two branches coming out of each node as shown in Figure 1 (b), which is a good form. 1st
It is stored in the main memory as shown in the figure (@). That is, each list cell is stored in main memory at 1## or [211
Each cell of seven consists of two parts, left and right. The left part of each cell stores the pit I line of a certain symbol, for example the symbol for the character 木, and the right part contains the address of the cell that stores the next symbol that should be connected to that symbol. By storing , it is expressed that two cells are connected. Therefore, the list cell list shown in Figure 1 (・) realizes the binary tree list shown in Figure J11' (b) on the memory circuit. squirrel! By executing the language fc1 se,? This is a device that uses dynamic conversion to obtain the desired list structure.

Fa dumbing in Lisp means defining a function formed by combining the following five basic functions necessary for rounding to convert a binary list, and finding its value.・The five basic functions and is 1 b) ear (z) curl 2 binary tree squirrel) the value is the binary list at the end of the left branch of X) cdr (X) kuda binary tree squirrel) right branch of X The value is the binary tree list at the end of .

/9 @0! kl(X:Y) Cons new list/
A cell is provided, and a new binary list is created in which the left branch is the binary tree list (X) and the right branch is the binary tree list Y, and this is used as the value.

→ atom(X) When atom .

e)・q (X:Y) When X and Y are the same binary tree list, the true value ('''T# or 1*T*') is used, otherwise the false value ("NIL'
)I take the.

For example, / (x ey) w= z74, the definition of X L-f-λ((X I Y); X' + y"
), the value of /(2,3) is λ((xty);x'+y(2,3)mouth2'+3
2), the correspondence of variables can be clearly defined.

In this ζ, %(X-Y) is a variable called a formal argument, and (
2, 3) are called actual arguments, which are the current values of (x, y). Then, by assigning this actual argument (2, 3) to the formal argument (x, y), t-binding (blamlm
g) Calling it and creating a desired list of function values, in this case 2 + 3, by binding the actual arguments to the formal arguments is to execute the list ff. Hence the squirrel! In other words, in a functional information processing device, the problem is how to bind formal arguments and actual arguments.

In the present invention, the binding value of the variable (BlndVal-・
) is a linear list (II boundary list or FILO(F
lrst I! L La5t Out ゛ma
lhi haha dovns Pop up
) 11 stack as a pair of variable name and value. Here, the FILOIJl star and the data are stored on the memory circuit in a binary list structure using an indirect addressing method (i.e.,
This method stores the address of the next cell in one cell. The order in which pairs of variable names and values are stored is the so-called dyna, which is the order in which the actual arguments are the values when the function of the argument variable is called.
Cusco Pinda (Dynaml@ii*ep1mg)
It is a functional language with an Oml type boundary, and the procedure to refer to what the value of the variable is, basically the environment list (or star) mentioned above.

The so-called D-bind method searches sequentially from the beginning and uses the nine values found first.
lmd) When performing fi variable binding, use global variables (variables whose values are determined beforehand, unlike local variables whose binding values are determined when the function is started, such as function arguments). The feature of the present invention is to provide an associative memory in addition to the main memory in order to shorten the access time.In general, a functional type is defined by its googukum structure, as shown in Figure 2. and the function that the execution form should call, that is, the function that should be executed f−λ((X #Y):
The actual arguments (2, y) to the formal arguments (x, y) of
3) Binding, or binding, a function (invoked to be called), executes a predetermined procedure by referring to the actual argument or global variable that is searched for, or assigns, and returns the value of the function 2. ' + 32 is returned to the caller, and there are no other side effects (changing the II boundary). Considering the gist of the present invention, the explanation of side effects will be omitted.

When calling a function, the method of binding the actual argument to the formal argument is D! There are the bind method and the Shallon method.

As mentioned above, the D7't4inr method creates a linear list of bound variable names (x, y) and values (2e s> pairs, that is, pairs of X for 2 and Y for 3). This is an environment configuration in which variables are stored in a stack structure, and when a variable value is referenced, it is sequentially traced from the direction in which it was last bound, and the value of the variable found first is used.

In other words, Gui! In the binding method, as shown in Figure 3(a), the structure of the word, which is the storage unit of the main memory, is
The right part is divided into two parts, one cell Kl, the left part stores the variable name, and the right part stores the address of the next cell to which that cell connects, thereby determining the value of that variable in the next cell. can be known and there are many variables, the third
They are connected as shown in the figure (&>) to form a FILO-type star array as shown in FIG. 3(b) isometrically.

When making a function call (Call), when inputting a value to an argument variable, use the environment list (9 is the product term stack)
O Connect the name and value pairs from the direction of the search starting point,
Search starting point - add a new inter and update to the beginning of nine items. In other words, in the main memory of FIG.
Figure 3 (In groaning, the footer of the stack, (Pus
h) corresponding to the action, whose variable name is m+1,
Place the cell whose value is (m+t) at the bottom of f!
.

This corresponds to putting it in. Function return (R@
ttrrm) When the function is called, the search starting point-inter is returned to the original state. In other words, in the main memory circuit of FIG. 3(a), the first cell m+1 is taken and cell 1 is Corresponding to placing it at the beginning, Fig. 3(b)
This means that 1+1 and its value (n+1) are brought out by pop operation 8. The advantage of the Diggind method is that the stack operations are simple, so the overhead of binding argument variables when calling a function and unbinding argument variables when returning from a function is relatively small. Many, the disadvantage is that global variables (
It takes time to reference variables that were bound a long time ago, such as free variables (also called free variables), which are located deep in the register.

The Shalupine P method provides a runmem access area (called Valu@C@ll) for each variable to hold its value, and when calling a function, stores the actual argument in the argument variable pari, - cell, −The nine values that existed in the cell before,
Store it in a linear list (or stack) as a name-old pair, and variable references only need to read the corresponding paris, -cell, and when the function is removed, a linear list of its argument variables is stored in the Δs, - cell. ) (t or stack) The advantage of the shallow binding method is that variable reference time is short, and the disadvantages are the binding process of argument variables at function call and function return. The problem is that the overhead of unbinding processing is large.

As described above, the DfA ind method is faster in binding/unbinding arguments than the shallow binding method, but variable references, especially global variable 6 references, are slow.The present invention aims to improve this point. This is the method.

An object of the present invention is to shorten the access time for referencing variables stored in stack memory according to the data binding method in a functional information processing device as described above. An object of the present invention is to provide a functional information processing device in which associations Δ and F are provided outside a main memory for rounding.

The feature of the present invention is that the structure and execution form of the program is an environment list as a pair of variable names as formal arguments and variable values as actual arguments.
Bind the actual argument to the formal argument variable of the function to be called by storing it in the stack memory of type a5t-0ust,
When the called function refers to the value of a variable, it processes using the most recent binding value in the environment list above, and if the value of the function is obtained, it deletes the function's formal argument variable from the environment list. In a functional information processing device that repeats a series of processes of returning a function value, each word is constructed as a pair of a variable name, a variable value, and position information on the environment list to which the variable is bound. When referencing a variable during execution, an associative search is performed using the variable name as a key, and if there is a match with an internal variable, the corresponding variable value is read and used; if there is a mismatch, the variable name is searched from the environment list and found recently. It has a function to newly write the variable name and variable value along with the operation of the processing device that uses the variable value, adding the position information on the environment list, and delete the word whose name matches the argument variable name. When changing, the information processing device operates to change the most recent value on the environment list, and if the variable exists internally, it has a function to change only the variable value, and the function returns to its caller. When doing so, an association zf 277 is used which has the function of deleting the corresponding word using the position information on the environment list as a key in conjunction with the operation of the processing device to remove the pair of argument name and binding value from the environment list. This is a functional information processing device.

An embodiment of the present invention will be described below with reference to the drawings.

First, in the digbind method on the stack, the following processing is performed. When the actual arguments are ready before a function call occurs, the star and rear become as shown in Figure 4 (a), where 8TP is the star, cut, and fl ink.When a function is called, the By processing 0 or more in the form shown in FIG. 4(b), the information for each function in the star format as shown in FIG. 4(,) is linked by the old FP. Here, FP is a frame pointer, that is, it points to the beginning of the control information of the function currently being executed.

When a variable is referenced through this link, its value can be obtained by following it and searching for the variable name.

For example, Fl(Z) Dew z2442(10) F2(x)=x2+! +F3(7) A case will be described in which the value of Fl(3) is determined in three functions having the relationship: F3(x)=x'+1+Z. At the time of calling the function Fl(Z), the formal argument 2 is bound to 3, and the binding relationship is stored on the environment list. However, since the value F2(10) of the horizontal function F2(x) is required to calculate Fl(Z),
Call function F2(x).

At the time of this call, the formal argument X is bound to lO, and the binding relationship is stored on the environment list. But also,
To calculate F2(10), use the value F3(7) of function F3(X)
is necessary, so call the function F3(x). During this pooling, the formal argument X is bound to 7, and the binding relationship is stored on the environment list. However, F3(x)
To find the value F3(7), use F3(X)-X'+1+Z
2 is an entry variable, that is, a variable that is not bound at that time, but 2 is a variable that is not bound at that time, but 2
Since it is bound to
is 3. Then, F3 (7) - 7' + 1 + 3 is found for the first time), F2 (returns to F2 (1G) 102 + 10 + F3 (7) is found t9, returns to Fl (Z), Fl (3) - 3 ”＋
The value F2(10) and Fl(3) can be found.

In general, in a functional type information processing device, the number of entering variables is smaller than bound local variables (and daughter formal arguments), but a small number of entering variables are often referenced many times. If a function that newly installs an associative buffer in an information processing device refers to an input variable, the above 21
If the variable does not exist in 7-cho, sequentially search for the environment list) (t or star, ri) and store the obtained nine values in pairs with the variable name in the high-speed associative buffer memory, When that variable is subsequently referenced, the buffer can be accessed associatively using the variable name, greatly reducing access time.

Figure 5 (In Xun's environment list, function F1 is F2t,
F2 is F3, F3 is F4, F4 is F5, and?
! Suppose you want to call Sat 6.

At this time, assume that the function F6 is 76(N)-N"+x+Z+Z2. That is, N is a local variable, and X and 2
is the entering variable. The entry variable X is a function r 2 (
At the time of calling x*y), z is bound to be 5, and z is bound to be 2*8 at the time of calling the function F3(Z).

In order to calculate the value of F6(N), we first search the environment list by referring to the variables N, 10
), but x 'p Z company's first F
It is necessary to search backwards on the i-Environment list.
X wm 5.7. It turns out that wm g. However, if in this first search, we store the found X-values 5 and Z-8 as a pair in the association (, f) as shown in Figure S (b), then , 2* Reference letter association of the same variable name/parable, 7a is accessed first, and the speed is increased. That is, F6 (N) = N2 +
x+Z+Z" O last term z2 is Z-S in the associative buffer
If the pair ``tIF'' is stored and an associative search is performed using variable 2 as a key, it will be immediately determined that it is Z-8, and all that is required is to substitute it into tIF2.・Honjimei Line This kind of association/
By installing 4x7a, the reference access time for entry variables can be made faster.

The functions that this buffer memory should have are as follows. Note that the specific configuration of the buffer memory will be described later with reference to FIG.

(1) When a certain entry variable is accessed for the first time, the variable is registered in a buffer to speed up subsequent accesses. In this case, in addition to the variable name and variable value, the position information EID (EnvlronmentId@ntlfl) of the bind value on the environment list (or stack)
@r ) is also stored at the same time.

(2) It is possible to check whether a given variable name matches an internally stored variable name using an I-code, and if there is a match, it is possible to read or write the value corresponding to that variable name. , it has the ability to read or write values by associatively searching the buffer using variable names as keys. This is necessary if the variable has been referenced (referenced) or changed.

(3) It has a function to use a variable name as a key to reset the valid display bit v of a variable with the same name as that variable on the memory. This refers to a function that has the same parameter name as the entry variable that exists in I47A.
- needed to delete that input variable on the buffer.

When this process occurs, the scoping principle that gives priority to local variables over entry variables when referencing the same variable name is shifted by 8.

(4) It has a function to use the position information EID as a key and reset the valid display (Pi)V of all items that match. This means that when a function returns to the calling function,
Required to remove all argument variables of the returning function from the buffer. If this process occurs, if a variable with the same name as a formal argument variable of this function was bound before this function, and that variable is referenced, a value that should have already been removed from the environment may be mistakenly used. become.

As mentioned above, if each variable is not stored in a buffer with its environmental position information EID, each /f7a is searched and removed using each formal argument group of the returning function as a key. , it is necessary to clear all buffers. In the former case, it takes time, and in the latter case, the lifetime of the global variable in the buffer is extended until the referenced function returns, and the effect of the buffer 70 is almost eliminated.

FIG. 6 is a diagram explaining the necessary function (1) of the 7 memory mentioned above, where El is the binding block of the argument of the reference 1 function, Fl is the frame of the reference 1 function, and IP is the empowerment pointer ( Suppose that function #4 now references a variable VAR, which is an environment list interface). 8P to E
4. Ii:3. Search El and the environment, and use El to set the variable V
Assuming that an AR is found, the location information on the environment list stored in the /tsufa is E2 bind, star,
This refers to the internal address EA2. This address is 71
．． (compression coding) to shorten the length and create an EID.
It is also possible to do this.

FIGS. 7(1) and 7(b) explain the above-mentioned necessary function (3) of the buffer memory. Suppose that function #4 is about to call function I#5 which has a formal argument group WAR. At this time, the variable vAR and its actual argument value are stored as a pair in the bind block, and if an item with the variable name vAR exists in the variable buffer, its valid pit is reset.

FIG. 8 explains the necessary function (4) of the buffer memory mentioned above. Consider the case where function #4 references global variable WAR, finds it in E2, returns /47, and then returns function Φ2#. Function-#2
If returns, g2/4 India of that argument WAR!
Since the lock binding is also released, the variable WAR4 in the z blue y 7 y memory must be deleted. Therefore, using the value IA2 of Tobi P at that time as a key, /4Tsfa to E
Delete items with matching IDs.

FIG. 9 is a specific configuration diagram of the associative buffer memory of the present invention. In other words, the structure and execution form of Glodarum binds the actual argument to the formal argument variable of the function to be called by storing it as a pair of variable name and variable value in the environment list, and the called function stores the value of the variable. When referencing, use the most recent binding value in the environment list, and if the value of the function is obtained, delete the formal argument variable of the function from the environment list and return the function value. FIG. 2 is a configuration diagram in which an associative buffer memory is newly added to the inside of a functional information processing device that repeats a series of processes. The functions that the associative buffer memory should have are as described in (1) and (2).
), (3), and (4).

In the above embodiment, first, memories 10, 20, and 30 are provided, each of which is composed of 1 to n registers. Memory IO stores variable names, 20 stores environment identity 7 AiyaEID, and 3
0 is for storing the variable value Vari, -. The first memory 10, 20, 30 (i vx l, 2
．． -"1k) registers correspond to each other and form one word.

This is the first function. When a certain global variable in the environment list of the function information processing device is accessed for the first time, the global variable, KID, and variable value are registered in the memories 10, 20, and 30- of the associative buffer, respectively, and are used for subsequent accesses. Try to speed it up. For the registered line variable name name to the associative buffer, input lines 101 and 103 are named 1.
The write/4 pulse signal WEi is activated and written to the cell. At the same time, the write signal WE1 is sent to the first cell of the EID through the JD t-human force lines 201 and 203, which is the environmental position information.
Similarly, the variable value is sent from the input line 301 to the first cell of Guari, - by the write signal wz1.
In order to perform the second function of activating and writing,
Associative printer, 7A company, the given variable name matches the variable name stored in the internal memory lO in advance.Circuit 4
Detects whether there is a match with 0, and outputs 1 if there is a match.
Any one of the 11 i401o is activated,
The selection circuit 6° is controlled to output the contents of the corresponding cell 30, that is, the corresponding variable value, to the output line 601. That is, the memory 30 has a function that allows variable values to be read by associative search using a variable name, and since the memory 30 that stores variable values can also be written to, the value corresponding to the variable name can be read out. , can be written. This is necessary when you refer to a variable value and change it.

In order to realize the third and fourth functions of resetting the valid display bit v of the item with the same name from the associative memory buffer using the variable name and environment identity five as keys, this embodiment includes the following: A selection circuit 70, a valid display bit storage cell group 8o, and a selection circuit 90 are included.

Among the cells storing the valid display pit v, the Vi micelle is set by the write signal wg1 when writing the variable name 1, EIDi, and variable value 1.

When using a variable name as a key, select circuit 70 selects matching circuit 4.
When the output 01 is selected and the reset signal 1001 is logic 1, when the matching circuit 40 matches the first internal variable name and the first input variable name among the outputs 1002 by the circuit 10G, The corresponding valid display pit v1 is reset.

The output of the valid display bit cell group is input to the output company selection circuit 90 and is selected under the control of the output 401 of the matching circuit 40, so the output 901 contains the corresponding valid display whose variable name and stored variable name match. Output 90 of bit selection circuit 90
1 is output.

In addition, in the ninth step to realize function (4), the selection circuit 70
If the output 501 of the matching circuit 50 is selected, when the input KID and the stored KID match, the corresponding valid display bit is reset, and when the external variable name and internal variable name match, the selection is made. It is selected by the circuit 90 and output to the output 901.

As explained above, according to the present invention, in a functional information processing device that executes execution according to the Daeg-Arindo method, access to search for the value of a global variable can be made faster by using the above-mentioned associative parameters. can be done.

[Brief explanation of the drawing]

Figures 1 (a) l (b) and (e) are diagrams for explaining the binary list, Figure 2 is a diagram for explaining functional information processing, and Figure 3 (a) and (b). ) a de fs
Diagram explaining Indian law, Figure 4 (a) e (b) e
(@) is a diagram explaining the D7'z4inP method on the starboard, and Figures 5(a) and (b) are diagrams explaining the environment list. FIG. 7 (&) e (b) is a diagram for explaining other functions of the buffer memory of the present invention; FIG. 8 is a diagram for explaining still another function of the buffer memory of the present invention; The figure is a block diagram of one embodiment of the present invention. 10--Variable name memory, 20--Position information (ICID
) Memory, 30.-Variable value storage, 40.50.. Matching circuit, 60.70.90.. Selection circuit. Blue figure 4 (a) (b) (c) Actual figure 5 (a) Actual figure 5 (b,) Actual figure 6 Blue 71! II (a) Blue Blue Figure 7 (J)) E Figure 8

Claims (1)

[Scope of Claims] 1. The structure and execution form of Grodarum is to store a variable name as a formal argument and a variable value as an actual argument in a stack memory of type Flrst-In-La5t-Out, which is an environment list. When an actual argument is bound to a formal parameter variable of a function to be called by , and the called function refers to the value of the variable, the most recent bound value in the environment list is used to process and the value of the function is obtained. In a functional information processing device that repeats a series of processes such as deleting a formal parameter variable of a function from the environment list and returning the function value, the variable name, the variable value, and the environment list to which the variable is bound are deleted. Each word is constructed as a pair of position information, and when referring to a variable during GLODARAM execution, an associative search is performed using the variable name as a key, and if a match is found with the stored variable, the corresponding variable value is read out. If there is a mismatch, the variable name is searched from the environment list, and the most recently found variable value is used. Along with the operation of the processing device, the variable name and variable value are newly written along with the position information on the environment list. In addition, the word whose name matches the argument variable name can be deleted, and when changing the variable value, the information processing device operates to change the most recent value on the environment list, and if the variable exists inside, the variable value is changed. When the function returns to its caller after only changing the parameter, the processing device removes the pair of argument group and binding value from the environment list, and the position information on the environment list is used as a key. - A functional information processing device equipped with an associative buffer memory that deletes words. λ When changing a variable value, if the variable exists in the associative buffer memory, change only the variable value in the associative buffer memory and leave the variable value in the environment list by that time. , the functional information processing device according to claim 1, wherein when the associative/9tuhua memory overflows, the value of the variable to be regraced is returned to the t-environment list.