sbase/grep.c

168 lines
3.0 KiB
C
Raw Normal View History

2011-05-23 01:36:34 +00:00
/* See LICENSE file for copyright and license details. */
#include <regex.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
2011-05-24 00:13:34 +00:00
#include <unistd.h>
2011-05-25 19:40:47 +00:00
#include "text.h"
2011-06-18 05:42:24 +00:00
#include "util.h"
enum { Match = 0, NoMatch = 1, Error = 2 };
2011-05-23 01:36:34 +00:00
2013-09-27 15:26:22 +00:00
static void addpattern(const char *);
static int grep(FILE *, const char *);
2011-05-23 01:36:34 +00:00
2013-09-27 15:26:22 +00:00
static bool eflag = false;
2011-05-23 01:36:34 +00:00
static bool vflag = false;
static bool many;
static char mode = 0;
2013-09-27 15:26:22 +00:00
static struct plist {
char *pattern;
regex_t preg;
2013-09-27 15:26:22 +00:00
struct plist *next;
} *phead;
static void
usage(void)
{
enprintf(Error, "usage: %s [-Ecilnqv] [-e pattern] pattern [files...]\n", argv0);
}
2011-05-23 01:36:34 +00:00
int
main(int argc, char *argv[])
{
2013-09-27 15:26:22 +00:00
struct plist *pnode, *tmp;
int i, n, m, flags = REG_NOSUB, match = NoMatch;
char buf[BUFSIZ];
2011-05-23 01:36:34 +00:00
FILE *fp;
2012-05-31 18:38:25 +00:00
ARGBEGIN {
case 'E':
flags |= REG_EXTENDED;
break;
2013-09-27 15:26:22 +00:00
case 'e':
addpattern(EARGF(usage()));
eflag = true;
break;
2014-11-02 03:08:13 +00:00
case 'c':
2012-05-31 18:38:25 +00:00
case 'l':
case 'n':
case 'q':
2012-06-09 17:49:02 +00:00
mode = ARGC();
2012-05-31 18:38:25 +00:00
break;
case 'i':
flags |= REG_ICASE;
break;
case 'v':
vflag = true;
break;
default:
usage();
} ARGEND;
2011-05-23 01:36:34 +00:00
2013-09-27 15:26:22 +00:00
if(argc == 0 && !eflag)
usage(); /* no pattern */
2012-05-31 18:38:25 +00:00
2013-09-27 15:26:22 +00:00
/* If -e is not specified treat it as if it were */
if(!eflag) {
addpattern(argv[0]);
argc--;
argv++;
}
/* Compile regex for all search patterns */
for(pnode = phead; pnode; pnode = pnode->next) {
if((n = regcomp(&pnode->preg, pnode->pattern, flags)) != 0) {
regerror(n, &pnode->preg, buf, sizeof buf);
enprintf(Error, "invalid pattern: %s\n", buf);
}
}
2012-05-31 18:38:25 +00:00
many = (argc > 1);
2013-09-27 15:26:22 +00:00
if(argc == 0) {
match = grep(stdin, "<stdin>");
2013-09-27 15:26:22 +00:00
} else {
for(i = 0; i < argc; i++) {
if(!(fp = fopen(argv[i], "r"))) {
weprintf("fopen %s:", argv[i]);
match = Error;
continue;
}
m = grep(fp, argv[i]);
if(m == Error || (match != Error && m == Match))
match = m;
2013-09-27 15:26:22 +00:00
fclose(fp);
}
}
pnode = phead;
while(pnode) {
tmp = pnode->next;
regfree(&pnode->preg);
2013-09-27 15:26:22 +00:00
free(pnode->pattern);
free(pnode);
pnode = tmp;
2011-05-23 01:36:34 +00:00
}
return match;
2011-05-23 01:36:34 +00:00
}
static void
2013-09-27 15:26:22 +00:00
addpattern(const char *pattern)
{
struct plist *pnode;
if(!(pnode = malloc(sizeof(*pnode))))
2013-09-27 15:26:22 +00:00
eprintf("malloc:");
if(!(pnode->pattern = strdup(pattern)))
2013-09-27 15:26:22 +00:00
eprintf("strdup:");
pnode->next = phead;
phead = pnode;
}
static int
grep(FILE *fp, const char *str)
2011-05-23 01:36:34 +00:00
{
2011-05-25 19:40:47 +00:00
char *buf = NULL;
size_t len = 0, size = 0;
long c = 0, n;
2013-09-27 15:26:22 +00:00
struct plist *pnode;
int match = NoMatch;
2011-05-23 01:36:34 +00:00
for(n = 1; (len = agetline(&buf, &size, fp)) != -1; n++) {
/* Remove the trailing newline if one is present. */
if (len && buf[len - 1] == '\n')
buf[len - 1] = '\0';
2013-09-27 15:26:22 +00:00
for(pnode = phead; pnode; pnode = pnode->next) {
if(regexec(&pnode->preg, buf, 0, NULL, 0) ^ vflag)
2013-09-27 15:26:22 +00:00
continue;
switch(mode) {
case 'c':
c++;
break;
case 'l':
puts(str);
goto end;
case 'q':
exit(Match);
default:
if(many)
printf("%s:", str);
if(mode == 'n')
printf("%ld:", n);
puts(buf);
2013-09-27 15:26:22 +00:00
break;
}
match = Match;
2011-05-23 01:36:34 +00:00
}
}
if(mode == 'c')
2011-05-25 19:40:47 +00:00
printf("%ld\n", c);
end:
if(ferror(fp)) {
weprintf("%s: read error:", str);
match = Error;
}
2011-05-25 19:40:47 +00:00
free(buf);
2013-09-27 15:26:22 +00:00
return match;
2011-05-23 01:36:34 +00:00
}