summaryrefslogtreecommitdiff
path: root/TAO/IIOP/lib/optable.cpp
blob: 3766fbcf5783fd0f2ca108c31c2d6644add88def (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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include "optable.h"

TAO_Operation_Table::~TAO_Operation_Table (void)
{
}

TAO_Dynamic_Hash_OpTable::TAO_Dynamic_Hash_OpTable (CORBA_ULong size)
{
  if (size > 0)
    this->hash_.open (size);
  // else we already have a default hash map
}

TAO_Dynamic_Hash_OpTable::~TAO_Dynamic_Hash_OpTable (void)
{
  this->hash_.close ();
}

int 
TAO_Dynamic_Hash_OpTable::bind (const CORBA_String &opname,
                                const TAO_Skeleton skel_ptr)
{
  ACE_CString key (opname);
  return this->hash_.bind (key, skel_ptr);
}

int
TAO_Dynamic_Hash_OpTable::find (const CORBA_String &opname,
                                TAO_Skeleton& skel_ptr)
{
  ACE_CString key (opname);

  return this->hash_.find (key, skel_ptr);
}

// Linear search strategy
TAO_Linear_OpTable::TAO_Linear_OpTable (CORBA_ULong size)
  : next_ (0),
    tablesize_ (size),
    tbl_ (new TAO_Linear_OpTable_Entry[size])
{
}

TAO_Linear_OpTable::~TAO_Linear_OpTable (void)
{
  delete [] this->tbl_;
}

// ****** we should really make sure that the same key doesn't exist
// ******
int 
TAO_Linear_OpTable::bind (const CORBA_String &opname,
                          const TAO_Skeleton skel_ptr)
{
  CORBA_ULong i = this->next_;

  if (i < this->tablesize_)
    {
      this->tbl_[i].opname = opname;
      this->tbl_[i].skel_ptr = skel_ptr;
      this->next_++;
      return 0;
    }
  return -1; // error
}

int
TAO_Linear_OpTable::find (const CORBA_String &opname,
                          TAO_Skeleton& skel_ptr)
{
  ACE_ASSERT (this->next_ <= this->tablesize_);

  for (CORBA_ULong i;
       i < this->next_;
       i++)
    if (!ACE_OS::strncmp (opname, this->tbl_[i].opname, ACE_OS::strlen (opname)))
      {
        skel_ptr = this->tbl_[i].skel_ptr;
        return 1;
      }
  
  return -1;  // not found
}

TAO_Linear_OpTable_Entry::TAO_Linear_OpTable_Entry (void)
{
}

TAO_Linear_OpTable_Entry::~TAO_Linear_OpTable_Entry (void)
{
  this->skel_ptr = 0;  // cannot delete this as we do not own it
}

// Active Demux search strategy
TAO_Active_Demux_OpTable::TAO_Active_Demux_OpTable (CORBA_ULong size)
  : next_ (0),
    tablesize_ (size),
    tbl_ (new TAO_Active_Demux_OpTable_Entry[size])
{
}

TAO_Active_Demux_OpTable::~TAO_Active_Demux_OpTable (void)
{
  delete [] this->tbl_;
}

// ****** we should really make sure that the same key doesn't exist ******
int 
TAO_Active_Demux_OpTable::bind (const CORBA_String &opname,
				const TAO_Skeleton skel_ptr)
{
  CORBA_ULong i = ACE_OS::atoi (opname);

  if (i < this->tablesize_)
    {
      this->tbl_[i].skel_ptr = skel_ptr;
      return 0;
    }
  return -1; // error
}

int
TAO_Active_Demux_OpTable::find (const CORBA_String &opname,
                                TAO_Skeleton& skel_ptr)
{
  CORBA_ULong i = ACE_OS::atoi (opname);

  ACE_ASSERT (i <= this->tablesize_);
  skel_ptr = this->tbl_[i].skel_ptr;
  return 1;
}

TAO_Active_Demux_OpTable_Entry::TAO_Active_Demux_OpTable_Entry (void)
{
  this->skel_ptr = 0;
}

TAO_Active_Demux_OpTable_Entry::~TAO_Active_Demux_OpTable_Entry (void)
{
  this->skel_ptr = 0;  // cannot delete this as we do not own it
}

TAO_Operation_Table_Parameters::TAO_Operation_Table_Parameters (void)
  : type_ (TAO_Operation_Table_Parameters::TAO_DYNAMIC_HASH),
    strategy_ (0)
{
}

TAO_Operation_Table_Parameters::~TAO_Operation_Table_Parameters (void)
{
}

void 
TAO_Operation_Table_Parameters::lookup_strategy (TAO_Operation_Table_Parameters::DEMUX_STRATEGY s)
{
  this->type_ = s;
}

TAO_Operation_Table_Parameters::DEMUX_STRATEGY TAO_Operation_Table_Parameters::lookup_strategy (void) const
{
  return this->type_;
}

void 
TAO_Operation_Table_Parameters::concrete_strategy (TAO_Operation_Table *ot)
{
  this->strategy_ = ot;
}

TAO_Operation_Table* TAO_Operation_Table_Parameters::concrete_strategy (void)
{
  return this->strategy_;
}

TAO_Operation_Table_Factory::TAO_Operation_Table_Factory (void)
{
}

TAO_Operation_Table_Factory::~TAO_Operation_Table_Factory (void)
{
}

TAO_Operation_Table * 
TAO_Operation_Table_Factory::opname_lookup_strategy (void)
{
  TAO_Operation_Table_Parameters *p = TAO_OP_TABLE_PARAMETERS::instance ();

  return p->concrete_strategy ();
}

#if defined(ACE_TEMPLATES_REQUIRE_SPECIALIZATION)
template class ACE_Hash_Map_Manager<ACE_CString, TAO_Skeleton, ACE_SYNCH_RW_MUTEX>;
template class ACE_Hash_Map_Entry<ACE_CString, TAO_Skeleton>;
template class ACE_Singleton<TAO_Operation_Table_Parameters, ACE_SYNCH_RW_MUTEX>;
#endif