| 1 |
/* |
| 2 |
util.h -- process management and other utility functions |
| 3 |
Copyright (C) 1998-2002 Ivo Timmermans <ivo@o2w.nl> |
| 4 |
2000-2002 Guus Sliepen <guus@sliepen.eu.org> |
| 5 |
2003 Marc Lehmann <gvpe@schmorp.de> |
| 6 |
|
| 7 |
This file is part of GVPE. |
| 8 |
|
| 9 |
GVPE is free software; you can redistribute it and/or modify |
| 10 |
it under the terms of the GNU General Public License as published by |
| 11 |
the Free Software Foundation; either version 2 of the License, or |
| 12 |
(at your option) any later version. |
| 13 |
|
| 14 |
This program is distributed in the hope that it will be useful, |
| 15 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 17 |
GNU General Public License for more details. |
| 18 |
|
| 19 |
You should have received a copy of the GNU General Public License |
| 20 |
along with gvpe; if not, write to the Free Software |
| 21 |
Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
| 22 |
*/ |
| 23 |
|
| 24 |
#ifndef UTIL_H__ |
| 25 |
#define UTIL_H__ |
| 26 |
|
| 27 |
#include <openssl/rsa.h> |
| 28 |
|
| 29 |
#include "gettext.h" |
| 30 |
|
| 31 |
#include "slog.h" |
| 32 |
#include "iom.h" |
| 33 |
|
| 34 |
/* |
| 35 |
* check for an existing gvpe for this net, and write pid to pidfile |
| 36 |
*/ |
| 37 |
extern int write_pidfile (void); |
| 38 |
|
| 39 |
/* |
| 40 |
* kill older gvpe |
| 41 |
*/ |
| 42 |
extern int kill_other (int signal); |
| 43 |
|
| 44 |
/* |
| 45 |
* Detach from current terminal, write pidfile, kill parent |
| 46 |
*/ |
| 47 |
extern int detach (int do_detach); |
| 48 |
|
| 49 |
/* |
| 50 |
* check wether the given path is an absolute pathname |
| 51 |
*/ |
| 52 |
#define ABSOLUTE_PATH(c) ((c)[0] == '/') |
| 53 |
|
| 54 |
/*****************************************************************************/ |
| 55 |
|
| 56 |
typedef u8 mac[6]; |
| 57 |
|
| 58 |
extern void id2mac (unsigned int id, void *m); |
| 59 |
|
| 60 |
#define mac2id(p) ((p)[0] & 0x01 ? 0 : ((p)[4] << 8) | (p)[5]) |
| 61 |
|
| 62 |
struct sliding_window { |
| 63 |
u32 v[(WINDOWSIZE + 31) / 32]; |
| 64 |
u32 seq; |
| 65 |
|
| 66 |
void reset (u32 seqno) |
| 67 |
{ |
| 68 |
memset (v, -1, sizeof v); |
| 69 |
seq = seqno; |
| 70 |
} |
| 71 |
|
| 72 |
bool recv_ok (u32 seqno) |
| 73 |
{ |
| 74 |
if (seqno <= seq - WINDOWSIZE) |
| 75 |
slog (L_ERR, _("received duplicate or outdated packet (received %08lx, expected %08lx)\n" |
| 76 |
"possible replay attack, or just massive packet reordering"), seqno, seq + 1); |
| 77 |
else if (seqno > seq + WINDOWSIZE * 4) |
| 78 |
slog (L_ERR, _("received duplicate or out-of-sync packet (received %08lx, expected %08lx)\n" |
| 79 |
"possible replay attack, or just massive packet loss"), seqno, seq + 1); |
| 80 |
else |
| 81 |
{ |
| 82 |
while (seqno > seq) |
| 83 |
{ |
| 84 |
seq++; |
| 85 |
|
| 86 |
u32 s = seq % WINDOWSIZE; |
| 87 |
u32 *cell = v + (s >> 5); |
| 88 |
u32 mask = 1 << (s & 31); |
| 89 |
|
| 90 |
*cell &= ~mask; |
| 91 |
} |
| 92 |
|
| 93 |
u32 s = seqno % WINDOWSIZE; |
| 94 |
u32 *cell = v + (s >> 5); |
| 95 |
u32 mask = 1 << (s & 31); |
| 96 |
|
| 97 |
if (*cell & mask) |
| 98 |
slog (L_ERR, _("received duplicate packet (received %08lx, expected %08lx)\n" |
| 99 |
"possible replay attack, or just packet duplication"), seqno, seq + 1); |
| 100 |
else |
| 101 |
{ |
| 102 |
*cell |= mask; |
| 103 |
return true; |
| 104 |
} |
| 105 |
} |
| 106 |
|
| 107 |
return false; |
| 108 |
} |
| 109 |
}; |
| 110 |
|
| 111 |
typedef callback0<const char *> run_script_cb; |
| 112 |
|
| 113 |
// run a shell script (or actually an external program). |
| 114 |
bool run_script (const run_script_cb &cb, bool wait); |
| 115 |
|
| 116 |
#if ENABLE_HTTP_PROXY |
| 117 |
u8 *base64_encode (const u8 *data, unsigned int len); |
| 118 |
#endif |
| 119 |
|
| 120 |
/*****************************************************************************/ |
| 121 |
|
| 122 |
typedef u8 rsaclear[RSA_KEYLEN - RSA_OVERHEAD]; // challenge data; |
| 123 |
typedef u8 rsacrypt[RSA_KEYLEN]; // encrypted challenge |
| 124 |
|
| 125 |
static inline void |
| 126 |
rsa_encrypt (RSA *key, const rsaclear &chg, rsacrypt &encr) |
| 127 |
{ |
| 128 |
if (RSA_public_encrypt (sizeof chg, |
| 129 |
(unsigned char *)&chg, (unsigned char *)&encr, |
| 130 |
key, RSA_PKCS1_OAEP_PADDING) < 0) |
| 131 |
fatal ("RSA_public_encrypt error"); |
| 132 |
} |
| 133 |
|
| 134 |
static inline bool |
| 135 |
rsa_decrypt (RSA *key, const rsacrypt &encr, rsaclear &chg) |
| 136 |
{ |
| 137 |
return RSA_private_decrypt (sizeof encr, |
| 138 |
(unsigned char *)&encr, (unsigned char *)&chg, |
| 139 |
key, RSA_PKCS1_OAEP_PADDING) > 0; |
| 140 |
} |
| 141 |
|
| 142 |
#endif |
| 143 |
|
