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
|
/*
* Copyright 1995 by OpenVision Technologies, Inc.
*
* Permission to use, copy, modify, distribute, and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appears in all copies and
* that both that copyright notice and this permission notice appear in
* supporting documentation, and that the name of OpenVision not be used
* in advertising or publicity pertaining to distribution of the software
* without specific, written prior permission. OpenVision makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
*
* OPENVISION DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
* EVENT SHALL OPENVISION BE LIABLE FOR ANY SPECIAL, INDIRECT OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
* USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
/*
* $Id$
*/
#include "gssapiP_generic.h"
struct _g_set {
void *key;
void *value;
struct _g_set *next;
};
int g_set_init(g_set *s)
{
*s = NULL;
return(0);
}
#if 0
int g_set_destroy(g_set *s)
{
g_set next;
while (*s) {
next = (*s)->next;
free(*s);
*s = next;
}
return(0);
}
#endif
int g_set_entry_add(g_set *s, void *key, void *value)
{
g_set first;
if ((first = (struct _g_set *) malloc(sizeof(struct _g_set))) == NULL)
return(ENOMEM);
first->key = key;
first->value = value;
first->next = *s;
*s = first;
return(0);
}
int g_set_entry_delete(g_set *s, void *key)
{
g_set *p;
for (p=s; *p; p = &((*p)->next)) {
if ((*p)->key == key) {
g_set next = (*p)->next;
free(*p);
*p = next;
return(0);
}
}
return(-1);
}
int g_set_entry_get(g_set *s, void *key, void **value)
{
g_set p;
for (p = *s; p; p = p->next) {
if (p->key == key) {
*value = p->value;
return(0);
}
}
*value = NULL;
return(-1);
}
|
