JPH0651980A - Arranging system for stack of information processor - Google Patents

Abstract

PURPOSE:To provide the arranging system of a stack in which a swap area can be prevented from being oppressed by a program area including the stack in multithread environment. CONSTITUTION:A program 10 which generates the multithread environment is comprised of a text, data, a heap, and plural thread stacks. Also, areas such as the swap area 11 and a file area 12 are formed in a disk, and for example, they are divided by an OS. The programs of the text, the data, and the heap are allocated to the swap area 11, and the thread stacks are allocated to the file area 12. Since the thread stacks are allocated to the file area 12, the swap area can be prevented from being oppressed even when the maximum number of threads are prepared by expectation in the thread stack.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a stack arranging method for an information processing apparatus, and more particularly to a stack arranging method in a multithread environment.

[0002]

2. Description of the Related Art A multi-thread environment is an environment in which a plurality of processes (threads) share resources such as an address space and files, and threads are normally created and destroyed dynamically. Therefore, a plurality of stacks for storing the threads are required, and the stacks are dynamically created and deleted.

Conventionally, when a multi-thread environment is realized in a system having a swap area in addition to the file area, the program area including the stack is usually taken as the swap area.

For example, as shown in FIG. 4, when there is a program 10 that realizes a multi-thread environment consisting of text, data, heap and stack, the program areas for the text, data, heap and stack are It was taken in the swap area 11.

[0005]

By the way, conventionally, the stack area 11a has been prepared in anticipation of the maximum number of threads in the swap area 11. For this reason, a stack area that is rarely used is secured in the swap area 11, and the swap area 11 is squeezed, resulting in a problem that the usage efficiency is low.

As a material disclosing the technique related to the above-mentioned conventional technique, there is, for example, Japanese Patent Application Laid-Open No. 3-125223.

An object of the present invention is to eliminate the above-mentioned problems of the prior art and to provide a stack arrangement method in which a swap area is not squeezed by a program area including the stack in a multithread environment. .

[0008]

In order to achieve the above object, the invention according to claim 1 is to generate threads in an arrangement method of a stack of an information processing apparatus in which a plurality of threads operate by sharing a storage space. The feature is that the accompanying stack area is secured in a file area different from the swap area.

A second aspect of the invention is characterized in that the stack is deleted from the file area when the thread disappears.

[0010]

According to the first aspect of the invention, the stack area of each thread is secured in a file area different from the swap area, so that the swap area is not pressed by the thread stack.

According to the second aspect of the invention, the stack can be freely deleted from the file area, so that the file area can be used efficiently.

[0012]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below with reference to the drawings. FIG. 1 shows a conceptual diagram of an embodiment of the present invention.

In the figure, 10 is a program that realizes the multithread environment shown in FIG. 4, and is composed of text, data, a heap, and a plurality of thread stacks. Further, 11 is a swap area and 12 is a file area. These areas are formed in the disk,
For example, it is divided by the OS.

In the present embodiment, the text, data and heap programs are allocated to the swap area 11, and the thread stack is allocated to the file area 12.

Thread creation and death typically occurs dynamically, and the text includes programs that create and destroy thread stacks.

A program for creating a thread stack will be described with reference to the flowchart of FIG.

In step S1, the operation of obtaining the file name for the stack is performed, and in step S2, the file is opened and the operation of mapping in the address space is performed. Next, in step S3, the stack pointer of the thread is allocated to the highest address of the mapped address area.

By the above processing, the file area 12
On top, you can create a thread stack.

Next, a program for eliminating the thread stack will be described with reference to the flowchart of FIG.

First, in step S4, the operation of removing the map of the thread stack is performed. Next, in step S5, an operation of deleting the file for thread stack is performed.

By the above processing, the file area 12
You can kill the thread stack from.

As described above, according to this embodiment, the file is opened and the thread stack is mapped in this area. Therefore, the area for the thread stack is prepared in anticipation of the maximum number of threads. However, the swap area will not be squeezed.

[0023]

As is apparent from the above description, according to the present invention, the stack area of each thread is secured in a file area different from the swap area, so that the swap area can be used efficiently. There is an effect that can be.

Further, since the thread stack area is secured in the file area, there is an effect that changes in the maximum length and size of the stack can be easily observed.

[Brief description of drawings]

FIG. 1 is an explanatory diagram of an embodiment of the present invention.

FIG. 2 is a flowchart illustrating a thread stack generation process.

FIG. 3 is a flowchart illustrating a thread stack extinction process.

FIG. 4 is an explanatory diagram showing a relationship between a conventional thread stack area and a swap area.

[Explanation of symbols]

10 ... Multithread environment, 11 ... Swap area, 12
… File area

Claims (2)

[Claims] 1. In a stack arranging method of an information processing device in which a plurality of threads share a storage space and operate, a stack area associated with thread generation is secured in a file area different from a swap area. Arrangement method of stack of information processing device characterized by. 2. The stack arrangement method for an information processing apparatus according to claim 1, wherein the stack is deleted from the file area when the thread disappears.