2003-04-16 19:04:58 +02:00
|
|
|
/* Copyright 2003 Roger Dingledine */
|
|
|
|
/* See LICENSE for licensing information */
|
|
|
|
/* $Id$ */
|
|
|
|
|
|
|
|
#ifndef __UTIL_H
|
|
|
|
#define __UTIL_H
|
|
|
|
|
2003-09-29 09:50:08 +02:00
|
|
|
#include "../or/or.h"
|
2003-08-12 05:08:41 +02:00
|
|
|
|
2003-08-14 19:13:52 +02:00
|
|
|
#if _MSC_VER > 1300
|
|
|
|
#include <winsock2.h>
|
|
|
|
#include <ws2tcpip.h>
|
|
|
|
#elif defined(_MSC_VER)
|
|
|
|
#include <winsock.h>
|
|
|
|
#endif
|
2003-08-12 05:08:41 +02:00
|
|
|
#ifndef HAVE_GETTIMEOFDAY
|
2003-08-12 05:16:15 +02:00
|
|
|
#ifdef HAVE_FTIME
|
2003-08-12 10:18:13 +02:00
|
|
|
#define USING_FAKE_TIMEVAL
|
2003-08-12 05:08:41 +02:00
|
|
|
#include <sys/timeb.h>
|
|
|
|
#define timeval timeb
|
|
|
|
#define tv_sec time
|
|
|
|
#define tv_usec millitm
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
2003-08-14 19:13:52 +02:00
|
|
|
#ifdef MS_WINDOWS
|
2003-08-12 05:08:41 +02:00
|
|
|
/* Windows names string functions funnily. */
|
|
|
|
#define strncasecmp strnicmp
|
|
|
|
#define strcasecmp stricmp
|
|
|
|
#define INLINE __inline
|
|
|
|
#else
|
|
|
|
#define INLINE inline
|
|
|
|
#endif
|
2003-04-16 19:04:58 +02:00
|
|
|
|
2004-03-17 08:28:09 +01:00
|
|
|
size_t strlcat(char *dst, const char *src, size_t siz);
|
|
|
|
size_t strlcpy(char *dst, const char *src, size_t siz);
|
|
|
|
|
2003-05-20 08:37:34 +02:00
|
|
|
void *tor_malloc(size_t size);
|
2003-11-18 09:20:09 +01:00
|
|
|
void *tor_malloc_zero(size_t size);
|
2003-10-14 03:11:42 +02:00
|
|
|
void *tor_realloc(void *ptr, size_t size);
|
2003-10-04 05:29:09 +02:00
|
|
|
char *tor_strdup(const char *s);
|
2003-12-09 00:45:37 +01:00
|
|
|
char *tor_strndup(const char *s, size_t n);
|
2003-10-21 11:48:58 +02:00
|
|
|
#define tor_free(p) do {if(p) {free(p); (p)=NULL;}} while(0)
|
2004-03-20 02:48:05 +01:00
|
|
|
void tor_strlower(char *s);
|
2003-05-20 08:37:34 +02:00
|
|
|
|
2004-03-21 05:14:06 +01:00
|
|
|
#ifdef UNALIGNED_INT_ACCESS_OK
|
2004-03-21 03:01:17 +01:00
|
|
|
/* XXX Not actually used yet, but would probably be faster on non-sun
|
|
|
|
* hardare.
|
|
|
|
*/
|
|
|
|
#define get_uint16(cp) (*(uint16_t*)(cp))
|
|
|
|
#define get_uint32(cp) (*(uint32_t*)(cp))
|
2004-03-31 04:07:38 +02:00
|
|
|
#define set_uint16(cp,v) do { *(uint16_t*)(cp) = (v); } while (0)
|
|
|
|
#define set_uint32(cp,v) do { *(uint32_t*)(cp) = (v); } while (0)
|
2004-03-21 03:01:17 +01:00
|
|
|
#else
|
2004-03-31 04:07:38 +02:00
|
|
|
#if 1
|
2004-03-21 03:01:17 +01:00
|
|
|
uint16_t get_uint16(char *cp);
|
|
|
|
uint32_t get_uint32(char *cp);
|
|
|
|
void set_uint16(char *cp, uint16_t v);
|
|
|
|
void set_uint32(char *cp, uint32_t v);
|
2004-03-31 04:07:38 +02:00
|
|
|
#else
|
|
|
|
#define get_uint16(cp) \
|
|
|
|
( ((*(((uint8_t*)(cp))+0))<<8) + \
|
|
|
|
((*(((uint8_t*)(cp))+1)) ) )
|
|
|
|
#define get_uint32(cp) \
|
|
|
|
( ((*(((uint8_t*)(cp))+0))<<24) + \
|
|
|
|
((*(((uint8_t*)(cp))+1))<<16) + \
|
|
|
|
((*(((uint8_t*)(cp))+2))<<8 ) + \
|
|
|
|
((*(((uint8_t*)(cp))+3)) ) )
|
|
|
|
#define set_uint16(cp,v) \
|
|
|
|
do { \
|
|
|
|
*(((uint8_t*)(cp))+0) = (v >> 8)&0xff; \
|
|
|
|
*(((uint8_t*)(cp))+1) = (v >> 0)&0xff; \
|
|
|
|
} while (0)
|
|
|
|
#define set_uint32(cp,v) \
|
|
|
|
do { \
|
|
|
|
*(((uint8_t*)(cp))+0) = (v >> 24)&0xff; \
|
|
|
|
*(((uint8_t*)(cp))+1) = (v >> 16)&0xff; \
|
|
|
|
*(((uint8_t*)(cp))+2) = (v >> 8)&0xff; \
|
|
|
|
*(((uint8_t*)(cp))+3) = (v >> 0)&0xff; \
|
|
|
|
} while (0)
|
|
|
|
#endif
|
2004-03-21 03:01:17 +01:00
|
|
|
#endif
|
|
|
|
|
2004-04-03 01:30:54 +02:00
|
|
|
void hex_encode(const char *from, int fromlen, char *to);
|
|
|
|
|
2004-04-03 02:58:54 +02:00
|
|
|
typedef struct smartlist_t smartlist_t;
|
2003-12-13 02:42:44 +01:00
|
|
|
|
2004-03-31 00:59:00 +02:00
|
|
|
smartlist_t *smartlist_create();
|
2003-12-13 02:42:44 +01:00
|
|
|
void smartlist_free(smartlist_t *sl);
|
2004-03-31 00:59:00 +02:00
|
|
|
void smartlist_set_capacity(smartlist_t *sl, int n);
|
2003-12-13 02:42:44 +01:00
|
|
|
void smartlist_add(smartlist_t *sl, void *element);
|
2003-12-14 05:57:47 +01:00
|
|
|
void smartlist_remove(smartlist_t *sl, void *element);
|
2003-12-14 00:32:03 +01:00
|
|
|
int smartlist_isin(smartlist_t *sl, void *element);
|
|
|
|
int smartlist_overlap(smartlist_t *sl1, smartlist_t *sl2);
|
|
|
|
void smartlist_intersect(smartlist_t *sl1, smartlist_t *sl2);
|
2003-12-14 06:00:09 +01:00
|
|
|
void smartlist_subtract(smartlist_t *sl1, smartlist_t *sl2);
|
2003-12-13 02:42:44 +01:00
|
|
|
void *smartlist_choose(smartlist_t *sl);
|
2004-04-03 02:58:54 +02:00
|
|
|
void *smartlist_get(smartlist_t *sl, int idx);
|
|
|
|
void *smartlist_set(smartlist_t *sl, int idx, void *val);
|
|
|
|
void *smartlist_del(smartlist_t *sl, int idx);
|
|
|
|
int smartlist_len(smartlist_t *sl);
|
|
|
|
#define SMARTLIST_FOREACH(sl, type, var, cmd) \
|
|
|
|
do { \
|
|
|
|
int sl_idx, sl_len=smartlist_len(sl); \
|
|
|
|
type var; \
|
|
|
|
for(sl_idx = 0; sl_idx < sl_len; ++sl_idx) { \
|
|
|
|
var = smartlist_get((sl),sl_idx); \
|
|
|
|
do {cmd;} while(0); \
|
|
|
|
} } while (0)
|
2003-12-13 02:42:44 +01:00
|
|
|
|
2004-03-19 23:07:24 +01:00
|
|
|
/* Map from const char * to void*. Implemented with a splay tree. */
|
|
|
|
typedef struct strmap_t strmap_t;
|
|
|
|
typedef struct strmap_entry_t strmap_entry_t;
|
|
|
|
typedef struct strmap_entry_t strmap_iter_t;
|
|
|
|
strmap_t* strmap_new(void);
|
|
|
|
void* strmap_set(strmap_t *map, const char *key, void *val);
|
|
|
|
void* strmap_get(strmap_t *map, const char *key);
|
|
|
|
void* strmap_remove(strmap_t *map, const char *key);
|
2004-03-20 02:48:05 +01:00
|
|
|
void* strmap_set_lc(strmap_t *map, const char *key, void *val);
|
|
|
|
void* strmap_get_lc(strmap_t *map, const char *key);
|
|
|
|
void* strmap_remove_lc(strmap_t *map, const char *key);
|
|
|
|
typedef void* (*strmap_foreach_fn)(const char *key, void *val, void *data);
|
|
|
|
void strmap_foreach(strmap_t *map, strmap_foreach_fn fn, void *data);
|
2004-03-19 23:07:24 +01:00
|
|
|
void strmap_free(strmap_t *map, void (*free_val)(void*));
|
|
|
|
|
|
|
|
strmap_iter_t *strmap_iter_init(strmap_t *map);
|
|
|
|
strmap_iter_t *strmap_iter_next(strmap_t *map, strmap_iter_t *iter);
|
|
|
|
strmap_iter_t *strmap_iter_next_rmv(strmap_t *map, strmap_iter_t *iter);
|
|
|
|
void strmap_iter_get(strmap_iter_t *iter, const char **keyp, void **valp);
|
|
|
|
|
|
|
|
int strmap_iter_done(strmap_iter_t *iter);
|
|
|
|
|
2003-12-09 00:45:37 +01:00
|
|
|
const char *eat_whitespace(const char *s);
|
|
|
|
const char *eat_whitespace_no_nl(const char *s);
|
|
|
|
const char *find_whitespace(const char *s);
|
2003-11-12 20:34:19 +01:00
|
|
|
|
2003-10-21 11:48:58 +02:00
|
|
|
void tor_gettimeofday(struct timeval *timeval);
|
2003-04-16 19:04:58 +02:00
|
|
|
long tv_udiff(struct timeval *start, struct timeval *end);
|
|
|
|
void tv_addms(struct timeval *a, long ms);
|
|
|
|
void tv_add(struct timeval *a, struct timeval *b);
|
|
|
|
int tv_cmp(struct timeval *a, struct timeval *b);
|
2003-10-20 22:19:59 +02:00
|
|
|
time_t tor_timegm (struct tm *tm);
|
|
|
|
|
2004-03-11 07:35:03 +01:00
|
|
|
int write_all(int fd, const char *buf, size_t count, int isSocket);
|
|
|
|
int read_all(int fd, char *buf, size_t count, int isSocket);
|
2003-08-21 01:05:22 +02:00
|
|
|
|
2003-08-12 05:08:41 +02:00
|
|
|
void set_socket_nonblocking(int socket);
|
|
|
|
|
2003-09-26 20:27:35 +02:00
|
|
|
typedef enum { FN_ERROR, FN_NOENT, FN_FILE, FN_DIR} file_status_t;
|
|
|
|
|
|
|
|
file_status_t file_status(const char *filename);
|
|
|
|
int check_private_dir(const char *dirname, int create);
|
|
|
|
int write_str_to_file(const char *fname, const char *str);
|
2003-09-28 08:47:29 +02:00
|
|
|
char *read_file_to_str(const char *filename);
|
2003-09-29 09:50:08 +02:00
|
|
|
int parse_line_from_file(char *line, int maxlen, FILE *f, char **key_out, char **value_out);
|
2003-09-26 20:27:35 +02:00
|
|
|
|
2003-08-12 09:01:20 +02:00
|
|
|
int spawn_func(int (*func)(void *), void *data);
|
|
|
|
void spawn_exit();
|
|
|
|
|
2003-08-12 09:43:15 +02:00
|
|
|
int tor_socketpair(int family, int type, int protocol, int fd[2]);
|
|
|
|
|
2004-03-14 19:07:46 +01:00
|
|
|
int is_internal_IP(uint32_t ip);
|
|
|
|
|
2003-10-02 00:31:13 +02:00
|
|
|
const char *get_uname(void);
|
|
|
|
|
2004-01-03 23:40:49 +01:00
|
|
|
/* Start putting the process into daemon mode: fork and drop all resources
|
|
|
|
* except standard fds. The parent process never returns, but stays around
|
|
|
|
* until finish_daemon is called. (Note: it's safe to call this more
|
|
|
|
* than once: calls after the first are ignored.)
|
|
|
|
*/
|
2004-02-29 00:21:29 +01:00
|
|
|
void start_daemon(char *desired_cwd);
|
2004-01-03 23:40:49 +01:00
|
|
|
/* Finish putting the process into daemon mode: drop standard fds, and tell
|
|
|
|
* the parent process to exit. (Note: it's safe to call this more than once:
|
|
|
|
* calls after the first are ignored. Calls start_daemon first if it hasn't
|
|
|
|
* been called already.)
|
|
|
|
*/
|
|
|
|
void finish_daemon(void);
|
|
|
|
|
2003-10-22 13:21:29 +02:00
|
|
|
void write_pidfile(char *filename);
|
|
|
|
int switch_id(char *user, char *group);
|
|
|
|
|
2004-03-09 23:01:17 +01:00
|
|
|
struct in_addr;
|
|
|
|
int tor_inet_aton(const char *cp, struct in_addr *addr);
|
|
|
|
|
2003-12-17 22:14:13 +01:00
|
|
|
/* For stupid historical reasons, windows sockets have an independent set of
|
2003-08-14 19:13:52 +02:00
|
|
|
* errnos which they use as the fancy strikes them.
|
|
|
|
*/
|
|
|
|
#ifdef MS_WINDOWS
|
2003-08-14 19:51:36 +02:00
|
|
|
#define ERRNO_EAGAIN(e) ((e) == EAGAIN || (e) == WSAEWOULDBLOCK)
|
|
|
|
#define ERRNO_EINPROGRESS(e) ((e) == WSAEINPROGRESS)
|
|
|
|
#define ERRNO_CONN_EINPROGRESS(e) ((e) == WSAEINPROGRESS || (e) == WSAEINVAL)
|
2003-08-14 19:13:52 +02:00
|
|
|
int correct_socket_errno(int s);
|
|
|
|
#else
|
|
|
|
#define ERRNO_EAGAIN(e) ((e) == EAGAIN)
|
|
|
|
#define ERRNO_EINPROGRESS(e) ((e) == EINPROGRESS)
|
|
|
|
#define ERRNO_CONN_EINPROGRESS(e) ((e) == EINPROGRESS)
|
|
|
|
#define correct_socket_errno(s) (errno)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2003-04-16 19:04:58 +02:00
|
|
|
#endif
|