/
kvs_lookup.c
276 lines (256 loc) · 7.77 KB
/
kvs_lookup.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
/*****************************************************************************\
* Copyright (c) 2017 Lawrence Livermore National Security, LLC. Produced at
* the Lawrence Livermore National Laboratory (cf, AUTHORS, DISCLAIMER.LLNS).
* LLNL-CODE-658032 All rights reserved.
*
* This file is part of the Flux resource manager framework.
* For details, see https://github.com/flux-framework.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the license, or (at your option)
* any later version.
*
* Flux is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the IMPLIED WARRANTY OF MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the terms and conditions of the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
* See also: http://www.gnu.org/licenses/
\*****************************************************************************/
#if HAVE_CONFIG_H
#include "config.h"
#endif
#include <assert.h>
#include <errno.h>
#include <stdlib.h>
#include <jansson.h>
#include <czmq.h>
#include <flux/core.h>
#include "kvs_lookup.h"
#include "treeobj.h"
struct lookup_ctx {
int flags;
json_t *treeobj;
char *treeobj_str; // json_dumps of tree object returned from lookup
void *val_data; // result of base64 decode of val object data
int val_len;
bool val_valid;
json_t *val_obj;
};
static const char *auxkey = "flux::lookup_ctx";
static void free_ctx (struct lookup_ctx *ctx)
{
if (ctx) {
free (ctx->treeobj_str);
free (ctx->val_data);
json_decref (ctx->val_obj);
free (ctx);
}
}
static struct lookup_ctx *alloc_ctx (void)
{
struct lookup_ctx *ctx;
if (!(ctx = calloc (1, sizeof (*ctx)))) {
errno = ENOMEM;
return NULL;
}
return ctx;
}
static int validate_lookup_flags (int flags)
{
switch (flags) {
case 0:
case FLUX_KVS_TREEOBJ:
case FLUX_KVS_READDIR:
case FLUX_KVS_READDIR | FLUX_KVS_TREEOBJ:
case FLUX_KVS_READLINK:
return 0;
default:
return -1;
}
}
flux_future_t *flux_kvs_lookup (flux_t *h, int flags, const char *key)
{
struct lookup_ctx *ctx;
flux_future_t *f;
if (!h || !key || strlen (key) == 0 || validate_lookup_flags (flags) < 0) {
errno = EINVAL;
return NULL;
}
if (!(ctx = alloc_ctx ()))
return NULL;
ctx->flags = flags;
if (!(f = flux_rpc_pack (h, "kvs.get", FLUX_NODEID_ANY, 0, "{s:s s:i}",
"key", key,
"flags", flags))) {
free_ctx (ctx);
return NULL;
}
if (flux_future_aux_set (f, auxkey, ctx, (flux_free_f)free_ctx) < 0) {
free_ctx (ctx);
flux_future_destroy (f);
return NULL;
}
return f;
}
flux_future_t *flux_kvs_lookupat (flux_t *h, int flags, const char *key,
const char *treeobj)
{
flux_future_t *f;
json_t *obj = NULL;
struct lookup_ctx *ctx;
if (!h || !key || strlen (key) == 0 || validate_lookup_flags (flags) < 0) {
errno = EINVAL;
return NULL;
}
if (!(ctx = alloc_ctx ()))
return NULL;
ctx->flags = flags;
if (!treeobj) {
if (!(f = flux_kvs_lookup (h, flags, key))) {
free_ctx (ctx);
return NULL;
}
}
else {
if (!(obj = json_loads (treeobj, 0, NULL))) {
errno = EINVAL;
return NULL;
}
if (!(f = flux_rpc_pack (h, "kvs.get", FLUX_NODEID_ANY, 0,
"{s:s s:i s:O}", "key", key,
"flags", flags,
"rootdir", obj))) {
free_ctx (ctx);
json_decref (obj);
return NULL;
}
}
if (flux_future_aux_set (f, auxkey, ctx, (flux_free_f)free_ctx) < 0) {
free_ctx (ctx);
json_decref (obj);
flux_future_destroy (f);
return NULL;
}
json_decref (obj);
return f;
}
int flux_kvs_lookup_get (flux_future_t *f, const char **json_str)
{
struct lookup_ctx *ctx;
if (!(ctx = flux_future_aux_get (f, auxkey))) {
errno = EINVAL;
return -1;
}
if (!(ctx->treeobj)) {
if (flux_rpc_get_unpack (f, "{s:o}", "val", &ctx->treeobj) < 0)
return -1;
}
/* If TREEOBJ or READDIR flags, val is a tree object.
* Re-encode as a string and return.
*/
if ((ctx->flags & FLUX_KVS_TREEOBJ) || (ctx->flags & FLUX_KVS_READDIR)) {
if (!ctx->treeobj_str) {
size_t flags = JSON_ENCODE_ANY | JSON_COMPACT | JSON_SORT_KEYS;
if (!(ctx->treeobj_str = json_dumps (ctx->treeobj, flags))) {
errno = EINVAL;
return -1;
}
}
if (json_str)
*json_str = ctx->treeobj_str;
}
/* If SYMLINK flag, extract link target from symlink object
* and return it directly.
*/
else if ((ctx->flags & FLUX_KVS_READLINK)) {
if (!treeobj_is_symlink (ctx->treeobj)) {
errno = EINVAL;
return -1;
}
if (json_str) {
json_t *str = treeobj_get_data (ctx->treeobj);
const char *s = json_string_value (str);
if (!s) {
errno = EINVAL;
return -1;
}
*json_str = s;
}
}
/* No flags, val is a 'val' object.
* Decide the data and return it as a string if it is properly terminated.
*/
else {
if (!ctx->val_valid) {
if (treeobj_decode_val (ctx->treeobj, &ctx->val_data,
&ctx->val_len) < 0)
return -1;
ctx->val_valid = true;
char *s = ctx->val_data;
if (ctx->val_len < 1 || s[ctx->val_len - 1] != '\0') {
errno = EINVAL;
return -1;
}
if (json_str)
*json_str = s;
}
}
return 0;
}
int flux_kvs_lookup_get_unpack (flux_future_t *f, const char *fmt, ...)
{
struct lookup_ctx *ctx;
va_list ap;
int rc;
if (!(ctx = flux_future_aux_get (f, auxkey))) {
errno = EINVAL;
return -1;
}
if (!ctx->val_obj) {
const char *json_str;
if (flux_kvs_lookup_get (f, &json_str) < 0)
return -1;
if (!(ctx->val_obj = json_loads (json_str, JSON_DECODE_ANY, NULL))) {
errno = EINVAL;
return -1;
}
}
va_start (ap, fmt);
if ((rc = json_vunpack_ex (ctx->val_obj, NULL, 0, fmt, ap) < 0))
errno = EINVAL;
va_end (ap);
return rc;
}
int flux_kvs_lookup_get_raw (flux_future_t *f, const void **data, int *len)
{
struct lookup_ctx *ctx;
if (!(ctx = flux_future_aux_get (f, auxkey))) {
errno = EINVAL;
return -1;
}
if (!(ctx->treeobj)) {
if (flux_rpc_get_unpack (f, "{s:o}", "val", &ctx->treeobj) < 0) {
errno = EINVAL;
return -1;
}
}
if (!ctx->val_valid) {
if (treeobj_decode_val (ctx->treeobj, &ctx->val_data,
&ctx->val_len) < 0)
return -1;
ctx->val_valid = true;
}
if (data)
*data = ctx->val_data;
if (len)
*len = ctx->val_len;
return 0;
}
/*
* vi:tabstop=4 shiftwidth=4 expandtab
*/