mirror of
https://github.com/sudo-project/sudo.git
synced 2025-08-31 22:35:10 +00:00
Top level directory reorg
Move src/po -> po Combine common and compat -> lib/util Move zlib -> lib/zlib
This commit is contained in:
212
lib/util/regress/glob/globtest.c
Normal file
212
lib/util/regress/glob/globtest.c
Normal file
@@ -0,0 +1,212 @@
|
||||
/* $OpenBSD: globtest.c,v 1.1 2008/10/01 23:04:36 millert Exp $ */
|
||||
|
||||
/*
|
||||
* Public domain, 2008, Todd C. Miller <Todd.Miller@courtesan.com>
|
||||
*/
|
||||
|
||||
#include <config.h>
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#ifdef HAVE_STRING_H
|
||||
# include <string.h>
|
||||
#endif /* HAVE_STRING_H */
|
||||
#ifdef HAVE_STRINGS_H
|
||||
# include <strings.h>
|
||||
#endif /* HAVE_STRINGS_H */
|
||||
#ifdef HAVE_GLOB
|
||||
# include <glob.h>
|
||||
#else
|
||||
# include "compat/glob.h"
|
||||
#endif
|
||||
#include <errno.h>
|
||||
|
||||
#include "missing.h"
|
||||
|
||||
#define MAX_RESULTS 256
|
||||
|
||||
struct gl_entry {
|
||||
int flags;
|
||||
int nresults;
|
||||
char pattern[1024];
|
||||
char *results[MAX_RESULTS];
|
||||
};
|
||||
|
||||
int test_glob(struct gl_entry *);
|
||||
__dso_public int main(int argc, char *argv[]);
|
||||
|
||||
int
|
||||
main(int argc, char **argv)
|
||||
{
|
||||
FILE *fp = stdin;
|
||||
char buf[2048], *cp, *ep;
|
||||
int errors = 0, tests = 0, lineno;
|
||||
struct gl_entry entry;
|
||||
size_t len;
|
||||
|
||||
if (argc > 1) {
|
||||
if ((fp = fopen(argv[1], "r")) == NULL) {
|
||||
perror(argv[1]);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Read in test file, which is formatted thusly:
|
||||
*
|
||||
* [pattern] <flags>
|
||||
* result1
|
||||
* result2
|
||||
* result3
|
||||
* ...
|
||||
*
|
||||
*/
|
||||
lineno = 0;
|
||||
memset(&entry, 0, sizeof(entry));
|
||||
while (fgets(buf, sizeof(buf), fp) != NULL) {
|
||||
lineno++;
|
||||
len = strlen(buf);
|
||||
if (len > 0) {
|
||||
if (buf[len - 1] != '\n') {
|
||||
fprintf(stderr,
|
||||
"globtest: missing newline at EOF\n");
|
||||
exit(1);
|
||||
}
|
||||
buf[--len] = '\0';
|
||||
}
|
||||
if (len == 0)
|
||||
continue; /* blank line */
|
||||
|
||||
if (buf[0] == '[') {
|
||||
/* check previous pattern */
|
||||
if (entry.pattern[0]) {
|
||||
errors += test_glob(&entry);
|
||||
tests++;
|
||||
}
|
||||
|
||||
/* start new entry */
|
||||
if ((cp = strrchr(buf + 1, ']')) == NULL) {
|
||||
fprintf(stderr,
|
||||
"globtest: invalid entry on line %d\n",
|
||||
lineno);
|
||||
exit(1);
|
||||
}
|
||||
len = cp - buf - 1;
|
||||
if (len >= sizeof(entry.pattern)) {
|
||||
fprintf(stderr,
|
||||
"globtest: pattern too big on line %d\n",
|
||||
lineno);
|
||||
exit(1);
|
||||
}
|
||||
memcpy(entry.pattern, buf + 1, len);
|
||||
entry.pattern[len] = '\0';
|
||||
|
||||
cp += 2;
|
||||
if (*cp++ != '<') {
|
||||
fprintf(stderr,
|
||||
"globtest: invalid entry on line %d\n",
|
||||
lineno);
|
||||
exit(1);
|
||||
}
|
||||
ep = strchr(cp, '>');
|
||||
if (ep == NULL) {
|
||||
fprintf(stderr,
|
||||
"globtest: invalid entry on line %d\n",
|
||||
lineno);
|
||||
exit(1);
|
||||
}
|
||||
*ep = '\0';
|
||||
entry.flags = 0;
|
||||
for ((cp = strtok(cp, "|")); cp != NULL; (cp = strtok(NULL, "|"))) {
|
||||
if (strcmp(cp, "GLOB_APPEND") == 0)
|
||||
entry.flags |= GLOB_APPEND;
|
||||
else if (strcmp(cp, "GLOB_DOOFFS") == 0)
|
||||
entry.flags |= GLOB_DOOFFS;
|
||||
else if (strcmp(cp, "GLOB_ERR") == 0)
|
||||
entry.flags |= GLOB_ERR;
|
||||
else if (strcmp(cp, "GLOB_MARK") == 0)
|
||||
entry.flags |= GLOB_MARK;
|
||||
else if (strcmp(cp, "GLOB_NOCHECK") == 0)
|
||||
entry.flags |= GLOB_NOCHECK;
|
||||
else if (strcmp(cp, "GLOB_NOSORT") == 0)
|
||||
entry.flags |= GLOB_NOSORT;
|
||||
else if (strcmp(cp, "GLOB_NOESCAPE") == 0)
|
||||
entry.flags |= GLOB_NOESCAPE;
|
||||
else if (strcmp(cp, "GLOB_BRACE") == 0)
|
||||
entry.flags |= GLOB_BRACE;
|
||||
else if (strcmp(cp, "GLOB_TILDE") == 0)
|
||||
entry.flags |= GLOB_TILDE;
|
||||
else if (strcmp(cp, "NONE") != 0) {
|
||||
fprintf(stderr,
|
||||
"globtest: invalid flags on line %d\n",
|
||||
lineno);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
entry.nresults = 0;
|
||||
continue;
|
||||
}
|
||||
if (!entry.pattern[0]) {
|
||||
fprintf(stderr, "globtest: missing entry on line %d\n",
|
||||
lineno);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if (entry.nresults + 1 > MAX_RESULTS) {
|
||||
fprintf(stderr,
|
||||
"globtest: too many results for %s, max %d\n",
|
||||
entry.pattern, MAX_RESULTS);
|
||||
exit(1);
|
||||
}
|
||||
entry.results[entry.nresults++] = strdup(buf);
|
||||
}
|
||||
if (entry.pattern[0]) {
|
||||
errors += test_glob(&entry); /* test last pattern */
|
||||
tests++;
|
||||
}
|
||||
if (tests != 0) {
|
||||
printf("glob: %d test%s run, %d errors, %d%% success rate\n",
|
||||
tests, tests == 1 ? "" : "s", errors,
|
||||
(tests - errors) * 100 / tests);
|
||||
}
|
||||
exit(errors);
|
||||
}
|
||||
|
||||
int test_glob(struct gl_entry *entry)
|
||||
{
|
||||
glob_t gl;
|
||||
char **ap;
|
||||
int nmatches = 0, i = 0;
|
||||
|
||||
if (glob(entry->pattern, entry->flags, NULL, &gl) != 0) {
|
||||
fprintf(stderr, "glob failed: %s: %s\n", entry->pattern,
|
||||
strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
|
||||
for (ap = gl.gl_pathv; *ap != NULL; ap++)
|
||||
nmatches++;
|
||||
|
||||
if (nmatches != entry->nresults)
|
||||
goto mismatch;
|
||||
|
||||
for (i = 0; i < entry->nresults; i++) {
|
||||
if (strcmp(gl.gl_pathv[i], entry->results[i]) != 0)
|
||||
goto mismatch;
|
||||
free(entry->results[i]);
|
||||
}
|
||||
return 0;
|
||||
mismatch:
|
||||
if (nmatches != entry->nresults) {
|
||||
fprintf(stderr,
|
||||
"globtest: mismatch in number of results (found %d, expected %d) for pattern %s\n",
|
||||
nmatches, entry->nresults, entry->pattern);
|
||||
} else {
|
||||
fprintf(stderr, "globtest: mismatch for pattern %s, flags 0x%x "
|
||||
"(found \"%s\", expected \"%s\")\n", entry->pattern, entry->flags,
|
||||
gl.gl_pathv[i], entry->results[i]);
|
||||
while (i < entry->nresults)
|
||||
free(entry->results[i++]);
|
||||
}
|
||||
return 1;
|
||||
}
|
Reference in New Issue
Block a user