This repository has been archived on 2024-04-08. You can view files and clone it, but cannot push or open issues or pull requests.
magicka/src/util.c

163 lines
3.3 KiB
C
Raw Normal View History

#include <sys/types.h>
#include <sys/stat.h>
#include <assert.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "bbs.h"
void die(const char *msg) {
dolog(msg);
exit(-1);
}
void *malloz(size_t size) {
void *p = malloc(size);
if (p == NULL)
die("Out of memory");
memset(p, 0, size);
return p;
}
char *file2str(const char *path) {
struct stat s;
int fd;
memset(&s, 0, sizeof(s));
if (stat(path, &s) < 0)
return NULL;
if (!S_ISREG(s.st_mode))
return NULL;
fd = open(path, O_RDONLY);
if (fd < 0)
return NULL;
char *contents = malloz(s.st_size + 1);
if (read(fd, contents, s.st_size) != s.st_size) {
free(contents);
close(fd);
return NULL;
}
close(fd);
contents[s.st_size] = '\0';
return contents;
}
char *str5dup(const char *a, const char *b, const char *c, const char *d, const char *e) {
char *p;
size_t alen, blen, clen, dlen, elen;
if (a == NULL)
a = "";
if (b == NULL)
b = "";
if (c == NULL)
c = "";
if (d == NULL)
d = "";
if (e == NULL)
e = "";
alen = strlen(a);
blen = strlen(b);
clen = strlen(c);
dlen = strlen(d);
elen = strlen(e);
p = malloz(alen + blen + clen + dlen + elen + 1);
memmove(p, a, alen);
memmove(p + alen, b, blen);
memmove(p + alen + blen, c, clen);
memmove(p + alen + blen + clen, d, dlen);
memmove(p + alen + blen + clen + dlen, e, elen);
return p;
}
char *str4dup(const char *a, const char *b, const char *c, const char *d) {
return str5dup(a, b, c, d, "");
}
char *str3dup(const char *a, const char *b, const char *c) {
return str5dup(a, b, c, "", "");
}
char *str2dup(const char *a, const char *b) {
return str5dup(a, b, "", "", "");
}
void init_ptr_vector(struct ptr_vector *vec) {
assert(vec != NULL);
memset(vec, 0, sizeof(*vec));
}
void ptr_vector_clear(struct ptr_vector *vec) {
assert(vec != NULL);
vec->len = 0;
memset(vec->ptrs, 0, sizeof(void *) * vec->capacity);
}
void *ptr_vector_get(struct ptr_vector *vec, size_t i) {
assert(vec != NULL);
if (i >= vec->len)
return NULL;
assert(vec->ptrs != NULL);
return vec->ptrs[i];
}
int ptr_vector_put(struct ptr_vector *vec, void *p, size_t i) {
assert(vec != NULL);
if (i >= vec->len)
return 0;
assert(vec->ptrs != NULL);
vec->ptrs[i] = p;
return 1;
}
void *ptr_vector_del(struct ptr_vector *vec, size_t i) {
void *p;
assert(vec != NULL);
if (i >= vec->len)
return NULL;
assert(vec->ptrs != NULL);
p = vec->ptrs[i];
memmove(vec->ptrs + i, vec->ptrs + i + 1,
(vec->len - (i + 1)) * sizeof(void *));
--vec->len;
return p;
}
int ptr_vector_append(struct ptr_vector *vec, void *p) {
assert(vec != NULL);
if (vec->len == vec->capacity) {
void **ps;
size_t oldcap = vec->capacity;
if (vec->capacity == 0)
vec->capacity = 1;
else
vec->capacity *= 2;
ps = realloc(vec->ptrs, vec->capacity * sizeof(void *));
assert(ps != NULL);
memset(vec->ptrs + oldcap, 0, (vec->capacity - oldcap) * sizeof(void *));
vec->ptrs = ps;
}
vec->ptrs[vec->len] = p;
++vec->len;
return 1;
}
size_t ptr_vector_len(struct ptr_vector *vec) {
assert(vec != NULL);
return vec->len;
}
void destroy_ptr_vector(struct ptr_vector *vec) {
assert(vec != NULL);
free(vec->ptrs);
vec->ptrs = NULL;
vec->capacity = 0;
vec->len = 0;
}