util.c 12.8 KB
Newer Older
Vicent Marti committed
1
/*
Edward Thomson committed
2
 * Copyright (C) the libgit2 contributors. All rights reserved.
Vicent Marti committed
3 4 5 6
 *
 * This file is part of libgit2, distributed under the GNU GPL v2 with
 * a Linking Exception. For full terms see the included COPYING file.
 */
7
#include <git2.h>
8
#include "common.h"
9
#include <stdio.h>
10
#include <ctype.h>
11
#include "posix.h"
12

13
#ifdef _MSC_VER
14 15 16
# include <Shlwapi.h>
#endif

17 18 19
void git_strarray_free(git_strarray *array)
{
	size_t i;
20 21 22 23

	if (array == NULL)
		return;

24
	for (i = 0; i < array->count; ++i)
25
		git__free(array->strings[i]);
26

27
	git__free(array->strings);
28 29

	memset(array, 0, sizeof(*array));
30 31
}

32 33 34 35
int git_strarray_copy(git_strarray *tgt, const git_strarray *src)
{
	size_t i;

Russell Belfer committed
36
	assert(tgt && src);
37 38 39

	memset(tgt, 0, sizeof(*tgt));

Russell Belfer committed
40
	if (!src->count)
41 42
		return 0;

Russell Belfer committed
43
	tgt->strings = git__calloc(src->count, sizeof(char *));
44 45
	GITERR_CHECK_ALLOC(tgt->strings);

Russell Belfer committed
46 47
	for (i = 0; i < src->count; ++i) {
		if (!src->strings[i])
48
			continue;
49

Russell Belfer committed
50
		tgt->strings[tgt->count] = git__strdup(src->strings[i]);
51 52
		if (!tgt->strings[tgt->count]) {
			git_strarray_free(tgt);
Russell Belfer committed
53
			memset(tgt, 0, sizeof(*tgt));
54 55 56 57 58 59 60 61 62
			return -1;
		}

		tgt->count++;
	}

	return 0;
}

63
int git__strtol64(int64_t *result, const char *nptr, const char **endptr, int base)
64 65
{
	const char *p;
66
	int64_t n, nn;
67 68 69 70 71 72 73 74 75 76 77
	int c, ovfl, v, neg, ndig;

	p = nptr;
	neg = 0;
	n = 0;
	ndig = 0;
	ovfl = 0;

	/*
	 * White space
	 */
78
	while (git__isspace(*p))
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
		p++;

	/*
	 * Sign
	 */
	if (*p == '-' || *p == '+')
		if (*p++ == '-')
			neg = 1;

	/*
	 * Base
	 */
	if (base == 0) {
		if (*p != '0')
			base = 10;
		else {
			base = 8;
			if (p[1] == 'x' || p[1] == 'X') {
				p += 2;
				base = 16;
			}
		}
	} else if (base == 16 && *p == '0') {
		if (p[1] == 'x' || p[1] == 'X')
			p += 2;
	} else if (base < 0 || 36 < base)
		goto Return;

	/*
	 * Non-empty sequence of digits
	 */
	for (;; p++,ndig++) {
		c = *p;
		v = base;
		if ('0'<=c && c<='9')
			v = c - '0';
		else if ('a'<=c && c<='z')
			v = c - 'a' + 10;
		else if ('A'<=c && c<='Z')
			v = c - 'A' + 10;
		if (v >= base)
			break;
		nn = n*base + v;
		if (nn < n)
			ovfl = 1;
		n = nn;
	}

Return:
128 129 130 131
	if (ndig == 0) {
		giterr_set(GITERR_INVALID, "Failed to convert string to long. Not a number");
		return -1;
	}
132 133 134 135

	if (endptr)
		*endptr = p;

136 137 138 139
	if (ovfl) {
		giterr_set(GITERR_INVALID, "Failed to convert string to long. Overflow error");
		return -1;
	}
140 141

	*result = neg ? -n : n;
142
	return 0;
143 144
}

145
int git__strtol32(int32_t *result, const char *nptr, const char **endptr, int base)
146
{
147
	int error;
148 149
	int32_t tmp_int;
	int64_t tmp_long;
150

151
	if ((error = git__strtol64(&tmp_long, nptr, endptr, base)) < 0)
152 153 154
		return error;

	tmp_int = tmp_long & 0xFFFFFFFF;
155 156 157 158
	if (tmp_int != tmp_long) {
		giterr_set(GITERR_INVALID, "Failed to convert. '%s' is too large", nptr);
		return -1;
	}
159 160

	*result = tmp_int;
161

162 163 164
	return error;
}

165 166 167 168 169 170 171 172 173 174 175 176 177 178
int git__strcmp(const char *a, const char *b)
{
	while (*a && *b && *a == *b)
		++a, ++b;
	return (int)(*(const unsigned char *)a) - (int)(*(const unsigned char *)b);
}

int git__strcasecmp(const char *a, const char *b)
{
	while (*a && *b && tolower(*a) == tolower(*b))
		++a, ++b;
	return (tolower(*a) - tolower(*b));
}

179 180 181 182 183
int git__strcasesort_cmp(const char *a, const char *b)
{
	int cmp = 0;

	while (*a && *b) {
Russell Belfer committed
184 185 186 187
		if (*a != *b) {
			if (tolower(*a) != tolower(*b))
				break;
			/* use case in sort order even if not in equivalence */
188
			if (!cmp)
Russell Belfer committed
189 190
				cmp = (int)(*(const uint8_t *)a) - (int)(*(const uint8_t *)b);
		}
191 192 193 194 195 196 197 198 199 200

		++a, ++b;
	}

	if (*a || *b)
		return tolower(*a) - tolower(*b);

	return cmp;
}

201 202 203 204 205 206 207 208 209 210 211
int git__strncmp(const char *a, const char *b, size_t sz)
{
	while (sz && *a && *b && *a == *b)
		--sz, ++a, ++b;
	if (!sz)
		return 0;
	return (int)(*(const unsigned char *)a) - (int)(*(const unsigned char *)b);
}

int git__strncasecmp(const char *a, const char *b, size_t sz)
{
Philip Kelley committed
212
	int al, bl;
213

Philip Kelley committed
214
	do {
215 216
		al = (unsigned char)tolower(*a);
		bl = (unsigned char)tolower(*b);
Philip Kelley committed
217 218
		++a, ++b;
	} while (--sz && al && al == bl);
219

Philip Kelley committed
220
	return al - bl;
221 222
}

223
void git__strntolower(char *str, size_t len)
224
{
225
	size_t i;
226 227

	for (i = 0; i < len; ++i) {
228
		str[i] = (char) tolower(str[i]);
229 230 231 232 233 234 235 236
	}
}

void git__strtolower(char *str)
{
	git__strntolower(str, strlen(str));
}

237 238 239
int git__prefixcmp(const char *str, const char *prefix)
{
	for (;;) {
240
		unsigned char p = *(prefix++), s;
241 242 243 244 245 246 247
		if (!p)
			return 0;
		if ((s = *(str++)) != p)
			return s - p;
	}
}

248 249 250 251 252
int git__prefixcmp_icase(const char *str, const char *prefix)
{
	return strncasecmp(str, prefix, strlen(prefix));
}

253 254 255 256 257 258 259 260
int git__suffixcmp(const char *str, const char *suffix)
{
	size_t a = strlen(str);
	size_t b = strlen(suffix);
	if (a < b)
		return -1;
	return strcmp(str + (a - b), suffix);
}
261

262
char *git__strtok(char **end, const char *sep)
263
{
264
	char *ptr = *end;
265

266 267
	while (*ptr && strchr(sep, *ptr))
		++ptr;
268

269 270 271
	if (*ptr) {
		char *start = ptr;
		*end = start + 1;
272

273 274
		while (**end && !strchr(sep, **end))
			++*end;
275

276 277 278 279 280 281 282 283 284
		if (**end) {
			**end = '\0';
			++*end;
		}

		return start;
	}

	return NULL;
285 286
}

287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
/* Similar to strtok, but does not collapse repeated tokens. */
char *git__strsep(char **end, const char *sep)
{
	char *start = *end, *ptr = *end;

	while (*ptr && !strchr(sep, *ptr))
		++ptr;

	if (*ptr) {
		*end = ptr + 1;
		*ptr = '\0';

		return start;
	}

	return NULL;
}

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
void git__hexdump(const char *buffer, size_t len)
{
	static const size_t LINE_WIDTH = 16;

	size_t line_count, last_line, i, j;
	const char *line;

	line_count = (len / LINE_WIDTH);
	last_line = (len % LINE_WIDTH);

	for (i = 0; i < line_count; ++i) {
		line = buffer + (i * LINE_WIDTH);
		for (j = 0; j < LINE_WIDTH; ++j, ++line)
			printf("%02X ", (unsigned char)*line & 0xFF);

		printf("| ");

		line = buffer + (i * LINE_WIDTH);
		for (j = 0; j < LINE_WIDTH; ++j, ++line)
			printf("%c", (*line >= 32 && *line <= 126) ? *line : '.');

		printf("\n");
	}

	if (last_line > 0) {

		line = buffer + (line_count * LINE_WIDTH);
		for (j = 0; j < last_line; ++j, ++line)
			printf("%02X ", (unsigned char)*line & 0xFF);

		for (j = 0; j < (LINE_WIDTH - last_line); ++j)
Vicent Marti committed
336
			printf("	");
337 338 339 340 341 342 343 344 345 346 347 348

		printf("| ");

		line = buffer + (line_count * LINE_WIDTH);
		for (j = 0; j < last_line; ++j, ++line)
			printf("%c", (*line >= 32 && *line <= 126) ? *line : '.');

		printf("\n");
	}

	printf("\n");
}
349 350 351 352 353 354 355 356 357 358 359 360 361

#ifdef GIT_LEGACY_HASH
uint32_t git__hash(const void *key, int len, unsigned int seed)
{
	const uint32_t m = 0x5bd1e995;
	const int r = 24;
	uint32_t h = seed ^ len;

	const unsigned char *data = (const unsigned char *)key;

	while(len >= 4) {
		uint32_t k = *(uint32_t *)data;

362 363 364 365 366
		k *= m;
		k ^= k >> r;
		k *= m;

		h *= m;
367 368 369 370 371
		h ^= k;

		data += 4;
		len -= 4;
	}
372

373 374 375 376
	switch(len) {
	case 3: h ^= data[2] << 16;
	case 2: h ^= data[1] << 8;
	case 1: h ^= data[0];
Vicent Marti committed
377
			h *= m;
378 379 380 381 382 383 384
	};

	h ^= h >> 13;
	h *= m;
	h ^= h >> 15;

	return h;
385
}
386 387 388 389 390 391 392 393 394 395 396 397
#else
/*
	Cross-platform version of Murmurhash3
	http://code.google.com/p/smhasher/wiki/MurmurHash3
	by Austin Appleby (aappleby@gmail.com)

	This code is on the public domain.
*/
uint32_t git__hash(const void *key, int len, uint32_t seed)
{

#define MURMUR_BLOCK() {\
Vicent Marti committed
398 399 400 401 402 403 404
	k1 *= c1; \
	k1 = git__rotl(k1,11);\
	k1 *= c2;\
	h1 ^= k1;\
	h1 = h1*3 + 0x52dce729;\
	c1 = c1*5 + 0x7b7d159c;\
	c2 = c2*5 + 0x6bce6396;\
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
}

	const uint8_t *data = (const uint8_t*)key;
	const int nblocks = len / 4;

	const uint32_t *blocks = (const uint32_t *)(data + nblocks * 4);
	const uint8_t *tail = (const uint8_t *)(data + nblocks * 4);

	uint32_t h1 = 0x971e137b ^ seed;
	uint32_t k1;

	uint32_t c1 = 0x95543787;
	uint32_t c2 = 0x2ad7eb25;

	int i;

	for (i = -nblocks; i; i++) {
		k1 = blocks[i];
		MURMUR_BLOCK();
	}

	k1 = 0;

	switch(len & 3) {
	case 3: k1 ^= tail[2] << 16;
	case 2: k1 ^= tail[1] << 8;
	case 1: k1 ^= tail[0];
			MURMUR_BLOCK();
	}

	h1 ^= len;
	h1 ^= h1 >> 16;
	h1 *= 0x85ebca6b;
	h1 ^= h1 >> 13;
	h1 *= 0xc2b2ae35;
	h1 ^= h1 >> 16;

	return h1;
443
}
444
#endif
445

446 447 448 449 450
/**
 * A modified `bsearch` from the BSD glibc.
 *
 * Copyright (c) 1990 Regents of the University of California.
 * All rights reserved.
451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution.
 * 3. [rescinded 22 July 1999]
 * 4. Neither the name of the University nor the names of its contributors
 * may be used to endorse or promote products derived from this software
 * without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
475
 */
476 477 478 479 480 481
int git__bsearch(
	void **array,
	size_t array_len,
	const void *key,
	int (*compare)(const void *, const void *),
	size_t *position)
482
{
483
	size_t lim;
484
	int cmp = -1;
485 486
	void **part, **base = array;

487
	for (lim = array_len; lim != 0; lim >>= 1) {
488 489 490
		part = base + (lim >> 1);
		cmp = (*compare)(key, *part);
		if (cmp == 0) {
491 492 493 494
			base = part;
			break;
		}
		if (cmp > 0) { /* key > p; take right partition */
495 496 497 498 499
			base = part + 1;
			lim--;
		} /* else take left partition */
	}

500 501
	if (position)
		*position = (base - array);
502

503
	return (cmp == 0) ? 0 : GIT_ENOTFOUND;
504 505 506 507 508 509 510 511 512 513
}

int git__bsearch_r(
	void **array,
	size_t array_len,
	const void *key,
	int (*compare_r)(const void *, const void *, void *),
	void *payload,
	size_t *position)
{
514
	size_t lim;
515 516 517
	int cmp = -1;
	void **part, **base = array;

518
	for (lim = array_len; lim != 0; lim >>= 1) {
519 520 521 522 523 524 525 526 527 528 529 530 531 532
		part = base + (lim >> 1);
		cmp = (*compare_r)(key, *part, payload);
		if (cmp == 0) {
			base = part;
			break;
		}
		if (cmp > 0) { /* key > p; take right partition */
			base = part + 1;
			lim--;
		} /* else take left partition */
	}

	if (position)
		*position = (base - array);
533

534
	return (cmp == 0) ? 0 : GIT_ENOTFOUND;
535 536
}

537 538
/**
 * A strcmp wrapper
539
 *
540 541 542 543 544
 * We don't want direct pointers to the CRT on Windows, we may
 * get stdcall conflicts.
 */
int git__strcmp_cb(const void *a, const void *b)
{
545 546
	return strcmp((const char *)a, (const char *)b);
}
547

548 549 550
int git__strcasecmp_cb(const void *a, const void *b)
{
	return strcasecmp((const char *)a, (const char *)b);
551
}
552 553 554 555

int git__parse_bool(int *out, const char *value)
{
	/* A missing value means true */
556 557
	if (value == NULL ||
		!strcasecmp(value, "true") ||
558 559 560 561 562 563 564
		!strcasecmp(value, "yes") ||
		!strcasecmp(value, "on")) {
		*out = 1;
		return 0;
	}
	if (!strcasecmp(value, "false") ||
		!strcasecmp(value, "no") ||
565 566
		!strcasecmp(value, "off") ||
		value[0] == '\0') {
567 568 569 570 571 572
		*out = 0;
		return 0;
	}

	return -1;
}
573 574 575 576 577

size_t git__unescape(char *str)
{
	char *scan, *pos = str;

578 579 580
	if (!str)
		return 0;

581 582 583 584 585 586 587 588 589 590 591 592 593
	for (scan = str; *scan; pos++, scan++) {
		if (*scan == '\\' && *(scan + 1) != '\0')
			scan++; /* skip '\' but include next char */
		if (pos != scan)
			*pos = *scan;
	}

	if (pos != scan) {
		*pos = '\0';
	}

	return (pos - str);
}
594 595 596

#if defined(GIT_WIN32) || defined(BSD)
typedef struct {
597
	git__sort_r_cmp cmp;
598 599 600 601 602 603 604 605 606 607 608 609
	void *payload;
} git__qsort_r_glue;

static int GIT_STDLIB_CALL git__qsort_r_glue_cmp(
	void *payload, const void *a, const void *b)
{
	git__qsort_r_glue *glue = payload;
	return glue->cmp(a, b, glue->payload);
}
#endif

void git__qsort_r(
610
	void *els, size_t nel, size_t elsize, git__sort_r_cmp cmp, void *payload)
611
{
612 613
#if defined(__MINGW32__) || defined(AMIGA) || \
	defined(__OpenBSD__) || defined(__NetBSD__) || \
614
	defined(__gnu_hurd__) || defined(__ANDROID_API__) || \
615
	defined(__sun) || \
616
	(__GLIBC__ == 2 && __GLIBC_MINOR__ < 8)
617 618
	git__insertsort_r(els, nel, elsize, NULL, cmp, payload);
#elif defined(GIT_WIN32)
619 620
	git__qsort_r_glue glue = { cmp, payload };
	qsort_s(els, nel, elsize, git__qsort_r_glue_cmp, &glue);
621
#elif defined(BSD)
622 623 624 625 626
	git__qsort_r_glue glue = { cmp, payload };
	qsort_r(els, nel, elsize, &glue, git__qsort_r_glue_cmp);
#else
	qsort_r(els, nel, elsize, cmp, payload);
#endif
627 628 629 630 631 632
}

void git__insertsort_r(
	void *els, size_t nel, size_t elsize, void *swapel,
	git__sort_r_cmp cmp, void *payload)
{
633 634
	uint8_t *base = els;
	uint8_t *end = base + nel * elsize;
635 636 637 638 639 640 641 642 643 644 645 646 647 648 649
	uint8_t *i, *j;
	bool freeswap = !swapel;

	if (freeswap)
		swapel = git__malloc(elsize);

	for (i = base + elsize; i < end; i += elsize)
		for (j = i; j > base && cmp(j, j - elsize, payload) < 0; j -= elsize) {
			memcpy(swapel, j, elsize);
			memcpy(j, j - elsize, elsize);
			memcpy(j - elsize, swapel, elsize);
		}

	if (freeswap)
		git__free(swapel);
650
}