JPH0250725A - Subprogram retrieving system - Google Patents

Abstract

PURPOSE:To rapidly form a dynamic link by forming a subprogram retrieving structure body independently of a dynamic link control structure body and retrieving a dynamically linked subprogram by a binary tree retrieving method. CONSTITUTION:The subprogram retrieving structure body 6 formed independently of the dynamic link control structure body 5 registers subprogram control data indicators in the alphabetical order of program names so as to retrieve the subprogram control data of the structure body 5 by the binary tree retrieving method based upon program names. A retrieving structure body initializing means 1 initializes the structure body 60 and relates the body 6 with the structure body 5 and a subprogram retrieving method 2 retrieves a subprogram control data indicator from the structure body 6 by the binary tree retrieving method based upon program names. Consequently, the dynamically linked subprogram can be rapidly retrieved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a dynamic program linking method, and more particularly to a subprogram search method for searching for dynamically linked subprograms.

[Conventional technology]

In the conventional dynamic linking method, subprogram control data related to subprograms is registered in the dynamic link control structure in the order in which the subprograms are dynamically linked, and each time a dynamic link request or dynamic link release request occurs. The dynamic link control structure is searched sequentially from the beginning, and if subprogram control data related to the requested subprogram is found, the necessary information is obtained from the dynamic link control structure, and if not found, the subprogram dynamic link is performed. was performed and the subprogram control data was registered in the dynamic link control structure.

[Problem to be solved by the invention]

In the conventional dynamic linking method described above, the dynamic link control structure is sequentially searched each time a dynamic link request or dynamic unlink request is issued, so many subprograms are dynamically linked. The disadvantage is that it takes a lot of time to search for subprograms when they are linked to.

In view of the above points, an object of the present invention is to speed up the search for dynamically linked subprograms by using a binary tree search method that is faster than the sequential search method for searching dynamically linked subprograms. The object of the present invention is to provide a subprogram search method that can be used to search for subprograms.

[Means to solve the problem]

The subprogram search method of the present invention is a subprogram search method for searching whether a subprogram for which a dynamic link request and a dynamic link release request have been made in a computer system has already been dynamically linked. a dynamic link control structure including a dynamic link control structure, and a subprogram that is provided separately from this dynamic link control structure so that the subprogram control data of the dynamic link control structure can be searched by a binary tree search method using a program name. a subprogram search structure for registering a control data indicator in the alphabetical order of a program name; a search structure initialization means for initializing the subprogram search structure and associating it with the dynamic link control structure; a subprogram search means for searching the subprogram control data indicator from the subprogram search structure using a binary tree search method using a program name; subprogram registration means for registering a subprogram control data indicator in the subprogram search structure so that it corresponds to the alphabetical order of the program name when the subprogram control data indicator is not found; and subprogram deletion means for deleting the subprogram control data indicator from the subprogram search structure without changing the alphabetical order of the program name when the control data indicator is found.

[Effect]

In the subprogram search method of the present invention, the dynamic link control structure includes subprogram control data, and the subprogram search structure provided separately from the dynamic link control structure is a subprogram search structure of the dynamic link control structure. A subprogram control data indicator is registered in the alphabetical order of the program name so that the program control data can be searched using the binary tree search method using the program name, and the search structure initialization means initializes the subprogram search structure. is associated with the dynamic link control structure, the subprogram search means searches for the subprogram control data indicator from the subprogram search structure using a binary tree search method using the program name, and the subprogram registration means When the subprogram control data indicator is not found by the subprogram search means, the subprogram control data indicator is registered in the subprogram search structure so that it corresponds to the alphabet of the program name, and the subprogram deletion means dynamically deletes the subprogram control data indicator. When a subprogram control data indicator is found by a subprogram search means at the time of a link release request, the subprogram control data indicator is deleted from a structure for subprogram search without changing the alphabetical order of the program name.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of a subprogram search method according to an embodiment of the present invention. , a subprogram registration means 3, a subprogram deletion means 4, a dynamic link control structure 5, and a subprogram search structure 6.

As shown in FIG. 2, the dynamic link control structure 5 stores dynamic link control data 5 including a search control data indicator 501.
00, subprogram control data 5 including subprogram name 503 and subprogram entry point 504
02 array.

The subprogram search structure 6, as shown in FIG.
It is composed of search control data 600 including 601 valid indicators, and an array of subprogram control data indicators 602 with 601 valid indicators pointing to subprogram control data 502. Note that the subprogram control data indicator 602 indicates the subprogram control data 5 that it points to.
They are arranged from top to bottom in FIG. 2 in alphabetical order of the subprogram names 503 in 02.

Referring to FIG. 3, the processing in the search structure initialization means 1 includes a subprogram search structure area reservation step 31, a reservation area first address search control data indicator assignment step 32, and an initialization of the number of effective instruction steps. transformation step 33
It consists of

Referring to FIG. 4, the processing in the subprogram search means 2 includes an initial setting step 41 and a setting of the number of effective designators as "0".
A determination step 42, a search position IM calculation step 43,
Comparison step 44 of search position M and previous search position M with upper limit J, and program name (load module name)
A comparison step 45, a step 46 of assigning the search position M to the upper limit J, and a step 47 of assigning the search position M to the lower limit ■
, the adjacency determination step 48 between the lower limit I and the upper limit J, and the lower limit! It consists of an addition step 49 and a search position M “1” setting step 410.

Referring to FIG. 5, the processing in the subprogram registration means 3 includes a subprogram search means calling step 51;
Search result determination step 52, counter L initialization step 53, comparison step 54 of counter L and search position M, sub program control data indicator transfer step 5
5, a counter L subtraction step 56, a valid instruction number addition step 57, and a subprogram control data indicator address assignment step 58.

Referring to FIG. 6, the processing in the subprogram deletion means 4 includes a subprogram search means calling step 61;
A search result determination step 62, a counter initialization step 63, a comparison step 64 of comparing the counter with the number of valid indicators, a subprogram control data indicator transfer step 65, an addition step 66 of the counter, and a step 64 of comparing the counter with the number of valid indicators. Subtraction step 67 and subprogram deletion cancellation step 6
It consists of 8.

Next, the operation of the subprogram search method of this embodiment configured as described above will be explained.

When there is an initial dynamic link request, the search structure initialization means l secures an area for the subprogram search structure 6 (step 31), and sets the first address of the secured area to the dynamic link control structure. Subprogram search structure 6 is assigned to the search control data indicator 501 of the structure 5 (step 32).
The number of effective indicators 601 is set to O (step 33).

Further, when there is a dynamic link request and a dynamic link release request, the subprogram search means 2 is activated at the beginning of the subprogram registration means 3 and the subprogram deletion means 4 (steps 51 and 61).

The subprogram search means 2 refers to the subprogram search structure 6 in accordance with the search control data indicator 501 of the dynamic link control structure 5, and sets the lower limit (upper side in FIG. 2) of the search range to 1 and sets the upper limit to 1. (Bottom side in Figure 2) J is the number of effective designators 601, search position (center position of search range) M
is the upper limit J and the previous search position M0 is set to 0 to initialize (step 41), and it is determined whether the number of valid indicators 601 (search position M) is 0 (step 42).

When the number of effective designators 601 is not O, the sub-product search means 2 uses the binary tree search method to find the search position M= (
1+J)/2 (rounded down to the nearest whole number) (step 43), and determines whether the search position iM is equal to the upper limit J and the previous search position M0 is equal to the upper limit J (step 4).
4).

If the search position M is not equal to the upper limit J or the previous search position M0 is not equal to the upper limit J, the sub-program search means 2 retrieves the sub-program control data 502 pointed to by the sub-program control data indicator 602 located at the search position M. The subprogram name 503 inside is compared with the name of the program to be searched (step 45).

Subprogram name 50 in subprogram control data 502
3 is larger than the program name to be searched, the subprogram search means 2 brings the upper limit J to the search position M, sets the search position M to the previous search position M0, and returns to the end state LC ( Subprogram control data indicator 602
is set to 0 (step 46). Then, the lower limit ■ is adjacent to the upper limit J (■
+1=J) or not (step 48), and if the lower limit l is adjacent to the upper limit J, the lower limit I is updated by one (after the lower limit ■ is made equal to the upper limit J), and then the process returns to step 42. , if the lower limit I is not adjacent to the upper limit J, immediately proceed to step 4.
Return to 2.

If the subprogram name 503 in the subprogram control data 502 is smaller than the program name to be searched in step 45, the subprogram search means 2 uses the lower limit I
is brought to the search position M, the search position M is set to the previous search position M0, the end state LC is set to 1 (step 47), and the process returns to step 42.

If the subprogram name 503 in the subprogram control data 502 and the program name to be searched are equal in step 45, the subprogram search means 2 concludes that the subprogram has been found and ends the process.

If the search position M is equal to the upper limit J and the previous search position M0 is equal to the upper limit J at step 44, the subprogram search means 2 concludes that the subprogram has not been found and ends the process.

If the number of valid designators 601 is 0 in step 42, the subprogram search means 2 sets the search position M to 1, sets the final state LC to 1 (step 410), and processes the subprogram as not found. end.

When there is a dynamic link request, the subprogram registration means 3:
First, apply subprogram search means 2 (step 7, step 5).
1) Determine whether a subprogram has been found (step 52).

When it is determined that the subprogram is not found, the subprogram registration means 3 sets the number of valid designators 601 to the counter L (step 53), and determines whether the counter L is equal to or greater than the search position M (step 54). .

If the counter L is greater than or equal to the search position M, the sub-program registration means 3 sends the L-th sub-program control data indicator 6
02 to the (L+1)th sub-program control data indicator 602 (step 55), and after decrementing the counter L by one (step 56), the process returns to step 54.

By repeating steps 54 to 56, the number of effective designators reaches 60.
The sub-program control data indicators 602 from the position indicated by 1 to the search position M are sequentially transferred one by one to the upper limit side (lower side in FIG. 2).

If the counter L is no longer equal to or greater than the search position M in step 54, the subprogram registration means 3 adds 1 to the number of valid indicators 601 (step 57), and sets the (M+LC)th subprogram control data indicator 602 to the current Subprogram control data 502 for dynamically linked subprograms
(step 58), and the process ends.

Further, when it is determined in step 52 that the subprogram has been found, the subprogram registration means 3 ends the process.

When there is a dynamic link release request, the subprogram deletion means 4
, by applying the subprogram search means 2 (step 61
), determine whether the subprogram has been found (Step 2).

When it is determined that the subprogram has been found, the subprogram deletion means 4 initializes the search position M in the subprogram search means 2 in the counter K (step 63);
It is determined whether the counter K matches the number of valid indicators 601 (step 64).

If the counter K does not exceed the number of valid indicators 601, the subprogram deletion means 4 transfers the (K+1)th subprogram control data indicator 602 to the Kth subprogram control data indicator 602 and ( Step 65), after incrementing the counter K by one (step 66), the process returns to step 64.

By repeating steps 64 to 66, the subprogram control data indicators 602 from the position next to the search position M to the position indicated by the number of valid indicators 601 are sequentially transferred one by one to the lower limit side (upper side in FIG. 2). Ru.

If the counter K matches the number of valid designators 601 in step 64, the subprogram deletion means 4 deletes the number of valid designators 601.
01 is subtracted by one (step 67), and the process ends.

Further, when it is determined in step 62 that the subprogram is not found, the subprogram deletion means 4 stops deleting the subprogram (step 68), and ends the process.

(Effects of the Invention) As explained above, the present invention provides a subprogram search structure in addition to the dynamic link control structure, and performs a binary tree search that is faster than the sequential search method for dynamically linked subprograms. Searching using this method has the effect of increasing the speed of dynamic linking.

Note that, since the dynamic link control structure remains the same as before, modifications to the conventional dynamic link system can be kept to the necessary minimum and narrow range.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of a subprogram search method according to an embodiment of the present invention, and FIG. 3 is a flow chart showing the processing of the search structure initialization means in FIG. 1, FIG. 4 is a flow chart showing the processing of the subprogram search means in FIG. 1, and FIG. 5 is a flow chart showing the processing of the subprogram search means in FIG. FIG. 6 is a flowchart showing the processing of the subprogram registration means in FIG. 1, and FIG. 6 is a flowchart showing the processing of the subprogram deletion means in FIG. In the figure, ■...Search structure initialization means, 2...Sub program search means, 3...Sub program registration means, 4...Sub program deletion means, 5...Dynamic link control Structure, 6...Subprogram search structure, 500...Dynamic link control data, 501...
Search control data indicator, 502...Subprogram control data, 503...Subprogram name, 504...Entry point, 600...Search control data, 601...Number of valid indicators, 602...Subprogram control data instruction It is a child. Fig. 1 Fig. Illustrated diagram of the construction of the structure and seedlings of the book of anti-rainbow 10P father 1 Hatake J17 Roku "Lamb P Toomi" 4492

Claims (1)

[Claims] In a subprogram search method for searching whether a subprogram for which a dynamic link request and a dynamic link release request have been made in a computer system has already been dynamically linked, a link control structure, and a subprogram control data instruction provided separately from the dynamic link control structure so that the subprogram control data of the dynamic link control structure can be searched by a binary tree search method using a program name. a subprogram search structure for registering children in alphabetical order of program names; a search structure initialization means for initializing this subprogram search structure and associating it with the dynamic link control structure; and the subprogram search. a subprogram search means for searching a subprogram control data indicator from a program name structure using a binary tree search method using a program name; a subprogram registration means for registering subprogram control data indicators in the subprogram search structure in alphabetical order of program names; and a subprogram control data indicator for the subprogram search means when requesting dynamic link release. 1. A subprogram search method, comprising: subprogram deletion means for deleting the subprogram control data indicator from the subprogram search structure when a subprogram control data indicator is found without changing the alphabetical order of program names.