JP2004030505A - Program trace data recording method and trace memory - Google Patents

Abstract

A debug system that records trace data, which is the execution history of a program, in a trace memory during the execution of a software program and analyzes the trace data may not be able to secure a large amount of trace memory. Recording cannot be performed, and it is difficult to record trace data for a long time.
For the first trace data, the time stamp size is set to 0 and the time stamp value is recorded in the time stamp storage buffer, and for the second and subsequent trace data, the time stamp value is stored in the buffer based on the time stamp value. The value obtained by subtracting the obtained time stamp value and the storage size of the value are recorded in the trace memory, and the value of the buffer is updated with the time stamp value of the second and subsequent trace data.
[Selection diagram] Fig. 1

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a program trace data recording method and a trace memory in a debug tool for writing trace data, which is a program execution history, to a trace memory during execution of a software program, and reading and analyzing the trace data after the program ends. .
[0002]
[Prior art]
In the program trace data recording method, each trace data is composed of a trace log type, a time stamp, and other unique information. Each time an observation event occurs during the execution of a program, the trace data is generated. Record in order. When the trace memory runs out of free space, it returns to the start address of the trace memory and overwrites old trace data.
[0003]
[Problems to be solved by the invention]
In some debug systems, a large amount of trace memory cannot be secured. In this case, only a small amount of trace data can be recorded, and it is difficult to record trace data for a long time.
[0004]
Therefore, an object of the present invention is to provide a program trace data recording method and a trace memory capable of recording more data in a limited memory capacity.
[0005]
[Means for Solving the Problems]
2. A program trace data recording method according to claim 1, wherein said program trace data recording method writes trace data of a program execution into a trace memory.
Writing the time stamp size to the trace memory with the time stamp size being 0 for the first trace data, and recording the time stamp value in the time stamp storage buffer;
For the second and subsequent trace data, the value obtained by subtracting the time stamp value stored in the time stamp storage buffer from the time stamp value of the trace data and the storage size of the value are recorded in the trace memory, and the second and subsequent trace data are recorded. Updating the value of the time stamp storage buffer with the time stamp value of the trace data.
[0006]
According to the program trace data recording method of the present invention, the difference value from the time stamp value of the previous trace data and its size are recorded without recording the time stamp value of the trace data in the trace memory as it is, Reduce the amount of memory occupied by timestamp values. As described above, by appropriately configuring the trace data and the trace memory, it is possible to provide a program trace data recording method capable of recording more data within a limited memory capacity.
[0007]
3. The program trace data recording method according to claim 2, wherein the trace data of the program execution is written into a trace memory, wherein the trace memory is divided into a number of blocks of a trace data type, and each block is traced. It is a one-to-one correspondence with the data type, and when writing the trace data, the type of the trace data is checked, and the trace data is written to a block of the trace memory corresponding to the type of the trace data. .
[0008]
According to the program trace data recording method of the present invention, by dividing the trace memory into blocks for each data type, an area indicating the data type is not required for each data, and the amount of memory is reduced accordingly. Therefore, the same effect as the first aspect can be obtained.
[0009]
4. The trace memory according to claim 3, wherein the trace memory writes trace data of a program execution.
It has a management data area consisting of management data of the same number as the data type, and a block area consisting of a plurality of blocks,
The management data includes a data type, a start block number, a write block number in which data was last written, and a write section number.
A block is composed of one link block number and multiple sections.
Sections are written with data in order from the first section,
The link block number stores the block number where the data is stored when data is written to all sections and the next data of the same data type exists.If the condition is not satisfied, the block exists. In this case, an identification number indicating not to be stored is stored.
[0010]
According to the trace memory of the third aspect, it is possible to reduce the memory area for storing the data type, so that the same effect as the first aspect is obtained.
[0011]
According to a fourth aspect of the present invention, there is provided a program trace data recording method for writing trace data of a program execution into a trace memory according to the third aspect, wherein all data is stored in a section of a write block of a corresponding data type. When a new block cannot be allocated when data is written, the first block number is written to the link block number of the write block, and the write block number and write section number of the management data are changed to the first block number and first section number, respectively. Thereafter, the head block number is changed to the link block number of the block of the head block number, and data is written in the section indicated by the write section number.
[0012]
According to the program trace data recording method of the present invention, when the memory for writing the trace data runs short, the trace data is written to the erasable block in the used block memory, so that the finite memory block can be stored. Can be used repeatedly.
[0013]
6. A program trace data recording method according to claim 5, wherein said program trace data recording method writes trace data of program execution into a trace memory.
The trace memory has a basic data area consisting of the same number of basic data as the data type and a data storage extension area,
The basic data is composed of a data type, an extension area start offset, an extension area size, a data write position, and a data storage area,
In the initial state, the extension area size of all basic data is set to 0, the write position is set to the top position of the data storage area,
When writing trace data, write data to the data write position of the basic data corresponding to the data type,
If there is free space in the data storage area, the write position is set immediately after the written data.If there is no free space, the difference between the time stamps of the first data and the last data of the data storage area is calculated. Then, a data extension area size is obtained, an extension area start offset and an extension area size are set, and thereafter, data is written in order from the beginning of the data storage extension area.
[0014]
According to the program trace data recording method of the fifth aspect, in addition to the same effects as those of the first aspect, a block of a required size can be secured without securing a block of an unnecessary size in the data storage extension area.
[0015]
BEST MODE FOR CARRYING OUT THE INVENTION
(Embodiment 1)
A first embodiment of the present invention will be described with reference to FIGS. FIG. 1 is a flowchart illustrating a program trace data recording method according to the first embodiment. FIG. 2A shows the configuration of the trace data, and FIG. 2B shows the configuration of the trace data stored in the trace memory. As shown in FIG. 2A, the trace data includes unique data and a time stamp value indicating a time at which an event corresponding to the trace data has occurred. In step 101, it is first determined whether or not the data is the first trace data. If the data is the first trace data, 0 is set in the time stamp size B in step 102. In step 103, the time stamp size B and the unique data are stored in the trace memory. The time stamp value A is stored in the time stamp storage buffer at step 107. In the case of the second or subsequent trace data, a time stamp difference value C is calculated by subtracting the time stamp value D already stored in the time stamp storage buffer from the time stamp value A in step 104, and the time stamp difference value is calculated in step 105. The time stamp size B required to record the stamp difference value C is calculated, the time stamp size B, the time stamp difference value C and the unique data are recorded in the trace memory in step 106, and the new time stamp value is recorded in step 107. A is stored in the timestamp storage buffer. In step 108, the generation of the next trace data is waited. If the trace data is generated, the processing is repeated from step 101.
[0016]
In this manner, the trace data recorded in the trace memory is composed of the unique data, the time stamp size B, and the time stamp difference value C, as shown in FIG. Since the time stamp difference value C is smaller than the time stamp value A, the memory size required to record the time stamp difference value C is smaller than that of the time stamp value A. For example, when the time stamp value is output as 32-bit data, the time stamp difference value is 50, and the time stamp size designation area is 4 bits, if the time stamp value is directly recorded in the trace memory, 32 bits are required. Is applied, since the difference value is only 6 bits, even if the time stamp size designation area is added, only 10 bits are required, and it is possible to reduce 22 bits.
[0017]
As described above, the amount of memory occupied by the time stamp value is reduced by recording the difference value from the time stamp value of the previous trace data and its size without recording the time stamp value of the trace data in the trace memory as it is. be able to.
[0018]
(Embodiment 2)
Hereinafter, a second embodiment of the present invention will be described with reference to FIGS. FIG. 3A shows a state of a trace memory in which trace data is recorded by a conventional method, and FIG. 3B shows a state of a trace memory in which trace data is recorded according to the present embodiment. As shown in FIG. 3B, the trace memory is divided into blocks by the number of data types, and each block is associated with the data type on a one-to-one basis. The trace data includes a data type indicating the type and other data. The other data is unique data or a time stamp as described in the above embodiment.
[0019]
FIG. 4 is a flowchart of a processing procedure according to the present embodiment. First, in step 401, the type of data is checked, and the data write position in the memory block corresponding to the type is determined. In step 402, the free area of the memory block is checked. If there is not enough area to write data in the memory block, the write position is set to the head of the memory block in step 403. In other words, the old data is overwritten. In any case, in step 404, data other than the data type is written in the write position, and the data write position is set in the memory address immediately after that. Thus, since it is not necessary to record the data type in each data, it is possible to reduce the memory area for storing the data type.
[0020]
(Embodiment 3)
A third embodiment of the present invention will be described with reference to FIGS. FIG. 5 shows a configuration of the trace memory according to the present embodiment. In FIG. 5, the trace memory includes a management data area 501 and a block area 502. The management data area 501 is composed of a plurality of management data, and has a one-to-one correspondence with the data type. That is, there are the same number of management data as the number of data types. The block area is composed of a plurality of blocks, and is assigned a block number such as 1, 2, 3,. 503 indicates the configuration of each management data. That is, as shown in the configuration 503 of the management data, the management data is composed of four data of the data type, the head block number, the write block number in which the data was written last, and the write section number. The data type stores a number indicating the data type. The first block number stores a block number to be written first among blocks storing trace data. The write section number stores a section number (described later) in a block to be written when data is next written. The block configuration 504 includes a link block number for storing a block number to be written next and a plurality of sections for storing trace data. Data is written to the sections in order from the head section. If the data is written in all sections and the next data of the same data type exists, the link block number stores the block number in which the data is stored. An identification number indicating that there is no is stored.
[0021]
6A and 6B are explanatory diagrams of a data storage example according to the present embodiment. FIG. 6A shows a conventional data storage example, and FIG. 6B shows a data storage example according to the third embodiment of the present invention. In FIG. 6, reference numeral 601 denotes a management data area, and 602 denotes a block data area. The trace data has a data type # 1 and a data type # 2, and 603 and 604 indicate management data of the data type # 1 and the data type # 2, respectively. The management data 603 indicates that the first block number of the data of the data type # 1 is 1, the write block number is 3, and the write section number is 2. The management data 604 indicates that the head block number of the data of the data type # 2 is 2, the write block number is 2, and the write section number is 991. Reference numerals 605, 606, and 607 denote block 1, block 2, and block 3, respectively. In this example, there are 1000 sections in each block, and data of data type # 1 is stored in each of A, D, and F in sections 1, 2, and 1000 of block 1, respectively. Since there is no space in the section of the block 1 and 3 is added to the link block number of the block 1, it is understood that the next data of the data type # 1 is stored in the block 3. In block 3, G is stored in section 1, section 2 and subsequent sections are empty, and the next time data is written, data is written to section 2. This information is set in the write block number and write section number of the management data 603. Since there is an empty section in the block 3 and no block is allocated after the block 3, the link block number is set to the identification number 0 indicating that no block exists.
[0022]
Similarly, in the block 2, it is shown that the link block number is 0, no block exists after the block 2, and the section 991 and subsequent sections are empty.
[0023]
Thus, in the conventional data storage method, the data type is recorded for each data. However, according to the embodiment of the present invention, it is not necessary to reduce the memory area for storing the data type. Becomes possible. Although the amount of data differs depending on the data type, memory blocks are dynamically allocated as needed during writing, so there is no need to determine in advance the amount of memory to be allocated to each data type, and the memory can be used effectively. it can.
[0024]
(Embodiment 4)
A fourth embodiment of the present invention will be described with reference to FIG. FIG. 7 is a flowchart illustrating a procedure of a program trace data recording method according to the fourth embodiment using the trace memory according to the third embodiment. In step 701, first, the type of the trace data is checked, and a corresponding memory block is searched. In step 702, if there is a free area in the searched memory block, trace data is written in step 709. If there is no free area in the memory block in step 702, it is searched whether or not there is an unused block memory. If there is an unused block memory in step 703, an unused block number is substituted for the write block number in step 704. Then, in step 705, the head section number is substituted for the write section number. Then, in step 709, trace data is written. If there is no unused block memory in step 703, the head block number is substituted for the link block number of the write block in step 703a, and the head block number is substituted for the write block number in step 706. In step 707, the head section number is substituted for the write section number, and in step 708, the link block number of the previous head block number (equivalent to the current write block number) is substituted for the head block number. Then, in step 709, trace data is written to the section indicated by the write section number.
[0025]
In this way, when there is a shortage of memory for writing trace data, an erasable block in the used block memory (usually, a block in which the first written data among existing data is written) By writing the trace data in (), a finite memory block can be used repeatedly.
[0026]
(Embodiment 5)
The fifth embodiment of the present invention will be described with reference to FIG. FIG. 8 shows a configuration of a trace memory according to the fifth embodiment. The trace memory includes a basic data area 801 and a data storage extension area 802. The basic data area 801 is composed of a plurality of basic data, and has a one-to-one correspondence with the data type. That is, there are as many basic data as the number of data types. The data storage extension area 802 is used to write trace data when there is no more free space in the data storage area of the basic data configuration 803. The block size is not fixed but variable. Reference numeral 803 denotes a configuration of each basic data. The basic data configuration 803 includes five types of basic data: a data type, an extended area start offset, an extended area size, a data write position, and a data storage area. The data type stores a number indicating the data type. The extension area start offset is an offset indicating where a block to be used for writing trace data next exists when there is no free area in the data storage area, and the extension area size is the size of the block. . The data write position stores the position in the block to be written when data is next written. The data storage area is an area where trace data is first written. The block configuration 805 is composed of trace data.
[0027]
In the initial state, the extension area size of all basic data is set to 0, and the write position is set to the head position of the data storage area. Therefore, the trace data is first written into the data storage area of the corresponding data identification. Thus, at the time of writing the trace data, the data is written at the data write position of the basic data corresponding to the data type, and if there is a free space in the data storage area, the write position is set immediately after the written data.
[0028]
When there is no more free space in the data storage area, a block area is newly secured in the data storage extension area 802, and trace data is stored in the block. When securing a block area in the data storage area, calculate the difference value between the time stamps of the first data and the last data of the data storage area, calculate the data extension area size based on the difference value, The size is set, and data is written sequentially from the top of the data storage extension area. That is, the time from the writing of the first data written to the data storage area of the basic data to the writing of the last data is obtained, and the variable-length block of the data storage extension area to be newly secured is stored as the time and the basic data. Based on the size of the data storage area, the calculation formula “Block size to be newly secured = (size of data storage area of basic data) / (time when last data was written−time when first data was written) × A memory having the size calculated by the coefficient is secured.
[0029]
As a result, a block of a necessary size can be secured without securing a block of an unnecessary size in the data storage extension area.
[0030]
Other embodiments include the following. That is, the program trace data recording method divides the trace memory into a data management area and a plurality of blocks in a process of writing the trace data of the program execution into the trace memory, and the management data area includes the data of the trace data type and the data of the trace data type. Before writing trace data, manage all blocks as unused blocks, check the type of trace data at the time of the first trace data writing, and check the unused blocks from among the unused blocks. One block is taken out, the block is registered in the data management area in correspondence with the trace data type, the trace data is written in the data storage area of the block, and the second and subsequent trace data are written in accordance with the type of trace data to be written. block Search with reference to the management area, write trace data if there is a free area in the data storage area of the block, and if there is no free area, take out one block from unused blocks and make it correspond to the trace data type, It is characterized in that trace data is written in a block.
[0031]
【The invention's effect】
According to the program trace data recording method of the present invention, the difference value from the time stamp value of the previous trace data and its size are recorded without recording the time stamp value of the trace data in the trace memory as it is, Reduce the amount of memory occupied by timestamp values. As described above, by appropriately configuring the trace data and the trace memory, it is possible to provide a program trace data recording method capable of recording more data within a limited memory capacity.
[0032]
According to the program trace data recording method of the present invention, by dividing the trace memory into blocks for each data type, an area indicating the data type is not required for each data, and the amount of memory is reduced accordingly. Therefore, the same effect as the first aspect can be obtained.
[0033]
According to the trace memory of the third aspect, the memory area for storing the data type can be reduced, so that the same effect as the first aspect is obtained.
[0034]
According to the program trace data recording method of the present invention, when the memory for writing the trace data runs short, the trace data is written to the erasable block in the used block memory, so that the finite memory block can be stored. Can be used repeatedly.
[0035]
According to the program trace data recording method of the fifth aspect, in addition to the same effect as that of the first aspect, a block of a required size can be secured without securing a block of an unnecessary size in the data storage extension area.
[Brief description of the drawings]
FIG. 1 is a flowchart showing a procedure of a program trace data recording method according to a first embodiment of the present invention.
FIG. 2 is an explanatory diagram showing a state of trace data according to the first embodiment.
FIG. 3 is an explanatory diagram showing a state of a trace memory according to a second embodiment of the present invention.
FIG. 4 is a flowchart illustrating a procedure of a program trace data recording method in the second embodiment.
FIG. 5 is an explanatory diagram showing a configuration of a trace memory according to a third embodiment of the present invention.
FIG. 6A is an explanatory diagram showing a conventional data storage example, and FIG. 6B is an explanatory diagram showing a data storage example according to the third embodiment.
FIG. 7 is a flowchart illustrating a procedure of a program trace data recording method according to a fourth embodiment of the present invention.
FIG. 8 is an explanatory diagram showing a configuration of a trace memory according to a fifth embodiment of the present invention.
[Explanation of symbols]
Reference numeral 501 management data area 502 block data area 503 management data configuration 504 block configuration 601 management data area 602 block data area 801 basic data area 802 data storage extension area 803 basic data configuration 804 data storage area configuration 805 block configuration 806 Extended area size

Claims (5)

A program trace data recording method for writing trace data of program execution to a trace memory,
For the first trace data, write the time stamp size to the trace memory with a time stamp size of 0, and record the time stamp value in a time stamp storage buffer;
For the second and subsequent trace data, a value obtained by subtracting the time stamp value stored in the time stamp storage buffer from the time stamp value of the trace data and the storage size of the value are recorded in the trace memory, A program trace data recording method, comprising a step of updating a value of the time stamp storage buffer with the time stamp value of second and subsequent trace data. A program trace data recording method for writing trace data of a program execution to a trace memory, wherein the trace memory is divided into a number of blocks of a trace data type, and each block corresponds to the trace data type on a one-to-one basis. A program trace data recording method, comprising: when writing trace data, examining a type of the trace data, and writing the trace data in the block of the trace memory corresponding to the type of the trace data. A trace memory for writing trace data of program execution,
It has a management data area consisting of management data of the same number as the data type, and a block area consisting of a plurality of blocks,
The management data is composed of the data type, a head block number, a write block number in which data was last written, and a write section number,
The block is composed of one link block number and a plurality of sections,
In the section, data is written in order from the first section,
The link block number stores the block number in which the data is stored when data is written in all the sections and the next data of the same data type exists, and does not satisfy the condition. A trace memory in which an identification number indicating that no block exists is stored. 4. A program trace data recording method for writing trace data of a program execution into a trace memory according to claim 3, wherein all data is written to a section of a write block of a corresponding data type, and a new block cannot be allocated. In this case, the head block number is written to the link block number of the write block, and the write block number and write section number of the management data are changed to the head block number and head section number, respectively, and then the head block number is changed to the head block number. A program trace data recording method, wherein data is written to the section indicated by the write section number after changing to the link block number of the block. A program trace data recording method for writing trace data of program execution to a trace memory,
The trace memory has a basic data area consisting of the same number of basic data as the data type and a data storage extension area,
The basic data includes a data type, an extension area head offset, an extension area size, a data write position, and a data storage area,
In the initial state, the extension area size of all the basic data is set to 0, the write position is set to the top position of the data storage area,
When writing trace data, write data to the data write position of the basic data corresponding to the data type,
If there is a free area in the data storage area, the write position is set immediately after the written data.If there is no free area, the difference between the time stamp of the first data and the last data of the data storage area is calculated. A program trace data, wherein a data extension area size is obtained based on a difference value, the extension area start offset and the extension area size are set, and data is sequentially written from the beginning of the data storage extension area. Recording method.

Images