JP2011039859A - Data processor, history storing device, and data processing method and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To improve efficiency of value reuse by saving the result of execution from a memory for storing the results of execution in value reuse (Memoization). <P>SOLUTION: A history memory 430 holds the result of execution in a reuse section where the result of execution is reused as history of execution. A main storage part 130 holds the result of execution in a repetitive reuse section to be repeatedly executed in the reuse sections, as history of save. A history control part 510 generates the history of evacuation and representative loop history based on individual loop history being the result of execution in the repetitive reuse section. Consequently, the result of execution in the repetitive reuse section is saved in the main storage part 130 as the history of save, and the representative loop history is registered in the history memory 430 instead of the individual loop history including the result of its execution. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a data processing device, and more particularly to a data processing device that executes an instruction section in which an execution result is reused, a history storage device, a processing method in these, and a program that causes a computer to execute the method.

  Various techniques have been developed to increase the processing speed of programs. In recent years, as one of devices using the technology, an interval reuse device using a technique for reusing the execution result of an instruction interval called value reuse (memoization) has been proposed (for example, a patent) Reference 1). This section reuse device saves the input value and execution result in a predetermined instruction section of the program, so that if the input values match when the same instruction section is executed again, the stored execution It is a device that outputs an output value as a result.

JP 2004-258905 A (FIG. 1)

  In the above-described prior art, when the same instruction section is executed again and an execution result is output, the execution result of the instruction section can be reduced by outputting the execution result stored before that.

  However, in such a section reuse device, when the memory for storing the execution result is full, the old execution result is deleted to register a new execution history. The problem arises that it cannot be reused. That is, in such a section reuse device, there may be a case where the efficiency of value reuse is reduced due to deletion of the execution result from the memory for storing the execution result.

  Therefore, the present invention has been made in view of such a situation. When value reuse (memoization) is performed, the value reuse is performed by saving the execution result from the memory for saving the execution result. The goal is to improve efficiency.

  The present invention has been made in order to solve the above-described problems. The first aspect of the present invention is that an execution unit that executes an instruction interval and outputs an execution result, and the execution result of the instruction interval is used again. The section identification information, the input value, and the execution result of the reuse section are stored as an execution history. When the stored execution result is used again, the execution history is stored based on the section identification information and the input value. A history memory to be searched; a save history holding unit for holding a save history for saving the execution result of each iteration of the reuse interval in the reuse interval, from the history memory; and the iteration Based on the execution history of the reuse section, the save history is supplied to the save history holding unit, and the execution history that is the basis of the save history is deleted from the history memory when the save history is supplied. Representative history including the information indicating the serial saving history is a program for executing a data processing apparatus and processing method, and the method and a history control unit to be held in the history memory in the computer. As a result, the execution result of the repeated reuse section in which the execution of the reuse section is repeated is saved from the history memory to the save history holding unit.

  In the first aspect, the history control unit holds the save history when the data amount of the new execution history to be held in the history memory is larger than the free capacity of the history memory. You may make it supply to a part. As a result, when the data amount of the execution history is larger than the free space of the history memory, the execution result of the repeated reuse section is saved from the history memory to the save history holding unit.

  Further, in the first aspect, a history restoration unit that restores the execution history to the history memory based on the save history and the representative history, and the restoration that is restored based on the section identification information and the input value When the execution history is searched from the history memory, a history search unit that outputs the execution result based on the restored execution history may be further provided. This brings about the effect that the execution result is reused using the execution history restored based on the save history and the representative history. In this case, when the execution history searched based on the section identification information and the input value is the representative history, the history search unit causes the restoration unit to start restoring the execution history. It may be. As a result, when the representative history is searched in the history search unit, the restoring unit restores the execution history of the repeated reuse section. In this case, the history control unit generates the representative history further including a save count indicating the number of the save histories, and the history restoration unit adds information indicating the save history in the representative history and the save count. Based on this, the execution history may be restored by extracting the save history from the save history holding unit. Thus, there is an effect that the save history is extracted from the save history holding unit based on the information indicating the save history in the representative history and the save count.

  Further, in the first aspect, when the execution unit supplies the execution result of the reuse section, the execution history of the repeated reuse section, the execution history other than the repeated reuse section, and the An identifier for identifying a representative history is further output, the history memory further holds the identifier as the execution history, and the history control unit is configured to execute the identification based on the execution history identified using the identifier. The save history may be supplied, and the representative history further including the identifier may be generated. This brings about the effect of identifying the execution history using the identifier.

  In the first aspect, the repetitive reuse section may be a subroutine, and the execution unit may output a start address of the subroutine as the section identification information. This brings about the effect that the start address of the subroutine is output as section identification information.

  In the first aspect, the repeated reuse section may be a loop, and the execution unit may output a start address of the loop as the section identification information. This brings about the effect that the start address of the loop is output as the section identification information. In this case, when the execution unit outputs the execution result of the iterative reuse section, the execution unit further outputs a counter value indicating the execution result of the number of executions. The counter value may be further held as the execution history, and the history control unit may output the save history including the counter value. As a result, the execution history and the saving history including the counter value are retained.

  Further, according to the second aspect of the present invention, the section identification information, the input value, and the execution result of the reuse section in which the execution result is reused are held as an execution history, and the held execution result is used again. The history memory for searching for the execution history based on the section identification information and the input value, and the execution result of each iteration of the reuse section in which the execution is repeated among the reuse sections as the save history A representative history including information indicating the save history is saved in the history memory by saving the history from the history memory to an external storage unit, erasing the execution history that is the basis of the save history at the time of the save, and the history memory. A history storage device including a history control unit to be held. As a result, the execution result of the repeated reuse section in which execution is repeated is saved from the history memory to an external storage unit.

  According to the present invention, when value reuse (memoization) is performed, it is possible to improve the efficiency of value reuse by saving the execution result from the memory that stores the execution result. Can play.

It is a block diagram which shows the structural example of the data processing apparatus 100 in embodiment of this invention. It is a block diagram which shows the structural example of the processor core 300, the log | history management part 400, and the log | history conversion part 500 in embodiment of this invention. It is a block diagram which shows the structural example of the log | history control part 510 in embodiment of this invention. It is a block diagram which shows the structural example of the save history production | generation part 600 in embodiment of this invention. It is a block diagram which shows the structural example of the log | history decompression | restoration part 520 in embodiment of this invention. It is a schematic diagram which shows the example of a data structure of the function log | history, loop separate log | history, loop representative log | history, and save log | history in embodiment of this invention. It is a conceptual diagram which shows the example of a data structure of the input value link in embodiment of this invention, and an execution result link. It is a figure which shows the specific example of the execution log | history in the log | history memory 430 and the main memory | storage part 130, a loop representative log | history, and a saving log | history at the time of the saving of the loop separate log | history by the log | history control part 510 in embodiment of this invention. It is a figure which shows the specific example of the execution log | history in the log | history memory 430 and the main memory | storage part 130, a loop representative log | history, and an evacuation log | history at the time of log | history recovery of the loop individual log | history by the log | history restoring part 520 in embodiment of this invention. It is a figure which shows the specific example of the log | history information in the log | history memory 430 when the new execution log | history in embodiment of this invention is registered, and the save log | history in the main memory part 130. FIG. It is a flowchart which shows the example of a process sequence of the save process of the loop separate log | history by the log | history control part 510 in embodiment of this invention. It is a flowchart which shows the example of a process sequence of the continuous log | history search search process (step S930) of the loop separate log | history by the log | history control part 510 in embodiment of this invention. It is a flowchart which shows the example of a process sequence of the restoration process of the loop separate log | history by the log | history restoring part 520 in embodiment of this invention. It is a flowchart which shows the example of a process sequence of the execution result registration process (step S970) in embodiment of this invention. It is a flowchart which shows the example of a process sequence of the execution result output process (step S980) in 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. Data processor configuration example (value reuse control: example of saving the execution history of repeated reuse sections)
2. Example of history information field configuration (value reuse control: function history, loop individual history, loop representative history, and save history example)
3. Example of history information held in history memory and save history held in main memory (value reuse control: example of saving and restoring loop individual history example)
4). Processing procedure example of data processing device (value reuse control: example of saving and restoring loop individual history example)

<1. Configuration example of data processing device>
[Configuration Example of Data Processing Device 100]
FIG. 1 is a block diagram illustrating a configuration example of a data processing device 100 according to an embodiment of the present invention. The data processing apparatus 100 is connected to the main storage unit 130 via the bus 120. Here, it is assumed that the instruction section in which the data processing apparatus 100 executes processing is a function or a loop.

  The data processing device 100 executes each process in the program. The data processing apparatus 100 is realized by a CPU (Central Processing Unit) in a general computer, for example. The data processing apparatus 100 includes a primary cache 200, a processor core 300, a history management unit 400, and a history conversion unit 500.

  The primary cache 200 temporarily holds information handled by the processor core 300 via the bus 120. The primary cache 200 includes an instruction cache 210 and a data cache 220.

  The instruction cache 210 temporarily holds instructions executed in the processor core 300. The instruction cache 210 temporarily holds instructions executed frequently by the processor core 300, thereby reducing access from the processor core 300 to the main storage unit 130 and reducing data input waiting time in the processor core 300. Can be made. The instruction cache 210 supplies a reuse instruction supplied from the main storage unit 130 to the processor core 300. The reuse instruction here means that the execution result is reused when the reuse section is called by distinguishing the reuse section in which the execution result is reused in the instruction section from the non-reuse section. This is an instruction for causing the data processing apparatus to perform the above process.

  The data cache 220 temporarily holds input data and output data of the processor core 300. This data cache 220 temporarily reduces the access from the processor core 300 to the main storage unit 130 by temporarily holding the input data of the processor core 300 that is frequently used, thereby reducing the data input waiting time in the processor core 300. Reduce. The data cache 220 outputs the function or loop input value and start address supplied from the main storage unit 130 to the processor core 300. Here, the input value is a value composed of an argument of a value passed as a value necessary for execution of the function or loop. For example, in the case of a function having three variables as arguments, The value of one variable and the address of that variable.

  The processor core 300 executes operations in accordance with program instructions. The processor core 300 is realized by, for example, a MIPS (Microprocessor without Interlocked Pipeline Stages) processor. The processor core 300 executes the instruction in the function or loop section input from the instruction cache 210 based on, for example, the input value and start address of the function or loop supplied from the data cache 220, and the result of the execution is executed. Output as the execution result. If the execution result is not supplied from the history management unit 400 when the input instruction is a reuse instruction that specifies a reuse section, the processor core 300 displays the execution result that is the result of executing this instruction in the data cache 220. And output to the history management unit 400.

  Further, when an execution result is supplied from the history management unit 400 when the input instruction is a reuse instruction that designates a reuse section, the processor core 300 stops the process in the reuse section and performs this re-use. Return to the routine that called the usage interval and continue execution.

  The history management unit 400 holds and manages the execution result of the reuse section. The history management unit 400 holds the section identification information, the input value, and the execution result of the reuse section supplied from the processor core 300 as an execution history. The section identification information here is information for specifying a reuse section, for example, a function or loop start address. That is, the history management unit 400 holds a function or loop start address, an input value, and an execution result as section identification information, an input value, and an execution result. In addition, when the function or loop start address and input value are supplied from the processor core 300, the history management unit 400 searches for an execution history including the start address and input value.

  The history conversion unit 500 converts the execution history managed by the history management unit 400. The history conversion unit 500 converts an execution history of an iterative reuse section that is repeatedly executed among the reuse sections registered in the history management unit 400 into a save history held in the main storage unit 130. Here, the save history is data for saving the execution result of the execution history of the repeated reuse section to the main storage unit 130. The history conversion unit 500 restores the execution history based on the save history held in the main storage unit 130. The history conversion unit 500 stores the save history in the main storage unit 130, deletes the execution history that is the basis for generating the save history from the history management unit 400, and displays a representative history that holds information indicating the save history. Register in the history management unit 400.

  When the execution result included in the save history is reused, the history conversion unit 500 restores the execution history from the save history, erases the representative history, and stores the restored execution history in the history management unit 400. sign up.

  The bus 120 is a bus that mutually connects each unit of the data processing apparatus 100 and the main storage unit 130.

  The main storage unit 130 holds data necessary for the data processing apparatus 100 to operate. The main storage unit 130 holds the save history supplied from the history conversion unit 500. The main storage unit 130 stores a program for causing the data processing apparatus 100 to execute processing. For example, a RAM (Random Access Memory) may be used as the main storage unit 130. The main storage unit 130 outputs the stored data to the data processing apparatus 100 via the bus 120. The main storage unit 130 is an example of a save history holding unit described in the claims.

[Configuration Example of Processor Core 300, History Management Unit 400, and History Conversion Unit 500]
FIG. 2 is a block diagram illustrating a configuration example of the processor core 300, the history management unit 400, and the history conversion unit 500 in the embodiment of the present invention. Here, in addition to the processor core 300, the history management unit 400, and the history conversion unit 500, a main storage unit 130 connected to the history conversion unit 500 via the bus 120 is also shown. Here, since the functions of the processor core 300, the history management unit 400, the history conversion unit 500, and the main storage unit 130 are the same as those in FIG. 1, the same reference numerals are given and detailed description thereof will be given here. Omitted.

  In the following description, for the sake of convenience, it is assumed that an iterative reuse section that is an iteratively executed section is a loop, and a reuse section other than the iterative reuse section is a function. A reuse section other than the repeated reuse section is expressed as a function reuse section. The loop execution result is expressed as a loop individual history, and the function execution result is expressed as a function history. Further, the representative history indicating the save history is expressed as a loop representative history.

  The processor core 300 includes a fetch unit 310, an instruction decoder 320, an execution unit 330, and a register file 340.

  The fetch unit 310 reads an instruction from the instruction cache 210 or the main storage unit 130. The fetch unit 310 temporarily holds the read instruction, and supplies an instruction to be executed by the execution unit 330 among the held instructions to the instruction decoder 320. For example, the fetch unit 310 supplies a reuse instruction to be executed by the execution unit 330 among the temporarily held instructions to the instruction decoder 320. For example, the fetch unit 310 supplies a reuse instruction stored in the main storage unit 130 to the instruction decoder 320.

  The instruction decoder 320 generates a control signal for controlling the components in the processor core 300 by decoding the instruction supplied from the fetch unit 310. For example, the instruction decoder 320 generates a control signal for controlling the execution unit 330 and the register file 340 by decoding the instruction, and supplies the generated control signal to the execution unit 330 and the register file 340.

  When a reuse instruction is supplied from the fetch unit 310, the instruction decoder 320 analyzes the reuse instruction, thereby generating control signals for controlling the execution unit 330 and the register file 340. This is supplied to the register file 340.

  The execution unit 330 executes the instruction analyzed in the instruction decoder 320 based on the control signal supplied from the instruction decoder 320. When the instruction decoder 320 decodes the reuse instruction, the execution unit 330 starts processing of the reuse section specified by the reuse instruction. Further, along with the start of the processing of the reuse section, the execution unit 330 outputs the section identification information of the reuse section acquired from the register file 340 to the history management unit 400 via the signal line 309. Then, the execution unit 330 executes processing in the reuse interval based on the input value of the reuse interval supplied from the register file 340, and the history management unit receives the input value of the reuse interval via the signal line 309. Output to 400.

  In addition, when the execution result of the reuse section is supplied from the history management unit 400, the execution unit 330 cancels the processing of the reuse section and indicates that the execution result is supplied from the history management unit 400. A signal to be notified is supplied to the fetch unit 310. At this time, the execution unit 330 outputs the execution result to the register file 340.

  On the other hand, when the execution result of the reuse section is not supplied from the history management unit 400, the execution unit 330 executes the process of the reuse section to the end, and sends the execution result to the history management unit 400 and the register file 340. Output. Further, when the execution result of the repetitive reuse section is not supplied, the execution unit 330 outputs a loop counter value indicating the execution result of the number of executions to the history management unit 400 together with the execution result. The loop counter value is an example of the counter value described in the claims.

  The register file 340 temporarily holds the data supplied from the data cache 220 and the execution result supplied from the execution unit 330. For example, when a control signal based on a reuse instruction is supplied from the instruction decoder 320, the register file 340 supplies the input value of the reuse section to the execution unit 330.

  The history management unit 400 holds and manages the execution result of the reuse section. The history target data holding unit 410, the history search unit 420, the history memory 430, the history registration unit 440, and the history memory capacity A management unit 450 and an erasing unit 460 are provided.

  The history target data holding unit 410 temporarily holds the data supplied from the execution unit 330. When the section identification information and the input value are supplied from the execution unit 330, the history target data holding unit 410 supplies these to the history search unit 420 as a search request. For example, when a function reuse section is executed in the execution unit 330, the history target data holding unit 410 uses the start address and input value of the function supplied from the execution unit 330 as a search request. To supply. In addition, when the repetitive reuse section is executed in the execution unit 330, the history target data holding unit 410 performs a history search using the loop start address, input value, and loop counter value supplied from the execution unit 330 as a search request. To the unit 420.

  In addition, when the section identification information, the input value, and the execution result are supplied from the execution unit 330, the history target data holding unit 410 has a condition for registering the execution history. This is supplied to the history registration unit 440. For example, when a function reuse section is executed in the execution unit 330, the history target data holding unit 410 registers the function start address, input value, and execution result supplied from the execution unit 330 as an execution history. Part 440. In addition, when the repetitive reuse section is executed in the execution unit 330, the history target data holding unit 410 stores the loop start address, input value, execution result, and loop counter value in the history registration unit 440 as an execution history. Supply.

  The history search unit 420 searches the execution history based on the search request supplied from the history target data holding unit 410. The history search unit 420 includes a search request input unit 421 and an execution result output unit 422.

  The search request input unit 421 searches the history memory 430 for an execution history based on the search request supplied from the history target data holding unit 410. For example, when an instruction designating an iterative reuse section is analyzed in the instruction decoder 320, the search request input unit 421 stores a loop start address, an input value, and a loop counter value designated by this instruction in the history memory. 430. Thereby, the search of the execution history is started.

  The execution result output unit 422 extracts the execution result from the history memory 430 when the execution history is searched in the history memory 430 and outputs the extracted execution result to the execution unit 330. The execution result output unit 422 supplies the extracted execution result to the execution unit 330 via the signal line 409.

  In addition, when the loop representative history is retrieved as the execution history in the history memory 430, the execution result output unit 422 extracts save history position information indicating the save history from the history memory 430 instead of the execution result. Then, the extracted information regarding the save history is output to the history conversion unit 500, and the restoration of the execution history is started.

  The history memory 430 holds the execution history supplied from the history registration unit 440. For example, when a search request is supplied from the history search unit 420 and the history memory 430 holds an execution history that matches the search request, the execution result of the execution history is output to the execution result output unit 422. To supply. In addition, when a search request is supplied from the history search unit 420, the history memory 430 executes the save history position information of the loop representative history when it holds a loop representative history that matches the search request. The result is supplied to the result output unit 422. Further, when an execution history is supplied from the history registration unit 440, the history memory 430 holds this execution history.

  The history memory 430 also supplies information related to the usage status of the history memory 430 to the history memory capacity management unit 450. Further, the history memory 430 supplies the held execution history and loop representative history to the history conversion unit 500. The history memory 430 is realized by, for example, a content addressable memory (CAM).

  The history registration unit 440 converts the execution history supplied from the history target data holding unit 410 into a data structure for holding the history memory 430, and registers the converted execution history in the history memory 430. . For example, when the history search unit 420 does not search for a function history, the history registration unit 440 registers the function start address, input value, and execution result in the history memory 430 as an execution history. In addition, for example, when the loop individual history is not searched by the history search unit 420, the history registration unit 440 registers the loop start address, input value, execution result, and loop counter value in the history memory 430 as an execution history. .

  In addition, the history registration unit 440 temporarily suspends registration when the data amount of the newly registered execution history is larger than the free space of the history memory 430 supplied from the history memory capacity management unit 450. . Then, the history registration unit 440 supplies the erasing unit 460 with erasure start information for erasing the execution history having the longest unused period from the previous use among the already registered execution histories.

  The history memory capacity management unit 450 manages the free capacity of the history memory 430. For example, the history memory capacity management unit 450 measures the free capacity of the history memory 430 every time a new execution history is registered in the history memory 430. Further, the history memory capacity management unit 450 measures the free capacity of the history memory 430 every time the execution history is deleted from the history memory 430. The history memory capacity management unit 450 supplies information related to the free capacity of the history memory 430 to the history registration unit 440.

  When the deletion start information is supplied from the history registration unit 440, the deletion unit 460 deletes the execution history having the longest unused period from the previous use.

  The history conversion unit 500 converts the execution history managed by the history management unit 400 into a save history and stores it in the main storage unit 130. The history conversion unit 500 stores the history control unit 510, the history restoration unit 520, and the save area management. Part 530.

  The history control unit 510 generates a save history from the loop individual execution history held in the history memory 430 and saves it in the main storage unit 130. For example, the history control unit 510 extracts the execution history of the repeated reuse section from the history memory 430 via the signal line 490, and the execution history and the main storage unit 130 supplied from the save area management unit 530. The save history is saved in the main storage unit 130 based on the address information. Also, the history control unit 510 starts saving the save history when, for example, the data amount of the new execution history to be held in the history memory 430 is larger than the free capacity of the history memory 430.

  Then, the history control unit 510 deletes the loop individual history that is the basis of the save history from the history memory 430 and registers the loop representative history including the save history position information in the history memory 430 instead of the loop individual history. Note that the save history position information here is, for example, an address of the main storage unit 130 that indicates the storage location of the save history in the main storage unit 130. Thus, the history control unit 510 supplies the generated save history to the main storage unit 130 via the signal line 509. The history control unit 510 supplies the generated loop representative history to the history memory 430 via the signal line 590. Note that the device including the history control unit 510 and the history memory 430 is an example of a history storage device described in the claims.

  The history restoration unit 520 extracts the save history from the main storage unit 130 based on the save history position information supplied from the execution result output unit 422, and restores the execution history based on the save history. For example, when the execution result of the save history saved in the main storage unit 130 is reused, the history restoration unit 520 reads from the main storage unit 130 based on the save history information supplied from the execution result output unit 422. The save history is extracted via the signal line 139. The history restoration unit 520 restores the execution history based on the loop representative history extracted from the history memory 430 and the save history extracted from the main storage unit 130. Thereafter, the history restoration unit 520 deletes the loop representative history held in the history memory 430, and after securing a capacity for holding the save history in the history memory 430, registers the restored execution history in the history memory 430. To do.

  As described above, the history restoring unit 520 supplies the restored execution history to the history memory 430 via the signal line 580.

  The save area management unit 530 manages an area where the save history in the main storage unit 130 is held. For example, when the history control unit 510 generates an evacuation history, the evacuation area management unit 530 saves the evacuation history in the main storage unit 130 by securing an area in which the evacuation history is retained in the main storage unit 130. The previous address is supplied to the history control unit 510 via the signal line 539.

  The main storage unit 130 holds a save history in this configuration diagram. The main storage unit 130 is an example of a save history holding unit described in the claims.

  As described above, in the embodiment of the present invention, the execution history of the repeated reuse section can be saved in the main storage unit 130 by providing the processor core 300, the history management unit 400, and the history conversion unit 500.

  In addition, although the case where the repeated reuse section is a loop has been described here, the present invention is not limited to this. For example, as an iterative reuse section other than the loop, a subroutine with a recursive call (recursive call) can be considered.

[Configuration Example of History Control Unit 510]
FIG. 3 is a block diagram illustrating a configuration example of the history control unit 510 according to the embodiment of the present invention. The history control unit 510 includes a save history generation unit 600, a loop individual history deletion unit 512, and a loop representative history registration unit 513.

  The save history generation unit 600 generates a save history based on the loop individual history. For example, the save history generation unit 600 acquires a loop individual history including an execution result of repeated execution of a loop from the history memory 430 via the signal line 490, and saves history based on the acquired loop individual history. Is generated. At this time, the save history generation unit 600 receives the save destination address of the save history in the main storage unit 130 from the save area management unit 530 via the signal line 539. Then, the save history generation unit 600 saves the generated save history in the main storage unit 130 via the signal line 509.

  Further, the save history generation unit 600 generates a loop representative history including the save history position information, and supplies the loop representative history to the loop representative history registration unit 513 via the signal line 608. Further, the save history generating unit 600 supplies the loop individual history that is the basis of the save history to the loop individual history erasing unit 512 via the signal line 609.

  The loop individual history erasure unit 512 erases the execution history that is the basis of the save history. The loop individual history erasure unit 512 erases the loop individual history from the history memory 430 via the signal line 592 based on the loop individual history that is the basis of the save history supplied from the save history generation unit 600. Further, the loop individual history deleting unit 512 supplies information notifying the deletion of the loop individual history to the loop representative history registering unit 513.

  The loop representative history registration unit 513 registers the loop representative history in the history memory 430. For example, when the loop representative history is supplied from the save history generation unit 600 and the loop representative history deletion unit 600 receives information notifying the deletion of the loop individual history from the loop individual history deletion unit, The representative history is registered in the history memory 430 via the signal line 593.

[Configuration Example of Save History Generation Unit 600]
FIG. 4 is a block diagram illustrating a configuration example of the save history generation unit 600 according to the embodiment of the present invention. The save history generation unit 600 includes a head search unit 610, a continuous search unit 620, a loop individual history acquisition unit 630, a save history transfer unit 640, and a loop representative history generation unit 650.

  The head search unit 610 searches for a loop individual history regarding the first execution of the repeated reuse section from the history memory 430 via the signal line 491. When searching for the loop individual history, the head search unit 610 temporarily stops the operation and causes the continuous search unit 620 to process the search for the loop individual history thereafter. The head search unit 610 supplies position information regarding the searched loop individual history to the continuous search unit 620.

  The continuous search unit 620 transmits the loop individual history related to the second and subsequent executions via the signal line 492 based on the position information of the loop individual history related to the first execution of the repetitive reuse section supplied from the head search unit 610. To explore. For example, when the position information of the first loop individual history is supplied from the head search unit 610 in a loop repeated 50 times, the continuous search unit 620 displays the loop individual history from the second time to the 50th time. Explore. Then, when the 51st execution history is not searched, the continuous search unit 620 supplies position information for acquiring the 50 loop individual histories to the loop individual history acquisition unit 630.

  In addition, when the loop individual history after the second time is not searched, the continuous search unit 620 determines that the repetitive reuse section has not been repeatedly executed, and stops generating the save history. Then, the continuous search unit 620 stops the operation at one end, and causes the head search unit 610 to resume searching for the loop individual history regarding the first execution of the repeated reuse section.

  The loop individual history acquisition unit 630 acquires the loop individual history from the history memory 430 via the signal line 493 based on the position information for acquiring the loop individual history supplied from the continuous search unit 620. . For example, when position information regarding 50 loop individual histories in an iterative reuse section repeated 50 times is supplied from the continuous search unit 620, the loop individual history acquisition unit 630 receives the 50 loop individual histories. Is acquired from the history memory 430. The loop individual history acquisition unit 630 supplies the acquired loop individual history to the save history transfer unit 640, the loop representative history generation unit 650, and the loop individual history deletion unit 512 via the signal line 638 and the signal line 609. To do.

  The save history transfer unit 640 generates a save history based on the loop individual history supplied from the loop individual history acquisition unit 630 and transfers the generated save history to the main storage unit 130. For example, when 50 loop individual histories of an iterative reuse section repeated 50 times are supplied, the save history transfer unit 640 generates 50 save histories. The save history transfer unit 640 saves the save history in the main storage unit 130 based on the address of the main storage unit 130 supplied from the save area management unit 530 via the signal line 539. The save history transfer unit 640 transfers the generated save history to the main storage unit 130 via the signal line 509.

  The loop representative history generation unit 650 generates a loop representative history based on the loop individual history supplied from the loop individual history acquisition unit 630. The loop representative history generation unit 650 generates a loop representative history including the save history position information based on the address of the main storage unit 130 supplied from the save area management unit 530 via the signal line 539. The loop representative history generation unit 650 supplies the generated loop representative history to the loop representative history registration unit 513 via the signal line 608.

[Configuration Example of History Restoring Unit 520]
FIG. 5 is a block diagram illustrating a configuration example of the history restoration unit 520 according to the embodiment of the present invention. The history restoration unit 520 includes a save history acquisition unit 521, a loop individual history generation unit 522, a registration area reservation unit 523, and a loop individual history registration unit 524.

  The save history acquisition unit 521 acquires a save history from the main storage unit 130 based on the save history position information supplied from the execution result output unit 422. For example, when the save history acquisition unit 521 acquires the save history of the repeated reuse section that has been repeatedly executed 50 times, the save history position supplied from the execution result output unit 422 via the signal line 408 is used. Based on the information, the 50 save histories are acquired from the main storage unit 130. The save history acquisition unit 521 supplies the acquired save history to the loop individual history generation unit 522.

  The loop individual history generation unit 522 generates a loop individual history from the save history. The loop individual history generation unit 522 acquires the loop representative history including the save history position information from the history memory 430 via the signal line 480 based on the save history position information supplied via the signal line 408. The loop individual history generation unit 522 generates a loop individual history based on the acquired loop representative history and the save history supplied from the save history acquisition unit 521.

  The loop individual history generation unit 522 supplies the generated loop individual history to the loop individual history registration unit 524. The loop individual history generating unit 522 supplies the loop representative history and the data amount of the loop individual history to the registration area securing unit 523.

  The registration area securing unit 523 secures a free area in the history memory 430 in order to register the loop individual history. The registration area securing unit 523 erases the loop representative history supplied from the loop individual history generating unit 522 from the history memory 430 via the signal line 583. Then, the registration area securing unit 523 determines whether or not there is a free capacity for registering all loop individual histories in the history memory 430 based on the data amount of the loop individual history supplied from the loop individual history generation unit 522. To do. When the free space is insufficient in the history memory 430, the registration area securing unit 523 secures free space via the signal line 583. For example, the registration area securing unit 523 secures a necessary free space in the history memory 430 by deleting the execution history having the longest unused period since the previous use.

  The registration area securing unit 523 supplies information related to the free space in the history memory 430 to the loop individual history registration unit 524.

  The loop individual history registration unit 524 registers the loop individual history supplied from the loop individual history generation unit 522 in the history memory 430 via the signal line 584. The loop individual history registration unit 524 registers the loop individual history supplied from the loop individual history generation unit 522 in the free space of the history memory 430 indicated by the information supplied from the registration area securing unit 523.

  As described above, in the embodiment of the present invention, by providing the history management unit 400 and the history conversion unit 500 in the data processing apparatus 100, the main storage unit uses the execution history of the repeated reuse section in which execution is repeated as the save history. 130 can be evacuated.

<2. Example of history information field configuration>
[Execution history, loop individual history, and save history field configuration examples]
FIG. 6 is a schematic diagram illustrating a field configuration example of the function history, the loop individual history, and the loop representative history held in the history memory 430 and the save history held in the main storage unit 130 according to the embodiment of the present invention. is there.

  FIG. 6A shows a field configuration example of a function history 710 that is an execution history of a function reuse section. The function history 710 includes an identifier field 711, a start address field 712, an input value link field 713, and an execution result link field 717.

  The identifier field 711 is a field for identifying a function history, a loop individual history, and a loop representative history. In this identifier field 711, 2 bits (00) indicating a function history are stored. The identifier field 711 is a head field in the function history 710, and is a field held at the start address of the function history 710, for example.

  The start address field 712 is a field for storing the start address of the function. The start address of the function stored in the start address field 712 is compared with the start address of the search request when the search history is searched by the search request input unit 421.

  The input value link field 713 is a field for storing the address of the input value of the function stored using the link structure. In the input value link field 713, an input that is compared with the input value of the search request when the execution history is searched by the search request input unit 421 and the start address of the search request matches the start address of the start address field 712. Stores the address that holds the value. For example, in the case of a function having three arguments as input values, the input value link field 713 stores an address at which the first argument value that is the value of the first argument of the three functions is held. Is done.

  The execution result link field 717 is a field for storing the address of the execution result of the function stored using the link structure. The execution result link field 717 stores an address in which an execution result of a function output as an execution result is stored when the search history is searched by the search request input unit 421 and the input address matches the start address. Is done. For example, in the case of a function having three variables as output values, the address at which the value of the first variable among the three variables is stored in the execution result link field 717.

  FIG. 6B shows a field configuration example of a loop individual history 720 that is an execution history of the repeated reuse section. The loop individual history 720 includes an identifier field 721, a start address field 722, an input value link field 723, a loop counter value field 724, and an execution result link field 727.

  Similar to the identifier field 711 shown in FIG. 6A, the identifier field 721 is a field for storing an identifier for identifying the function history, the loop individual history, and the loop representative history. In this identifier field 721, 2 bits (01) indicating a loop individual history are stored. The identifier field 721 is a head field in the loop individual history 720, and is a field held at the start address of the loop individual history 720, for example.

  The start address field 722 is a field for storing the start address of the loop. The loop start address stored in the start address field 722 is compared with the search request start address when the search history is searched by the search request input unit 421.

  The input value link field 723 is a field for storing the address of the input value of the loop stored using the link structure. Since the function of the input value link field 723 is the same as that of the input value link field 713 shown in FIG. 6A, detailed description thereof is omitted here.

  The loop counter value field 724 is a field for storing a value indicating how many times the loop has been executed. The loop counter value field 724 stores a loop counter value to be compared with the loop counter value of the search request when the execution history is searched by the search request input unit 421 and the start address and the input value match.

  The execution result link field 727 is a field for storing the address of the execution result of the loop stored using the link structure. The execution result link field 727 holds a loop execution result that is output as an execution result when the search history is searched by the search request input unit 421 and the start address, input value, and loop counter value match. Is stored.

  FIG. 6C shows a field configuration example of a loop representative history 730 that is a representative history of the repeated reuse section. The loop representative history 730 includes an identifier field 731, a start address field 732, an input value link field 733, a save count field 735, and a save history address field 736.

  Similar to the identifier field 711 shown in FIG. 6A, the identifier field 731 is a field for identifying a function history, a loop individual history, and a loop representative history. The identifier field 731 stores 2 bits (10) indicating that it is a loop representative history. The identifier field 731 is a head field in the loop representative history 730, and is a field held at the start address of the loop representative history 730, for example.

  The start address field 732 is a field for storing the start address of the loop, similarly to the start address field 722 shown in FIG. Since the function of the start address field 732 is the same as that of the start address field 722 of FIG. 6B, a detailed description thereof is omitted here.

  Similar to the input value link field 723 shown in FIG. 6B, the input value link field 733 is a field for storing the address of the input value of the loop stored using the link structure. The function of the input value link field 733 is the same as that of the input value link field 723 shown in FIG. 6B, and thus detailed description thereof is omitted here.

  The save count field 735 is a field for storing a value indicating the number of save histories saved in the main storage unit 130. This save count field 735 is supplied to the history restoring unit 520 as save history position information when the execution history is searched and the start address and input value of the search request match the start address and input value of the loop representative history. The number of save histories to be stored is stored.

  The save history address field 736 is a field for storing a save history address. Here, the save history address is an address where the save history saved in the main storage unit 130 is stored. In the save history address field 736, when the execution history is searched and the start address and input value of the search request coincide with the start address and input value of the loop representative history, the history restoring unit 520 stores the save history position information. The supplied save history address is stored. For example, the save history address field 736 stores the start address of the first save history when a plurality of save histories in the repeated reuse section are saved at consecutive addresses.

  FIG. 6D shows a field configuration example of the repetitive reuse section save history 740. The save history 740 includes a loop counter value field 744 and an execution result link field 747.

  Similar to the loop counter value field 724 shown in FIG. 6B, the loop counter value field 744 is a field for storing a value indicating how many times the loop has been executed. The loop counter value field 744 stores a value that becomes the loop counter value field 724 when the loop individual history is restored by the history restoration unit 520.

  Similar to the execution result link field 727 shown in FIG. 6B, the execution result link field 747 is a field for storing the address of the execution result of the loop stored using the link structure. The execution result link field 747 stores a value that becomes the execution result link field 727 when the loop individual history is restored by the history restoration unit 520.

  Here, in order to facilitate the registration and deletion of the execution history and loop representative history in the history memory 430 by setting the data length of the execution history and loop representative history to a fixed length, the data amount of the execution history is reduced. Therefore, the input values and execution results are linked. However, the data structure of the function history, loop individual history, loop representative history, and save history is not limited to this. For example, the input value and the execution result may be held as they are in the function history, loop individual history, loop representative history, and save history without using a link structure.

[Data structure example of input value link and execution result link]
FIG. 7 is a conceptual diagram showing a data structure example of the input value link and the execution result link in the embodiment of the present invention.

  Here, the input value link field 713 shown in FIG. 6A and the data structure of the input value storage area 760 for storing the input value are shown. In this example, a function is assumed in which three arguments are input values. Here, it is assumed that the input value storage area 760 is an area of the history memory 430 different from the area where the function history, loop individual history, and loop individual history are stored.

  The input value storage area 760 is an area for holding input values of function history and loop individual history. In the input value storage area 760, a first argument value 761, a second argument value 763, and a third argument value 765 are shown in the left column as three arguments. In the column on the right side of the input value storage area 760, link addresses 762, 764 and 766 stored with the three arguments are shown.

  The first argument value 761, the second argument value 763, and the third argument value 765 are areas in which argument values of three arguments that are input values designated by the input value link field 713 are respectively held. That is, the first argument value 761 holds the argument value of the first argument, the second argument value 763 holds the argument value of the second argument, and the third argument value In 765, the argument value of the third argument is held. For example, the first argument value 761 holds the first used argument in the function reuse section, the second argument value 763 holds the second used argument, and the third argument value 765 Holds the third argument used. The address of the first argument value 761 is an address stored in the input value link field 713.

  The link address 762, the link address 764, and the link address 766 are areas that are concatenated and stored in the first argument value 761, the second argument value 763, and the third argument value 765, respectively, and store the address of the next argument. For example, the link address 762 concatenated and stored with the first argument value 761 stores the address of the second argument value 763. The link address 762, the link address 764, and the link address 766 store “0” indicating that there is no link destination when there is no next argument. For example, “0” is stored in the link address 766 that is stored concatenated with the third argument value 765 because there is no fourth argument.

  In this way, the input value storage area 760 holds the link address that specifies the storage location of the next argument for each argument of the input value of the execution history. When searching for the execution history, the input value link field 713 is referred to when the start address of the search request matches the start address of the function history 710, and the input value of the search request is set for each argument in order from the first argument value 761. Compared with the argument. When the third argument value 765 is matched, the search is terminated by “0” of the link address 766, and the process proceeds to an execution result output process.

  As described above, according to the embodiment of the present invention, by saving the input value of the execution history with the link structure, it is possible to reduce the useless area of the storage area and efficiently hold the input value. The input value link field 723 and the input value link field 733 are not described because the input values are stored using the link structure in the same manner as the input value link field 713. Also, the execution result link field 717, the execution result link field 727, and the execution result link field 747 are stored in the same way as the input value link field 713, so that the execution results are saved.

  Although a function in which three arguments are input values is assumed here, the argument values are not limited to a maximum of three. By connecting links, you can handle more than two arguments and variables. Here, it is assumed that the input value storage area 760 is an area in the history memory 430 in order to speed up the search. However, the present invention is not limited to this. For example, by securing the input value storage area 760 in the main storage unit 130, more execution history and loop individual history can be held in the history memory 430.

<3. Example of history information held in history memory and save history held in main storage unit>
[Specific example of saving individual loop history]
FIG. 8 is a diagram showing specific examples of the execution history, loop representative history, and save history in the history memory 430 and the main storage unit 130 when the loop individual history is saved by the history control unit 510 according to the embodiment of the present invention. is there. Here, it is assumed that the area for registering the function history, loop individual history, and loop representative history in the history memory 430 has a capacity capable of storing 10 histories regardless of the data amount. Further, here, it is assumed that the area for storing the save history in the main storage unit 130 has a capacity capable of saving six save histories regardless of the data amount. In the following description, for convenience, the function history that is the execution history of the function reuse section, the loop individual history that is the execution history of the repeated reuse section, and the loop representative history that is the representative history of the repeated reuse section are described. Three histories are expressed as history information.

  FIG. 8A is an example of the execution history, loop representative history, and save history in the history memory 430 and the main storage unit 130 before the history control unit 510 operates. Here, an execution history table 811 and a save history table 812 are shown.

  The execution history table 811 represents history information registered in the history memory 430. In the left column of the execution history table 811, the order indicating the order of registration in the history memory 430 is exemplified in order from “1” to “10”. In this order, the smaller the numerical value, the earlier that it is registered in the history memory 430.

  The right column in the execution history table 811 shows history information registered in the history memory 430. Here, the identifiers shown in FIGS. 6A to 6D and the function or loop that is the basis of the history information are shown. In the case of the loop individual history, a value indicating how many times the loop individual history is executed in the repeated execution is further shown.

  For example, the history information (00 (funcA)) with the rank “1” indicates the function history (00) of the function A (funcA). The history information (01 (loopF (1))) with the rank “7” indicates the loop individual history (01) related to the first execution (1) of the loop F (loopF). The history information (01 (loopF (2))) of the rank “8” indicates the loop individual history (01) related to the second execution (2) of the loop F (loopF) executed repeatedly. Yes.

  The save history table 812 represents the save history saved in the main storage unit 130. The ranks in the save history table 812 indicate the ranks indicating the order registered in the main storage unit 130, and here, ranks from "1" to "6" are illustrated. This ranking means that the smaller the numerical value, the older and registered at an earlier time.

  The save history in the save history table 812 indicates the save history saved in the main storage unit 130. Here, it is shown that no save history is saved in the main storage unit 130.

  In such a case, when the history control unit 510 detects that there is no free space for registering a new execution history in the history memory 430, the loop individual history of the repetitive reuse section executed repeatedly from the history memory 430. Start evacuation.

  FIG. 8B is an example of history information and save history in the history memory 430 and the main storage unit 130 after the history control unit 510 operates. Here, an execution history table 821 and a save history table 822 are shown.

  The execution history table 821 represents history information in the history memory 430 after the loop individual history in the execution history table 811 shown in FIG.

  In the execution history table 821, the loop individual history (01 (loopF (1)) in the order of “7”, the loop individual history (01 (loopF (2)) in the order of “8”, and “ The loop individual history (01 (loopF (3)) with the rank of 9 ”has been deleted. In place of the three loop individual histories, the loop representative history (10 (loopF)) has the rank of“ 7 ”. Is shown in

  Further, since the three loop individual histories are replaced by the loop representative history (10 (loopF)), the function history (00) of the function B indicated by the rank “10” in the execution history table 811 of FIG. (FuncB)) is raised to “8”. This means that there is no execution history having ranks “9” to “10” in the execution history table 821.

  The save history table 822 represents the save history saved in the main storage unit 130 after the history control unit 510 operates.

  In the order of “1” in the save history table 822, the loop is generated repeatedly based on the loop individual history (01 (loopF (1))) of the order “7” in the execution history table 811. A save history (loopF (1)) including an execution result of the first execution of the loop F is shown. In the rank of “2”, 2 of the loop F repeatedly executed, which is generated based on the loop individual history (01 (loopF (2))) shown in the rank of “8” in the execution history table 811. A save history (loopF (2)) including the execution result of the second execution is shown.

  In the ranking of “3”, the third iteration of the repeated loop F generated based on the loop individual history (01 (loopF (3))) shown in the ranking of “9” in the execution history table 811 is included. The save history (loopF (3)) including the execution result of the execution of is shown.

  As described above, in the embodiment of the present invention, by providing the history control unit 510, the execution result of the loop individual history of loops that are repeatedly executed can be saved in the main storage unit 130.

[Example of restoring individual loop history]
FIG. 9 is a diagram illustrating specific examples of the execution history, loop representative history, and save history in the history memory 430 and the main storage unit 130 when restoring the individual loop history by the history restoration unit 520 according to the embodiment of the present invention. is there. Here, it is assumed that the history memory 430 and the main storage unit 130 have the same functions as the history memory 430 and the main storage unit 130 shown in FIG. Here, when a new execution history is registered in the history memory 430 having no free space, the execution history having the longest unused period since the previous use is deleted (LRU: Least Recently Used). Capacity will be secured. Furthermore, here, it is assumed that the execution history has never been used after being registered, and the execution history deleted by the LRU is the execution history having the youngest order.

  FIG. 9A is an example of history information and save history in the history memory 430 and the main storage unit 130 before the loop individual history is restored based on the save history. Here, an execution history table 831 and a save history table 832 are shown.

  The execution history table 831 shows history information registered in the history memory 430 before the history restoring unit 520 restores the loop individual history. The execution history table 831 shows a state where a new execution history is stored in the free capacity of the execution history table 821 shown in FIG. As the new execution history, the function history 00 (funcC) of the function C is registered in the rank “9”, and the function history 00 (funcD) of the function D is stored in the rank “10”.

  The save history table 832 represents the save history saved in the main storage unit 130, similarly to the save history table 822 shown in FIG.

  In such a case, when the history retrieval unit 420 retrieves the loop representative history regarding the loop F from the history memory 430, the history restoration unit 520 starts restoring the individual loop history from the saved history.

  FIG. 9B is an example of history information and save history in the history memory 430 and the main storage unit 130 after the loop individual history is restored from the save history by the history restoring unit 520. Here, an execution history table 841 and a save history table 842 are shown.

  The execution history table 841 shows history information registered in the history memory 430 after the history restoring unit 520 restores the loop individual history. The execution history table 841 shows a state where the loop individual history is restored from the save history of the save history table 832 shown in FIG. 9A and added to the execution history of the execution history table 831.

  In this execution history table 841, the execution histories 00 (funcA) and 01 (loopA (1)) corresponding to the ranks “1” and “2” in the execution history table 831 are deleted, and “3” to “6” are deleted. The order of execution history is moved up from “1” to “4”.

  In the order of “5”, the execution history 01 (loopF (1)) that is the basis of the saving history (loopF (1)) in the order of “1” in the saving history table 832 is restored and registered. . In the order of “6” and “7” as well as “5”, the execution histories 01 (loopF (2)) and 01 (loopF (3)) are restored and registered.

  The save history table 842 shows the save history registered in the main storage unit 130 after the loop individual history is restored. The save history table 842 indicates that all save history shown in the save history table 832 is restored and deleted from the main storage unit 130, and no save history is saved.

  Thus, in the embodiment of the present invention, by providing the history restoration unit 520, the loop individual history saved as the save history in the main storage unit 130 can be restored in the history memory 430.

[Example of registration of new execution history in the embodiment of the present invention]
FIG. 10 is a diagram showing a specific example of history information in the history memory 430 and save history in the main storage unit 130 when a new execution history is registered in the embodiment of the present invention. Here, it is assumed that the history memory 430 has a capacity capable of registering 12 pieces of history information regardless of the data amount.

  Here, when it is desired to register a new execution history in the history memory 430 having no free space, the execution history having the longest unused period since the previous use can be deleted (LRU). Furthermore, here, it is assumed that the execution history has never been used after being registered, and the execution history deleted by the LRU is the earliest execution history registered in the history memory 430.

  FIG. 10A is a schematic diagram showing an execution history newly registered. Here, a newly registered execution history is shown in a registration history table 861. In FIG. 10, it is assumed that the execution history recorded in the registration history table 861 is registered in the history memory 430 in order from the execution history described above.

  FIG. 10B shows a specific example of history information in the history memory 430 and save history in the main storage unit 130 when a new execution history is registered in the data processing apparatus 100 using the conventional technology. is there. Here, an execution history table 871, an execution history table 872, and an erase history table 873 are shown.

  The execution history table 871 represents an execution history in the history memory 430 before the new execution history shown in the registration history table 861 is registered. In the execution history table 871, it is assumed that the execution history is registered in the history memory 430 in order from the execution history described above.

  The execution history table 872 shows an execution history in the history memory 430 after the new execution history shown in the registration history table 861 is registered. The execution history table 872 shows a state where the new execution history shown in the registration history table 861 is registered in the execution history of the execution history table 871.

  In the execution history table 872, the first to fifth (00 (funcE), 01 (loopB (1)) to 01 (loopB (4)) execution histories from the top in the execution history table 871 are deleted. The sixth to twelfth execution histories from the top in the execution history table 871 are shown in the first to seventh in the execution history table 872. Further, in this execution history table 872, the registration history table 861 indicates New execution histories are shown in the eighth to twelfth.

  The deletion history table 873 represents an execution history deleted from the history memory 430 by registration of a new execution history shown in the registration history table 861. In the deletion history table 873, the first to fifth execution histories from the top in the execution history table 871 are shown.

  As described above, since the data processing apparatus 100 using the conventional technique does not include the history control unit 510, the execution result of the execution history cannot be saved in the main storage unit 130. As a result, when a new execution history is registered in the history memory 430, the execution history having the longest unused period since the previous use must be deleted from the history memory 430, and a new execution history must be registered instead. I must.

  FIG. 10C shows a specific example of history information in the history memory 430 and save history in the main storage unit 130 when a new execution history is registered in the data processing apparatus 100 according to the embodiment of the present invention. Is. Here, an execution history table 881, a save history table 882, an execution history table 883, and a save history table 884 are shown. Here, it is assumed that the area for saving the save history in the main storage unit 130 has a capacity capable of saving eight save histories regardless of the data amount.

  The execution history table 881 represents an execution history in the history memory 430 before the new execution history shown in the registration history table 861 is registered. Since this execution history table 881 shows the same thing as the execution history table 871 of FIG.10 (b), detailed description is abbreviate | omitted.

  The save history table 882 represents the save history in the main storage unit 130 before the new execution history shown in the registration history table 861 is registered. The save history table 882 indicates that no save history is saved in the main storage unit 130.

  The execution history table 883 shows history information in the history memory 430 after the new execution history shown in the registration history table 861 is registered. The execution history table 883 shows a state in which the new execution history shown in the registration history table 861 is registered in the execution history of the execution history table 881.

  In the execution history table 883, the loop individual history (01 (loopB (1)) to 01 (loopB (4)) of the second to fifth loops B in the execution history table 881 are deleted from the history memory 430. Then, instead of the loop individual history of the deleted loop B, the loop representative history (10 (loop B)) is shown second from the top in the execution history table 883. Also, in the execution history table 881 The sixth to ninth execution histories from the top are shown in the third to sixth in the execution history table 883.

  Further, in the execution history table 883, loop individual histories (01 (loopC (1)) to 01 (loopC (3)) of the tenth to twelfth loops C in the execution history table 881 are deleted from the history memory 430. Then, instead of the loop individual history of the deleted loop C, the loop representative history (10 (loop C)) is shown in the seventh from the top. The new execution history shown in the history table 861 is written in the eighth to twelfth.

  The save history table 884 shows the save history in the main storage unit 130 after the new execution history shown in the registration history table 861 is registered. In the save history table 884, the save history (loop B (1) to loop B (4)) regarding the loop B is shown from the first to the fourth from the top. Further, here, the evacuation history (loopC (1) to loopC (3)) regarding the loop C is shown from the fifth to the seventh from the top.

  As described above, since the data processing apparatus 100 according to the embodiment of the present invention includes the history control unit 510, the save history is saved in the main storage unit 130, and instead of the loop individual history based on the save history. The loop representative history can be registered in the history memory 430. As a result, when a new execution history is registered in the history memory 430, the save history is saved based on the loop individual history, and the history memory 430 free space is generated by replacing the loop individual history with the loop representative history. be able to. That is, according to the embodiment of the present invention, the number of execution histories held in the history memory 430 can be increased as compared with the data processing apparatus 100 using the conventional technique.

<4. Example of processing procedure of data processing apparatus>
[Operation Example of History Control Unit 510 in the Embodiment of the Present Invention]
Next, processing of the history control unit 510 in the embodiment of the present invention will be described with reference to the drawings.

  FIG. 11 is a flowchart illustrating an example of a processing procedure of loop individual history saving processing by the history control unit 510 according to the embodiment of the present invention. Here, it is assumed that the function history, the loop individual history, the loop representative history, and the save history are each fixed-length data. Here, in the history memory 430, the function history, the loop individual history, and the loop representative history are stored in the order registered in consecutive addresses. Further, in the main storage unit 130, the save history is stored in the order in which the save history is saved at successive addresses.

  First, in the head search unit 610, the search address (radr) is set to “0” (step S911). As a result, the search for the save history is started from the data at the head of the area where the history information of the history memory 430 is registered.

  Next, the head search unit 610 reads the identifier from the search address (radr) (step S912). Then, it is determined whether or not the read identifier is “01” indicating the loop individual history (step S913). If it is determined that the identifier is not “01”, it is determined whether the identifier is “00” indicating the function history (step S914).

  If it is determined that the identifier is not “00”, it is determined that the history information to be analyzed is a loop representative history with the identifier “10”. Subsequently, the number of representative history addresses (x), which is the number of addresses holding the loop representative history calculated from the data length of the loop representative history, is added to the search address (radr), whereby the search address (radr). ) Is updated (step S915). Thereby, the search address (radr) becomes an address indicating the identifier in the history information to be analyzed next.

  On the other hand, if it is determined in step S914 that the identifier is “00”, it is determined that the history information indicating the identifier is a function history. Then, the search address (radr) is updated by adding the function history address number (y), which is the number of addresses holding the function history calculated from the function history data length, to the search address (radr). (Step S916).

  On the other hand, if it is determined in step S913 that the identifier is “01”, it is determined that the history information indicating the identifier is a loop individual history. Then, the search address (radr) is obtained by adding the number of individual history addresses (z), which is the number of addresses holding the loop individual history calculated from the data length of the loop individual history, to the search address (radr). Is updated (step S917).

  Next, in the continuous search unit 620, the continuous search target loop start address (ex_adr) is set to the start address of the repeated reuse section in the loop individual history detected in step S913 (step S918). Further, the save history start address (madr) is set to a save start address which is a start address for storing the first save history supplied from the save area management unit 530 (step S919).

  Further, a continuous counter (rcnt) for counting the number of loops is set to “1” (step S920). Further, the loop individual history start address (start_adr) is set to the start address of the loop individual history detected in step S913 (step S921). With the series of processes in steps S918 to S921, preparation for the process in step S930 is completed.

  Then, it is determined whether or not the loop individual history detected in step S913 is the first execution result of the repeated reuse section to be repeated. If it is repeated, the execution result of the loop individual history is stored in the main memory. The execution result saving process saved in the unit 130 is performed (step S930).

  After steps S915, S916, and S930, it is determined whether the search address (radr) has exceeded the used area final address of the history memory 430 (step S923). The last used area address here is the last recorded history information among the history information stored in the order of registration in consecutive addresses in the area where the history information of the history memory 430 is registered. Address.

  If the search address (radr) does not exceed the final address of the use area, the process returns to step S912 and is repeated. On the other hand, when the final address is exceeded, the loop individual history saving process ends.

  FIG. 12 is a flowchart illustrating an example of a processing procedure of loop individual history execution result saving processing (step S930) by the history control unit 510 according to the embodiment of the present invention.

  First, the continuous search unit 620 determines whether or not the search address (radr) exceeds the use area final address of the history memory 430 (step S931). If the search address (radr) does not exceed the final address of the use area, the identifier is read from the search address (radr) (step S932). Subsequently, it is determined whether or not the read identifier is “01” indicating the loop individual history (step S933). If it is determined that the identifier is not “01”, the process proceeds to step S938.

  On the other hand, when it is determined that the identifier is “01”, it is determined whether or not the start address included in the loop individual history is the same as the continuous search target loop start address (ex_adr) ( Step S934). If it is determined that the start addresses are not the same, the process proceeds to step S938.

  On the other hand, if the start addresses are the same, it is determined whether or not the loop counter value of the loop individual history is the same value as the value obtained by adding “1” to the continuous counter (rcnt) (rcnt + 1) ( Step S935). When it is determined that the loop counter value and “rcnt + 1” are not the same, the process proceeds to step S938.

  Through these steps S934 and S935, it is determined whether or not the loop individual history detected in step S933 is a loop individual history in which the loop individual history detected in step S913 in FIG. 11 is the first loop. .

  For example, if the start address included in the loop individual history is different from the loop search target loop start address (ex_adr) in step S934, it is determined that the loop individual histories in different repeated reuse sections are continuous. .

  In step S935, if the loop counter value included in the loop individual history is different from “rcnt + 1”, it is determined that the same iterative reuse section has been newly executed from the first time instead of being repeated. As an example of step S935, a case where the loop counter value is “1” and “rcnt + 1” is “5” will be described. In this case, the repetitive reuse section indicated by the start address of the loop individual history detected in step S913 in FIG. 11 is repeated and executed five times, and then the loop individual history base detected in step S933 is used. It is determined that the execution has become a new iteration.

  On the other hand, if it is determined in step S935 that the loop counter value and “rcnt + 1” are the same, “1” is added to the continuous counter (rcnt) (step S936). Then, (the number of individual history addresses (y) is added to the search address (radr) to update the search address (radr) (step S937). Thereafter, when the process of step S937 ends, the process proceeds to step S931. The return process is repeated.

  On the other hand, if it is determined in step S931 that the search address (radr) is an address having a value larger than the used area final address, it is determined whether or not the value of the continuous counter (rcnt) is greater than “1”. (Step S938). Accordingly, it is determined whether the loop individual history detected in step S913 in FIG. 11 is the first loop individual history of repeated execution or the loop individual history of single execution. When it is determined that the value of the continuous counter (rcnt) is equal to or less than “1”, the loop individual history detected in step S913 in FIG. 11 is determined as a single loop individual history, and the execution result. End the save process.

  On the other hand, when it is determined that the value of the continuous counter (rcnt) is larger than “1”, the loop individual history is acquired from the history memory 430 (step S939). In this step S939, the loop individual history acquisition unit 630 acquires the loop individual history from the history memory 430 using the loop individual history start address (start_adr) as the first loop individual history registration start point. .

  Subsequently, the save history transfer unit 640 generates a save history based on the loop individual history, and the generated save history is stored in the main storage unit 130 with the save history start address (madr) as a starting point (step S940). ). Note that step S940 is an example of a history control procedure described in the claims.

  Next, the loop individual history deletion unit 512 deletes the loop individual history that is the basis of the save history from the history memory (step S941). Note that step S941 is an example of a history control procedure described in the claims.

  Then, the loop representative history registration unit 513 registers the loop representative history in the history memory 430 based on the loop individual history start address (start_adr) (step S942). Then, the execution result saving process ends. Step S942 is an example of the history control procedure described in the claims.

  As described above, in the embodiment of the present invention, it is possible to save only the loop individual history related to repeated execution among the loop individual histories in the repeated reuse section in the main storage unit 130.

[Operation Example of History Restoring Unit 520 in the Embodiment of the Present Invention]
Next, processing of the history restoration unit 520 in the embodiment of the present invention will be described with reference to the drawings.

  FIG. 13 is a flowchart illustrating an example of a processing procedure of loop individual history restoration processing by the history restoration unit 520 according to the embodiment of the present invention. Here, as in FIGS. 11 and 12, it is assumed that the function history, the loop individual history, the loop representative history, and the save history are fixed-length data. Here, as in FIGS. 11 and 12, in the history memory 430, the function history, the loop individual history, and the loop representative history are stored in the order registered in consecutive addresses. Further, in the main storage unit 130, the save history is stored in the order in which the save history is saved at successive addresses. Here, the start of program execution is the start of the flowchart, and the end of program execution is the end of the flowchart.

  First, an instruction that refers to a function and an input value of the function are read out to the fetch unit 310 and the register file 340 (step S951). Next, the instruction that refers to the function is decoded by the instruction decoder 320 (step S952). Subsequently, it is determined whether or not the decoded (decoded) instruction is a reuse instruction (step S953). When it is determined that the decoded instruction is not a reuse instruction, the execution section 330 executes the reuse section based on the input value supplied from the register file 340, thereby outputting an execution result. (Step S954). Note that step S954 is an example of an execution procedure described in the claims.

  On the other hand, if it is determined in step S953 that the instruction is a reuse instruction, the search request input unit 421 stores history information in the history memory 430 using the start address and input value of the reuse section. Is determined (step S955). At this time, if the reuse section is an iterative reuse section, whether or not there is history information in the history memory 430 is searched using the loop counter value in addition to the start address and the input value.

  If it is determined that the history information is not in the history memory 430, the history registration unit 440 performs an execution result registration process (step S970). As a result, the execution history is registered in the history memory 430.

  On the other hand, when it is determined that the history information is in the history memory 430, an execution result output process is performed by the execution result output unit 422 and the history restoration unit 520 (step S980). As a result, the execution result of the reuse section being executed is output from the history memory 430.

  Then, after the processing of steps S954, S970, and S980, the execution result is written back to the register file 340 (step S956). Subsequently, it is determined whether or not the program has been executed (step S957). If it is determined that the execution of the program has not ended, the process returns to step S951 and the process is repeated.

  On the other hand, when it is determined that the execution of the program has ended, the loop individual history restoring process by the history restoring unit 520 is finished.

  FIG. 14 is a flowchart illustrating a processing procedure example of the execution result registration processing (step S970) in the embodiment of the present invention.

  First, the execution section 330 executes the reuse section based on the input value supplied from the register file 340, thereby outputting the execution result (step S971). Next, the history registration unit 440 determines whether or not there is free space in the history memory 430 for registering the execution history including the output execution result (step S972). Step S971 is an example of an execution procedure described in the claims.

  If it is determined that there is no free space in the history memory 430 for registering the execution history, the deletion unit 460 causes the history memory 430 to execute one execution history with the longest unused period from the previous use. It is deleted (step S973). And it returns to step S972 and a process is repeated.

  On the other hand, when it is determined that the history memory 430 has free space for registering the execution history, the history registration unit 440 registers the execution history in the history memory 430 (step S974), finish.

  FIG. 15 is a flowchart illustrating a processing procedure example of the execution result output process (step S980) according to the embodiment of the present invention. Here, the execution result of the function history, the execution result of the loop individual history, and the save history position information of the loop representative history are expressed as search output information.

  First, in the execution result output unit 422, search output information of history information searched in step S955 of FIG. 13 is acquired from the history memory 430 (step S981). Next, it is determined whether or not the acquired search output information is the save history position information of the loop representative history (step S982). If it is determined that the acquired search output information is not the save history position information of the loop representative history, the process proceeds to step S990.

  On the other hand, when it is determined that the acquired search output information is the saving history position information of the loop representative history, the saving history acquisition unit 521 acquires the saving history indicated by the saving history position information from the main storage unit 130. (Step S983). Subsequently, the loop individual history generation unit 522 restores the loop individual history based on the save history and the loop representative history (step S984). Next, the loop area history is deleted from the history memory 430 by the registration area securing unit 523 (step S985). Thereafter, the registration area securing unit 523 determines whether or not the history memory 430 has a free capacity for registering the loop individual history (step S986). If it is determined that there is no free space in the history memory 430 for registering the loop individual history, the registration area securing unit 523 determines that the execution history with the longest unused period from the previous use is the history memory 430. Is deleted (step S987). And it returns to step S986 and a process is repeated.

  On the other hand, if it is determined in step S 986 that the history memory 430 has free space for registering the loop individual history, the loop individual history registration unit 524 stores the restored loop individual history in the history memory 430. (Step S988). Subsequently, the execution result output unit 422 searches the restored loop individual history (step S989).

  Thereafter, the execution result is output based on the searched execution result (step S990). Then, the execution result output process ends.

  As described above, in the embodiment of the present invention, the loop individual history saved as the save history in the main storage unit 130 can be restored to the history memory 430, and the execution result of the restored loop individual history can be reused. it can.

  As described above, according to the embodiment of the present invention, the execution result of the loop individual history in the repeated reuse section can be saved in the main storage unit 130. As a result, the number of pieces of history information held in the history memory 430 can be increased compared to the case of the prior art in which the execution result is not saved. In addition, since the saved execution result can be used as a search target for the execution result, the execution result can be reused by using the saved execution result.

  Further, according to the embodiment of the present invention, compared with the data processing apparatus 100 according to the prior art, it is possible to prevent a decrease in value reuse efficiency due to deletion of an effective execution history from the history memory 430. it can. Furthermore, according to the embodiment of the present invention, the same effect can be obtained even with a history memory 430 having a smaller capacity compared to the prior art. Therefore, an increase in execution history search time associated with a larger capacity of the history memory 430 is achieved. It is possible to prevent a decrease in value reuse efficiency due to.

  Further, the embodiment of the present invention can increase the number of pieces of history information held in the history memory 430 as compared with the prior art, so that a particularly remarkable effect can be obtained in the case of speculative execution of a program. Conceivable.

  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.

  For example, in the embodiment of the present invention, when the execution result saved in the main storage unit 130 is reused, the loop individual history is restored from the saved history and registered in the history memory 430, and the registered loop An example in which the execution result is output from the individual history has been described. However, the present invention is not limited to this, and when the execution result saved in the main storage unit 130 is reused, the execution result may be reused without restoring the loop history.

  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 Processor core 310 Fetch part 320 Instruction decoder 330 Execution part 340 Register file 400 History management part 410 History object data holding part 420 History search part 421 Search Request input unit 422 Execution result output unit 430 History memory 440 History registration unit 450 History memory capacity management unit 460 Deletion unit 500 History conversion unit 510 History control unit 512 Loop individual history deletion unit 513 Loop representative history registration unit 520 History restoration unit 521 Save History acquisition unit 522 Loop individual history generation unit 523 Registration area securing section 524 Loop individual history registration section 530 Save area management section 600 Save history generation section 610 First search section 620 Continuous search Part 630 loop individual history acquisition unit 640 saving history transfer unit 650 loop representative history generating unit

Claims (12)

An execution unit that executes an instruction section and outputs an execution result; and
The section identification information, the input value, and the execution result of the reuse section in which the execution result is reused among the command sections are stored as an execution history, and the section identification information is used when the stored execution result is used again. A history memory in which the execution history is searched based on the input value;
An evacuation history holding unit for holding an evacuation history for evacuating the execution result of each iteration of an iterative reuse interval in which execution is repeated among the reuse intervals;
The save history is supplied to the save history holding unit based on the execution history of the repeated reuse section, and the execution history that is the basis of the save history is deleted from the history memory when the save history is supplied. And a history control unit for holding a representative history including information indicating the save history in the history memory.   The said history control part supplies the said save history to the said save history holding | maintenance part, when the data amount of the said new execution log to hold | maintain in the said log | history memory is larger than the free capacity of the said log | history memory. Data processing device. A history restoring unit for restoring the execution history to the history memory based on the save history and the representative history;
A history search unit that outputs the execution result based on the restored execution history when the restored execution history is retrieved from the history memory based on the section identification information and the input value; The data processing apparatus according to claim 1, further comprising:   The said history search part makes the said restoration part start restoration of the said execution history, when the said execution history searched based on the said area identification information and the said input value is the said representative history. Data processing device. The history control unit generates the representative history further including a save count indicating the number of the save history,
4. The data processing device according to claim 3, wherein the history restoration unit extracts the save history from the save history holding unit based on information indicating the save history in the representative history and the save count, and restores the execution history. . The execution unit, when supplying the execution result of the reuse section, an identifier for identifying the execution history of the repeated reuse section, the execution history other than the repeated reuse section, and the representative history Further output,
The history memory further holds the identifier as the execution history,
The data processing apparatus according to claim 1, wherein the history control unit supplies the save history based on the execution history identified using the identifier, and generates the representative history further including the identifier.   The data processing apparatus according to claim 1, wherein the repeated reuse section is a subroutine, and the execution unit outputs a start address of the subroutine as the section identification information.   The data processing apparatus according to claim 1, wherein the repeated reuse section is a loop, and the execution unit outputs a start address of the loop as the section identification information. The execution unit further outputs a counter value indicating how many times the execution result is the execution result when outputting the execution result of the repeated reuse section,
The history memory further holds the counter value as the execution history,
The data processing apparatus according to claim 8, wherein the history control unit outputs the save history including the counter value. The section identification information, the input value, and the execution result of the reuse section in which the execution result is reused are stored as an execution history. When the stored execution result is used again, the section identification information and the input value are stored. A history memory in which the execution history is retrieved based on;
The execution result of each repetitive reuse section in which the execution is repeated among the reuse sections is saved as a save history from the history memory to an external storage unit, and becomes the basis of the save history at the time of the save A history storage device comprising: a history control unit that erases the execution history from the history memory and holds a representative history including information indicating the save history in the history memory. The section identification information, the input value, and the execution result of the reuse section where the execution result is reused among the instruction sections are held as an execution history, and when the held execution result is used again, the section identification information and A history memory in which the execution history is searched based on the input value;
A data processing method in a computer, comprising: a save history holding unit for holding a save history for saving the execution result of each iteration of a repeat reuse section in which execution is repeated among the reuse sections, from the history memory. ,
An execution procedure for executing the instruction section and outputting an execution result;
The save history is supplied to the save history holding unit based on the execution history of the repeated reuse section, and the execution history that is the basis of the save history is deleted from the history memory when the save history is supplied. And a history control procedure for holding a representative history including information indicating the save history in the history memory. The section identification information, the input value, and the execution result of the reuse section where the execution result is reused among the instruction sections are held as an execution history, and when the held execution result is used again, the section identification information and A history memory in which the execution history is searched based on the input value;
A program in a computer comprising a save history holding unit for holding a save history for saving the execution result of each iteration of a repeat reuse section in which execution is repeated among the reuse sections, from the history memory,
An execution procedure for executing the instruction section and outputting an execution result;
The save history is supplied to the save history holding unit based on the execution history of the repeated reuse section, and the execution history that is the basis of the save history is deleted from the history memory when the save history is supplied. A program for causing a computer to execute a history control procedure for holding a representative history including information indicating the save history in the history memory.

Images