2 Copyright (c) 2011, Network RADIUS SARL
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
7 * Redistributions of source code must retain the above copyright
8 notice, this list of conditions and the following disclaimer.
9 * Redistributions in binary form must reproduce the above copyright
10 notice, this list of conditions and the following disclaimer in the
11 documentation and/or other materials provided with the distribution.
12 * Neither the name of the <organization> nor the
13 names of its contributors may be used to endorse or promote products
14 derived from this software without specific prior written permission.
16 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
17 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
20 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 * \brief Functions to manipulate C structure versions of RADIUS attributes.
34 void nr_vp_free(VALUE_PAIR **head)
36 VALUE_PAIR *next, *vp;
38 for (vp = *head; vp != NULL; vp = next) {
40 if (vp->da->flags.encrypt) {
41 memset(vp, 0, sizeof(vp));
50 VALUE_PAIR *nr_vp_init(VALUE_PAIR *vp, const DICT_ATTR *da)
52 memset(vp, 0, sizeof(*vp));
55 vp->length = da->flags.length;
61 VALUE_PAIR *nr_vp_alloc(const DICT_ATTR *da)
63 VALUE_PAIR *vp = NULL;
66 nr_strerror_printf("Unknown attribute");
70 vp = malloc(sizeof(*vp));
72 nr_strerror_printf("Out of memory");
76 return nr_vp_init(vp, da);
79 VALUE_PAIR *nr_vp_alloc_raw(unsigned int attr, unsigned int vendor)
81 VALUE_PAIR *vp = NULL;
84 vp = malloc(sizeof(*vp) + sizeof(*da) + 64);
86 nr_strerror_printf("Out of memory");
89 memset(vp, 0, sizeof(*vp));
91 da = (DICT_ATTR *) (vp + 1);
93 if (nr_dict_attr_2struct(da, attr, vendor, (char *) (da + 1), 64) < 0) {
103 int nr_vp_set_data(VALUE_PAIR *vp, const void *data, size_t sizeof_data)
105 int rcode = 1; /* OK */
107 if (!vp || !data || (sizeof_data == 0)) return -RSE_INVAL;
109 switch (vp->da->type) {
111 vp->vp_integer = *(const uint8_t *) data;
115 vp->vp_integer = *(const uint16_t *) data;
118 case RS_TYPE_INTEGER:
121 vp->vp_integer = *(const uint32_t *) data;
125 if (sizeof_data >= sizeof(vp->vp_strvalue)) {
126 sizeof_data = sizeof(vp->vp_strvalue) - 1;
127 rcode = 0; /* truncated */
130 memcpy(vp->vp_strvalue, (const char *) data, sizeof_data);
131 vp->vp_strvalue[sizeof_data + 1] = '\0';
132 vp->length = sizeof_data;
136 if (sizeof_data > sizeof(vp->vp_octets)) {
137 sizeof_data = sizeof(vp->vp_octets);
138 rcode = 0; /* truncated */
140 memcpy(vp->vp_octets, data, sizeof_data);
141 vp->length = sizeof_data;
145 return -RSE_ATTR_TYPE_UNKNOWN;
151 VALUE_PAIR *nr_vp_create(int attr, int vendor, const void *data, size_t data_len)
156 da = nr_dict_attr_byvalue(attr, vendor);
157 if (!da) return NULL;
159 vp = nr_vp_alloc(da);
160 if (!vp) return NULL;
162 if (nr_vp_set_data(vp, data, data_len) < 0) {
170 void nr_vps_append(VALUE_PAIR **head, VALUE_PAIR *tail)
175 head = &((*head)->next);
181 VALUE_PAIR *nr_vps_find(VALUE_PAIR *head,
182 unsigned int attr, unsigned int vendor)
185 if ((head->da->attr == attr) &&
186 (head->da->vendor == vendor)) return head;