| 1 | /* |
1 | /* |
| 2 | util.h -- process management and other utility functions |
2 | util.h -- process management and other utility functions |
| 3 | Copyright (C) 1998-2002 Ivo Timmermans <ivo@o2w.nl> |
3 | Copyright (C) 1998-2002 Ivo Timmermans <ivo@o2w.nl> |
| 4 | 2000-2002 Guus Sliepen <guus@sliepen.eu.org> |
4 | 2000-2002 Guus Sliepen <guus@sliepen.eu.org> |
| 5 | 2003 Marc Lehmannn <pcg@goof.com> |
5 | 2003 Marc Lehmann <pcg@goof.com> |
| 6 | |
6 | |
| 7 | This program is free software; you can redistribute it and/or modify |
7 | This program is free software; you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
8 | it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation; either version 2 of the License, or |
9 | the Free Software Foundation; either version 2 of the License, or |
| 10 | (at your option) any later version. |
10 | (at your option) any later version. |
| … | |
… | |
| 20 | */ |
20 | */ |
| 21 | |
21 | |
| 22 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
| 23 | #define UTIL_H__ |
23 | #define UTIL_H__ |
| 24 | |
24 | |
| 25 | #include <sys/socket.h> |
25 | #include <openssl/rsa.h> |
| 26 | #include <netinet/in.h> |
|
|
| 27 | |
26 | |
| 28 | #include <map> |
27 | #include "gettext.h" |
| 29 | |
28 | |
|
|
29 | #include "slog.h" |
| 30 | #include "device.h" |
30 | #include "iom.h" |
| 31 | |
|
|
| 32 | #define SOCKADDR sockaddr_in // this is lame, I know |
|
|
| 33 | |
31 | |
| 34 | /* |
32 | /* |
| 35 | * check for an existing vped for this net, and write pid to pidfile |
33 | * check for an existing vped for this net, and write pid to pidfile |
| 36 | */ |
34 | */ |
| 37 | extern int write_pidfile (void); |
35 | extern int write_pidfile (void); |
| … | |
… | |
| 54 | /* |
52 | /* |
| 55 | * check wether the given path is an absolute pathname |
53 | * check wether the given path is an absolute pathname |
| 56 | */ |
54 | */ |
| 57 | #define ABSOLUTE_PATH(c) ((c)[0] == '/') |
55 | #define ABSOLUTE_PATH(c) ((c)[0] == '/') |
| 58 | |
56 | |
| 59 | static inline void |
57 | /*****************************************************************************/ |
| 60 | id2mac (unsigned int id, void *m) |
|
|
| 61 | { |
|
|
| 62 | mac &p = *(mac *)m; |
|
|
| 63 | |
58 | |
| 64 | p[0] = 0xfe; |
59 | typedef u8 mac[6]; |
| 65 | p[1] = 0xfd; |
|
|
| 66 | p[2] = 0x80; |
|
|
| 67 | p[3] = 0x00; |
|
|
| 68 | p[4] = id >> 8; |
|
|
| 69 | p[5] = id; |
|
|
| 70 | } |
|
|
| 71 | |
60 | |
| 72 | #define mac2id(p) (p[0] & 0x01 ? 0 : (p[4] << 8) | p[5]) |
61 | extern void id2mac (unsigned int id, void *m); |
| 73 | |
62 | |
| 74 | // a very simple fifo pkt-queue |
63 | #define mac2id(p) ((p)[0] & 0x01 ? 0 : ((p)[4] << 8) | (p)[5]) |
| 75 | class pkt_queue |
|
|
| 76 | { |
|
|
| 77 | tap_packet *queue[QUEUEDEPTH]; |
|
|
| 78 | int i, j; |
|
|
| 79 | |
|
|
| 80 | public: |
|
|
| 81 | |
|
|
| 82 | void put (tap_packet *p); |
|
|
| 83 | tap_packet *get (); |
|
|
| 84 | |
|
|
| 85 | pkt_queue (); |
|
|
| 86 | ~pkt_queue (); |
|
|
| 87 | }; |
|
|
| 88 | |
|
|
| 89 | struct sockinfo |
|
|
| 90 | { |
|
|
| 91 | u32 host; |
|
|
| 92 | u16 port; |
|
|
| 93 | |
|
|
| 94 | void set (const SOCKADDR *sa) |
|
|
| 95 | { |
|
|
| 96 | host = sa->sin_addr.s_addr; |
|
|
| 97 | port = sa->sin_port; |
|
|
| 98 | } |
|
|
| 99 | |
|
|
| 100 | sockinfo() |
|
|
| 101 | { |
|
|
| 102 | host = port = 0; |
|
|
| 103 | } |
|
|
| 104 | |
|
|
| 105 | sockinfo(const SOCKADDR &sa) |
|
|
| 106 | { |
|
|
| 107 | set (&sa); |
|
|
| 108 | } |
|
|
| 109 | |
|
|
| 110 | sockinfo(const SOCKADDR *sa) |
|
|
| 111 | { |
|
|
| 112 | set (sa); |
|
|
| 113 | } |
|
|
| 114 | |
|
|
| 115 | SOCKADDR *sa() |
|
|
| 116 | { |
|
|
| 117 | static SOCKADDR sa; |
|
|
| 118 | |
|
|
| 119 | sa.sin_family = AF_INET; |
|
|
| 120 | sa.sin_port = port; |
|
|
| 121 | sa.sin_addr.s_addr = host; |
|
|
| 122 | |
|
|
| 123 | return &sa; |
|
|
| 124 | } |
|
|
| 125 | |
|
|
| 126 | operator const char *(); |
|
|
| 127 | }; |
|
|
| 128 | |
|
|
| 129 | inline bool |
|
|
| 130 | operator == (const sockinfo &a, const sockinfo &b) |
|
|
| 131 | { |
|
|
| 132 | return a.host == b.host && a.port == b.port; |
|
|
| 133 | } |
|
|
| 134 | |
|
|
| 135 | inline bool |
|
|
| 136 | operator < (const sockinfo &a, const sockinfo &b) |
|
|
| 137 | { |
|
|
| 138 | return a.host < b.host |
|
|
| 139 | || (a.host == b.host && a.port < b.port); |
|
|
| 140 | } |
|
|
| 141 | |
|
|
| 142 | // only do action once every x seconds per host. |
|
|
| 143 | // currently this is quite a slow implementation, |
|
|
| 144 | // but suffices for normal operation. |
|
|
| 145 | struct u32_rate_limiter : private map<u32, time_t> |
|
|
| 146 | { |
|
|
| 147 | int every; |
|
|
| 148 | |
|
|
| 149 | bool can (u32 host); |
|
|
| 150 | |
|
|
| 151 | u32_rate_limiter (time_t every = 1) |
|
|
| 152 | { |
|
|
| 153 | this->every = every; |
|
|
| 154 | } |
|
|
| 155 | }; |
|
|
| 156 | |
|
|
| 157 | struct net_rate_limiter : u32_rate_limiter |
|
|
| 158 | { |
|
|
| 159 | bool can (SOCKADDR *sa) { return u32_rate_limiter::can((u32)sa->sin_addr.s_addr); } |
|
|
| 160 | bool can (sockinfo &si) { return u32_rate_limiter::can((u32)si.host); } |
|
|
| 161 | |
|
|
| 162 | net_rate_limiter (time_t every) : u32_rate_limiter (every) {} |
|
|
| 163 | }; |
|
|
| 164 | |
64 | |
| 165 | struct sliding_window { |
65 | struct sliding_window { |
| 166 | u32 v[(WINDOWSIZE + 31) / 32]; |
66 | u32 v[(WINDOWSIZE + 31) / 32]; |
| 167 | u32 seq; |
67 | u32 seq; |
| 168 | |
68 | |
| … | |
… | |
| 195 | |
95 | |
| 196 | u32 s = seqno % WINDOWSIZE; |
96 | u32 s = seqno % WINDOWSIZE; |
| 197 | u32 *cell = v + (s >> 5); |
97 | u32 *cell = v + (s >> 5); |
| 198 | u32 mask = 1 << (s & 31); |
98 | u32 mask = 1 << (s & 31); |
| 199 | |
99 | |
| 200 | //printf ("received seqno %08lx, seq %08lx, mask %08lx is %08lx\n", seqno, seq, mask, ismask); |
|
|
| 201 | if (*cell & mask) |
100 | if (*cell & mask) |
| 202 | { |
101 | { |
| 203 | slog (L_ERR, _("received duplicate packet (received %08lx, expected %08lx)\n" |
102 | slog (L_ERR, _("received duplicate packet (received %08lx, expected %08lx)\n" |
| 204 | "possible replay attack, or just packet duplication"), seqno, seq + 1);//D |
103 | "possible replay attack, or just packet duplication"), seqno, seq + 1);//D |
| 205 | return false; |
104 | return false; |
| … | |
… | |
| 211 | } |
110 | } |
| 212 | } |
111 | } |
| 213 | } |
112 | } |
| 214 | }; |
113 | }; |
| 215 | |
114 | |
|
|
115 | typedef callback0<const char *> run_script_cb; |
|
|
116 | |
|
|
117 | // run a shell script (or actually an external program). |
|
|
118 | void run_script (const run_script_cb &cb, bool wait); |
|
|
119 | |
|
|
120 | #if ENABLE_HTTP_PROXY |
|
|
121 | u8 *base64_encode (const u8 *data, unsigned int len); |
| 216 | #endif |
122 | #endif |
| 217 | |
123 | |
|
|
124 | /*****************************************************************************/ |
|
|
125 | |
|
|
126 | typedef u8 rsaclear[RSA_KEYLEN - RSA_OVERHEAD]; // challenge data; |
|
|
127 | typedef u8 rsacrypt[RSA_KEYLEN]; // encrypted challenge |
|
|
128 | |
|
|
129 | static inline void |
|
|
130 | rsa_encrypt (RSA *key, const rsaclear &chg, rsacrypt &encr) |
|
|
131 | { |
|
|
132 | if (RSA_public_encrypt (sizeof chg, |
|
|
133 | (unsigned char *)&chg, (unsigned char *)&encr, |
|
|
134 | key, RSA_PKCS1_OAEP_PADDING) < 0) |
|
|
135 | fatal ("RSA_public_encrypt error"); |
|
|
136 | } |
|
|
137 | |
|
|
138 | static inline bool |
|
|
139 | rsa_decrypt (RSA *key, const rsacrypt &encr, rsaclear &chg) |
|
|
140 | { |
|
|
141 | return RSA_private_decrypt (sizeof encr, |
|
|
142 | (unsigned char *)&encr, (unsigned char *)&chg, |
|
|
143 | key, RSA_PKCS1_OAEP_PADDING) > 0; |
|
|
144 | } |
|
|
145 | |
|
|
146 | #endif |
|
|
147 | |
