2 * This file is part of secnet.
3 * See README for full list of copyright holders.
5 * secnet is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or
8 * (at your option) any later version.
10 * secnet is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * version 3 along with secnet; if not, see
17 * https://www.gnu.org/licenses/gpl.html.
23 #define DEFAULT_SIZE 5
27 struct sigprivkey_if *sigpriv; /* 0 means none such */
32 struct privcache_if ops;
34 struct pathprefix_template path;
36 struct buffer_if databuf;
37 struct hash_if *defhash;
40 static struct sigprivkey_if *uncached_load_file(
41 const struct sigscheme_info *scheme,
43 struct buffer_if *databuf,
44 struct hash_if *defhash,
47 static struct sigprivkey_if *uncached_get(struct privcache *st,
48 const struct sigkeyid *id, struct log_if *log)
50 sprintf(st->path.write_here, SIGKEYID_PR_FMT, SIGKEYID_PR_VAL(id));
52 const char *path=st->path.buffer;
53 const struct sigscheme_info *scheme;
54 for (scheme=sigschemes;
57 if (scheme->algid == id->b[GRPIDSZ])
60 slilog(log,M_ERR,"private key file %s not loaded (unknown algid)",
65 return uncached_load_file(scheme,
72 static struct sigprivkey_if *uncached_load_file(
73 const struct sigscheme_info *scheme,
75 struct buffer_if *databuf,
76 struct hash_if *defhash,
81 struct sigprivkey_if *sigpriv=0;
85 if (errno == ENOENT) {
86 slilog(log,M_DEBUG,"private key %s not found",
89 slilog(log,M_ERR,"failed to open private key file %s",
96 buffer_init(databuf,0);
97 ssize_t got=fread(databuf->base,1,databuf->alloclen,f);
99 slilog(log,M_ERR,"failed to read private-key file %s",
104 slilog(log,M_ERR,"private key file %s longer than max %d",
105 path, (int)databuf->alloclen);
110 databuf->start=databuf->base;
112 struct cloc loc = { .file=path, .line=0 };
113 ok=scheme->loadpriv(scheme, databuf, &sigpriv, log, loc);
114 if (!ok) goto error_out; /* loadpriv will have logged */
116 if (sigpriv->sethash) {
119 "private key %s requires `hash' config key for privcache to load",
123 sigpriv->sethash(sigpriv->st,defhash);
128 return ok ? sigpriv : 0;
131 if (sigpriv) sigpriv->dispose(sigpriv->st);
136 static struct sigprivkey_if *privcache_lookup(void *sst,
137 const struct sigkeyid *id,
138 struct log_if *log) {
139 struct privcache *st = sst;
143 for (was=0; was<st->used; was++) {
144 if (sigkeyid_equal(id, &st->ents[was].id)) {
145 result = st->ents[was];
150 if (st->used < st->alloc) {
155 if (st->ents[was].sigpriv) {
156 st->ents[was].sigpriv->dispose(st->ents[was].sigpriv->st);
160 COPY_OBJ(result.id, *id);
161 result.sigpriv=uncached_get(st,id,log);
164 memmove(&st->ents[1], &st->ents[0], sizeof(st->ents[0]) * was);
165 st->ents[0] = result;
166 return result.sigpriv;
169 static list_t *privcache_apply(closure_t *self, struct cloc loc,
170 dict_t *context, list_t *args)
172 struct privcache *st;
177 st->cl.description="privcache";
178 st->cl.type=CL_PRIVCACHE;
180 st->cl.interface=&st->ops;
182 st->ops.lookup=privcache_lookup;
185 st->used=st->alloc=0;
188 item=list_elem(args,0);
189 if (!item || item->type!=t_dict)
190 cfgfatal(loc,"privcache","parameter must be a dictionary\n");
192 dict=item->data.dict;
194 st->alloc=dict_read_number(dict,"privcache-size",False,"privcache",loc,
196 NEW_ARY(st->ents,st->alloc);
199 int32_t buflen=dict_read_number(dict,"privkey-max",False,"privcache",loc,
201 buffer_new(&st->databuf,buflen+1);
203 const char *path=dict_read_string(dict,"privkeys",True,"privcache",loc);
204 pathprefix_template_init(&st->path,path,KEYIDSZ*2);
206 st->defhash=find_cl_if(dict,"hash",CL_HASH,False,"site",loc);
208 return new_closure(&st->cl);
211 void privcache_module(dict_t *dict)
213 add_closure(dict,"priv-cache",privcache_apply);