blob: ed059d70da7fafcab5a15f52280fad02980adfc0 (
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/* -*- C++ -*- */
// $Id$
// ============================================================================
//
// = LIBRARY
// ace
//
// = FILENAME
// Priority_Reactor.h
//
// = AUTHOR
// Doug Schmidt
//
// ============================================================================
#ifndef ACE_PRIORITY_REACTOR_H
#define ACE_PRIORITY_REACTOR_H
#include "ace/pre.h"
#include "ace/Containers.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "ace/Select_Reactor.h"
class ACE_Export ACE_Priority_Reactor : public ACE_Select_Reactor
{
// = TITLE
// Implements priority based dispatching.
//
// = DESCRIPTION
// This class refines the dispatching mechanism for the
// Select_Reactor by taking advantage of the priority method on
// ACE_Event_Handler.
public:
// = Initialization and termination methods.
ACE_Priority_Reactor (ACE_Sig_Handler * = 0,
ACE_Timer_Queue * = 0);
// Initialize <ACE_Priority_Reactor> with the default size.
ACE_Priority_Reactor (size_t size,
int restart = 0,
ACE_Sig_Handler * = 0,
ACE_Timer_Queue * = 0);
// Initialize <ACE_Priority_Reactor> with size <size>.
virtual ~ACE_Priority_Reactor (void);
// Close down the select_reactor and release all of its resources.
void dump (void) const;
// Dump the state of an object.
ACE_ALLOC_HOOK_DECLARE;
// Declare the dynamic allocation hooks.
protected:
// = Dispatching methods.
virtual int dispatch_io_set (int number_of_active_handles,
int &number_dispatched,
int mask,
ACE_Handle_Set &dispatch_mask,
ACE_Handle_Set &ready_mask,
ACE_EH_PTMF callback);
// We simply override this function to implement the priority
// dispatching.
private:
void init_bucket (void);
// A small helper to initialize the bucket.
typedef ACE_Unbounded_Queue<ACE_Event_Tuple> QUEUE;
QUEUE** bucket_;
// There is a queue per-priority, which simply holds the
// Event_Handlers until we knwo who goes first.
ACE_Allocator* tuple_allocator_;
// The queues themselves use this allocator to minimize dynamic
// memory usage.
ACE_Priority_Reactor (const ACE_Select_Reactor &);
ACE_Priority_Reactor &operator = (const ACE_Select_Reactor &);
// Deny access since member-wise won't work...
};
#include "ace/post.h"
#endif /* ACE_PRIORITY_REACTOR_H */
|
