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
|
/* Copyright (C) 2002-2005 RealVNC Ltd. All Rights Reserved.
*
* This 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 software 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 software; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
//
// util.h - miscellaneous useful bits
//
#ifndef __RFB_UTIL_H__
#define __RFB_UTIL_H__
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <limits.h>
#include <string.h>
struct timeval;
namespace rfb {
// -=- Class to handle cleanup of arrays of characters
class CharArray {
public:
CharArray() : buf(0) {}
CharArray(char* str) : buf(str) {} // note: assumes ownership
CharArray(int len) {
buf = new char[len];
}
~CharArray() {
delete [] buf;
}
// Get the buffer pointer & clear it (i.e. caller takes ownership)
char* takeBuf() {char* tmp = buf; buf = 0; return tmp;}
void replaceBuf(char* b) {delete [] buf; buf = b;}
char* buf;
private:
CharArray(const CharArray&);
CharArray& operator=(const CharArray&);
};
char* strDup(const char* s);
void strFree(char* s);
// Returns true if split successful. Returns false otherwise.
// ALWAYS *copies* first part of string to out1 buffer.
// If limiter not found, leaves out2 alone (null) and just copies to out1.
// If out1 or out2 non-zero, calls strFree and zeroes them.
// If fromEnd is true, splits at end of string rather than beginning.
// Either out1 or out2 may be null, in which case the split will not return
// that part of the string. Obviously, setting both to 0 is not useful...
bool strSplit(const char* src, const char limiter, char** out1, char** out2, bool fromEnd=false);
// Returns true if src contains c
bool strContains(const char* src, char c);
// Copies src to dest, up to specified length-1, and guarantees termination
void strCopy(char* dest, const char* src, int destlen);
// HELPER functions for timeout handling
// soonestTimeout() is a function to help work out the soonest of several
// timeouts.
inline void soonestTimeout(int* timeout, int newTimeout) {
if (newTimeout && (!*timeout || newTimeout < *timeout))
*timeout = newTimeout;
}
// secsToMillis() turns seconds into milliseconds, capping the value so it
// can't wrap round and become -ve
inline int secsToMillis(int secs) {
return (secs < 0 || secs > (INT_MAX/1000) ? INT_MAX : secs * 1000);
}
// Returns time elapsed since given moment in milliseconds.
unsigned msSince(const struct timeval *then);
}
// Some platforms (e.g. Windows) include max() and min() macros in their
// standard headers, but they are also standard C++ template functions, so some
// C++ headers will undefine them. So we steer clear of the names min and max
// and define __rfbmin and __rfbmax instead.
#ifndef __rfbmax
#define __rfbmax(a,b) (((a) > (b)) ? (a) : (b))
#endif
#ifndef __rfbmin
#define __rfbmin(a,b) (((a) < (b)) ? (a) : (b))
#endif
// Declare strcasecmp() and/or strncasecmp() if absent on this system.
#if !defined(WIN32) && !defined(HAVE_STRCASECMP)
extern "C" {
int strcasecmp(const char *s1, const char *s2);
}
#endif
#if !defined(WIN32) && !defined(HAVE_STRNCASECMP)
extern "C" {
int strncasecmp(const char *s1, const char *s2, size_t n);
}
#endif
#endif
|
