JPS63177234A - File save loading method - Google Patents

Abstract

PURPOSE:To actuate a file save loading action for the entire data structure where the interrelationship is expressed via the address pointer type data at a high speed and with no dependence on the data structure, by using a structure definition table and a memory control table. CONSTITUTION:Both a structure definition table and a memory control table are read at first and the memories are allocated according to the memory sizes described in the memory control table. At the same time, the head address value of the control table is set at the value obtained in the previous tape state and then the memory address allocated this time is set as the head address. This processing is carried out with all memory allocating information on the control table. Then the data entering an actual memory area is read out for each block and written into the corresponding areas in the order of control tables. The type of the data structure is obtained from the control table and the position of the address pointer type data is obtained. Thus the desired address value is obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a file saving/loading method, and particularly to a file saving/loading method of address pointer type data to an auxiliary storage device for data developed on a memory.

[Technological environment]

In recent years, software languages that use address pointer type data to express relationships between data have become popular, and C language in particular tends to use them frequently. In addition, dynamic memory allocation is common in order to have more flexibility in handling the amount of data, and the number of data structures that cannot be handled by the conventional simple table dump file save/load method has increased, and these address pointer types Data and Dynamic Memory Allocation There is a need for an efficient and fast way to save data to and load data from files.

[Conventional technology]

In conventional file saving methods, data such as addresses determined at the time of program execution are either excluded from the file saving target, or are converted to another format such as an array index, saved to a file, and reconverted when loaded. .

Of the two methods mentioned above, the former has the disadvantage that address pointer type data cannot be used in the data structure to be saved as a file, which imposes restrictions on the data representation method and reduces program efficiency. Ta. The latter is
It has the disadvantage that it takes wasted processing time when saving and self-loading files.

[Means for solving problems]

The file save/load method of the present invention uses a structure definition table that defines the memory size of various structures and the offset address from the beginning of the structure for address pointer type data when address pointer type data exists in the structure. and a memory management table that describes the memory start address when each structure was actually allocated, the size of the contiguous memory area allocated to the start address in the example that was allocated at the time of the previous save, and the type of structure. The file is saved as binary data for each of the above two types of tables and the memory area actually allocated, and when loading from a file, after reading the above two types of tables, the data is written in the memory management table. After allocating new memory according to the memory size, the file data for each memory area is read into the newly allocated memory area, and the value of the address pointer type data part written in the structure definition table is newly allocated. It is characterized by converting it into a memory address value.

〔Example〕

Next, embodiments of the present invention will be described in detail with reference to the drawings.

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

Table 1 is a structure definition table that includes memory sizes of various structures and offset position information of address pointer type data. The structure is such that it can accommodate multiple pieces of address pointer type data that exist in one structure. Table 2 is a memory management table that includes the structure type for each contiguous area to which memory is actually allocated, the memory size of the contiguous area, the start address, and the address when the file was last saved and allocated. The dynamic memory allocation area 3 is an area where data for each structure type is stored, and has a size that is an integral multiple of the memory size of the structure. It is also possible for the same structure to have multiple dynamic memory allocation areas.

FIG. 2 is a record configuration diagram of a file when the file is saved. Each table and memory area in Figure 1 is
Saved sequentially to a file. When saving a file, no processing is performed on the contents of each table.

FIG. 3 is a flowchart when loading data from a file. First read the structure definition table and memory management table, allocate memory according to the memory size described in the memory management table, and at the same time set the value of the start address of the table to the value at the time of the last save. After that, set the memory address allocated this time as the start address. This process is performed for all memory allocation information written in the memory management table. Thereafter, the data stored in the file and the actual memory area is read block by block and written to the corresponding area in the order of the memory management table. For each memory area, the structure type of data therein is determined from a memory management table, the position of address pointer type data therein is determined, and its value A is determined. Since A is the address value at the time of saving the file, from the address B of the memory management table at the time of the previous save and the continuous memory allocation size C, search for a table that satisfies B<, A B + C, and find the current memory allocation start address. Find D and reset the new address pointer type data value to the value of A-B+D.

This process is applied to address pointer type data in all memory areas. In the process of changing the address pointer value, the memory management table is sorted according to the address at the time of the previous save, and a desired address value is obtained using binary search.

〔Effect of the invention〕

By providing a structure definition table and a memory management table, the file saving/loading method of the present invention allows the entire data structure that expresses mutual relationships using address pointer type data to be saved and loaded at high speed. It has the effect of not depending on the structure.

[Brief explanation of the drawing]

FIG. 1 is a table configuration diagram showing an embodiment of the present invention, and FIG.
The figure shows the record structure of the file when saving the file.
FIG. 3 is a flowchart when loading from a file. a pilgrimage 11 legs prosthetic tape) ν C Dodaikeno (Suno phi de 4 songs jk technique 1 time foil 2 figures yf! J3 figure 7a cheat 7-t when loading the file

Claims (1)

[Claims] A structure definition table that defines the memory size of various structures and the offset address from the beginning of the structure for address pointer type data when address pointer type data exists in the structure, and the actual memory allocation for each structure. It has a memory management table that describes the start address of the memory at the time, the start address of the memory allocated at the time of the previous save, the size of the allocated contiguous memory area, and the structure type. Binary data is used for each table and memory area actually allocated. When loading from a file, after reading the above two types of tables, new memory allocation is performed according to the memory size described in the memory management table. After that, the file data for each memory area is read into the newly allocated memory area, and the value of the address pointer type data part written in the structure definition table is changed to a value based on the address of the newly allocated memory area. A file saving/loading method characterized by reconfiguring the address reference relationships between each structure.