blob: b42241c2c8da1f0d53c2a4947d1867a646b613e9 (
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
|
/*-
* Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
* Redistribution and modifications are permitted subject to BSD license.
*/
#include <asn_internal.h>
#include <asn_SET_OF.h>
#include <errno.h>
/*
* Add another element into the set.
*/
int asn_set_add(void *asn_set_of_x, void *ptr)
{
asn_anonymous_set_ *as = _A_SET_FROM_VOID(asn_set_of_x);
if (as == 0 || ptr == 0) {
errno = EINVAL; /* Invalid arguments */
return -1;
}
/*
* Make sure there's enough space to insert an element.
*/
if (as->count == as->size) {
int _newsize = as->size ? (as->size << 1) : 4;
void *_new_arr;
_new_arr = REALLOC(as->array, _newsize * sizeof(as->array[0]));
if (_new_arr) {
as->array = (void **)_new_arr;
as->size = _newsize;
} else {
/* ENOMEM */
return -1;
}
}
as->array[as->count++] = ptr;
return 0;
}
void asn_set_del(void *asn_set_of_x, int number, int _do_free)
{
asn_anonymous_set_ *as = _A_SET_FROM_VOID(asn_set_of_x);
if (as) {
void *ptr;
if (number < 0 || number >= as->count)
return;
if (_do_free && as->free) {
ptr = as->array[number];
} else {
ptr = 0;
}
as->array[number] = as->array[--as->count];
/*
* Invoke the third-party function only when the state
* of the parent structure is consistent.
*/
if (ptr)
as->free(ptr);
}
}
/*
* Free the contents of the set, do not free the set itself.
*/
void asn_set_empty(void *asn_set_of_x)
{
asn_anonymous_set_ *as = _A_SET_FROM_VOID(asn_set_of_x);
if (as) {
if (as->array) {
if (as->free) {
while (as->count--)
as->free(as->array[as->count]);
}
FREEMEM(as->array);
as->array = 0;
}
as->count = 0;
as->size = 0;
}
}
|
