aboutsummaryrefslogtreecommitdiff
path: root/core/rm.c
blob: fdfdae5097fe16354bd2f2a6747684622e2e8194 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*	rm - remove files.
 *	Copyright (C) 2022 Ferass EL HAFIDI
 *
 *	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 3 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, see <https://www.gnu.org/licenses/>.
 */

#include <unistd.h>
#include <stdio.h>
#include <errno.h>
#include "version.h"

#ifndef COMPILETIME
#define COMPILETIME
#endif

int  getopt(int argc, char *const argv[], const char *optstring);
void printUsage();

int main(int argc, char *const argv[]) {
	int argument, i = 1;
	char param[256];

	while ((argument = getopt(argc, argv, "Rr")) != -1) {
		if (argument == '?') {
			printUsage();
			return 1;
		}
		param[argument] = argument;
	}
	if (argc <= 1) {
		printUsage();
		return 1;
	}

	for (; i < argc; i++) {
		if (!param['r'] || !param['R']) unlink(argv[i]);
		else                            remove(argv[i]); /* TODO: Actually 
		                                                  * recursively remove 
		                                                  * the directory */
	}

	if (errno) return errno;
	return 0;
}

void printUsage() {
	printf("Ferass' Base System. (%s)\n\n"
	"Usage: rm [-Rr] file ...\n\n"
	"Remove <file>.\n\n"
	"\t-R\tRecursively remove the directory tree\n"
	"\t-r\tEnable the -R option\n", COMPILETIME);
}