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 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502
|
/*********************************************************
* Copyright (C) 1998 VMware, Inc. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation version 2.1 and no 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 Lesser GNU General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
*********************************************************/
/*
* util.c --
*
* misc util functions
*/
#if defined(_WIN32)
#include <winsock2.h> // also includes windows.h
#include <io.h>
#include <process.h>
#endif
#include "vm_ctype.h"
#include "safetime.h"
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <stddef.h>
#include <stdarg.h>
#include <errno.h>
#include <ctype.h>
#if !defined(_WIN32) && !defined(N_PLAT_NLM)
# if defined(linux)
# include <sys/syscall.h> // for SYS_gettid
# endif
# include <unistd.h>
# include <pwd.h>
#endif
#if defined(__APPLE__) || defined(__FreeBSD__)
#include <pthread.h>
#endif
#include "vmware.h"
#include "msg.h"
#include "util.h"
#include "str.h"
/* For HARD_EXPIRE --hpreg */
#include "vm_version.h"
#include "su.h"
#include "escape.h"
#include "posix.h"
#if defined(_WIN32)
#include "win32u.h"
#include "win32util.h"
#endif
/*
* ESX with userworld VMX
*/
#if defined(VMX86_SERVER)
#include "hostType.h"
#include "user_layout.h"
#endif
#if !defined(N_PLAT_NLM)
/*
*-----------------------------------------------------------------------------
*
* Util_GetCanonicalPath --
*
* Canonicalizes a path name.
*
* Results:
* A freshly allocated canonicalized path name.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
char*
Util_GetCanonicalPath(const char *path) // IN
{
char *canonicalPath = NULL;
#if defined(__linux__) || defined(__APPLE__)
canonicalPath = Posix_RealPath(path);
#elif defined(_WIN32)
char driveSpec[4];
Bool remoteDrive = FALSE;
if (!path || !*path) {
return NULL;
}
memcpy(driveSpec, path, 3);
driveSpec[3] = '\0';
if (strchr(VALID_DIRSEPS, driveSpec[0]) &&
strchr(VALID_DIRSEPS, driveSpec[1])) {
remoteDrive = TRUE;
} else {
remoteDrive = (GetDriveTypeA(driveSpec) == DRIVE_REMOTE);
}
/*
* If the path is *potentially* a path to remote share, we do not
* call GetLongPathName, because if the remote server is unreachable,
* that function could hang. We sacrifice two things by doing so:
* 1. The UNC path could refer to the local host and we incorrectly
* assume remote.
* 2. We do not resolve 8.3 names for remote paths.
*/
if (remoteDrive) {
canonicalPath = strdup(path);
} else {
canonicalPath = W32Util_RobustGetLongPath(path);
}
#else
NOT_IMPLEMENTED();
#endif
return canonicalPath;
}
#endif
#if defined(_WIN32)
/*
*-----------------------------------------------------------------------------
*
* Util_GetCanonicalPathForHash --
*
* Utility function to both get the canonical version of the input path
* and produce a unique case-insensitive version of the path suitable
* for use as a seed to hash functions.
*
* Results:
* Canonicalized UTF-8 pathname suitable for use in hashing.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
char *
Util_GetCanonicalPathForHash(const char *path) // IN: UTF-8
{
char *ret = NULL;
char *cpath = Util_GetCanonicalPath(path);
if (cpath != NULL) {
ret = Unicode_FoldCase(cpath);
free(cpath);
}
return ret;
}
/*
*-----------------------------------------------------------------------------
*
* UtilGetLegacyEncodedString --
*
* Takes a UTF-8 string, and allocates a new string in legacy encoding.
* This is necessary to maintain compatibility with older versions of
* the product, which may have stored strings (paths) in legacy
* encoding. Hence, the use of WideCharToMultiByte().
*
* Results:
* An allocated string in legacy encoding (MBCS when applicable).
* NULL on failure.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
static char*
UtilGetLegacyEncodedString(const char *path) // IN: UTF-8
{
char *ret = NULL;
char *cpath = Util_GetCanonicalPath(path);
if (cpath != NULL) {
char *apath = NULL;
int retlen;
WCHAR *wcpath = Unicode_GetAllocUTF16(cpath);
/* First get the length of multibyte string */
int alen = WideCharToMultiByte(CP_ACP, WC_COMPOSITECHECK, wcpath, -1,
NULL, 0, NULL, NULL);
if (alen > 0) {
/* Now get the converted string */
ret = Util_SafeMalloc(alen);
retlen = WideCharToMultiByte(CP_ACP, WC_COMPOSITECHECK, wcpath, -1,
ret, alen, NULL, NULL);
if (retlen != alen) {
free(ret);
ret = NULL;
}
}
free(cpath);
free(wcpath);
}
return ret;
}
/*
*-----------------------------------------------------------------------------
*
* Util_CompatGetCanonicalPath --
*
* Canonicalizes a path name (compatibility version).
*
* Results:
* A freshly allocated canonicalized path name in legacy encoding
* (MBCS when applicable).
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
char*
Util_CompatGetCanonicalPath(const char *path) // IN: UTF-8
{
char *cpath = Util_GetCanonicalPath(path);
char *ret = NULL;
if (cpath != NULL) {
ret = UtilGetLegacyEncodedString(cpath);
free(cpath);
}
return ret;
}
#endif
/*
*-----------------------------------------------------------------------------
*
* Util_CanonicalPathsIdentical --
*
* Utility function to compare two paths that have already been made
* canonical. This function exists to mask platform differences in
* path case-sensitivity.
*
* XXX: This implementation makes assumptions about the host filesystem's
* case sensitivity without any regard to what filesystem the provided
* paths actually use. There are many ways to break this assumption,
* on any of our supported host OSes! The return value of this function
* cannot be trusted.
*
* Results:
* TRUE if the paths are equivalenr, FALSE if they are not.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
Bool
Util_CanonicalPathsIdentical(const char *path1, // IN
const char *path2) // IN
{
ASSERT(path1);
ASSERT(path2);
#if defined(linux)
return (strcmp(path1, path2) == 0);
#elif defined(_WIN32)
return (_stricmp(path1, path2) == 0);
#elif defined(__APPLE__)
return (strcasecmp(path1, path2) == 0);
#else
NOT_IMPLEMENTED();
#endif
}
/*
*-----------------------------------------------------------------------------
*
* Util_IsAbsolutePath --
*
* Checks if the given path is absolute.
*
* Results:
* TRUE if the path is absolute, FALSE otherwise.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
Bool
Util_IsAbsolutePath(const char *path) // IN: path to check
{
#if defined(__linux__) || defined(__APPLE__)
// path[0] is valid even for the empty string.
return path && path[0] == DIRSEPC;
#elif defined(_WIN32)
// if the length is 2, path[2] will be valid because of the null terminator.
if (!path || strlen(path) < 2) {
return FALSE;
}
// <Drive letter>:\path
if (CType_IsAlpha(path[0]) && path[1] == ':' && path[2] == DIRSEPC) {
return TRUE;
}
// UNC paths
if (path[0] == DIRSEPC && path[1] == DIRSEPC) {
return TRUE;
}
return FALSE;
#else
NOT_IMPLEMENTED();
#endif
NOT_REACHED();
}
/*
*-----------------------------------------------------------------------------
*
* Util_GetPrime --
*
* Find next prime.
*
* Results:
* The smallest prime number greater than or equal to n0.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
unsigned
Util_GetPrime(unsigned n0)
{
unsigned i, ii, n, nn;
/*
* Keep the main algorithm clean by catching edge cases here.
* There is no 32-bit prime larger than 4294967291.
*/
ASSERT_NOT_IMPLEMENTED(n0 <= 4294967291U);
if (n0 <= 2) {
return 2;
}
for (n = n0 | 1;; n += 2) {
/*
* Run through the numbers 3,5, ..., sqrt(n) and check that none divides
* n. We exploit the identity (i + 2)^2 = i^2 + 4i + 4 to incrementially
* maintain the square of i (and thus save a multiplication each
* iteration).
*
* 65521 is the largest prime below 0xffff, which is where
* we can stop. Using it instead of 0xffff avoids overflowing ii.
*/
nn = MIN(n, 65521U * 65521U);
for (i = 3, ii = 9;; ii += 4*i+4, i += 2) {
if (ii > nn) {
return n;
}
if (n % i == 0) {
break;
}
}
}
}
#ifndef N_PLAT_NLM
#if defined(linux)
/*
*-----------------------------------------------------------------------------
*
* gettid --
*
* Retrieve unique thread identification suitable for kill or setpriority.
* Do not call this function directly, use Util_GetCurrentThreadId() instead.
*
* Results:
* Unique thread identification on success.
* (pid_t)-1 on error, errno set (when kernel does not support this call)
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
static INLINE
pid_t gettid(void)
{
#if defined(SYS_gettid)
return (pid_t)syscall(SYS_gettid);
#else
return -1;
#endif
}
#endif
/*
*-----------------------------------------------------------------------------
*
* Util_GetCurrentThreadId --
*
* Retrieves a unique thread identification suitable to identify a thread
* to kill it or change its scheduling priority.
*
* Results:
* Unique thread identification on success.
* ASSERTs on failure (should not happen).
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
Util_ThreadID
Util_GetCurrentThreadId(void)
{
#if defined(linux)
/*
* It is possible that two threads can enter gettid() path simultaneously,
* both eventually clearing useTid to zero. It does not matter - only
* problem which can happen is that useTid will be set to zero twice.
* And it has no impact on useTid value...
*/
static int useTid = 1;
#if defined(VMX86_SERVER) && defined(VMX86_VMX) // ESX with userworld VMX
static __thread pid_t tid = -1;
#else
pid_t tid;
#endif
if (useTid) {
#if defined(VMX86_SERVER) && defined(VMX86_VMX) // ESX with userworld VMX
if (tid != -1) {
return tid;
}
#endif
tid = gettid();
if (tid != (pid_t)-1) {
return tid;
}
ASSERT(errno == ENOSYS);
useTid = 0;
}
tid = getpid();
ASSERT(tid != (pid_t)-1);
return tid;
#elif defined(sun)
pid_t tid;
tid = getpid();
ASSERT(tid != (pid_t)-1);
return tid;
#elif defined(__APPLE__) || defined(__FreeBSD__)
ASSERT_ON_COMPILE(sizeof(Util_ThreadID) == sizeof(pthread_t));
return pthread_self();
#elif defined(_WIN32)
return GetCurrentThreadId();
#else
#error "Unknown platform"
#endif
}
#endif // N_PLAT_NLM
|