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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright (c) 1999-2001 by Sun Microsystems, Inc.
* All rights reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* file: mipagentsnmp_mipSecAssocEntry.c
*
* This file contains the SNMP routines used to retrieve
* the Mobility Agent's Security Association Information.
*/
#include <sys/types.h>
#include <netinet/in.h>
#include <stdlib.h>
#include <impl.h>
#include <snmp.h>
#include "snmp_stub.h"
#include "agent.h"
/*
* This table has one entry for each mobile node for which a mobility
* agent offers Home Agent services.
*/
extern HashTable mipSecAssocHash;
/*
* Function: get_mipSecAssocEntry
*
* Arguments: search_type - The type of search (first, next, exact)
* mipSecAssocEntry_data - Pointer to a pointer which
* will contain the Security Association entry
* upon successful completion.
* index - Pointer to the current index
*
* Description: This function will allocate the memory required for
* the Security Association entry, and will find the
* appropriate Security Association based on the index
* provided. If the search type is set to FIRST_ENTRY,
* we will return the first Security Association in the
* Hash Table, otherwise the index is used.
*
* The Security Association entry is then setup with the
* values found in the entry from the hash table and
* returned to the caller.
*
* Note, the caller is responsible for either freeing the
* memory, or calling free_mipSecAssocEntry()
*
* Returns: int, 0 if successful
*/
extern int
get_mipSecAssocEntry(int search_type,
MipSecAssocEntry_t **mipSecAssocEntry_data, IndexType *index)
{
Integer *integer;
String *string;
MipSecAssocEntry *mipSecAssocEntry = NULL;
HashEntry *hashEntry;
int i;
int j;
boolean_t found = _B_FALSE;
/*
* Allocate some memory to handle the request.
*/
*mipSecAssocEntry_data =
(MipSecAssocEntry_t *)calloc(1, sizeof (MipSecAssocEntry_t));
if (mipSecAssocEntry_data == NULL) {
return (SNMP_ERR_GENERR);
}
/*
* In the case, the search_type is FIRST_ENTRY or NEXT_ENTRY
* this function should modify the index argument to the
* appropriate value
*/
switch (search_type) {
case FIRST_ENTRY:
/*
* We are looking for the first entry in the list.
*/
index->value[0] = 1;
index->len = 1;
break;
case NEXT_ENTRY:
/*
* Increment the index value.
*/
index->value[0]++;
break;
case EXACT_ENTRY:
/*
* We don't need to play around with the
* index for this search type.
*/
break;
default:
free_mipSecAssocEntry(*mipSecAssocEntry_data);
return (SNMP_ERR_GENERR);
}
/*
* Now search for the entry... the problem here is that
* the Security Association Information spans three different
* tables, so we need to look through each one.
*/
for (i = 0, j = 1; i < HASH_TBL_SIZE && found == _B_FALSE; i++) {
if (mipSecAssocHash.buckets[i]) {
/*
* Lock the bucket
*/
(void) rw_rdlock(&mipSecAssocHash.bucketLock[i]);
hashEntry = mipSecAssocHash.buckets[i];
while (hashEntry != NULL) {
if (j == index->value[0]) {
mipSecAssocEntry = hashEntry->data;
found = _B_TRUE;
/*
* Lock the node
*/
(void) rw_rdlock(&mipSecAssocEntry->
mipSecNodeLock);
break;
}
hashEntry = hashEntry->next;
j++;
}
/*
* Unlock the bucket
*/
(void) rw_unlock(&mipSecAssocHash.bucketLock[i]);
}
}
if (mipSecAssocEntry == NULL) {
free_mipSecAssocEntry(*mipSecAssocEntry_data);
*mipSecAssocEntry_data = NULL;
return (END_OF_TABLE);
}
/*
* And now we return the Algorithm type.
*/
integer = &((*mipSecAssocEntry_data)->mipSecAlgorithmType);
*integer = (int)mipSecAssocEntry->mipSecAlgorithmType;
/*
* And now we return the Algorithm mode.
*/
integer = &((*mipSecAssocEntry_data)->mipSecAlgorithmMode);
*integer = (int)mipSecAssocEntry->mipSecAlgorithmMode;
/*
* And now we return the Key. Note that RFC2006 clearly states
* that this will always return 0 (then why does it exist in
* the MIB?!?).
*/
string = &((*mipSecAssocEntry_data)->mipSecKey);
string->len = 0;
/*
* And now we return the Replay Method.
*/
integer = &((*mipSecAssocEntry_data)->mipSecReplayMethod);
*integer = (int)mipSecAssocEntry->mipSecReplayMethod;
/*
* Unlock the node
*/
(void) rw_unlock(&mipSecAssocEntry->mipSecNodeLock);
return (SNMP_ERR_NOERROR);
}
/*
* Function: free_mipSecAssocEntry
*
* Arguments: mipSecAssocEntry - Pointer to a previously
* allocated SNMP Security Association
* entry
*
* Description: This function is called to free a previously
* allocated SNMP Security Association entry.
*
* Returns:
*/
void
free_mipSecAssocEntry(MipSecAssocEntry_t *mipSecAssocEntry)
{
if (mipSecAssocEntry) {
free(mipSecAssocEntry);
mipSecAssocEntry = NULL;
}
}
|
