JPS60134351A - System for registration of queue and detection of malfunction - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention] [Field of application of the invention] The present invention relates to a queue registration and malfunction detection scheme.

[Background of the invention]

In a data processing device, when managing shared resources, a queue is created to resolve conflicting operations.

Conventionally, malfunctions related to queues have been detected by limiting the memory area where queues are created and detecting attempts to create queues beyond that range. However, cases of double registration in queues and destruction have occurred, and countermeasures are required.

[Purpose of the invention]

An object of the present invention is to provide a system for comprehensively registering queues and detecting malfunctions.

[Summary of the invention]

The present invention performs registration and malfunction detection by comparing an address generated for registration in a queue with sequentially generated values and detecting whether the content of the address is an end mark based on this value.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to FIGS. 1 to 3. In this embodiment, a method for detecting double registration in a queue within a control program in a processing device using a microcomputer is taken as an example.

FIG. 1 shows the relationship between the microprocessor 1 and the control program. The microprocessor 1 and the memory 5 are connected via a memory control circuit 4, a data bus 2, and an address bus 3. The microprocessor 1 executes processing according to the control program loaded into the memory 5. The control program creates and destroys one queue in the table area for each shared resource in the processing unit. The structure of this queue is shown in FIG. FIG. 2 shows a situation where two different tasks are registered in the queue.

ADRl indicating the start address of the first parameter block 12 is written into the head pointer 11 of the queue at address O (ADRO). ADR2 indicating the start address of the next parameter block 13 is written at the beginning of the parameter block 12 defined by a specific number of bytes from ADRl. Parameter block 1
2, an end mark indicating that the queue is at the end is written at the beginning of the parameter block 13 defined by a specific number of bytes from ADR2.

FIG. 3 shows the flow of registering a queue. For simplicity, the input/output algorithm for the queue is PIFO (First I
n First: Ou7) method, and a parameter block defined by a specific number of bytes from a newly generated address ADRj is registered in the queue.

In FIG. 3, first, ADRj is generated to register a queue (step 10). Set i to O and step 11
), it is determined whether i=j (step 12). in this case,
Determine whether it is ADRO. If they are not equal, it is determined whether the content of A D Ri is an end mark (step 13); if it is an end mark, the process proceeds to step 18, where ADRj is written in place of the end mark in A D Ri, and ADRj
An end mark is written in (step 19), and registration in the queue is completed. In step 13, 8r) ding<i
If the content of is not an end mark, proceed to step 14,
The contents of ADRi are set to ADR(i+1), and i is incremented by 1 in step 15. If l is not the predetermined number N, the process returns to step 12 and performs i-j again (in this case, i is l). This is repeated, and if an end mark is found, it is registered in the queue, and if it is determined that i=j in step 12 before the end mark is found, step 17
Detects double registration in the queue and detects that an already registered address has been generated. If i=N in step 16, it means that a predetermined number (area) has been exceeded before the end mark is found, and it is detected in step 2O that the queue has been destroyed.

Queue registration and malfunction can be detected by comparing the address generated in this way with values that are generated sequentially and by detecting whether the content of the address based on this value is an end mark.

〔Effect of the invention〕

According to the present invention, it is possible to comprehensively detect malfunctions in queue registration.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of a microcomputer system for explaining an embodiment of the present invention, FIG. 2 is a diagram showing the structure of a queue created by the control program in FIG. 1, and FIG. FIG. 3 is a diagram showing a flow when registering a queue. 11... Queue head pointer, 12.13... Parameter block. Figure 2

Claims (1)

[Claims] (1) In a system that manages competitive resources using a queue, an address generated for registration in the queue is compared with sequentially generated values, and it is detected whether the content of the address based on the value is an end mark. A queue registration and malfunction detection method characterized by detecting queue registration and malfunction.