JPS63288327A - Module table control system by input/output routine - Google Patents

Abstract

PURPOSE:To facilitate a program generating work by updating and registering a memory size and a memory address of a module table by using an input/ output routine. CONSTITUTION:When a request is outputted from a user program 10, processings of registration (MDOPEN), write (MDPUT), and read-out (MDGET) of a module name to a memory corresponding to the contents of the request are executed by a memory file input/output routine 20. As for the processings by the routine 20 and a real file input/output routine 30, the contents of the memory are read out by an instruction of MDGET, and write is executed by a WRITE instruction corresponding to an MT 5, a floppy disk FD 6, and a hard disk HD 7. Subsequently, modules which have been stored in the MT 5, the FD 6 and the HD 7 are read out by the routine 20 and registered in the memory, and thereafter, answered to a user program.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a module table control method using input/output routines, and in particular, a method using input/output routines for efficient management of modules during program creation and debugging. Concerning module table control method using input/output routines.

[Conventional technology]

Conventionally, this type of module table control method involves manually inputting the module name, memory size, storage memory address, etc. from the keyboard in an interactive manner according to the module table setting screen shown in Figure 5, and establishing it in the module table. This is a common method.

[Problem that the invention seeks to solve]

The above-described conventional module table control using keyboard input uses a memory management chart to determine the memory size and memory address when setting the memory in an interactive manner. Therefore, when there are a large number of modules, it takes time to create a module table, and there are disadvantages in that setting errors in memory size and memory address are likely to occur.

In addition, due to the above-mentioned error in setting the memory size and memory address, if the memory is small, this will result in a memory write error, and if the memory size is large, the memory cannot be used efficiently.Furthermore, the error in the storage memory address may cause other errors. There are various drawbacks such as the module being destroyed, and if the module is accessed by an input/output routine when the module name is incorrectly set or unset, an access error occurs and it is necessary to set the module table again.

SUMMARY OF THE INVENTION An object of the present invention is to provide a module table control method using an input/output routine that eliminates the conventional drawbacks, eliminates module table setting work, and greatly facilitates program creation and depacking work.

[Means for solving problems]

In the module table control method, the method of the present invention registers and updates the module name, memory size, and memory address in the module table using an input/output routine, and also registers and updates the memory size and memory address by searching the module table. The system is configured with means that enable the decision to be made.

〔Example〕

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

FIG. 1 is a block diagram of one embodiment of the present invention, and FIG. 2 is a flowchart showing the operation of the embodiment of FIG. Below, while referring to the flowchart in Figure 2,
The embodiment shown in the figure will be explained.

The configuration of this system is 1, central processing bag [1, memory 2,
In addition to the computer processing system of keyboard 3 and display 4, MT (Magnetic Tape) 5
, a floppy disk 6, a hard disk 7, etc. Now, the MT is set by the user program.
5. When a request for memory writing to a file in the memory 2 from the floppy disk 6 or hard disk 7 occurs, the input/output routine shown in FIG. 2 is received (step 1).
) can be used to determine the module name (step 2), and then based on the requirements of the user program,
A processing flow corresponding to one of MDOPEN, MDPUT, and MDGET is developed. Here, MD indicates memory 2.0, PEN indicates assignment or registration of a name to memory 2, PUT indicates writing to memory 2, GET indicates reading, and CLO3E indicates completion processing.

FIG. 3 is an explanatory diagram of the input/output routine for real files and memory files.

When a request is issued from the user program 10, the memory file input/output routine 20 registers a module name in the memory 2 (MDOPEN) according to the request contents.
, write (MDPUT), or read (MDGET) will be executed. A memory file input/output routine 20 and a real file input/output routine 3 are executed to respond to requests from the user program 10.
In the processing by 0, the contents of the memory 2 are read by the MDGET command and written to any of the real files, for example MT5, by the MTWRITE command in the real file input/output routine. In FIG. 3, MT is the MT5, FD is the floppy disk 6, and HD is the hard disk 7.''Now, the modules stored in these MT, FD, and HD are then read out by the memory file input/output routine 20 and stored in the memory 2. It is registered in , and is responded to by the user program.

In FIG. 2, after step 2, if the user program request is MDOPEN, it is a new registration, and the module table is searched to determine whether the module has been registered (step 3).

If it is a new term, create a module table chain (step 4) according to Figure 4, and set the module name and memory address for the module table (step 5).
), and if the determination as to whether the module has been registered (step 3) is YES, the process ends.

FIG. 4 is a block diagram of the module table chain. FIG. 4 shows a case of three module tables as an example. The module table in Figure 4 is the head (HE)
AD) address, tail (TAIL) address, module name, memory size, and memory address, solid line arrows indicate forward connections of address chains formed across these module tables, and dotted line arrows indicate reverse connections. For example, prepare an address consisting of 15 words as a module table, and for each of module tables 40 to 60, from the head address to the memory address, write the words @~■, ■~■, [phase]~[phase] from upper to lower. Assume that the settings are made to proceed as shown in FIG. The arrows indicate that in the forward direction, the end of the head address Φ of the module table 40 is connected to the beginning of the head address of the module table 50, and the addresses are connected to form a chain structure.

Returning again to FIG. 2, the description of the embodiment will be continued.

When writing a module to a memory file, the memory address is determined from the module table (step 6) as shown in the MDPUT processing flow in FIG.
Write processing is performed in memory write (step 7), and after this is completed, the memory size is determined (step 8).
The module table is updated (step 11) and the process ends. In other words, this processing flow is for requesting update of the module table.

For MDGET, the memory address is determined from the module table (step 9) and the memory read (
Reading is performed in step 10).

〔Effect of the invention〕

As explained above, the present invention provides a means for registering and updating modules through input/output routines without being aware of module storage memory addresses and memory sizes, thereby making it possible to effectively utilize memory and prevent module destruction. This has the effect of making memory management much easier, and thus making program creation and debugging much easier.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of an embodiment of the present invention, FIG. 2 is a flowchart showing the operation of the embodiment of FIG. FIG. 4 is a module table chain configuration diagram, and FIG. 5 is a conventional module table setting screen diagram. 1...Central processing unit, 2...Memory, 3...Keyboard, 4...Display, 5...MT, 6...
・Floppy disk, 7...Hard disk, 10
...User program, 20.Memory file input/output routine, 30.Actual file input/output routine,
40-60...Module table. Agent: Susumu Uchihara, Patent Attorney 4-;. (,. Kaya /I!1 (α) Setting the module stone () (b) Memory the A Sue / 7 Run to the judge () (C
) Each Senuchi Memoria kLX/lnυshi C)
(d) Returning I 弄3rgJ 4th sentence

Claims (1)

[Claims] In a module table control method, the module name, memory size, and memory address are registered and updated in the module table using an input/output routine, and the memory size and memory address can be determined by searching the module table. A module table control method using input/output routines featuring: