File: win32_utility.cc

package info (click to toggle)
pdns-recursor 3.2-4
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 1,088 kB
  • ctags: 2,390
  • sloc: cpp: 12,551; ansic: 2,587; sh: 510; makefile: 133
file content (408 lines) | stat: -rw-r--r-- 10,371 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
/*
    PowerDNS Versatile Database Driven Nameserver
    Copyright (C) 2002 - 2006 PowerDNS.COM BV

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

// Utility class win32 implementation.

#include "utility.hh"
#include <iostream>
#include <mmsystem.h>

// Closes a socket.
int Utility::closesocket( Utility::sock_t socket )
{
  return ::closesocket( socket );
}


// Drops the program's privileges.
void Utility::dropPrivs( int uid, int gid )
{
}


// Returns the current process id.
Utility::pid_t Utility::getpid( void )
{
  return GetCurrentProcessId();
}


// Returns a monotonic clock
int Utility::gettimeofday( struct timeval *tv, void *tz )
{
  if ( tv == NULL )
    return -1;

  DWORD ticks = timeGetTime();
  tv->tv_sec  = 86400 + static_cast< long >( ticks / 1000 );
  tv->tv_usec = static_cast< long >( ticks % 1000 );

  return 0;
}


// Converts an address from dot and numbers format to binary data.
int Utility::inet_aton( const char *cp, struct in_addr *inp )
{
  if ( cp == NULL )
    return 0;

  if (( inp->s_addr = inet_addr( cp )) == -1 )
    return 0;

  return 1;
}


// The inet_ntop() function converts an address from network format (usually a struct in_addr or some other binary form, in network byte order) to presentation format.
const char *Utility::inet_ntop( int af, const char *src, char *dst, size_t size )
{
  if ( af == AF_INET )
    return inet_ntop4( src, dst, size );
  else if ( af == AF_INET6 )
    return inet_ntop6( src, dst, size );
    
  return NULL;
}


// Converts an address from presentation format to network format.
int Utility::inet_pton( int af, const char *src, void *dst )
{
  if ( af == AF_INET )
    return inet_pton4( src, dst );
  else if ( af == AF_INET6 )
    return inet_pton6( src, dst );

  // TODO: Implement this.
  return 0;
}


// Converts an ipv4 address from www.xxx.yyy.zzz format to binary data.
int Utility::inet_pton4( const char *src, void *dst )
{
  struct in_addr tmp;

  if ( inet_aton( src, &tmp ) == -1 )
    return 0;

  memcpy( dst, &tmp, sizeof( struct in_addr ));

  return 1;
}


const char *Utility::inet_ntop4( const char *src, char *dst, size_t size )
{
  char *temp = inet_ntoa( *( reinterpret_cast< const struct in_addr * >( src )));

  if ( temp == NULL )
    return NULL;

  memcpy( dst, temp, size );

  return reinterpret_cast< const char * >( dst );
}

#define NS_IN6ADDRSZ  16
#define NS_INT16SZ    2
#define NS_INADDRSZ   4

const char *
Utility::inet_ntop6( const char *src, char *dst, size_t size )
{
        /*
         * Note that int32_t and int16_t need only be "at least" large enough
         * to contain a value of the specified size.  On some systems, like
         * Crays, there is no such thing as an integer variable with 16 bits.
         * Keep this in mind if you think this function should have been coded
         * to use pointer overlays.  All the world's not a VAX.
         */
        char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
        struct { int base, len; } best, cur;
        uint16_t words[NS_IN6ADDRSZ / NS_INT16SZ];
        int i;

        /*
         * Preprocess:
         *	Copy the input (bytewise) array into a wordwise array.
         *	Find the longest run of 0x00's in src[] for :: shorthanding.
         */
        memset(words, '\0', sizeof words);
        for (i = 0; i < NS_IN6ADDRSZ; i++)
        	words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
        best.base = -1;
        cur.base = -1;
        for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
        	if (words[i] == 0) {
        		if (cur.base == -1)
        			cur.base = i, cur.len = 1;
        		else
        			cur.len++;
        	} else {
        		if (cur.base != -1) {
        			if (best.base == -1 || cur.len > best.len)
        				best = cur;
        			cur.base = -1;
        		}
        	}
        }
        if (cur.base != -1) {
        	if (best.base == -1 || cur.len > best.len)
        		best = cur;
        }
        if (best.base != -1 && best.len < 2)
        	best.base = -1;

        /*
         * Format the result.
         */
        tp = tmp;
        for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
        	/* Are we inside the best run of 0x00's? */
        	if (best.base != -1 && i >= best.base &&
        	    i < (best.base + best.len)) {
        		if (i == best.base)
        			*tp++ = ':';
        		continue;
        	}
        	/* Are we following an initial run of 0x00s or any real hex? */
        	if (i != 0)
        		*tp++ = ':';
        	/* Is this address an encapsulated IPv4? */
        	if (i == 6 && best.base == 0 && (best.len == 6 ||
        	    (best.len == 7 && words[7] != 0x0001) ||
        	    (best.len == 5 && words[5] == 0xffff))) {
        		if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
        			return (NULL);
        		tp += strlen(tp);
        		break;
        	}
        	tp += sprintf(tp, "%x", words[i]);
        }
        /* Was it a trailing run of 0x00's? */
        if (best.base != -1 && (best.base + best.len) == 
            (NS_IN6ADDRSZ / NS_INT16SZ))
        	*tp++ = ':';
        *tp++ = '\0';

        /*
         * Check for overflow, copy, and we're done.
         */
        if ((size_t)(tp - tmp) > size) {
          // errno = ENOSPC;
          return (NULL);
        }
        strcpy(dst, tmp);
        return (dst);
}



/* int
 * inet_pton6(src, dst)
 *        convert presentation level address to network order binary form.
 * return:
 *        1 if `src' is a valid [RFC1884 2.2] address, else 0.
 * notice:
 *        (1) does not touch `dst' unless it's returning 1.
 *        (2) :: in a full address is silently ignored.
 * credit:
 *        inspired by Mark Andrews.
 * author:
 *        Paul Vixie, 1996.
 */
int
Utility::inet_pton6( const char *src, void *dst )
{
        static const char xdigits_l[] = "0123456789abcdef",
        		  xdigits_u[] = "0123456789ABCDEF";
        u_char tmp[NS_IN6ADDRSZ], *tp, *endp, *colonp;
        const char *xdigits, *curtok;
        int ch, saw_xdigit;
        u_int val;

        memset((tp = tmp), '\0', NS_IN6ADDRSZ);
        endp = tp + NS_IN6ADDRSZ;
        colonp = NULL;
        /* Leading :: requires some special handling. */
        if (*src == ':')
        	if (*++src != ':')
        		return (0);
        curtok = src;
        saw_xdigit = 0;
        val = 0;
        while ((ch = *src++) != '\0') {
        	const char *pch;

        	if ((pch = strchr((xdigits = xdigits_l), ch)) == NULL)
        		pch = strchr((xdigits = xdigits_u), ch);
        	if (pch != NULL) {
        		val <<= 4;
        		val |= (pch - xdigits);
        		if (val > 0xffff)
        			return (0);
        		saw_xdigit = 1;
        		continue;
        	}
        	if (ch == ':') {
        		curtok = src;
        		if (!saw_xdigit) {
        			if (colonp)
        				return (0);
        			colonp = tp;
        			continue;
        		} else if (*src == '\0') {
        			return (0);
        		}
        		if (tp + NS_INT16SZ > endp)
        			return (0);
        		*tp++ = (u_char) (val >> 8) & 0xff;
        		*tp++ = (u_char) val & 0xff;
        		saw_xdigit = 0;
        		val = 0;
        		continue;
        	}
        	if (ch == '.' && ((tp + NS_INADDRSZ) <= endp) &&
        	    inet_pton4(curtok, tp) > 0) {
        		tp += NS_INADDRSZ;
        		saw_xdigit = 0;
        		break;	/* '\0' was seen by inet_pton4(). */
        	}
        	return (0);
        }
        if (saw_xdigit) {
        	if (tp + NS_INT16SZ > endp)
        		return (0);
        	*tp++ = (u_char) (val >> 8) & 0xff;
        	*tp++ = (u_char) val & 0xff;
        }
        if (colonp != NULL) {
        	/*
        	 * Since some memmove()'s erroneously fail to handle
        	 * overlapping regions, we'll do the shift by hand.
        	 */
        	const int n = tp - colonp;
        	int i;

        	if (tp == endp)
        		return (0);
        	for (i = 1; i <= n; i++) {
        		endp[- i] = colonp[n - i];
        		colonp[n - i] = 0;
        	}
        	tp = endp;
        }
        if (tp != endp)
        	return (0);
        memcpy(dst, tmp, NS_IN6ADDRSZ);
        return (1);
}
#undef NS_IN6ADDRSZ
#undef NS_INT16SZ
#undef NS_INADDRSZ


// Returns a random number.
long int Utility::random( void )
{
  return rand();
}


// Retrieves a gid using a groupname.
int Utility::makeGidNumeric( const std::string & group )
{
  return 0;
}


// Retrieves an uid using a username.
int Utility::makeUidNumeric( const std::string & username )
{
  return 0;
}


// Sets the socket into blocking mode.
bool Utility::setBlocking( Utility::sock_t socket )
{
  unsigned long tmp = 0;

  if ( ioctlsocket( socket, FIONBIO, &tmp ) == SOCKET_ERROR )
    return false;

  return true;
}


// Sets the socket into non-blocking mode.
bool Utility::setNonBlocking( Utility::sock_t socket )
{
  unsigned long tmp = 1;

  if( ioctlsocket( socket, FIONBIO, &tmp ) == SOCKET_ERROR )
    return false;

  return true;
}


// Sleeps for a number of seconds.
unsigned int Utility::sleep( unsigned int seconds )
{
  Sleep( seconds * 1000 );
  return 0;
}


// Sets the random seed.
void Utility::srandom( unsigned int seed )
{
  srand( seed );
}


// Sleeps for a number of microseconds.
void Utility::usleep( unsigned long usec )
{
  Sleep( usec / 1000 );
}


// Writes a vector.
int Utility::writev( Utility::sock_t socket, const Utility::iovec *vector, size_t count )
{
  unsigned int i;
  int res;
  int nbytes = 0;

  for ( i = 0; i < count; i++ )
  {
    res = send( socket, reinterpret_cast< const char * >(  vector[ i ].iov_base ), vector[ i ].iov_len, 0 );
    if ( res == -1 )
      return -1;

    nbytes += res;
  }

  return nbytes;
}