JPH0228839A - Load module generating system for routine single test processing system - Google Patents

Abstract

PURPOSE:To solve the referring problem of an unsolved symbol by generating a dummy compile unit when symbol information to an unsolved symbol to appear are not in a symbol information table. CONSTITUTION:When a master routine name 6 and the name of a routine A are given and a test processing system RTS is activated, an object module is taken out and compiled and a result is stored to a symbol information table 8 and a compile unit group storing means 10. When a load module preparation processing system LMS is activated, an initial set processing means 1 stores the master routine name 6 to an unsolved symbol holding means 12 and an unsolved symbol existence confirming means 2 delivers control to a retrieval symbol registering means 3 since the master routine name 6 is stored. The means 3 stores the routine name 6, which is held by the holding means 12, to a retrieving symbol holding means 7 and the control is delivered to a compile name retrieval processing means 4.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a load module generation method in a routine single test processing system used for testing programs executed on an electronic computer system.

[Conventional technology]

If you develop a new program to be executed on a computer system or modify an existing program,
Various tests are performed to check whether the program performs its initial functions, one of which is the routine single test. This routine single test narrows down the routine to be tested to only one, generates a load module for testing that routine, and performs the test. A routine-only test processing system is a system that supports such a routine-only test.

By the way, in conventional routine single test processing systems, in response to input of the name of a routine to be tested, an object module with that routine name is input from a program library etc. and compiled, and the result of this compilation is written in the compilation unit. It has a function that solves the reference problem of unresolved symbols that appear and generates a load module for testing that routine, but in order to do this, all compilation units in which unresolved symbols are defined must be prepared in advance. There was a need. If there is no such compilation unit, and therefore a symbol that is not registered in the symbol information table appears as an unresolved symbol, it is treated as an error when each load module is assembled.

[Problem to be solved by the invention]

As mentioned above, conventionally, if a symbol that is not registered in the symbol information table appears as an unresolved symbol, it is treated as an error when assembling the load module, so all symbols referenced by the routine to be tested are In order to solve the reference problem and make it possible to generate a load module, the disadvantage is that compilation units for all the routines in which these symbols are defined must be created in advance.

SUMMARY OF THE INVENTION An object of the present invention is to enable a load module for testing a routine to be tested to be created even if symbol information and compilation units for all symbols referenced in the routine to be tested are not available.

[Means to solve the problem]

In order to achieve the above object, the present invention has a roulot module generation method in a routine single test processing system used for testing programs executed on an electronic computer system. When an unresolved symbol appears in the process of extracting it from the holding means and generating a load module for testing that routine, the symbol information table is searched using the unresolved symbol, and if the corresponding symbol information exists, it is determined that the symbol information exists. A compilation unit indicated by the symbol information is input from the compilation unit holding means to solve the problem of referencing the unresolved symbol, and if the corresponding symbol information does not exist, a dummy compilation unit is generated to store the unresolved symbol. I am trying to solve the reference problem.

[Effect]

In the load module generation method in the routine single test processing system of the present invention, unresolved symbols appear in the process of generating a test load module for the routine to be tested, and the symbol information corresponding to the unresolved symbols is changed to symbol information. If no compile unit exists in the table (and therefore its compile unit does not exist), a dummy compile unit is created and used to resolve the unresolved symbol reference problem.

[Example] Next, an example of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a functional block diagram showing an example of a routine single test processing system to which the present invention is applied.

The routine independent test processing system RTS of this embodiment has a load module creation processing section LM as its functional section.
Contains S. The load module creation processing unit LMS includes an unresolved symbol holding unit 12, a search symbol holding unit 7, a symbol information table 8, a symbol definition information holding unit 9, a compile unit group storage unit 10, and a load module. When a storage means 11 and a routine name 6 to be tested (hereinafter referred to as a parent routine name) are given at the time of startup of the load module creation processing unit LMS, this parent routine name is stored in the unresolved symbol holding means 12.
and unresolved symbol holding means 12 when control is passed from this initial setting processing means 1 or the load module assembly processing means 5 to be described later.
The presence or absence of an unresolved symbol is confirmed in , and if it does not exist, the routine single test processing system R3T is notified that the creation of a load module for testing the parent routine has been completed, and if it exists, control is passed to the search symbol registration processing means 3. An unresolved symbol existence/nonexistence confirmation means 2 and a search symbol for storing one unresolved symbol held in the unresolved symbol holding means 12 in the search symbol holding means 7 when control is passed from the unresolved symbol existence/nonexistence checking means 2. The registration processing means 3, the compile unit name search processing means 4 which performs the processing shown in FIG. It includes a load module assembly processing means 5 which performs the processing shown in the third time upon being passed to generate a load module LM for testing the parent routine and stores it in the load module storage means 11.

FIG. 4 shows an example of the contents of symbol information stored in the symbol information table 8, and the symbol information table 8 can store a plurality of pieces of such symbol information. One piece of symbol information 22 includes a symbol name 23. Types of symbols 24
．． Routine name in which the symbol is defined 25. Compilation unit name containing this symbol or parent routine26
Consists of.

FIG. 5 shows an example of the content of symbol definition information held in the symbol definition information holding means 9, and a plurality of pieces of such symbol definition information can be stored in the symbol definition information holding means 9. One symbol definition information 27 is a symbol name 28
and symbol types 29. As will become clear from the operation description described later, when a symbol for which symbol information is not previously stored in the symbol information table 8 appears as an unresolved symbol, the unresolved symbol name is communicated to the user via a terminal, etc. If there is an object module for a routine that defines the unresolved symbol, input the symbol definition information 27 from a terminal or the like and store it in the symbol definition information holding means 9, and the compile unit name search process will be performed. The symbol information and compilation unit are automatically generated by means 4. It goes without saying that the symbol definition information 27 may be held in the symbol definition information holding means 9 in advance. Furthermore, even if such symbol definition information 27 is not provided, dummy symbol information and compilation units are automatically generated, as will be described later.

Next, unresolved symbol a defined in routine A and unresolved symbol b defined in routine B are included in the parent routine, and the object modules of the parent routine and routine A are in the routine single test processing system RTS (not shown). Assuming a situation where the program is stored in a program library or the like, the operation of this embodiment in this case will be described below.

In FIG. 1, when the user gives the parent routine name 6, which is the name of the routine to be tested, and the name of routine A, and the routine single test processing system RTS is started, the routine single test processing system RTS is not shown. The parent routine and the object module of routine A are extracted from the program library and compiled, and the resulting symbol information and compilation units are stored in the symbol information table 8 and the compilation unit group storage means 10. Then, the parent routine name 6 is passed to the load module creation processing unit LMS to request generation of a load module for testing the parent routine.

When the load module creation processing section LMS is activated, it passes the notified parent routine name 6 to the initial setting processing means 1 and activates it. In response to this, the initial setting processing means 1 stores the parent routine name 6 in the unresolved symbol holding means 12 and passes control to the unresolved symbol existence checking means 2, and the unresolved symbol existence checking means 2 stores the parent routine name 6 in the unresolved symbol holding means 12. 12
Since an unresolved symbol (parent routine name 6 in this case) is stored in , control is passed to the search symbol registration processing means 3. In response, the search symbol registration processing means 3 stores the parent routine name 6 held in the unresolved symbol holding means 12 in the search symbol holding means 7, and passes control to the compilation unit name search processing means 4.

As shown in FIG. 2, the compile unit name search processing means 4 first searches the symbol information table 8 using the parent routine name 6 held in the search symbol holding means 7 as a key, and determines whether symbol information with the same name exists. Then, a search is made to see if a compilation unit salt containing that symbol can be obtained (process 13). Then, if it does not exist, the search symbol used as a key, that is, the unresolved symbol name is output to the internal undefined symbol holding means 19, and then the process proceeds to step 14. However, in this case, since it exists, the process immediately proceeds to step 14, and this In process 14, it is confirmed that no undefined symbols are held, that is, symbol information corresponding to the parent routine name 6 exists in the symbol information table 8, and the compilation unit salt has been obtained, and the compilation unit name search processing means 4
After completing the processing, the compile unit salt containing the parent routine is notified and control is passed to the load module assembly processing means 5.

When the load module assembly processing means 5 takes over the control, as shown in FIG. is input, and in step 21, generation of a load module for testing the parent routine is started.

In the generation of the load module in step 21, if there are no unresolved symbols, the load module LM for testing the parent routine is completed and stored in the load module storage means 11, but in this example, unresolved symbols Since symbols a and b exist, the unresolved symbols a and b are stored in the unresolved symbol holding means 12 and control is returned to the unresolved symbol existence checking means 2.

Now, unresolved symbol existence confirmation means 2 that took over control
Then, the unresolved symbol a is stored in the unresolved symbol holding means 12.
, b are stored, control is passed to the search symbol registration processing means 3, and the search symbol registration processing means 3 stores one unresolved symbol a in the search symbol holding means 7 and transfers control to the compile unit name search processing. Pass to means 4.

The compile unit name search processing means 4 searches the symbol information table 8 using the unresolved symbol a as a key (process 13). At this time, since the symbol information and compilation unit of the unresolved symbol a are stored in the symbol information table 8 and the compilation unit group storage means 10, the compilation unit name search processing means 4 checks it in process 14 and performs control. It is passed to the load module assembly processing means 5.

When control is passed, the load module assembly processing means 5 inputs the compilation unit of the current search symbol, that is, the unresolved symbol a, from the compilation unit group storage means 10, and uses this to create a load module for testing the parent routine. Solve the reference problem of unresolved symbol a necessary for creation. Then, control is partially returned to the unresolved symbol existence confirmation means 2.

The unresolved symbol existence confirmation means 2 to which control has been passed passes control to the search symbol registration processing means 3 because the unresolved symbol b remains in the unresolved symbol holding means 12, and the search symbol registration processing means 3 The unresolved symbol b is stored in the search symbol holding means 7 and control is passed to the compile unit name search processing means 4.

The compile unit name search processing means 4 searches the symbol information table 8 using the unresolved symbol b as a key (process 13), but it searches the symbol information table 8 for the unresolved symbol b and the routine B in which the unresolved symbol b is defined. Since the compilation unit does not exist in the symbol information table 8 and the compilation unit group storage means 10, the compilation unit name search processing means 4 proceeds from processing 14 to processing 15.

In this process 15, the unresolved symbol b is notified to the user through a terminal or the like not shown in FIG. 1, and in response, symbol definition information is inputted. When the user inputs the symbol definition information 27 corresponding to the unresolved symbol b, it is held in the symbol definition information holding means 9, so it is determined in process 16 whether or not the symbol definition information of the unresolved symbol b has been given. , when the symbol definition information is given, the information creation process of process 17 is executed, and when the symbol definition information corresponding to the unresolved symbol b is not given, the dummy information creation process of process 18 is executed. Thereafter, control is passed to the load module assembly processing means 5. Here, process 17. In process 18, the following process is performed.

- Information creation process (process 17) The routine single test processing system RTS is requested to compile the object module of the routine that defines the symbol name 28 of the given symbol definition information 27, that is, the symbol with the current unresolved symbol name. In response, the routine single test processing system RTS compiles the object module with the designated routine name, and stores the resulting symbol information and compilation units in the symbol information table 8 and the compilation unit group storage means 10.

・Dummy information creation process (process 18) Depending on the type of unresolved symbol, set a symbol that has a dummy area with no contents or a symbol for which processing will be returned to its original state without doing anything, and create tummy symbol information and dummy information for that symbol. Create a compilation unit, and store each symbol information table 8 and compilation unit group storage means 1
Store at 0.

Now, the load module assembly processing means 5 to which control has been passed inputs the compilation unit created in process 17 or process 18 from the compilation unit group storage means 10, and uses this to create a load module for testing the parent routine. Solve the reference problem of unresolved symbol b necessary to create . Then, when the control is returned to the unresolved symbol existence/nonexistence confirmation means 2, the unresolved symbol existence/existence confirmation means 2 confirms that there is no unresolved symbol remaining in the unresolved symbol holding means 12, and performs routine independent test processing. Notify the system RTS of the end of processing.

〔Effect of the invention〕

As explained above, in the load module generation method in the routine-only terror test processing system of the present invention, when an unresolved symbol appears in the process of generating a load module for testing a routine to be tested, the unresolved symbol symbol information corresponding to,
When a compilation unit does not exist, a dummy compilation unit is automatically generated and is used to resolve unresolved symbol reference problems, so symbol information for all symbols referenced in the routine under test is maintained. Even if the compilation unit is not prepared in advance, it is possible to generate a load module for testing the routine to be tested, and the test can be performed.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of an embodiment of the present invention, FIG. 2 is a flowchart of an example of processing by the compile unit name search processing means 4, FIG. 3 is a flowchart of an example of processing by the load module assembly processing means 5, and FIG. 4 is a flowchart of an example of processing by the load module assembly processing means 5. FIG. 5 is a diagram showing an example of the content of symbol information, and FIG. 5 is a diagram showing an example of the content of symbol definition information. In the figure, RTS... Routine single test processing system LMS.
...Load module creation processing unit LM...Load module for testing the parent routine...Initial setting processing means 2...Unresolved symbol existence confirmation means 3...Search symbol registration processing means 4...Compilation Unit name search processing means Load module assembly processing means 6 Parent routine name 7 Search symbol holding means 8 Symbol information table 9 Symbol definition information holding means 10 Con) etc. Ile unit group storage means 11...
Load module storage means 12...Unresolved symbol holding means Symbol fixed report internal code 1 Figure 5 Symbol information contents 11 Figure 4

Claims (1)

[Claims] In a load module generation method in a routine single test processing system used for testing programs executed on a computer system, a compilation unit of a routine to be tested is taken out from a compilation unit holding means and a load module for testing the routine is created. When an unresolved symbol appears during the generation process,
A symbol information table is searched using the unresolved symbol, and when the corresponding symbol information exists, a compilation unit indicated by the existing symbol information is input from the compilation unit holding means to solve the reference problem of the unresolved symbol. A load module generation method in a routine single test processing system, characterized in that, when the corresponding symbol information does not exist, a dummy compilation unit is generated to solve the unresolved symbol reference problem.