JPS63282818A - Timer control system by rb table classified by timer value - Google Patents

Abstract

PURPOSE:To suppress the load quantity by timer control processing even if the number of starting timers is increased by executing timer starting processing, time-out processing and timer cancel processing by using an RB table formed in each timer value and a time-out counter. CONSTITUTION:The titled system is provided with the RB table 11 to be formed in each timer and the time-out counter 12. The table 1 instructs timer starting, time-out and timer cancel and the time-out counter 12 is driven together with the table 11 and manages the timer start, timer time-out and timer canceling time. Even if the number of requests for the timer and the number of RBs are increased, an RB queue is not extended.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a timer control method, and particularly to a timer control method using an RB table by timer value and a timeout counter.

(Prior Art) Conventionally, processing using a timer control method has been executed as shown in FIGS. 5 and 6. In Figure 5, R
B? ! It is assumed that n is n and n timers are activated.

First, using the RB pointer of the timer control table as the base point,
The timer is started by queuing the requested timer's RB (request block).

Taking FIG. 5 as an example, if one new timer start request is added from the state shown in the figure, the timer request RB changes to R.
It will be queued next to Hn.

The timeout check will be explained with reference to the flowchart in FIG. 6. Every time there is an interrupt from the clock in units of timer intervals, all R
The work timer in B ([fl) counts down.At this time, if the timer value becomes 0, it is assumed that a timeout has occurred, and the 6-hit RBt-dequeue processing is performed, and all post processing is executed to complete the timeout. We will notify you.If a cancellation request occurs, we will notify you of the applicable cancellation request.
Dequeue processing from B queue and post processing,
Notify completion of cancellation.

(Problems to be Solved by the Invention) In the conventional timer control method described above, when n timers are activated, n RBs are connected by one queue. Moreover, each RB has a work area for counting the timer value, and each time an interrupt from the clock occurs, the B pointer of the timer control table is used as the base, and the work area is used for all RBs in the queue. The hawksbill inside counts down and performs a timeout check. If there is an RB corresponding to the timeout, the RB'iRB queue is subjected to p-dequeue processing and post processing is executed.

Therefore, as the number of timer requests increases and the number of RBs increases, the RB queue becomes longer, and the load on counting timer values in RBs and queuing processing becomes extremely large.

An object of the present invention is to eliminate the above drawbacks by executing processes such as timer activation, timer timeout, and timer cancellation using a timer-specific RB table and a timeout counter value in timer control, and the number of timer requests increases. An object of the present invention is to provide an entire timer control method using a timer value-specific RB table configured so that an RH queue does not become long even when the number of RBs increases.

(Means for Solving Problem 1) The timer control method using the timer value-specific kLB table of the present invention is configured to include a timer value-specific kLB table and a timeout counter.

The RB table by timer value is used to instruct timer activation, timer timeout, and timer cancellation.

The timeout counter operates together with the RB table for each timer, and is used to manage all the times of timer activation, timer timeout, and timer cancellation.

(Example) Next, the present invention will be explained with reference to the drawings.

FIG. 1 is an explanatory diagram showing an embodiment 1 of an RB table by timer value, a timeout counter, and a timer request hole B according to the present invention. In the first prisoner, 11 is a timer value specific B table, 12 is a timeout counter, and 13 is a timer request RB.

It is assumed that the size N of the RB table 11 for each timer ft1T is larger than the maximum timer value that can be multiplied by the timer request amount when the minimum unit is the timer interval in which a clock interrupt occurs. The timeout counter 12 is incremented by l each time a clock interrupt occurs, and when the n1 value becomes greater than or equal to N, it is cleared by subtracting N. From then on, the timeout counter 12 is incremented in the same way.
shall be

FIG. 2 is a flowchart showing the process in FIG. 1 when a timer activation request is made.

Referring to FIGS. 1 and 2, it is assumed that a timer activation request is made based on the timer value X when the timeout counter 12 reaches t(=m).

m + x (if N, then y = m + x (1),
If m+x≧N, then y=m+x−N (21) Relative y-th RB of RB table 11 by timer value
The pointer is queued to request hole B.

In FIG. 1, the case of m + x (N is shown).

Timer request hole B is queued in the 8B table 11 by timer value, and the timer request is completed.

FIG. 3 is a flowchart showing the processing flow fL of the timer timeout check at clock interrupt +7) in FIG.

Next, the timer timeout check will be explained with reference to FIGS. 1 and 3.

When a clock interrupt occurs, the timeout counter 12 is counted down.

As mentioned above, when tc≧N, tc==tc
-N. Here, check the relative 10th pointer of the RB chain for each timer value, and if it is N and not LL, the timer request RB is queued, so the I queued at that pointer. (B performs dequeue processing and post processing on the assumption that a timeout has occurred, and notifies the occurrence of a timeout. This is the timeout check processing that is performed every time a clock interrupt occurs.

FIG. 4 is a flowchart showing the processing amount when requesting timer cancellation in FIG. 1.

When a timer cancellation request occurs, the corresponding R
Dequeue processing is performed from the RB table for each By timer value, post processing is performed, and the completion of cancellation is fully notified.

(Effects of the Invention) As explained above, the present invention uses the RB table for each timer value and the timeout counter in timer control to perform timer activation processing, timer timeout processing, and timer cancellation processing F! By executing all the timer requests, the RB queue is distributed among multiple timers even if multiple timer requests occur, and only one pointer based on the timeout counter needs to be checked to check for timeout. This has the effect that even if the number of timers increases, the load due to timer control processing can be reduced.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of an embodiment of a timer control method using a 14B table for each timer 11 according to the present invention. The second cause is the flowchart shown in FIG. 1 for the timer activation@request processing. Figure 3 shows the timer timeout check at the time of the first cause of clock interrupt? FIG. FIG. 4 is a flowchart showing the processing when requesting timer cancellation in FIG. 1. FIG. 5 is an explanatory diagram showing the timer control table and timer request processing according to the prior art. FIG. 6 is a flowchart showing the timer timeout check at the time of clock interrupt in FIG. 11...By timer value) LB table 12...Timeout counter 13...Timer request) LB Patent applicant Nippon Takuki Co., Ltd. Agent Patent attorney Inoro Jusai 2 Figure 24 Figure 5

Claims (1)

[Claims] a timer value-specific RB table for instructing timer activation, timer timeout, and timer cancellation; and a timeout for managing the timer activation, timer timeout, and timer cancellation times by operating together with the timer-specific RB table. 1. A timer control method using an RB table for each timer value, characterized in that it is configured by comprising a counter.