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
|
/*
* tables of names for values defined in constants.h
* Copyright (C) 2012-2017 Paul Wouters <pwouters@redhat.com>
* Copyright (C) 2012 Avesh Agarwal <avagarwa@redhat.com>
* Copyright (C) 1998-2002,2015 D. Hugh Redelmeier.
* Copyright (C) 2016-2017 Andrew Cagney
* Copyright (C) 2017 Vukasin Karadzic <vukasin.karadzic@gmail.com>
* Copyright (C) 2019 Andrew Cagney <cagney@gnu.org>
* Copyright (C) 2020 Yulia Kuzovkova <ukuzovkova@gmail.com>
*
* 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. See <https://www.gnu.org/licenses/gpl2.txt>.
*
* This program 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.
*/
#include <stdio.h>
#include "constants.h" /* for strcaseeq() */
#include "sparse_names.h"
#include "jambuf.h"
/* look up enum names in a sparse_names */
const struct sparse_name *sparse_lookup(const struct sparse_names *names, shunk_t name)
{
for (const struct sparse_name *sn = names->list; sn->name != NULL; sn++) {
if (hunk_strcaseeq(name, sn->name)) {
return sn;
}
}
return NULL;
}
/*
* find or construct a string to describe an sparse value
*/
static const char *find_sparse(const struct sparse_names *sn, unsigned long val, bool shorten)
{
for (const struct sparse_name *p = sn->list; p->name != NULL; p++) {
if (p->value == val) {
if (!shorten ||
sn->prefix == NULL) {
return p->name;
}
size_t pl = strlen(sn->prefix);
if (strneq(p->name, sn->prefix, pl)) {
return p->name + pl;
}
return p->name;
}
}
return NULL;
}
bool sparse_long(const struct sparse_names *sn, unsigned long val, sparse_buf *b)
{
b->buf = find_sparse(sn, val, /*shorten*/false);
if (b->buf != NULL) {
return true;
}
bad_name(val, b);
return false;
}
bool sparse_short(const struct sparse_names *sn, unsigned long val, sparse_buf *b)
{
b->buf = find_sparse(sn, val, /*shorten*/true);
if (b->buf != NULL) {
return true;
}
bad_name(val, b);
return false;
}
size_t jam_sparse_long(struct jambuf *buf, const struct sparse_names *sn, unsigned long val)
{
const char *name = find_sparse(sn, val, /*shorten?*/false);
if (name != NULL) {
return jam_string(buf, name);
}
return jam_bad(buf, sn->prefix, val);
}
size_t jam_sparse_short(struct jambuf *buf, const struct sparse_names *sn, unsigned long val)
{
const char *name = find_sparse(sn, val, /*shorten?*/true);
if (name != NULL) {
return jam_string(buf, name);
}
return jam_bad(buf, sn->prefix, val);
}
const char *str_sparse_long(const struct sparse_names *sn, unsigned long val, sparse_buf *b)
{
sparse_long(sn, val, b);
return b->buf;
}
const char *str_sparse_short(const struct sparse_names *sn, unsigned long val, sparse_buf *b)
{
sparse_short(sn, val, b);
return b->buf;
}
const char *sparse_sparse_name(const struct sparse_sparse_names *ssn, unsigned long v1, unsigned long v2)
{
const struct sparse_sparse_name *ssd = ssn->list;
while (ssd->names != NULL) {
if (ssd->value == v1) {
for (const struct sparse_name *p = ssd->names->list;
p->name != NULL; p++) {
if (p->value == v2) {
return p->name;
}
}
return NULL;
}
ssd++;
}
return NULL;
}
size_t jam_sparse_names(struct jambuf *buf, const struct sparse_names *names, const char *separator)
{
const char *sep = "";
size_t s = 0;
for (const struct sparse_name *i = names->list; i->name != NULL; i++) {
const struct sparse_name *j = names->list;
while (j < i && j->value != i->value) {
j++;
}
/* not a duplicate */
if (i == j) {
s += jam_string(buf, sep);
s += jam_string(buf, i->name);
sep = separator;
}
}
return s;
}
|
