JPH0756801A - State of memory buffer confirming device controlled by chain system - Google Patents

Abstract

PURPOSE:To easily confirm the state of the memory buffer of a target machine which controls the empty frames of the memory buffer composed of plural frames by making them into a chain. CONSTITUTION:A storage part 14 holds parameters such as the address of the leading frame of a memory buffer 20 or the address of the leading frame of the idle chain required for processing at a copy part 10 and a sort part 13. The copy part 10 reads out the respective frames constituting the memory buffer 20, and those frames are copied to a work memory 11 while adding addresses on a target machaine 2. The sort part 13 retrieves the frames from the leading frame to the ending frame of the idle chain on the work memory 1, stores them in a storage area 15a of a memory 15 in the order of arrangement on the idle chain, also retrieves the frame not linked to the idle chain and stores it in a storage area 15b as well. According to the contents in the storage areas 15a and 15b, a control part 16 displays the conditions of the idle chain and the frames under use or the like on the screen of a display device 17.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention makes a target machine an information processing apparatus that manages empty frames in a memory buffer composed of a plurality of frames by chaining them with pointers, and simply checks the state of the memory buffer. The present invention relates to a device for checking the status of a memory buffer managed by a chain method.

[0002]

2. Description of the Related Art In an information processing device that manages empty frames in a memory buffer by a chain method, when the system is down, as a part of debugging, the usage status of the memory buffer, in particular, the presence or absence of empty frames If there are empty frames or empty frames, work is performed to check the state of the memory buffer, such as the order in which they are chained.

Conventionally, such work has been performed by printing out the contents of the memory buffer as they are or displaying them on a display and visually checking the chain status of empty frames by the operator while tracing 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 time to check the connection state of empty chains, 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 thereof is to provide a state confirmation device capable of easily confirming the state of a memory buffer managed by a chain method. is there.

[0006]

In order to achieve the above-mentioned object, a memory buffer state confirmation device managed by a chain method of the present invention uses a pointer to indicate an empty 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 empty chain, and the end code of the empty chain in the target machine that is chained and managed. Copying 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 work memory. And the para Based on the information stored in the data storage means, searches the work memory from the first frame to the last frame of the empty chain and stores them in the empty chain storage area of the sort result storage memory in the order of arrangement on the empty chain, Sorting means for storing frames not connected to an empty chain in the used frame storage area of the sorting result storage memory, and 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. And display control means.

[0007]

In the state confirmation device for the memory buffer managed by the chain method of the present invention, the parameter storage means is a target in which empty frames of the memory buffer composed of a plurality of frames are chained and managed by pointers. The copy means is stored in this parameter storage means, holding the address of the first frame 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. 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 sort them in the order in which they are stored in the empty chain.Store them in the empty chain storage area of the memory and store the frames that are not connected to the empty chain. The contents are stored in the used frame storage area of the memory, and the control means displays the contents of the free chain storage area and the used frame storage area of the sort result storage memory on the screen of the display device.

[0008]

Embodiments of the present invention will now be described in detail with reference to the drawings.

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

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

FIG. 2 shows an example of the structure of the memory buffer 20. The memory buffer 20 is composed of a header area 200 and a frame area 201.

In the header area 200, various information necessary for the OS on the target machine 2 to manage the memory buffer 20 includes the address of the first frame of the memory buffer 20, the address of the last frame, the size of one frame, Address of the first frame of the empty chain, OS
Stores information such as the number of frames connected to the empty chain recognized by.

The frame area 201 includes a plurality of frames F.
1 to F7. Numerical values such as “4010” described on the left side of the frame area 201 are for each frame F1 to F1.
This is the address (current address) of the start position of F7. Each frame F1 to F7 has a pointer area PT for chaining, and an empty frame has a pointer area P.
The pointers set to T are connected and managed in series. In the illustrated case, since "4010" is set in 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 set 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 flow chart showing an example of processing of the state confirmation device 1 when confirming the state of the memory buffer 20, and S1 to S5 indicate respective steps. 4 and 5 are detailed flowcharts of step S4 of FIG. 6 shows an example of 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. The operation of this embodiment will be described below with reference to the drawings.

After connecting the status confirmation device 1 to the target machine 2 by the cable K, the user operates the keyboard 18
Is operated to input the address of the header area 200 of the memory buffer 20 and the end code of the empty chain to instruct the start of the process, the state confirmation device 1 starts the process shown in FIG. 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 status confirmation apparatus 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 one parameter and is stored in the parameter storage unit 1.
4 (S1). Then, the address of the header area 200 is notified and the parameter extraction unit 12 is activated.

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, gives an instruction to read the contents after the address, and the reading unit In response to this instruction, 22 reads out the contents of the header area 200 of the memory buffer 20 via the bus 21 and sends it back through the cable K. From a predetermined portion of the received data, as shown in FIG. Header area 2
The address of the first frame of the memory buffer 20 in 00, the address of the last frame, the size of one frame, the address of the first frame of the empty chain, and the number of frames connected to the empty chain are detected, and each of them is used as a parameter for parameters. Stored in the storage unit 14 (S
2). Then, when the reading of the necessary data is completed, the reading unit 22 is caused to stop the reading.

By the processing of the parameter extraction unit 12 described above, the following parameters are added to the parameter storage unit 14 in the case of the memory buffer 20 in the state shown in FIG. Address of the first frame of the memory buffer 20 = 401
0 Address of last frame of memory buffer 20 = 407
0 1 frame size = 10 (bytes) Address of first frame of empty chain = 4010 Number of frames connected to 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 gives an instruction to read the contents after that 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 it 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
An address at the beginning position of the frame (“4010” for the first frame, and a value obtained by sequentially adding the value obtained by converting the size of one frame to the address) is added to each of the cut out frames as a current address, and the work memory 11 Are sequentially output to (S3). Then, when the cutting out of the frame of the address “4070” of the final frame of the memory buffer 20 stored in the parameter storage unit 14 is completed, the reading unit 22 is instructed to stop the reading.

As a result of the processing of the copying section 10 as described above, the memory buffer 20 as shown in FIG.
A frame to which a current address is added is stored in each of the frames F1 to F7 constituting the.

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 in the internal variables A to J (S11), and executes steps S12 to S16, whereby the first frame of the empty chain is processed. To the last frame are searched 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. In addition, by executing steps S17 to S22, the frames that are not connected to the empty chain are stored in the in-use frame storage area 15b of the sort result storage memory 15, and by executing step S23, other information is sorted. Other information storage area 1 of result storage memory 15
Store in 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, so the process proceeds to step S17.

If they do not match, the work memory 11 is searched for a frame having the address set in the variable D as the current address, and the frame is output to the free 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 the set variable J whose initial value is an empty set (S14). This is to store that the current address D is an address for an empty frame for later processing.

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 into the variable D (S16). Then, the process returns to step S12.

By performing the above-described processing on the contents shown in FIG. 6 in the work memory 11, the frame F1, the frame F7, the frame F3, and the frame F are displayed.
5, the frame F6 is searched and output in order, and the pointer area PT of the frame F6 is set to the variable E "0.
Since it is equal to "000", the process shifts from step S12 to step S17 at that time. The value of G at the time of shifting to step S12 is 5.

(2) Steps S17 to S22 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 in step S17.

Next, it is determined whether 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 as the current address is an empty frame, and thus the process proceeds to step S21. If not included, the frame having the address set in the variable I as the current address is not an empty frame. Therefore, the 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, the variable H for counting the frames in use is incremented by 1 (S20), and the process proceeds to step S21.

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

By performing the above-described processing on the contents shown in FIG. 6 in the work memory 11, the frames F2 and F4 are searched in order and output to the in-use frame storage area 15b. Has a value of 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 free chain chains and frames in management, and the other information storage area 15c of the sort result storage memory 15 is used.
Output to.

When the processing of the sorting unit 13 is completed, the control unit 16 outputs the sorting result (S5). That is, the contents of each empty frame stored in the empty chain storage area 15a of the sorting result storage memory 15 are displayed in the order of storage as a current address and displayed on the screen of the display device 17 as an empty chain status, and the used frame is stored. The contents of the in-use frame stored in the area 15b are displayed as the in-use frame on the screen of the display device 17 with the current address added 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 used frames are also displayed.

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

The embodiment of the present invention has been described above.
The present invention is not limited to the above embodiments, and various other additions and changes can be made. For example, in the above 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, but these are used. It may be configured such that a person inputs from the keyboard 18.

[0037]

As described above, according to the memory buffer status confirmation device managed by the chain method of the present invention, the contents of the frames connected to the empty chain in the memory buffer to be confirmed are stored together with their current addresses. It is displayed on the screen of the display device in the order of arrangement on the chain, and since the contents of the frames not connected to the empty chain are also displayed together with their current addresses, it is of course possible to check the contents of each frame. There is an effect that it is possible to check at a glance the state of the memory buffer, such as the presence / absence of a file and the order in which it is chained when there are empty frames.

[Brief description of drawings]

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

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

FIG. 3 is a flowchart showing a processing example of a state confirmation device when confirming a state of a memory buffer.

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

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

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

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

[Explanation of symbols]

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

Claims (2)

[Claims] 1. A first frame address, a last frame address, a one frame size of the memory buffer in a target machine that manages free frames of a memory buffer composed of a plurality of frames by chaining with pointers. Parameter storage means for storing the address of the first frame of the empty chain and the end code of the empty chain, and based on the information stored in the parameter storage means, each frame that constitutes the memory buffer is read from the target machine and the target machine is read. The copy means for adding the address of each frame on the machine as a current address to copy to the work memory, and the information stored in the parameter storage means based on the information stored in the parameter storage means, from the first frame of the empty chain to the last frame in the work memory. Means for searching up to the order of the free chains and storing them 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 the empty chain storage area and the used frame storage area of the sort result storage memory on the screen of the display device. . 2. The parameter storage means by extracting the address of the first frame of the memory buffer, the address of the last frame, the size of one frame, and the address of the first frame of the empty chain from the header area of the memory buffer in the target machine. 2. The chain buffer managed state confirmation device according to claim 1, further comprising parameter extraction means for storing the parameter in the chain.