CN104391732A

CN104391732A - Software multi-timer dynamic state management method

Info

Publication number: CN104391732A
Application number: CN201410668924.9A
Authority: CN
Inventors: 姜洪宇; 杜啸晓; 刘杰; 张孝华
Original assignee: No726 Research Institute Of China Shipbuilding Industry Corp
Current assignee: No726 Research Institute Of China Shipbuilding Industry Corp
Priority date: 2014-11-20
Filing date: 2014-11-20
Publication date: 2015-03-04
Anticipated expiration: 2034-11-20
Also published as: CN104391732B

Abstract

The invention provides a software multi-timer dynamic state management method. The software multi-timer dynamic state management method comprises the following steps of firstly, defining a data structure and storing timer marks and timer overtime processing methods; defining a queue, storing multi-timer information and placing the mark and the processing method of the timer into the queue when the timer is opened every time; deleting the mark and the processing method of the timer from the queue when the timer is closed every time; opening the timers and adding the timer information into the queue; extracting a node from the queue, judging whether the timer mark stored inside the node is identical to that of the current overtime timer or not and judging the timer which is corresponding to the node is overtime and processing through the corresponding processing method inside the node if yes; judging whether all nodes are extracted or not if not and ending the operation if yes; extracting nodes to judge again if not. The software multi-timer dynamic state management method has the advantages of reducing unnecessary inquiries of unopened timers when multiple timers are opened and closed, reducing CPU (Central Processing Unit) expenditure and improving the system operation speed.

Description

Software many timers dynamic management approach

Technical field

The present invention relates to computer realm, particularly, relate to a kind of software many timers dynamic management approach.

Background technology

Timer, from literal understanding, be exactly a clock, after setting timing, after the time that experienced by setting, the personnel that timer is set will be notified, time has arrived, and can carry out further work, in daily life, we often can touch timer, such as, in semi-automatic washing machine, just have timer, from laundry, turn timing knob, timer is just opened, and get back to 0 to timing knob, timer time arrives, laundry terminates, and can carry out next step and bleed off the work such as addle.Here the timer that say is when doing computer software programming, a kind of software timer used, and computer software logic also often there will be to be needed to set one or more time, starts to do further work after time is up.Such as automatic washing machine, there is a computer panel the inside, the computer software run in this computer panel just has our said timer, software meeting Lookup protocol timer, start first step work, timer time to after start second step work etc. arranging timer.

In embedded systems; when using Microsoft Visual C++ write software code to carry out communication overtime supervision to multiple communication node simultaneously; often timer can be used; the using method of general timer uses SetTimer (UINTnIDEvent; UINT nElapse; void (CALLBACK EXPORT*lpfnTimer) (HWND; UINT; UINT; DWORD)) function; the mark of the timer of first Parametric Representation setting, does the process of timer expiry in timer response function.Generally needing whether the timer first judging current time-out is wait for needing timer to be processed, if so, then processing, if not then not processing.

As shown in Figure 1, in Microsoft Visual C++, conventional timer scheme is, use SetTimer (UINTnIDEvent, UINT nElapse, void (CALLBACK EXPORT*lpfnTimer) (HWND, UINT, UINT, DWORD)) function setup timer, the mark of general appointment timer, in time response function OnTimer (UINTnIDEvent), judge that whether the timer of current time-out is the timer arranged, namely in OnTimer (UINT nIDEvent), whether nIDEvent equals SetTimer (UINT nIDEvent, UINT nElapse, nIDEvent in void (CALLBACK EXPORT*lpfnTimer).If the same process.If current timer needs to close, then call function KillTimer (int nIDEvent) timeing closing device is designated the timer of nIDEvent, so when timer is opened, the timer ID nIDEvent of unlatching must be recorded, use during timeing closing device below.The shortcoming of this way is: the timer that can establish can not be too many, otherwise, when the timer of a thread is too much, need to do a large amount of judgements in timer processing function, judge which timer expiry current be, the CPU overhead that this judgement brings is considerable in the embedded system of resource-constrained, and this way can only arrange the timer of pre-specified timer ID symbol, quantity is changed at any time, the situation that the opening and closing of each timer also change at any time, this way is just very difficult to realize.

The statement of conventional timer is exemplified below:

SetTimer(101,300,NULL)；

Arrange the timer that timer ID is 101, timing is 300 milliseconds.

SetTimer(200,50,NULL)；

Arrange the timer that timer ID is 200, timing is 50 milliseconds.

This routine current time opens two timers, but in this routine, supposes to use 100 timers.Then general timer response function is as follows:

In the scheme citing of above-described use timer, there are 100 timers, then need judge in OnTimer (UINTnIDEvent) function that current is which timer time has arrived, and, timer is more, then need judge number of times may be more, if the timer of current time time-out is timer 2 00, then in OnTimer (UINTnIDEvent) function, need judgement just can judge current timer 100 times.And if the shortest current timing is 50ms, then within 50ms, computing machine at least will enter OnTimer (UINT nIDEvent) function once, and do 100 judgements, the expense of CPU is very large.

The present invention will solve and develop software in process at use Microsoft Visual C++, and in many timers situation, timer number is variable, and when each timer open and close state also changes at any time, the timer caused is difficult to management, the problem that CPU overhead is large.

Summary of the invention

For defect of the prior art, the object of this invention is to provide a kind of software many timers dynamic management approach.

According to an aspect of the present invention, a kind of software many timers dynamic management approach is provided, comprises the following steps:

Step 1: definition data structure TimerData, stores timer ID TimerID and timer expiry disposal route TimerFun;

Step 2: definition queue TimerQueue, store many timer informations, the data structure form of the node of this queue is TimerData, and often open a timer, be put in queue by the mark of this timer and disposal route, the nodes of queue adds 1; Often close a timer, just the mark of this timer and disposal route are deleted from queue, the nodes of queue subtracts 1;

Step 3: opening timing device, adds queue by timer information;

Step 4: take out a node from queue, whether the timer ID stored in decision node is identical with the timer ID of current time-out, if identical, performs step 5, otherwise, if different, then perform step 6;

Step 5: the timer ID stored in node is identical with the timer ID of current time-out, the timer expiry that this node is corresponding, according to disposal methods corresponding in node;

Step 6: judge whether to take out all nodes, if so, then end operation; Otherwise, repeat step 4.

Preferably, in step 2, in queue TimerQueue, definition of T imerQueue [n] represents N number of node of TimerQueue; TimerQueue [n] .TimerID represents the timer ID stored in N number of node of TimerQueue; TimerQueue [n] .TimerFun represents the timer expiry disposal route stored in N number of node of TimerQueue.

Preferably, whether step 4 is identical with the timer ID of current time-out by the timer ID stored in timer response function decision node, be specially: in timer response function, find out timer ID TimerQueue [n] .TimerID all in queue successively, compared with the timer ID nID in current timer response function, if identical, then current timer expiry corresponding to TimerQueue [n] .TimerID.

Compared with prior art, the present invention has following beneficial effect: the present invention avoids the mode of traditional Static Inquiry by the timer ID and timer processing method using the current unlatching of queue record, reduce the inessential inquiry when the dynamic open and close of many timers to non-opening timing device, decrease CPU overhead, improve the travelling speed of system.

Accompanying drawing explanation

By reading the detailed description done non-limiting example with reference to the following drawings, other features, objects and advantages of the present invention will become more obvious:

Fig. 1 is conventional many timers responding process figure;

Fig. 2 is software many timers dynamic management approach process principle figure of the present invention.

Embodiment

Below in conjunction with specific embodiment, the present invention is described in detail.Following examples will contribute to those skilled in the art and understand the present invention further, but not limit the present invention in any form.It should be pointed out that to those skilled in the art, without departing from the inventive concept of the premise, some distortion and improvement can also be made.These all belong to protection scope of the present invention.

A kind of software many timers dynamic management approach, comprises the following steps:

Step 1: definition data structure TimerData, stores timer ID TimerID and timer expiry disposal route TimerFun.

Step 2: definition queue TimerQueue, store many timer informations, the data structure form of the node of this queue is TimerData, and often open a timer, be put in queue by the mark of this timer and disposal route, the nodes of queue adds 1; Often close a timer, just the mark of this timer and disposal route are deleted from queue, the nodes of queue subtracts 1.

Should be an empty queue when queue just defines, namely nodes be 0.Further, definition of T imerQueue [n] represents N number of node of TimerQueue, TimerQueue [n] .TimerID represents the timer ID stored in N number of node of TimerQueue, and TimerQueue [n] .TimerFun represents the timer expiry disposal route stored in N number of node of TimerQueue.

Step 3: opening timing device, adds queue by timer information.

Step 4: take out a node from queue, whether the timer ID stored in decision node is identical with the timer ID of current time-out, if identical, performs step 5, otherwise, if different, then perform step 6.

Step 5: the timer ID stored in node is identical with the timer ID of current time-out, the timer expiry that this node is corresponding, according to disposal methods corresponding in node.

Particularly, whether the timer ID by storing in timer response function decision node in step 4 is identical with the timer ID of current time-out, in timer response function, find out timer ID TimerQueue [n] .TimerID all in queue successively, compared with the timer ID nID in current timer response function, if identical, current timer expiry corresponding to TimerQueue [n] .TimerID is then described, then uses corresponding disposal route TimerQueue [n] .Fun process in step 5.

In a preferred embodiment of the present invention, may use at most 64 timers, the timing of each timer has 100ms, 300ms, 500ms tri-kinds, the most of the time of this example only opens a timer, and, the disposal route of each timer is not quite similar, and adopts the solution of the present invention, the most of the time, in timer response function, each need judge once just can complete respective handling, and compare traditional timer processing method, speed improves a lot.

Above specific embodiments of the invention are described.It is to be appreciated that the present invention is not limited to above-mentioned particular implementation, those skilled in the art can make various distortion or amendment within the scope of the claims, and this does not affect flesh and blood of the present invention.

Claims

1. software many timers dynamic management approach, is characterized in that, comprises the following steps:

Step 3: opening timing device, adds queue by timer information;

2. software many timers dynamic management approach according to claim 1, is characterized in that, in step 2, in described queue TimerQueue, definition of T imerQueue [n] represents N number of node of TimerQueue;

TimerQueue [n] .TimerID represents the timer ID stored in N number of node of TimerQueue;

TimerQueue [n] .TimerFun represents the timer expiry disposal route stored in N number of node of TimerQueue.

3. software many timers dynamic management approach according to claim 2, it is characterized in that, whether step 4 is identical with the timer ID of current time-out by the timer ID stored in timer response function decision node, be specially: in timer response function, find out timer ID TimerQueue [n] .TimerID all in queue successively, compared with the timer ID nID in current timer response function, if identical, then current timer expiry corresponding to TimerQueue [n] .TimerID.