blob: 1203ace10f521095ee5414d828465d8c8fb7439e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
/* Copyright (C) 2003 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#ifndef TimeQueue_H
#define TimeQueue_H
#include <kernel_types.h>
#include "Prio.hpp"
#define MAX_NO_OF_SHORT_TQ 512
#define MAX_NO_OF_LONG_TQ 512
#define MAX_NO_OF_TQ (MAX_NO_OF_SHORT_TQ + MAX_NO_OF_LONG_TQ)
#define NULL_TQ_ENTRY 65535
class Signal;
struct TimeStruct
{
Uint16 delay_time;
Uint16 job_index;
};
union TimerEntry
{
struct TimeStruct time_struct;
Uint32 copy_struct;
};
class TimeQueue
{
public:
TimeQueue();
~TimeQueue();
void insert(Signal* signal, BlockNumber bnr,
GlobalSignalNumber gsn, Uint32 delayTime);
void clear();
void scanTable(); // Called once per millisecond
Uint32 getIndex();
void releaseIndex(Uint32 aIndex);
void recount_timers();
private:
TimerEntry theShortQueue[MAX_NO_OF_SHORT_TQ];
TimerEntry theLongQueue[MAX_NO_OF_LONG_TQ];
Uint16 theFreeIndex[MAX_NO_OF_TQ];
};
#endif
|
