JP2011039856A - Data processing device, data processing method, program conversion processing device, and program conversion processing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To shorten a processing time in a reuse section by reuse of an execution result. <P>SOLUTION: A history memory 430 stores the input value and execution result of a function in association with each other as an execution history for each function identification information. A command decoder 320 supplies to an execution history search unit 410 the function identification information included in a notice command for giving notice of a function supplied from a fetch unit 310. The command decoder 320 also directs the execution history search unit 410 to acquire an input value output from an input selection unit 332, according to, among the commands read after the notice command, an input value setting command for setting the input value of the function. The execution history search unit 410 searches for an execution history that matches the acquired identification information and input value prior to a function call command. An execution result output unit 420 outputs an execution result detected by the execution history search unit 410 to an execution unit 330. The fetch unit 310 reads a command to be read next to the function. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a data processing apparatus, and in particular, a data processing apparatus that reuses an execution result of an instruction section that is executed a plurality of times, a processing method thereof, a data conversion processing apparatus that converts a program corresponding to the data processing apparatus, and It relates to the processing method.

2. Description of the Related Art Conventionally, research and development relating to high-speed computing processing technology has been actively performed in microprocessors such as a CPU (Central Processing Unit). As a technique for speeding up this arithmetic processing, a technique called value reuse technique has been devised. For example, a data processing apparatus in which this value reuse technique is applied to an instruction section of a loop has been proposed (for example, see Patent Document 1).
In this value reuse technique, among the instruction sections that are part of the program, if the input value in the instruction section is the same, the input value in the instruction section that has the same execution result and the output value that is the execution result are Register in the reuse table in association. After that, when the same instruction section is executed again, if the same input value is registered in the reuse table, it was executed in the past by outputting the output value corresponding to the input value from the reuse table. Reuse the execution result of the instruction section. As described above, an instruction interval in which an execution result of an instruction interval executed in the past among the instruction intervals executed a plurality of times can be reused is referred to as a reuse interval.

Japanese Patent No. 3855076 (FIG. 1)

  In the above-described conventional technique, if the input value of the command section is registered in the reuse table when the process in the reuse section is executed again, the process of the reuse section can be omitted. The time required for executing the instruction section can be shortened. However, in this case, it is not possible to determine whether or not the input value of the reuse section is registered in the reuse table until the input value is used in the processing of the reuse section. For this reason, since the reuse table cannot be searched until the input value is used, the period that can be shortened by reusing the execution result is limited.

  The present invention has been made in view of such a situation, and an object thereof is to further reduce the processing time of the reuse section by reusing the execution result.

  The present invention has been made to solve the above problems, and a first aspect thereof is an execution unit that executes processing based on an instruction sequence including a reuse section that is an instruction section that is executed a plurality of times. A history memory that associates an input value and an execution result in the reuse section for each piece of identification information for identifying the reuse section, and retains it as an execution history, and a notice instruction for notifying execution of processing in the reuse section An execution history search unit that acquires the input value of the reuse section based on the acquired input value and the identification information specified by the notice command, and searches for the execution result in the execution history; When the execution result is extracted by the execution history search unit when the process in the reuse section identified by the notice instruction is executed, the extracted actual result is extracted. The results is a data processing apparatus and a processing method comprising an execution result output section for outputting to the execution unit. Thereby, before executing the reuse section, the input value of the reuse section is acquired based on the notice instruction, and the execution result in the history memory is obtained based on the acquired input value and the identification information specified by the notice instruction. When the execution result is extracted when the search is performed and the process in the reuse section identified by the notice instruction is executed, the extracted execution result is output to the execution unit.

  Further, in this first aspect, the execution history search unit obtains an input value of the reuse section in an instruction group from the notice instruction to an instruction immediately before a call instruction for calling a head address of the reuse section. An input value may be acquired based on an input value setting command for setting. As a result, the execution history search unit has an effect that the data set by the input value setting command following the notice command is acquired as the input value of the reuse section.

  In the first aspect, the execution history search unit may search the execution result in the execution history based on the acquired input value and the identification information included in the notice command. Good. As a result, the execution history search unit causes the execution result in the history memory to be searched using the identification information included in the notice command and the input value acquired based on the notice command.

  Further, in the first aspect, the history memory associates an input value and an execution result in the reuse section for each head address of the reuse section that is the identification information, and holds the execution history as the execution history. The section outputs the head address to the execution history search section based on the notice command including reference information for referring to the head address, and the execution history search section outputs the identification information from the execution section as the identification information. The execution result in the execution history may be searched based on the head address and the input value of the reuse section. Thus, the start address of the reuse section is output from the execution unit based on the reference information included in the notice command, and the start address of the reuse section output from the execution unit and the input acquired based on the notice command The value is used to search the execution result in the history memory.

  In the first aspect, the notice command is a notice setting command for setting the start address of the reuse section, which is the identification information, and the history memory is provided for each start address of the reuse section. The execution value is stored as the execution history in association with the input value and the execution result in the reuse section, and the execution unit determines the start address based on the notice setting instruction including the setting information indicating the setting destination of the start address. Is set as the setting destination, and the execution history search unit acquires the input value of the reuse section based on the advance notice setting command, and the acquired input value and the start address set by the execution unit Based on the above, the execution result in the execution history may be searched. As a result, the execution history search unit obtains the execution history in the history memory based on the start address set by the notice setting command for setting the start address of the reuse section and the input value acquired based on the notice setting instruction. It brings about the effect of making it search.

  Further, in the first aspect, the history memory associates the priority when deleting the execution history with the input value and the execution result in the reuse section corresponding to the priority, as the execution history. For each identification information, the execution history search unit may delete the execution history in the history memory based on the priority included in the notice command. As a result, the execution history search unit deletes the execution history in the history memory based on the priority assigned to each execution history.

  Further, in the first aspect, the execution unit performs processing in the reuse section identified by the notice instruction when the execution result in the execution history is not extracted from the history memory by the execution history search unit. The execution history search unit may cause the history memory to hold the input value acquired based on the notice command, the execution result executed by the execution unit, and the identification information. . Thereby, when the execution result is not extracted from the history memory, the execution history search unit obtains the input value acquired based on the notice command, the execution result executed based on the input value, and the identification information. This brings about the effect that it is retained in the history memory.

  In the first aspect, the history memory associates an input value and an execution result in the function for each identification information for identifying the function that is the reuse section, and holds the execution history as the execution history. The execution history search unit acquires an input value of the function based on a notice command for notifying execution of the function, and executes the execution based on the acquired input value and the identification information specified by the notice command. The execution result in the history is searched, and the execution result output unit extracts the execution result if the execution result is extracted by the execution history search unit when the function identified by the notice instruction is executed. The execution result may be output to the execution unit. As a result, the execution history search unit acquires the input value of the function based on the advance notice for notifying the execution of the function, and uses these obtained input values and the identification information specified by the advance instruction. The execution result associated with the parameter is extracted from the history memory, and when the function is executed, the execution result unit causes the execution unit to output the extracted execution result.

  Further, according to a second aspect of the present invention, the reusability indicating the degree to which the execution results of the instruction sections executed a plurality of times in the program coincide with each other is determined for each instruction section based on the usage of the instruction section. And the input value in the reuse section immediately before the input value setting instruction for setting the input value in the reuse section selected based on the reuse degree among the plurality of instruction sections. A program conversion processing apparatus and a processing method thereof including a notice command generating unit for generating a notice command for notifying the setting of the information. Thus, the reuse level generation unit generates a reuse level for each command section based on the usage mode of the instruction section, and the input value setting command in the reuse section selected based on the generated reuse level. Immediately before, the notice command generation unit generates a notice command for notifying the execution of the reuse section.

  In the second aspect, the notice command generation unit generates the notice command including identification information for identifying the plurality of reuse sections selected based on the degree of reuse. Also good. As a result, the notice command generation unit generates a notice command including identification information for identifying a plurality of reuse sections selected based on the degree of reuse.

  In the second aspect, the notice command generation unit generates the notice command including reference information for referring to the start address after an address setting instruction for setting the start address of the reuse section. You may make it do. Thus, after the address setting command, the notification command generating unit generates a notification command including reference information for referring to the head address of the reuse section set by the address setting command.

  Further, in the second aspect, the notice command generation unit outputs the notice command as an address setting instruction including setting information indicating a setting destination of the start address in order to set a start address of the reuse section. You may make it produce | generate. This brings about the effect that a notice command for setting the start address of the reuse section is generated.

  In the second aspect, the notice command generation unit may generate the notice command including a priority given in accordance with the reuse degree generated by the reuse degree generation unit. Good. As a result, the notice command generation unit generates a notice command including a priority for deleting the execution history of the history memory.

  According to the present invention, it is possible to achieve an excellent effect that the processing time in the reuse section due to the reuse of the execution result can be further shortened.

It is a block diagram which shows the example of 1 structure of the data processor in the 1st Embodiment of this invention. It is a block diagram which shows the example of 1 structure of the data processing part 300 and the execution result reuse process part 400 in the 1st Embodiment of this invention. It is a conceptual diagram which shows an example of the data structure of the history memory 430 in the 1st Embodiment of this invention. It is a conceptual diagram which shows the operation | movement outline | summary of the data processing apparatus 100 when the notice command containing identification information is received in the data processing apparatus 100 in the 1st Embodiment of this invention. It is a figure which illustrates a part of program run by the data processor 100 in the 1st Embodiment of this invention. It is a conceptual diagram which shows the example by which the processing time in a function is shortened by execution of a notice instruction. It is a flowchart which shows an example of the process sequence of the execution result reuse method of the data processor 100 in the 1st Embodiment of this invention. It is a conceptual diagram which shows the operation | movement outline | summary of the data processing apparatus 100 when the notice command containing reference information is received in the data processing apparatus 100 in the 2nd Embodiment of this invention. It is a figure which illustrates a part of program run by the data processor 100 in the 2nd Embodiment of this invention. It is a conceptual diagram which shows the operation | movement outline | summary of the data processing apparatus 100 when the notice setting command is received in the data processing apparatus 100 in the 3rd Embodiment of this invention. It is a figure which illustrates a part of program run by the data processor 100 in the 3rd Embodiment of this invention. It is a block diagram which shows the example of 1 function structure of the program conversion processing apparatus in the 4th Embodiment of this invention. It is a figure which illustrates the data format of the warning instruction produced | generated by the program conversion processing apparatus 500 in the 4th Embodiment of this invention. It is a flowchart which shows an example of the process sequence of the notice command production | generation processing method of the program conversion processing apparatus 500 in the 4th Embodiment of this invention. It is a flowchart which shows an example of the process sequence of the warning command process (step S940) about the warning command containing the identification information in the 4th Embodiment of this invention. It is a flowchart which shows an example of the process sequence of the warning command process (step S950) about the warning command containing the reference information in the 4th Embodiment of this invention. It is a flowchart which shows an example of the process sequence of the notification command process (step S960) about the notification setting command in the 4th Embodiment of this invention.

Hereinafter, modes for carrying out the present invention (hereinafter referred to as embodiments) will be described. The description will be made in the following order.
1. First Embodiment (Data Processing Control: Example of Reuse Processing of Execution Result by Notice Command Including Identification Information)
2. Second Embodiment (Data Processing Control: Example of Execution Result Reuse Processing by Preliminary Instruction including Reference Information)
3. Third Embodiment (Data Processing Control: Example of Execution Result Reuse Processing by Advance Setting Command)
4). Fourth embodiment (program conversion control: generation example of program including notice command)

<1. First Embodiment>
[Configuration example of data processing device]
FIG. 1 is a block diagram showing an example of the configuration of the data processing apparatus according to the first embodiment of the present invention. Here, a data processing device 100, a bus 120, and a main storage unit 130 constituting an integrated circuit are shown. This integrated circuit executes processing by the data processing device 100 in accordance with an instruction sequence read from the main storage unit 130 via the bus 120.

  The data processing apparatus 100 includes a primary cache 200, a data processing unit 300, and an execution result reuse processing unit 400. The data processing device 100 is an example of a data processing device described in the claims. The primary cache 200 is a memory for reducing a delay time caused by processing when reading or writing an instruction and data from the main storage unit 130 via the bus 120. The primary cache 200 is realized by, for example, a DRAM (Dynamic Random Access Memory).

  The primary cache 200 includes an instruction cache 210 and a data cache 220. The instruction cache 210 temporarily holds past instructions read from the main storage unit 130. The instruction cache 210 outputs the held instruction to the data processing unit 300 via the command line 219 in accordance with a request from the data processing unit 300.

  In addition, when the instruction cache 210 holds the instruction requested from the data processing unit 300, the requested instruction is output to the data processing unit 300 among the plurality of held instructions. . On the other hand, when the instruction requested from the data processing unit 300 is not held, the instruction cache 210 holds the instruction read from the main storage unit 130 by the data processing unit 300 and outputs it to the data processing unit 300. To do.

  The data cache 220 temporarily holds past data read from the main storage unit 130. The data cache 220 outputs the held data to the data processing unit 300 via the data line 229 in accordance with a request from the data processing unit 300. In addition, when the data cache 220 holds the data requested from the data processing unit 300, the requested data is output to the data processing unit 300 among the plurality of held data.

  On the other hand, when the data requested by the data processing unit 300 is not held, the data cache 220 holds the data read from the main storage unit 130 by the data processing unit 300. Further, when data for writing back to the main storage unit 130 is supplied from the data processing unit 300, the data cache 220 holds the data.

  The data processing unit 300 executes processing based on an instruction read from the main storage unit 130. For example, the data processing unit 300 reads an instruction from the main storage unit 130 via the instruction cache 210, and transmits data stored in the main storage unit 130 via the data cache 220 according to the read instruction. read out. Then, for example, the data processing unit 300 executes arithmetic processing based on the arithmetic instruction using the read data.

  Further, for example, when executing the processing of a function, the data processing unit 300 executes the arithmetic processing of the function using the input value of the argument in the function read from the data cache 220, and performs the processing of the arithmetic processing. The execution result as a result is output to the data cache 220. At this time, the data processing unit 300 outputs the input value and execution result in the function to the execution result reuse processing unit 400. The data processing unit 300 is realized by, for example, a processor core.

  When the input value of the instruction section executed in the past matches the input value of the instruction section executed again, the execution result reuse processing unit 400 displays the execution result of the instruction section executed in the past. It is for reuse. Here, an instruction section in which an execution result of an instruction section executed in the past among the instruction sections executed a plurality of times can be reused is referred to as a reuse section. In other words, the reuse interval is an instruction interval that has the same execution result if the input value in the instruction interval is the same among the instruction intervals that are executed a plurality of times.

  The execution result reuse processing unit 400 holds an input value and an execution result in a reuse section that is executed a plurality of times as an execution history. In addition, the execution result reuse processing unit 400, when the input value of the reuse section to be executed again and the input value of the held execution history are the same, the execution result in the held execution history The result is output to the data processing unit 300. At the same time, the execution result reuse processing unit 400 notifies the data processing unit 300 of an instruction for skipping the processing in the reuse section.

  For example, when the input value of the argument of the function that is the reuse section is the same as the input value in the retained execution history, the execution result reuse processing unit 400 executes the execution in the retained execution history. The result is output to the data processing unit 300. At the same time, the execution result reuse processing unit 400 notifies the data processing unit 300 of an instruction for skipping the processing in the function.

  The bus 120 performs communication between the data processing apparatus 100 and the main storage unit 130. The bus 120 transfers a program stored in the main storage unit 130 to the data processing apparatus 100. In addition, the bus 120 transfers data output from the data processing apparatus 100 to the main storage unit 130.

  The main storage unit 130 stores a program for causing the data processing apparatus 100 to execute processing. Here, this program is assumed to be a program generated based on the definition of ABI (Application Binary Interface). This program is generated based on, for example, SPARC (Scalable Processor Architecture) ABI. Thereby, in the data processing apparatus 100, the place where the input value and the execution result in the function are stored can be specified, so that the reuse of the execution result can be realized. Further, in the program stored in the main storage unit 130, a notice instruction for notifying execution of processing in the function is inserted before the function that is the reuse section is executed.

[Configuration Example of Data Processing Unit 300 and Execution Result Reuse Processing Unit 400]
FIG. 2 is a block diagram illustrating a configuration example of the data processing unit 300 and the execution result reuse processing unit 400 according to the first embodiment of the present invention. Here, it is assumed that a program in which a notice instruction is inserted is stored in the main storage unit 130.

  The data processing unit 300 includes a fetch unit 310, an instruction decoder 320, an execution unit 330, and a register file 340. The execution unit 330 includes a load unit 331, an input selection unit 332, an arithmetic circuit 333, and a store unit 334. The execution result reuse processing unit 400 includes an execution history search unit 410, an execution result output unit 420, and a history memory 430.

  The fetch unit 310 reads an instruction held in the instruction cache 210 or an instruction stored in the main storage unit 130 via the instruction line 219. The fetch unit 310 reads an instruction from the instruction cache 210 in accordance with an instruction from the program counter.

  Further, the fetch unit 310 reads, for example, a notice instruction for notifying execution of a function call instruction that is a reuse section, and then reads an input value setting instruction for setting an input value of an argument in the function. Then, after the input value setting instruction, the fetch unit 310 reads a call instruction for calling the function. In other words, the fetch unit 310 reads the notice instruction and the input value setting instruction corresponding to the function before reading the function call instruction that is the reuse section.

  The fetch unit 310 supplies the read instruction to the instruction decoder 320. When the execution result is extracted by the execution history search unit 410, the fetch unit 310, for example, sends an instruction for setting the execution result to the instruction decoder 320 based on the notification from the execution history search unit 410. Supply.

  The instruction decoder 320 decodes the instruction supplied from the fetch unit 310 and controls the execution unit 330, the register file 340, and the execution history search unit 410 based on the decoded content. When the instruction decoder 320 receives a notice instruction for notifying the execution of the function, the instruction decoder 320 supplies the identification information specified by the notice instruction to the execution history search unit 410. The identification information here is information for mutually identifying functions that are a plurality of reuse sections, and is used as a search key for searching for an execution history held in the history memory 430. That is, the instruction decoder 320 holds the identification information for identifying the function in the execution history search unit 410 before executing the function that is the reuse section specified by the notice instruction by the notice command.

  For example, when the instruction decoder 320 receives a notice instruction including identification information, the instruction decoder 320 supplies the identification information to the execution history search unit 410 in order to input the identification information to the history memory 430. In addition, when the function start address is used as the identification information and the function start address is already stored in the register file 340, the instruction decoder 320 uses the reference information for referring to the function start address. The identification information is specified by a notice order including.

  At this time, the instruction decoder 320 causes the execution history search unit 410 to output the start address of the function stored in the register file 340 based on the reference information included in the notice instruction. That is, the instruction decoder 320 causes the execution history 330 to output the start address of the function that is identification information based on the notice command including the reference information.

  In addition, when the function start address is used as the identification information, if the instruction setting instruction for setting the function start address in the register file 340 is a notice instruction, the instruction decoder 320 sets the setting included in the notice instruction. Identify identification information based on the information.

  At this time, the instruction decoder 320 sets the start address of the function to the setting destination in the register file 340 indicated by the setting information specified in the notice instruction via the input selection unit 332. At the same time, the instruction decoder 320 instructs the execution history search unit 410 to acquire the head address of the function output from the input selection unit 332. Such a notice instruction which is an address setting instruction is referred to herein as a notice setting instruction. Therefore, the instruction decoder 320 causes the execution unit 330 to set the start address of the function, which is identification information, as the setting destination based on the notice setting instruction including the setting information indicating the setting destination of the start address of the function. The execution history search unit 410 outputs the data.

  Further, the instruction decoder 320 determines whether or not the instruction received after the notice instruction for notifying the execution of the function is an input value setting instruction for setting the input value of the argument in the function. The instruction decoder 320 determines whether the instruction is an input value setting instruction based on, for example, ABI regulations.

  In this example, a determination example based on the MBI (Microprocessor without Interlocked Pipeline Stages) ABI will be briefly described. According to the MIPS rules, when all input values of the arguments are integers, the input values are stored in the four registers 4 to 7, and when there are five or more arguments, the input values of the fifth or more arguments are mainly used. Stacked in the stack area of the storage unit 130. Specifically, the input values of the fifth or more arguments are stacked in a stack area corresponding to a value obtained by adding 16 or more values to the stack point value stored in the register 29 in the register file 340.

  Therefore, for example, when the transfer destination register indicated by the load word instruction (lw) is the registers 4 to 7, the instruction decoder 320 determines that the input value setting instruction is to set the input value of the argument in the function. Further, the instruction decoder 320 has a register 29 as the transfer destination register indicated by the store word instruction (sw) when the argument is 5 or more and all the input values of the argument are integers, and the offset When the value indicates “16” or more, it is determined as an input value setting command.

  If it is determined that the instruction is an input value setting instruction, the instruction decoder 320 supplies an acquisition signal for acquiring data output from the input selection unit 332 as an input value of an argument to the execution history search unit 410. That is, the instruction decoder 320 sets the input value of the argument based on the input value setting instruction for setting the input value of the function among the instruction group from the notice instruction to the instruction immediately before the calling instruction for calling the function. Is controlled so as to be acquired by the execution history search unit 410.

  For example, when the instruction decoder 320 receives an input value setting instruction for setting an input value of a function read from the main storage unit 130, the instruction decoder 320 reads the input value read from the load unit 331. Control is performed so that the file is stored in the register file 340. At the same time, the instruction decoder 320 supplies an acquisition signal to the execution history search unit 410.

  For example, when the instruction decoder 320 receives an input value setting instruction for setting an input value of a function stored in the register file 340, the instruction decoder 320 outputs the input value stored in one register in the register file 340. Control to transfer to other registers. At the same time, the instruction decoder 320 supplies an acquisition signal to the execution history search unit 410.

  When the instruction decoder 320 receives a call instruction for calling the head address of the function after the input value setting instruction, the input value end indicating that the setting of all input values used for the function is completed. The signal is supplied to the execution history search unit 410. That is, when receiving a call instruction for calling a function corresponding to the identification information, the instruction decoder 320 supplies an input value end signal to the execution history search unit 410. In addition, when the priority at the time of deleting the execution history is included in the notice command, the instruction decoder 320 supplies the priority to the execution history search unit 410.

  The execution unit 330 executes processing in accordance with control from the instruction decoder 320. That is, the execution unit 330 executes a process based on an instruction sequence including a reuse section that is an instruction section that is executed a plurality of times. For example, when a notice instruction including reference information is supplied to the instruction decoder 320, the execution unit 330 uses the start address of the function stored in the register indicated in the reference information as identification information as an execution history search unit. Output to 410.

  For example, when the notice setting instruction is supplied to the instruction decoder 320, the execution unit 330 sets the function start address based on the setting information indicating the setting destination of the function start address included in the notice setting instruction. Set the destination. That is, the execution unit 330 sets the function start address in the register file 340 based on the setting information of the notice setting instruction, and outputs the function start address to the execution history search unit 410 as identification information.

  In addition, the execution unit 330 outputs the input value and execution result of the function that is the reuse section to the register file 340 or the main storage unit 130 and supplies it to the execution history search unit 410. The execution unit 330 is an example of an execution unit described in the claims.

  The load unit 331 reads data from the main storage unit 130 or the data cache 220 in accordance with control from the instruction decoder 320 and supplies the read data to the input selection unit 332. For example, the load unit 331 reads an input value of an argument in a function from the main storage unit 130 or the data cache 220 according to control from the instruction decoder 320 and supplies the read input value to the input selection unit 332. .

  The input selection unit 332 selects one of the data output from the execution result output unit 420, the arithmetic circuit 333, the register file 340, and the execution result output unit 420 in accordance with the control from the instruction decoder 320. It is. The input selection unit 332 outputs the selected data to the register file 340 and the execution history search unit 410. That is, the input selection unit 332 selects one of the outputs of the execution result output unit 420, the arithmetic circuit 333, the register file 340, and the execution result output unit 420 according to the control of the instruction decoder 320 as the register file 340 and the execution history search unit. Output to 410.

  For example, when a load instruction is supplied as an input value setting instruction to the instruction decoder 320, the input selection unit 332 searches the register file 340 and the execution history search for data from the load unit 331 according to the control of the instruction decoder 320. Output to the unit 410. Further, when a move instruction is supplied as an input value setting instruction to the instruction decoder 320, the input selection unit 332 executes the data output from the register file 340 and the execution of the data according to the control of the instruction decoder 320. Output to the history search unit 410.

  In addition, when an arithmetic instruction for executing arithmetic processing is supplied to the instruction decoder 320, the input selection unit 332 uses the arithmetic result output from the arithmetic circuit 333 as an execution result under the control of the instruction decoder 320. Output to the register file 340. Further, when the execution result is extracted by the execution history search unit 410, the input selection unit 332 outputs the execution result output from the execution result output unit 420 to the register file 340 according to the control from the instruction decoder 320. To do.

  The arithmetic circuit 333 executes arithmetic processing in accordance with control from the instruction decoder 320. For example, when an arithmetic instruction for executing arithmetic processing such as multiplication, division or sum of products is supplied to the instruction decoder 320, the arithmetic circuit 333 is stored in the register file 340 according to the control of the instruction decoder 320. The arithmetic processing is executed using the obtained data. In addition, the arithmetic circuit 333 stores the calculation result of the calculation processing as an execution result in the register file 340 via the input selection unit 332.

  The store unit 334 is for writing back the data stored in the register file 340 or the execution result output from the execution result output unit 420 to the main storage unit 130 according to the control from the instruction decoder 320. When a store instruction for writing data back to the main storage unit 130 is supplied to the instruction decoder 320, the store unit 334 sends data to be written back via the data line 229 according to control from the instruction decoder 320. To the data cache 220. Further, when the execution result is extracted by the execution history search unit 410, the store unit 334 sends the execution result output from the execution result output unit 420 to the main storage unit 130 and the data cache via the data line 229. Write back to 220.

  The register file 340 holds data output from the execution unit 330. The register file 340 includes a plurality of registers, for example, 32 registers 0 to 31. The register file 340 stores data output from the execution unit 330 in one register among a plurality of registers in accordance with control from the instruction decoder 320.

  Further, the register file 340, for example, in accordance with control from the instruction decoder 320, uses the data stored in one register among a plurality of registers as an execution result as the execution result 330 or the execution history search unit 410 via the execution unit 330. Output to. Also, the register file 340 is sent to the execution history search unit 410 via the execution unit 330 using the start address of the function stored in one of the plurality of registers as identification information, for example, according to control from the instruction decoder 320. Output.

  The execution history search unit 410 is the same as the identification information and the input value acquired based on the notice command, out of the input value and the execution history as the execution result in the reuse section held for each piece of identification information in the history memory 430. The execution result in the execution history is searched. The execution history search unit 410 holds the identification information and the input value specified based on the notice command, and outputs the held identification information and input value to the history memory 430, thereby searching for the execution history. Do.

  The execution history search unit 410 acquires identification information specified by the notice command in accordance with an instruction from the command decoder 320. For example, when a notice instruction including identification information is supplied to the instruction decoder 320, the execution history search unit 410 holds the identification information output from the instruction decoder 320. In addition, for example, when a notice instruction including reference information is supplied to the instruction decoder 320, the execution history search unit 410 sets the start address of the function output from the register file 340 according to the control from the instruction decoder 320. Obtained as identification information.

  Further, the execution history search unit 410 is stored in the register file 340 via the input selection unit 332 according to control from the instruction decoder 320, for example, when a notice setting instruction is supplied to the instruction decoder 320. Get the start address of the function as identification information. After the identification information is acquired, the execution history search unit 410 acquires the input value of the function based on the acquisition signal output from the instruction decoder 320 every time the input value setting instruction is supplied to the instruction decoder 320. .

  That is, the execution history search unit 410 searches for an execution result in the execution history held in the history memory 430 based on the start address of the function, which is identification information output from the execution unit 330, and the input value of the function. To do. Then, when a call instruction for calling a function is supplied to the instruction decoder 320, the execution history search unit 410 ends the search for the history memory 430 based on the input value end signal from the instruction decoder 320.

  When the execution result is extracted from the history memory 430, the execution history search unit 410 outputs the execution result to the execution result output unit 420. At the same time, the execution history search unit 410 supplies information related to the storage location in the extracted execution result to the fetch unit 310 as an omission signal for omitting the processing of the function.

  On the other hand, when the execution result is not extracted from the history memory 430, the execution history search unit 410 executes the process in the function identified by the notice instruction in the execution unit 330 and then executes the execution result output from the execution unit 330. To get. Then, the execution history search unit 410 causes the history memory 430 to hold the execution result of the function and the identification information and the input value acquired based on the notice command. That is, when the execution result is not extracted from the history memory 430, the execution history search unit 410 records the execution result of the function executed after the notice command, the function identification information and the input value held by the notice command. Register in the memory 430.

  In this example, when the return instruction for ending the execution of the process in the function is supplied to the instruction decoder 320, the execution history search unit 410 executes the execution stored in the register file 340 under the control of the instruction decoder 320. Get the result. As a result, the execution history search unit 410 can store the input value and the execution result corresponding to the function identification information specified by the notice instruction in the history memory 430 in association with each other.

  When the priority at the time of deleting the execution history is included in the notice instruction, the execution history search unit 410 receives the priority from the instruction decoder 320, the input value of the function corresponding to the priority, and the execution result. Are stored in the history memory 430 for each piece of identification information as an execution history. In this case, the execution history search unit 410 deletes the execution history in the history memory 430 based on the priority stored in the history memory 430. That is, the execution history search unit 410 deletes the execution history in the history memory 430 in order from the execution history associated with the identification information having the highest priority. The execution history search unit 410 is an example of an execution history search unit described in the claims.

  If the execution result is extracted from the history memory 430 by the execution history search unit 410, the execution result output unit 420 stores the execution result in the register file 340 or the store unit 334 via the input selection unit 332. Output. The execution result output unit 420 outputs execution result data to the store unit 334 or the input selection unit 332 depending on the storage location of the execution result. The execution result output unit 420 is an example of an execution result output unit described in the claims.

  The history memory 430 associates the input value corresponding to the identification information and the execution result for each identification information and holds it as an execution history. The history memory 430 is realized by, for example, a content addressable memory (CAM). In this example, the history memory 430 starts searching for an execution history associated with the identification information when the identification information, which is a search key for searching for an execution result, is input from the execution history search unit 410.

  Further, the history memory 430 is associated with the held input value when the input values sequentially supplied from the execution history search unit 410 and the input values held in the history memory 430 all match. The execution result is output to the execution history search unit 410. That is, the execution history search unit 410 extracts an execution result from the history memory 430 by detecting from the history memory 430 the same execution history as the identification information and the input value input from the execution history search unit 410. The history memory 430 is an example of a history memory described in the claims.

  Further, the history memory 430 holds, for example, the priority supplied from the execution history search unit 410, the input value of the function corresponding to the priority, and the execution result for each piece of identification information as an execution history. The history memory 430 realized by this associative memory holds, for example, a pattern of input values in the execution history in a tree structure. Here, an example of a data structure in the history memory 430 will be described below with reference to the drawings.

[Data structure example of history memory 430]
FIG. 3 is a conceptual diagram showing an example of the data structure of the history memory 430 in the first embodiment of the present invention. Here, there is shown a configuration in which the history memory 430 holds the execution history of one piece of identification information in a tree structure among the pieces of execution history held for each piece of identification information for identifying a plurality of functions. In this example, a function is assumed that has n arguments and returns an output as an execution result to m storage destinations. Here, the function address that is the head address of the function is used as identification information.

  In this example, the function route 440 in the tree structure, the first argument nodes 451 and 452, the nth argument nodes 461 to 464, the first output nodes 471 to 474, and the mth output nodes 481 to 484 are displayed. Is shown.

  In the function route 440, a function address that is identification information and a pointer that points to the first argument node 451 are shown.

  The first and nth argument nodes 451, 452, and 461 to 464 include input data indicating an argument value as an argument input value in the execution history held in the history memory 430, the type of the argument, The type indicating the storage location of the argument is shown. The storage location here refers to the register number of the register file 340 or the memory address of the main storage unit 130.

  Further, the first and nth argument nodes 451, 452, and 461 to 464 include a right pointer that points to the argument node in the next argument when the input values to be compared match each other, and the same argument in the case of mismatch And a lower pointer pointing to another argument node. The first and m-th output nodes 471 to 474 and 481 to 484 are connected to the n-th argument nodes 461 to 464, respectively.

  In the first and m-th output nodes 471 to 474 and 481 to 484, output data indicating execution result values as execution results in the execution history held in the history memory 430 and storage locations of the execution results are stored. The type to be shown and the type of the execution result are shown. Furthermore, the first output nodes 471 to 474 show a right pointer that points to the next output node. The first and mth output nodes 471 to 474 and 481 to 484 form a linked list. The right pointers of the m-th output nodes 481 to 484 indicate a null indicating the end of the output node.

  In such a tree structure, when a function address that matches the function address shown in the function route 440 is input from the execution history search unit 410, the first argument node 451 pointed to by the pointer of the function route 440 Input value comparison processing is executed. The input value comparison processing here is to compare the input data, type and type shown in the first argument node 451 with the input value from the execution history search unit 410.

  At this time, for example, when the input value indicated by the first argument node 451 matches the input value from the execution history search unit 410, the next point indicated by the right pointer of the first argument node 451. The input value comparison process is executed at the argument node. On the other hand, when the input value indicated by the first argument node 451 does not match the input value from the execution history search unit 410, the first value indicated by the lower pointer of the first argument node 451 is displayed. Input value comparison processing is executed in the argument node 452.

  In this way, the argument node pointed to by the right or lower pointer is selected based on the result of the comparison process at each argument node, and the input value comparison process is sequentially executed at the selected argument node. For example, when the input value indicated by the nth argument node 461 and the input value from the execution history search unit 410 match each other, the first output node 471 is set by the right pointer of the nth argument node 461. Is pointed to. From the execution result indicating the output data, type and type held in the first output node 471 to the execution result held in the m-th output node 481 in order, the execution result is sequentially output to the execution history search unit 410. The

  Thus, by configuring the history memory 430 with a tree structure for each piece of identification information, it is not necessary to hold the input values of the same argument redundantly, so that a storage area can be saved. Further, by dividing the data structure for each identification information, it is possible to suppress a decrease in search speed.

[Example of operation of data processing apparatus 100 based on notice command including identification information]
FIG. 4 is a conceptual diagram showing an operation outline of the data processing apparatus 100 when the data processing apparatus 100 according to the first embodiment of the present invention receives a notice instruction including identification information. FIG. 4A is a diagram illustrating a part of an instruction sequence described in assembly language. FIG. 4A shows a notice instruction (noticeCall) that specifies an index (index) and a call instruction (Call) that calls a function (func).

  FIG. 4B is a conceptual diagram showing an example of execution history search data for each identification information in the history memory 430. FIG. 4B shows the correspondence between the column 431 of identification information (index 0 to k) indicated by the index (index) and the column 432 of execution history search data (execution history search data 0 to k). ing. The execution history search data here indicates search data configured by the tree structure shown in FIG.

  In this case, the notice instruction (noticeCall) is supplied to the instruction decoder 320, whereby the identification information “index k” indicated by the index (index) is supplied from the instruction decoder 320 to the execution history search unit 410. Then, when the identification information “index k” is input to the history memory 430 by the execution history search unit 410, “execution history search data k” in the function (func) identified by this identification information (index k) is obtained. Based on this, the search of the execution history is started.

  Thereafter, based on an input value setting command for setting an input value of an argument in the function, the execution history search unit 410 acquires the input value of the argument of the function (func), and the acquired input value is stored in the history memory 430. Input sequentially. Thereby, the input value held in the execution history search data (execution history search data k) corresponding to the identification information “index k” and the input value from the execution history search unit 410 are sequentially compared.

  Then, when the call instruction (call) is supplied to the instruction decoder 320, whether or not there is an execution history that matches the identification information and the input value acquired by the execution history search unit 410 is transferred from the history memory 430 to the execution history search unit 410. Be notified. That is, the execution history search unit 410 refers to the presence / absence of an execution result that can reuse the function (func) as a search result based on the execution history search data k based on the call command (call).

  At this time, when the execution result is output from the history memory 430, the execution of the function (func) is omitted. On the other hand, when the execution result is not output, the function (func) is executed, and the executed execution result and the identification information and the input value already acquired by the execution history search unit 410 are stored in the history memory 430. Is done.

  As described above, the data processing apparatus 100 acquires the input value of the argument of the function (func) based on the notice instruction (noticeCall) before executing the call instruction (call) of the function (func). Then, the comparison between the input value of the function (func) and the input value of the function (func) held in the history memory 430 is terminated. Next, a more specific operation example in the data processing apparatus 100 based on a notice command including identification information will be described with reference to a drawing showing an MIPS command code.

[Operation example by notice command including identification information]
FIG. 5 is a diagram illustrating a part of a program executed by the data processing apparatus 100 according to the first embodiment of the present invention. FIG. 5A is a diagram illustrating an example of a part of a source program of a function selected as a reuse section. FIG. 5B is a diagram illustrating a part of an instruction sequence in which the source program shown in FIG. 5A is converted by the MIPS assembly language.

  In the upper part of FIG. 5A, a call to a function (func) having five arguments (a to e) is described. In the lower part, the definition of an int type function (func) is described. This function (func) is a first argument (a), second argument (b), third argument (c), fourth argument (d) and fifth argument as int type arguments. With an argument (e). FIG. 5B shows a part of an instruction sequence generated by converting such a source program by the MIPS assembly language and performing a notice instruction insertion process.

  FIG. 5B shows a first instruction sequence (noticeCall), a second instruction sequence (lw), a third instruction sequence (lw), a fourth instruction sequence (move), a fifth instruction sequence ( move), sixth instruction sequence (sw), seventh instruction sequence (lw), and eighth instruction sequence (jalr). Here, it is assumed that the input values A to E of the first to fifth arguments are all integers.

  In the first instruction sequence, a notice instruction (noticeCall) designating an index (index) is executed. As a result, the identification information indicated by the index supplied by the instruction decoder 320 is input from the execution history search unit 410 to the history memory 430, whereby the execution history is searched.

  In the second instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “1000” is added to the reference address stored in the register 28 (R28), and the data stored in the memory address of the main storage unit 130 designated by the added value (the first value) The input value A) of the argument is transferred to the register 4 (R4).

  The load word instruction (lw) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R4”. It is judged that there is. Therefore, the input value A transferred to the register 4 (R4) is also supplied to the execution history search unit 410 and is compared with the input value of the first argument held in the history memory 430. At this time, if the input value A is held among the input values of the first argument held in the history memory 430, the process proceeds to the comparison process of the input value of the second argument. On the other hand, if the input value A is not held, the search of the execution history is terminated.

  In the third instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “1004” is added to the reference address stored in the register 28 (R28), and the data stored in the memory address of the main storage unit 130 specified by the added value (the second address) The argument input value B) is transferred to the register 5 (R5).

  The load word instruction (lw) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R5”. It is judged. Therefore, the input value B stored in the register 5 (R5) is also supplied to the execution history search unit 410 and compared with the input value of the second argument held in the history memory 430. At this time, if the input value B is held among the input values of the second argument held in the history memory 430, the process proceeds to the comparison process of the input value of the third argument. On the other hand, if the input value B is not held, the execution history search is terminated.

  In the fourth instruction sequence, a move instruction (move) is executed. Thereby, the data (the input value C of the third argument) stored in the register 10 (R10) is transferred to the register 6 (R6). Since the move instruction (move) has the transfer destination register number “R6”, the instruction decoder 320 determines that the move instruction (move) is an input value setting instruction for setting the input value of the argument. For this reason, the input value C stored in the register 6 (R6) is also supplied to the execution history search unit 410 and compared with the input value of the third argument held in the history memory 430.

  At this time, if the input value C is held among the input values of the third argument held in the history memory 430, the process proceeds to the input value comparison process of the fourth argument. On the other hand, if the input value C is not held, the execution history search is terminated.

  In the fifth instruction sequence, a move instruction (move) is executed. Thereby, the data (the input value D of the fourth argument) stored in the register 11 (R11) is transferred to the register 7 (R7). The move instruction (move) is determined to be an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the move instruction (move) is “R7”. Is done. Therefore, the input value D stored in the register 7 (R7) is also supplied to the execution history search unit 410 and is compared with the input value of the fourth argument held in the history memory 430.

  At this time, if the input value D is held among the input values of the fourth argument held in the history memory 430, the process proceeds to the input value comparison process of the fifth argument. On the other hand, if the input value D is not held, the execution history search is terminated.

  In the sixth instruction sequence, a store word instruction (sw) is executed. As a result, “16” is added to the value of the stack pointer stored in the register 29 (R29), and the data (fifth argument) stored in the register 12 (R12) is added to the memory address of the added value. Input value E) is transferred. Since the transfer destination register number indicated by the store word instruction (sw) is “R29” and the offset value is “16” or more, this store word instruction (sw) is input with an argument by the instruction decoder 320. It is determined that this is an input value setting command for setting a value.

  Thus, the input value E transferred to the main storage unit 130 is also supplied to the execution history search unit 410 and compared with the input value of the fifth argument held in the history memory 430. At this time, if the input value E is held among the input values of the fifth argument held in the history memory 430, the execution result in the execution history in which the input values A to E of all the arguments match is the execution history. It is output to the search unit 410. On the other hand, if the input value A is not held, the search of the execution history is terminated.

  In the seventh instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “2000” is added to the reference address stored in the register 28 (R28), and the data (start address of the function func) stored in the memory address of the added value is stored in the register 25 ( R25).

  The load word instruction (lw) is not an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R25”. To be judged. For this reason, the execution history search unit 410 does not acquire the data output from the input selection unit 332.

  In the eighth instruction sequence, a jump instruction (jalr) is executed. As a result, the instruction at the head address of the function (func) stored in the register 25 (R25) is read. At this time, the instruction decoder 320 notifies the execution history search unit 410 of an input value end signal indicating that the setting of input values of all the first to fifth arguments in the function (func) has ended.

  At this time, if an execution result is output from the history memory 430, the execution history search unit 410 outputs the execution result to the execution result output unit 420, and omits the function (func) processing. A signal is supplied to the fetch unit 310. On the other hand, if the execution result is not output from the history memory 430, the execution history search unit 410 records the execution result after the execution of the function (func) and the identification information and the input value acquired based on the notice instruction. Registered in the memory 430.

  Next, an example in which the processing time of the function is shortened by the notice command when the execution history held in the history memory 430 matches the identification information and the input value acquired by the execution history search unit 410 will be described below. Will be described with reference to FIG.

[Example of time reduction of function processing by data processing apparatus 100]
FIG. 6 is a conceptual diagram showing an example in which the processing time in the function is shortened by executing the notice instruction. FIG. 6A is a conceptual diagram showing a shortened time due to reuse of execution results in a conventional data processing apparatus that executes processing of a program without a notice instruction. FIG. 6B is a conceptual diagram showing a shortened time by reusing the execution result in the data processing apparatus 100 according to the first embodiment of the present invention.

  6 (a) and 6 (b), an example in which a function having two arguments is called by a call instruction (call) in the upper routine and returns from the lower routine by a return instruction (return) upon completion of processing in the function. It is shown. Here, time passes from the left to the right.

  FIG. 6A shows an input value A setting 321 and an input value B setting 322 in the upper routine, and an input value A use 323 and an input value B use 324 in the lower routine.

  The input value A setting 321 and the input value B setting 322 indicate the timing when the input value of the argument in the function is set. As described in FIG. 1, this is a processing procedure by a program described in accordance with the ABI rules. The input value A use 323 and the input value B use 324 indicate the timing at which the input value that is an argument is used in the processing of the function that is a lower level routine.

  In this case, the input values A and B that are the arguments of the function cannot be specified until all the two arguments are used in the lower-level routine (use of the input value B 324). Therefore, even when the input values A and B, which are arguments of the function, all match the input values held in the history memory 430, the shortened period from the input value B use 324 to the return instruction (return) Only t1 can reduce the processing time of the function.

  FIG. 6B shows a notice instruction 421 in addition to the timing shown in FIG. The notice instruction 421 indicates the timing at which the notice instruction is decoded by the instruction decoder 320. Since components other than the notice command 421 are the same as those in FIG. 6A, the same reference numerals as those in FIG.

  In this case, since the identification information for identifying the function is specified by the notice instruction 421, the function execution history can be searched by inputting the identification information that is the search key of the history memory 430 into the history memory 430. Be started. The execution history search unit 410 supplies the input values A and B acquired based on the two input value setting commands for setting the input values A and B of the argument to the history memory 430.

  Thereafter, based on the call command (call), it is determined whether or not the acquired input values A and B match all the input values held in the history memory 430. If they all match, the shortening period t2 required for the processing of the lower-level routine (from call to return) as a function is reduced.

  As described above, the data processing apparatus 100 ends the search of the execution result for the history memory 430 in the execution history search period t by acquiring the identification information and the input value of the argument included in the warning command based on the warning command. be able to. Thereby, when the execution result held in the history memory 430 can be reused, the period that can be shortened (shortening period t2) can be made longer than the conventional shortening period t1.

[Operation Example of Data Processing Device 100]
Next, the operation of the data processing apparatus 100 according to the embodiment of the present invention will be described with reference to the drawings.

  FIG. 7 is a flowchart illustrating an example of a processing procedure of the execution result reusing method of the data processing apparatus 100 according to the first embodiment of the present invention.

  First, the instruction decoder 320 decodes the notice instruction supplied from the fetch unit 310 (step S911). Then, the instruction decoder 320 supplies the search key of the history memory 430 that is the identification information specified by the notice instruction to the execution history search unit 410, whereby the execution history search unit 410 acquires the identification information. In other words, the identification information included in the notice command is acquired by the execution history search unit 410, and the acquired identification information is input from the execution history search unit 410 to the history memory 430 (step S912). As a result, a search for a plurality of execution histories corresponding to the identification information in the history memory 430 is started. Note that step S912 is an example of an acquisition procedure described in the claims.

  Subsequently, the fetch unit 310 reads an instruction to be executed next to the notice instruction (step S913). Thereafter, the instruction decoder 320 determines whether or not the instruction read from the fetch unit 310 is an input value setting instruction for setting the input value of the first argument of the function (step S914).

  If it is determined that the instruction is an input value setting command, the instruction decoder 320 supplies the input value of the argument set by the input value setting command to the execution history search unit 410, thereby executing the execution history search unit. In 410, the input value of the argument is acquired (step S921). Step S921 is an example of an acquisition procedure described in the claims.

  Subsequently, it is determined whether or not the input value of the argument acquired by the execution history search unit 410 matches the input value of the argument associated with the identification information in the history memory 430 (step S922). And when both input values do not correspond, it returns to the process of step S913.

  On the other hand, if the two input values match, the pointer is advanced to the next argument node for comparing the input values of the next argument in the history memory 430 (step S923), and the process returns to step S913. . That is, if there is an argument node that matches the input value from the execution history search unit 410 among the plurality of argument nodes, the next argument node is indicated by the right pointer of the argument node.

  In this way, a series of processes in steps S913, S914, and S921 to S923 are repeatedly executed until the input values of all the arguments are set. Steps S922 and S923 are an example of an execution history search procedure described in the claims.

  On the other hand, if it is determined in step S914 that the instruction is not an input value setting instruction, the instruction decoder 320 determines whether the instruction read from the fetch unit 310 is a call instruction for calling a function. (Step S915). If it is determined that the instruction is not a calling instruction, the process returns to step S913.

  On the other hand, if it is determined that the instruction is a call instruction, it is determined whether or not the input values set by the input value setting instruction all match the input values associated with the identification information in the history memory 430 (step S916). ). If all input values match, an execution result reuse process is executed (step S924). That is, the execution result in the history memory 430 corresponding to the identification information and the input value acquired by the execution history search unit 410 is output from the execution result output unit 420. Then, the processing of the function that is written back to the main storage unit 130 or the register file 340 and called is completed. Note that S924 is an example of an execution result output procedure described in the claims.

  On the other hand, if all input values do not match, the called function is executed (step S917). Then, the execution history search unit 410 acquires the execution result of the executed function (step S918). Subsequently, the execution history search unit 410 registers the acquired execution result and the input value acquired in steps S912 and S921 in the history memory 430 (step S919).

  As described above, in the first embodiment of the present invention, the function identification information and the input value set by the input value setting command executed after the notice command are notified by the notice command for notifying the execution of the function. Can be specified before the function is executed. Thereby, when a function is called, an execution history in the history memory 430 that matches the specified identification information and input value can be extracted. Further, when the execution result in the execution history is extracted from the history memory 430, the execution of the function called by the call instruction can be omitted, so that the processing time of the function by reusing the execution result is greatly reduced. be able to.

  In the first embodiment of the present invention, the example in which the identification information that is the search key of the history memory 430 is included in the notice command has been described. However, the identification information is used as the start address of the function, and the start address of the function is referred to. Reference information for this may be included in the notice command. Accordingly, an example of searching for an execution history in the history memory 430 based on a notice command including reference information will be described below as a second embodiment with reference to the drawings.

<Second Embodiment>
[Operation example of data processing apparatus 100 based on notice command including reference information]
FIG. 8 is a conceptual diagram showing an outline of the operation of the data processing apparatus 100 when the data processing apparatus 100 according to the second embodiment of the present invention receives a notice command including reference information. Here, it is assumed that a function address that is a start address of a function is used as identification information that is a search key of the history memory 430.

  FIG. 8A is a diagram illustrating a part of an instruction sequence described in assembly language. FIG. 8A shows a load word instruction (lw) for setting a function address in the register 25 (R25) and a notice instruction (noticeCall) including reference information (R25). Further, here, a call instruction (Call) for calling a function stored in the register 25 (R25) is shown.

  As described above, the reference number of the notice instruction (noticeCall) indicates the register number (R25) in which the function address is stored. Further, when generating a warning instruction including such reference information, it is assumed that a load word instruction (lw) for setting a function address is generated before the warning instruction in the compilation process.

  FIG. 8B is a conceptual diagram showing an example of execution history search data for each function address, which is identification information in the history memory 430. FIG. 8B shows a column 433 of function addresses (function addresses 0 to k) stored in the register 25 (R25) indicated by the reference information (R25) and execution history search data (execution history search data 0). To k) are shown in correspondence with the column 434. The execution history search data here indicates search data configured by the tree structure shown in FIG.

  In this case, the instruction decoder 320 causes the execution history search unit 410 to output “function address 1” stored in the register 25 (R25) based on the reference information (R25) included in the notice instruction (noticeCall). . That is, the execution unit 330 outputs the function address “function address 1” to the execution history search unit 410 based on the notice command including the reference information. Then, when the “function address 1” is input to the history memory 430 by the execution history search unit 410, the search of the execution history is started based on the execution history search data 1 corresponding to the function address 1. .

  Thereafter, based on the input value setting command for setting the input value of the argument in the function, the execution history search unit 410 holds the input value of the argument in the function, and the held input value is sequentially stored in the history memory 430. Entered. Thereby, the input value held in the execution history search data (execution history search data 1) corresponding to the function address (function address 1) and the input value from the execution history search unit 410 are sequentially compared.

  Then, when the call instruction (call) is supplied to the instruction decoder 320, whether or not there is an execution history that matches the function address and the input value acquired by the execution history search unit 410 is checked from the history memory 430 to the execution history search unit 410. Will be notified. That is, the execution history search unit 410 refers to the presence or absence of an execution result that can be reused as a search result by the execution history search data 1 corresponding to the function address 1 based on the call instruction (call).

  At this time, when the execution result is output from the history memory 430, the execution of the function is omitted. On the other hand, when the execution result is not output, the processing of the function is executed as it is, and the executed execution result and the identification information and input value already held by the execution history search unit 410 are stored in the history memory 430. be registered.

  As described above, the data processing apparatus 100 identifies the search key of the history memory 430 based on the reference information included in the notice instruction (noticeCall) before executing the call instruction (call) of the function (function address 1). Information (function address 1) can be acquired. Next, a more specific operation example in the data processing apparatus 100 based on a notice command including reference information will be described with reference to the drawing showing a command code by MIPS.

[Specific operation example of the data processing apparatus 100 based on a notice command including reference information]
FIG. 9 is a diagram illustrating a part of a program executed by the data processing apparatus 100 according to the second embodiment of the present invention. FIG. 9A is a diagram illustrating an example of a part of a source program of a function selected as a reuse section. FIG. 5B is a diagram illustrating a part of an instruction sequence in which the source program shown in FIG. 5A is converted by the MIPS assembly language.

  In the upper part of FIG. 9A, a call to a function (func) having five arguments (a to e) is described. In the lower part, the definition of an int type function (func) is described. This function (func) is a first argument (a), second argument (b), third argument (c), fourth argument (d) and fifth argument as int type arguments. With an argument (e). FIG. 9B shows a part of an instruction sequence generated by converting such a source program by the MIPS assembly language and performing a notice instruction insertion process.

  In FIG. 9B, the first instruction sequence (lw), the second instruction sequence (noticeCall), the third instruction sequence (lw), the fourth instruction sequence (lw), the fifth instruction sequence ( move), sixth instruction sequence (move), seventh instruction sequence (sw), and eighth instruction sequence (jalr). Here, it is assumed that input values A to E of function arguments are all integers.

  In the first instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “2000” is added to the reference address stored in the register 28 (R28), and the data (start address of the function func) stored in the memory address of the added value is stored in the register 25 ( R25). Thus, the load word instruction that sets the start address of the function read from the main storage unit 130 in the register file 340 is referred to as an address setting instruction.

  In the second instruction sequence, a notice instruction (noticeCall) including reference information (R25) is executed. Thereby, under the control of the instruction decoder 320, the function address, which is identification information stored in the register 25, is output to the execution history search unit 410 based on the reference information (R25). That is, the execution unit 330 outputs a function address to the execution history search unit 410 based on the notice command including the reference information. Then, the execution history search unit 410 inputs the function address to the history memory 430, whereby the execution history is searched.

  In the third instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “1000” is added to the reference address stored in the register 28 (R28), and the data (first argument of the first argument) stored in the memory address of the main storage unit 130, which is the added value, is added. The input value A) is transferred to the register 4 (R4).

  The load word instruction (lw) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R4”. It is judged. For this reason, the input value A transferred to the register 4 (R4) is also supplied to the execution history search unit 410 and compared with the input value of the first argument held in the history memory 430. At this time, if the input value A is held among the input values of the first argument held in the history memory 430, the process proceeds to the comparison process of the input value of the second argument. On the other hand, if the input value A is not held, the search of the execution history is terminated.

  In the fourth instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “1004” is added to the reference address stored in the register 28 (R28), and the data (the second argument of the second argument) stored in the memory address of the main storage unit 130, which is the added value, is added. The input value B) is transferred to the register 5 (R5).

  The load word instruction (lw) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R5”. It is judged that there is. Therefore, the input value B stored in the register 5 (R5) is also supplied to the execution history search unit 410 and compared with the input value of the second argument held in the history memory 430. At this time, if the input value B is held among the input values of the second argument held in the history memory 430, the process proceeds to the comparison process of the input value of the third argument. On the other hand, if the input value B is not held, the execution history search is terminated.

  In the fifth instruction sequence, a move instruction (move) is executed. Thereby, the data (the input value C of the third argument) stored in the register 10 (R10) is transferred to the register 6 (R6). The move instruction (move) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated in the move instruction (move) is “R6”. To be judged. For this reason, the input value C stored in the register 6 (R6) is also supplied to the execution history search unit 410 and compared with the input value of the third argument held in the history memory 430.

  At this time, if the input value C is held among the input values of the third argument held in the history memory 430, the process proceeds to the input value comparison process of the fourth argument. On the other hand, if the input value C is not held, the execution history search is terminated.

  In the sixth instruction sequence, a move instruction (move) is executed. Thereby, the data (the input value D of the fourth argument) stored in the register 11 (R11) is transferred to the register 7 (R7). The move instruction (move) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated in the move instruction (move) is “R7”. Identified. Therefore, the input value D stored in the register 7 (R7) is also supplied to the execution history search unit 410 and is compared with the input value of the fourth argument held in the history memory 430.

  At this time, if the input value D is held among the input values of the fourth argument held in the history memory 430, the process proceeds to the input value comparison process of the fifth argument. On the other hand, if the input value D is not held, the execution history search is terminated.

  In the seventh instruction sequence, a store word instruction (sw) is executed. As a result, “16” is added to the value of the stack pointer stored in the register 29 (R29), and the data (fifth argument) stored in the register 12 (R12) is added to the memory address of the added value. Input value E) is transferred. This store word instruction (sw) has the transfer destination register number “R29” indicated by the store word instruction (sw) and the offset value is “16” or more. It is determined that this is an input value setting command for setting an input value.

  As a result, the input value E transferred to the main storage unit 130 is also supplied to the execution history search unit 410, and the supplied input value E and the input value of the fifth argument held in the history memory 430 Are compared. At this time, if the input value E is held among the input values of the fifth argument held in the history memory 430, the execution result in the execution history in which the input values A to E of all the arguments match is the execution history. It is output to the search unit 410. On the other hand, if the input value A is not held, the search of the execution history is terminated.

  In the eighth instruction sequence, a jump instruction (jalr) is executed. As a result, the instruction at the head address of the function (func) stored in the register 25 (R25) is read. At this time, the instruction decoder 320 notifies the execution history search unit 410 of an input value end signal indicating that the setting of input values of all the first to fifth arguments in the function (func) has ended.

  At this time, if an execution result is output from the history memory 430, the execution history search unit 410 outputs the execution result to the execution result output unit 420, and omits the function (func) processing. A signal is supplied to the fetch unit 310. On the other hand, if the execution result is not output from the history memory 430, the execution history search unit 410 records the execution result after the execution of the function (func) and the identification information and the input value acquired based on the notice instruction. Registered in the memory 430.

  As described above, in the second embodiment of the present invention, the execution history search unit 410 performs the start address of the function based on the reference information included in the notice command before the function identified by the notice command is executed. Can be acquired as identification information. As a result, the execution history search unit 410 uses the execution history stored in the history memory 430 based on the start address of the function that is the reuse section output from the execution unit 330 as the identification information and the input value of the function. The execution result can be searched.

  That is, the execution result reuse processing unit 400 can acquire the identification information and the input value in the execution history search unit 410 by a notice command including reference information, and thus is retained in the history memory 430 before the function is executed. Execution history can be searched.

  Here, an example in which a function address is acquired by a notice command including reference information has been described. However, a notice setting command using an address setting command for setting a function address as a notice command may be used. Next, an example in which an execution history held in the history memory 430 is searched in response to a notice setting instruction will be described below as a third embodiment with reference to the drawings.

<Third Embodiment>
[Operation example of data processing apparatus 100 based on notice command including reference information]
FIG. 10 is a conceptual diagram showing an outline of the operation of the data processing apparatus 100 when a notice setting command is received in the data processing apparatus 100 according to the third embodiment of the present invention. Here, it is assumed that a function address that is a start address of a function is used as identification information that is a search key of the history memory 430.

  FIG. 10A is a diagram illustrating a part of an instruction sequence described in assembly language. FIG. 10A shows a notice setting instruction (memolw) for setting a function address in the register 25 (R25) and a call instruction (Call) for calling a function corresponding to the function address stored in the register 25 (R25). It is shown.

  In this way, by using the notice setting instruction (memolw), the address setting instruction (lw) for setting the function address in the register 25 (R25) can be omitted as compared with the second embodiment.

  FIG. 10B is a conceptual diagram showing an example of execution history search data for each function address, which is identification information in the history memory 430. FIG. 10B shows a column 435 of function addresses (function addresses 0 to k) set in the register 25 (R25) by the notice setting instruction (memolw) and execution history search data (execution history search data 0 to k). ) Column 436 is shown. The execution history search data here indicates search data configured by the tree structure shown in FIG.

  In this case, the instruction decoder 320 sets “function address 1” in the register 25 (R25) indicated in the setting information specified in the notice setting instruction (memolw), and also sets “function address” in the execution history search unit 410. 1 ”is acquired. That is, the execution unit 330 sets the function start address “function address 1” as the setting destination (R25) based on the notice setting instruction (memolw) including setting information indicating the setting destination (R25) of the function start address. .

  Then, when the “function address 1” is input to the history memory 430 by the execution history search unit 410, the search of the execution history starts based on the “execution history search data 1” corresponding to the function address 1. Is done.

  Thereafter, based on the input value setting command for setting the input value of the argument in the function, the execution history search unit 410 acquires the input value of the argument, and the acquired input value is sequentially input to the history memory 430. The Thereby, the input value held in the execution history search data (execution history search data 1) corresponding to the function address (function address 1) and the input value from the execution history search unit 410 are sequentially compared.

  Then, the call instruction (call) is supplied to the instruction decoder 320, whereby the function memory (function address 1) acquired by the execution history search unit 410 and the presence / absence of the execution history matching the input value are executed from the history memory 430. The history search unit 410 is notified. That is, the execution history search unit 410 refers to the search result by the execution history search data 1 corresponding to the function address 1 based on the call command (call).

  At this time, when the execution result is output from the history memory 430, the execution of the function is omitted. On the other hand, if the execution result is not output, the function processing is executed, and the executed execution result and the function address and input value, which are identification information already acquired by the execution history search unit 410, are stored in the history memory. 430.

  As described above, the data processing apparatus 100 executes the function history (function address 1) set by the notice setting instruction (memolw) before executing the call instruction (call) of the function (function address 1). 410 can be obtained. Next, a more specific operation example in the data processing apparatus 100 based on the notice setting instruction will be described with reference to the drawings showing instruction codes based on MIPS.

[Specific operation example of data processing apparatus 100 based on notice setting command]
FIG. 11 is a diagram illustrating a part of a program executed by the data processing apparatus 100 according to the third embodiment of the present invention. In the upper part of FIG. 11A, a call to a function (func) having five arguments (a to e) is described. In the lower part, the definition of an int type function (func) is described. This function (func) is a first argument (a), a second argument (b), a third argument (c), a fourth argument (d), and a fifth argument as int type arguments. With an argument (e).

  FIG. 11B shows a part of an instruction sequence generated by converting such a source program by the MIPS assembly language and performing a notice instruction insertion process.

  In FIG. 11B, the first instruction sequence (memolw), the second instruction sequence (lw), the third instruction sequence (lw), the fourth instruction sequence (move), the fifth instruction sequence ( move), a sixth instruction string (sw), and a seventh instruction string (jalr). Here, it is assumed that input values A to E of function arguments are all integers.

  In the first instruction sequence, a notice setting instruction (memolw) is executed. As a result, the offset value “2000” is added to the reference address stored in the register 28 (R28), and the data (start address of the function func) stored in the memory address of the added value is stored in the register 25 ( R25). That is, the execution unit 330 sets the function start address as the setting destination based on the setting information indicating the setting destination of the function start address included in the notice setting instruction.

  At the same time, the function history output from the input selection unit 332 is acquired by the execution history search unit 410 based on the acquisition signal supplied by the instruction decoder 320. Then, the execution history search unit 410 inputs the function address to the history memory 430, whereby the execution history is searched.

  In the second instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “1000” is added to the reference address stored in the register 28 (R28), and the data (first argument of the first argument) stored in the memory address of the main storage unit 130, which is the added value, is added. The input value A) is transferred to the register 4 (R4).

  The load word instruction (lw) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R4”. It is judged that there is. For this reason, the input value A transferred to the register 4 (R4) is also supplied to the execution history search unit 410 and compared with the input value of the first argument held in the history memory 430.

  At this time, if the input value A is held among the input values of the first argument held in the history memory 430, the process proceeds to the comparison process of the input value of the second argument. On the other hand, if the input value A is not held, the search of the execution history is terminated.

  In the third instruction sequence, the load word instruction (lw) is executed. As a result, the offset value “1004” is added to the reference address stored in the register 28 (R28), and the data (the second argument of the second argument) stored in the memory address of the main storage unit 130, which is the added value, is added. The input value B) is transferred to the register 5 (R5).

  The load word instruction (lw) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated by the load word instruction (lw) is “R5”. It is judged that there is. Therefore, the input value B stored in the register 5 (R5) is also supplied to the execution history search unit 410 and compared with the input value of the second argument held in the history memory 430.

  At this time, if the input value B is held among the input values of the second argument held in the history memory 430, the process proceeds to the comparison process of the input value of the third argument. On the other hand, if the input value B is not held, the execution history search is terminated.

  In the fourth instruction sequence, a move instruction (move) is executed. Thereby, the data (the input value C of the third argument) stored in the register 10 (R10) is transferred to the register 6 (R6). Since the move instruction (move) has a transfer destination register number “R6”, the instruction decoder 320 determines that the move instruction (move) is an input value setting instruction for setting an input value of an argument. As a result, the input value C stored in the register 6 (R6) is also supplied to the execution history search unit 410. Therefore, the input value C supplied to the execution history search unit 410 is held in the history memory 430. The input value of the third argument is compared.

  At this time, if the input value C is held among the input values of the third argument held in the history memory 430, the process proceeds to the input value comparison process of the fourth argument. On the other hand, if the input value C is not held, the execution history search is terminated.

  In the fifth instruction sequence, a move instruction (move) is executed. Thereby, the data (the input value D of the fourth argument) stored in the register 11 (R11) is transferred to the register 7 (R7). The move instruction (move) is an input value setting instruction for setting the input value of the argument by the instruction decoder 320 because the transfer destination register number indicated in the move instruction (move) is “R7”. Identified. Therefore, the input value D stored in the register 7 (R7) is also supplied to the execution history search unit 410 and is compared with the input value of the fourth argument held in the history memory 430.

  At this time, if the input value D is held among the input values of the fourth argument held in the history memory 430, the process proceeds to the input value comparison process of the fifth argument. On the other hand, if the input value D is not held, the execution history search is terminated.

  In the sixth instruction sequence, a store word instruction (sw) is executed. As a result, “16” is added to the value of the stack pointer stored in the register 29 (R29), and the data (fifth argument) stored in the register 12 (R12) is added to the memory address of the added value. Input value E) is transferred. This store word instruction (sw) has the transfer destination register number “R29” indicated by the store word instruction (sw) and the offset value is “16” or more. It is determined that this is an input value setting command for setting an input value.

  As a result, the input value E transferred to the main storage unit 130 is also supplied to the execution history search unit 410, and the supplied input value E and the input value of the fifth argument held in the history memory 430 Are compared. At this time, if the input value E is held among the input values of the fifth argument held in the history memory 430, the execution result in the execution history in which the input values A to E of all the arguments match is the execution history. It is output to the search unit 410. On the other hand, if the input value A is not held, the search of the execution history is terminated.

  In the seventh instruction sequence, a jump instruction (jalr) is executed. As a result, the instruction at the head address of the function (func) stored in the register 25 (R25) is read. At this time, the instruction decoder 320 notifies the execution history search unit 410 of an input value end signal indicating that the setting of input values of all the first to fifth arguments in the function (func) has ended.

  At this time, if an execution result is output from the history memory 430, the execution history search unit 410 outputs the execution result to the execution result output unit 420, and omits the function (func) processing. A signal is supplied to the fetch unit 310. On the other hand, if the execution result is not output from the history memory 430, the execution history search unit 410 records the execution result after the execution of the function (func) and the identification information and the input value acquired based on the notice instruction. Registered in the memory 430.

  As described above, in the third embodiment of the present invention, the execution history search unit 410 acquires, as identification information, a function address set based on a notice setting instruction corresponding to the function before the function is executed. be able to. Thereby, the execution history search unit 410 can search for an execution result in the history memory 430 based on the start address of the function set by the execution unit 330 and the input value of the function acquired by the notice setting instruction. it can.

  That is, the execution result reuse processing unit 400 can acquire the identification information and the input value in the execution history search unit 410 according to the notice setting command, so that the execution history held in the history memory 430 before the function is executed. Can be searched.

  As described above, in the first to third embodiments of the present invention, the processing time by reusing the execution result of the function is significantly shortened based on the notice instruction included in the program stored in the main storage unit 130. be able to. Next, a program conversion apparatus for inserting such a notice command into a program will be described with reference to the drawings.

<4. Fourth Embodiment>
[Configuration example of program conversion device]
FIG. 12 is a block diagram showing a functional configuration example of the program conversion processing device according to the fourth embodiment of the present invention. The program conversion processing device 500 includes a source program storage unit 510, a notice instruction insertion code generation unit 600, and an object program storage unit 520. The program conversion processing device 500 is an example of a program conversion processing device described in the claims.

  The source program storage unit 510 stores a source program to be compiled. This source program is a source program including a reuse section in which the execution result is used again. The source program storage unit 510 supplies the stored source program to the notice instruction insertion code generation unit 600.

  The notice instruction insertion code generation unit 600 compiles the source program from the source program storage unit 510 to generate an object program that is a machine language program after performing processing for inserting the notice instruction. . The notice instruction insertion code generation unit 600 stores the generated object program in the object program storage unit 520. The notice instruction insertion code generation unit 600 includes a program analysis unit 610, a program optimization processing unit 620, and a code generation unit 630.

  The program analysis unit 610 executes analysis processing such as morphological analysis and syntax analysis based on the source program read from the source program storage unit 510. The program analysis unit 610 generates a program with an intermediate expression expressed by an intermediate code in a format suitable for analysis or optimization, and executes an analysis process on the generated program.

  The program analysis unit 610 includes a reuse candidate section extraction unit 611 and a reuse candidate section analysis unit 612. The reuse candidate section extraction unit 611 extracts a reuse candidate section, which is a candidate for a reuse section that reuses an execution result, from the program among a plurality of command sections. For example, the reuse candidate section extraction unit 611 extracts a function that becomes a reuse candidate section from among a plurality of functions that are command sections that are executed a plurality of times.

  Further, the reuse candidate section extraction unit 611 excludes a function whose execution result cannot be reused from the reuse candidate section because the execution result is different even if the input values of the reuse candidate section are the same. For example, the reuse candidate section extraction unit 611 excludes a function including a branch instruction in the instruction section from the reuse candidate section. The reuse candidate section extraction unit 611 supplies the extracted reuse candidate section identification information together with the program to the reuse candidate section analysis unit 612.

  The reuse candidate section analysis unit 612 analyzes the usage mode of the reuse candidate section extracted by the reuse candidate section extraction unit 611. The reuse candidate section analysis unit 612 analyzes, for example, the number and types of arguments in a function and the number of times that one function is executed for each function as a usage mode. In this example, the reuse candidate section analysis unit 612 outputs, for example, the number of ranges that the argument can take from the processing contents of the function as the analysis result of the usage mode. The reuse candidate section analysis unit 612 supplies the analysis result to the program optimization processing unit 620 together with the identification information of the reuse candidate section and the program.

  The program optimization processing unit 620 performs optimization for improving the execution speed of the program and optimization for reducing the code size based on the program supplied from the reuse candidate section analysis unit 612. The program optimization process is executed. The program optimization processing unit 620 includes a reuse degree generation unit 621, a reuse section selection unit 622, and a notice instruction generation processing unit 623.

  Based on the analysis result supplied from the reuse candidate section analysis unit 612, the reuse degree generation unit 621 generates a reuse degree indicating the degree to which the execution result of the reuse candidate section is reused. In other words, the reuse level generation unit 621 generates a reuse level indicating the degree to which the execution results of the instruction sections executed a plurality of times coincide with each other based on the usage state of the instruction sections.

  For example, the reuse degree generation unit 621 generates a reuse degree according to the number of executions of the reuse candidate section. In this case, for example, the reuse degree generation unit 621 sets the degree of reuse larger as the number of executions increases. In addition, the reuse level generation unit 621 generates the reuse level according to the number of ranges that can be taken by the input value of the reuse candidate section, for example. In this case, the degree of reuse is calculated by, for example, multiplying the inverse of the number of combinations by a constant. For this reason, it means that it is a reuse candidate area with a high degree of reuse, so that the reuse degree of a reuse candidate area is large.

  The reuse level generation unit 621 supplies the generated reuse level to the reuse interval selection unit 622 together with the identification information of the program and the reuse candidate interval. The reuse level generation unit 621 is an example of a reuse level generation unit described in the claims.

  The reuse section selection unit 622 selects a reuse section from among the plurality of reuse candidate sections based on the reuse degree of the reuse candidate section supplied from the reuse degree generation unit 621. For example, the reuse section selection unit 622 selects a reuse candidate section that is equal to or greater than a certain threshold (reuse threshold) regarding the degree of reuse as a reuse section.

  Further, the reuse section selection unit 622 generates a priority when deleting the execution history for each piece of identification information in the history memory 430 based on the degree of reuse. In this example, the reuse segment selection unit 622 generates the priority so that the higher the reuse degree, the lower the priority. In addition, the reuse section selection unit 622 supplies the identification information and the priority related to the selected reuse section to the notice instruction generation processing unit 623 together with the program.

  The notice command generation processing unit 623 generates a notice command including information for specifying the reuse section before the calling instruction for calling the reuse section selected by the reuse section selection unit 622. is there. The notice instruction generation processing unit 623 generates an input value setting instruction for setting the input value of the reuse section from the notice instruction to the instruction immediately before the calling instruction.

  That is, the notice command generation processing unit 623 sets the input value in the reuse section immediately before the input value setting command for setting the input value in the reuse section selected based on the degree of reuse among the plurality of command sections. Generate a notice command to notify the setting. For example, the notice instruction generation processing unit 623 inserts a notice instruction before a function call instruction that is a reuse section, and generates an input value setting instruction between the notice instruction and the call instruction.

  In addition, for example, the notice instruction generation processing unit 623 generates a notice instruction including identification information of a function called by the call instruction before the call instruction. That is, the notice command generation processing unit 623 generates a notice command including identification information for identifying a plurality of reuse sections selected based on the degree of reuse. For example, as illustrated in FIG. 5B, the notice command generation processing unit 623 generates a notice command (noticeCall) including identification information indicated by an index (index).

  In addition, the notice instruction generation processing unit 623 includes, for example, a notice instruction including reference information for referring to the start address of a function preset in the register file 340 for execution of the call instruction before the call instruction. Insert. In this case, the notice instruction generation processing unit 623 generates an address setting instruction for setting the function start address in the register file 340 before the notice instruction including the reference information. That is, the notice command generation processing unit 623 generates a notice command including reference information for referring to the start address after the address setting instruction for setting the start address of the reuse section. In this example, the notice command generation processing unit 623 generates a notice command (noticeCall) including reference information (R25) as shown in FIG. 9B, for example.

  As another example, the warning instruction generation processing unit 623 generates, as a warning setting instruction, a warning instruction including setting information indicating a setting destination of the start address of a function that is a jump destination of the calling instruction before the calling instruction. To do. That is, the notice command generation processing unit 623 generates a notice command as an address setting instruction including setting information indicating a setting destination of the function start address in order to set the start address of the reuse section. In this example, the notice instruction generation processing unit 623 generates a notice setting instruction (memolw) as shown in FIG.

  In addition, for example, the notice command generation processing unit 623 generates a notice command including identification information or a notice command further including the priority generated by the reuse section selecting unit 622 when generating a notice command including reference information. Are generated before the call instruction. In other words, the notice command generation processing unit 623 generates a notice command including the priority given in accordance with the degree of reuse generated by the reuse degree generation unit 621.

  Further, the notice command generation processing unit 623 supplies the code generation unit 630 with an optimized program including the generated notice command. The notice command generation processing unit 623 is an example of the notice command generation processing unit described in the claims.

  The code generation unit 630 generates an object program that is a code of a machine language program based on the optimized program supplied from the notice instruction generation processing unit 623. The code generation unit 630 supplies the generated object program to the object program storage unit 520.

  The object program storage unit 520 stores the object program supplied from the code generation unit 630. The object program stored in the object program storage unit 520 is stored in the main storage unit 130 shown in FIG.

  As described above, by providing the notice instruction generation processing unit 623, it is possible to generate a program in which a notice instruction for notifying execution of the call instruction is executed before the call instruction of the reuse section is executed. In addition, by providing the reuse level generation unit 621, the reuse level is generated based on the usage mode of the instruction interval that is executed a plurality of times. Therefore, the probability that the execution result is reused among the plurality of instruction intervals. A high instruction interval can be selected as a reuse interval.

[Example of data format of notice command]
FIG. 13 is a diagram exemplifying a data format of a notice command generated by the program conversion processing device 500 according to the fourth embodiment of the present invention. Here, an example of a notice command based on the data format of a 32-bit command according to MIPS is shown.

  FIG. 13A is a diagram illustrating a data format of a notice instruction including identification information. FIG. 13B is a diagram illustrating a data format of a notice instruction including reference information. FIG. 13C is a diagram showing a data format of the notice setting instruction.

  FIG. 13A shows fields representing operation code 711, index 712, priority 713, and function code 714, respectively. In the operation code 711, “000000” indicating a special instruction (SPECIAL) is stored in 26 to 31 bits.

  In the index 712, identification information for identifying a plurality of functions selected by the reuse section selection unit 622 is stored in 10 to 25 bits. In the priority 713, the priority when deleting the execution history in the history memory 430 is stored in 6 to 9 bits. In the priority 713, the priority value generated by the reuse section selection unit 622 is stored. In the function code 714, “000101” is stored in 0 to 5 bits as a notice instruction (noticeCall).

  FIG. 13B shows fields representing operation code 721, priority 722, transfer destination register 723, and function code 724, respectively. In the operation code 711, “000000” indicating a special instruction (SPECIAL) is stored in 26 to 31 bits.

  In the priority 722, the priority when deleting the execution history of the history memory 430 is stored in 11 to 25 bits. In the priority 722, the priority value generated by the reuse section selection unit 622 is stored. The transfer destination register 723 stores, as reference information, the register number storing the start address of the function in 6 to 10 bits. In the function code 724, “000101” is stored in 0 to 5 bits as a notice instruction (noticeCall).

  FIG. 13C shows fields representing operation code 731, reference register 732, transfer destination register 733, and offset 734. In the operation code 731, “011111” indicating a notice setting instruction (memolw) is stored in 26 to 31 bits.

  In the reference register 732, the register number (R25) in which the reference address is stored is stored in 21 to 25 bits. The transfer destination register 733 stores, as setting information indicating the setting destination, a register number in which a function start address for calling a function is set in 16 to 20 bits. In the offset 734, an offset value with respect to the reference address is stored in 0 to 15 bits.

  Such a notice command or notice setting command is generated by the notice command generation processing unit 623 before a call command for calling a function.

[Operation Example of Program Conversion Processing Device 500]
Next, the operation of the program conversion processing apparatus 500 according to the fourth embodiment of the present invention will be described with reference to the drawings.

  FIG. 14 is a flowchart illustrating an example of a processing procedure of a notice instruction generation processing method of the program conversion processing apparatus 500 according to the fourth embodiment of the present invention.

  First, the reuse candidate section extraction unit 611 reads a source program from the source program storage unit 510 (step S931). Then, the reuse candidate section extraction unit 611 extracts a function that becomes a reuse candidate section from among a plurality of functions that are command sections that are executed a plurality of times (step S932).

  Subsequently, the usage pattern of the reuse candidate section extracted by the reuse candidate section extraction unit 611 is analyzed by the reuse candidate section analysis unit 612 (step S933). Thereafter, the reuse degree generation unit 621 generates a reuse degree for each reuse candidate section based on the usage mode of the reuse candidate section (step S934). Note that step S934 is an example of a reuse degree generation procedure described in the claims.

  Then, the reuse section selection unit 622 selects a reuse section based on the degree of reuse for each reuse candidate section (step S935). Next, the warning instruction generation processing unit 623 generates a warning instruction before the calling instruction for calling the reuse section, and generates the input value setting instruction between the generated warning instructions and the calling instruction. Processing is executed (step S940). Note that step S940 is an example of a notice instruction generation procedure described in the claims.

  Thereafter, the code generation unit 630 generates an object program based on the optimized program supplied from the notice instruction generation processing unit 623 (step S936). Next, a processing procedure example of the notice command generation process for each notice command shown in FIGS. 13A to 13C will be described below with reference to the drawings.

[Example of notice command generation processing in notice command including identification information]
FIG. 15 is a flowchart illustrating an example of a processing procedure of a notice command process (step S940) for a notice command including identification information according to the fourth embodiment of the present invention.

  First, the notice command generation processing unit 623 generates a notice command including identification information before the call command for the reuse section (step S942). For example, a notice instruction (noticeCall) that specifies an index (index) is generated as in the first instruction sequence shown in FIG.

  Next, the advance command generation processing unit 623 generates an input value setting command for setting the input value of the reuse section after the advance command including the identification information (step S943). For example, as in the second to sixth instruction sequences shown in FIG. 5B, input value setting instructions (two load word instructions, two move instructions, and a store word instruction) are generated.

  Then, the notice command generation processing unit 623 generates an address setting command for setting the head address of the reuse section after the input value setting command (step S944). For example, an address setting instruction (load word instruction) is generated as in the seventh instruction sequence shown in FIG.

  Thereafter, the notice command generation processing unit 623 generates a call instruction for the reuse section after the address setting command (step S945). For example, a call instruction (jump instruction) is generated as in the eighth instruction sequence shown in FIG.

  The notice command generation processing unit 623 repeatedly performs a series of processes in steps S942 to S945 for all reuse sections (step S946), and the process for all reuse sections is completed. The notice command generation process ends.

[Example of notice command generation processing in notice command including reference information]
FIG. 16 is a flowchart showing an example of the processing procedure of the notice command processing (step S950) for the notice command including the reference information according to the fourth embodiment of the present invention.

  First, the notice command generation processing unit 623 generates an address setting command for setting the start address of the reuse section (step S951). For example, as in the first instruction sequence shown in FIG. 9B, an address setting instruction (load word instruction) is generated.

  Then, the notice command generation processing unit 623 generates a notice command including reference information after the address setting command (step S952). For example, a notice instruction (noticeCall) indicating the reference information (R25) is generated as in the second instruction sequence shown in FIG. 9B.

  Next, the notice command generation processing unit 623 generates an input value setting command for setting the input value of the reuse section after the notice command including the reference information (step S943). For example, as in the third to seventh instruction sequences shown in FIG. 9B, input value setting instructions (two load word instructions, two move instructions, and a store word instruction) are generated.

  Thereafter, the notice command generation processing unit 623 generates a call instruction for the reuse section after the input value setting command (step S945). For example, a call instruction (jump instruction) is generated as in the eighth instruction sequence shown in FIG.

  The notice command generation processing unit 623 repeatedly performs a series of processes of steps S951, S952, S943, and S945 until all reuse sections are applied (step S946). Then, when the processing for all the reuse sections ends, the notice command generation process ends.

[Example of notice instruction generation processing in notice setting instruction]
FIG. 17 is a flowchart showing an example of the processing procedure of the notice command processing (step S960) for the notice setting command according to the fourth embodiment of the present invention.

  First, the notice command generation processing unit 623 generates a notice setting command for setting the start address of the reuse section (step S961). For example, a notice setting instruction (memolw) is generated as in the first instruction sequence shown in FIG.

  Next, the advance command generation processing unit 623 generates an input value setting command for setting the input value of the reuse section after the advance notification setting command (step S943). For example, input value setting instructions (two load word instructions, two move instructions, and a store word instruction) are generated as in the second to sixth instruction sequences shown in FIG.

  Thereafter, the notice command generation processing unit 623 generates a call instruction for the reuse section after the input value setting command (step S946). For example, a call instruction (jump instruction) is generated as in the seventh instruction sequence shown in FIG.

  The notice command generation processing unit 623 repeatedly performs a series of processes of steps S961, S943, and S945 until all the reuse sections are processed (step S946). Then, when the processing for all the reuse sections ends, the notice command generation process ends.

  As described above, in the fourth embodiment of the present invention, the processing time of the reuse section due to the reuse of the execution result by the data processing device 100 is generated by generating the notice instruction before the call instruction of the reuse section. Can be reduced. In addition, by executing the notice command generation process on the reuse section selected based on the reuse degree, the reuse rate of the execution result in the data processing apparatus 100 can be improved.

  As described above, according to the embodiment of the present invention, the processing of the reuse section is performed by performing the reuse processing of the execution result of the reuse section based on the notice command for notifying the execution of the process in the reuse section. Time can be greatly reduced.

  The embodiment of the present invention shows an example for embodying the present invention. As clearly shown in the embodiment of the present invention, the matters in the embodiment of the present invention and the claims Each invention-specific matter in the scope has a corresponding relationship. Similarly, the matters specifying the invention in the claims and the matters in the embodiment of the present invention having the same names as the claims have a corresponding relationship. However, the present invention is not limited to the embodiments, and can be embodied by making various modifications to the embodiments without departing from the gist of the present invention.

  The processing procedure described in the embodiment of the present invention may be regarded as a method having a series of these procedures, and a program for causing a computer to execute the series of procedures or a recording medium storing the program May be taken as As this recording medium, for example, a CD (Compact Disc), an MD (MiniDisc), a DVD (Digital Versatile Disk), a memory card, a Blu-ray Disc (registered trademark), or the like can be used.

DESCRIPTION OF SYMBOLS 100 Data processor 120 Bus 130 Main memory part 200 Primary cache 210 Instruction cache 220 Data cache 300 Data processing part 310 Fetch part 320 Instruction decoder 331 Load unit 332 Input selection part 333 Arithmetic circuit 334 Store unit 340 Register file 400 Reuse of execution result Processing unit 410 Execution history search unit 420 Execution result output unit 430 History memory 500 Program conversion processing device 510 Source program storage unit 520 Object program storage unit 600 Predictive instruction insertion code generation unit 610 Program analysis unit 611 Reuse candidate section extraction unit 612 Use candidate section analysis section 620 Program optimization processing section 621 Reuse degree generation section 622 Reuse section selection section 623 Precautionary instruction generation processing section 630 Over de generation unit

Claims (15)

An execution unit that executes processing based on an instruction sequence including a reuse interval that is an instruction interval that is executed a plurality of times;
A history memory that associates an input value and an execution result in the reuse interval for each piece of identification information for identifying the reuse interval, and holds the history as an execution history;
The input value of the reuse section is acquired based on a notice command for notifying execution of processing in the reuse section, and the execution is performed based on the acquired input value and the identification information specified by the notice command. An execution history search unit for searching the execution result in the history;
An execution result that outputs the extracted execution result to the execution unit when the execution result is extracted by the execution history search unit when processing in the reuse section identified by the notice instruction is executed A data processing apparatus comprising an output unit.   The execution history search unit includes an input value setting instruction for setting an input value of the reuse section in a group of instructions from the advance notice instruction to an instruction immediately before a call instruction for calling a head address of the reuse section. The data processing apparatus according to claim 1, wherein an input value is acquired based on the data.   The data processing apparatus according to claim 1, wherein the execution history search unit searches the execution result in the execution history based on the acquired input value and the identification information included in the notice command. The history memory associates an input value and an execution result in the reuse section for each head address of the reuse section that is the identification information, and holds the execution history as the execution history,
The execution unit outputs the start address to the execution history search unit based on the notice command including reference information for referring to the start address;
The data processing according to claim 1, wherein the execution history search unit searches the execution result in the execution history based on the start address output from the execution unit as the identification information and an input value of the reuse section. apparatus. The notice command is a notice setting command for setting a head address of the reuse section that is the identification information,
The history memory associates an input value and an execution result in the reuse section for each head address of the reuse section and holds the execution history as the execution history,
The execution unit sets the head address to the setting destination based on the notice setting instruction including setting information indicating the setting destination of the head address,
The execution history search unit acquires an input value of the reuse section based on the notice setting command, and in the execution history based on the acquired input value and the start address set by the execution unit. The data processing apparatus according to claim 1, wherein the execution result is searched. The history memory associates an input value and an execution result in the reuse section corresponding to the priority at the time of deleting the execution history, and holds the execution history as the execution history for each identification information,
The data processing device according to claim 1, wherein the execution history search unit deletes the execution history in the history memory based on the priority included in the notice command. The execution unit executes processing in the reuse section identified by the notice command when the execution result in the execution history is not extracted from the history memory by the execution history search unit,
The data processing device according to claim 1, wherein the execution history search unit causes the history memory to hold the input value acquired based on the notice command, an execution result executed by the execution unit, and the identification information. The history memory associates an input value and an execution result in the function for each identification information for identifying a function that is the reuse section, and holds the execution history as the execution history,
The execution history search unit acquires an input value of the function based on a notice command for notifying execution of the function, and based on the acquired input value and the identification information specified by the notice command. Search the execution result in the execution history,
The execution result output unit outputs the extracted execution result to the execution unit when the execution result is extracted by the execution history search unit when the function identified by the notice instruction is executed. The data processing apparatus according to claim 1. A reuse degree generating unit that generates a reuse degree for each instruction section based on a usage mode of the instruction section;
A notice instruction for notifying the setting of the input value in the reuse section immediately before the input value setting instruction for setting the input value in the reuse section selected based on the degree of reuse among the plurality of instruction sections. A program conversion processing device comprising a notice command generation unit for generating.   The program conversion processing device according to claim 9, wherein the notice command generation unit generates the notice command including identification information for identifying the plurality of reuse sections selected based on the degree of reuse.   The program conversion process according to claim 9, wherein the notice instruction generation unit generates the notice instruction including reference information for referring to the start address after an address setting instruction for setting the start address of the reuse section. apparatus.   The program conversion according to claim 9, wherein the notice command generation unit generates the notice command as an address setting command including setting information indicating a setting destination of the start address in order to set a start address of the reuse section. Processing equipment.   The program conversion processing device according to claim 9, wherein the notice command generation unit generates the notice command including a priority given in accordance with the reuse degree generated by the reuse degree generation unit. An execution unit that executes processing based on an instruction sequence including a reuse interval that is an instruction interval that is executed a plurality of times, and an input value and an execution result in the reuse interval for each piece of identification information for identifying the reuse interval A data processing method in a data processing device comprising a history memory that stores the execution history in association with each other,
An acquisition procedure for acquiring the identification information specified by the advance notice for notifying execution of processing in the reuse section and the input value of the reuse section specified by the advance notice;
An execution history search procedure for searching for the execution result in the execution history based on the identification information acquired by the acquisition procedure and the input value;
An execution result that outputs the extracted execution result to the execution unit when the execution result is extracted by the execution history search unit when processing in the reuse section identified by the notice instruction is executed A data processing method comprising: an output procedure. A reuse degree generation procedure for generating a reuse degree for each instruction section based on a usage mode of the instruction section;
A notice instruction for notifying the setting of the input value in the reuse section immediately before the input value setting instruction for setting the input value in the reuse section selected based on the degree of reuse among the plurality of instruction sections. The notice instruction generation procedure to generate,
A notice instruction generation processing method comprising:

Images