JPS6314255A - Allocation control system for virtual memory - Google Patents

Abstract

PURPOSE:To refer to an object module with a virtual storage shared among tasks by automatically detecting the object module used by plural tasks and allocating it to the same address in virtual storages characteristic to to respective tasks. CONSTITUTION:The object module (OM) is inputted in a processing 5 and is registered in a task share entry table and a task proper entry table in accordance with the task shared attributes of each area, and the entry number is registered in OM entry table. In a processing 10, it is checked whether an OM to which said OM refers is already inputted or not. If it is registered by another task, plural reference flags in the task proper entry table are marked in a processing 20. The OM reference chain is updated in a processing. After the OM input processing of all tasks is terminated, entries to which plural reference flags in the task proper entry table corresponding are allocated to virtual memories characteristic to tasks in all tasks by a processing 39. In a processing, the entries in parts characteristic to tasks are allocated to virtual memories characteristic to tasks.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a virtual memory allocation control system, and in particular to a virtual memory allocation control system for a multitask program in a computer system having a task-shared virtual memory and a task-specific virtual memory. Regarding the control method to be assigned to.

[Conventional technology]

In a computer system that has a task-shared virtual memory and a task-specific virtual memory, an object module that is referenced by multiple tasks is divided into a code part and a data part, and the code part is stored in the task-shared virtual memory and the data part is divided into a data part. to task-specific virtual memory.

In order to be able to refer to the data section unique to each task from the code section of the object module allocated to the task-shared virtual memory, in a system that has address constants in the task-shared virtual memory, the data section of the virtual memory must be There is a problem that the address must be the same for all tasks.

Conventionally, this type of technology uses the following two methods to solve this problem.
There is a method. In the module related example shown in Figure 3,
Object modules B and C.

The allocation control method will be described assuming that D, J, and P are referenced by a plurality of tasks, and the code portion is allocated to a virtual memory shared by the tasks. In addition, in Figure 3, the circle mark ○
Each clause indicated by indicates an object module name.

In the first method, the object module of the first task PO is first assigned to the task-shared virtual memory or the task-PO-specific virtual memory depending on the task-shared and unique attributes. Next, when assigning the object module for the second task P1, assign the task PO to the same object module (J) as the already processed task PO.
The same address as the unique virtual memory address is assigned to task P.
1 on a unique virtual memory. Already processed task P
For object modules not in O, task P
The highest address n1 of the O-specific virtual memory is used as a start address and assigned to the task P1-specific virtual memory. As a result, the module related example of FIG. 3 is assigned to FIG.

In the second method, the user is asked to specify object modules that are referenced by multiple tasks. First, a designated object module is assigned to a task-specific virtual memory so that all tasks have the same address. Next, an object module that is referenced only in each task is assigned from the next address to which an object module that is referenced in multiple tasks is assigned. As a result, the module association example shown in FIG. 3 is allocated to the task-specific virtual memory as shown in FIG.

[Problem that the invention seeks to solve]

The conventional virtual memory allocation control method described above has the following drawbacks. In the first method, the highest address of the "task-specific virtual memory" of the previously processed task is allocated to the "task-specific virtual memory" of the next task, resulting in unused space in the virtual memory. .

Although the second method does not have the drawbacks of the first method, the user must investigate and specify object modules referenced by multiple tasks.

[Means for solving problems]

The virtual memory allocation control method of the present invention provides means for detecting an object module referenced by a plurality of tasks in a computer system having a task-shared virtual memory and a task-specific virtual memory; and means for allocating the created object module to the same location from the beginning of the virtual memory unique to each task.

〔Example〕

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

FIG. 1 illustrates one embodiment of the invention in which a linker inputs an object module containing an entry point for a task from an object module library.

Furthermore, the object module referenced by that object module is input from the object module library. This operation is repeated for the input object modules until there are no more unresolved object modules. Then, after inputting all the object modules referenced by all the tasks, allocation to the virtual memory is performed.

In this embodiment, in object module input processing, object modules referenced by multiple tasks are detected. This is the flow of processes 5 to 30 shown in FIG. In process 5, an object module is input and the task sharing entry table (a) shown in FIG. 2 is created according to the task sharing attribute of each area in the object module.

Register in the task-specific entry table (b). At the same time, the entry number occupied by this object module in the task-specific entry table (b) is registered in the object module entry table (d). Note that the object module reference chain (c) and object module entry table (d) shown in FIG. 2 are created for each object module.

Next, in process 10, it is checked whether the object module referred to by this object module has been input, and if it has not been input, it is registered in the unresolved object module stack. If the input has been completed, the task-specific 1259 table (b) in FIG. 2 is scanned to see if the referenced object module was registered in another file.

If it is registered in another task, the multiple reference flag in the task-specific 1259 table (b) is marked in flow 20. The entries to be marked are the entry in the object module entry table of FIG. 2 that corresponds to the referenced object module, and the entries of all object modules referenced by this object module obtained using object reference chain (c). .

Subsequently, in process 30, the object module reference chain (c) is updated.

As described above, processes 5 to 30 start from the object module containing the entry point of each task and are performed until there are no more entries in the unresolved object module stack.

After the input processing of the object modules of all tasks is completed, the process moves to process 35. In process 35, the entries marked with the multiple reference flag in the task-specific 1259 table (b) shown in FIG. 2 are assigned to the task-specific virtual memory of all tasks. Thereafter, in process 40, entries of the task-specific portion of the object module that are referenced only by each task are allocated to the task-specific virtual memory for each task.

As a result, the module-related example shown in FIG. 3 has the task PO, PL,
In P2, from address no to object module B,
C, D, J, and P are assigned, and further, object modules A, E,...I are assigned to addresses n1 to n2 in task PO, and object module K is assigned to task P1.

...J is assigned to address 01 to address n3, and object module Q is assigned to task P2.

Assign R...U to addresses n1 to n4.

〔Effect of the invention〕

As explained above, the present invention automatically detects object modules used in multiple tasks and assigns them to the same address on the virtual memory unique to each task. This has the effect of making it possible to refer to the task-shared virtual memory without specifying it from the user, and at the same time making it possible to fully use the virtual memory specific to each task for each task.

[Brief explanation of drawings]

FIG. 1 is an explanatory diagram showing one embodiment of the present invention, FIG. 2 is a diagram showing management information in this embodiment, FIG. 3 is a diagram showing module relationships in this embodiment and in the conventional method, and FIG. 4 is a diagram in the conventional method. FIG. 5 is a diagram showing the layout on the virtual memory in the conventional and the present embodiment. 5.10, 15.20, 25.30, 35.4 (at
qxqK,'ri 工＞ト°JK (b) cis74shiir:,hsu Atsushi Cc) obshebut module 於亚chain [dnoobgenl-[J-ruenF・)Spring 2nd figure f! 3 Diagram (a + Gusuf Myoyu Class Thoughts zm- rbl Kusu 7th item 47 (茛 4 小 - ta entered)] Pθ Task f'f Task P2 (dJ Rimata 7. Leaving a virtual thought J Otsu right 4 (b) Taz 7 fixed view sentences ggZ1 week. cis7Pθ task Pf taz7
PI Kaya, 5 fig.

Claims (1)

[Claims] In a computer system having a task-shared virtual memory and a task-specific virtual memory, a means for detecting an object module referenced by a plurality of tasks, and a means for detecting an object module detected by the detecting means are stored in a virtual memory unique to each task. 1. A virtual memory allocation control method, comprising means for allocating from the beginning of a virtual memory to the same location, and creating a multi-task structure load module.