busybox/sed.c

181 lines
3.8 KiB
C
Raw Normal View History

1999-10-28 21:36:25 +05:30
/*
* Mini sed implementation for busybox
*
*
* Copyright (C) 1999 by Lineo, inc.
* Written by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "internal.h"
#include "regexp.h"
#include <stdio.h>
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <signal.h>
#include <time.h>
#include <ctype.h>
static const char sed_usage[] =
"sed [-n] [-e script] [file...]\n"
1999-10-29 05:37:31 +05:30
"Allowed scripts come in the following form:\n\n"
1999-10-28 21:36:25 +05:30
"'s/regexp/replacement/[gp]'\n"
"\tattempt to match regexp against the pattern space\n"
1999-10-29 05:37:31 +05:30
"\tand if successful replaces the matched portion with replacement.\n\n"
1999-10-28 21:36:25 +05:30
"Options:\n"
"-e\tadd the script to the commands to be executed\n"
"-n\tsuppress automatic printing of pattern space\n\n"
#if defined BB_REGEXP
"This version of sed matches full regexps.\n";
#else
"This version of sed matches strings (not full regexps).\n";
#endif
extern int sed_main (int argc, char **argv)
{
FILE *fp;
1999-10-29 05:37:31 +05:30
char *needle=NULL, *newNeedle=NULL;
char *name;
char *cp;
1999-10-28 21:36:25 +05:30
int ignoreCase=FALSE;
1999-10-29 05:37:31 +05:30
int foundOne=FALSE;
1999-10-30 04:39:13 +05:30
int printFlag=FALSE;
int quietFlag=FALSE;
1999-10-29 05:37:31 +05:30
int stopNow;
char *haystack;
1999-10-28 21:36:25 +05:30
argc--;
argv++;
if (argc < 1) {
1999-10-29 05:37:31 +05:30
usage(sed_usage);
1999-10-28 21:36:25 +05:30
}
if (**argv == '-') {
argc--;
cp = *argv++;
1999-10-29 05:37:31 +05:30
stopNow=FALSE;
1999-10-28 21:36:25 +05:30
1999-10-29 05:37:31 +05:30
while (*++cp && stopNow==FALSE)
1999-10-28 21:36:25 +05:30
switch (*cp) {
case 'n':
1999-10-30 04:39:13 +05:30
quietFlag = TRUE;
1999-10-28 21:36:25 +05:30
break;
case 'e':
1999-10-29 05:37:31 +05:30
if (*(cp+1)==0 && --argc < 0) {
fprintf(stderr, "A\n");
usage( sed_usage);
1999-10-28 21:36:25 +05:30
}
1999-10-29 05:37:31 +05:30
cp = *argv++;
while( *cp ) {
if (*cp == 's' && strlen(cp) > 3 && *(cp+1) == '/') {
char* pos=needle=cp+2;
for(;;) {
pos = strchr(pos, '/');
if (pos==NULL) {
fprintf(stderr, "B\n");
usage( sed_usage);
}
if (*(pos-1) == '\\') {
pos++;
continue;
}
break;
}
*pos=0;
newNeedle=++pos;
for(;;) {
pos = strchr(pos, '/');
if (pos==NULL) {
fprintf(stderr, "C\n");
usage( sed_usage);
}
if (*(pos-1) == '\\') {
pos++;
continue;
}
break;
}
*pos=0;
1999-10-30 04:39:13 +05:30
if (pos+2 != 0) {
while (*++pos) {
fprintf(stderr, "pos='%s'\n", pos);
switch (*pos) {
case 'i':
ignoreCase=TRUE;
break;
case 'p':
printFlag=TRUE;
break;
case 'g':
break;
default:
usage( sed_usage);
}
}
}
1999-10-29 05:37:31 +05:30
}
cp++;
1999-10-28 21:36:25 +05:30
}
1999-10-29 05:37:31 +05:30
fprintf(stderr, "replace '%s' with '%s'\n", needle, newNeedle);
stopNow=TRUE;
1999-10-28 21:36:25 +05:30
break;
default:
1999-10-29 05:37:31 +05:30
fprintf(stderr, "D\n");
usage(sed_usage);
1999-10-28 21:36:25 +05:30
}
}
while (argc-- > 0) {
name = *argv++;
fp = fopen (name, "r");
if (fp == NULL) {
perror (name);
continue;
}
1999-10-30 04:39:13 +05:30
haystack = (char*)malloc( 1024);
while (fgets (haystack, 1023, fp)) {
1999-10-28 21:36:25 +05:30
1999-10-29 05:37:31 +05:30
foundOne = replace_match(haystack, needle, newNeedle, ignoreCase);
1999-10-30 04:39:13 +05:30
if (foundOne==TRUE && printFlag==TRUE)
fputs (haystack, stdout);
if (quietFlag==FALSE)
1999-10-29 05:37:31 +05:30
fputs (haystack, stdout);
/* Avoid any mem leaks */
free(haystack);
haystack = (char*)malloc( BUF_SIZE);
1999-10-28 21:36:25 +05:30
}
if (ferror (fp))
perror (name);
fclose (fp);
}
exit( TRUE);
}
/* END CODE */