ant-http/lib/utils.c

751 lines
18 KiB
C
Raw Permalink Normal View History

2015-11-24 17:58:32 +01:00
/*
The MIT License (MIT)
Copyright (c) 2015 LE Xuan Sang xsang.le@gmail.com
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
2015-10-22 11:39:11 +02:00
#include "utils.h"
2016-12-17 12:28:05 +01:00
2020-08-25 16:40:24 +02:00
#include <dirent.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <stdlib.h>
#include <stdarg.h>
#include <errno.h>
#include <string.h>
#include <stdio.h>
#include <stdint.h>
#include <ctype.h>
2021-01-22 01:12:26 +01:00
#include <arpa/inet.h>
#include <netdb.h> //hostent
2020-08-25 16:40:24 +02:00
#ifdef USE_OPENSSL
#include <openssl/sha.h>
#else
#include "sha1.h"
#endif
#include "dictionary.h"
2021-01-01 13:21:26 +01:00
// #include <time.h>
2020-08-25 16:40:24 +02:00
static dictionary_t g_mime_list = NULL;
2015-10-22 11:39:11 +02:00
/**
* Trim a string by a character on both ends
* @param str The target string
* @param delim the delim
*/
2024-03-12 21:59:50 +01:00
void trim(char *str, const char delim)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
if (!str || strlen(str) == 0)
return;
char *p = str;
2015-10-22 11:39:11 +02:00
int l = strlen(p);
2024-03-12 21:59:50 +01:00
while (l > 0 && p[l - 1] == delim)
2018-03-14 11:55:15 +01:00
p[--l] = 0;
2024-03-12 21:59:50 +01:00
while (*p && (*p) == delim)
++p, --l;
2015-10-22 11:39:11 +02:00
memmove(str, p, l + 1);
}
2024-03-12 21:59:50 +01:00
void removeAll(const char *path, int mode)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
DIR *d;
struct dirent *dir;
char *file;
struct stat st;
if (stat(path, &st) == 0)
{
if (S_ISDIR(st.st_mode))
{
d = opendir(path);
if (d)
{
while ((dir = readdir(d)) != NULL)
{
if (strcmp(dir->d_name, ".") == 0 || strcmp(dir->d_name, "..") == 0)
continue;
file = __s("%s/%s", path, dir->d_name);
removeAll(file, 1);
free(file);
}
closedir(d);
}
}
if (mode)
remove(path);
}
2015-10-22 11:39:11 +02:00
}
// WARNING:
// TODO: remove it, this function is not thread-safe
2024-03-12 21:59:50 +01:00
void timestr(time_t time, char *buf, int len, char *format, int gmt)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
struct tm t;
if (gmt)
{
gmtime_r(&time, &t);
}
else
{
localtime_r(&time, &t);
}
2024-03-12 21:59:50 +01:00
strftime(buf, len, format, &t);
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
void server_time(char *buf, int len)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
timestr(time(NULL), buf, len, "%a, %d %b %Y %H:%M:%S", 0);
2015-10-22 11:39:11 +02:00
}
/**
* Get extension of a file name
* @param file The file name
* @return the extension
*/
2024-03-12 21:59:50 +01:00
char *ext(const char *file)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
char *token, *ltoken = "";
if (file == NULL)
return NULL;
char *str_cpy = strdup(file);
char *str_org = str_cpy;
if (!strstr(str_cpy, "."))
{
free(str_org);
return NULL;
2024-03-12 21:59:50 +01:00
}
if (*file == '.')
trim(str_cpy, '.');
2015-10-22 11:39:11 +02:00
2024-03-12 21:59:50 +01:00
while ((token = strsep(&str_cpy, ".")) && strlen(token) > 0)
{
ltoken = token;
}
char *ext = strdup(ltoken);
2018-03-02 19:04:00 +01:00
free(str_org);
2024-03-12 21:59:50 +01:00
return ext;
2015-10-22 11:39:11 +02:00
}
2016-12-17 12:28:05 +01:00
/*get mime file info from extension*/
2024-03-12 21:59:50 +01:00
mime_t mime_from_ext(const char *ex)
2016-12-17 12:28:05 +01:00
{
2019-12-15 12:10:06 +01:00
dictionary_t mime_list = mimes_list();
2024-03-12 21:59:50 +01:00
mime_t ret = (mime_t){"application/octet-stream", NULL};
if (!mime_list)
2019-12-15 12:10:06 +01:00
return ret;
chain_t it;
2024-03-12 21:59:50 +01:00
char *pattern = __s("(^\\s*%s\\s*,)|(\\s*,\\s*%s\\s*,\\s*)|(^\\s*%s\\s*$)|(,\\s*%s\\s*$)", ex, ex, ex, ex);
if (pattern)
2019-12-15 12:10:06 +01:00
{
2024-03-12 21:59:50 +01:00
for_each_assoc(it, mime_list)
2019-12-15 12:10:06 +01:00
{
2024-03-12 21:59:50 +01:00
if (regex_match(pattern, it->value, 0, NULL))
2019-12-15 12:10:06 +01:00
{
ret.type = it->key;
ret.ext = it->value;
free(pattern);
return ret;
}
}
free(pattern);
}
return ret;
}
2020-01-09 12:18:59 +01:00
2024-03-12 21:59:50 +01:00
void verify_header(char *k)
2020-01-09 12:18:59 +01:00
{
k[0] = toupper(k[0]);
int len = strlen(k);
for (int i = 0; i < len; i++)
{
2024-03-12 21:59:50 +01:00
if (k[i] == '-' && i < len - 1)
2020-01-09 12:18:59 +01:00
{
2024-03-12 21:59:50 +01:00
k[i + 1] = toupper(k[i + 1]);
2020-01-09 12:18:59 +01:00
}
}
}
2019-12-15 12:10:06 +01:00
dictionary_t mimes_list()
{
return g_mime_list;
2016-12-17 12:28:05 +01:00
}
void set_mimes_list(dictionary_t dict)
{
g_mime_list = dict;
}
2016-12-17 12:28:05 +01:00
/*get mime file info from type*/
2024-03-12 21:59:50 +01:00
mime_t mime_from_type(const char *type)
2016-12-17 12:28:05 +01:00
{
2019-12-15 12:10:06 +01:00
dictionary_t mime_list = mimes_list();
2024-03-12 21:59:50 +01:00
mime_t ret = (mime_t){NULL, NULL};
if (!mime_list)
2019-12-15 12:10:06 +01:00
return ret;
chain_t it = dlookup(mime_list, type);
2024-03-12 21:59:50 +01:00
if (it)
2019-12-15 12:10:06 +01:00
{
ret.type = it->key;
ret.ext = it->value;
}
2024-03-12 21:59:50 +01:00
return ret;
2016-12-17 12:28:05 +01:00
}
2015-10-22 11:39:11 +02:00
/**
* Get correct HTTP mime type of a file
* This is a minimalistic mime type list supported
* by the server
* @param file File name
* @return The HTTP Mime Type
*/
2024-03-12 21:59:50 +01:00
char *mime(const char *file)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
char *ex = ext(file);
if (!ex)
return "application/octet-stream";
mime_t m = mime_from_ext(ex);
if (ex)
2019-12-11 23:17:42 +01:00
{
2018-03-02 21:28:04 +01:00
free(ex);
2019-12-11 23:17:42 +01:00
}
2024-03-12 21:59:50 +01:00
return (char *)m.type;
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
int match_int(const char *search)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
return regex_match("^[-+]?[0-9]+$", search, 0, NULL);
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
int match_float(const char *search)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
return regex_match("^[+-]?[0-9]*\\.[0-9]+$", search, 0, NULL);
2015-10-22 11:39:11 +02:00
}
2018-02-04 10:58:02 +01:00
/*
2024-03-12 21:59:50 +01:00
regmatch_t matches[MAX_MATCHES];
if (regexec(&exp, sz, MAX_MATCHES, matches, 0) == 0) {
memcpy(buff, sz + matches[1].rm_so, matches[1].rm_eo - matches[1].rm_so);
printf("group1: %s\n", buff);
2018-02-04 10:58:02 +01:00
}
*/
2024-03-12 21:59:50 +01:00
int regex_match(const char *expr, const char *search, int msize, regmatch_t *matches)
2015-10-22 11:39:11 +02:00
{
2024-03-12 21:59:50 +01:00
regex_t regex;
2015-10-22 11:39:11 +02:00
int reti;
char msgbuf[100];
int ret;
2024-03-12 21:59:50 +01:00
/* Compile regular expression */
2015-10-22 11:39:11 +02:00
reti = regcomp(&regex, expr, REG_ICASE | REG_EXTENDED);
2024-03-12 21:59:50 +01:00
if (reti)
{
// ERROR("Could not compile regex: %s",expr);
regerror(reti, &regex, msgbuf, sizeof(msgbuf));
2019-12-20 16:49:41 +01:00
ERROR("Regex match failed: %s", msgbuf);
2024-03-12 21:59:50 +01:00
// return 0;
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
/* Execute regular expression */
reti = regexec(&regex, search, msize, matches, 0);
2024-03-12 21:59:50 +01:00
if (!reti)
{
// LOG("Match");
ret = 1;
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
else if (reti == REG_NOMATCH)
{
// LOG("No match");
ret = 0;
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
else
{
2015-10-22 11:39:11 +02:00
regerror(reti, &regex, msgbuf, sizeof(msgbuf));
2024-03-12 21:59:50 +01:00
// ERROR("Regex match failed: %s\n", msgbuf);
2015-10-22 11:39:11 +02:00
ret = 0;
}
2024-03-12 21:59:50 +01:00
regfree(&regex);
return ret;
2015-10-22 11:39:11 +02:00
}
2024-03-12 21:59:50 +01:00
char *url_decode(const char *str)
{
if (!str)
2019-12-11 23:17:42 +01:00
{
2018-03-17 15:49:37 +01:00
return NULL;
2019-12-11 23:17:42 +01:00
}
2024-03-12 21:59:50 +01:00
char *pstr = (char *)str, *buf = malloc(strlen(str) + 1), *pbuf = buf;
while (*pstr)
{
if (*pstr == '%')
{
if (pstr[1] && pstr[2])
{
*pbuf++ = from_hex(pstr[1]) << 4 | from_hex(pstr[2]);
pstr += 2;
}
}
else if (*pstr == '+')
{
*pbuf++ = ' ';
}
else
{
*pbuf++ = *pstr;
}
pstr++;
}
*pbuf = '\0';
return buf;
}
char *url_encode(const char *str)
2016-10-31 17:34:20 +01:00
{
2024-03-12 21:59:50 +01:00
char *pstr = (char *)str, *buf = malloc(strlen(str) * 3 + 1), *pbuf = buf;
while (*pstr)
{
if (isalnum(*pstr) || *pstr == '-' || *pstr == '_' || *pstr == '.' || *pstr == '~')
*pbuf++ = *pstr;
else if (*pstr == ' ')
*pbuf++ = '+';
else
*pbuf++ = '%', *pbuf++ = to_hex(*pstr >> 4), *pbuf++ = to_hex(*pstr & 15);
pstr++;
}
*pbuf = '\0';
return buf;
2016-10-31 17:34:20 +01:00
}
2024-03-12 21:59:50 +01:00
char from_hex(char ch)
{
return isdigit(ch) ? ch - '0' : tolower(ch) - 'a' + 10;
}
char to_hex(char code)
2015-11-24 17:58:32 +01:00
{
2024-03-12 21:59:50 +01:00
static char hex[] = "0123456789abcdef";
return hex[code & 15];
}
unsigned hash(const char *key, int hash_size)
{
unsigned hashval = simple_hash(key);
return hashval % hash_size;
}
unsigned simple_hash(const char *key)
{
unsigned hashval;
2015-11-24 17:58:32 +01:00
for (hashval = 0; *key != '\0'; key++)
2024-03-12 21:59:50 +01:00
hashval = *key + 31 * hashval;
return hashval;
2016-10-30 16:14:04 +01:00
}
2024-03-12 21:59:50 +01:00
int _exist(const char *f)
2016-10-30 16:14:04 +01:00
{
2024-03-12 21:59:50 +01:00
struct stat st;
return !(stat(f, &st) == -1);
2016-10-31 22:18:24 +01:00
}
2024-03-12 21:59:50 +01:00
int is_file(const char *f)
2016-12-15 14:46:50 +01:00
{
2024-03-12 21:59:50 +01:00
int st = is_dir(f);
if (st == -1)
return -1;
else
return st == 0;
2016-12-15 14:46:50 +01:00
}
2024-03-12 21:59:50 +01:00
int is_dir(const char *f)
2016-12-15 14:46:50 +01:00
{
2024-03-12 21:59:50 +01:00
struct stat st;
if (stat(f, &st) == -1)
return -1; // unknow
else if (st.st_mode & S_IFDIR)
return 1;
else
return 0;
2016-12-15 14:46:50 +01:00
}
2016-10-31 22:18:24 +01:00
// These vars will contain the hash
2024-03-12 21:59:50 +01:00
void md5(uint8_t *initial_msg, size_t initial_len, char *buff)
{
uint32_t h0, h1, h2, h3;
char tmp[80];
2016-10-31 22:18:24 +01:00
uint8_t *msg = NULL;
uint32_t r[] = {7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
2024-03-12 21:59:50 +01:00
5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
2016-10-31 22:18:24 +01:00
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21};
// Use binary integer part of the sines of integers (in radians) as constants// Initialize variables:
uint32_t k[] = {
0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391};
2024-03-12 21:59:50 +01:00
2016-10-31 22:18:24 +01:00
h0 = 0x67452301;
h1 = 0xefcdab89;
h2 = 0x98badcfe;
h3 = 0x10325476;
2024-03-12 21:59:50 +01:00
2016-10-31 22:18:24 +01:00
// Pre-processing: adding a single 1 bit
2024-03-12 21:59:50 +01:00
// append "1" bit to message
2016-10-31 22:18:24 +01:00
/* Notice: the input bytes are considered as bits strings,
where the first bit is the most significant bit of the byte.[37] */
2024-03-12 21:59:50 +01:00
2016-10-31 22:18:24 +01:00
// Pre-processing: padding with zeros
2024-03-12 21:59:50 +01:00
// append "0" bit until message length in bit ≡ 448 (mod 512)
// append length mod (2 pow 64) to message
2016-10-31 22:18:24 +01:00
int new_len;
2024-03-12 21:59:50 +01:00
for (new_len = initial_len * 8 + 1; new_len % 512 != 448; new_len++)
;
2016-10-31 22:18:24 +01:00
new_len /= 8;
2024-03-12 21:59:50 +01:00
msg = calloc(new_len + 64, 1); // also appends "0" bits
2016-10-31 22:18:24 +01:00
// (we alloc also 64 extra bytes...)
memcpy(msg, initial_msg, initial_len);
msg[initial_len] = 128; // write the "1" bit
2024-03-12 21:59:50 +01:00
uint32_t bits_len = 8 * initial_len; // note, we append the len
memcpy(msg + new_len, &bits_len, 4); // in bits at the end of the buffer
2016-10-31 22:18:24 +01:00
// Process the message in successive 512-bit chunks:
2024-03-12 21:59:50 +01:00
// for each 512-bit chunk of message:
2016-10-31 22:18:24 +01:00
int offset;
2024-03-12 21:59:50 +01:00
for (offset = 0; offset < new_len; offset += (512 / 8))
{
2016-10-31 22:18:24 +01:00
// break chunk into sixteen 32-bit words w[j], 0 ≤ j ≤ 15
2024-03-12 21:59:50 +01:00
uint32_t *w = (uint32_t *)(msg + offset);
2016-10-31 22:18:24 +01:00
// Initialize hash value for this chunk:
uint32_t a = h0;
uint32_t b = h1;
uint32_t c = h2;
uint32_t d = h3;
2024-03-12 21:59:50 +01:00
2016-10-31 22:18:24 +01:00
// Main loop:
uint32_t i;
2024-03-12 21:59:50 +01:00
for (i = 0; i < 64; i++)
{
2016-10-31 22:18:24 +01:00
uint32_t f, g;
2024-03-12 21:59:50 +01:00
if (i < 16)
{
2016-10-31 22:18:24 +01:00
f = (b & c) | ((~b) & d);
g = i;
2024-03-12 21:59:50 +01:00
}
else if (i < 32)
{
2016-10-31 22:18:24 +01:00
f = (d & b) | ((~d) & c);
2024-03-12 21:59:50 +01:00
g = (5 * i + 1) % 16;
}
else if (i < 48)
{
2016-10-31 22:18:24 +01:00
f = b ^ c ^ d;
2024-03-12 21:59:50 +01:00
g = (3 * i + 5) % 16;
}
else
{
2016-10-31 22:18:24 +01:00
f = c ^ (b | (~d));
2024-03-12 21:59:50 +01:00
g = (7 * i) % 16;
2016-10-31 22:18:24 +01:00
}
uint32_t temp = d;
d = c;
c = b;
2024-03-12 21:59:50 +01:00
// printf("rotateLeft(%x + %x + %x + %x, %d)\n", a, f, k[i], w[g], r[i]);
2016-10-31 22:18:24 +01:00
b = b + LEFTROTATE((a + f + k[i] + w[g]), r[i]);
a = temp;
}
2024-03-12 21:59:50 +01:00
2016-10-31 22:18:24 +01:00
// Add this chunk's hash to result so far:
2024-03-12 21:59:50 +01:00
2016-10-31 22:18:24 +01:00
h0 += a;
h1 += b;
h2 += c;
h3 += d;
2024-03-12 21:59:50 +01:00
}
uint8_t *p;
p = (uint8_t *)&h0;
sprintf(tmp, "%02x%02x%02x%02x", p[0], p[1], p[2], p[3]); //, h0
strcpy(buff, tmp);
p = (uint8_t *)&h1;
sprintf(tmp, "%02x%02x%02x%02x", p[0], p[1], p[2], p[3]); //, h1)
strcat(buff, tmp);
p = (uint8_t *)&h2;
sprintf(tmp, "%02x%02x%02x%02x", p[0], p[1], p[2], p[3]); // , h2
strcat(buff, tmp);
p = (uint8_t *)&h3;
sprintf(tmp, "%02x%02x%02x%02x", p[0], p[1], p[2], p[3]); // , h3
strcat(buff, tmp);
2016-10-31 22:18:24 +01:00
// cleanup
free(msg);
2016-11-01 18:30:45 +01:00
}
2024-03-12 21:59:50 +01:00
void sha1(const char *text, char *out)
{
uint8_t d[20];
2018-02-10 11:22:41 +01:00
#ifdef USE_OPENSSL
SHA_CTX context;
#else
SHA1_CTX context;
#endif
SHA1_Init(&context);
SHA1_Update(&context, text, strlen(text));
SHA1_Final(d, &context);
2024-03-12 21:59:50 +01:00
digest_to_hex(d, out);
2019-12-11 23:17:42 +01:00
}
2019-12-15 12:10:06 +01:00
2024-03-12 21:59:50 +01:00
char *__s(const char *fstring, ...)
2019-12-15 12:10:06 +01:00
{
2024-03-12 21:59:50 +01:00
char *data;
va_list arguments;
int dlen;
va_start(arguments, fstring);
dlen = vsnprintf(0, 0, fstring, arguments) + 1;
2020-08-19 12:26:17 +02:00
va_end(arguments);
2024-03-12 21:59:50 +01:00
if ((data = (char *)malloc(dlen * sizeof(char))) != 0)
2019-12-15 12:10:06 +01:00
{
va_start(arguments, fstring);
vsnprintf(data, dlen, fstring, arguments);
va_end(arguments);
return data;
2024-03-12 21:59:50 +01:00
}
else
return "";
2019-12-20 16:49:41 +01:00
}
2024-03-12 21:59:50 +01:00
int mkdirp(const char *path, mode_t mode)
2019-12-20 16:49:41 +01:00
{
char tmp[BUFFLEN];
2024-03-12 21:59:50 +01:00
if (strlen(path) > BUFFLEN)
2019-12-20 16:49:41 +01:00
{
ERROR("mkdirp: Path is too long %s", path);
return -1;
}
char *p = NULL;
size_t len;
int stat;
2024-03-12 21:59:50 +01:00
snprintf(tmp, sizeof(tmp), "%s", path);
2019-12-20 16:49:41 +01:00
len = strlen(tmp);
2024-03-12 21:59:50 +01:00
if (tmp[len - 1] == '/')
tmp[len - 1] = 0;
for (p = tmp + 1; *p; p++)
2019-12-20 16:49:41 +01:00
{
2024-03-12 21:59:50 +01:00
if (*p == '/')
{
2019-12-20 16:49:41 +01:00
*p = 0;
stat = mkdir(tmp, mode);
2024-03-12 21:59:50 +01:00
if (stat == -1 && errno != EEXIST)
2019-12-20 16:49:41 +01:00
return stat;
*p = '/';
}
}
return mkdir(path, mode);
2021-01-03 11:24:55 +01:00
}
2024-03-12 21:59:50 +01:00
int guard_read(int fd, void *buffer, size_t size)
2021-01-03 11:24:55 +01:00
{
int n = 0;
int read_len;
int st;
2024-03-12 21:59:50 +01:00
while (n != (int)size)
2021-01-03 11:24:55 +01:00
{
read_len = (int)size - n;
2024-03-12 21:59:50 +01:00
st = read(fd, buffer + n, read_len);
if (st == -1)
2021-01-03 11:24:55 +01:00
{
2024-03-12 21:59:50 +01:00
ERROR("Unable to read from #%d: %s", fd, strerror(errno));
2021-01-03 11:24:55 +01:00
return -1;
}
2024-03-12 21:59:50 +01:00
if (st == 0)
2021-01-03 11:24:55 +01:00
{
ERROR("Endpoint %d is closed", fd);
return -1;
}
n += st;
}
return n;
}
2024-03-12 21:59:50 +01:00
int guard_write(int fd, void *buffer, size_t size)
2021-01-03 11:24:55 +01:00
{
int n = 0;
int write_len;
int st;
2024-03-12 21:59:50 +01:00
while (n != (int)size)
2021-01-03 11:24:55 +01:00
{
write_len = (int)size - n;
2024-03-12 21:59:50 +01:00
st = write(fd, buffer + n, write_len);
if (st == -1)
2021-01-03 11:24:55 +01:00
{
ERROR("Unable to write to #%d: %s", fd, strerror(errno));
return -1;
}
2024-03-12 21:59:50 +01:00
if (st == 0)
2021-01-03 11:24:55 +01:00
{
ERROR("Endpoint %d is closed", fd);
return -1;
}
n += st;
}
return n;
2021-01-22 01:12:26 +01:00
}
/*
send a request
*/
2024-03-12 21:59:50 +01:00
int antd_request_socket(const char *ip, int port)
2021-01-22 01:12:26 +01:00
{
2024-03-12 21:59:50 +01:00
int sockfd;
struct sockaddr_in dest;
if (!ip)
{
ERROR("Invalid IP address");
return -1;
}
2024-03-12 21:59:50 +01:00
if ((sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0)
{
ERROR("Socket: %s", strerror(errno));
return -1;
}
/*struct linger lingerStruct;
2021-01-22 01:12:26 +01:00
lingerStruct.l_onoff = 0; // turn lingering off for sockets
setsockopt(sockfd, SOL_SOCKET, SO_LINGER, &lingerStruct, sizeof(lingerStruct));*/
2024-03-12 21:59:50 +01:00
bzero(&dest, sizeof(dest));
dest.sin_family = AF_INET;
dest.sin_port = htons(port);
if (inet_aton(ip, &dest.sin_addr) == 0)
{
ERROR("[%s] inet_aton: %s", ip, strerror(errno));
close(sockfd);
return -1;
}
if (connect(sockfd, (struct sockaddr *)&dest, sizeof(dest)) != 0)
{
close(sockfd);
ERROR("Connect:%s", strerror(errno));
return -1;
}
return sockfd;
}
char *ip_from_hostname(const char *hostname)
2021-01-22 01:12:26 +01:00
{
2024-03-12 21:59:50 +01:00
struct hostent *he;
struct in_addr **addr_list;
int i;
if (!hostname)
{
return NULL;
}
if ((he = gethostbyname(hostname)) == NULL)
{
2024-03-12 21:59:50 +01:00
// get the host info
ERROR("gethostbyname:%s", strerror(errno));
return NULL;
}
2024-03-12 21:59:50 +01:00
addr_list = (struct in_addr **)he->h_addr_list;
for (i = 0; addr_list[i] != NULL; i++)
{
// Return the first one;
return inet_ntoa(*addr_list[i]);
}
return NULL;
}
int antd_listen(unsigned *port, int ipv6, int backlog)
{
int httpd = 0;
antd_sockaddr_t name;
memset(&name, 0, sizeof(name));
struct sockaddr *ptr;
// TODO: allow to set listen address
if (ipv6)
{
name.addr6.sin6_port = htons(*port);
name.addr6.sin6_family = AF_INET6;
name.addr6.sin6_addr = in6addr_any;
httpd = socket(AF_INET6, SOCK_STREAM, 0);
ptr = (struct sockaddr *)&name.addr6;
}
else
{
name.addr4.sin_port = htons(*port);
name.addr4.sin_family = AF_INET;
name.addr4.sin_addr.s_addr = htonl(INADDR_ANY);
httpd = socket(AF_INET, SOCK_STREAM, 0);
ptr = (struct sockaddr *)&name.addr4;
}
if (httpd == -1)
{
ERROR("Port %d - socket: %s", *port, strerror(errno));
return -1;
}
if (setsockopt(httpd, SOL_SOCKET, SO_REUSEADDR, &(int){1}, sizeof(int)) == -1)
{
ERROR("Unable to set reuse address on port %d - setsockopt: %s", *port, strerror(errno));
}
if (bind(httpd, ptr, sizeof(name)) < 0)
{
ERROR("Port %d -bind: %s", *port, strerror(errno));
return -1;
}
if (*port == 0) /* if dynamically allocating a port */
{
socklen_t namelen = sizeof(name);
if (getsockname(httpd, (struct sockaddr *)&name, &namelen) == -1)
{
ERROR("Port %d - getsockname: %s", *port, strerror(errno));
return -1;
}
if (ipv6)
{
*port = ntohs(name.addr6.sin6_port);
}
else
{
*port = ntohs(name.addr4.sin_port);
}
}
if (listen(httpd, backlog) < 0)
{
ERROR("Port %d - listen: %s", *port, strerror(errno));
return -1;
}
LOG("%s Listen on port %d", ipv6 ? "IPv6" : "IPv4", *port);
return (httpd);
}