JPS62298846A - Memory controller - Google Patents

Abstract

PURPOSE:To speed up data editing by moving one data block to a specific position adjacent to a blank area in a memory when the editing of the data block is indicated. CONSTITUTION:A value a half the size (10 bytes) of the area of a data storage device 15 (i.e. 5) is calculated and stored as the frequency of replacement. Then, the head data A in the data storage device 15 is replaced with the final data 1. An address counter is stepped so as to advance objects of replacement to next data B and data 2. it is decided whether the replacement is already performed by fixed times of replacement (five times) and when so, the final use pointer in a block final use address pointer 16 is changed into a new one.

Description

Detailed Description of the Invention 3. Detailed Description of the Invention [Field of Industrial Application] The present invention relates to a memory management device for a personal computer or the like having a memory including a plurality of data blocks.

[Summary of the Invention] The present invention provides, in a memory management device such as a personal computer, when an editing instruction is given to one data block in a memory having a plurality of data blocks, the data block is edited as a blank area in the memory. Data blocks can be moved to adjacent specific positions, thereby allowing data editing to be performed quickly without significantly affecting other data blocks.

[Prior Art] Conventionally, in a system where multiple files (data blocks) exist in one memory, when editing a specific file (new data input, insertion, deletion, etc.),
For example, the methods shown in FIGS. 7(a) and 7(b) are used.

That is, in the case of FIG. 7(a), when there are two files in the memory, the memory is managed by dividing it into two parts. In this case, the first file free area is added to the first file, and the second file is A second file free area is added to the file. In other words, a separate free area is provided for each file.

[Problem to be solved by the invention] However, in this example, when the free area becomes insufficient while editing a specific file, the memory partition declaration must be made again to enlarge the free area, which becomes a hassle. There was a problem.

In the case of FIG. 7(b), for example, there are four files, the first
In a system that has a fourth file and a common free area that can be used commonly by each file, and that manages pointers for each file, when editing a specific file, new data can be added or deleted by editing. There was a problem in that the pointers of other files had to be changed each time, resulting in a significant drop in processing speed.

Furthermore, as another conventional example, there is a modified example shown in FIG. 7(b), and in addition to JMl&, in FIG. 7(b), Eddy 7)/<
There is a method that adds a sofa, performs editing work using this edit buffer, and stores the editing method data back into memory when editing is completed. However, in this case, it is necessary to provide a separate RAM for editing called an edit buffer, which poses the problem of increased costs.

The present invention makes it possible to quickly edit a specific data block in a memory that stores multiple data blocks without significantly affecting other data blocks, and also to realize effective use of memory. The purpose is to provide a memory management device.

[Means for Solving the Problem 1] FIG. 1 is a block diagram of the present invention. In FIG. 1, l is a memory, which is composed of a plurality of data blocks. Further, 2 is a block specifying means for specifying a data block to be edited, and 3 is a transfer means for specifying the data block specified by the block specifying means 2 adjacent to the blank area in the memory l. 4 is an editing means which performs an editing process on the data block moved by the moving means 3.

[Operation] To explain the operation of the present invention, when performing editing work on a specific data block, first, the block specifying means 2 specifies the specific data block. At this time, the moving means 3 moves the position of the designated data block in the memory 1 to a position adjacent to the blank area in the memory 1. After that, the editing means 4 performs editing processing.

[First Embodiment] A first embodiment of the present invention will be described below with reference to FIGS. 2 to 5.

Configuration FIG. 2 is a configuration diagram of a computer system to which the memory management device of the present invention is applied. The key input unit 11 includes various keys, and output signals from each key are input to the CPU 12 and processed. This CPU 12 has programs, arithmetic circuits, etc. that control all operations of this system. Further, various data such as sentences inputted from the key human power section 11 are provided to the data storage device 15 via the CPU 12 and stored therein. This data storage device fa15 is a RAM
It can store multiple data blocks (files).

The data written to the data storage device 15 is also sent to one display buffer 13, and its contents are displayed on the display device 14.

On the other hand, the block last used address pointer 16 stores the block last used address pointer (hereinafter referred to as the last used pointer) of the data block whose data was previously edited, and the last address pointer 17 stores the last used address pointer (hereinafter referred to as the last used pointer). This is a register that stores the final pointer (hereinafter referred to as the final pointer). Then, when the memory exchange device 18 receives an editing designation operation for a certain data block in the data storage device 15 from the key human power section 11.

The last used pointer of the block last used address pointer 16 and the last pointer of the last address pointer 17 are read, and the data block specified to be edited is
This is a device that performs the work of relocating to a specific position adjacent to a free area in the data storage device 15, in this embodiment, to the top address side of the data storage device 15.

FIG. 3 is a diagram showing a general example of the functions of this memory exchange unit W18. That is, as shown in FIG. 3(a),
A previously edited file 1 (data processor 2 1) is stored from the start address A to the last use pointer B in the data storage area of the data storage device 15.
The area from the last used pointer B to the last pointer C is a free area. Another file 2 (data block 2) is stored from the final pointer C to the final address D of the data storage area. In this case, the file 2 is saved in the save area between the final pointer C and the final address 0 when editing the file 1. and the last used pointer B
is stored in the block last used address pointer 16, and the final pointer C is stored in the final address pointer 17, respectively.

When file 1 and file 2 are stored in the data storage device 15 as shown in FIG. The memory exchange unit 2118 performs the work of transferring the file 2 to the position of the file l, that is, the position l that is on the top address side of the data storage device 15 and adjacent to the free area. In this case, the memory exchange unit 2118 The last used pointer B' of file 2 in file 2 is determined by B' = final address D - final pointer before exchange C + starting address A, and block last used address pointer 16 is calculated.
The final pointer C' after the exchange is determined by c'=final address D-last used pointer B before exchange B+starting address A, and is set in the final address pointer 17. As a result, when editing file 2, the address can be updated simply by incrementing from the first address A.

Operation Next, the operation of the above embodiment will be specifically explained with reference to FIGS. 4 and 5.

It is now assumed that the storage area of the data storage device 15 has a capacity of lθ bytes. As shown in FIG. 4(a), before data blocks are exchanged, 4 bytes of data A, B, C
, D (each data A to D is 1 byte each) are stored from the start address side of the data storage device ff115. The following 3-byte area constitutes a free area, and the following 3-byte area contains data 3, 2, etc. of file 2 that had been saved. Suppose that l is memorized.

At this time, block last used address pointer 1
6, the final use pointer of the file I (address next to the final address of data D) is set, and the final address pointer 17 has the final address of the free area set as the final pointer.

In the state shown in FIG. 4(a), when an edit command for file 2 is input from the key manual section 11, the memory exchange device fi18 moves the block last used address pointer 16.
The CPU reads each data of the final address pointer 17.
At this time, the CPU 12 executes the process shown in the flowchart of FIG. 5.

That is, first, the size of the area of the data storage device 15 (1
0 bytes) (that is, 5) is calculated as the number of exchanges and stored (step A1).

Next, data storage! 15, the first data A and the last data 1 are exchanged (step A2).

Then, in step A3, address increment is performed to advance the exchange target to the next data B and data 2. Then step A
In step 4, it is determined whether or not the work has been completed for the calculated number of replacements (5 times), and since this is the first time, the result is NO and the process returns to step A2.

Thereafter, by repeating steps A2 to A4, data B and data 2, data C and data 3, data D and the 7th byte of the free area, and data of the 5th byte and 6th byte of the free area are exchanged. Do each.

When all of this is completed, the answer is YES in step A4, and the process proceeds to step A5, in which the last used pointer in the block last used address pointer 16 is changed to a new one, and in step A6, the final pointer in the last address pointer 17 is changed to a new one. As a result, the data arrangement in the data storage device 15 is as shown in FIG.
b). From then on, key personnel department 11
In accordance with manual key operations from , the CPU 12 performs editing work on the data in the file 2. In this case, address updating is performed only by increment processing.

[Second Embodiment 1 Next, a second embodiment will be described with reference to FIG. 6. In this example, the first address side of the data storage device 15 is the file M+ (the number of bytes is N, and the data of each byte is indicated by 1 to N), which has been edited first, and the following area is a free area.
Next, file M2 (the number of bytes is n, each byte of data is 1
-n), followed by files M3 and Ml.

Therefore, when a key operation is performed to transfer the file M2 from the key manual section 11, in this example, data 1 to N of the file M1 located at the first address of the data storage device 115 are transferred, one byte at a time. , in order from data 1,
The area on the final pointer side of the free area on the upper address side of file M2 is shifted to the upper area side (see FIG. 6(a)). In this case, the free area is shifted to the upper address side.

Next, as shown in FIG. 6(b), each byte of data 1 to n of file M2 is sequentially transferred from data l to the lower address side of the data storage device 15. At this time, the free area is shifted to the lower address side. As a result, as shown in FIG. 6(C), n bytes of data of file M2 are moved to the start address side of data storage device 15, and a free area exists next to it.

After that, necessary editing is performed.

[Effect of the Invention J As explained above, the present invention provides that when an editing instruction is given to one data block of a memory having a plurality of data blocks in a memory management device such as a personal computer, that data block is Since the data can be moved to a specific position adjacent to a blank area in the memory, the data can be moved simply, and data can be edited quickly without affecting other data blocks.

In addition, in order to transfer data blocks, that is, to exchange data blocks, when editing, address updates always require only increment processing, so when data blocks are not exchanged, the address update decrements are only required. There is also the advantage that no processing is required and address control is made that much easier.

Furthermore, since the free areas are provided in one place, there is an advantage that the memory can be used effectively.

Furthermore, if the data blocks to be transferred are always arranged from the start address side of the memory as in the above embodiment, there is the advantage that address control becomes extremely simple.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of the present invention, FIGS. 2 to 5 show a first embodiment, FIG. 2 is a system configuration diagram of a computer, and FIG. 3 shows a general example of the functions of the memory exchange device 18. 4 is a diagram illustrating a specific example of memory exchange, FIG. 5 is a flowchart illustrating the operation of memory exchange, FIG. 6 is a diagram illustrating a specific example of memory exchange in the second embodiment, and FIG. The figure shows an example of conventional memory management. 11...Key human power department, 12...CPU
, 15... Data storage device, 1B...
Block last used address pointer, 17...
Final address pointer, 18... Memory exchange device. Figure 5 Figure 7

Claims (1)

[Scope of Claims] A memory for storing and holding a plurality of data blocks; block specifying means for specifying a data block to be edited; and a block specifying means for specifying a data block specified by the block specifying means adjacent to a blank area in the memory. A memory management device comprising: a relocation means for relocating a data block to a specific position; and an editing means for performing an editing process on the data block transferred by the relocation means.