JPH09138762A - Memory developing method for tree structure table - Google Patents

Abstract

PROBLEM TO BE SOLVED: To execute memory development in common by means of the tree structure table of any constitution. SOLUTION: A data file having a data structure information part 12 provided with a data length 1-4 being size information of a table and position information 1-5 being link regulation information among the tables, and a data part 1-3 is prepared. The table area is secured on a memory by the data length 1-4, and the plural tables which are linked as shown in (A) are developed into a tree form on the memory by using the real address of the head table secured on the memory and position information 1-5.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a tree structure table memory expansion method, and more particularly to a tree structure table memory expansion method of an arbitrary structure.

[0002]

2. Description of the Related Art Conventionally, in an operation management system in a network system, relations of nodes and terminals belonging to the nodes and operation data are managed by a tree structure table. These tree structure tables are different for each network system. When expanding a tree structure table into a memory, create a memory expansion program suitable for each tree structure, and use the operation management system to create a dedicated memory expansion program for the memory expansion program. It was necessary to expand the memory by calling.

[0003]

In the conventional memory expansion method of the tree structure table described above, only one tree table information of a specific structure can be expanded in memory by one program, and addition of a new tree structure table or When the existing tree structure table was changed, there was a problem that a new memory expansion program had to be created or modified.

Further, since the memory expansion program is specialized for the tree structure, there is a problem that the table expansion processing programs cannot be shared.

[0005]

According to a first aspect of the present invention, in a memory expansion method of a tree structure table in a system for managing a plurality of tables in a tree form on a memory, size information of each of the plurality of tables and Link definition information between tables is prepared in a file in advance, the table area is secured in the memory according to the size information of the table, and the real address of the head of the table secured in the memory and the link regulation information. Is used to link the plurality of tables and to develop them in a tree shape on the memory.

According to a second aspect of the present invention, the link definition information of the first aspect of the invention is such that the set address of the real address of the lower table in each of the tables expanded in the tree form is set from the top of each table. It is characterized in that it is defined as an offset value of.

In a third aspect of the invention, the link defining information in the second aspect of the invention is such that the set address of the real address of the upper table in the plurality of peer tables in each of the tables expanded in the tree shape is It is characterized in that it is defined as an offset value from the head of the plurality of peer tables.

[0008]

Next, the present invention will be described with reference to the drawings.

FIG. 1A is a diagram showing an example of a tree structure table used in the present invention, and FIG. 1B is a diagram showing an example of the structure of a data file of the present invention which is referred to when the tree structure is expanded into a memory. 2A and 2B are operation explanatory diagrams of the present invention, FIG. 2A is a detailed diagram of a tree structure table, and FIG. 2B is a diagram showing an example of position information in a data file. 3 to 5 are flowcharts showing the operation of the present invention.

In a system for managing a plurality of elements (hereinafter referred to as a table), when it is desired to expand a table in a memory as a tree structure as shown in FIG. 1A, the data file of FIG. It consists of a data structure information section 1-2 and a data section 1-3. The data structure information section 1-2 stores the expansion position address of the table, the chain destination of the table, the chain source address, and the like. Further, the data section stores the data to be copied to the expanded table.

Further, the data structure information part 1-2 has a data length 1-
It is composed of 4 and location information 1-5. Where the data section
The data structure information section 1-2 having 1-3 is the record type 1, the data section 1-3 is the record type 2, and the data structure information section 1-7 having no data section 1-3 is the record type 3. Although not shown, these types are stored at the head of the data structure information section 1-2 and the data section 1-3.

Next, the memory expansion procedure of the present invention will be described with reference to the data files of FIGS. 3 to 5 and FIG. 1 (B).

First, the data structure information section 1-2 is read from the data file (S1-1), and one table is reserved in the memory based on the data length 1-4 (S1-2), and then FIG. Call the address acquisition function shown in to acquire the expansion position based on the position information 1-5 (S1-3), and store the real address of the memory secured in step S1-2 in the acquired expansion position (S1-4). , Then read the next record (S1-5), record type 2 (data section 1-3
If it is (S1-7), the data is copied (S1-8).
By this processing, one table is expanded in the memory. Since each table has a data structure information section 1-2, if record type 1 (data structure information section 1-2) is found in step S1-7, the process returns to step (S1-2) to expand the next table. Therefore, the memory expansion of a plurality of tables is performed by repeating this process.

When chaining already developed tables, that is, in the case of record type 3 (data structure information section 1-7) in step (S1-7), a chaining function (see FIG. 4) is used. Call (S1-9). The procedure of the chaining function (F2) first calls the address acquisition function to acquire the first real address of the table to be chained by the position information 1-5 (S2-1), and saves the acquired real address as the chain destination address. (S2-2), then read the next record (data structure information section 1-8) (S2-3),
The address acquisition function is called again to acquire the chain source address from the position information 1-5 (S2-4), and the chain destination address (real address) acquired in step S2-2 is stored at the position indicated by the chain source address. At this time, areas of data length 1-4 of data structure information section 1-7 and 1-8 are unused.
It is possible to chain a plurality of tables by having the data structure information sections 1-7 and 1-8 for the number of tables to be chained and sequentially performing this process.

In the tree structure table, the table has a bidirectional list structure to search not only from the upper table to the lower table but also from the lower table to the upper table, and between the peer tables not only in the forward direction but also in the backward direction. Chaining will be an important feature to achieve.

Next, the structure of the position information 1-5 and the method of address acquisition (S1-3, S2-1, S2-4) will be described in more detail.

The position information 1-5 is composed of repeated data of offset values from the beginning of each table from the starting point of the tree structure to the target table in order to search the position of a certain table. FIG. 2 (A) is a detailed view of the tree structure table, which shows the relationship between the upper and lower parts and the equality of the table in the broken line portion of the tree structure table example of FIG. 1 (A) together with the offset value. , 0x20, 0x30, etc.) indicates an offset value from the head of each table. FIG. 2B is an example of the position information of each data structure information section in the data file, showing the position information in the case of expanding FIG. 2A, which is the array of the offset values described above. 0xFFFF at the end of the array is a delimiter meaning the end of one position information.

Regarding the procedure for obtaining an address when expanding the tree shown in FIG. 2 (A), FIG. 2 (B) and FIG.
This will be described with reference to the address acquisition flow chart. First, expand the route table 2-3 and put the start address (real address) in the address storage area 2-1 (2-
2), position information is indicated by. Offset value of [0]
Is the offset value 0 from the beginning of address storage area 2-1
This means that the route table 2-3 is located at x0000. The address acquisition function (F3) receives the start address of the address storage area as an argument and substitutes the start address into work (S3-1). Since the offset value [0] is not the delimiter (S3-3), the offset value [0] is added to work to obtain the address (S3-4), and the next offset value [1]
Is a delimiter (S3-5), the function ends.

The address acquired here is an offset value
Since [0] is 0x0000, the start address of the address storage area remains unchanged, and the start address (real address) of route table 2-3 is stored in address storage area 2-1.
Next, when the A table 2-5 is expanded at the offset value 0x0020 from the head of the route table 2-3 (2-4), the position information is as follows. The offset value [1] indicates that the A table 2-5 is positioned at the offset value 0x0020 from the beginning of the route table 2-3. The address acquisition function (F3) receives the head address of the address storage area as an argument as in the previous time, and acquires the address by the same procedure as the previous time until step S3-4. Since the next offset value [1] is not the delimiter here (S3-5), the acquisition address (here, it remains the first address of the address storage area)
The actual address (previously stored route table 2-3 start address) stored in is substituted for work (S3-6), and the process returns to step S3-2. Since the offset value [1] is not the delimiter (S3-3), the offset value [1] is added to work to obtain the address (S3-4), and the offset value [2] is the delimiter (S3-3).
3-5), the function ends. The address acquired here is the offset value [1] at the first real address of the route table 2-3.
That is, it is an address obtained by adding 0x0020, and the leading address of the A table 2-5 is stored here.

Similarly, when the B1 table 2-7 is expanded (2-6), the position information is and the offset value [0] and the offset value [1] have the same meanings as [2] 0x0030 indicates that the start address of the B1 table 2-7 is stored at the offset value 0x0030 from the start of the A table 2-5.

Here, A table 2-5 is replaced with B1 table 2-
Consider the case (2-8) where it is positioned as the upper table of 7.
When chaining such already expanded tables, two pieces of position information are used as in and.
By setting the offset value [2] of 0 to 0x0000, the address of the head of A table 2-5 (A table itself) can be acquired from the position information. Explaining according to the flowchart of FIG. 5, the address acquisition function (F3) acquires an address based on the position information of up to step S3-4 when n is 1, that is, until the process of adding the offset value [1] to work. Do the same as if you did. By the processing up to this point, the offset value [1] 0x0020 is added to the start address of the route table 2-3.
The address obtained by adding is obtained (S3-4). here,
Unlike the case of position information, the offset value [2] is not the delimiter (S3-5), the process proceeds to step S3-6, and the real address stored in the acquired address (the A-table 2-5 start address stored at that time) To work, and step S3-2
Return to Since the offset value [2] is not the delimiter, (S3-
3), add the offset value [2] to work to get the address (S3-4), but the offset value [2] is 0x0000, so work
The value of is still the A-table 2-5 start address, which means that the A-table 2-5 start address has been acquired. Since the offset value [3] is the delimiter (S3-5), the function ends.

In this way, according to the position information, the A table 2-
Get the start address of 5 as the chain destination address. Then, the position acquired by the address acquisition function (F3) based on the position information, that is, the offset value of the position information
At the offset value 0x0024 from the beginning of the B1 table 2-7 shown by [3], the chain destination address (A table
(Start address of 2-5) is stored and A table 2-5 is set to B1.
Chaining is performed as the upper table of Table 2-7. Similarly, the B2 table 2-10 is the same as the B1 table 2-7 (offset value 0x002 from the beginning of the B1 table 2-7).
The location information of (2-9) when expanding to 8 places is represented by. Further, when chaining the A table 2-5 to the higher order of the B2 table 2-10 (2-11), the position information is represented by and the A table 2 acquired by the address acquisition function (F3) based on the position information. -The start address of -5 (same as the case of position information) is the address acquisition function (F3) based on the position information.
The data is stored in the position (offset value 0x0024 from the beginning of the B2 table 2-10) acquired by, and chaining is performed.

As described above, by having the position information 1-5 having the structure shown in FIG. 2B in the data file of FIG. 1B, the expansion position is acquired for each table and reflected in the memory. Therefore, it becomes possible to commonly expand the tree-structured tables of various configurations in the memory.

From the route table of FIG. 1A, C1
Also when expanding to a table, if the position information of the table expansion position address of C1 and C2 is added after the position information shown in FIG. 2B, it is stored in the memory in the same manner as each table of A, B1 and B2. Be deployed to.

[0025]

As described above, according to the present invention, when a table is expanded into a tree structure into a memory, a data structure information section and a data section, which are composed of the data length and position information of the table, are stored in a file for each table. Since the file is read and the data is expanded into the memory in units of one table based on the data structure information, the tree structure table of any structure can be commonly expanded in the memory, and the expansion program is created for each tree structure table. There is an effect that there is no need and that there is no need to modify each program even if there is a change in the tree structure table.

[Brief description of the drawings]

FIG. 1A is a diagram showing an example of a tree structure table used in the present invention, and FIG. 1B is a diagram showing a configuration example of a data file of the present invention.

FIG. 2A is a diagram showing a detailed configuration example of a tree structure table, and FIG. 2B is a diagram showing an example of position information in a data file.

FIG. 3 is a flowchart showing the operation of the present invention.

FIG. 4 is a flowchart of chaining processing in FIG.

5 is a flow chart of an address acquisition function in FIG.

[Explanation of symbols]

 1-1 Route table 1-2 Data structure information section 1-3 Data section 1-4 Data length 1-5 Position information 2-1 Address storage area 2-3 Route table 2-5 A table 2-7 B1 table 2- 10 B2 table

Claims (3)

[Claims] 1. A memory expansion method of a tree structure table in a system for managing a plurality of tables in a tree form on a memory, wherein size information of each of the plurality of tables and link definition information between the respective tables are previously stored in a file. Prepare and secure the table area in the memory according to the size information of the table, and link the plurality of tables using the real address of the head of the table secured in the memory and the link definition information. A tree expanding method for a tree structure table, which is expanded in a tree shape on the memory. 2. The link defining information defines a setting address of the real address of the lower table in each table expanded in the tree shape as an offset value from the head of each table. A method for expanding a memory of a tree structure table according to claim 1. 3. The link specification information indicates a set address of the real address of a higher-order table in a plurality of peer tables in each of the tables expanded in the tree shape,
3. The memory expansion method for a tree structure table according to claim 2, wherein an offset value from the head of the plurality of peer tables is defined.