JP2586799B2 - Memory buffer status check device managed by chain method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information processing apparatus which manages empty frames of a memory buffer composed of a plurality of frames by chaining them with pointers, as a target machine, and easily confirms the state of the memory buffer. The present invention relates to an apparatus for checking the status of a memory buffer managed in a chain system.

[0002]

2. Description of the Related Art In an information processing apparatus that manages empty frames of a memory buffer in a chain system, when the system is down, as a part of debugging, the use state of the memory buffer, particularly whether or not there is an empty frame. When there is an empty frame or an empty frame, an operation of confirming the state of the memory buffer such as the order in which the data is chained is performed.

Conventionally, such work has been performed by printing out the contents of a memory buffer as it is or displaying it on a display, and visually checking the chain state of an empty frame while following the chain pointer. .

[0004]

However, in such a method, in the case of a memory buffer having a large number of frames, it takes time and effort to check the connection state of the empty chains and the like, which delays the debugging work. Was one of the causes.

The present invention has been proposed in view of the above circumstances, and an object of the present invention is to provide a state checking device capable of easily checking the state of a memory buffer managed in a chain system. is there.

[0006]

According to the present invention, in order to achieve the above object, an apparatus for checking the status of a memory buffer managed in a chain system uses a pointer to indicate a free frame of a memory buffer composed of a plurality of frames. Parameter storage means for storing the address of the first frame of the memory buffer, the address of the last frame, the size of one frame, the address of the first frame of the free chain, and the end code of the free chain in the target machine managed in a chain; Copy means for reading each frame constituting the memory buffer from the target machine based on the information stored in the parameter storage means, adding the address of each frame on the target machine as a current address, and copying the frame to the work memory. And the para Based on the information stored in the data storage means, the work memory is searched from the first frame to the last frame of the free chain, and stored in the free chain storage area of the sort result storage memory in the order of arrangement on the free chain, Sorting means for storing frames not connected to an empty chain in the used frame storage area of the sort result storage memory; and displaying the contents of the empty chain storage area and the used frame storage area of the sorted result storage memory on a screen of a display device. Control means for displaying.

[0007]

In the memory buffer status confirmation device managed by the chain method according to the present invention, the parameter storage means manages the empty frames of the memory buffer composed of a plurality of frames by chaining them with pointers. The first frame address of the memory buffer in the machine, the address of the last frame, the size of one frame, the address of the first frame of the empty chain, and the end code of the empty chain are stored, and the copy means is stored in the parameter storage means. Based on the information, each frame constituting the memory buffer is read from the target machine, the address of each frame on the target machine is added as a current address and copied to the work memory, and the sorting means is stored in the parameter storage means. Based on information In the work memory, search from the first frame to the last frame of the empty chain and store them in the empty chain storage area of the sort result storage memory in the order of the empty chain, and store the frames that are not connected to the empty chain. The data is stored in the used frame storage area of the memory, and the control means displays the contents of the empty chain storage area and the used frame storage area of the sorting result storage memory on the screen of the display device.

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, embodiments of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 1, a memory buffer status confirmation device (hereinafter simply referred to as a status confirmation device) 1 managed in a chain system according to an embodiment of the present invention is a copy unit 1.
0, a work memory 11, a parameter extraction unit 12, a sort unit 13, a parameter storage unit 14, a sort result storage memory 15, a control unit 16, a bus 19 interconnecting these components,
It has a display device 17, a keyboard 18, and a connector CN1, and is connected to a connector CN2 of the target machine 2 by a cable K connected to the connector CN1.

The target machine 2 has a bus 21 for connecting the memory buffer 20 to the memory buffer 20 and other components such as a CPU (not shown).
A reading unit 2 that reads the contents of the memory buffer 20 via a bus 21 and outputs the contents to the outside through a connector CN2
Two.

FIG. 2 shows a configuration example of the memory buffer 20. The memory buffer 20 includes a header area 200 and a frame area 201.

The header area 200 contains various information necessary for the OS on the target machine 2 to manage the memory buffer 20, such as the address of the first frame of the memory buffer 20, the address of the last frame, the size of one frame, and the like. Address of first frame of free chain, OS
The information, such as the number of frames connected to the empty chain recognized by the user, is stored.

The frame area 201 includes a plurality of frames F
1 to F7. The numerical values such as “4010” written on the left side of the frame area 201 are the values of the frames F1 to F1.
This is the address (current address) of the head position of F7. Each of the frames F1 to F7 has a pointer area PT for chaining.
The pointers set in T are linked and managed in a unified manner. In the illustrated case, since “4010” is set as the address of the first frame of the empty chain in the header area 200, the first frame of the empty chain is the frame F1, and the address “4070” is stored in the pointer area PT of the frame F1. Is set, the empty frame chained to the frame F1 is the frame F7.

FIG. 3 is a flowchart showing a processing example of the state confirmation device 1 when confirming the state of the memory buffer 20, and S1 to S5 show respective steps. FIGS. 4 and 5 are detailed flowcharts of step S4 in FIG. 6 shows an example of the contents stored in the work memory 11, and FIG. 7 shows an example of a memory buffer status display screen displayed on the display device 7. Hereinafter, the operation of this embodiment will be described with reference to the drawings.

After connecting the status checking device 1 to the target machine 2 via the cable K, the user
Is operated to input the address of the header area 200 of the memory buffer 20 and the end code of the empty chain, and instruct the start of the processing, the state checking device 1 starts the processing shown in FIG. Note that the end code of the empty chain is a code (stopper) set in the pointer area PT of the last frame of the empty chain, and is “0000” in this embodiment.

The control unit 16 of the state checking device 1 inputs the address of the header area 200 and the end code of the empty chain input from the keyboard 18, and the end code of the empty chain is stored as one parameter in the parameter storage unit 1.
4 (S1). Then, the address of the header area 200 is notified, and the parameter extracting unit 12 is started.

The parameter extracting unit 12 notifies the reading unit 22 of the target machine 2 connected by the cable K of the address of the header area 200, issues an instruction to read the contents subsequent to the address, and reads the contents. 22 reads out the contents of the header area 200 of the memory buffer 20 via the bus 21 in response to this instruction and sends it back via the cable K. Header area 2
The address of the first frame, the address of the last frame, the size of one frame, the address of the first frame of the empty chain, the number of frames connected to the empty chain, and the number of frames connected to the empty chain are detected as parameters. Stored in the storage unit 14 (S
2). Then, when the reading of necessary data is completed, the reading unit 22 stops reading.

By the processing of the parameter extracting unit 12 described above, the following parameters are added to the parameter storing unit 14 in the case of the memory buffer 20 in the state of FIG. Address of first frame of memory buffer 20 = 401
0 Address of the last frame of the memory buffer 20 = 407
0 1 frame size = 10 (bytes) Address of the first frame of the empty chain = 4010 Number of frames connected to the empty chain = 5

Next, the control unit 16 activates the copy unit 10.

The copy unit 10 reads the address “4010” of the first frame of the memory buffer 20 stored in the parameter storage unit 14 via the cable K
2 and instructs to read the contents after the address, and the reading unit 22 reads the contents after the address “4010” of the memory byte 20 in response to this instruction and sends them back through the cable K. The size of one frame stored in the parameter storage unit “1”
Each frame is cut out based on “0”. And
To each of the cut-out frames, the address of the head position of the frame (the first frame is “4010”, and thereafter, a value obtained by sequentially adding a value obtained by converting the size of one frame into an address) is added as a current address, and the work memory 11 is added. (S3). Then, when the cutout of the frame at the address “4070” of the last frame of the memory buffer 20 stored in the parameter storage unit 14 is completed, the reading unit 22 is instructed to stop reading.

By the above processing of the copy unit 10, the memory buffer 20 is stored in the work memory 11 as shown in FIG.
Are stored with the current address added to each of the frames F1 to F7 constituting.

Next, the control unit 16 activates the sorting unit 13 to perform the sorting process S4.

As shown in FIG. 4, the sorting unit 13 sets necessary parameters or initial values for the internal variables A to J (S11), and executes steps S12 to S16 to thereby execute the first frame of the empty chain. To the last frame and stored in the empty chain storage area 15a of the sort result storage memory 15 in the order of arrangement on the empty chain. Further, by executing steps S17 to S22, the frames not connected to the empty chains are stored in the used frame storage area 15b of the sort result storage memory 15, and further information is sorted by executing step S23. Other information storage area 1 of result storage memory 15
5c. Hereinafter, these processes will be described in more detail.

(1) Steps S12 to S16 The sorting unit 13 compares the address of the first frame of the empty chain set in the variable D in step S11 with the end code of the empty chain set in the variable E (S1).
2). If they match, there is no empty frame, and the process proceeds to step S17.

If there is no match, a frame having the address set in the variable D as the current address is searched from the work memory 11, and the frame is output to the empty chain storage area 15a of the sort result storage memory 15 (S1).
3). At this time, in the empty chain storage area 15a, writing is sequentially performed from the head portion.

When one frame is output, the current address D of interest is included in a set variable J whose initial value is an empty set (S14). This is to store that the current address D is an address relating to an empty frame for a later process.

Next, the variable G for counting the number of empty frames is incremented by 1 (S15), and the address set in the pointer area PT in the frame searched this time is substituted for the variable D (S16). Then, the process returns to step S12.

The above processing is performed on the contents shown in FIG. 6 in the work memory 11, so that the frame F1, the frame F7, the frame F3, and the frame F
5, the frame F6 is retrieved and output in that order, and the pointer area PT of the frame F6 is set to the variable “0” “0”.
000 ", so that the process proceeds from step S12 to step S17 at that time. Note that the value of G at the time of shifting to step S12 is 5.

(2) Steps S17 to S22 In step S17, the sorting unit 13 sets the variable “I” to the address “4010” of the first frame of the memory buffer 20 set to the variable A.

Next, it is determined whether or not the address set in the variable I is included in the set variable J (S18). If it is included, the frame having the address set in the variable I at the current address is an empty frame, so the process proceeds to step S21. If it is not included, the frame having the address set in the variable I at the current address is not an empty frame. Therefore, a frame having I as the current address is searched from the work memory 11 and the used frame is stored in the sort result storage memory 15. Output to area 15b. At this time, in the in-use frame storage area 15b, writing is sequentially performed from the head portion. Then, a variable H for counting the number of frames in use is incremented by 1 (S20), and the process proceeds to step S21.

In step S21, an address value corresponding to the size of one frame set in the variable C is added to the variable I to generate a current address to be noted next. Then, the current address is compared with the address of the last frame set in the variable B. If I> B, the processing has been completed up to the last frame of the memory buffer 20, so the process proceeds to step S23. If I ≦ B, the process returns to step S18 to repeat the above-described processing.

The above processing is performed on the contents shown in FIG. 6 in the work memory 11, so that the frames F2 and F4 are searched in this order and output to the in-use frame storage area 15b. Is 2.

(3) Step S23 The value of the variable G (5 in this case) is set as the number of frames actually connected to the empty chain, and the value of the variable H (2 in this case) is set as the number of used frames. The value of F (5 in this case) is set as the number of empty chains / frames on the management, and the other information storage area 15c of the sorting result storage memory 15 is respectively provided.
Output to

When the processing of the sorting section 13 is completed, the control section 16 outputs a sorting result (S5). That is, the contents of each empty frame stored in the empty chain storage area 15a of the sort result storage memory 15 are displayed in the order of their storage in the screen of the display device 17 as the empty chain status with the current address added thereto, and the used frames are stored. The contents of the in-use frames stored in the area 15b are displayed as the in-use frames on the screen of the display device 17 with the current address added thereto in the order of storage. Further, the number of frames actually connected to the empty chain stored in the other information storage area 15c, the number of empty chains / frames for management, and the number of frames in use are also displayed.

By performing the above processing,
The display device 17 displays a memory buffer status display screen having contents as shown in FIG. By looking at the empty chain status on this screen, the user can immediately recognize whether or not there is an empty frame and in what order the empty frames are chained. Also, the number of empty frames can be immediately recognized in the column of [Number of used frames]. Further, by comparing the [number of frames actually connected to empty chains] column with the [number of empty chains / frames on management] column, it can be determined whether the number of empty frames has been correctly managed by the OS. Of course, each frame F1
Since the information itself stored in .about.F7 is also displayed, it is also possible to confirm the contents thereof.

The embodiments of the present invention have been described above.
The present invention is not limited to the above embodiments, and various other additions and changes are possible. For example, in the above-described embodiment, a part of the parameters necessary for the processing of the copy unit 10 and the sort unit 13 is automatically extracted from the header area 200 of the memory buffer 20 by the parameter extraction unit 12. The user may make an input from the keyboard 18.

[0037]

As described above, according to the memory buffer status confirmation apparatus managed by the chain method according to the present invention, the contents of the frame connected to the empty chain in the memory buffer to be confirmed together with its current address. Since the contents of frames not connected to an empty chain are displayed together with their current addresses on the screen of the display device in the order of arrangement on the chain, it is possible to confirm the contents of each frame as well as the contents of each frame. It is possible to check at a glance the state of the memory buffer, such as the presence or absence of a frame and the order in which the frames are chained when an empty frame exists.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of an embodiment of the present invention.

FIG. 2 is a diagram illustrating a configuration example of a memory buffer.

FIG. 3 is a flowchart illustrating a processing example of a state checking device when checking the state of a memory buffer;

FIG. 4 is a flowchart showing a part of a detailed flow of step S4 in FIG. 3;

FIG. 5 is a flowchart showing the remaining part of the detailed flow of step S4 in FIG. 3;

FIG. 6 is a diagram showing an example of contents stored in a work memory.

FIG. 7 is a diagram illustrating an example of a memory buffer status display screen displayed on the display device.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 ... State confirmation apparatus 10 ... Copy part 11 ... Work memory 12 ... Parameter extraction part 13 ... Sort part 14 ... Parameter storage part 15 ... Sort result storage memory 15a ... Empty chain storage area 15b ... Used frame storage area 15c ... Other information Storage area 16 Control unit 17 Display device 18 Keyboard 19 Bus 2 Target machine 20 Memory buffer 21 Bus 22 Read unit CN1, CN2 Connector K Cable

Claims (2)

(57) [Claims] 1. An address of a first frame, an address of a last frame, a size of one frame, and an address of a first frame of a memory buffer in a target machine which manages an empty frame of a memory buffer composed of a plurality of frames by chaining with a pointer. Parameter storage means for storing the address of the first frame of the free chain and the end code of the free chain; and reading out each frame constituting the memory buffer from the target machine based on the information stored in the parameter storage means. Copying means for adding the address of each frame on the machine as a current address and copying the data to the work memory; and, based on the information stored in the parameter storage means, from the first frame of the empty chain to the last frame on the work memory. Sorting means for searching up to the system and storing in the free chain storage area of the sort result storage memory in the order of arrangement on the free chain, and storing frames not connected to the free chain in the used frame storage area of the sort result storage memory. And a control means for displaying the contents of an empty chain storage area and a used frame storage area of the sort result storage memory on a screen of a display device, wherein a state check apparatus of a memory buffer managed by a chain method is provided. . 2. The parameter storage means for extracting, from a header area of the memory buffer in the target machine, an address of a first frame of the memory buffer, an address of a last frame, a size of one frame, and an address of a first frame of an empty chain. 2. The apparatus according to claim 1, further comprising parameter extraction means for storing parameters in a memory system.