keywords
tp = mytsearch(&keywords, id, hash(id));
glob_table(pat, &w, &keywords);
if ((cf & KEYWORD) && (p = mytsearch(&keywords, ident, h))
tinit(&keywords, APERM, 32); /* must be 2^n (currently 20 keywords) */
p = tenter(&keywords, tt->name, hash(tt->name));
EXTERN struct table keywords; /* keywords */
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);
if (*(str += keywords[i].len) == ':')
} keywords[] = {
static const size_t nkeywords = sizeof (keywords) / sizeof (keywords[0]);
if (memcmp(str, keywords[i].keyword, keywords[i].len)
(*(str + keywords[i].len) == ':' ||
*(str + keywords[i].len) == '\0'))
struct keytab keywords[] = {
} keywords[];
struct keytab *kt = keywords;
const char *keywords[3+1];
keywords[i] = "dbname";
keywords[i] = "user";
keywords[i] = "application_name";
keywords[i] = NULL;
conn = PQconnectdbParams(keywords, values, 0);
const struct keyword *kw = bsearch(token.s, keywords,
array_length(keywords), sizeof(keywords[0]), cmp_keyword_by_name);
} keywords[] = {
} keywords[] = {
size_t n = sizeof(keywords) / sizeof(keywords[0]);
const struct keyword *kw = keywords + i;