xref: /freebsd/stand/libsa/nvstore.c (revision 3e15b01d6914c927e37d1699645783acf286655c)
1*d1ea5017SWarner Losh /*-
2*d1ea5017SWarner Losh  * Copyright 2020 Toomas Soome <tsoome@me.com>
3*d1ea5017SWarner Losh  *
4*d1ea5017SWarner Losh  * Redistribution and use in source and binary forms, with or without
5*d1ea5017SWarner Losh  * modification, are permitted provided that the following conditions
6*d1ea5017SWarner Losh  * are met:
7*d1ea5017SWarner Losh  * 1. Redistributions of source code must retain the above copyright
8*d1ea5017SWarner Losh  *    notice, this list of conditions and the following disclaimer.
9*d1ea5017SWarner Losh  * 2. Redistributions in binary form must reproduce the above copyright
10*d1ea5017SWarner Losh  *    notice, this list of conditions and the following disclaimer in the
11*d1ea5017SWarner Losh  *    documentation and/or other materials provided with the distribution.
12*d1ea5017SWarner Losh  *
13*d1ea5017SWarner Losh  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
14*d1ea5017SWarner Losh  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15*d1ea5017SWarner Losh  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
16*d1ea5017SWarner Losh  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
17*d1ea5017SWarner Losh  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
18*d1ea5017SWarner Losh  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
19*d1ea5017SWarner Losh  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
20*d1ea5017SWarner Losh  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
21*d1ea5017SWarner Losh  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
22*d1ea5017SWarner Losh  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
23*d1ea5017SWarner Losh  * SUCH DAMAGE.
24*d1ea5017SWarner Losh  */
25*d1ea5017SWarner Losh 
26*d1ea5017SWarner Losh /*
27*d1ea5017SWarner Losh  * Big Theory Statement.
28*d1ea5017SWarner Losh  *
29*d1ea5017SWarner Losh  * nvstore is abstraction layer to implement data read/write to different
30*d1ea5017SWarner Losh  * types of non-volatile storage.
31*d1ea5017SWarner Losh  *
32*d1ea5017SWarner Losh  * User interfaces:
33*d1ea5017SWarner Losh  * Provide mapping via environment: setenv/unsetenv/putenv. Access via
34*d1ea5017SWarner Losh  * environment functions/commands is available once nvstore has
35*d1ea5017SWarner Losh  * attached the backend and stored textual data is mapped to environment.
36*d1ea5017SWarner Losh  *
37*d1ea5017SWarner Losh  * nvstore_init(): attach new backend and create the environment mapping.
38*d1ea5017SWarner Losh  * nvstore_fini: detach backend and unmap the related environment.
39*d1ea5017SWarner Losh  *
40*d1ea5017SWarner Losh  * The disk based storage, such as UFS file or ZFS bootenv label area, is
41*d1ea5017SWarner Losh  * only accessible after root file system is set. Root file system change
42*d1ea5017SWarner Losh  * will switch the back end storage.
43*d1ea5017SWarner Losh  */
44*d1ea5017SWarner Losh 
45*d1ea5017SWarner Losh #include <stdbool.h>
46*d1ea5017SWarner Losh #include <sys/queue.h>
47*d1ea5017SWarner Losh #include "stand.h"
48*d1ea5017SWarner Losh #include "nvstore.h"
49*d1ea5017SWarner Losh 
50*d1ea5017SWarner Losh nvstore_list_t stores = STAILQ_HEAD_INITIALIZER(stores);
51*d1ea5017SWarner Losh 
52*d1ea5017SWarner Losh void *
nvstore_get_store(const char * name)53*d1ea5017SWarner Losh nvstore_get_store(const char *name)
54*d1ea5017SWarner Losh {
55*d1ea5017SWarner Losh 	nvstore_t *st;
56*d1ea5017SWarner Losh 
57*d1ea5017SWarner Losh 	st = NULL;
58*d1ea5017SWarner Losh 
59*d1ea5017SWarner Losh 	STAILQ_FOREACH(st, &stores, nvs_next) {
60*d1ea5017SWarner Losh 		if (strcmp(name, st->nvs_name) == 0)
61*d1ea5017SWarner Losh 			break;
62*d1ea5017SWarner Losh 	}
63*d1ea5017SWarner Losh 
64*d1ea5017SWarner Losh 	return (st);
65*d1ea5017SWarner Losh }
66*d1ea5017SWarner Losh 
67*d1ea5017SWarner Losh int
nvstore_init(const char * name,nvs_callbacks_t * cb,void * data)68*d1ea5017SWarner Losh nvstore_init(const char *name, nvs_callbacks_t *cb, void *data)
69*d1ea5017SWarner Losh {
70*d1ea5017SWarner Losh 	nvstore_t *st;
71*d1ea5017SWarner Losh 
72*d1ea5017SWarner Losh 	st = nvstore_get_store(name);
73*d1ea5017SWarner Losh 	if (st != NULL)
74*d1ea5017SWarner Losh 		return (EEXIST);
75*d1ea5017SWarner Losh 
76*d1ea5017SWarner Losh 	if ((st = malloc(sizeof (*st))) == NULL)
77*d1ea5017SWarner Losh 		return (ENOMEM);
78*d1ea5017SWarner Losh 
79*d1ea5017SWarner Losh 	if ((st->nvs_name = strdup(name)) == NULL) {
80*d1ea5017SWarner Losh 		free(st);
81*d1ea5017SWarner Losh 		return (ENOMEM);
82*d1ea5017SWarner Losh 	}
83*d1ea5017SWarner Losh 
84*d1ea5017SWarner Losh 	st->nvs_data = data;
85*d1ea5017SWarner Losh 	st->nvs_cb = cb;
86*d1ea5017SWarner Losh 
87*d1ea5017SWarner Losh 	STAILQ_INSERT_TAIL(&stores, st, nvs_next);
88*d1ea5017SWarner Losh 	return (0);
89*d1ea5017SWarner Losh }
90*d1ea5017SWarner Losh 
91*d1ea5017SWarner Losh int
nvstore_fini(const char * name)92*d1ea5017SWarner Losh nvstore_fini(const char *name)
93*d1ea5017SWarner Losh {
94*d1ea5017SWarner Losh 	nvstore_t *st;
95*d1ea5017SWarner Losh 
96*d1ea5017SWarner Losh 	st = nvstore_get_store(name);
97*d1ea5017SWarner Losh 	if (st == NULL)
98*d1ea5017SWarner Losh 		return (ENOENT);
99*d1ea5017SWarner Losh 
100*d1ea5017SWarner Losh 	STAILQ_REMOVE(&stores, st, nvstore, nvs_next);
101*d1ea5017SWarner Losh 
102*d1ea5017SWarner Losh 	free(st->nvs_name);
103*d1ea5017SWarner Losh 	free(st->nvs_data);
104*d1ea5017SWarner Losh 	free(st);
105*d1ea5017SWarner Losh 	return (0);
106*d1ea5017SWarner Losh }
107*d1ea5017SWarner Losh 
108*d1ea5017SWarner Losh int
nvstore_print(void * ptr)109*d1ea5017SWarner Losh nvstore_print(void *ptr)
110*d1ea5017SWarner Losh {
111*d1ea5017SWarner Losh 	nvstore_t *st = ptr;
112*d1ea5017SWarner Losh 
113*d1ea5017SWarner Losh 	return (st->nvs_cb->nvs_iterate(st->nvs_data, st->nvs_cb->nvs_print));
114*d1ea5017SWarner Losh }
115*d1ea5017SWarner Losh 
116*d1ea5017SWarner Losh int
nvstore_get_var(void * ptr,const char * name,void ** data)117*d1ea5017SWarner Losh nvstore_get_var(void *ptr, const char *name, void **data)
118*d1ea5017SWarner Losh {
119*d1ea5017SWarner Losh 	nvstore_t *st = ptr;
120*d1ea5017SWarner Losh 
121*d1ea5017SWarner Losh 	return (st->nvs_cb->nvs_getter(st->nvs_data, name, data));
122*d1ea5017SWarner Losh }
123*d1ea5017SWarner Losh 
124*d1ea5017SWarner Losh int
nvstore_set_var(void * ptr,int type,const char * name,void * data,size_t size)125*d1ea5017SWarner Losh nvstore_set_var(void *ptr, int type, const char *name,
126*d1ea5017SWarner Losh     void *data, size_t size)
127*d1ea5017SWarner Losh {
128*d1ea5017SWarner Losh 	nvstore_t *st = ptr;
129*d1ea5017SWarner Losh 
130*d1ea5017SWarner Losh 	return (st->nvs_cb->nvs_setter(st->nvs_data, type, name, data, size));
131*d1ea5017SWarner Losh }
132*d1ea5017SWarner Losh 
133*d1ea5017SWarner Losh int
nvstore_set_var_from_string(void * ptr,const char * type,const char * name,const char * data)134*d1ea5017SWarner Losh nvstore_set_var_from_string(void *ptr, const char *type, const char *name,
135*d1ea5017SWarner Losh     const char *data)
136*d1ea5017SWarner Losh {
137*d1ea5017SWarner Losh 	nvstore_t *st = ptr;
138*d1ea5017SWarner Losh 
139*d1ea5017SWarner Losh 	return (st->nvs_cb->nvs_setter_str(st->nvs_data, type, name, data));
140*d1ea5017SWarner Losh }
141*d1ea5017SWarner Losh 
142*d1ea5017SWarner Losh int
nvstore_unset_var(void * ptr,const char * name)143*d1ea5017SWarner Losh nvstore_unset_var(void *ptr, const char *name)
144*d1ea5017SWarner Losh {
145*d1ea5017SWarner Losh 	nvstore_t *st = ptr;
146*d1ea5017SWarner Losh 
147*d1ea5017SWarner Losh 	return (st->nvs_cb->nvs_unset(st->nvs_data, name));
148*d1ea5017SWarner Losh }
149