2 * Copyright (c) 2012 The FreeBSD Foundation
5 * This software was developed by Edward Tomasz Napierala under sponsorship
6 * from the FreeBSD Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44 keys = calloc(sizeof(*keys), 1);
52 keys_delete(struct keys *keys)
55 free(keys->keys_data);
60 keys_load(struct keys *keys, const struct pdu *pdu)
66 if (pdu->pdu_data_len == 0)
67 log_errx(1, "protocol error: empty data segment");
69 if (pdu->pdu_data[pdu->pdu_data_len - 1] != '\0')
70 log_errx(1, "protocol error: key not NULL-terminated\n");
72 assert(keys->keys_data == NULL);
73 keys->keys_data_len = pdu->pdu_data_len;
74 keys->keys_data = malloc(keys->keys_data_len);
75 if (keys->keys_data == NULL)
77 memcpy(keys->keys_data, pdu->pdu_data, keys->keys_data_len);
80 * XXX: Review this carefully.
82 pair = keys->keys_data;
85 log_errx(1, "too many keys received");
87 pair_len = strlen(pair);
89 keys->keys_values[i] = pair;
90 keys->keys_names[i] = strsep(&keys->keys_values[i], "=");
91 if (keys->keys_names[i] == NULL || keys->keys_values[i] == NULL)
92 log_errx(1, "malformed keys");
93 log_debugx("key received: \"%s=%s\"",
94 keys->keys_names[i], keys->keys_values[i]);
96 pair += pair_len + 1; /* +1 to skip the terminating '\0'. */
97 if (pair == keys->keys_data + keys->keys_data_len)
99 assert(pair < keys->keys_data + keys->keys_data_len);
104 keys_save(struct keys *keys, struct pdu *pdu)
111 * XXX: Not particularly efficient.
114 for (i = 0; i < KEYS_MAX; i++) {
115 if (keys->keys_names[i] == NULL)
118 * +1 for '=', +1 for '\0'.
120 len += strlen(keys->keys_names[i]) +
121 strlen(keys->keys_values[i]) + 2;
129 log_err(1, "malloc");
131 pdu->pdu_data = data;
132 pdu->pdu_data_len = len;
134 for (i = 0; i < KEYS_MAX; i++) {
135 if (keys->keys_names[i] == NULL)
137 data += sprintf(data, "%s=%s",
138 keys->keys_names[i], keys->keys_values[i]);
139 data += 1; /* for '\0'. */
144 keys_find(struct keys *keys, const char *name)
149 * Note that we don't handle duplicated key names here,
150 * as they are not supposed to happen in requests, and if they do,
151 * it's an initiator error.
153 for (i = 0; i < KEYS_MAX; i++) {
154 if (keys->keys_names[i] == NULL)
156 if (strcmp(keys->keys_names[i], name) == 0)
157 return (keys->keys_values[i]);
163 keys_find_int(struct keys *keys, const char *name)
169 str = keys_find(keys, name);
173 num = strtoul(str, &endptr, 10);
174 if (*endptr != '\0') {
175 log_debugx("invalid numeric value \"%s\"", str);
183 keys_add(struct keys *keys, const char *name, const char *value)
187 log_debugx("key to send: \"%s=%s\"", name, value);
190 * Note that we don't check for duplicates here, as they are perfectly
191 * fine in responses, e.g. the "TargetName" keys in discovery sesion
194 for (i = 0; i < KEYS_MAX; i++) {
195 if (keys->keys_names[i] == NULL) {
196 keys->keys_names[i] = checked_strdup(name);
197 keys->keys_values[i] = checked_strdup(value);
201 log_errx(1, "too many keys");
205 keys_add_int(struct keys *keys, const char *name, int value)
210 ret = asprintf(&str, "%d", value);
212 log_err(1, "asprintf");
214 keys_add(keys, name, str);