blob: 15c422a6404322f65d23d86b4801a846e369d394 (
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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// TAO
//
// = FILENAME
// Linear_Priority_Mapping.h
//
// = DESCRIPTION
// Declares the Linear_Priority_Mapping interface, as defined in the
// RT-CORBA spec.
//
// = AUTHOR
// Carlos O'Ryan (coryan@cs.wustl.edu)
//
// ============================================================================
#ifndef TAO_LINEAR_PRIORITY_MAPPING_H
#define TAO_LINEAR_PRIORITY_MAPPING_H
#include "ace/pre.h"
#include "tao/orbconf.h"
#if (TAO_HAS_RT_CORBA == 1)
#include "tao/Priority_Mapping.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
class TAO_Export TAO_Linear_Priority_Mapping : public TAO_Priority_Mapping
{
//
// = TITLE
// A simple implementation of the Priority_Mapping interface
//
// = DESCRIPTION
// This implementation uses linear mapping between the range of
// priorities for a given scheduling class (ACE_SCHED_OTHER,
// ACE_SCHED_FIFO, ACE_SCHED_RR) and the valid range of CORBA
// priorities (0...32767)
//
public:
TAO_Linear_Priority_Mapping (int policy = ACE_SCHED_OTHER);
// Default constructor
virtual ~TAO_Linear_Priority_Mapping (void);
// The destructor
virtual CORBA::Boolean
to_native (RTCORBA::Priority corba_priority,
RTCORBA::NativePriority &native_priority);
virtual CORBA::Boolean
to_CORBA (RTCORBA::NativePriority native_priority,
RTCORBA::Priority &corba_priority);
private:
int policy_;
// The scheduling policy
int min_;
int max_;
// The range
};
#if defined (__ACE_INLINE__)
# include "tao/Linear_Priority_Mapping.i"
#endif /* __ACE_INLINE__ */
#endif /* TAO_HAS_RT_CORBA == 1 */
#include "ace/post.h"
#endif /* TAO_LINEAR_PRIORITY_MAPPING_H */
|
