2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2012 The FreeBSD Foundation
6 * This software was developed by Edward Tomasz Napierala under sponsorship
7 * from the FreeBSD Foundation.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 #include "libiscsiutil.h"
43 keys = calloc(1, sizeof(*keys));
51 keys_delete(struct keys *keys)
54 for (int i = 0; i < KEYS_MAX; i++) {
55 free(keys->keys_names[i]);
56 free(keys->keys_values[i]);
62 keys_load(struct keys *keys, const char *data, size_t len)
65 char *keys_data, *name, *pair, *value;
71 if (data[len - 1] != '\0')
72 log_errx(1, "protocol error: key not NULL-terminated\n");
74 keys_data = malloc(len);
75 if (keys_data == NULL)
77 memcpy(keys_data, data, len);
80 * XXX: Review this carefully.
85 log_errx(1, "too many keys received");
87 pair_len = strlen(pair);
90 name = strsep(&value, "=");
91 if (name == NULL || value == NULL)
92 log_errx(1, "malformed keys");
93 keys->keys_names[i] = checked_strdup(name);
94 keys->keys_values[i] = checked_strdup(value);
95 log_debugx("key received: \"%s=%s\"",
96 keys->keys_names[i], keys->keys_values[i]);
98 pair += pair_len + 1; /* +1 to skip the terminating '\0'. */
99 if (pair == keys_data + len)
101 assert(pair < keys_data + len);
107 keys_save(struct keys *keys, char **datap, size_t *lenp)
114 fp = open_memstream(&data, &len);
116 log_err(1, "open_memstream");
117 for (i = 0; i < KEYS_MAX; i++) {
118 if (keys->keys_names[i] == NULL)
121 fprintf(fp, "%s=%s", keys->keys_names[i], keys->keys_values[i]);
123 /* Append a '\0' after each key pair. */
127 log_err(1, "fclose");
139 keys_find(struct keys *keys, const char *name)
144 * Note that we don't handle duplicated key names here,
145 * as they are not supposed to happen in requests, and if they do,
146 * it's an initiator error.
148 for (i = 0; i < KEYS_MAX; i++) {
149 if (keys->keys_names[i] == NULL)
151 if (strcmp(keys->keys_names[i], name) == 0)
152 return (keys->keys_values[i]);
158 keys_add(struct keys *keys, const char *name, const char *value)
162 log_debugx("key to send: \"%s=%s\"", name, value);
165 * Note that we don't check for duplicates here, as they are perfectly
166 * fine in responses, e.g. the "TargetName" keys in discovery session
169 for (i = 0; i < KEYS_MAX; i++) {
170 if (keys->keys_names[i] == NULL) {
171 keys->keys_names[i] = checked_strdup(name);
172 keys->keys_values[i] = checked_strdup(value);
176 log_errx(1, "too many keys");
180 keys_add_int(struct keys *keys, const char *name, int value)
185 ret = asprintf(&str, "%d", value);
187 log_err(1, "asprintf");
189 keys_add(keys, name, str);