2012-10-21 15:02:20 -04:00
|
|
|
/*
|
2012-05-19 16:56:23 -04:00
|
|
|
* common.c
|
2019-11-13 06:11:05 -05:00
|
|
|
* vim: expandtab:ts=4:sts=4:sw=4
|
2012-05-19 16:56:23 -04:00
|
|
|
*
|
2019-01-22 05:31:45 -05:00
|
|
|
* Copyright (C) 2012 - 2019 James Booth <boothj5@gmail.com>
|
2020-01-03 13:52:31 -05:00
|
|
|
* Copyright (C) 2019 - 2020 Michael Vetter <jubalh@iodoru.org>
|
2012-10-21 15:02:20 -04:00
|
|
|
*
|
2012-05-19 16:56:23 -04:00
|
|
|
* This file is part of Profanity.
|
|
|
|
*
|
|
|
|
* Profanity 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.
|
|
|
|
*
|
|
|
|
* Profanity 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
|
2016-07-23 20:14:49 -04:00
|
|
|
* along with Profanity. If not, see <https://www.gnu.org/licenses/>.
|
2012-05-19 16:56:23 -04:00
|
|
|
*
|
2014-08-24 15:57:39 -04:00
|
|
|
* In addition, as a special exception, the copyright holders give permission to
|
|
|
|
* link the code of portions of this program with the OpenSSL library under
|
|
|
|
* certain conditions as described in each individual source file, and
|
|
|
|
* distribute linked combinations including the two.
|
|
|
|
*
|
|
|
|
* You must obey the GNU General Public License in all respects for all of the
|
|
|
|
* code used other than OpenSSL. If you modify file(s) with this exception, you
|
|
|
|
* may extend this exception to your version of the file(s), but you are not
|
|
|
|
* obligated to do so. If you do not wish to do so, delete this exception
|
|
|
|
* statement from your version. If you delete this exception statement from all
|
|
|
|
* source files in the program, then also delete it here.
|
|
|
|
*
|
2012-05-19 16:56:23 -04:00
|
|
|
*/
|
2016-03-31 16:05:02 -04:00
|
|
|
#include "config.h"
|
2012-05-19 16:56:23 -04:00
|
|
|
|
2016-05-11 17:30:39 -04:00
|
|
|
#include <errno.h>
|
2016-01-19 17:51:55 -05:00
|
|
|
#include <sys/select.h>
|
2013-02-10 06:41:30 -05:00
|
|
|
#include <assert.h>
|
2012-08-25 20:50:50 -04:00
|
|
|
#include <stdlib.h>
|
2014-06-01 17:53:30 -04:00
|
|
|
#include <stdint.h>
|
2016-07-12 18:50:21 -04:00
|
|
|
#include <stdio.h>
|
2012-08-22 20:08:06 -04:00
|
|
|
#include <string.h>
|
2013-08-03 07:14:30 -04:00
|
|
|
#include <sys/types.h>
|
2012-08-25 20:50:50 -04:00
|
|
|
#include <sys/stat.h>
|
2012-07-19 16:30:07 -04:00
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
#include <curl/curl.h>
|
|
|
|
#include <curl/easy.h>
|
2013-02-02 15:55:58 -05:00
|
|
|
#include <glib.h>
|
2018-05-07 13:41:47 -04:00
|
|
|
#include <gio/gio.h>
|
2014-06-01 17:42:10 -04:00
|
|
|
|
2016-03-31 16:05:02 -04:00
|
|
|
#ifdef HAVE_NCURSESW_NCURSES_H
|
2016-02-14 17:28:55 -05:00
|
|
|
#include <ncursesw/ncurses.h>
|
2016-03-31 16:05:02 -04:00
|
|
|
#elif HAVE_NCURSES_H
|
2016-02-14 17:28:55 -05:00
|
|
|
#include <ncurses.h>
|
|
|
|
#endif
|
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
#include "log.h"
|
2012-07-19 17:38:46 -04:00
|
|
|
#include "common.h"
|
2012-11-17 21:31:32 -05:00
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
struct curl_data_t
|
|
|
|
{
|
|
|
|
char *buffer;
|
|
|
|
size_t size;
|
|
|
|
};
|
|
|
|
|
|
|
|
static size_t _data_callback(void *ptr, size_t size, size_t nmemb, void *data);
|
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
gboolean
|
2012-07-24 18:19:48 -04:00
|
|
|
create_dir(char *name)
|
2012-07-19 16:30:07 -04:00
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
if (stat(name, &sb) != 0) {
|
|
|
|
if (errno != ENOENT || mkdir(name, S_IRWXU) != 0) {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if ((sb.st_mode & S_IFDIR) != S_IFDIR) {
|
|
|
|
log_debug("create_dir: %s exists and is not a directory!", name);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return TRUE;
|
2012-07-19 16:30:07 -04:00
|
|
|
}
|
2012-08-22 20:08:06 -04:00
|
|
|
|
2013-08-03 07:14:30 -04:00
|
|
|
gboolean
|
2013-02-02 17:06:19 -05:00
|
|
|
mkdir_recursive(const char *dir)
|
|
|
|
{
|
|
|
|
int i;
|
2013-08-03 07:14:30 -04:00
|
|
|
gboolean result = TRUE;
|
|
|
|
|
2013-02-02 17:06:19 -05:00
|
|
|
for (i = 1; i <= strlen(dir); i++) {
|
|
|
|
if (dir[i] == '/' || dir[i] == '\0') {
|
|
|
|
gchar *next_dir = g_strndup(dir, i);
|
2013-08-03 07:14:30 -04:00
|
|
|
result = create_dir(next_dir);
|
2013-02-02 17:06:19 -05:00
|
|
|
g_free(next_dir);
|
2013-08-03 07:14:30 -04:00
|
|
|
if (!result) {
|
|
|
|
break;
|
|
|
|
}
|
2013-02-02 17:06:19 -05:00
|
|
|
}
|
|
|
|
}
|
2013-08-03 07:14:30 -04:00
|
|
|
|
|
|
|
return result;
|
2013-02-02 17:06:19 -05:00
|
|
|
}
|
|
|
|
|
2016-07-12 18:50:21 -04:00
|
|
|
gboolean
|
2018-05-07 13:41:47 -04:00
|
|
|
copy_file(const char *const sourcepath, const char *const targetpath, const gboolean overwrite_existing)
|
2016-07-12 18:50:21 -04:00
|
|
|
{
|
2018-05-07 13:41:47 -04:00
|
|
|
GFile *source = g_file_new_for_path(sourcepath);
|
|
|
|
GFile *dest = g_file_new_for_path(targetpath);
|
|
|
|
GError *error = NULL;
|
2018-08-02 01:51:13 -04:00
|
|
|
GFileCopyFlags flags = overwrite_existing ? G_FILE_COPY_OVERWRITE : G_FILE_COPY_NONE;
|
|
|
|
gboolean success = g_file_copy (source, dest, flags, NULL, NULL, NULL, &error);
|
2020-04-13 20:24:02 -04:00
|
|
|
if (error != NULL)
|
|
|
|
g_error_free(error);
|
2018-08-02 01:51:13 -04:00
|
|
|
g_object_unref(source);
|
|
|
|
g_object_unref(dest);
|
2018-05-07 13:41:47 -04:00
|
|
|
return success;
|
2016-07-12 18:50:21 -04:00
|
|
|
}
|
|
|
|
|
2015-10-25 20:52:33 -04:00
|
|
|
char*
|
2012-10-21 15:02:20 -04:00
|
|
|
str_replace(const char *string, const char *substr,
|
|
|
|
const char *replacement)
|
2012-08-22 20:08:06 -04:00
|
|
|
{
|
|
|
|
char *tok = NULL;
|
|
|
|
char *newstr = NULL;
|
|
|
|
char *head = NULL;
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
if (string == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2012-10-21 15:02:20 -04:00
|
|
|
if ( substr == NULL ||
|
|
|
|
replacement == NULL ||
|
|
|
|
(strcmp(substr, "") == 0))
|
2012-08-22 20:08:06 -04:00
|
|
|
return strdup (string);
|
|
|
|
|
|
|
|
newstr = strdup (string);
|
|
|
|
head = newstr;
|
|
|
|
|
|
|
|
while ( (tok = strstr ( head, substr ))) {
|
2014-04-25 19:36:36 -04:00
|
|
|
char *oldstr = newstr;
|
2012-10-21 15:02:20 -04:00
|
|
|
newstr = malloc ( strlen ( oldstr ) - strlen ( substr ) +
|
2012-08-22 20:08:06 -04:00
|
|
|
strlen ( replacement ) + 1 );
|
2012-10-21 15:02:20 -04:00
|
|
|
|
|
|
|
if ( newstr == NULL ) {
|
2012-08-22 20:08:06 -04:00
|
|
|
free (oldstr);
|
|
|
|
return NULL;
|
|
|
|
}
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
memcpy ( newstr, oldstr, tok - oldstr );
|
|
|
|
memcpy ( newstr + (tok - oldstr), replacement, strlen ( replacement ) );
|
2012-10-21 15:02:20 -04:00
|
|
|
memcpy ( newstr + (tok - oldstr) + strlen( replacement ),
|
|
|
|
tok + strlen ( substr ),
|
2012-08-22 20:08:06 -04:00
|
|
|
strlen ( oldstr ) - strlen ( substr ) - ( tok - oldstr ) );
|
2012-10-21 15:02:20 -04:00
|
|
|
memset ( newstr + strlen ( oldstr ) - strlen ( substr ) +
|
2012-08-22 20:08:06 -04:00
|
|
|
strlen ( replacement ) , 0, 1 );
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
head = newstr + (tok - oldstr) + strlen( replacement );
|
|
|
|
free (oldstr);
|
|
|
|
}
|
2012-10-21 15:02:20 -04:00
|
|
|
|
2012-08-22 20:08:06 -04:00
|
|
|
return newstr;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2015-01-16 17:50:40 -05:00
|
|
|
str_contains(const char str[], int size, char ch)
|
2012-08-22 20:08:06 -04:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < size; i++) {
|
|
|
|
if (str[i] == ch)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2012-11-06 17:53:59 -05:00
|
|
|
|
2015-03-15 21:06:40 -04:00
|
|
|
gboolean
|
|
|
|
strtoi_range(char *str, int *saveptr, int min, int max, char **err_msg)
|
|
|
|
{
|
|
|
|
char *ptr;
|
|
|
|
int val;
|
|
|
|
|
|
|
|
errno = 0;
|
|
|
|
val = (int)strtol(str, &ptr, 0);
|
|
|
|
if (errno != 0 || *str == '\0' || *ptr != '\0') {
|
|
|
|
GString *err_str = g_string_new("");
|
|
|
|
g_string_printf(err_str, "Could not convert \"%s\" to a number.", str);
|
|
|
|
*err_msg = err_str->str;
|
|
|
|
g_string_free(err_str, FALSE);
|
|
|
|
return FALSE;
|
|
|
|
} else if (val < min || val > max) {
|
|
|
|
GString *err_str = g_string_new("");
|
|
|
|
g_string_printf(err_str, "Value %s out of range. Must be in %d..%d.", str, min, max);
|
|
|
|
*err_msg = err_str->str;
|
|
|
|
g_string_free(err_str, FALSE);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
*saveptr = val;
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
2015-01-17 16:09:40 -05:00
|
|
|
int
|
2015-10-25 20:52:33 -04:00
|
|
|
utf8_display_len(const char *const str)
|
2015-01-17 16:09:40 -05:00
|
|
|
{
|
|
|
|
if (!str) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int len = 0;
|
|
|
|
gchar *curr = g_utf8_offset_to_pointer(str, 0);
|
|
|
|
while (*curr != '\0') {
|
|
|
|
gunichar curru = g_utf8_get_char(curr);
|
|
|
|
if (g_unichar_iswide(curru)) {
|
|
|
|
len += 2;
|
|
|
|
} else {
|
|
|
|
len ++;
|
|
|
|
}
|
|
|
|
curr = g_utf8_next_char(curr);
|
|
|
|
}
|
|
|
|
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
2015-10-25 20:52:33 -04:00
|
|
|
char*
|
|
|
|
release_get_latest(void)
|
2013-01-28 15:07:25 -05:00
|
|
|
{
|
2019-05-03 04:30:44 -04:00
|
|
|
char *url = "https://profanity-im.github.io/profanity_version.txt";
|
2013-01-28 15:07:25 -05:00
|
|
|
|
|
|
|
CURL *handle = curl_easy_init();
|
|
|
|
struct curl_data_t output;
|
|
|
|
output.buffer = NULL;
|
|
|
|
output.size = 0;
|
|
|
|
|
|
|
|
curl_easy_setopt(handle, CURLOPT_URL, url);
|
|
|
|
curl_easy_setopt(handle, CURLOPT_WRITEFUNCTION, _data_callback);
|
|
|
|
curl_easy_setopt(handle, CURLOPT_TIMEOUT, 2);
|
|
|
|
curl_easy_setopt(handle, CURLOPT_WRITEDATA, (void *)&output);
|
|
|
|
|
|
|
|
curl_easy_perform(handle);
|
|
|
|
curl_easy_cleanup(handle);
|
|
|
|
|
2015-05-04 18:26:08 -04:00
|
|
|
if (output.buffer) {
|
2013-01-28 15:07:25 -05:00
|
|
|
output.buffer[output.size++] = '\0';
|
|
|
|
return output.buffer;
|
|
|
|
} else {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-20 18:39:17 -04:00
|
|
|
gboolean
|
|
|
|
release_is_new(char *found_version)
|
|
|
|
{
|
|
|
|
int curr_maj, curr_min, curr_patch, found_maj, found_min, found_patch;
|
|
|
|
|
2016-03-31 16:05:02 -04:00
|
|
|
int parse_curr = sscanf(PACKAGE_VERSION, "%d.%d.%d", &curr_maj, &curr_min,
|
2013-04-20 18:39:17 -04:00
|
|
|
&curr_patch);
|
|
|
|
int parse_found = sscanf(found_version, "%d.%d.%d", &found_maj, &found_min,
|
|
|
|
&found_patch);
|
|
|
|
|
|
|
|
if (parse_found == 3 && parse_curr == 3) {
|
|
|
|
if (found_maj > curr_maj) {
|
|
|
|
return TRUE;
|
|
|
|
} else if (found_maj == curr_maj && found_min > curr_min) {
|
|
|
|
return TRUE;
|
|
|
|
} else if (found_maj == curr_maj && found_min == curr_min
|
|
|
|
&& found_patch > curr_patch) {
|
|
|
|
return TRUE;
|
|
|
|
} else {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-01-28 15:07:25 -05:00
|
|
|
static size_t
|
|
|
|
_data_callback(void *ptr, size_t size, size_t nmemb, void *data)
|
|
|
|
{
|
|
|
|
size_t realsize = size * nmemb;
|
|
|
|
struct curl_data_t *mem = (struct curl_data_t *) data;
|
|
|
|
mem->buffer = realloc(mem->buffer, mem->size + realsize + 1);
|
|
|
|
|
|
|
|
if ( mem->buffer )
|
|
|
|
{
|
|
|
|
memcpy( &( mem->buffer[ mem->size ] ), ptr, realsize );
|
|
|
|
mem->size += realsize;
|
|
|
|
mem->buffer[ mem->size ] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return realsize;
|
|
|
|
}
|
2014-10-26 16:43:05 -04:00
|
|
|
|
|
|
|
char*
|
|
|
|
get_file_or_linked(char *loc, char *basedir)
|
|
|
|
{
|
|
|
|
char *true_loc = NULL;
|
|
|
|
|
|
|
|
// check for symlink
|
|
|
|
if (g_file_test(loc, G_FILE_TEST_IS_SYMLINK)) {
|
|
|
|
true_loc = g_file_read_link(loc, NULL);
|
|
|
|
|
|
|
|
// if relative, add basedir
|
|
|
|
if (!g_str_has_prefix(true_loc, "/") && !g_str_has_prefix(true_loc, "~")) {
|
|
|
|
GString *base_str = g_string_new(basedir);
|
|
|
|
g_string_append(base_str, true_loc);
|
|
|
|
free(true_loc);
|
|
|
|
true_loc = base_str->str;
|
|
|
|
g_string_free(base_str, FALSE);
|
|
|
|
}
|
|
|
|
// use given location
|
|
|
|
} else {
|
|
|
|
true_loc = strdup(loc);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true_loc;
|
|
|
|
}
|
2015-02-08 15:59:51 -05:00
|
|
|
|
2015-10-25 20:52:33 -04:00
|
|
|
char*
|
|
|
|
strip_arg_quotes(const char *const input)
|
2015-02-08 15:59:51 -05:00
|
|
|
{
|
|
|
|
char *unquoted = strdup(input);
|
|
|
|
|
|
|
|
// Remove starting quote if it exists
|
2015-05-04 18:26:08 -04:00
|
|
|
if(strchr(unquoted, '"')) {
|
2015-02-08 15:59:51 -05:00
|
|
|
if(strchr(unquoted, ' ') + 1 == strchr(unquoted, '"')) {
|
|
|
|
memmove(strchr(unquoted, '"'), strchr(unquoted, '"')+1, strchr(unquoted, '\0') - strchr(unquoted, '"'));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove ending quote if it exists
|
2015-05-04 18:26:08 -04:00
|
|
|
if(strchr(unquoted, '"')) {
|
2015-02-08 15:59:51 -05:00
|
|
|
if(strchr(unquoted, '\0') - 1 == strchr(unquoted, '"')) {
|
|
|
|
memmove(strchr(unquoted, '"'), strchr(unquoted, '"')+1, strchr(unquoted, '\0') - strchr(unquoted, '"'));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return unquoted;
|
2015-02-08 16:03:26 -05:00
|
|
|
}
|
2015-10-09 05:50:21 -04:00
|
|
|
|
|
|
|
gboolean
|
|
|
|
is_notify_enabled(void)
|
|
|
|
{
|
|
|
|
gboolean notify_enabled = FALSE;
|
|
|
|
|
2016-03-31 16:05:02 -04:00
|
|
|
#ifdef HAVE_OSXNOTIFY
|
2015-10-09 05:50:21 -04:00
|
|
|
notify_enabled = TRUE;
|
|
|
|
#endif
|
2016-03-31 16:05:02 -04:00
|
|
|
#ifdef HAVE_LIBNOTIFY
|
2015-10-09 05:50:21 -04:00
|
|
|
notify_enabled = TRUE;
|
|
|
|
#endif
|
2016-03-31 16:05:02 -04:00
|
|
|
#ifdef PLATFORM_CYGWIN
|
2015-10-09 05:50:21 -04:00
|
|
|
notify_enabled = TRUE;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return notify_enabled;
|
|
|
|
}
|
2016-04-03 17:30:24 -04:00
|
|
|
|
2016-04-06 20:01:27 -04:00
|
|
|
GSList*
|
|
|
|
prof_occurrences(const char *const needle, const char *const haystack, int offset, gboolean whole_word, GSList **result)
|
2016-04-03 17:30:24 -04:00
|
|
|
{
|
|
|
|
if (needle == NULL || haystack == NULL) {
|
2016-04-06 20:01:27 -04:00
|
|
|
return *result;
|
2016-04-03 17:30:24 -04:00
|
|
|
}
|
|
|
|
|
2017-01-25 19:52:13 -05:00
|
|
|
gchar *haystack_curr = g_utf8_offset_to_pointer(haystack, offset);
|
|
|
|
if (g_str_has_prefix(haystack_curr, needle)) {
|
2016-04-06 20:01:27 -04:00
|
|
|
if (whole_word) {
|
2017-04-29 15:33:28 -04:00
|
|
|
gunichar before = 0;
|
2017-04-28 16:41:55 -04:00
|
|
|
gchar *haystack_before_ch = g_utf8_find_prev_char(haystack, haystack_curr);
|
|
|
|
if (haystack_before_ch) {
|
|
|
|
before = g_utf8_get_char(haystack_before_ch);
|
|
|
|
}
|
|
|
|
|
2017-04-29 15:33:28 -04:00
|
|
|
gunichar after = 0;
|
2019-05-08 16:33:19 -04:00
|
|
|
gchar *haystack_after_ch = haystack_curr + strlen(needle);
|
|
|
|
if (haystack_after_ch[0] != '\0') {
|
2017-04-28 16:41:55 -04:00
|
|
|
after = g_utf8_get_char(haystack_after_ch);
|
|
|
|
}
|
2017-01-25 19:52:13 -05:00
|
|
|
|
|
|
|
if (!g_unichar_isalnum(before) && !g_unichar_isalnum(after)) {
|
2016-04-06 20:01:27 -04:00
|
|
|
*result = g_slist_append(*result, GINT_TO_POINTER(offset));
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
*result = g_slist_append(*result, GINT_TO_POINTER(offset));
|
2016-04-03 17:30:24 -04:00
|
|
|
}
|
|
|
|
}
|
2016-04-06 20:01:27 -04:00
|
|
|
|
2017-01-25 19:52:13 -05:00
|
|
|
offset++;
|
|
|
|
if (g_strcmp0(g_utf8_offset_to_pointer(haystack, offset), "\0") != 0) {
|
|
|
|
*result = prof_occurrences(needle, haystack, offset, whole_word, result);
|
2016-04-06 20:01:27 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
return *result;
|
2016-04-03 17:30:24 -04:00
|
|
|
}
|
|
|
|
|
2017-02-05 16:09:03 -05:00
|
|
|
int
|
|
|
|
is_regular_file(const char *path)
|
|
|
|
{
|
|
|
|
struct stat st;
|
2019-10-04 17:29:10 -04:00
|
|
|
int ret = stat(path, &st);
|
|
|
|
if (ret != 0) {
|
|
|
|
perror(NULL);
|
|
|
|
return 0;
|
|
|
|
}
|
2017-02-05 16:09:03 -05:00
|
|
|
return S_ISREG(st.st_mode);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
is_dir(const char *path)
|
|
|
|
{
|
|
|
|
struct stat st;
|
2019-10-04 17:29:10 -04:00
|
|
|
int ret = stat(path, &st);
|
|
|
|
if (ret != 0) {
|
|
|
|
perror(NULL);
|
|
|
|
return 0;
|
|
|
|
}
|
2017-02-05 16:09:03 -05:00
|
|
|
return S_ISDIR(st.st_mode);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
get_file_paths_recursive(const char *path, GSList **contents)
|
|
|
|
{
|
|
|
|
if (!is_dir(path)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
GDir* directory = g_dir_open(path, 0, NULL);
|
|
|
|
const gchar *entry = g_dir_read_name(directory);
|
|
|
|
while (entry) {
|
|
|
|
GString *full = g_string_new(path);
|
|
|
|
if (!g_str_has_suffix(full->str, "/")) {
|
|
|
|
g_string_append(full, "/");
|
|
|
|
}
|
|
|
|
g_string_append(full, entry);
|
|
|
|
|
|
|
|
if (is_dir(full->str)) {
|
|
|
|
get_file_paths_recursive(full->str, contents);
|
|
|
|
} else if (is_regular_file(full->str)) {
|
|
|
|
*contents = g_slist_append(*contents, full->str);
|
|
|
|
}
|
|
|
|
|
|
|
|
g_string_free(full, FALSE);
|
|
|
|
entry = g_dir_read_name(directory);
|
|
|
|
}
|
|
|
|
}
|
2019-10-16 04:39:35 -04:00
|
|
|
|
|
|
|
char*
|
|
|
|
get_random_string(int length)
|
|
|
|
{
|
|
|
|
GRand *prng;
|
|
|
|
char *rand;
|
|
|
|
char alphabet[] = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
|
|
|
|
|
|
|
|
rand = calloc(length+1, sizeof(char));
|
|
|
|
|
|
|
|
prng = g_rand_new();
|
|
|
|
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < length; i++) {
|
|
|
|
rand[i] = alphabet[g_rand_int_range(prng, 0, sizeof(alphabet))];
|
|
|
|
}
|
|
|
|
g_rand_free(prng);
|
|
|
|
|
|
|
|
return rand;
|
|
|
|
}
|
2020-02-20 04:03:36 -05:00
|
|
|
|
|
|
|
GSList*
|
|
|
|
get_mentions(gboolean whole_word, gboolean case_sensitive, const char *const message, const char *const nick)
|
|
|
|
{
|
|
|
|
GSList *mentions = NULL;
|
|
|
|
char *message_search = case_sensitive ? strdup(message) : g_utf8_strdown(message, -1);
|
|
|
|
char *mynick_search = case_sensitive ? strdup(nick) : g_utf8_strdown(nick, -1);
|
|
|
|
|
|
|
|
mentions = prof_occurrences(mynick_search, message_search, 0, whole_word, &mentions);
|
|
|
|
|
|
|
|
g_free(message_search);
|
|
|
|
g_free(mynick_search);
|
|
|
|
|
|
|
|
return mentions;
|
|
|
|
}
|