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.
32 #include <networkradius-devel/client.h>
34 void nr_vp_free(VALUE_PAIR **head)
36 VALUE_PAIR *next, *vp;
38 if (!head || !*head) return;
42 if (vp) next = vp->next;
43 if (vp->da->flags.encrypt) {
44 memset(vp, 0, sizeof(vp));
54 VALUE_PAIR *nr_vp_init(VALUE_PAIR *vp, const DICT_ATTR *da)
56 memset(vp, 0, sizeof(*vp));
59 vp->length = da->flags.length;
65 VALUE_PAIR *nr_vp_alloc(const DICT_ATTR *da)
67 VALUE_PAIR *vp = NULL;
70 nr_strerror_printf("Unknown attribute");
75 vp = malloc(sizeof(*vp));
78 nr_strerror_printf("Out of memory");
82 return nr_vp_init(vp, da);
85 VALUE_PAIR *nr_vp_alloc_raw(unsigned int attr, unsigned int vendor)
87 VALUE_PAIR *vp = NULL;
91 vp = malloc(sizeof(*vp) + sizeof(*da) + 64);
94 nr_strerror_printf("Out of memory");
97 memset(vp, 0, sizeof(*vp));
99 da = (DICT_ATTR *) (vp + 1);
101 if (nr_dict_attr_2struct(da, attr, vendor, (char *) (da + 1), 64) < 0) {
111 int nr_vp_set_data(VALUE_PAIR *vp, const void *data, size_t sizeof_data)
113 int rcode = 1; /* OK */
115 if (!vp || !data || (sizeof_data == 0)) return -NR_ERR_INVALID_ARG;
117 switch (vp->da->type) {
119 vp->vp_integer = *(const uint8_t *) data;
123 vp->vp_integer = *(const uint16_t *) data;
126 case NR_TYPE_INTEGER:
129 vp->vp_integer = *(const uint32_t *) data;
133 if (sizeof_data >= sizeof(vp->vp_strvalue)) {
134 sizeof_data = sizeof(vp->vp_strvalue) - 1;
135 rcode = 0; /* truncated */
138 memcpy(vp->vp_strvalue, (const char *) data, sizeof_data);
139 vp->vp_strvalue[sizeof_data + 1] = '\0';
140 vp->length = sizeof_data;
144 if (sizeof_data > sizeof(vp->vp_octets)) {
145 sizeof_data = sizeof(vp->vp_octets);
146 rcode = 0; /* truncated */
148 memcpy(vp->vp_octets, data, sizeof_data);
149 vp->length = sizeof_data;
153 return -NR_ERR_ATTR_TYPE_UNKNOWN;
159 VALUE_PAIR *nr_vp_create(int attr, int vendor, const void *data, size_t data_len)
164 da = nr_dict_attr_byvalue(attr, vendor);
165 if (!da) return NULL;
167 vp = nr_vp_alloc(da);
168 if (!vp) return NULL;
170 if (nr_vp_set_data(vp, data, data_len) < 0) {
178 void nr_vps_append(VALUE_PAIR **head, VALUE_PAIR *tail)
183 head = &((*head)->next);
189 VALUE_PAIR *nr_vps_find(VALUE_PAIR *head,
190 unsigned int attr, unsigned int vendor)
193 if ((head->da->attr == attr) &&
194 (head->da->vendor == vendor)) return head;