keywords
const size_t known_keywords_nb = nitems(keywords);
const size_t idx = fv - keywords;
k = &keywords[0];
next_k = &keywords[i];
t = bsearch(&key, keywords, known_keywords_nb, sizeof(VAR), vcmp);
resolve_alias(&keywords[i]);
const VAR *const end = keywords + known_keywords_nb;
for (v = keywords; v < end; ++v) {
v = bsearch(&key, keywords,
static VAR keywords[] = {
} keywords[] = {
for (i = 0; keywords[i].name != NULL; i++)
if (keywords[i].opcode == code)
return(keywords[i].name);
for (i = 0; keywords[i].name; i++)
if (strcmp(cp, keywords[i].name) == 0)
return keywords[i].opcode;
#define FAIL_TEST(label, keywords) \
opts = sshauthopt_parse(keywords, &errstr); \
#define ARRAY_TEST(label, keywords, var, nvar, val) \
opts = sshauthopt_parse(keywords, &errstr); \
"restrict," keywords ",restrict", &errstr); \
#define PREPARE(label, keyname, keywords) \
key_opts = sshauthopt_parse(keywords, &errstr); \
#define FLAG_CASE(keybase, label, keyname, keywords, mostly_off, var, val) \
PREPARE(keybase " " label, keyname, keywords); \
} keywords[] = {
for (i = 0; keywords[i].name != NULL; i++)
if (keywords[i].opcode == code)
return(keywords[i].name);
for (i = 0; keywords[i].name; i++)
if (strcasecmp(cp, keywords[i].name) == 0) {
*flags = keywords[i].flags;
return keywords[i].opcode;
return (strcmp(k, ((const struct keywords *)e)->k_name));
static const struct keywords keywords[] = {
const struct keywords *p;
p = bsearch(s, keywords, sizeof(keywords)/sizeof(keywords[0]),
sizeof(keywords[0]), kw_cmp);
return (strcasecmp(k, ((const struct keywords *)e)->k_name));
const struct keywords toswords[] = {
const struct keywords *p;
const struct keytab *kt = keywords;
} const keywords[] = {
for (i = 0; keywords[i].name; i++) {
if (strcmp(keywords[i].name, token) != 0) {
last_kw = keywords[i].id;
return (keywords[i].id);
} keywords[] = {
} keywords[] = {
for (c = 0; keywords[c].str != NULL; c++)
if (strcmp(keywords[c].str, nexttok) == 0) {
val = keywords[c].val;
return (keywords[c].tok);
return (strcmp(k, ((const struct keywords *)e)->k_name));
static const struct keywords keywords[] = {
const struct keywords *p;
p = bsearch(s, keywords, sizeof(keywords)/sizeof(keywords[0]),
sizeof(keywords[0]), kw_cmp);