Lines Matching defs:re
275 regex_t *re;
341 if ((re = malloc(sizeof(*re) * __arraycount(handlers))) == NULL)
346 re, &lastcompiled);
363 parse(l, re, &lastcompiled);
376 parse(*argv++, re, &lastcompiled);
388 findhandler(const char *s, int w, regex_t *re, size_t *lastcompiled)
400 j = regcomp(&re[i], p[i].ps_re, REG_EXTENDED);
402 regerror(j, &re[i], eb, sizeof(eb));
407 j = regexec(&re[i], s, 1, &match, 0);
414 regerror(j, &re[i], eb, sizeof(eb));
578 int add, regex_t *re, size_t *lastcompiled)
673 p = findhandler(canonname, 0, re, lastcompiled);
726 1, re, lastcompiled);
819 parse(char *l, regex_t *re, size_t *lastcompiled)
892 print_tree(&name[0], namelen, node, type, 0, re, lastcompiled);
908 if (type != CTLTYPE_NODE && (w = findhandler(canonname, 1, re,
921 print_tree(&name[0], namelen, node, CTLTYPE_NODE, 1, re,
937 print_tree(&name[0], namelen, node, type, 0, re, lastcompiled);
1004 * the name of the thing we're trying to create is first, so
1026 * the string, so we're done, otherwise bite it off at
1207 * type of node we're creating, as can the size