JPS63298637A - Buffering queue managing system - Google Patents

Abstract

PURPOSE:To attain a high speed processing without causing the inconvenience to the condition of a cue by providing a means to store the event information to be occurred by an interrupting means to the queue and remove the event information equivalent to the retrieving conditions from the queue. CONSTITUTION:At first, a queue clock is switched from an unused queue 26b to a buffer queue 26c by an interrupting routine 24. Next, the queue block is switched from the buffer queue 26c to a used queue 26a by an event processing routine 23. Further, the unnecessary queue block is switched to the unused queue 26b by the event processing routine 23. Thus, by setting a block 4 to the buffer queue 26c and the queue 26b, the event processing routine 23 is operated, novel event information occurs, the interrupting routine 24 is activated, the storing processing of the event information is executed, and even then, the inconvenience on the queue block does not occur.

Description

[Detailed Description of the Invention] [Summary] Event information generated by an interrupt means is stored in a queue, and at the time of processing the stored event information, a means is provided for retrieving event information corresponding to a search condition from the queue. For example, in a graphic data processing system, the buffer queue is provided in the queue, and the interrupt means includes:
Tracing the chain of unused queues, for example, storing new event information in the second queue block after the first fixed queue block, extracting it from the unused queue, connecting it to the buffer queue, and storing the event information. The processing means are
By extracting a queue block that meets the above search conditions and chaining the queue block that is no longer used after various processes as the head queue block of the unused queues, the interrupt means and the event information processing means The range of queues to be operated is divided and managed using the first fixed queue block of the unused queues.

[Industrial application field]

The present invention provides a queue in a data processing system that stores event information generated by an interrupt means in a queue, and retrieves event information corresponding to a search condition from the queue at the time of processing the stored event information. The present invention relates to a management system, and particularly relates to a buffering queue management system in which the queue is provided with a buffer.

With the recent improvement in the performance of computer systems, it has become common for these computer systems to process graphics, and the amount of processing is also on the rise, creating a demand for improved processing capacity.

In such a graphical data processing system, event data (such as one coordinate character) for graphical processing is queued in a queue mechanism by an interrupt means, and when the queued event data is needed, an event is released from the queue. The event data is extracted, subjected to necessary processing, and deleted when it is no longer needed.

In this type of queue management method, the queue is operated by two means (for example, a program): a high-priority interrupt means and an event information processing means, so interrupts are not controlled during event information processing. When the queue passes, the state of the queue may not be guaranteed, and normally a lock instruction is issued to the queue for exclusive control, but with this method, interrupt processing that requires high speed is forced to wait. Therefore, improvement in the above-mentioned processing capacity cannot be expected.

Due to these circumstances, without compromising high speed.

There is now a need for a queue management system that can guarantee the status of queues.

[Prior art and problems to be solved by the invention] FIG. 3 is a diagram illustrating a conventional queue management system.
) is a diagram showing an example of the configuration of a system that performs queue management, and (bl) and (b2) are diagrams explaining the process of queue management.

The data processing system shown in (a) stores event information generated by the interrupt routine 24 in a queue 26, and at the time of processing the stored event information, event information corresponding to a search condition is sent to the queue 26. This is an example of a graphical data processing system, for example, comprising means 23 for retrieving from 26.

In this system, event information generated by the interrupt routine 24 is temporarily connected to a queue 26 by the interrupt routine 24 and stored therein.

Thereafter, when event information becomes necessary in response to a request from the application (APL) 25, the corresponding event information is retrieved and processed by the event information processing routine 23 activated by the operating system (O3).

To explain the above operation using (a) in this figure, first, when the operator operates the input device 4 such as a tablet or keyboard and inputs event data (coordinate value, 2 characters, etc.) for graphic processing, the central processing An interrupt is applied to the device (CPU) 1. The operating system (O5) 21 executed by the central processing unit (CPU) 1 determines the content of the interrupt and sends it via the input/output supervisor (IO3) 22. , passes control to interrupt routine 24.

The interrupt routine 24 is executed by the input/output supervisor (
10S) The receiver connects the received event information from 22 to the queue 26.

Thereafter, when event information becomes necessary in response to a request from the application (APL) 25, the event information processing routine 23 is activated by the operating system (O3) 21, searches the queue 26, retrieves the corresponding event information, Various processes are performed for the event.

In the above interrupt routine 24, the operation process when event information that occurs asynchronously is stored in a queue block and the corresponding queue block is connected to the usage queue 26a is described below.
) Explained with a diagram.

(1) First, the event information generated by the above interrupt is stored in the first queue block (2) of the unused queue 26b of the event management table 260 that the queue 26 has.

(2) Change the address of the unused queue ↑ in the event management table 260 to the address of the queue block ■ pointed to by NEXT 9 of the queue block ■.

(3) Tracing the chain of used cue blocks, searching for the last cue block, and changing the address of the NEWT officer in the corresponding cue block (■) to the address of the cue block (2).

Event information that occurs asynchronously due to an interrupt is sequentially connected to the usage queue 26a by following the above procedure.

Next, in the event information processing routine 23', the event information requested by the application (APL) 25 is extracted from the used queue 26a, various processes are performed, and the queue blocks that are no longer used are connected to the unused queue 26b. The operation process will be explained with reference to this figure (b2).

(1) First, the chain of used queue blocks 26a is traced to search for a queue block (2) that corresponds to the search condition requested by the application (APL) 25.

(2) NEXT of the cue block ■ located one place before the corresponding cue block ■? The address of the queue block ■ is changed to the address of the cue block ■ pointed to by NEXT↑ of the cue block ■.

(3) Perform various processes on the corresponding queue block (■).

(4) After the various processes are completed, the event information is deleted from the queue block (2) which is no longer used.

(5) Follow the chain of unused queues 26b, search for the last queue block, and select NEW? of the corresponding queue block ■? Change the address to the address of the queue block ■ above.

Based on the above procedure, event information is removed from the used queue 26a and connected to the unused queue 26b.

In the conventional queue management method described above, the used queue 2
6a, the unused queue 26b is operated by two programs, the interrupt routine 24 and the event information processing routine 230, but since the interrupt routine 24 has a higher execution priority than the event information processing routine 23, it cannot process the event information. Even if the routine 23 is running, each time new event information occurs, the operating system (OS) 2
1, the event information processing routine 2
3 is temporarily interrupted and control is passed to the interrupt routine 24.

Under such an environment, the queue states of the used queue 26a and unused queue 26b are not guaranteed.

An example of this will be explained below.

1) Example of a case where a queue block chained to an unused queue 26b is not guaranteed: In FIG. 3 (b2), (1) For example, the queue block ■ is searched by the event information processing routine 23 and various processes If the cube block is no longer needed after being
is about to be chained to the last queue block ■ of the unused queue 26b.

(Indicated by a dashed line a) (2) When control is passed to the interrupt routine 24 immediately before this, the new event information is stored in the queue block (■) at the head of the unused queue 26b and used. It is pointed to from the last queue block ■ of the queue 26a (already indicated by the dashed line), and the unused queue 26
b, and the processing of the interrupt routine 24 ends.

(3) When the processing of the interrupt routine 24 is completed and control is returned to the event information processing routine 23, the event information processing routine 23 continues the above processing by changing the address of NEXT↑ of the queue block ■ to the address of the queue block ■. Change to Cube Block ■NEXT? clear the address.

As a result, the queue block ■ that stored the new event information in (2) is chained with the queue block ■, and is separated from the used queue 26a and the unused queue 26b, causing an inconvenience in the queue state. .

2) Next, an example where the queue block chained to the usage queue 26a is not guaranteed: In FIG. 3 (b2), (1) First, based on a request from the application (APL) 25, the event information processing routine 23 follows the chain of the used queue 26a and searches for the queue block (2) that meets the search condition.

(2) NEXT of the cue block ■ located one place before the corresponding cue block ■? NEχT? Change to the address of the queue block ■ pointed to. (Indicated by two-dot chain line C) (3) Perform various processing on the corresponding cube block ■,
Event information is deleted from the queue block (■) that is no longer used.

(4) Follow the chain of unused queues 26b, search for the last queue block, and select the NEXT ? of the corresponding queue block ■. is changed to the address of the queue block (2) (indicated by a two-dot chain line d), but it is assumed that control is passed to the interrupt routine 24 immediately before the address is changed.

(5) The interrupt routine 24 stores the event information that has occurred in the first queue block (2) of the unused queue 26b.

(6) Follow the chain of the used queue 26a, search for the last cue block, and change the address of NEXT↑ of the cue block ■, which wins 8 times, to the address of the cue block ■. (Indicated by a two-dot chain line e) (7) The processing of the interrupt routine 24 is completed, and the event information processing routine 23
When the control returns to , the event information processing routine 23 continues the process by changing the address of NEXT↑ of the queue block ■ to the address of the queue block ■.

As a result of the above processing, the queue block ■, which should be connected to the unused queue 26b, becomes a block connected to the used queue 26a (specifically, it becomes ■) ■ Mourning ■ Mourning ■ Rumor ■ (empty)), An inconvenient state of the queue occurs.

For this reason, conventionally, a lock instruction is issued to the queue 26 and the interrupt routine 24 is executed.

Exclusive control was performed with the event information processing routine 23.

However, since the interrupt routine connects event information that occurs asynchronously to the queue 26, high-speed processing is required. However, if the above exclusive control method is adopted, the interrupt routine 24 is connected to the event information processing routine 23. There is a problem in that the processing speed is not high because the processing is sometimes made to wait until the processing is completed.

In view of the above-mentioned drawbacks of the conventional art, the present invention stores event information generated by an interrupt means in a queue, and at the time of processing the stored event information, takes out event information corresponding to a search condition from the queue. It is an object of the present invention to provide a queue management method that does not cause problems with the status of queues and satisfies high-speed processing in, for example, a graphic data processing system equipped with the present invention.

(Means for Solving the Problems) FIG. 1 is a diagram schematically showing a configuration example of a buffering queue management system of the present invention.

In the present invention, event information generated by the interrupt means 24 is sent to the queue 2.
6, and at the time of processing the stored event information, the data processing system includes an event information processing means 23 that retrieves event information corresponding to the search target from the queue 26. Usage queue 26b
In addition, a buffer queue 26c and a fixed queue block (2) are provided at a specific position of the unused queue 26c, and when event information generated by the interrupt means 24 is queued in the queue 26, After tracing the chain of the unused queue 26b and storing the event information in the queue block after the fixed queue block,
When event information becomes necessary and is taken out from the used queue 26a, the event information processing means 23 connects the unused queue 26b to the buffer queue 26c. After tracing the chain, searching for a cube block that meets the search conditions, taking it out of the used queue 26a, and performing various processes to erase the contents of the unused queue, the fixed cube in the unused queue 26b is removed. A second means of chaining and queuing before the lock (2) and queuing the queue block chained to the buffer queue 26c to the use queue 26a, the queue used by the interrupt means 24 is , the queue 26 is managed independently from the queue used by the event information processing means 23.

[Effect]

That is, according to the present invention, event information generated by the interrupting means is stored in a queue, and at the time of processing the stored event information, means is provided for retrieving event information corresponding to the search condition from the queue. For example, in a graphical data processing system, a buffer is provided in the queue, and the interrupting means follows a chain of unused queues and, for example, inserts a new event into a second queue block after a first fixed queue block. The event information processing means stores the information, takes it out from the unused queue, connects it to the buffer queue, extracts the queue block that corresponds to the search condition, and performs various processes to retrieve the queue block that is no longer used. By chaining as the first queue block of the above unused queue, the interrupt means and
The range of queues to be manipulated by the event information processing means is managed by dividing it into the first fixed queue block of the unused queues, so that the interrupt routine and the event information processing routine can It is no longer necessary to perform exclusive control between the interrupt routines, and the processing of event information generated asynchronously from the input device can be queued with the highest priority without having to wait for the event information processing routine, reducing the processing time of the interrupt routine. It has the effect of being able to shorten the time.

〔Example〕

Embodiments of the present invention will be described in detail below with reference to the drawings.

The above-mentioned FIG. 1 is a diagram schematically showing an example of the configuration of the buffering queuing management system of the present invention, where (a) shows an example of the basic configuration, and (b) shows how queue blocks are connected to buffer queues. 2 is a diagram explaining the process, (c) is a diagram explaining the process of connecting a queue block to a used queue, and (d) is a diagram explaining the process of connecting a queue block to an unused queue; FIG. 1 is a diagram explaining the contention operation according to the buffering queue management method of the present invention, and explains the operation when an interrupt process occurs in the process of (d) in FIG. 1. 2
6c and the first queue block ■ of the unused queue are fixed queue blocks, and newly generated event information is stored in the second queue block next to the fixed queue block ■ and chained to the buffer queue 26c. A means for doing this and a means for chaining an unused queue block before the fixed queue block (2) provided in the unused queue are necessary means for carrying out the present invention.

Note that the same reference numerals refer to the same objects throughout the plan.

The buffering queue management system of the present invention will be explained below with reference to FIG. 1 and FIG. 3(a).

In the queue 26 of the present invention, as shown in FIG. 1(a), the conventional used queue 26a, unused queue 26b
A buffer queue 26c is added to the buffer queue 26c, and a fixed queue block (2) is set in the unused queue 26b. The transition of the queue blocks in the queue 26 is shown in (b) ~
(e) This will be explained below using the figure.

1) Process of reconnecting the queue block from the unused queue 26b to the buffer queue 260 in the interrupt routine 24: (See FIG. 1(b)) (1) Unused queue 2
6b is followed, and all event information that has occurred is stored in the queue block (2) next to the first queue block (2), which is a fixed queue block.

(2) NEXT of the first queue block ■ of the unused queue 26b? NEXT ? of the above queue block ■ that stores the event information. Change to the address of the queue block ■ pointed to.

(3) Follow the chain of buffer queue 26c, search for the last queue block, and find the corresponding queue block■
Enter the address of NEXT ii in the above queue block■
Change the address to .

During these processes, the event information generated from the input device 4 is stored in the queue block ■, and the buffer queue 26 of the present invention is stored.
Queue to c.

When the present invention is implemented, as described above, the queues that can be operated by the interrupt routine 24 are the buffer queue 2 described above.
6c and the next queue block ■ after the fixed queue block ■ in the unused queue 26b.

2) Next, in the event information processing routine, the process of connecting the queue block from the buffer queue to the usage queue: (see FIG. 1(c)) (1) Tracing the chain of usage queue 26a, and reconnecting the queue block from the buffer queue to the usage queue. The address of NEXT↑ is changed to the address of queue block ■ pointed to by the buffer queue 26c.

(2) Change the address ↑ of the buffer queue 26c to "0".

Through these processes, the queue blocks stored in the buffer queue 26c can be queued in the use queue 26a.

3) In the event information processing routine, the process of connecting a queue block that is no longer used in the used queue to an unused queue: (See Figure 1 (d)) (1) Follow the chain of the used queue 26a and match the search condition. Cube block
Search for.

(2) Change the address of the NEXT ? of the cue block ■ to be placed upright one position before the corresponding cue block ■ to the address of the cue block ■ pointed to by the NEXT ? of the cue block ■.

(3) Perform various processes on the corresponding queue block (■).

(4) After the various processes are completed, event information is deleted from the queue block (2) which is no longer needed.

(5) NEXT of the corresponding cube block ■? address of unused queue 26b? Change it to the address of the fixed queue block (2) of the present invention that is pointed to.

(6) Unused queue 26b? Change the address to the address of the cube block ■.

Therefore, the queue blocks operated by the event information processing routine 23 are limited to the used queue 26a and the unused queue 26b, and in the unused queue 26b, the above-mentioned interrupt The queue block operated by the routine (fixed queue block)
It becomes independent from the next cube block (■) and does not interfere with each other.

The queue blocks are reconnected by the operations described in 1) to 3) above.

As described above, in the present invention, when queuing new event information to the used queue 26a and taking out unused queue blocks from the used queue 26a, the buffer queue 26c is provided, and fixed cubes are placed in the unused queue 26b. By setting the lock ■, it is used in the interrupt routine 24 and the event information processing routine 23 (
Since the queue blocks (operated) are configured to be independent from each other, new event information is generated while the event information processing routine 23 is operating, the interrupt routine 24 is activated, and the storage process of the event information is performed. However, no problem occurs on the queue block.

Further, in queuing an unused queue block to the unused queue 26c and taking out a queue block storing new event information from the unused queue 26b, the interrupt routine 24 uses the unused queue 26c as described above.
Following the chain b, find the queue block located next to the fixed queue block (in this example, the first queue block ■) (in this example, the second cube block ■)
is taken out from the unused queue 26b, and the event information processing routine 23 functions to queue the unused queue block as the first queue block in front of the fixed queue block (2) of the unused queue 26b. Therefore, chain destruction does not occur.

The above operation will be explained as follows in terms of the operation in the graphic data processing system shown in FIG. 3(a).

In this system, event information generated by the interrupt routine 24 is temporarily connected to a queue 26 by the interrupt routine 24 and stored therein.

Thereafter, when event information is needed, the event information processing routine retrieves and processes the relevant event information.

In FIG. 3(a), the operator is using a tablet.

When an input device 4 such as a keyboard is operated to input event data (coordinate values, 9 characters, etc.) for graphic processing, the central processing unit (CPU) 1 is interrupted.
The operating system (O5) 21 being executed by the CPU (CPU) 1 determines the content of the interrupt and passes control to the interrupt routine 24 via the input/output supervisor (IO3) 22.

In the case of the present invention, the interrupt routine 24 is as shown in FIG.
) As shown in the figure, the above input/output supervisor (IO5
) The receiver stores the new event information taken from 22 into the second queue block ■ of the unused queue 26b, and connects the corresponding queue block ■ to the last queue block ■ of the buffer queue 26c of the present invention.

After that, in FIG. 1(C), the application (A
When event information becomes necessary in response to a request from PL) 27, the event information processing routine 23 is started by the operating system (OS) 21, and the queue blocks accumulated in the buffer queue 26c are transferred to the usage queue 26a. Finally, when the queue block corresponding to the above event information, for example, the queue block ■, becomes unnecessary as a result of various processing, the queue block ■ is processed according to the procedure shown in FIG. 1(d). , are connected to the head of the unused queue 26b.

FIGS. 2(a) and 2(b) show event information processing routine 2.
3 shows the operation when control is transferred to the interrupt routine 24 during processing, and when the processing of the interrupt routine 24 is completed and control is returned to the event information processing routine 23.

First, the example shown in <a) will be explained. In this example, the one-dot chain line a in FIG. 3 (b2) is a problem in the conventional method.

This corresponds to the process shown in b.

(1) The event information processing routine 23 performs various processing on the last queue block ■ of the used queue 26a, and when the processing is completed, the queue block ■ becomes unnecessary, and as described above, the unused queue The NEX of the cue block ■ is added to the reservoir connected as the first cue block of
The address of T↑ is the unused queue 26b? is changed to the address of the queue block ■ pointed to by the interrupt routine 24.
Suppose that control is passed to

(2) The interrupt routine 24 follows the chain of unused queues 26b to store newly generated event information in the second queue block ■ following the first queue block ■ set as a fixed block, The interrupt processing is then connected to the buffer queue 26c and the interrupt processing is completed.

(3) When the interrupt processing is completed and control is returned to the event information processing routine 23, the event information processing routine 23 continues the processing at the N of the queue block (3).
EXT? The address of the unused queue 26b? Change to the address of the cube block ■ pointed to,
Unused queue 26b? The address of the queue block (2) is changed to the address of the queue block (2).

(4) The event information processing routine 23 further reconnects the queue block ■ connected to the buffer queue 26c to the last queue block ■ of the use queue 26a.

Therefore, there is no problem with the queue status, which occurs in the conventional system.

Next, the example shown in FIG. 2(b) will be explained. In this example, the two-dot chain line c −
This corresponds to the process shown in e.

(1) The event information processing routine 23 follows the chain of the use queue 26a and searches for a queue block (2) that meets the search condition.

(2) 8. Change the address of NEXT 1i of the queue block ■ which is installed one place before the current queue block ■ to the address of the queue block ■ pointed to by the NEXT [ of the cube block ■.

(3) Various processes are performed on the corresponding cue block ■, and after the processing is completed, the cue block ■ becomes unnecessary.
, the event information is deleted and the corresponding queue block ■
NEXT? ↑ of the unused queue 26b
is changed to the address of the fixed queue block (2) pointed to by , but suppose that control is passed to the interrupt routine 24 immediately before the address is changed.

(4) The interrupt routine 24 follows the chain of unused queues 26b and stores the above-mentioned event information that has occurred in the queue block (2) next to the fixed queue block (2).

(5) The interrupt routine 24 uses the buffer queue 26c.
Follow the chain and XT the last cube block ↑
(In this example, since the queue block does not exist, the address of the buffer queue 26c is changed from the previous address of the buffer queue 26c) to the address of the queue block ■, connects it to the buffer queue 26c, and ends the interrupt processing. , passes control to the event information processing routine 23.

(6) As a continuation of the above processing, the event information processing routine 23 changes the NEXT↑ address of the queue block ■ to the address of the queue block ■, and changes the previous address of the unused queue 26b to the address of the queue block ■. By changing the address, the queue block (2) is connected to the unused queue 26b.

Therefore, even in this case, the problem of queue status that occurs in the conventional system does not occur.

In this way, the present invention stores event information generated by an interrupt routine in a queue, and when the stored event information is required based on a request from an application, an event information processing routine is activated. For example, in a graphical data processing system that searches and retrieves the queue, a buffer queue is provided in the queue mechanism, and a queue block at a specific position of the unused queue, for example, at the head position, is set as a fixed queue block. By setting the fixed queue block of the unused queue as a boundary and dividing the range of operations between the interrupt routine and the event information processing routine, problems with the queue state due to conflicts between the interrupt routine and the event information processing routine can be avoided. The present invention is characterized in that new event information is quickly queued in the buffer queue using an interrupt routine, thereby shortening the processing time of the interrupt processing.

〔Effect of the invention〕

As described above in detail, the buffering queue management method of the present invention stores event information generated by an interrupt means in a queue, and at the time of processing the stored event information, the buffering queue management method according to the present invention For example, in a graphical data processing system comprising means for retrieving event information from the queue, a buffer queue is provided for the queue, and the interrupt means follows a chain of unused queues;
For example, new event information is stored in the second queue block after the first fixed queue block, taken out from the unused queue, and connected to the buffer queue, and the event information processing means meets the search condition. A queue that is operated by an interrupt means and an event information processing means by extracting a corresponding queue block, performing various processing, and chaining the queue block that is no longer used as the head queue block of the unused queues. Since the range of the unused queue is managed by dividing it into the first fixed queue block of the unused queue, there is no need to perform exclusive control between the interrupt routine and the event information processing routine. Processing for event information asynchronously generated from a human-powered device can be queued with the highest priority without having to wait for the event information processing routine, and the processing time of the interrupt routine can be shortened.

[Brief explanation of drawings]

FIG. 1 is a diagram schematically showing a configuration example of the buffering queue management method of the present invention.FIG. 2 is a diagram illustrating competing operations by the buffering queue management method of the present invention. FIG. 3 is a diagram explaining a conventional queue management method. It is. In the drawing, l is the central processing unit (CPU), 2 is the main memory (M
S). 21 is an operating system (O5). 22 is an input/output supervisor (10S). 23 is an event information processing routine. 24 is an interrupt routine. 25 is an application (APL). 26 is a queue, and 26a is a used queue. 26b is an unused queue, and 26c is a buffer queue. 4 is an input device (tablet keyboard). ↑ is the address. ■～ is a cue block, ■ is a fixed cue block. are shown respectively. He N N to he to (C) thing, <IJ eye hepasonoariso 2 flat knee minami 1 tusk to skin 1; Q -, ) ~ N
~

Claims (1)

[Claims] Event information generated by the interrupt means (24) is stored in a queue (26), and at the time of processing the stored event information, event information corresponding to the search target is stored in the queue (26).
In a data processing system equipped with an event information processing means (23) for taking out event information from a buffer queue (26), in addition to a used queue (26a) and an unused queue (26b),
6c), and a fixed queue block ([4]) at a specific position of the unused queue (26c), and event information generated by the interrupt means (24) is transmitted to the queue ([4]).
26), the corresponding unused queue (26) is queued.
After tracing the chain of 6b) and storing the event information in the queue block after the fixed queue block,
a first means for taking out the unused queue (26b) and connecting it to the buffer queue (26c); 23) is the usage queue (26a
), search for a queue block that meets the search conditions, take it out of the used queue (26a), perform various processes to erase the contents of the queue that is no longer needed, and then move the queue block that meets the search conditions to the unused queue (26a). a second queue block which is chained and queued before the fixed queue block ([4]) of 26b), and which queues the queue block chained to the buffer queue (26c) to the usage queue (26a); by means of the interrupt means (
24) and the event information processing means (23).
) is used independently from the cue (26).
A buffering queue management method characterized by managing.