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
|
/* Test attribute iterators.
Copyright (C) 2016 Petr Tesarik <ptesarik@suse.com>
This file is free software; you can redistribute it and/or modify
it under the terms of either
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at
your option) any later version
or
* 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
or both in parallel, as here.
libkdumpfile 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 GNU
General Public License for more details.
You should have received copies of the GNU General Public License and
the GNU Lesser General Public License along with this program. If
not, see <http://www.gnu.org/licenses/>.
*/
#include <string.h>
#include <stdio.h>
#include <libkdumpfile/kdumpfile.h>
#include "testutil.h"
struct attrdef {
const char *name;
const char *value;
};
#define ATTRPATH "linux.uts"
#define NOPATH "nonexistent.path"
static const struct attrdef attrs[] = {
{ "sysname", "Linux" },
{ "nodename", "testnode" },
{ "release", "3.0.0-test" },
{ "version", "#1 SMP Mon Mar 14 14:08:28 UTC 2016" },
{ "machine", "x86_64" },
{ "domainname", "(none)" },
};
#define MAXATTRLEN 32
int
main(int argc, char **argv)
{
kdump_ctx_t *ctx;
kdump_attr_iter_t it;
kdump_attr_t attr;
unsigned seen[ARRAY_SIZE(attrs)];
unsigned i;
kdump_status res;
int rc;
ctx = kdump_new();
if (!ctx) {
perror("Cannot initialize dump context");
return TEST_ERR;
}
/* Non-existent path must fail. */
res = kdump_attr_iter_start(ctx, NOPATH, &it);
if (res == KDUMP_OK) {
fprintf(stderr, "Found non-existent path %s??\n", NOPATH);
return TEST_FAIL;
} else if (res != KDUMP_ERR_NOKEY) {
fprintf(stderr, "Unexpected error for %s: %s\n",
NOPATH, kdump_get_err(ctx));
return TEST_FAIL;
}
/* Set the values and verify that all keys are found. */
for (i = 0; i < ARRAY_SIZE(attrs); ++i) {
const struct attrdef *ad = &attrs[i];
char key[MAXATTRLEN];
sprintf(key, "%s.%s", ATTRPATH, ad->name);
attr.type = KDUMP_STRING;
attr.val.string = ad->value;
res = kdump_set_attr(ctx, key, &attr);
if (res != KDUMP_OK) {
fprintf(stderr, "Cannot set %s: %s\n",
key, kdump_get_err(ctx));
return TEST_FAIL;
}
}
res = kdump_attr_iter_start(ctx, ATTRPATH, &it);
if (res != KDUMP_OK) {
fprintf(stderr, "Cannot start iteration: %s\n",
kdump_get_err(ctx));
return TEST_FAIL;
}
memset(seen, 0, sizeof seen);
rc = TEST_OK;
while (it.key) {
for (i = 0; i < ARRAY_SIZE(attrs); ++i)
if (!strcmp(it.key, attrs[i].name))
break;
if (i >= ARRAY_SIZE(attrs)) {
fprintf(stderr, "Unknown key: %s\n", it.key);
rc = TEST_FAIL;
} else {
if (seen[i]) {
fprintf(stderr, "Duplicate key: %s\n",
it.key);
rc = TEST_FAIL;
} else
seen[i] = 1;
res = kdump_attr_ref_get(ctx, &it.pos, &attr);
if (res != KDUMP_OK) {
fprintf(stderr, "Cannot get value of %s: %s\n",
it.key, kdump_get_err(ctx));
rc = TEST_FAIL;
} else if (attr.type != KDUMP_STRING) {
fprintf(stderr, "Wrong type: %d\n", attr.type);
rc = TEST_FAIL;
} else if (strcmp(attrs[i].value, attr.val.string)) {
fprintf(stderr, "Value mismatch for %s:"
" expect %s, found %s\n",
it.key, attrs[i].value,
attr.val.string);
rc = TEST_FAIL;
} else
printf("%s = %s\n", it.key, attr.val.string);
kdump_attr_discard(ctx, &attr);
}
res = kdump_attr_iter_next(ctx, &it);
if (res != KDUMP_OK) {
fprintf(stderr, "Cannot advance iterator: %s\n",
kdump_get_err(ctx));
rc = TEST_FAIL;
break;
}
}
res = kdump_attr_iter_next(ctx, &it);
if (res == KDUMP_OK) {
fprintf(stderr, "Advancing past end succeeds??\n");
rc = TEST_FAIL;
} else if (res != KDUMP_ERR_INVALID) {
fprintf(stderr, "Unexpected error advancing past end: %s\n",
kdump_get_err(ctx));
rc = TEST_FAIL;
}
kdump_attr_iter_end(ctx, &it);
for (i = 0; i < ARRAY_SIZE(attrs); ++i)
if (!seen[i]) {
fprintf(stderr, "Key not found: %s.%s\n",
ATTRPATH, attrs[i].name);
rc = TEST_FAIL;
}
kdump_free(ctx);
return rc;
}
|
