JPH11120166A - Vectorization device and storage medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To vectorize a processing for finding a maximum value and a minimum value and to perform acceleration by replacing if sentence/then node/else node for enabling the vectorization of a loop sentence in a source program or a sentence replaced from the source program with if sentence/then node. SOLUTION: A loop sentence vectorization processing means 5 judges whether or not the sentence for substituting the same value to the if sentence/then node/ else node and a then node or the else node is present in a loop based on the result of morpheme analysis and syntax analysis in the source program 1 or the sentence replaced from the source program 1. In the case of judging that it is present by the judgement, the if sentence/then node/else node is replaced with the if sentence/then node. Thus, the processing for finding the maximum value and the minimum value is vectorized and the acceleration is performed.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a vectorization apparatus and a recording medium which enable vectorization of a source program or a sentence replaced from a source program.

[0002]

2. Description of the Related Art Conventionally, for example, when a maximum value or a minimum value is obtained in C language, a conditional expression written by a ternary operator (? :) in a loop is as shown in (1) of FIG. We use for. The ternary operator of (1) in FIG. 5A is represented by an if statement / then as shown in (1) ′ of FIG. 5B.
It can be replaced with a clause / else clause to provide an intermediate text image as shown in FIG.

However, this if sentence / then clause / els
If the e-node is present, it cannot be speeded up by vectorization. This will be briefly described below. FIG. 5 shows an explanatory diagram of the prior art.

FIG. 5A shows an example of a source program for finding the maximum value in C language. Here, i = 0, 1,
This is a source program for retrieving values in an array of l [i] sequentially and obtaining the maximum value among them by repeating 10 times from 2 to 9. The part (1) is called a ternary operator. Things.

FIG. 5 (b) shows the part of the ternary operator of (1) of FIG. 5 (a) as an if statement / then clause / e of (1) '.
Here is the source program after it has been replaced with the 1se clause. FIG. 5C shows an image after the source program of FIG. 5B has been converted into an internal intermediate language by morphological analysis / syntax analysis. Here, i of (1) ′ in FIG.
The f-sentence / then-clause / else-clause is converted into an internal intermediate language as shown in (1) '' in the figure.

[0006]

As described above, if there is a ternary operator in the loop of the source program, this can be replaced with an if statement / then clause / else clause.
Sentence / then clause / else clause cannot be vectorized,
There was a problem that high speed could not be achieved.

[0007] The present invention solves these problems,
The source program or a statement replaced from the source program is analyzed, and if it is found that there is an if statement in the loop and the same value is substituted in the avoidance branch / normal branch, the statement is replaced with an if statement / then clause to enable vectorization. The purpose is to increase the speed.

[0008]

Means for solving the problem will be described with reference to FIG. In FIG. 1, a source program 1 is a source program to be compiled, and here is a source program to be vectorized.

The loop statement vectorization processing means 5 includes an if statement / vector for enabling a loop statement in a source program 1 or a statement replaced from the source program to be vectorized.
It replaces the then clause / else clause with the if sentence / then clause.

Next, the operation will be described. The loop statement vectorization processing means 5 analyzes the source program 1 or a statement replaced from the source program 1, and includes a if statement / then clause / else clause in the loop and substitutes the same value in the then clause or else clause. It is determined whether or not there is, and if it is determined that there is, if statement / then clause / e
The "lse" clause is replaced with the "if" / then clause.

[0011] At this time, i used when obtaining the maximum value or the minimum value as an if sentence / then clause / else clause.
It tries to find f sentence / then clause / else clause. Therefore, if the source program 1 or a statement replaced from the source program 1 is analyzed and an if statement is found in the loop and it is determined that the same value is substituted in the avoidance branch / normal branch, the if statement / then clause / else clause is replaced with the if statement. Sentence/
It becomes possible to perform vectorization by replacing with a then clause.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, embodiments and operations of the present invention will be sequentially described in detail with reference to FIGS. Here, a program read from a recording medium (not shown) or a hard disk device as an external storage device, or a program transferred from an external storage device of the center via a line is loaded into the main storage and started up. Various processes to be described are executed.

FIG. 1 shows a system configuration diagram of the present invention.
In FIG. 1, a source program 1 is a source program to be compiled, and here is a source program to be vectorized, for example, a C language source program in FIG.

The processing device 2 performs various processes in accordance with a program. As shown in FIG. 1, the processing device 2 includes a program input unit 3, a vectorization processing unit 4, a vectorization optimization unit 9, an object generation unit 10, and the like. It is composed.

The program input means 3 takes in the source program 1. The vectorization processing means 4
After performing morphological analysis and syntax analysis on the source program 1 captured by the program input means 3,
It performs vectorization processing, and in this case, is composed of loop statement vectorization processing means 5 and the like.

The loop statement vectorization processing means 5 generates an if statement for enabling the vectorization of a loop statement based on the result of morphological analysis and syntax analysis of the source program 1 or the statement replaced from the source program 1. It replaces the / then clause / else clause with an if sentence / then clause, and here is composed of a maximum value / minimum value recognition means 6, a maximum value / minimum value determination means 7, a loop configuration change means 8, and the like. Is what is done.

The maximum value / minimum value recognizing means 6 analyzes and finds a part for obtaining the maximum value or the minimum value in a loop statement (for example, a FOR statement) of the source program 1 (see S1 in FIG. 2).

The maximum value / minimum value determination means 7 determines whether or not a portion for finding the maximum value or the minimum value in the loop found by the maximum value / minimum value recognition means 6 satisfies a predetermined condition. (S in FIG. 2)
1 to S3).

When the maximum / minimum value determining means 7 determines that the predetermined condition is satisfied, the loop configuration changing means 8 replaces the if sentence / then clause / else clause with the if sentence / then clause. To enable vectorization (see S4 in FIG. 2).

The vectorization optimizing means 9 optimizes the vectorization after the vectorization by the vectorization processing means 4. The object generation unit 10 generates an object 11 in an executable format after the optimization of the vectorization is performed by the vectorization optimization unit 9.

The object 11 is an executable object (load module). Next, the operation of the loop statement vectorization processing means 5 of the present invention of FIG. 1 will be described in detail according to the order shown in the flowchart of FIG.

FIG. 2 is a flowchart illustrating the operation of the present invention. In FIG. 2, S1 determines whether there is a part (sentence) for which the maximum value / minimum value is found in the loop. YES
In the case of, for example, there is a part (sentence) for obtaining the maximum value by the ternary operator of (1) in FIG.
It becomes S, and it proceeds to S2. In the case of NO in S1, it is determined that there is no part for which the maximum value or the minimum value is found in the loop, and the processing is ended.

S2 is a bypass branch instruction (a bypass branch route)
Alternatively, it is determined whether the same value (j = j;) is assigned to one of the regular instructions (regular route). YES
In the case of, for example, th of (1) ′ in FIG.
There is MOVE j, j in the en clause, and the result is YES, and the process proceeds to S3. In the case of NO in S2, it is determined that the same value is not assigned (j = j;) to either the avoidance branch instruction (the avoidance branch route) or the normal instruction (the normal route), and the process ends.

In step S3, the normal route is referred to as a goto statement (got
o statement) appears. In the case of YES, for example, GOTO # 3 in the then clause of FIG.
YES, and the process proceeds to S4. In the case of NO in S3, it is determined that the goto statement (goto sentence) does not appear on the regular route, and the process ends.

In step S4, if statement / then clause /
The structure of the else clause is changed to the structure of an if sentence / then clause. This corresponds to, for example, an if sentence /
The structure of the then / else clause is shown in FIG.
The structure is changed to a sentence / then clause to enable vectorization.

As described above, for example, in the source program 1 of FIG. 4A described later, there is a part (statement) for obtaining the maximum value / minimum value of S1 and the avoidance branch route (avoidance branch instruction) of S2 or the normal Route (normal branch instruction)
And if there is a goto statement in the regular route of S3, it is possible to change the if statement / then clause / else clause in the loop of S4 to an if statement / else clause so that it can be vectorized. Become.

FIG. 3 is a conceptual explanatory diagram of the present invention. FIG.
(A) shows a source image (before change). This is a source program after the ternary operator in the source program of FIG. 4A is replaced by an if statement / then clause / else clause.
It consists of a then clause and an else clause.

In FIG. 3A, in S11, there is an avoidance branch instruction, and when true, the flow branches to S14 of label # 2, and when false, the flow proceeds to S12. Here, the avoidance branch instruction is a branch destination (#) when "[j] is smaller than l [i].
2). Specifically, the statement “BL # 2, j,
T2 ".

S12 is executed when S11 is false,
[J] is substituted for [j]. S13 is the branch destination (# 3)
Fly to. S14 is the branch destination when S11 is true (# 2)
And substitute l [i] for [j].

S15 is the branch destination (# 3) of S13, where i = i + 1. In step S16, it is determined whether or not the processing is over. If true, return to S11 and repeat. If false, end.

As described above, the source image (before the change)
Converts the part of the ternary operator of (1) of the source program 1 of FIG.
2 and satisfying the conditions of S1 to S3 in FIG. 2 described above (there is an avoidance branch route (avoidance branch instruction) of S2 for obtaining the maximum value of S1, and
(there is a to statement (goto statement)), so the conversion of S4 in FIG. 2 is performed, and the source image (after conversion) in FIG. 3B is replaced (the if statement / then clause / else clause is replaced with the if sentence / the
(Replace with clause n).

FIG. 3B shows a source image (after conversion). Since the source image (before conversion) of FIG. 3A satisfies the conditions of S1 to S3 of FIG. 2 described above, S4 of FIG. 2 is replaced. FIG.
In (b) of (a), in S21, there is an avoidance branch instruction, and when true, the flow branches to S23 of label # 3, and when false, S2
Proceed to 2. Here, the avoidance branch instruction is “[j] is l
If the value is larger than [i], the instruction jumps to the branch destination (# 3). "
The sentence is a sentence “BGL # 3, j, T2”.

S22 is executed when the result of S21 is false.
[I] is substituted for [j]. S23 is executed when S21 is true and after S22, and i = i + 1. S24
Determines whether it is the end. If true, return to S21 and repeat. If false, end.

As described above, the source image (after the change)
Is the if statement / then clause / else clause of (1) ′ of the source program 1 of FIG.
hen clause. At this time, the avoidance branch instruction in S21 of the source image (after the change) is “[j] is l
"If the value is greater than [i], jump to branch destination (# 3)", but the avoidance branch instruction of S11 of the source image (before change) is "Branch destination (# 2) if [j] is less than l [i]. To "fly to". As a result, FIG.
(B) in step S12, "substitute [j] for [j]" was deleted and replaced with an if sentence / then clause (specifically, (b) and (c) in FIG. 4). Comparison).

FIG. 4 shows an embodiment of the present invention. FIG. 4A shows an example of a C language source image. Here, the part (1) is a sentence for obtaining the maximum value by the ternary operator. This sentence of (1) is an if sentence / then clause / el
When replaced with the se clause, the sentence of (1) ′ in FIG. 4B is obtained.

FIG. 4B shows a source image (before change) after the part (1) in FIG. 4A is replaced with an if sentence / then clause / else clause. Where (1) '
Corresponds to the sentence (1) in FIG.

FIG. 4C shows the if statement / then clause / e of (1) ′ in the source image (before change) of FIG. 4B.
This shows the source image (after change) after replacing the “lse” clause with the “if” / then clause. Here, the if sentence / then clause of (1) ″ is the i statement of (1) ′ in (b) of FIG.
It replaces the f-sentence / then-else / else clause.

4 (b) and 4 (c) are equivalent sentences, and T1 and T3 are temporary memories for obtaining and storing an address for reading a value for which a maximum value is to be obtained from an array. It is. T2 is a temporary memory for storing a value for which a maximum value read at the address of T1 or T3 is to be obtained. i is a loop variable, and j is a variable holding the current maximum value. # 2 and # 3 are jump destination labels. MULT is a multiplication instruction, LOAD
Is a load instruction, and BL is an avoidance branch instruction (S in FIG.
11), MOVE is an assignment instruction, GOTO is a branch instruction, B
LT is a branch instruction, and BGL is an avoidance branch instruction ((c) in FIG. 3).
S21). The independent operation of each of these instructions is known as C language.

[0039]

As described above, according to the present invention,
The source program 1 or a statement replaced from the source program 1 is analyzed, and if it is found that there is an if statement in the loop and the same value is substituted in the avoidance branch / normal branch, i
Since the f statement / then clause / else clause is replaced with the if statement / then clause, the source program 1
Alternatively, even if an if-statement / then-clause / else-clause is present in a loop of a statement replaced from the source program, it can be replaced with an if-statement / then-clause if a predetermined condition is satisfied, and can be vectorized. Vectorization of the processing for obtaining the maximum value and the minimum value has been made possible, thereby achieving high speed.

[Brief description of the drawings]

FIG. 1 is a system configuration diagram of the present invention.

FIG. 2 is a flowchart illustrating the operation of the present invention.

FIG. 3 is a conceptual explanatory diagram of the present invention.

FIG. 4 is an embodiment of the present invention.

FIG. 5 is an explanatory diagram of a conventional technique.

[Explanation of symbols]

 1: Source program 2: Processing device 3: Program input means 4: Vectorization processing means 5: Loop statement vectorization processing means 6: Maximum / minimum value recognition means 7: Maximum / minimum value determination means 8: Loop configuration change means

Claims (3)

[Claims] 1. A vectorization apparatus for vectorizing a source program or a sentence replaced from a source program, wherein the sentence replaced from the source program or the source program is analyzed and an if statement / then clause /
means for determining whether there is an else clause and whether there is a statement that substitutes the same value in the then clause or else clause, and when it is determined that the above statement is present, the if statement / then clause / else clause is replaced by an if statement / Then clause. 2. The vectorization apparatus according to claim 1, wherein said if sentence / then clause / else clause is an if sentence / then clause / else clause used when obtaining a maximum value or a minimum value. 3. The program according to claim 1, wherein the source program or a statement replaced from the source program is analyzed and an if statement /
means for determining whether there is a then / else clause and whether there is a statement that substitutes the same value in the then or else clause, and when it is determined that the statement exists, the if statement / then clause / else clause And a computer-readable recording medium storing a program that functions as a unit that replaces a sentence with an if sentence / then clause.