2005-04-01 22:15:56 +02:00
|
|
|
/* Copyright 2003 Roger Dingledine
|
2006-02-09 06:46:49 +01:00
|
|
|
* Copyright 2004-2006 Roger Dingledine, Nick Mathewson */
|
2003-04-16 19:04:58 +02:00
|
|
|
/* See LICENSE for licensing information */
|
|
|
|
/* $Id$ */
|
2004-11-29 23:25:31 +01:00
|
|
|
const char util_c_id[] = "$Id$";
|
2003-04-16 19:04:58 +02:00
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/**
|
|
|
|
* \file util.c
|
|
|
|
* \brief Common functions for strings, IO, network, data structures,
|
2004-11-01 21:41:47 +01:00
|
|
|
* process control.
|
2004-05-07 19:04:12 +02:00
|
|
|
**/
|
2004-05-01 22:46:28 +02:00
|
|
|
|
2004-08-07 04:46:16 +02:00
|
|
|
/* This is required on rh7 to make strptime not complain.
|
|
|
|
*/
|
|
|
|
#define _GNU_SOURCE
|
|
|
|
|
2004-04-03 06:05:12 +02:00
|
|
|
#include "orconfig.h"
|
2004-11-04 05:01:19 +01:00
|
|
|
#include "util.h"
|
|
|
|
#include "log.h"
|
|
|
|
#include "crypto.h"
|
2004-12-02 05:33:01 +01:00
|
|
|
#include "torint.h"
|
2005-09-03 06:40:05 +02:00
|
|
|
#include "container.h"
|
2004-04-28 22:13:21 +02:00
|
|
|
|
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
#include <io.h>
|
|
|
|
#include <direct.h>
|
2006-12-15 06:12:52 +01:00
|
|
|
#include <process.h>
|
2005-09-03 06:40:05 +02:00
|
|
|
#else
|
|
|
|
#include <dirent.h>
|
2005-12-05 02:28:10 +01:00
|
|
|
#include <pwd.h>
|
2004-04-28 22:13:21 +02:00
|
|
|
#endif
|
|
|
|
|
2004-11-01 22:54:12 +01:00
|
|
|
#ifdef HAVE_CTYPE_H
|
|
|
|
#include <ctype.h>
|
|
|
|
#endif
|
2004-04-03 06:05:12 +02:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <assert.h>
|
2004-08-04 01:31:22 +02:00
|
|
|
|
2004-04-03 06:05:12 +02:00
|
|
|
#ifdef HAVE_NETINET_IN_H
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_ARPA_INET_H
|
|
|
|
#include <arpa/inet.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_ERRNO_H
|
|
|
|
#include <errno.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_SOCKET_H
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#endif
|
2004-11-01 09:24:34 +01:00
|
|
|
#ifdef HAVE_SYS_TIME_H
|
|
|
|
#include <sys/time.h>
|
|
|
|
#endif
|
2004-04-03 06:05:12 +02:00
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_STAT_H
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_FCNTL_H
|
|
|
|
#include <sys/fcntl.h>
|
|
|
|
#endif
|
2004-04-28 22:13:21 +02:00
|
|
|
#ifdef HAVE_FCNTL_H
|
|
|
|
#include <fcntl.h>
|
2004-04-28 21:35:12 +02:00
|
|
|
#endif
|
2005-08-12 19:24:53 +02:00
|
|
|
#ifdef HAVE_TIME_H
|
|
|
|
#include <time.h>
|
|
|
|
#endif
|
2004-04-28 21:35:12 +02:00
|
|
|
|
2004-09-08 09:16:34 +02:00
|
|
|
#ifndef O_BINARY
|
|
|
|
#define O_BINARY 0
|
|
|
|
#endif
|
2004-11-09 20:30:50 +01:00
|
|
|
#ifndef O_TEXT
|
|
|
|
#define O_TEXT 0
|
|
|
|
#endif
|
2004-09-08 09:16:34 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/* =====
|
|
|
|
* Memory management
|
|
|
|
* ===== */
|
2005-02-03 08:25:10 +01:00
|
|
|
#ifdef USE_DMALLOC
|
|
|
|
#include <dmalloc.h>
|
2005-10-03 22:20:38 +02:00
|
|
|
#define DMALLOC_FN_ARGS , file, line
|
2005-02-03 08:25:10 +01:00
|
|
|
#else
|
|
|
|
#define dmalloc_strdup(file, line, string, xalloc_b) strdup(string)
|
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
#define dmalloc_malloc(file, line, size, func_id, alignment, xalloc_b) \
|
|
|
|
malloc(size)
|
2005-02-03 08:25:10 +01:00
|
|
|
#define DMALLOC_FUNC_MALLOC 0
|
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
#define dmalloc_realloc(file, line, old_pnt, new_size, func_id, xalloc_b) \
|
|
|
|
realloc((old_pnt), (new_size))
|
2005-02-03 08:25:10 +01:00
|
|
|
#define DMALLOC_FUNC_REALLOC 0
|
2005-09-30 00:59:17 +02:00
|
|
|
#define DMALLOC_FN_ARGS
|
2005-02-03 08:25:10 +01:00
|
|
|
#endif
|
2004-11-01 21:41:47 +01:00
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Allocate a chunk of <b>size</b> bytes of memory, and return a pointer to
|
2004-05-01 22:46:28 +02:00
|
|
|
* result. On error, log and terminate the process. (Same as malloc(size),
|
|
|
|
* but never returns NULL.)
|
2005-02-03 08:35:24 +01:00
|
|
|
*
|
|
|
|
* <b>file</b> and <b>line</b> are used if dmalloc is enabled, and
|
|
|
|
* ignored otherwise.
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2005-09-30 03:39:24 +02:00
|
|
|
void *
|
2005-10-03 22:20:38 +02:00
|
|
|
_tor_malloc(size_t size DMALLOC_PARAMS)
|
2005-09-30 00:59:17 +02:00
|
|
|
{
|
2003-05-20 08:37:34 +02:00
|
|
|
void *result;
|
|
|
|
|
2006-09-20 00:36:48 +02:00
|
|
|
#ifndef MALLOC_ZERO_WORKS
|
2004-04-08 05:05:08 +02:00
|
|
|
/* Some libcs don't do the right thing on size==0. Override them. */
|
|
|
|
if (size==0) {
|
|
|
|
size=1;
|
|
|
|
}
|
2006-09-20 00:36:48 +02:00
|
|
|
#endif
|
2005-02-03 08:25:10 +01:00
|
|
|
result = dmalloc_malloc(file, line, size, DMALLOC_FUNC_MALLOC, 0, 0);
|
2003-05-20 08:37:34 +02:00
|
|
|
|
2006-09-20 00:36:48 +02:00
|
|
|
if (PREDICT(result == NULL, 0)) {
|
2006-09-30 00:33:34 +02:00
|
|
|
log_err(LD_MM,"Out of memory on malloc(). Dying.");
|
2006-04-18 05:58:42 +02:00
|
|
|
/* If these functions die within a worker process, they won't call
|
|
|
|
* spawn_exit, but that's ok, since the parent will run out of memory soon
|
|
|
|
* anyway. */
|
2003-05-20 08:37:34 +02:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/* Allocate a chunk of <b>size</b> bytes of memory, fill the memory with
|
2004-05-01 22:46:28 +02:00
|
|
|
* zero bytes, and return a pointer to the result. Log and terminate
|
|
|
|
* the process on error. (Same as calloc(size,1), but never returns NULL.)
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void *
|
2005-10-03 22:20:38 +02:00
|
|
|
_tor_malloc_zero(size_t size DMALLOC_PARAMS)
|
2005-09-30 03:09:52 +02:00
|
|
|
{
|
2005-10-03 22:20:38 +02:00
|
|
|
void *result = _tor_malloc(size DMALLOC_FN_ARGS);
|
2003-11-18 09:20:09 +01:00
|
|
|
memset(result, 0, size);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Change the size of the memory block pointed to by <b>ptr</b> to <b>size</b>
|
2004-05-01 22:46:28 +02:00
|
|
|
* bytes long; return the new memory block. On error, log and
|
|
|
|
* terminate. (Like realloc(ptr,size), but never returns NULL.)
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void *
|
2005-10-03 22:20:38 +02:00
|
|
|
_tor_realloc(void *ptr, size_t size DMALLOC_PARAMS)
|
2005-09-30 03:09:52 +02:00
|
|
|
{
|
2003-10-14 03:11:42 +02:00
|
|
|
void *result;
|
2003-12-13 02:42:44 +01:00
|
|
|
|
2005-02-03 08:25:10 +01:00
|
|
|
result = dmalloc_realloc(file, line, ptr, size, DMALLOC_FUNC_REALLOC, 0);
|
2006-09-20 00:36:48 +02:00
|
|
|
if (PREDICT(result == NULL, 0)) {
|
2006-09-30 00:33:34 +02:00
|
|
|
log_err(LD_MM,"Out of memory on realloc(). Dying.");
|
2003-10-14 03:11:42 +02:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return a newly allocated copy of the NUL-terminated string s. On
|
2004-05-01 22:46:28 +02:00
|
|
|
* error, log and terminate. (Like strdup(s), but never returns
|
|
|
|
* NULL.)
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
char *
|
2005-10-03 22:20:38 +02:00
|
|
|
_tor_strdup(const char *s DMALLOC_PARAMS)
|
2005-09-30 03:09:52 +02:00
|
|
|
{
|
2003-10-04 05:29:09 +02:00
|
|
|
char *dup;
|
2004-04-25 21:59:38 +02:00
|
|
|
tor_assert(s);
|
2003-10-04 05:29:09 +02:00
|
|
|
|
2005-02-03 08:25:10 +01:00
|
|
|
dup = dmalloc_strdup(file, line, s, 0);
|
2006-09-20 00:36:48 +02:00
|
|
|
if (PREDICT(dup == NULL, 0)) {
|
2006-09-30 00:33:34 +02:00
|
|
|
log_err(LD_MM,"Out of memory on strdup(). Dying.");
|
2003-10-04 05:29:09 +02:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
return dup;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Allocate and return a new string containing the first <b>n</b>
|
|
|
|
* characters of <b>s</b>. If <b>s</b> is longer than <b>n</b>
|
|
|
|
* characters, only the first <b>n</b> are copied. The result is
|
|
|
|
* always NUL-terminated. (Like strndup(s,n), but never returns
|
|
|
|
* NULL.)
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
char *
|
2005-10-03 22:20:38 +02:00
|
|
|
_tor_strndup(const char *s, size_t n DMALLOC_PARAMS)
|
2005-09-30 03:09:52 +02:00
|
|
|
{
|
2003-12-09 00:45:37 +01:00
|
|
|
char *dup;
|
2004-04-25 21:59:38 +02:00
|
|
|
tor_assert(s);
|
2005-10-03 22:20:38 +02:00
|
|
|
dup = _tor_malloc((n+1) DMALLOC_FN_ARGS);
|
2004-12-01 04:48:14 +01:00
|
|
|
/* Performance note: Ordinarily we prefer strlcpy to strncpy. But
|
2004-11-12 21:41:03 +01:00
|
|
|
* this function gets called a whole lot, and platform strncpy is
|
|
|
|
* much faster than strlcpy when strlen(s) is much longer than n.
|
|
|
|
*/
|
2004-11-12 22:14:51 +01:00
|
|
|
strncpy(dup, s, n);
|
2004-11-12 21:41:03 +01:00
|
|
|
dup[n]='\0';
|
2003-12-09 00:45:37 +01:00
|
|
|
return dup;
|
2006-06-18 09:22:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/** Allocate a chunk of <b>len</b> bytes, with the same contents starting at
|
|
|
|
* <b>mem</b>. */
|
|
|
|
void *
|
|
|
|
_tor_memdup(const void *mem, size_t len DMALLOC_PARAMS)
|
|
|
|
{
|
|
|
|
char *dup;
|
|
|
|
tor_assert(mem);
|
|
|
|
dup = _tor_malloc(len DMALLOC_FN_ARGS);
|
|
|
|
memcpy(dup, mem, len);
|
|
|
|
return dup;
|
2003-12-09 00:45:37 +01:00
|
|
|
}
|
|
|
|
|
2006-09-20 01:48:14 +02:00
|
|
|
/** Helper for places that need to take a function pointer to the right
|
|
|
|
* spelling of "free()". */
|
|
|
|
void
|
2006-09-21 23:48:55 +02:00
|
|
|
_tor_free(void *mem)
|
|
|
|
{
|
2006-09-20 01:48:14 +02:00
|
|
|
tor_free(mem);
|
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/* =====
|
|
|
|
* String manipulation
|
|
|
|
* ===== */
|
|
|
|
|
2004-10-06 15:26:37 +02:00
|
|
|
/** Remove from the string <b>s</b> every character which appears in
|
|
|
|
* <b>strip</b>. Return the number of characters removed. */
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
tor_strstrip(char *s, const char *strip)
|
2004-10-06 15:26:37 +02:00
|
|
|
{
|
|
|
|
char *read = s;
|
|
|
|
while (*read) {
|
|
|
|
if (strchr(strip, *read)) {
|
|
|
|
++read;
|
|
|
|
} else {
|
|
|
|
*s++ = *read++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*s = '\0';
|
|
|
|
return read-s;
|
|
|
|
}
|
2004-03-20 02:21:19 +01:00
|
|
|
|
2004-10-07 22:58:53 +02:00
|
|
|
/** Set the <b>dest_len</b>-byte buffer <b>buf</b> to contain the
|
|
|
|
* string <b>s</b>, with the string <b>insert</b> inserted after every
|
|
|
|
* <b>n</b> characters. Return 0 on success, -1 on failure.
|
2004-10-07 23:37:06 +02:00
|
|
|
*
|
|
|
|
* If <b>rule</b> is ALWAYS_TERMINATE, then always end the string with
|
|
|
|
* <b>insert</b>, even if its length is not a multiple of <b>n</b>. If
|
|
|
|
* <b>rule</b> is NEVER_TERMINATE, then never end the string with
|
|
|
|
* <b>insert</b>, even if its length <i>is</i> a multiple of <b>n</b>.
|
|
|
|
* If <b>rule</b> is TERMINATE_IF_EVEN, then end the string with <b>insert</b>
|
|
|
|
* exactly when its length <i>is</i> a multiple of <b>n</b>.
|
2004-10-07 22:58:53 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
tor_strpartition(char *dest, size_t dest_len,
|
|
|
|
const char *s, const char *insert, size_t n,
|
|
|
|
part_finish_rule_t rule)
|
2004-10-07 22:58:53 +02:00
|
|
|
{
|
2004-10-07 23:37:06 +02:00
|
|
|
char *destp;
|
2004-10-12 22:20:19 +02:00
|
|
|
size_t len_in, len_out, len_ins;
|
|
|
|
int is_even, remaining;
|
2004-10-17 00:28:11 +02:00
|
|
|
tor_assert(s);
|
|
|
|
tor_assert(insert);
|
|
|
|
tor_assert(n > 0);
|
2004-12-02 05:33:01 +01:00
|
|
|
tor_assert(n < SIZE_T_CEILING);
|
|
|
|
tor_assert(dest_len < SIZE_T_CEILING);
|
2004-10-07 22:58:53 +02:00
|
|
|
len_in = strlen(s);
|
|
|
|
len_ins = strlen(insert);
|
2005-01-10 17:30:51 +01:00
|
|
|
tor_assert(len_in < SIZE_T_CEILING);
|
|
|
|
tor_assert(len_in/n < SIZE_T_CEILING/len_ins); /* avoid overflow */
|
2004-10-07 22:58:53 +02:00
|
|
|
len_out = len_in + (len_in/n)*len_ins;
|
2004-10-07 23:37:06 +02:00
|
|
|
is_even = (len_in%n) == 0;
|
2004-11-28 10:05:49 +01:00
|
|
|
switch (rule)
|
2004-10-07 23:37:06 +02:00
|
|
|
{
|
|
|
|
case ALWAYS_TERMINATE:
|
|
|
|
if (!is_even) len_out += len_ins;
|
|
|
|
break;
|
|
|
|
case NEVER_TERMINATE:
|
|
|
|
if (is_even && len_in) len_out -= len_ins;
|
|
|
|
break;
|
|
|
|
case TERMINATE_IF_EVEN:
|
|
|
|
break;
|
|
|
|
}
|
2004-10-07 22:58:53 +02:00
|
|
|
if (dest_len < len_out+1)
|
|
|
|
return -1;
|
2004-10-07 23:37:06 +02:00
|
|
|
destp = dest;
|
2004-10-12 22:20:19 +02:00
|
|
|
remaining = len_in;
|
2004-11-28 10:05:49 +01:00
|
|
|
while (remaining) {
|
2004-10-07 23:37:06 +02:00
|
|
|
strncpy(destp, s, n);
|
2004-10-12 22:20:19 +02:00
|
|
|
remaining -= n;
|
|
|
|
if (remaining < 0) {
|
2004-10-07 23:37:06 +02:00
|
|
|
if (rule == ALWAYS_TERMINATE)
|
2004-10-12 22:20:19 +02:00
|
|
|
strcpy(destp+n+remaining,insert);
|
2004-10-07 23:37:06 +02:00
|
|
|
break;
|
2004-10-12 22:20:19 +02:00
|
|
|
} else if (remaining == 0 && rule == NEVER_TERMINATE) {
|
2004-10-07 23:37:06 +02:00
|
|
|
*(destp+n) = '\0';
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
strcpy(destp+n, insert);
|
2004-10-07 22:58:53 +02:00
|
|
|
s += n;
|
2004-10-07 23:37:06 +02:00
|
|
|
destp += n+len_ins;
|
2004-10-07 22:58:53 +02:00
|
|
|
}
|
2004-10-07 23:37:06 +02:00
|
|
|
tor_assert(len_out == strlen(dest));
|
2004-10-07 22:58:53 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-12-01 04:48:14 +01:00
|
|
|
/** Return a pointer to a NUL-terminated hexadecimal string encoding
|
2004-05-07 19:04:12 +02:00
|
|
|
* the first <b>fromlen</b> bytes of <b>from</b>. (fromlen must be \<= 32.) The
|
2004-05-01 22:46:28 +02:00
|
|
|
* result does not need to be deallocated, but repeated calls to
|
|
|
|
* hex_str will trash old results.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
const char *
|
|
|
|
hex_str(const char *from, size_t fromlen)
|
2004-04-06 22:16:12 +02:00
|
|
|
{
|
|
|
|
static char buf[65];
|
|
|
|
if (fromlen>(sizeof(buf)-1)/2)
|
|
|
|
fromlen = (sizeof(buf)-1)/2;
|
2004-08-07 03:18:02 +02:00
|
|
|
base16_encode(buf,sizeof(buf),from,fromlen);
|
2004-04-06 22:16:12 +02:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Convert all alphabetic characters in the nul-terminated string <b>s</b> to
|
|
|
|
* lowercase. */
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
tor_strlower(char *s)
|
2004-05-07 19:04:12 +02:00
|
|
|
{
|
|
|
|
while (*s) {
|
2006-08-31 19:39:51 +02:00
|
|
|
*s = TOR_TOLOWER(*s);
|
2004-05-07 19:04:12 +02:00
|
|
|
++s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-09-08 20:33:51 +02:00
|
|
|
/** Convert all alphabetic characters in the nul-terminated string <b>s</b> to
|
|
|
|
* lowercase. */
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
tor_strupper(char *s)
|
2005-09-08 20:33:51 +02:00
|
|
|
{
|
|
|
|
while (*s) {
|
2006-08-31 19:39:51 +02:00
|
|
|
*s = TOR_TOUPPER(*s);
|
2005-09-08 20:33:51 +02:00
|
|
|
++s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-03-16 00:35:55 +01:00
|
|
|
/** Return 1 if every character in <b>s</b> is printable, else return 0.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
tor_strisprint(const char *s)
|
|
|
|
{
|
|
|
|
while (*s) {
|
|
|
|
if (!TOR_ISPRINT(*s))
|
|
|
|
return 0;
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-07-31 20:01:37 +02:00
|
|
|
/** Return 1 if no character in <b>s</b> is uppercase, else return 0.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
tor_strisnonupper(const char *s)
|
|
|
|
{
|
|
|
|
while (*s) {
|
2006-07-31 22:19:58 +02:00
|
|
|
if (TOR_ISUPPER(*s))
|
2006-07-31 20:01:37 +02:00
|
|
|
return 0;
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2004-09-02 20:25:50 +02:00
|
|
|
/* Compares the first strlen(s2) characters of s1 with s2. Returns as for
|
|
|
|
* strcmp.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
strcmpstart(const char *s1, const char *s2)
|
2004-09-02 20:25:50 +02:00
|
|
|
{
|
|
|
|
size_t n = strlen(s2);
|
|
|
|
return strncmp(s1, s2, n);
|
|
|
|
}
|
|
|
|
|
2004-11-30 04:10:56 +01:00
|
|
|
/* Compares the first strlen(s2) characters of s1 with s2. Returns as for
|
|
|
|
* strcasecmp.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
strcasecmpstart(const char *s1, const char *s2)
|
2004-11-30 04:10:56 +01:00
|
|
|
{
|
|
|
|
size_t n = strlen(s2);
|
|
|
|
return strncasecmp(s1, s2, n);
|
|
|
|
}
|
|
|
|
|
2004-11-09 19:22:17 +01:00
|
|
|
/* Compares the last strlen(s2) characters of s1 with s2. Returns as for
|
|
|
|
* strcmp.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
strcmpend(const char *s1, const char *s2)
|
2004-11-09 19:22:17 +01:00
|
|
|
{
|
|
|
|
size_t n1 = strlen(s1), n2 = strlen(s2);
|
|
|
|
if (n2>n1)
|
|
|
|
return strcmp(s1,s2);
|
|
|
|
else
|
|
|
|
return strncmp(s1+(n1-n2), s2, n2);
|
|
|
|
}
|
|
|
|
|
2004-11-30 04:10:56 +01:00
|
|
|
/* Compares the last strlen(s2) characters of s1 with s2. Returns as for
|
|
|
|
* strcasecmp.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
strcasecmpend(const char *s1, const char *s2)
|
2004-11-30 04:10:56 +01:00
|
|
|
{
|
|
|
|
size_t n1 = strlen(s1), n2 = strlen(s2);
|
2004-11-30 09:54:08 +01:00
|
|
|
if (n2>n1) /* then they can't be the same; figure out which is bigger */
|
2004-11-30 04:10:56 +01:00
|
|
|
return strcasecmp(s1,s2);
|
|
|
|
else
|
|
|
|
return strncasecmp(s1+(n1-n2), s2, n2);
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return a pointer to the first char of s that is not whitespace and
|
2004-05-01 23:41:23 +02:00
|
|
|
* not a comment, or to the terminating NUL if no such character exists.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
const char *
|
|
|
|
eat_whitespace(const char *s)
|
|
|
|
{
|
2004-04-25 21:59:38 +02:00
|
|
|
tor_assert(s);
|
2003-11-12 20:34:19 +01:00
|
|
|
|
2006-09-20 01:55:35 +02:00
|
|
|
while (1) {
|
|
|
|
switch (*s) {
|
|
|
|
case '\0':
|
|
|
|
default:
|
|
|
|
return s;
|
|
|
|
case ' ':
|
|
|
|
case '\t':
|
|
|
|
case '\n':
|
|
|
|
case '\r':
|
|
|
|
++s;
|
|
|
|
break;
|
|
|
|
case '#':
|
|
|
|
++s;
|
2004-11-28 10:05:49 +01:00
|
|
|
while (*s && *s != '\n')
|
2006-09-20 01:55:35 +02:00
|
|
|
++s;
|
2003-11-12 20:34:19 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return a pointer to the first char of s that is not a space or a tab,
|
2004-05-01 23:41:23 +02:00
|
|
|
* or to the terminating NUL if no such character exists. */
|
2005-09-30 03:09:52 +02:00
|
|
|
const char *
|
|
|
|
eat_whitespace_no_nl(const char *s)
|
|
|
|
{
|
2004-11-28 10:05:49 +01:00
|
|
|
while (*s == ' ' || *s == '\t')
|
2003-11-12 20:34:19 +01:00
|
|
|
++s;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return a pointer to the first char of s that is whitespace or <b>#</b>,
|
2004-05-01 23:50:53 +02:00
|
|
|
* or to the terminating NUL if no such character exists.
|
2004-05-01 23:41:23 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
const char *
|
|
|
|
find_whitespace(const char *s)
|
|
|
|
{
|
2005-10-18 07:06:36 +02:00
|
|
|
/* tor_assert(s); */
|
2006-09-20 00:20:09 +02:00
|
|
|
while (1) {
|
|
|
|
switch (*s)
|
|
|
|
{
|
|
|
|
case '\0':
|
|
|
|
case '#':
|
|
|
|
case ' ':
|
|
|
|
case '\r':
|
|
|
|
case '\n':
|
|
|
|
case '\t':
|
|
|
|
return s;
|
|
|
|
default:
|
|
|
|
++s;
|
|
|
|
}
|
|
|
|
}
|
2003-11-12 20:34:19 +01:00
|
|
|
}
|
|
|
|
|
2006-07-23 07:32:35 +02:00
|
|
|
/** Return true iff the 'len' bytes at 'mem' are all zero. */
|
2006-07-23 09:19:49 +02:00
|
|
|
int
|
|
|
|
tor_mem_is_zero(const char *mem, size_t len)
|
2006-07-23 07:32:35 +02:00
|
|
|
{
|
|
|
|
static const char ZERO[] = {
|
|
|
|
0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0,
|
|
|
|
};
|
|
|
|
while (len >= sizeof(ZERO)) {
|
|
|
|
if (memcmp(mem, ZERO, sizeof(ZERO)))
|
|
|
|
return 0;
|
|
|
|
len -= sizeof(ZERO);
|
|
|
|
mem += sizeof(ZERO);
|
|
|
|
}
|
|
|
|
/* Deal with leftover bytes. */
|
|
|
|
if (len)
|
|
|
|
return ! memcmp(mem, ZERO, len);
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2005-11-30 03:47:59 +01:00
|
|
|
/** Return true iff the DIGEST_LEN bytes in digest are all zero. */
|
|
|
|
int
|
|
|
|
tor_digest_is_zero(const char *digest)
|
|
|
|
{
|
2006-07-23 07:32:35 +02:00
|
|
|
return tor_mem_is_zero(digest, DIGEST_LEN);
|
2005-11-30 03:47:59 +01:00
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/* Helper: common code to check whether the result of a strtol or strtoul or
|
|
|
|
* strtoll is correct. */
|
2004-11-05 18:54:50 +01:00
|
|
|
#define CHECK_STRTOX_RESULT() \
|
|
|
|
/* Was at least one character converted? */ \
|
|
|
|
if (endptr == s) \
|
|
|
|
goto err; \
|
|
|
|
/* Were there unexpected unconverted characters? */ \
|
|
|
|
if (!next && *endptr) \
|
|
|
|
goto err; \
|
|
|
|
/* Is r within limits? */ \
|
|
|
|
if (r < min || r > max) \
|
|
|
|
goto err; \
|
|
|
|
if (ok) *ok = 1; \
|
|
|
|
if (next) *next = endptr; \
|
|
|
|
return r; \
|
|
|
|
err: \
|
|
|
|
if (ok) *ok = 0; \
|
|
|
|
if (next) *next = endptr; \
|
2005-11-15 04:05:23 +01:00
|
|
|
return 0
|
2004-11-05 18:54:50 +01:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/** Extract a long from the start of s, in the given numeric base. If
|
|
|
|
* there is unconverted data and next is provided, set *next to the
|
|
|
|
* first unconverted character. An error has occurred if no characters
|
|
|
|
* are converted; or if there are unconverted characters and next is NULL; or
|
|
|
|
* if the parsed value is not between min and max. When no error occurs,
|
|
|
|
* return the parsed value and set *ok (if provided) to 1. When an error
|
2004-12-01 04:48:14 +01:00
|
|
|
* occurs, return 0 and set *ok (if provided) to 0.
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2003-04-16 19:04:58 +02:00
|
|
|
long
|
2004-11-01 21:41:47 +01:00
|
|
|
tor_parse_long(const char *s, int base, long min, long max,
|
|
|
|
int *ok, char **next)
|
2003-04-16 19:04:58 +02:00
|
|
|
{
|
2004-11-01 21:41:47 +01:00
|
|
|
char *endptr;
|
|
|
|
long r;
|
2003-04-17 04:03:55 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
r = strtol(s, &endptr, base);
|
2004-11-05 18:54:50 +01:00
|
|
|
CHECK_STRTOX_RESULT();
|
2004-11-01 21:41:47 +01:00
|
|
|
}
|
|
|
|
|
2006-10-07 08:28:50 +02:00
|
|
|
/** As tor_parse_log, but return an unsigned long. */
|
2004-11-01 21:41:47 +01:00
|
|
|
unsigned long
|
|
|
|
tor_parse_ulong(const char *s, int base, unsigned long min,
|
|
|
|
unsigned long max, int *ok, char **next)
|
|
|
|
{
|
|
|
|
char *endptr;
|
|
|
|
unsigned long r;
|
|
|
|
|
2004-11-05 18:54:50 +01:00
|
|
|
r = strtoul(s, &endptr, base);
|
|
|
|
CHECK_STRTOX_RESULT();
|
2004-11-01 21:41:47 +01:00
|
|
|
}
|
2004-11-05 18:54:50 +01:00
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** As tor_parse_log, but return a unit64_t. Only base 10 is guaranteed to
|
|
|
|
* work for now. */
|
2004-11-05 18:54:50 +01:00
|
|
|
uint64_t
|
|
|
|
tor_parse_uint64(const char *s, int base, uint64_t min,
|
|
|
|
uint64_t max, int *ok, char **next)
|
|
|
|
{
|
|
|
|
char *endptr;
|
|
|
|
uint64_t r;
|
|
|
|
|
|
|
|
#ifdef HAVE_STRTOULL
|
|
|
|
r = (uint64_t)strtoull(s, &endptr, base);
|
|
|
|
#elif defined(MS_WINDOWS)
|
2004-11-09 20:13:08 +01:00
|
|
|
#if _MSC_VER < 1300
|
|
|
|
tor_assert(base <= 10);
|
|
|
|
r = (uint64_t)_atoi64(s);
|
|
|
|
endptr = (char*)s;
|
2004-12-08 01:42:50 +01:00
|
|
|
while (TOR_ISSPACE(*endptr)) endptr++;
|
|
|
|
while (TOR_ISDIGIT(*endptr)) endptr++;
|
2004-11-09 20:13:08 +01:00
|
|
|
#else
|
2004-11-05 18:54:50 +01:00
|
|
|
r = (uint64_t)_strtoui64(s, &endptr, base);
|
2004-11-09 20:13:08 +01:00
|
|
|
#endif
|
2004-11-05 18:54:50 +01:00
|
|
|
#elif SIZEOF_LONG == 8
|
|
|
|
r = (uint64_t)strtoul(s, &endptr, base);
|
|
|
|
#else
|
|
|
|
#error "I don't know how to parse 64-bit numbers."
|
2004-11-02 03:28:51 +01:00
|
|
|
#endif
|
2004-11-01 21:41:47 +01:00
|
|
|
|
2004-11-05 18:54:50 +01:00
|
|
|
CHECK_STRTOX_RESULT();
|
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** Encode the <b>srclen</b> bytes at <b>src</b> in a NUL-terminated,
|
|
|
|
* uppercase hexadecimal string; store it in the <b>destlen</b>-byte buffer
|
|
|
|
* <b>dest</b>.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
base16_encode(char *dest, size_t destlen, const char *src, size_t srclen)
|
2004-11-01 21:41:47 +01:00
|
|
|
{
|
|
|
|
const char *end;
|
|
|
|
char *cp;
|
|
|
|
|
|
|
|
tor_assert(destlen >= srclen*2+1);
|
2004-12-02 05:33:01 +01:00
|
|
|
tor_assert(destlen < SIZE_T_CEILING);
|
2004-11-01 21:41:47 +01:00
|
|
|
|
|
|
|
cp = dest;
|
|
|
|
end = src+srclen;
|
|
|
|
while (src<end) {
|
|
|
|
sprintf(cp,"%02X",*(const uint8_t*)src);
|
|
|
|
++src;
|
|
|
|
cp += 2;
|
|
|
|
}
|
|
|
|
*cp = '\0';
|
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** Helper: given a hex digit, return its value, or -1 if it isn't hex. */
|
2005-09-30 03:09:52 +02:00
|
|
|
static INLINE int
|
|
|
|
hex_decode_digit(char c)
|
2004-11-01 21:41:47 +01:00
|
|
|
{
|
2006-09-29 20:13:37 +02:00
|
|
|
switch (c) {
|
|
|
|
case '0': return 0;
|
|
|
|
case '1': return 1;
|
|
|
|
case '2': return 2;
|
|
|
|
case '3': return 3;
|
|
|
|
case '4': return 4;
|
|
|
|
case '5': return 5;
|
|
|
|
case '6': return 6;
|
|
|
|
case '7': return 7;
|
|
|
|
case '8': return 8;
|
|
|
|
case '9': return 9;
|
|
|
|
case 'A': case 'a': return 10;
|
|
|
|
case 'B': case 'b': return 11;
|
|
|
|
case 'C': case 'c': return 12;
|
|
|
|
case 'D': case 'd': return 13;
|
|
|
|
case 'E': case 'e': return 14;
|
|
|
|
case 'F': case 'f': return 15;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
2004-11-01 21:41:47 +01:00
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** Given a hexadecimal string of <b>srclen</b> bytes in <b>src/b>, decode it
|
|
|
|
* and store the result in the <b>destlen</b>-byte buffer at <b>dest</b>.
|
|
|
|
* Return 0 on success, -1 on failure. */
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
base16_decode(char *dest, size_t destlen, const char *src, size_t srclen)
|
2004-11-01 21:41:47 +01:00
|
|
|
{
|
|
|
|
const char *end;
|
|
|
|
int v1,v2;
|
|
|
|
if ((srclen % 2) != 0)
|
|
|
|
return -1;
|
2004-12-02 05:33:01 +01:00
|
|
|
if (destlen < srclen/2 || destlen > SIZE_T_CEILING)
|
2004-11-01 21:41:47 +01:00
|
|
|
return -1;
|
|
|
|
end = src+srclen;
|
|
|
|
while (src<end) {
|
|
|
|
v1 = hex_decode_digit(*src);
|
|
|
|
v2 = hex_decode_digit(*(src+1));
|
2004-11-28 10:05:49 +01:00
|
|
|
if (v1<0||v2<0)
|
2004-11-01 21:41:47 +01:00
|
|
|
return -1;
|
|
|
|
*(uint8_t*)dest = (v1<<4)|v2;
|
|
|
|
++dest;
|
|
|
|
src+=2;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-03-05 10:50:26 +01:00
|
|
|
/** Allocate and return a new string representing the contents of <b>s</b>,
|
|
|
|
* surrounded by quotes and using standard C escapes.
|
|
|
|
*
|
|
|
|
* Generally, we use this for logging values that come in over the network
|
|
|
|
* to keep them from tricking users.
|
|
|
|
*
|
|
|
|
* We trust values from the resolver, OS, configuration file, and command line
|
|
|
|
* to not be maliciously ill-formed. We validate incoming routerdescs and
|
|
|
|
* SOCKS requests and addresses from BEGIN cells as they're parsed;
|
|
|
|
* afterwards, we trust them as non-malicious.
|
|
|
|
*/
|
|
|
|
char *
|
|
|
|
esc_for_log(const char *s)
|
|
|
|
{
|
|
|
|
const char *cp;
|
|
|
|
char *result, *outp;
|
|
|
|
size_t len = 3;
|
2006-03-11 03:21:30 +01:00
|
|
|
if (!s) {
|
|
|
|
return tor_strdup("");
|
|
|
|
}
|
|
|
|
|
2006-03-05 10:50:26 +01:00
|
|
|
for (cp = s; *cp; ++cp) {
|
|
|
|
switch (*cp) {
|
|
|
|
case '\\':
|
|
|
|
case '\"':
|
|
|
|
case '\'':
|
|
|
|
len += 2;
|
|
|
|
break;
|
|
|
|
default:
|
2006-06-09 17:57:58 +02:00
|
|
|
if (TOR_ISPRINT(*cp) && ((uint8_t)*cp)<127)
|
2006-03-05 10:50:26 +01:00
|
|
|
++len;
|
|
|
|
else
|
|
|
|
len += 4;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
result = outp = tor_malloc(len);
|
|
|
|
*outp++ = '\"';
|
|
|
|
for (cp = s; *cp; ++cp) {
|
|
|
|
switch (*cp) {
|
|
|
|
case '\\':
|
|
|
|
case '\"':
|
|
|
|
case '\'':
|
|
|
|
*outp++ = '\\';
|
|
|
|
*outp++ = *cp;
|
|
|
|
break;
|
|
|
|
case '\n':
|
|
|
|
*outp++ = '\\';
|
|
|
|
*outp++ = 'n';
|
|
|
|
break;
|
|
|
|
case '\t':
|
|
|
|
*outp++ = '\\';
|
|
|
|
*outp++ = 't';
|
|
|
|
break;
|
|
|
|
case '\r':
|
|
|
|
*outp++ = '\\';
|
|
|
|
*outp++ = 'r';
|
|
|
|
break;
|
|
|
|
default:
|
2006-06-09 17:57:58 +02:00
|
|
|
if (TOR_ISPRINT(*cp) && ((uint8_t)*cp)<127) {
|
2006-03-05 10:50:26 +01:00
|
|
|
*outp++ = *cp;
|
|
|
|
} else {
|
2006-06-09 19:07:22 +02:00
|
|
|
tor_snprintf(outp, 5, "\\%03o", (int)(uint8_t) *cp);
|
2006-03-05 10:50:26 +01:00
|
|
|
outp += 4;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*outp++ = '\"';
|
|
|
|
*outp++ = 0;
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Allocate and return a new string representing the contents of <b>s</b>,
|
|
|
|
* surrounded by quotes and using standard C escapes.
|
|
|
|
*
|
|
|
|
* THIS FUNCTION IS NOT REENTRANT. Don't call it from outside the main
|
|
|
|
* thread. Also, each call invalidates the last-returned value, so don't
|
|
|
|
* try log_warn(LD_GENERAL, "%s %s", escaped(a), escaped(b));
|
|
|
|
*/
|
|
|
|
const char *
|
|
|
|
escaped(const char *s)
|
|
|
|
{
|
|
|
|
static char *_escaped_val = NULL;
|
|
|
|
if (_escaped_val)
|
|
|
|
tor_free(_escaped_val);
|
|
|
|
|
|
|
|
if (s)
|
|
|
|
_escaped_val = esc_for_log(s);
|
|
|
|
else
|
|
|
|
_escaped_val = NULL;
|
|
|
|
|
|
|
|
return _escaped_val;
|
|
|
|
}
|
|
|
|
|
2006-12-15 22:26:23 +01:00
|
|
|
/** Rudimentary string wrapping code: given a un-wrapped <b>string</b> (no
|
|
|
|
* newlines!), break the string into newline-terminated lines of no more than
|
|
|
|
* <b>width</b> characters long (not counting newline) and insert them into
|
|
|
|
* <b>out</b> in order. Precede the first line with prefix0, and subsequent
|
|
|
|
* lines with prefixRest.
|
|
|
|
*/
|
|
|
|
/* This uses a stupid greedy wrapping algorithm right now:
|
|
|
|
* - For each line:
|
|
|
|
* - Try to fit as much stuff as possible, but break on a space.
|
|
|
|
* - If the first "word" of the line will extend beyond the allowable
|
|
|
|
* width, break the word at the end of the width.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
wrap_string(smartlist_t *out, const char *string, size_t width,
|
|
|
|
const char *prefix0, const char *prefixRest)
|
|
|
|
{
|
|
|
|
size_t p0Len, pRestLen, pCurLen;
|
|
|
|
const char *eos, *prefixCur;
|
|
|
|
tor_assert(out);
|
|
|
|
tor_assert(string);
|
|
|
|
tor_assert(width);
|
|
|
|
if (!prefix0)
|
|
|
|
prefix0 = "";
|
|
|
|
if (!prefixRest)
|
|
|
|
prefixRest = "";
|
|
|
|
|
|
|
|
p0Len = strlen(prefix0);
|
|
|
|
pRestLen = strlen(prefixRest);
|
|
|
|
tor_assert(width > p0Len && width > pRestLen);
|
|
|
|
eos = strchr(string, '\0');
|
|
|
|
tor_assert(eos);
|
|
|
|
pCurLen = p0Len;
|
|
|
|
prefixCur = prefix0;
|
|
|
|
|
|
|
|
while ((eos-string)+pCurLen > width) {
|
|
|
|
const char *eol = string + width - pCurLen;
|
|
|
|
while (eol > string && *eol != ' ')
|
|
|
|
--eol;
|
|
|
|
/* eol is now the last space that can fit, or the start of the string. */
|
|
|
|
if (eol > string) {
|
|
|
|
size_t line_len = (eol-string) + pCurLen + 2;
|
|
|
|
char *line = tor_malloc(line_len);
|
|
|
|
memcpy(line, prefixCur, pCurLen);
|
|
|
|
memcpy(line+pCurLen, string, eol-string);
|
|
|
|
line[line_len-2] = '\n';
|
|
|
|
line[line_len-1] = '\0';
|
|
|
|
smartlist_add(out, line);
|
|
|
|
string = eol + 1;
|
|
|
|
} else {
|
|
|
|
size_t line_len = width + 2;
|
|
|
|
char *line = tor_malloc(line_len);
|
|
|
|
memcpy(line, prefixCur, pCurLen);
|
|
|
|
memcpy(line+pCurLen, string, width - pCurLen);
|
|
|
|
line[line_len-2] = '\n';
|
|
|
|
line[line_len-1] = '\0';
|
|
|
|
smartlist_add(out, line);
|
|
|
|
string += width-pCurLen;
|
|
|
|
}
|
|
|
|
prefixCur = prefixRest;
|
|
|
|
pCurLen = pRestLen;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (string < eos) {
|
|
|
|
size_t line_len = (eos-string) + pCurLen + 2;
|
|
|
|
char *line = tor_malloc(line_len);
|
|
|
|
memcpy(line, prefixCur, pCurLen);
|
|
|
|
memcpy(line+pCurLen, string, eos-string);
|
|
|
|
line[line_len-2] = '\n';
|
|
|
|
line[line_len-1] = '\0';
|
|
|
|
smartlist_add(out, line);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/* =====
|
|
|
|
* Time
|
|
|
|
* ===== */
|
|
|
|
|
|
|
|
/** Return the number of microseconds elapsed between *start and *end.
|
|
|
|
*/
|
|
|
|
long
|
|
|
|
tv_udiff(struct timeval *start, struct timeval *end)
|
|
|
|
{
|
|
|
|
long udiff;
|
|
|
|
long secdiff = end->tv_sec - start->tv_sec;
|
|
|
|
|
2004-11-23 01:08:26 +01:00
|
|
|
if (labs(secdiff+1) > LONG_MAX/1000000) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_GENERAL, "comparing times too far apart.");
|
2004-11-01 21:41:47 +01:00
|
|
|
return LONG_MAX;
|
|
|
|
}
|
|
|
|
|
|
|
|
udiff = secdiff*1000000L + (end->tv_usec - start->tv_usec);
|
2003-04-17 01:22:05 +02:00
|
|
|
return udiff;
|
2003-04-16 19:04:58 +02:00
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return -1 if *a \< *b, 0 if *a==*b, and 1 if *a \> *b.
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
tv_cmp(struct timeval *a, struct timeval *b)
|
|
|
|
{
|
2003-04-16 19:04:58 +02:00
|
|
|
if (a->tv_sec > b->tv_sec)
|
|
|
|
return 1;
|
|
|
|
if (a->tv_sec < b->tv_sec)
|
|
|
|
return -1;
|
|
|
|
if (a->tv_usec > b->tv_usec)
|
|
|
|
return 1;
|
|
|
|
if (a->tv_usec < b->tv_usec)
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Increment *a by the number of seconds and microseconds in *b.
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
tv_add(struct timeval *a, struct timeval *b)
|
|
|
|
{
|
2003-04-16 19:04:58 +02:00
|
|
|
a->tv_usec += b->tv_usec;
|
|
|
|
a->tv_sec += b->tv_sec + (a->tv_usec / 1000000);
|
|
|
|
a->tv_usec %= 1000000;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Increment *a by <b>ms</b> milliseconds.
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
tv_addms(struct timeval *a, long ms)
|
|
|
|
{
|
2003-04-16 19:04:58 +02:00
|
|
|
a->tv_usec += (ms * 1000) % 1000000;
|
|
|
|
a->tv_sec += ((ms * 1000) / 1000000) + (a->tv_usec / 1000000);
|
|
|
|
a->tv_usec %= 1000000;
|
|
|
|
}
|
2003-08-12 05:08:41 +02:00
|
|
|
|
2003-11-10 07:28:53 +01:00
|
|
|
#define IS_LEAPYEAR(y) (!(y % 4) && ((y % 100) || !(y % 400)))
|
2005-09-30 03:09:52 +02:00
|
|
|
static int
|
|
|
|
n_leapdays(int y1, int y2)
|
|
|
|
{
|
2003-11-10 07:28:53 +01:00
|
|
|
--y1;
|
|
|
|
--y2;
|
|
|
|
return (y2/4 - y1/4) - (y2/100 - y1/100) + (y2/400 - y1/400);
|
|
|
|
}
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Number of days per month in non-leap year; used by tor_timegm. */
|
2003-12-17 22:14:13 +01:00
|
|
|
static const int days_per_month[] =
|
2003-11-10 07:28:53 +01:00
|
|
|
{ 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return a time_t given a struct tm. The result is given in GMT, and
|
2004-05-01 22:46:28 +02:00
|
|
|
* does not account for leap seconds.
|
|
|
|
*/
|
2004-11-23 00:28:26 +01:00
|
|
|
time_t
|
2005-09-30 03:09:52 +02:00
|
|
|
tor_timegm(struct tm *tm)
|
|
|
|
{
|
2003-12-17 22:14:13 +01:00
|
|
|
/* This is a pretty ironclad timegm implementation, snarfed from Python2.2.
|
2003-11-10 07:28:53 +01:00
|
|
|
* It's way more brute-force than fiddling with tzset().
|
|
|
|
*/
|
2003-10-20 22:19:59 +02:00
|
|
|
time_t ret;
|
2003-11-10 07:28:53 +01:00
|
|
|
unsigned long year, days, hours, minutes;
|
|
|
|
int i;
|
|
|
|
year = tm->tm_year + 1900;
|
2006-01-02 00:09:19 +01:00
|
|
|
if (year < 1970 || tm->tm_mon < 0 || tm->tm_mon > 11) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_BUG, "Out-of-range argument to tor_timegm");
|
2006-01-02 00:13:19 +01:00
|
|
|
return -1;
|
2006-01-02 00:09:19 +01:00
|
|
|
}
|
2003-11-10 07:28:53 +01:00
|
|
|
days = 365 * (year-1970) + n_leapdays(1970,year);
|
|
|
|
for (i = 0; i < tm->tm_mon; ++i)
|
|
|
|
days += days_per_month[i];
|
|
|
|
if (tm->tm_mon > 1 && IS_LEAPYEAR(year))
|
|
|
|
++days;
|
|
|
|
days += tm->tm_mday - 1;
|
|
|
|
hours = days*24 + tm->tm_hour;
|
2003-12-17 22:14:13 +01:00
|
|
|
|
2003-11-10 07:28:53 +01:00
|
|
|
minutes = hours*60 + tm->tm_min;
|
|
|
|
ret = minutes*60 + tm->tm_sec;
|
2003-10-20 22:19:59 +02:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2004-08-04 03:11:15 +02:00
|
|
|
/* strftime is locale-specific, so we need to replace those parts */
|
|
|
|
static const char *WEEKDAY_NAMES[] =
|
|
|
|
{ "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" };
|
|
|
|
static const char *MONTH_NAMES[] =
|
|
|
|
{ "Jan", "Feb", "Mar", "Apr", "May", "Jun",
|
|
|
|
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec" };
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** Set <b>buf</b> to the RFC1123 encoding of the GMT value of <b>t</b>.
|
|
|
|
* The buffer must be at least RFC1123_TIME_LEN+1 bytes long.
|
|
|
|
*
|
|
|
|
* (RFC1123 format is Fri, 29 Sep 2006 15:54:20 GMT)
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
format_rfc1123_time(char *buf, time_t t)
|
|
|
|
{
|
2005-02-22 08:03:03 +01:00
|
|
|
struct tm tm;
|
2004-08-04 03:11:15 +02:00
|
|
|
|
2005-02-22 08:03:03 +01:00
|
|
|
tor_gmtime_r(&t, &tm);
|
|
|
|
|
|
|
|
strftime(buf, RFC1123_TIME_LEN+1, "___, %d ___ %Y %H:%M:%S GMT", &tm);
|
|
|
|
tor_assert(tm.tm_wday >= 0);
|
|
|
|
tor_assert(tm.tm_wday <= 6);
|
|
|
|
memcpy(buf, WEEKDAY_NAMES[tm.tm_wday], 3);
|
|
|
|
tor_assert(tm.tm_wday >= 0);
|
|
|
|
tor_assert(tm.tm_mon <= 11);
|
|
|
|
memcpy(buf+8, MONTH_NAMES[tm.tm_mon], 3);
|
2004-08-04 03:11:15 +02:00
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** Parse the the RFC1123 encoding of some time (in GMT) from <b>buf</b>,
|
|
|
|
* and store the result in *<b>t</b>.
|
|
|
|
*
|
|
|
|
* Return 0 on succcess, -1 on failure.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
parse_rfc1123_time(const char *buf, time_t *t)
|
|
|
|
{
|
2004-08-04 03:11:15 +02:00
|
|
|
struct tm tm;
|
|
|
|
char month[4];
|
|
|
|
char weekday[4];
|
|
|
|
int i, m;
|
|
|
|
|
|
|
|
if (strlen(buf) != RFC1123_TIME_LEN)
|
|
|
|
return -1;
|
|
|
|
memset(&tm, 0, sizeof(tm));
|
|
|
|
if (sscanf(buf, "%3s, %d %3s %d %d:%d:%d GMT", weekday,
|
|
|
|
&tm.tm_mday, month, &tm.tm_year, &tm.tm_hour,
|
|
|
|
&tm.tm_min, &tm.tm_sec) < 7) {
|
2006-03-05 10:50:26 +01:00
|
|
|
char *esc = esc_for_log(buf);
|
|
|
|
log_warn(LD_GENERAL, "Got invalid RFC1123 time %s", esc);
|
|
|
|
tor_free(esc);
|
2004-08-04 03:11:15 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
m = -1;
|
|
|
|
for (i = 0; i < 12; ++i) {
|
|
|
|
if (!strcmp(month, MONTH_NAMES[i])) {
|
|
|
|
m = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (m<0) {
|
2006-03-05 10:50:26 +01:00
|
|
|
char *esc = esc_for_log(buf);
|
2006-09-30 00:33:40 +02:00
|
|
|
log_warn(LD_GENERAL, "Got invalid RFC1123 time %s: No such month", esc);
|
2006-03-05 10:50:26 +01:00
|
|
|
tor_free(esc);
|
2004-08-04 03:11:15 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
tm.tm_mon = m;
|
2006-01-02 00:09:19 +01:00
|
|
|
|
|
|
|
if (tm.tm_year < 1970) {
|
2006-03-05 10:50:26 +01:00
|
|
|
char *esc = esc_for_log(buf);
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_GENERAL,
|
2006-03-05 10:50:26 +01:00
|
|
|
"Got invalid RFC1123 time %s. (Before 1970)", esc);
|
|
|
|
tor_free(esc);
|
2006-01-02 00:09:19 +01:00
|
|
|
return -1;
|
|
|
|
}
|
2004-08-04 03:11:15 +02:00
|
|
|
tm.tm_year -= 1900;
|
2006-01-02 00:09:19 +01:00
|
|
|
|
2004-08-04 03:11:15 +02:00
|
|
|
*t = tor_timegm(&tm);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-10-07 18:25:28 +02:00
|
|
|
/** Set <b>buf</b> to the ISO8601 encoding of the local value of <b>t</b>.
|
2006-09-29 20:13:37 +02:00
|
|
|
* The buffer must be at least ISO_TIME_LEN+1 bytes long.
|
|
|
|
*
|
2006-10-07 18:25:28 +02:00
|
|
|
* (ISO8601 format is 2006-10-29 10:57:20)
|
2006-09-29 20:13:37 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
format_local_iso_time(char *buf, time_t t)
|
|
|
|
{
|
2005-02-22 08:03:03 +01:00
|
|
|
struct tm tm;
|
|
|
|
strftime(buf, ISO_TIME_LEN+1, "%Y-%m-%d %H:%M:%S", tor_localtime_r(&t, &tm));
|
2004-11-22 22:38:44 +01:00
|
|
|
}
|
|
|
|
|
2006-10-07 18:25:28 +02:00
|
|
|
/** Set <b>buf</b> to the ISO8601 encoding of the GMT value of <b>t</b>.
|
2006-09-29 20:13:37 +02:00
|
|
|
* The buffer must be at least ISO_TIME_LEN+1 bytes long.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
format_iso_time(char *buf, time_t t)
|
|
|
|
{
|
2005-02-22 08:03:03 +01:00
|
|
|
struct tm tm;
|
|
|
|
strftime(buf, ISO_TIME_LEN+1, "%Y-%m-%d %H:%M:%S", tor_gmtime_r(&t, &tm));
|
2004-08-07 04:46:16 +02:00
|
|
|
}
|
|
|
|
|
2006-09-29 01:57:49 +02:00
|
|
|
/** Given an ISO-formatted UTC time value (after the epoch) in <b>cp</b>,
|
|
|
|
* parse it and store its value in *<b>t</b>. Return 0 on success, -1 on
|
|
|
|
* failure. Ignore extraneous stuff in <b>cp</b> separated by whitespace from
|
|
|
|
* the end of the time string. */
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
parse_iso_time(const char *cp, time_t *t)
|
|
|
|
{
|
2004-08-07 04:46:16 +02:00
|
|
|
struct tm st_tm;
|
|
|
|
#ifdef HAVE_STRPTIME
|
|
|
|
if (!strptime(cp, "%Y-%m-%d %H:%M:%S", &st_tm)) {
|
2006-09-30 00:33:40 +02:00
|
|
|
log_warn(LD_GENERAL, "ISO time was unparseable by strptime"); return -1;
|
2004-08-07 04:46:16 +02:00
|
|
|
}
|
|
|
|
#else
|
|
|
|
unsigned int year=0, month=0, day=0, hour=100, minute=100, second=100;
|
|
|
|
if (sscanf(cp, "%u-%u-%u %u:%u:%u", &year, &month,
|
|
|
|
&day, &hour, &minute, &second) < 6) {
|
2006-10-07 08:28:50 +02:00
|
|
|
log_warn(LD_GENERAL, "ISO time was unparseable"); return -1;
|
2004-08-07 04:46:16 +02:00
|
|
|
}
|
|
|
|
if (year < 1970 || month < 1 || month > 12 || day < 1 || day > 31 ||
|
|
|
|
hour > 23 || minute > 59 || second > 61) {
|
2006-09-30 00:33:40 +02:00
|
|
|
log_warn(LD_GENERAL, "ISO time was nonsensical"); return -1;
|
2004-08-07 04:46:16 +02:00
|
|
|
}
|
2004-12-06 23:39:10 +01:00
|
|
|
st_tm.tm_year = year-1900;
|
2004-08-07 04:46:16 +02:00
|
|
|
st_tm.tm_mon = month-1;
|
|
|
|
st_tm.tm_mday = day;
|
|
|
|
st_tm.tm_hour = hour;
|
|
|
|
st_tm.tm_min = minute;
|
|
|
|
st_tm.tm_sec = second;
|
|
|
|
#endif
|
2006-01-02 00:09:19 +01:00
|
|
|
if (st_tm.tm_year < 70) {
|
2006-03-05 10:50:26 +01:00
|
|
|
char *esc = esc_for_log(cp);
|
|
|
|
log_warn(LD_GENERAL, "Got invalid ISO time %s. (Before 1970)", esc);
|
|
|
|
tor_free(esc);
|
2006-01-02 00:09:19 +01:00
|
|
|
return -1;
|
|
|
|
}
|
2004-08-07 04:46:16 +02:00
|
|
|
*t = tor_timegm(&st_tm);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/* =====
|
|
|
|
* File helpers
|
|
|
|
* ===== */
|
2003-09-26 20:27:35 +02:00
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Write <b>count</b> bytes from <b>buf</b> to <b>fd</b>. <b>isSocket</b>
|
|
|
|
* must be 1 if fd was returned by socket() or accept(), and 0 if fd
|
|
|
|
* was returned by open(). Return the number of bytes written, or -1
|
|
|
|
* on error. Only use if fd is a blocking fd. */
|
2005-08-03 22:42:17 +02:00
|
|
|
int
|
2005-09-30 03:09:52 +02:00
|
|
|
write_all(int fd, const char *buf, size_t count, int isSocket)
|
|
|
|
{
|
2004-03-09 23:01:17 +01:00
|
|
|
size_t written = 0;
|
2003-08-21 01:05:22 +02:00
|
|
|
int result;
|
|
|
|
|
2004-11-28 10:05:49 +01:00
|
|
|
while (written != count) {
|
2004-03-11 07:35:03 +01:00
|
|
|
if (isSocket)
|
2006-09-19 22:41:31 +02:00
|
|
|
result = tor_socket_send(fd, buf+written, count-written, 0);
|
2004-03-11 07:35:03 +01:00
|
|
|
else
|
|
|
|
result = write(fd, buf+written, count-written);
|
2004-11-28 10:05:49 +01:00
|
|
|
if (result<0)
|
2003-08-21 01:05:22 +02:00
|
|
|
return -1;
|
|
|
|
written += result;
|
2003-09-14 04:58:50 +02:00
|
|
|
}
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2004-09-26 18:51:31 +02:00
|
|
|
/** Read from <b>fd</b> to <b>buf</b>, until we get <b>count</b> bytes
|
2004-12-22 06:29:06 +01:00
|
|
|
* or reach the end of the file. <b>isSocket</b> must be 1 if fd
|
2004-05-01 22:46:28 +02:00
|
|
|
* was returned by socket() or accept(), and 0 if fd was returned by
|
|
|
|
* open(). Return the number of bytes read, or -1 on error. Only use
|
|
|
|
* if fd is a blocking fd. */
|
2005-08-03 22:42:17 +02:00
|
|
|
int
|
2005-09-30 03:09:52 +02:00
|
|
|
read_all(int fd, char *buf, size_t count, int isSocket)
|
|
|
|
{
|
2004-03-09 23:01:17 +01:00
|
|
|
size_t numread = 0;
|
2003-09-14 04:58:50 +02:00
|
|
|
int result;
|
|
|
|
|
2004-12-02 05:33:01 +01:00
|
|
|
if (count > SIZE_T_CEILING)
|
|
|
|
return -1;
|
|
|
|
|
2004-11-28 10:05:49 +01:00
|
|
|
while (numread != count) {
|
2004-04-07 21:57:40 +02:00
|
|
|
if (isSocket)
|
2006-09-19 22:41:31 +02:00
|
|
|
result = tor_socket_recv(fd, buf+numread, count-numread, 0);
|
2004-03-11 07:35:03 +01:00
|
|
|
else
|
|
|
|
result = read(fd, buf+numread, count-numread);
|
2004-11-28 10:05:49 +01:00
|
|
|
if (result<0)
|
2003-09-14 04:58:50 +02:00
|
|
|
return -1;
|
2004-09-26 18:51:31 +02:00
|
|
|
else if (result == 0)
|
|
|
|
break;
|
2003-09-14 04:58:50 +02:00
|
|
|
numread += result;
|
2003-08-21 01:05:22 +02:00
|
|
|
}
|
2004-11-16 01:08:56 +01:00
|
|
|
return numread;
|
2003-08-21 01:05:22 +02:00
|
|
|
}
|
|
|
|
|
2003-09-26 20:27:35 +02:00
|
|
|
/*
|
|
|
|
* Filesystem operations.
|
|
|
|
*/
|
2003-10-04 05:29:09 +02:00
|
|
|
|
2005-03-16 01:04:59 +01:00
|
|
|
/** Clean up <b>name</b> so that we can use it in a call to "stat". On Unix,
|
|
|
|
* we do nothing. On Windows, we remove a trailing slash, unless the path is
|
|
|
|
* the root of a disk. */
|
|
|
|
static void
|
|
|
|
clean_name_for_stat(char *name)
|
|
|
|
{
|
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
size_t len = strlen(name);
|
|
|
|
if (!len)
|
|
|
|
return;
|
|
|
|
if (name[len-1]=='\\' || name[len-1]=='/') {
|
|
|
|
if (len == 1 || (len==3 && name[1]==':'))
|
|
|
|
return;
|
|
|
|
name[len-1]='\0';
|
|
|
|
}
|
2006-06-05 00:42:13 +02:00
|
|
|
#else
|
|
|
|
(void)name;
|
2005-03-16 01:04:59 +01:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return FN_ERROR if filename can't be read, FN_NOENT if it doesn't
|
2003-10-04 05:29:09 +02:00
|
|
|
* exist, FN_FILE if it is a regular file, or FN_DIR if it's a
|
|
|
|
* directory. */
|
2005-09-30 03:09:52 +02:00
|
|
|
file_status_t
|
|
|
|
file_status(const char *fname)
|
2003-09-26 20:27:35 +02:00
|
|
|
{
|
|
|
|
struct stat st;
|
2005-03-16 01:04:59 +01:00
|
|
|
char *f;
|
|
|
|
int r;
|
|
|
|
f = tor_strdup(fname);
|
|
|
|
clean_name_for_stat(f);
|
|
|
|
r = stat(f, &st);
|
|
|
|
tor_free(f);
|
|
|
|
if (r) {
|
2003-09-26 20:27:35 +02:00
|
|
|
if (errno == ENOENT) {
|
|
|
|
return FN_NOENT;
|
|
|
|
}
|
|
|
|
return FN_ERROR;
|
|
|
|
}
|
2003-12-17 22:14:13 +01:00
|
|
|
if (st.st_mode & S_IFDIR)
|
2003-09-26 20:27:35 +02:00
|
|
|
return FN_DIR;
|
|
|
|
else if (st.st_mode & S_IFREG)
|
|
|
|
return FN_FILE;
|
|
|
|
else
|
|
|
|
return FN_ERROR;
|
|
|
|
}
|
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Check whether dirname exists and is private. If yes return 0. If
|
2004-11-09 08:12:31 +01:00
|
|
|
* it does not exist, and check==CPD_CREATE is set, try to create it
|
|
|
|
* and return 0 on success. If it does not exist, and
|
|
|
|
* check==CPD_CHECK, and we think we can create it, return 0. Else
|
|
|
|
* return -1. */
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
|
|
|
check_private_dir(const char *dirname, cpd_check_t check)
|
2003-09-26 20:27:35 +02:00
|
|
|
{
|
2004-03-09 23:01:17 +01:00
|
|
|
int r;
|
2003-09-26 20:27:35 +02:00
|
|
|
struct stat st;
|
2005-03-16 01:04:59 +01:00
|
|
|
char *f;
|
2004-07-22 10:30:06 +02:00
|
|
|
tor_assert(dirname);
|
2005-03-16 01:04:59 +01:00
|
|
|
f = tor_strdup(dirname);
|
|
|
|
clean_name_for_stat(f);
|
|
|
|
r = stat(f, &st);
|
|
|
|
tor_free(f);
|
|
|
|
if (r) {
|
2003-09-26 20:27:35 +02:00
|
|
|
if (errno != ENOENT) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_FS, "Directory %s cannot be read: %s", dirname,
|
2003-09-26 20:27:35 +02:00
|
|
|
strerror(errno));
|
|
|
|
return -1;
|
2003-12-17 22:14:13 +01:00
|
|
|
}
|
2004-11-09 08:12:31 +01:00
|
|
|
if (check == CPD_NONE) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_FS, "Directory %s does not exist.", dirname);
|
2003-09-26 20:27:35 +02:00
|
|
|
return -1;
|
2004-11-09 08:12:31 +01:00
|
|
|
} else if (check == CPD_CREATE) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_info(LD_GENERAL, "Creating directory %s", dirname);
|
2004-03-09 23:01:17 +01:00
|
|
|
#ifdef MS_WINDOWS
|
2004-11-09 08:12:31 +01:00
|
|
|
r = mkdir(dirname);
|
2004-03-09 23:01:17 +01:00
|
|
|
#else
|
2004-11-09 08:12:31 +01:00
|
|
|
r = mkdir(dirname, 0700);
|
2004-03-09 23:01:17 +01:00
|
|
|
#endif
|
2004-11-09 08:12:31 +01:00
|
|
|
if (r) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_FS, "Error creating directory %s: %s", dirname,
|
2004-11-09 08:12:31 +01:00
|
|
|
strerror(errno));
|
|
|
|
return -1;
|
|
|
|
}
|
2003-09-26 20:27:35 +02:00
|
|
|
}
|
2004-11-09 08:12:31 +01:00
|
|
|
/* XXXX In the case where check==CPD_CHECK, we should look at the
|
|
|
|
* parent directory a little harder. */
|
|
|
|
return 0;
|
2003-09-26 20:27:35 +02:00
|
|
|
}
|
|
|
|
if (!(st.st_mode & S_IFDIR)) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_FS, "%s is not a directory", dirname);
|
2003-09-26 20:27:35 +02:00
|
|
|
return -1;
|
|
|
|
}
|
2004-03-09 23:01:17 +01:00
|
|
|
#ifndef MS_WINDOWS
|
2003-09-26 20:27:35 +02:00
|
|
|
if (st.st_uid != getuid()) {
|
2005-12-05 02:28:10 +01:00
|
|
|
struct passwd *pw = NULL;
|
|
|
|
char *process_ownername = NULL;
|
|
|
|
|
|
|
|
pw = getpwuid(getuid());
|
2005-12-08 05:01:37 +01:00
|
|
|
process_ownername = pw ? tor_strdup(pw->pw_name) : tor_strdup("<unknown>");
|
2005-12-05 02:28:10 +01:00
|
|
|
|
|
|
|
pw = getpwuid(st.st_uid);
|
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
log(LOG_WARN, LD_FS, "%s is not owned by this user (%s, %d) but by "
|
|
|
|
"%s (%d). Perhaps you are running Tor as the wrong user?",
|
2005-12-05 02:28:10 +01:00
|
|
|
dirname, process_ownername, (int)getuid(),
|
2005-12-05 02:30:11 +01:00
|
|
|
pw ? pw->pw_name : "<unknown>", (int)st.st_uid);
|
2005-12-05 02:28:10 +01:00
|
|
|
|
|
|
|
tor_free(process_ownername);
|
2003-09-26 20:27:35 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if (st.st_mode & 0077) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_FS, "Fixing permissions on directory %s", dirname);
|
2003-09-26 20:27:35 +02:00
|
|
|
if (chmod(dirname, 0700)) {
|
2005-10-24 20:37:09 +02:00
|
|
|
log(LOG_WARN, LD_FS, "Could not chmod directory %s: %s", dirname,
|
2003-09-26 20:27:35 +02:00
|
|
|
strerror(errno));
|
|
|
|
return -1;
|
|
|
|
} else {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2004-03-09 23:01:17 +01:00
|
|
|
#endif
|
2003-09-26 20:27:35 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
/** Create a file named <b>fname</b> with the contents <b>str</b>. Overwrite
|
|
|
|
* the previous <b>fname</b> if possible. Return 0 on success, -1 on failure.
|
2004-05-01 22:46:28 +02:00
|
|
|
*
|
|
|
|
* This function replaces the old file atomically, if possible.
|
|
|
|
*/
|
2003-09-26 20:27:35 +02:00
|
|
|
int
|
2004-09-08 09:16:34 +02:00
|
|
|
write_str_to_file(const char *fname, const char *str, int bin)
|
2004-11-03 20:02:48 +01:00
|
|
|
{
|
2004-11-09 20:13:08 +01:00
|
|
|
#ifdef MS_WINDOWS
|
2004-11-09 21:04:00 +01:00
|
|
|
if (!bin && strchr(str, '\r')) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_BUG,
|
|
|
|
"Bug: we're writing a text string that already contains a CR.");
|
2004-11-09 20:13:08 +01:00
|
|
|
}
|
|
|
|
#endif
|
2004-11-03 20:02:48 +01:00
|
|
|
return write_bytes_to_file(fname, str, strlen(str), bin);
|
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** Helper: given a set of flags as passed to open(2), open the file
|
|
|
|
* <b>fname</b> and write all the sized_chunk_t structs in <b>chunks</t> to
|
|
|
|
* the file. Do so as atomically as possible e.g. by opening temp files and
|
|
|
|
* renaming. */
|
2005-09-13 08:19:31 +02:00
|
|
|
static int
|
|
|
|
write_chunks_to_file_impl(const char *fname, const smartlist_t *chunks,
|
|
|
|
int open_flags)
|
2003-09-26 20:27:35 +02:00
|
|
|
{
|
2005-02-22 07:38:39 +01:00
|
|
|
size_t tempname_len;
|
|
|
|
char *tempname;
|
2003-09-26 20:27:35 +02:00
|
|
|
int fd;
|
2004-10-12 22:20:19 +02:00
|
|
|
int result;
|
2005-02-22 07:38:39 +01:00
|
|
|
tempname_len = strlen(fname)+16;
|
|
|
|
tor_assert(tempname_len > strlen(fname)); /*check for overflow*/
|
|
|
|
tempname = tor_malloc(tempname_len);
|
2005-09-13 08:19:31 +02:00
|
|
|
if (open_flags & O_APPEND) {
|
|
|
|
strlcpy(tempname, fname, tempname_len);
|
|
|
|
} else {
|
|
|
|
if (tor_snprintf(tempname, tempname_len, "%s.tmp", fname)<0) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_GENERAL, "Failed to generate filename");
|
2005-09-13 08:19:31 +02:00
|
|
|
goto err;
|
|
|
|
}
|
2003-09-26 20:27:35 +02:00
|
|
|
}
|
2005-09-13 08:19:31 +02:00
|
|
|
if ((fd = open(tempname, open_flags, 0600))
|
2004-09-08 09:16:34 +02:00
|
|
|
< 0) {
|
2005-10-18 23:58:19 +02:00
|
|
|
log(LOG_WARN, LD_FS, "Couldn't open \"%s\" for writing: %s", tempname,
|
2003-09-26 20:27:35 +02:00
|
|
|
strerror(errno));
|
2005-02-22 07:38:39 +01:00
|
|
|
goto err;
|
2003-09-26 20:27:35 +02:00
|
|
|
}
|
2005-09-13 08:19:31 +02:00
|
|
|
SMARTLIST_FOREACH(chunks, sized_chunk_t *, chunk,
|
|
|
|
{
|
|
|
|
result = write_all(fd, chunk->bytes, chunk->len, 0);
|
|
|
|
if (result < 0 || (size_t)result != chunk->len) {
|
2005-12-14 21:40:40 +01:00
|
|
|
log(LOG_WARN, LD_FS, "Error writing to \"%s\": %s", tempname,
|
|
|
|
strerror(errno));
|
2005-09-13 08:19:31 +02:00
|
|
|
close(fd);
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
});
|
2004-09-08 09:16:34 +02:00
|
|
|
if (close(fd)) {
|
2005-12-14 21:40:40 +01:00
|
|
|
log(LOG_WARN, LD_FS, "Error flushing to \"%s\": %s", tempname,
|
|
|
|
strerror(errno));
|
2005-02-22 07:38:39 +01:00
|
|
|
goto err;
|
2004-07-23 23:25:28 +02:00
|
|
|
}
|
2005-09-13 08:19:31 +02:00
|
|
|
if (!(open_flags & O_APPEND)) {
|
|
|
|
if (replace_file(tempname, fname)) {
|
2005-12-14 21:40:40 +01:00
|
|
|
log(LOG_WARN, LD_FS, "Error replacing \"%s\": %s", fname,
|
|
|
|
strerror(errno));
|
2005-09-13 08:19:31 +02:00
|
|
|
goto err;
|
|
|
|
}
|
2003-09-26 20:27:35 +02:00
|
|
|
}
|
2005-02-22 07:38:39 +01:00
|
|
|
tor_free(tempname);
|
2003-09-26 20:27:35 +02:00
|
|
|
return 0;
|
2005-02-22 07:38:39 +01:00
|
|
|
err:
|
|
|
|
tor_free(tempname);
|
|
|
|
return -1;
|
2003-09-26 20:27:35 +02:00
|
|
|
}
|
2003-09-28 08:47:29 +02:00
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/* Given a smartlist of sized_chunk_t, write them atomically to a file
|
2006-10-07 08:28:50 +02:00
|
|
|
* <b>fname</b>, overwriting or creating the file as necessary. */
|
2005-09-13 08:19:31 +02:00
|
|
|
int
|
|
|
|
write_chunks_to_file(const char *fname, const smartlist_t *chunks, int bin)
|
|
|
|
{
|
|
|
|
int flags = O_WRONLY|O_CREAT|O_TRUNC|(bin?O_BINARY:O_TEXT);
|
|
|
|
return write_chunks_to_file_impl(fname, chunks, flags);
|
|
|
|
}
|
|
|
|
|
2006-10-07 08:28:50 +02:00
|
|
|
/** As write_str_to_file, but does not assume a NUL-terminated
|
2005-09-13 08:19:31 +02:00
|
|
|
* string. Instead, we write <b>len</b> bytes, starting at <b>str</b>. */
|
|
|
|
int
|
|
|
|
write_bytes_to_file(const char *fname, const char *str, size_t len,
|
|
|
|
int bin)
|
|
|
|
{
|
|
|
|
int flags = O_WRONLY|O_CREAT|O_TRUNC|(bin?O_BINARY:O_TEXT);
|
|
|
|
int r;
|
|
|
|
sized_chunk_t c = { str, len };
|
|
|
|
smartlist_t *chunks = smartlist_create();
|
|
|
|
smartlist_add(chunks, &c);
|
|
|
|
r = write_chunks_to_file_impl(fname, chunks, flags);
|
|
|
|
smartlist_free(chunks);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2006-09-29 20:13:37 +02:00
|
|
|
/** As write_bytes_to_file, but if the file already exists, append the bytes
|
|
|
|
* to the end of the file instead of overwriting it. */
|
2005-09-13 08:19:31 +02:00
|
|
|
int
|
|
|
|
append_bytes_to_file(const char *fname, const char *str, size_t len,
|
|
|
|
int bin)
|
|
|
|
{
|
|
|
|
int flags = O_WRONLY|O_CREAT|O_APPEND|(bin?O_BINARY:O_TEXT);
|
|
|
|
int r;
|
|
|
|
sized_chunk_t c = { str, len };
|
|
|
|
smartlist_t *chunks = smartlist_create();
|
|
|
|
smartlist_add(chunks, &c);
|
|
|
|
r = write_chunks_to_file_impl(fname, chunks, flags);
|
|
|
|
smartlist_free(chunks);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2005-02-22 08:18:46 +01:00
|
|
|
/** Read the contents of <b>filename</b> into a newly allocated
|
|
|
|
* string; return the string on success or NULL on failure.
|
2006-10-20 01:05:02 +02:00
|
|
|
*
|
|
|
|
* If <b>size_out</b> is provided, store the length of the result in
|
|
|
|
* <b>size_out</b>
|
2005-02-22 08:18:46 +01:00
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* This function <em>may</em> return an erroneous result if the file
|
|
|
|
* is modified while it is running, but must not crash or overflow.
|
|
|
|
* Right now, the error case occurs when the file length grows between
|
|
|
|
* the call to stat and the call to read_all: the resulting string will
|
|
|
|
* be truncated.
|
2004-05-01 22:46:28 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
char *
|
2006-10-20 01:05:02 +02:00
|
|
|
read_file_to_str(const char *filename, int bin, size_t *size_out)
|
2005-09-30 03:09:52 +02:00
|
|
|
{
|
2003-09-28 08:47:29 +02:00
|
|
|
int fd; /* router file */
|
|
|
|
struct stat statbuf;
|
2005-03-16 01:04:59 +01:00
|
|
|
char *string, *f;
|
2004-09-26 18:51:31 +02:00
|
|
|
int r;
|
2003-09-28 08:47:29 +02:00
|
|
|
|
2004-04-25 21:59:38 +02:00
|
|
|
tor_assert(filename);
|
2003-09-28 08:47:29 +02:00
|
|
|
|
2005-03-16 01:04:59 +01:00
|
|
|
f = tor_strdup(filename);
|
|
|
|
clean_name_for_stat(f);
|
|
|
|
r = stat(f, &statbuf);
|
|
|
|
tor_free(f);
|
|
|
|
if (r < 0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_info(LD_FS,"Could not stat \"%s\".",filename);
|
2003-09-28 08:47:29 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2004-11-09 20:30:50 +01:00
|
|
|
fd = open(filename,O_RDONLY|(bin?O_BINARY:O_TEXT),0);
|
2003-09-28 08:47:29 +02:00
|
|
|
if (fd<0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_FS,"Could not open \"%s\".",filename);
|
2003-09-28 08:47:29 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2006-11-14 04:41:05 +01:00
|
|
|
if ((uint64_t)(statbuf.st_size)+1 > SIZE_T_MAX)
|
2006-11-14 02:07:52 +01:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
string = tor_malloc((size_t)(statbuf.st_size+1));
|
2003-09-28 08:47:29 +02:00
|
|
|
|
2006-11-14 02:07:52 +01:00
|
|
|
r = read_all(fd,string,(size_t)statbuf.st_size,0);
|
2004-09-26 18:51:31 +02:00
|
|
|
if (r<0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_FS,"Error reading from file \"%s\": %s", filename,
|
|
|
|
strerror(errno));
|
2004-09-26 18:51:31 +02:00
|
|
|
tor_free(string);
|
|
|
|
close(fd);
|
|
|
|
return NULL;
|
2004-11-09 20:13:08 +01:00
|
|
|
}
|
|
|
|
string[r] = '\0'; /* NUL-terminate the result. */
|
2004-11-09 21:04:00 +01:00
|
|
|
|
2004-11-09 20:13:08 +01:00
|
|
|
if (bin && r != statbuf.st_size) {
|
2004-09-26 18:51:31 +02:00
|
|
|
/* If we're in binary mode, then we'd better have an exact match for
|
|
|
|
* size. Otherwise, win32 encoding may throw us off, and that's okay. */
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_FS,"Could read only %d of %ld bytes of file \"%s\".",
|
|
|
|
r, (long)statbuf.st_size,filename);
|
2004-09-26 18:51:31 +02:00
|
|
|
tor_free(string);
|
2003-09-28 08:47:29 +02:00
|
|
|
close(fd);
|
|
|
|
return NULL;
|
|
|
|
}
|
2004-11-09 20:13:08 +01:00
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
if (!bin && strchr(string, '\r')) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_debug(LD_FS, "We didn't convert CRLF to LF as well as we hoped "
|
|
|
|
"when reading %s. Coping.",
|
|
|
|
filename);
|
2004-11-09 20:30:50 +01:00
|
|
|
tor_strstrip(string, "\r");
|
2004-11-09 20:13:08 +01:00
|
|
|
}
|
|
|
|
#endif
|
2003-09-28 08:47:29 +02:00
|
|
|
close(fd);
|
2006-10-20 01:05:02 +02:00
|
|
|
if (size_out)
|
|
|
|
*size_out = (size_t) r;
|
2003-12-17 22:14:13 +01:00
|
|
|
|
2003-09-28 08:47:29 +02:00
|
|
|
return string;
|
|
|
|
}
|
|
|
|
|
2004-11-09 19:22:17 +01:00
|
|
|
/** Given a string containing part of a configuration file or similar format,
|
|
|
|
* advance past comments and whitespace and try to parse a single line. If we
|
|
|
|
* parse a line successfully, set *<b>key_out</b> to the key portion and
|
|
|
|
* *<b>value_out</b> to the value portion of the line, and return a pointer to
|
|
|
|
* the start of the next line. If we run out of data, return a pointer to the
|
|
|
|
* end of the string. If we encounter an error, return NULL.
|
2004-11-04 23:29:45 +01:00
|
|
|
*
|
2004-11-09 19:22:17 +01:00
|
|
|
* NOTE: We modify <b>line</b> as we parse it, by inserting NULs to terminate
|
|
|
|
* the key and value.
|
2004-11-04 23:29:45 +01:00
|
|
|
*/
|
|
|
|
char *
|
|
|
|
parse_line_from_str(char *line, char **key_out, char **value_out)
|
|
|
|
{
|
|
|
|
char *key, *val, *cp;
|
|
|
|
|
|
|
|
tor_assert(key_out);
|
|
|
|
tor_assert(value_out);
|
|
|
|
|
|
|
|
*key_out = *value_out = key = val = NULL;
|
|
|
|
/* Skip until the first keyword. */
|
|
|
|
while (1) {
|
2004-12-08 01:42:50 +01:00
|
|
|
while (TOR_ISSPACE(*line))
|
2004-11-04 23:29:45 +01:00
|
|
|
++line;
|
|
|
|
if (*line == '#') {
|
|
|
|
while (*line && *line != '\n')
|
|
|
|
++line;
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!*line) { /* End of string? */
|
|
|
|
*key_out = *value_out = NULL;
|
|
|
|
return line;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Skip until the next space. */
|
|
|
|
key = line;
|
2004-12-08 01:42:50 +01:00
|
|
|
while (*line && !TOR_ISSPACE(*line) && *line != '#')
|
2004-11-04 23:29:45 +01:00
|
|
|
++line;
|
|
|
|
|
|
|
|
/* Skip until the value */
|
|
|
|
while (*line == ' ' || *line == '\t')
|
|
|
|
*line++ = '\0';
|
|
|
|
val = line;
|
|
|
|
|
|
|
|
/* Find the end of the line. */
|
|
|
|
while (*line && *line != '\n' && *line != '#')
|
|
|
|
++line;
|
|
|
|
if (*line == '\n')
|
|
|
|
cp = line++;
|
|
|
|
else {
|
|
|
|
cp = line-1;
|
|
|
|
}
|
2004-12-08 01:42:50 +01:00
|
|
|
while (cp>=val && TOR_ISSPACE(*cp))
|
2004-11-04 23:29:45 +01:00
|
|
|
*cp-- = '\0';
|
|
|
|
|
|
|
|
if (*line == '#') {
|
|
|
|
do {
|
|
|
|
*line++ = '\0';
|
|
|
|
} while (*line && *line != '\n');
|
|
|
|
if (*line == '\n')
|
|
|
|
++line;
|
|
|
|
}
|
|
|
|
|
|
|
|
*key_out = key;
|
|
|
|
*value_out = val;
|
|
|
|
|
|
|
|
return line;
|
2003-09-29 09:50:08 +02:00
|
|
|
}
|
|
|
|
|
2004-07-15 04:00:43 +02:00
|
|
|
/** Expand any homedir prefix on 'filename'; return a newly allocated
|
|
|
|
* string. */
|
2005-09-30 03:09:52 +02:00
|
|
|
char *
|
|
|
|
expand_filename(const char *filename)
|
2004-07-15 04:00:43 +02:00
|
|
|
{
|
|
|
|
tor_assert(filename);
|
2004-11-10 15:23:31 +01:00
|
|
|
if (*filename == '~') {
|
2004-10-27 07:53:07 +02:00
|
|
|
size_t len;
|
2004-11-10 15:23:31 +01:00
|
|
|
char *home, *result;
|
|
|
|
const char *rest;
|
|
|
|
|
|
|
|
if (filename[1] == '/' || filename[1] == '\0') {
|
|
|
|
home = getenv("HOME");
|
|
|
|
if (!home) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_CONFIG, "Couldn't find $HOME environment variable while "
|
2006-03-05 10:50:26 +01:00
|
|
|
"expanding \"%s\"", filename);
|
2004-11-10 15:23:31 +01:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
home = tor_strdup(home);
|
|
|
|
rest = strlen(filename)>=2?(filename+2):NULL;
|
|
|
|
} else {
|
|
|
|
#ifdef HAVE_PWD_H
|
|
|
|
char *username, *slash;
|
|
|
|
slash = strchr(filename, '/');
|
|
|
|
if (slash)
|
|
|
|
username = tor_strndup(filename+1,slash-filename-1);
|
|
|
|
else
|
|
|
|
username = tor_strdup(filename+1);
|
|
|
|
if (!(home = get_user_homedir(username))) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_CONFIG,"Couldn't get homedir for \"%s\"",username);
|
2004-11-10 15:23:31 +01:00
|
|
|
tor_free(username);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
tor_free(username);
|
|
|
|
rest = slash ? (slash+1) : NULL;
|
|
|
|
#else
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_CONFIG, "Couldn't expend homedir on system without pwd.h");
|
2004-11-10 15:23:31 +01:00
|
|
|
return tor_strdup(filename);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
tor_assert(home);
|
|
|
|
/* Remove trailing slash. */
|
|
|
|
if (strlen(home)>1 && !strcmpend(home,"/")) {
|
|
|
|
home[strlen(home)-1] = '\0';
|
2004-07-15 04:00:43 +02:00
|
|
|
}
|
2004-11-10 15:23:31 +01:00
|
|
|
/* Plus one for /, plus one for NUL.
|
2004-10-27 08:03:28 +02:00
|
|
|
* Round up to 16 in case we can't do math. */
|
2004-11-10 15:23:31 +01:00
|
|
|
len = strlen(home)+strlen(rest)+16;
|
2004-10-27 07:53:07 +02:00
|
|
|
result = tor_malloc(len);
|
2004-11-10 15:23:31 +01:00
|
|
|
tor_snprintf(result,len,"%s/%s",home,rest?rest:"");
|
|
|
|
tor_free(home);
|
2004-07-15 04:00:43 +02:00
|
|
|
return result;
|
|
|
|
} else {
|
|
|
|
return tor_strdup(filename);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-09-03 06:40:05 +02:00
|
|
|
/** Return a new list containing the filenames in the directory <b>dirname</b>.
|
|
|
|
* Return NULL on error or if <b>dirname</b> is not a directory.
|
|
|
|
*/
|
|
|
|
smartlist_t *
|
|
|
|
tor_listdir(const char *dirname)
|
|
|
|
{
|
|
|
|
smartlist_t *result;
|
2005-09-09 23:29:23 +02:00
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
char *pattern;
|
|
|
|
HANDLE handle;
|
|
|
|
WIN32_FIND_DATA findData;
|
|
|
|
size_t pattern_len = strlen(dirname)+16;
|
|
|
|
pattern = tor_malloc(pattern_len);
|
|
|
|
tor_snprintf(pattern, pattern_len, "%s\\*", dirname);
|
|
|
|
if (!(handle = FindFirstFile(pattern, &findData))) {
|
|
|
|
tor_free(pattern);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
result = smartlist_create();
|
|
|
|
while (1) {
|
2005-11-15 04:16:32 +01:00
|
|
|
if (strcmp(findData.cFileName, ".") &&
|
|
|
|
strcmp(findData.cFileName, "..")) {
|
|
|
|
smartlist_add(result, tor_strdup(findData.cFileName));
|
|
|
|
}
|
2005-09-09 23:29:23 +02:00
|
|
|
if (!FindNextFile(handle, &findData)) {
|
|
|
|
if (GetLastError() != ERROR_NO_MORE_FILES) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_FS, "Error reading directory.");
|
2005-09-09 23:29:23 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
FindClose(handle);
|
|
|
|
tor_free(pattern);
|
|
|
|
#else
|
|
|
|
DIR *d;
|
2005-09-03 06:40:05 +02:00
|
|
|
struct dirent *de;
|
|
|
|
if (!(d = opendir(dirname)))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
result = smartlist_create();
|
|
|
|
while ((de = readdir(d))) {
|
|
|
|
if (!strcmp(de->d_name, ".") ||
|
|
|
|
!strcmp(de->d_name, ".."))
|
|
|
|
continue;
|
|
|
|
smartlist_add(result, tor_strdup(de->d_name));
|
|
|
|
}
|
|
|
|
closedir(d);
|
2005-09-09 23:29:23 +02:00
|
|
|
#endif
|
2005-09-03 06:40:05 +02:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2006-10-02 23:00:24 +02:00
|
|
|
/** Return true iff <b>filename</b> is a relative path. */
|
2006-01-10 21:00:20 +01:00
|
|
|
int
|
|
|
|
path_is_relative(const char *filename)
|
|
|
|
{
|
|
|
|
if (filename && filename[0] == '/')
|
|
|
|
return 0;
|
2006-10-02 23:00:24 +02:00
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
else if (filename && filename[0] == '\\')
|
|
|
|
return 0;
|
|
|
|
else if (filename && strlen(filename)>3 && TOR_ISALPHA(filename[0]) &&
|
|
|
|
filename[1] == ':' && filename[2] == '\\')
|
2006-10-08 20:24:31 +02:00
|
|
|
return 0;
|
2006-10-02 23:00:24 +02:00
|
|
|
#endif
|
2006-01-10 21:00:20 +01:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/* =====
|
|
|
|
* Net helpers
|
|
|
|
* ===== */
|
2004-08-09 06:28:25 +02:00
|
|
|
|
2004-05-07 19:04:12 +02:00
|
|
|
/** Return true iff <b>ip</b> (in host order) is an IP reserved to localhost,
|
2004-05-01 22:46:28 +02:00
|
|
|
* or reserved for local networks by RFC 1918.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
int
|
2005-12-09 03:45:33 +01:00
|
|
|
is_internal_IP(uint32_t ip, int for_listening)
|
2005-09-30 03:09:52 +02:00
|
|
|
{
|
2005-12-09 03:45:33 +01:00
|
|
|
if (for_listening && !ip) /* special case for binding to 0.0.0.0 */
|
|
|
|
return 0;
|
2004-03-15 05:00:11 +01:00
|
|
|
if (((ip & 0xff000000) == 0x0a000000) || /* 10/8 */
|
2004-03-14 19:07:46 +01:00
|
|
|
((ip & 0xff000000) == 0x00000000) || /* 0/8 */
|
|
|
|
((ip & 0xff000000) == 0x7f000000) || /* 127/8 */
|
|
|
|
((ip & 0xffff0000) == 0xa9fe0000) || /* 169.254/16 */
|
|
|
|
((ip & 0xfff00000) == 0xac100000) || /* 172.16/12 */
|
|
|
|
((ip & 0xffff0000) == 0xc0a80000)) /* 192.168/16 */
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-10-12 17:48:30 +02:00
|
|
|
/** Parse a string of the form "host[:port]" from <b>addrport</b>. If
|
|
|
|
* <b>address</b> is provided, set *<b>address</b> to a copy of the
|
|
|
|
* host portion of the string. If <b>addr</b> is provided, try to
|
|
|
|
* resolve the host portion of the string and store it into
|
2005-08-05 03:51:19 +02:00
|
|
|
* *<b>addr</b> (in host byte order). If <b>port_out</b> is provided,
|
|
|
|
* store the port number into *<b>port_out</b>, or 0 if no port is given.
|
|
|
|
* If <b>port_out</b> is NULL, then there must be no port number in
|
|
|
|
* <b>addrport</b>.
|
2004-10-12 18:02:15 +02:00
|
|
|
* Return 0 on success, -1 on failure.
|
2004-10-12 17:48:30 +02:00
|
|
|
*/
|
|
|
|
int
|
2006-07-06 04:44:07 +02:00
|
|
|
parse_addr_port(int severity, const char *addrport, char **address,
|
|
|
|
uint32_t *addr, uint16_t *port_out)
|
2004-10-12 17:48:30 +02:00
|
|
|
{
|
|
|
|
const char *colon;
|
|
|
|
char *_address = NULL;
|
|
|
|
int _port;
|
|
|
|
int ok = 1;
|
|
|
|
|
|
|
|
tor_assert(addrport);
|
|
|
|
|
|
|
|
colon = strchr(addrport, ':');
|
|
|
|
if (colon) {
|
|
|
|
_address = tor_strndup(addrport, colon-addrport);
|
2004-10-12 21:32:41 +02:00
|
|
|
_port = (int) tor_parse_long(colon+1,10,1,65535,NULL,NULL);
|
|
|
|
if (!_port) {
|
2006-07-06 04:44:07 +02:00
|
|
|
log_fn(severity, LD_GENERAL, "Port %s out of range", escaped(colon+1));
|
2004-10-12 17:48:30 +02:00
|
|
|
ok = 0;
|
|
|
|
}
|
2005-08-05 03:51:19 +02:00
|
|
|
if (!port_out) {
|
2006-03-05 10:50:26 +01:00
|
|
|
char *esc_addrport = esc_for_log(addrport);
|
2006-07-06 04:44:07 +02:00
|
|
|
log_fn(severity, LD_GENERAL,
|
|
|
|
"Port %s given on %s when not required",
|
|
|
|
escaped(colon+1), esc_addrport);
|
2006-03-05 10:50:26 +01:00
|
|
|
tor_free(esc_addrport);
|
2005-08-05 03:51:19 +02:00
|
|
|
ok = 0;
|
|
|
|
}
|
2004-10-12 17:48:30 +02:00
|
|
|
} else {
|
|
|
|
_address = tor_strdup(addrport);
|
|
|
|
_port = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (addr) {
|
|
|
|
/* There's an addr pointer, so we need to resolve the hostname. */
|
|
|
|
if (tor_lookup_hostname(_address,addr)) {
|
2006-07-06 04:44:07 +02:00
|
|
|
log_fn(severity, LD_NET, "Couldn't look up %s", escaped(_address));
|
2004-10-12 17:48:30 +02:00
|
|
|
ok = 0;
|
|
|
|
*addr = 0;
|
|
|
|
}
|
2004-10-16 23:53:30 +02:00
|
|
|
*addr = ntohl(*addr);
|
2004-10-12 17:48:30 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if (address && ok) {
|
|
|
|
*address = _address;
|
|
|
|
} else {
|
|
|
|
if (address)
|
|
|
|
*address = NULL;
|
|
|
|
tor_free(_address);
|
|
|
|
}
|
2005-08-05 03:51:19 +02:00
|
|
|
if (port_out)
|
|
|
|
*port_out = ok ? ((uint16_t) _port) : 0;
|
2004-10-12 17:48:30 +02:00
|
|
|
|
|
|
|
return ok ? 0 : -1;
|
|
|
|
}
|
|
|
|
|
2006-02-13 00:58:22 +01:00
|
|
|
/** If <b>mask</b> is an address mask for a bit-prefix, return the number of
|
|
|
|
* bits. Otherwise, return -1. */
|
|
|
|
int
|
|
|
|
addr_mask_get_bits(uint32_t mask)
|
|
|
|
{
|
|
|
|
int i;
|
2006-02-13 01:26:43 +01:00
|
|
|
if (mask == 0)
|
|
|
|
return 0;
|
|
|
|
if (mask == 0xFFFFFFFFu)
|
|
|
|
return 32;
|
2006-02-13 00:58:22 +01:00
|
|
|
for (i=0; i<=32; ++i) {
|
2006-02-13 01:26:43 +01:00
|
|
|
if (mask == (uint32_t) ~((1u<<(32-i))-1)) {
|
2006-02-13 00:58:22 +01:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2006-03-05 06:27:59 +01:00
|
|
|
/** Parse a string <b>s</b> in the format of (*|port(-maxport)?)?, setting the
|
|
|
|
* various *out pointers as appropriate. Return 0 on success, -1 on failure.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
parse_port_range(const char *port, uint16_t *port_min_out,
|
|
|
|
uint16_t *port_max_out)
|
|
|
|
{
|
2006-12-21 18:38:15 +01:00
|
|
|
int port_min, port_max, ok;
|
2006-03-05 06:27:59 +01:00
|
|
|
tor_assert(port_min_out);
|
|
|
|
tor_assert(port_max_out);
|
|
|
|
|
|
|
|
if (!port || *port == '\0' || strcmp(port, "*") == 0) {
|
2006-12-21 18:38:15 +01:00
|
|
|
port_min = 1;
|
|
|
|
port_max = 65535;
|
2006-03-05 06:27:59 +01:00
|
|
|
} else {
|
|
|
|
char *endptr = NULL;
|
2006-12-21 18:38:15 +01:00
|
|
|
port_min = tor_parse_long(port, 10, 0, 65535, &ok, &endptr);
|
|
|
|
if (!ok) {
|
|
|
|
log_warn(LD_GENERAL,
|
|
|
|
"Malformed port %s on address range; rejecting.",
|
|
|
|
escaped(port));
|
|
|
|
return -1;
|
|
|
|
} else if (endptr && *endptr == '-') {
|
2006-03-05 06:27:59 +01:00
|
|
|
port = endptr+1;
|
|
|
|
endptr = NULL;
|
2006-12-21 18:38:15 +01:00
|
|
|
port_max = tor_parse_long(port, 10, 1, 65536, &ok, &endptr);
|
|
|
|
if (!ok) {
|
2006-03-05 06:27:59 +01:00
|
|
|
log_warn(LD_GENERAL,
|
2006-12-21 04:22:59 +01:00
|
|
|
"Malformed port %s on address range; rejecting.",
|
2006-03-05 10:50:26 +01:00
|
|
|
escaped(port));
|
2006-12-21 04:22:59 +01:00
|
|
|
return -1;
|
2006-03-05 06:27:59 +01:00
|
|
|
}
|
|
|
|
} else {
|
2006-12-21 18:38:15 +01:00
|
|
|
port_max = port_min;
|
2006-03-05 06:27:59 +01:00
|
|
|
}
|
2006-12-21 18:38:15 +01:00
|
|
|
if (port_min > port_max) {
|
2006-03-05 06:27:59 +01:00
|
|
|
log_warn(LD_GENERAL, "Insane port range on address policy; rejecting.");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-21 18:38:15 +01:00
|
|
|
if (port_min < 1)
|
|
|
|
port_min = 1;
|
|
|
|
if (port_max > 65535)
|
|
|
|
port_max = 65535;
|
|
|
|
|
|
|
|
*port_min_out = (uint16_t) port_min;
|
|
|
|
*port_max_out = (uint16_t) port_max;
|
|
|
|
|
2006-03-05 06:27:59 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-10-16 23:41:12 +02:00
|
|
|
/** Parse a string <b>s</b> in the format of
|
2006-03-05 06:27:59 +01:00
|
|
|
* (IP(/mask|/mask-bits)?|*)(:*|port(-maxport)?)?, setting the various
|
2004-10-16 23:41:12 +02:00
|
|
|
* *out pointers as appropriate. Return 0 on success, -1 on failure.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
parse_addr_and_port_range(const char *s, uint32_t *addr_out,
|
|
|
|
uint32_t *mask_out, uint16_t *port_min_out,
|
|
|
|
uint16_t *port_max_out)
|
|
|
|
{
|
|
|
|
char *address;
|
|
|
|
char *mask, *port, *endptr;
|
|
|
|
struct in_addr in;
|
|
|
|
int bits;
|
|
|
|
|
2004-10-17 00:28:11 +02:00
|
|
|
tor_assert(s);
|
|
|
|
tor_assert(addr_out);
|
|
|
|
tor_assert(mask_out);
|
|
|
|
tor_assert(port_min_out);
|
|
|
|
tor_assert(port_max_out);
|
|
|
|
|
2004-10-16 23:41:12 +02:00
|
|
|
address = tor_strdup(s);
|
|
|
|
/* Break 'address' into separate strings.
|
|
|
|
*/
|
|
|
|
mask = strchr(address,'/');
|
|
|
|
port = strchr(mask?mask:address,':');
|
|
|
|
if (mask)
|
|
|
|
*mask++ = '\0';
|
|
|
|
if (port)
|
|
|
|
*port++ = '\0';
|
|
|
|
/* Now "address" is the IP|'*' part...
|
|
|
|
* "mask" is the Mask|Maskbits part...
|
|
|
|
* and "port" is the *|port|min-max part.
|
|
|
|
*/
|
2004-10-27 08:26:23 +02:00
|
|
|
|
2004-10-16 23:41:12 +02:00
|
|
|
if (strcmp(address,"*")==0) {
|
|
|
|
*addr_out = 0;
|
|
|
|
} else if (tor_inet_aton(address, &in) != 0) {
|
|
|
|
*addr_out = ntohl(in.s_addr);
|
|
|
|
} else {
|
2006-03-05 10:50:26 +01:00
|
|
|
log_warn(LD_GENERAL, "Malformed IP %s in address pattern; rejecting.",
|
|
|
|
escaped(address));
|
2004-10-16 23:41:12 +02:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!mask) {
|
|
|
|
if (strcmp(address,"*")==0)
|
|
|
|
*mask_out = 0;
|
|
|
|
else
|
|
|
|
*mask_out = 0xFFFFFFFFu;
|
|
|
|
} else {
|
|
|
|
endptr = NULL;
|
|
|
|
bits = (int) strtol(mask, &endptr, 10);
|
|
|
|
if (!*endptr) {
|
|
|
|
/* strtol handled the whole mask. */
|
|
|
|
if (bits < 0 || bits > 32) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_GENERAL,
|
|
|
|
"Bad number of mask bits on address range; rejecting.");
|
2004-10-16 23:41:12 +02:00
|
|
|
goto err;
|
|
|
|
}
|
2006-02-13 01:26:43 +01:00
|
|
|
*mask_out = ~((1u<<(32-bits))-1);
|
2004-10-16 23:41:12 +02:00
|
|
|
} else if (tor_inet_aton(mask, &in) != 0) {
|
|
|
|
*mask_out = ntohl(in.s_addr);
|
|
|
|
} else {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_GENERAL,
|
2006-03-05 10:50:26 +01:00
|
|
|
"Malformed mask %s on address range; rejecting.",
|
|
|
|
escaped(mask));
|
2004-10-16 23:41:12 +02:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-03-05 06:27:59 +01:00
|
|
|
if (parse_port_range(port, port_min_out, port_max_out)<0)
|
|
|
|
goto err;
|
2004-10-16 23:41:12 +02:00
|
|
|
|
|
|
|
tor_free(address);
|
|
|
|
return 0;
|
|
|
|
err:
|
|
|
|
tor_free(address);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2005-03-17 13:38:37 +01:00
|
|
|
/** Given an IPv4 address <b>in</b> (in network order, as usual),
|
|
|
|
* write it as a string into the <b>buf_len</b>-byte buffer in
|
|
|
|
* <b>buf</b>.
|
|
|
|
*/
|
2005-02-22 09:18:36 +01:00
|
|
|
int
|
|
|
|
tor_inet_ntoa(struct in_addr *in, char *buf, size_t buf_len)
|
|
|
|
{
|
|
|
|
uint32_t a = ntohl(in->s_addr);
|
|
|
|
return tor_snprintf(buf, buf_len, "%d.%d.%d.%d",
|
|
|
|
(int)(uint8_t)((a>>24)&0xff),
|
|
|
|
(int)(uint8_t)((a>>16)&0xff),
|
|
|
|
(int)(uint8_t)((a>>8 )&0xff),
|
|
|
|
(int)(uint8_t)((a )&0xff));
|
|
|
|
}
|
|
|
|
|
2005-08-26 09:37:07 +02:00
|
|
|
/** Given a host-order <b>addr</b>, call tor_inet_ntoa() on it
|
|
|
|
* and return a strdup of the resulting address.
|
|
|
|
*/
|
|
|
|
char *
|
|
|
|
tor_dup_addr(uint32_t addr)
|
|
|
|
{
|
|
|
|
char buf[INET_NTOA_BUF_LEN];
|
|
|
|
struct in_addr in;
|
|
|
|
|
|
|
|
in.s_addr = htonl(addr);
|
|
|
|
tor_inet_ntoa(&in, buf, sizeof(buf));
|
|
|
|
return tor_strdup(buf);
|
|
|
|
}
|
|
|
|
|
2005-08-03 22:42:17 +02:00
|
|
|
/**
|
|
|
|
* Set *<b>addr</b> to the host-order IPv4 address (if any) of whatever
|
|
|
|
* interface connects to the internet. This address should only be used in
|
|
|
|
* checking whether our address has changed. Return 0 on success, -1 on
|
|
|
|
* failure.
|
|
|
|
*/
|
|
|
|
int
|
2006-09-09 21:20:27 +02:00
|
|
|
get_interface_address(int severity, uint32_t *addr)
|
2005-08-03 22:42:17 +02:00
|
|
|
{
|
|
|
|
int sock=-1, r=-1;
|
|
|
|
struct sockaddr_in target_addr, my_addr;
|
|
|
|
socklen_t my_addr_len = sizeof(my_addr);
|
|
|
|
|
|
|
|
tor_assert(addr);
|
|
|
|
*addr = 0;
|
|
|
|
|
|
|
|
sock = socket(PF_INET,SOCK_DGRAM,IPPROTO_UDP);
|
|
|
|
if (sock < 0) {
|
|
|
|
int e = tor_socket_errno(-1);
|
2006-09-09 21:20:27 +02:00
|
|
|
log_fn(severity, LD_NET, "unable to create socket: %s",
|
|
|
|
tor_socket_strerror(e));
|
2005-08-03 22:42:17 +02:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
memset(&target_addr, 0, sizeof(target_addr));
|
|
|
|
target_addr.sin_family = AF_INET;
|
|
|
|
/* discard port */
|
|
|
|
target_addr.sin_port = 9;
|
|
|
|
/* 18.0.0.1 (Don't worry: no packets are sent. We just need a real address
|
|
|
|
* on the internet.) */
|
|
|
|
target_addr.sin_addr.s_addr = htonl(0x12000001);
|
|
|
|
|
|
|
|
if (connect(sock,(struct sockaddr *)&target_addr,sizeof(target_addr))<0) {
|
|
|
|
int e = tor_socket_errno(sock);
|
2006-09-09 21:20:27 +02:00
|
|
|
log_fn(severity, LD_NET, "connect() failed: %s", tor_socket_strerror(e));
|
2005-08-03 22:42:17 +02:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
2005-08-05 00:25:39 +02:00
|
|
|
if (getsockname(sock, (struct sockaddr*)&my_addr, &my_addr_len)) {
|
2005-08-03 22:42:17 +02:00
|
|
|
int e = tor_socket_errno(sock);
|
2006-09-30 00:33:40 +02:00
|
|
|
log_fn(severity, LD_NET, "getsockname() to determine interface failed: %s",
|
2006-09-09 21:20:27 +02:00
|
|
|
tor_socket_strerror(e));
|
2005-08-03 22:42:17 +02:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
*addr = ntohl(my_addr.sin_addr.s_addr);
|
|
|
|
|
|
|
|
r=0;
|
|
|
|
err:
|
|
|
|
if (sock >= 0)
|
|
|
|
tor_close_socket(sock);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/* =====
|
|
|
|
* Process helpers
|
|
|
|
* ===== */
|
|
|
|
|
|
|
|
#ifndef MS_WINDOWS
|
|
|
|
/* Based on code contributed by christian grothoff */
|
|
|
|
static int start_daemon_called = 0;
|
|
|
|
static int finish_daemon_called = 0;
|
|
|
|
static int daemon_filedes[2];
|
|
|
|
/** 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-10-12 21:32:41 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
start_daemon(void)
|
2004-10-12 21:32:41 +02:00
|
|
|
{
|
2004-11-01 21:41:47 +01:00
|
|
|
pid_t pid;
|
2004-10-12 21:32:41 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
if (start_daemon_called)
|
|
|
|
return;
|
|
|
|
start_daemon_called = 1;
|
2004-10-12 21:32:41 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
pipe(daemon_filedes);
|
|
|
|
pid = fork();
|
|
|
|
if (pid < 0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_err(LD_GENERAL,"fork failed. Exiting.");
|
2004-11-01 21:41:47 +01:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
if (pid) { /* Parent */
|
|
|
|
int ok;
|
|
|
|
char c;
|
2004-10-12 21:32:41 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
close(daemon_filedes[1]); /* we only read */
|
|
|
|
ok = -1;
|
|
|
|
while (0 < read(daemon_filedes[0], &c, sizeof(char))) {
|
|
|
|
if (c == '.')
|
|
|
|
ok = 1;
|
|
|
|
}
|
|
|
|
fflush(stdout);
|
|
|
|
if (ok == 1)
|
|
|
|
exit(0);
|
|
|
|
else
|
|
|
|
exit(1); /* child reported error */
|
|
|
|
} else { /* Child */
|
|
|
|
close(daemon_filedes[0]); /* we only write */
|
2004-10-12 21:32:41 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
pid = setsid(); /* Detach from controlling terminal */
|
|
|
|
/*
|
|
|
|
* Fork one more time, so the parent (the session group leader) can exit.
|
|
|
|
* This means that we, as a non-session group leader, can never regain a
|
|
|
|
* controlling terminal. This part is recommended by Stevens's
|
|
|
|
* _Advanced Programming in the Unix Environment_.
|
|
|
|
*/
|
|
|
|
if (fork() != 0) {
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
2004-10-27 08:26:23 +02:00
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +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.)
|
2004-10-27 08:26:23 +02:00
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
finish_daemon(const char *desired_cwd)
|
2004-10-27 08:26:23 +02:00
|
|
|
{
|
2004-11-01 21:41:47 +01:00
|
|
|
int nullfd;
|
|
|
|
char c = '.';
|
|
|
|
if (finish_daemon_called)
|
|
|
|
return;
|
|
|
|
if (!start_daemon_called)
|
2005-04-06 21:07:38 +02:00
|
|
|
start_daemon();
|
2004-11-01 21:41:47 +01:00
|
|
|
finish_daemon_called = 1;
|
2004-10-27 08:26:23 +02:00
|
|
|
|
2005-04-06 21:07:38 +02:00
|
|
|
if (!desired_cwd)
|
|
|
|
desired_cwd = "/";
|
|
|
|
/* Don't hold the wrong FS mounted */
|
|
|
|
if (chdir(desired_cwd) < 0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_err(LD_GENERAL,"chdir to \"%s\" failed. Exiting.",desired_cwd);
|
2005-04-06 21:07:38 +02:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
nullfd = open("/dev/null",
|
|
|
|
O_CREAT | O_RDWR | O_APPEND);
|
|
|
|
if (nullfd < 0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_err(LD_GENERAL,"/dev/null can't be opened. Exiting.");
|
2004-11-01 21:41:47 +01:00
|
|
|
exit(1);
|
2004-06-05 03:50:35 +02:00
|
|
|
}
|
2004-11-01 21:41:47 +01:00
|
|
|
/* close fds linking to invoking terminal, but
|
|
|
|
* close usual incoming fds, but redirect them somewhere
|
|
|
|
* useful so the fds don't get reallocated elsewhere.
|
|
|
|
*/
|
|
|
|
if (dup2(nullfd,0) < 0 ||
|
|
|
|
dup2(nullfd,1) < 0 ||
|
|
|
|
dup2(nullfd,2) < 0) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_err(LD_GENERAL,"dup2 failed. Exiting.");
|
2004-11-01 21:41:47 +01:00
|
|
|
exit(1);
|
2004-06-05 03:50:35 +02:00
|
|
|
}
|
2005-06-30 08:56:00 +02:00
|
|
|
if (nullfd > 2)
|
|
|
|
close(nullfd);
|
2004-11-01 21:41:47 +01:00
|
|
|
write(daemon_filedes[1], &c, sizeof(char)); /* signal success */
|
|
|
|
close(daemon_filedes[1]);
|
2004-06-05 03:50:35 +02:00
|
|
|
}
|
2004-11-01 21:41:47 +01:00
|
|
|
#else
|
|
|
|
/* defined(MS_WINDOWS) */
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
start_daemon(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
void
|
|
|
|
finish_daemon(const char *cp)
|
|
|
|
{
|
|
|
|
}
|
2004-06-05 03:50:35 +02:00
|
|
|
#endif
|
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
/** Write the current process ID, followed by NL, into <b>filename</b>.
|
|
|
|
*/
|
2005-09-30 03:09:52 +02:00
|
|
|
void
|
|
|
|
write_pidfile(char *filename)
|
|
|
|
{
|
2004-11-01 21:41:47 +01:00
|
|
|
FILE *pidfile;
|
2004-10-30 21:26:31 +02:00
|
|
|
|
2004-11-01 21:41:47 +01:00
|
|
|
if ((pidfile = fopen(filename, "w")) == NULL) {
|
2006-02-13 09:01:59 +01:00
|
|
|
log_warn(LD_FS, "Unable to open \"%s\" for writing: %s", filename,
|
|
|
|
strerror(errno));
|
2004-11-01 21:41:47 +01:00
|
|
|
} else {
|
2006-12-15 06:12:52 +01:00
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
fprintf(pidfile, "%d\n", (int)_getpid());
|
|
|
|
#else
|
2004-11-01 21:41:47 +01:00
|
|
|
fprintf(pidfile, "%d\n", (int)getpid());
|
2006-12-15 06:12:52 +01:00
|
|
|
#endif
|
2004-11-01 21:41:47 +01:00
|
|
|
fclose(pidfile);
|
2004-10-30 21:26:31 +02:00
|
|
|
}
|
|
|
|
}
|
2005-06-09 21:03:31 +02:00
|
|
|
|