JPS6364152A - Message queue control system - Google Patents

Abstract

PURPOSE:To facilitate the adding of a temporary message queue and the erasure of a message queue by providing a memory area to show the chain relation, etc., with the message queue and the temporary message queue, and an adding processing part and a deleting processing part and executing the processing. CONSTITUTION:At a first memory area 1, a message queue and a temporary message queue added to the queue are stored, and at a second memory area 2, 1st-6th storing parts 21-26 are provided. At storing part 21-24 out of these accommodating parts, the number of messages of respective queues, the address of the head message of the message queue and the address of the next message are stored. Into storing parts 25 and 26, the address of the head message of the temporary message queue and the address of a reserved area to store the next message of the end message are stored. Thus, a memory area to show the chain relation, etc., of respective queues is provided, processing is executed through an adding processing part 3 and a deleting processing part 4, and the adding of the temporary message queue or the erasure of the message queue which is not related to the number of messages can be executed.

Description

[Detailed Description of the Invention] [Industrial Field of Application] The present invention relates to a message queue management system, particularly to a system that performs input/output using a message queue, in which message addition processing and message deletion processing are performed. Message queue management system.

[Conventional technology]

Conventionally, when adding a temporary message to a message queue, the address of the first message of the temporary message queue stored in the storage area, the address of the last message of the temporary message queue, and the address of the first message of the temporary message queue are stored in the storage area. It remembers the address of the message and the address of the message at the end of the message queue. Further, there is no chain attached to indicate that the message following the message at the end of the message queue is the message at the head of the temporary message queue.

Therefore, when adding a temporary message queue to the 1-message queue, in order to add a chain that indicates that the message following the message at the end of the message queue is the message at the head of the temporary message queue, A method is used in which the address of the message at the head of the temporary message queue is stored in the message at the end of the message queue.

[Problem that the invention seeks to solve]

Therefore, to add a temporary message queue to the message queue, input/output processing is required to read and write the message at the end of the message queue.
Also, when adding a temporary message queue when the number of messages in the message queue is 0, the address of the first message in the temporary message queue is changed to the address of the first message in the message queue, Furthermore, there is a gap point where it is necessary to change the address of the message at the end of the temporary message queue to the address of the message at the end of the message queue.

Furthermore, when deleting a message queue and adding a temporary message queue asynchronously when the number of messages in the message queue is 1, the address of the message at the head of the temporary message queue is set to the address of the message at the head of the message queue. There is a problem in that it is necessary to perform additional processing to change the address of the next message, and deletion and addition cannot be performed by independent processing.

An object of the present invention is to eliminate the above-mentioned problems, and to easily add and delete queues by providing a storage area that indicates chain relationships between message queues and temporary message queues, etc. It is an object of the present invention to provide a message queue management scheme.

Means for Solving Problems] The present invention provides a first storage area for storing a message queue and a temporary message queue to be added to the message queue; , a first storage section for storing the number of messages in the message queue, a second storage section for storing the number of messages in the temporary message queue, and the first storage section for storing the first message in the message queue. a third storage section for storing the address of the area; a fourth storage section for storing the address of the first storage area storing the message next to the first message of the message queue; and a fourth storage section for storing the address of the first storage area; A fifth storage section stores the address of the first storage area that stores the first message, and stores an address of a reserved area of the first storage area that stores the next message after the last message in the temporary message queue. a second storage area having a sixth storage area that stores the address stored in the sixth storage area in the fifth storage area according to an instruction to add the temporary message queue; A first process includes adding the number of messages stored in the second storage section to the number of messages stored in the storage section and storing them again in the first storage section to make the number of messages in the second storage section 0. additional processing means that performs processing independently of storage area processing; and an additional processing means that stores the address stored in the fourth storage section in the third storage section in response to an instruction to delete the message queue, and stores the address stored in the fourth storage section in the first storage section. The message processing apparatus is configured to include a deletion processing means that performs a process of subtracting 1 from the number of messages and storing the same in the first storage section again, independently of the processing of the first storage area.

〔Example〕

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention. In this embodiment, a first storage area 1 on a storage device for storing messages in a message queue and a temporary message queue to be added to this message queue, and the number of messages in the message queue (hereinafter referred to as "main message queue") are used. a first storage unit 21 that stores the number of messages (hereinafter referred to as the “number of temporary messages”); a second storage unit 22 that stores the number of messages in the temporary message queue (hereinafter referred to as the “number of temporary messages”); a third storage section 23 that stores the address of the first message in the message queue (hereinafter referred to as the "first message address"); A fourth storage unit 24 stores the address of the message at the top of the temporary message queue (hereinafter referred to as the "first next message address") in the first storage area 1; a fifth storage unit 25 that stores a reserved message address (hereinafter referred to as a "temporary message address"), and a reserved area address (hereinafter referred to as "reserved message The second storage area 2 on the storage device has a sixth storage section 26 for storing the address (referred to as "address"), and furthermore, upon receiving an instruction to add the temporary message queue, the fifth storage section 25 stores the above-mentioned address. The address stored in the sixth storage section 26 is stored, and the number of main messages stored in the first storage section 21 is added to the second address.
The temporary message number stored in the storage section 22 is added to the first storage section 21, and the temporary message is stored in the second storage section 22.
an additional processing unit 3 that performs processing to set the number of messages to 0 to 0 independently of the processing in the first storage area 1; The process of storing the address stored in the fourth storage section 24, subtracting 1 from the number of messages in the first storage section 21, and storing it in the first storage section 21 again is performed in the first storage area 1. It is comprised of a deletion processing section 4 that performs processing independently.

FIG. 2(A) is a flowchart of processing in the addition processing unit 3 of FIG. 1, and FIG. 2(b) is a flowchart of the processing in the deletion processing unit 4 of FIG.
70-chart of processing in .

Next, the additional processing shown in FIG. 1 will be explained with reference to FIG. 2(a). First, the stored contents are read from the second storage area 2 (step 2). The number of real messages read out in the first storage section 21 is 1, the number of provisional messages in the second storage section 22 is 4, the first message address of the third storage section 23 is 2, and the fifth storage section 25 Assume that the first temporary message address of 4 and the reserved message address of the sixth storage section 26 are 15. FIG. 3(a) shows the storage status of messages A, B, E and reservation message F in the first storage area 1 in this case, and FIG. 3(b) shows the storage contents of the second storage area 2. No. 311R(e) shows the chain state of messages A, B to F. Next, the reserved message address 15 is stored in the fifth storage section 25 (step (2)), and then the number 5, which is the number of real messages (1) plus the temporary message number (4), is stored in the first storage section 21 (step (2)). . Next, the temporary message number 0 is stored in the second storage unit 22 (step 2). FIG. 4(a) shows the first storage area 1 after this process.
Figure 4 (Cb) shows the memory contents of the second storage area 2, and Figure 4 (C) shows the storage status of messages A, B-F (same as in Figure 3 (a)). The chain state of B-F is shown.

Next, referring to FIG. 2(b), the deletion process shown in FIG. 1 will be explained. First, the stored contents are read from the second storage area 2 (step 2). The number of main messages read out in the first storage section 21 is 1, the first message address of the third storage section 23 is 2, the next message address after the beginning of the fourth storage section 24 is 4, and the fifth message address is 2. Assume that the first temporary message address in the storage section 25 is 15. In other words, Figure 2 (
This is a state in which the additional processing shown in FIG. 1 with reference to Jl) has been performed.

Next, the first message address 4 is stored in the third storage section 23.
Then, 4, which is the result of subtracting 1 from 5 of the actual message number, is stored in the first storage section 21 (Step 2). FIG. 5(a) shows the first record 43! after this process. ,
The memory status of messages B, C, and F in area 1 is shown in Figure 5 (
b) #-i The storage contents of the second storage area 2 are shown in FIG.
) indicates the chain status of messages B, C, and F.

In the manner described above, it is possible to add to a temporary message queue or delete a message queue regardless of the number of messages.

〔Effect of the invention〕

As explained in detail above, according to the present invention, firstly, a chain is attached indicating that the message following the message at the end of the message queue is the message at the head of the temporary message queue. When adding to a message queue, input/output processing for reading and writing messages at the end of the message queue becomes unnecessary. Second, regardless of the number of messages in the message queue, when adding a temporary message queue, the address of the first message in the temporary message queue t - the address of the next message after the last message in the temporary message queue All you have to do is change it to 0 and the number of messages will be 0.
The same process can be performed in the case of Third, when deleting a message queue and adding a temporary message queue asynchronously when the number of messages in the message queue is 1, the next message after the first message (which is also the last message) in the message queue Since the message is chained to indicate that it is the first message in the temporary message queue, it has the effect that deletion and addition can be performed as independent processes.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an embodiment of the present invention, FIGS. 2(a) and 2(b) are flowcharts showing the operation of FIG. 1, FIG. Figure 5(a) is a storage status diagram of messages in the first storage area in Figure 1, and Figures 3(b), 4(b), and 5(b) are in the second storage area. The memory content diagrams, FIG. 3(e), FIG. 4(C), and FIG. 5(C) are message chain state diagrams. 1...First storage area, 2... . . . second storage area, 3 . . . additional processing unit, 4 . . .
Removal processing part, A, B~'f

Claims (1)

[Claims] a first storage area for storing messages in a message queue and a temporary message queue to be added to the message queue; a first storage area for storing messages in the message queue; and a first storage area for storing messages in the temporary message queue; a second storage section that stores the number of messages; a third storage section that stores the address of the first storage area that stores the message at the head of the message queue; and a third storage section that stores the address of the first storage area that stores the message at the head of the message queue; a fourth storage section that stores the address of the first storage area that stores the message; a fifth storage section that stores the address of the first storage area that stores the first message of the temporary message queue; a second storage area having a sixth storage section that stores an address of a reserved area of the first storage area that stores a message following the last message in the temporary message queue; and an instruction to add to the temporary message queue. The address stored in the sixth storage section is stored in the fifth storage section, and the number of messages stored in the second storage section is added to the number of messages stored in the first storage section. The process of storing messages in the first storage unit and setting the number of messages in the second storage unit to 0 is performed in the first storage unit.
additional processing means that performs processing independently of the processing of the storage area; and storing the address stored in the fourth storage section in the third storage section according to an instruction to delete the message queue; 1. A message queue management method, comprising: a deletion processing means that performs a process of subtracting 1 from the number of messages and storing the same in the first storage section again, independently of the processing of the first storage area.