nsxiv/util.c

214 lines
4.3 KiB
C
Raw Normal View History

2021-10-28 10:41:16 +00:00
/* Copyright 2011-2020 Bert Muennich
* Copyright 2021 nsxiv contributors
2011-02-03 09:15:01 +00:00
*
* This file is a part of nsxiv.
*
* nsxiv is free software; you can redistribute it and/or modify
2013-02-08 20:52:41 +00:00
* 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.
*
* nsxiv is distributed in the hope that it will be useful,
2013-02-08 20:52:41 +00:00
* 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 nsxiv. If not, see <http://www.gnu.org/licenses/>.
2011-02-03 09:15:01 +00:00
*/
#include "nsxiv.h"
2011-02-03 09:15:01 +00:00
#include <stdlib.h>
2011-02-14 16:51:04 +00:00
#include <string.h>
2011-04-07 15:29:59 +00:00
#include <sys/types.h>
#include <sys/stat.h>
2011-04-07 12:33:57 +00:00
#include <unistd.h>
#include <errno.h>
2011-02-03 09:15:01 +00:00
const char *progname;
2011-02-03 09:15:01 +00:00
void* emalloc(size_t size)
{
2011-02-03 09:15:01 +00:00
void *ptr;
2011-09-29 10:43:36 +00:00
ptr = malloc(size);
if (ptr == NULL)
error(EXIT_FAILURE, errno, NULL);
2011-02-03 09:15:01 +00:00
return ptr;
}
void* erealloc(void *ptr, size_t size)
{
2011-09-29 10:43:36 +00:00
ptr = realloc(ptr, size);
if (ptr == NULL)
error(EXIT_FAILURE, errno, NULL);
2011-02-03 09:15:01 +00:00
return ptr;
}
char* estrdup(const char *s)
{
char *d;
size_t n = strlen(s) + 1;
2011-08-17 22:38:55 +00:00
d = malloc(n);
if (d == NULL)
error(EXIT_FAILURE, errno, NULL);
memcpy(d, s, n);
2011-08-17 22:38:55 +00:00
return d;
}
void error(int eval, int err, const char* fmt, ...)
{
va_list ap;
if (eval == 0 && options->quiet)
return;
fflush(stdout);
fprintf(stderr, "%s: ", progname);
va_start(ap, fmt);
if (fmt != NULL)
vfprintf(stderr, fmt, ap);
va_end(ap);
if (err != 0)
fprintf(stderr, "%s%s", fmt != NULL ? ": " : "", strerror(err));
fputc('\n', stderr);
if (eval != 0)
exit(eval);
2011-02-03 09:15:01 +00:00
}
2011-02-03 13:32:02 +00:00
void size_readable(float *size, const char **unit)
{
2011-02-03 13:32:02 +00:00
const char *units[] = { "", "K", "M", "G" };
unsigned int i;
2011-02-03 13:32:02 +00:00
2011-09-10 16:41:20 +00:00
for (i = 0; i < ARRLEN(units) && *size > 1024.0; i++)
*size /= 1024.0;
*unit = units[MIN(i, ARRLEN(units) - 1)];
}
int r_opendir(r_dir_t *rdir, const char *dirname, bool recursive)
{
2015-10-28 19:59:48 +00:00
if (*dirname == '\0')
return -1;
2011-09-29 10:43:36 +00:00
if ((rdir->dir = opendir(dirname)) == NULL) {
rdir->name = NULL;
rdir->stack = NULL;
return -1;
}
rdir->stcap = 512;
rdir->stack = emalloc(rdir->stcap * sizeof(char*));
rdir->stlen = 0;
rdir->name = (char*) dirname;
rdir->d = 0;
rdir->recursive = recursive;
return 0;
}
int r_closedir(r_dir_t *rdir)
{
int ret = 0;
2011-09-29 10:43:36 +00:00
if (rdir->stack != NULL) {
while (rdir->stlen > 0)
free(rdir->stack[--rdir->stlen]);
free(rdir->stack);
rdir->stack = NULL;
}
2011-09-29 10:43:36 +00:00
if (rdir->dir != NULL) {
if ((ret = closedir(rdir->dir)) == 0)
rdir->dir = NULL;
}
if (rdir->d != 0) {
free(rdir->name);
rdir->name = NULL;
}
return ret;
}
char* r_readdir(r_dir_t *rdir, bool skip_dotfiles)
{
size_t len;
char *filename;
struct dirent *dentry;
struct stat fstats;
2011-09-29 10:43:36 +00:00
while (true) {
if (rdir->dir != NULL && (dentry = readdir(rdir->dir)) != NULL) {
if (dentry->d_name[0] == '.') {
if (skip_dotfiles)
continue;
if (dentry->d_name[1] == '\0')
continue;
if (dentry->d_name[1] == '.' && dentry->d_name[2] == '\0')
continue;
}
len = strlen(rdir->name) + strlen(dentry->d_name) + 2;
filename = emalloc(len);
snprintf(filename, len, "%s%s%s", rdir->name,
rdir->name[strlen(rdir->name)-1] == '/' ? "" : "/",
dentry->d_name);
2011-09-29 10:43:36 +00:00
if (stat(filename, &fstats) < 0)
continue;
if (S_ISDIR(fstats.st_mode)) {
/* put subdirectory on the stack */
if (rdir->stlen == rdir->stcap) {
rdir->stcap *= 2;
rdir->stack = erealloc(rdir->stack,
rdir->stcap * sizeof(char*));
}
rdir->stack[rdir->stlen++] = filename;
continue;
}
return filename;
}
if (rdir->recursive && rdir->stlen > 0) {
/* open next subdirectory */
closedir(rdir->dir);
2011-09-29 10:43:36 +00:00
if (rdir->d != 0)
free(rdir->name);
rdir->name = rdir->stack[--rdir->stlen];
rdir->d = 1;
2011-09-29 10:43:36 +00:00
if ((rdir->dir = opendir(rdir->name)) == NULL)
error(0, errno, "%s", rdir->name);
continue;
}
/* no more entries */
break;
}
return NULL;
}
2015-10-28 22:21:12 +00:00
int r_mkdir(char *path)
{
2015-10-28 22:21:12 +00:00
char c, *s = path;
struct stat st;
2011-04-07 15:29:59 +00:00
2015-10-28 22:21:12 +00:00
while (*s != '\0') {
if (*s == '/') {
s++;
continue;
2011-04-07 15:29:59 +00:00
}
2015-10-28 22:21:12 +00:00
for (; *s != '\0' && *s != '/'; s++);
c = *s;
*s = '\0';
if (mkdir(path, 0755) == -1)
if (errno != EEXIST || stat(path, &st) == -1 || !S_ISDIR(st.st_mode))
return -1;
*s = c;
2011-04-07 15:29:59 +00:00
}
2015-10-28 22:21:12 +00:00
return 0;
2011-04-07 15:29:59 +00:00
}