util.c 17.4 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 GIT_WIN32
14
# include "win32/w32_buffer.h"
15 16
#endif

17
#ifdef _MSC_VER
18 19 20
# include <Shlwapi.h>
#endif

21 22 23
void git_strarray_free(git_strarray *array)
{
	size_t i;
24 25 26 27

	if (array == NULL)
		return;

28
	for (i = 0; i < array->count; ++i)
29
		git__free(array->strings[i]);
30

31
	git__free(array->strings);
32 33

	memset(array, 0, sizeof(*array));
34 35
}

36 37 38 39
int git_strarray_copy(git_strarray *tgt, const git_strarray *src)
{
	size_t i;

Russell Belfer committed
40
	assert(tgt && src);
41 42 43

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

Russell Belfer committed
44
	if (!src->count)
45 46
		return 0;

Russell Belfer committed
47
	tgt->strings = git__calloc(src->count, sizeof(char *));
48 49
	GITERR_CHECK_ALLOC(tgt->strings);

Russell Belfer committed
50 51
	for (i = 0; i < src->count; ++i) {
		if (!src->strings[i])
52
			continue;
53

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

		tgt->count++;
	}

	return 0;
}

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

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

	/*
	 * White space
	 */
82
	while (git__isspace(*p))
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
		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:
132 133 134 135
	if (ndig == 0) {
		giterr_set(GITERR_INVALID, "Failed to convert string to long. Not a number");
		return -1;
	}
136 137 138 139

	if (endptr)
		*endptr = p;

140 141 142 143
	if (ovfl) {
		giterr_set(GITERR_INVALID, "Failed to convert string to long. Overflow error");
		return -1;
	}
144 145

	*result = neg ? -n : n;
146
	return 0;
147 148
}

149
int git__strtol32(int32_t *result, const char *nptr, const char **endptr, int base)
150
{
151
	int error;
152 153
	int32_t tmp_int;
	int64_t tmp_long;
154

155
	if ((error = git__strtol64(&tmp_long, nptr, endptr, base)) < 0)
156 157 158
		return error;

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

	*result = tmp_int;
165

166 167 168
	return error;
}

169 170 171 172 173 174 175 176 177
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)
{
178
	while (*a && *b && git__tolower(*a) == git__tolower(*b))
179
		++a, ++b;
180
	return ((unsigned char)git__tolower(*a) - (unsigned char)git__tolower(*b));
181 182
}

183 184 185 186 187
int git__strcasesort_cmp(const char *a, const char *b)
{
	int cmp = 0;

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

		++a, ++b;
	}

	if (*a || *b)
200
		return (unsigned char)git__tolower(*a) - (unsigned char)git__tolower(*b);
201 202 203 204

	return cmp;
}

205 206 207 208 209 210 211 212 213 214 215
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
216
	int al, bl;
217

Philip Kelley committed
218
	do {
219 220
		al = (unsigned char)git__tolower(*a);
		bl = (unsigned char)git__tolower(*b);
Philip Kelley committed
221 222
		++a, ++b;
	} while (--sz && al && al == bl);
223

Philip Kelley committed
224
	return al - bl;
225 226
}

227
void git__strntolower(char *str, size_t len)
228
{
229
	size_t i;
230 231

	for (i = 0; i < len; ++i) {
232
		str[i] = (char)git__tolower(str[i]);
233 234 235 236 237 238 239 240
	}
}

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

241 242 243
int git__prefixcmp(const char *str, const char *prefix)
{
	for (;;) {
244
		unsigned char p = *(prefix++), s;
245 246 247 248 249 250 251
		if (!p)
			return 0;
		if ((s = *(str++)) != p)
			return s - p;
	}
}

252 253 254 255 256
int git__prefixcmp_icase(const char *str, const char *prefix)
{
	return strncasecmp(str, prefix, strlen(prefix));
}

257 258 259 260 261
int git__prefixncmp_icase(const char *str, size_t str_n, const char *prefix)
{
	int s, p;

	while(str_n--) {
262 263
		s = (unsigned char)git__tolower(*str++);
		p = (unsigned char)git__tolower(*prefix++);
264 265 266 267 268 269 270 271

		if (s != p)
			return s - p;
	}

	return (0 - *prefix);
}

272 273 274 275 276 277 278 279
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);
}
280

281
char *git__strtok(char **end, const char *sep)
282
{
283
	char *ptr = *end;
284

285 286
	while (*ptr && strchr(sep, *ptr))
		++ptr;
287

288 289 290
	if (*ptr) {
		char *start = ptr;
		*end = start + 1;
291

292 293
		while (**end && !strchr(sep, **end))
			++*end;
294

295 296 297 298 299 300 301 302 303
		if (**end) {
			**end = '\0';
			++*end;
		}

		return start;
	}

	return NULL;
304 305
}

306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
/* 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;
}

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
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
355
			printf("	");
356 357 358 359 360 361 362 363 364 365 366 367

		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");
}
368 369 370 371 372 373 374 375 376 377 378 379 380

#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;

381 382 383 384 385
		k *= m;
		k ^= k >> r;
		k *= m;

		h *= m;
386 387 388 389 390
		h ^= k;

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

392 393 394 395
	switch(len) {
	case 3: h ^= data[2] << 16;
	case 2: h ^= data[1] << 8;
	case 1: h ^= data[0];
Vicent Marti committed
396
			h *= m;
397 398 399 400 401 402 403
	};

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

	return h;
404
}
405 406 407 408 409 410 411 412 413 414 415 416
#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
417 418 419 420 421 422 423
	k1 *= c1; \
	k1 = git__rotl(k1,11);\
	k1 *= c2;\
	h1 ^= k1;\
	h1 = h1*3 + 0x52dce729;\
	c1 = c1*5 + 0x7b7d159c;\
	c2 = c2*5 + 0x6bce6396;\
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
}

	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;
462
}
463
#endif
464

465 466 467 468 469
/**
 * A modified `bsearch` from the BSD glibc.
 *
 * Copyright (c) 1990 Regents of the University of California.
 * All rights reserved.
470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493
 * 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.
494
 */
495 496 497 498 499 500
int git__bsearch(
	void **array,
	size_t array_len,
	const void *key,
	int (*compare)(const void *, const void *),
	size_t *position)
501
{
502
	size_t lim;
503
	int cmp = -1;
504 505
	void **part, **base = array;

506
	for (lim = array_len; lim != 0; lim >>= 1) {
507 508 509
		part = base + (lim >> 1);
		cmp = (*compare)(key, *part);
		if (cmp == 0) {
510 511 512 513
			base = part;
			break;
		}
		if (cmp > 0) { /* key > p; take right partition */
514 515 516 517 518
			base = part + 1;
			lim--;
		} /* else take left partition */
	}

519 520
	if (position)
		*position = (base - array);
521

522
	return (cmp == 0) ? 0 : GIT_ENOTFOUND;
523 524 525 526 527 528 529 530 531 532
}

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)
{
533
	size_t lim;
534 535 536
	int cmp = -1;
	void **part, **base = array;

537
	for (lim = array_len; lim != 0; lim >>= 1) {
538 539 540 541 542 543 544 545 546 547 548 549 550 551
		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);
552

553
	return (cmp == 0) ? 0 : GIT_ENOTFOUND;
554 555
}

556 557
/**
 * A strcmp wrapper
558
 *
559 560 561 562 563
 * 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)
{
564 565
	return strcmp((const char *)a, (const char *)b);
}
566

567 568 569
int git__strcasecmp_cb(const void *a, const void *b)
{
	return strcasecmp((const char *)a, (const char *)b);
570
}
571 572 573 574

int git__parse_bool(int *out, const char *value)
{
	/* A missing value means true */
575 576
	if (value == NULL ||
		!strcasecmp(value, "true") ||
577 578 579 580 581 582 583
		!strcasecmp(value, "yes") ||
		!strcasecmp(value, "on")) {
		*out = 1;
		return 0;
	}
	if (!strcasecmp(value, "false") ||
		!strcasecmp(value, "no") ||
584 585
		!strcasecmp(value, "off") ||
		value[0] == '\0') {
586 587 588 589 590 591
		*out = 0;
		return 0;
	}

	return -1;
}
592 593 594 595 596

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

597 598 599
	if (!str)
		return 0;

600 601 602 603 604 605 606 607 608 609 610 611 612
	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);
}
613 614 615

#if defined(GIT_WIN32) || defined(BSD)
typedef struct {
616
	git__sort_r_cmp cmp;
617 618 619 620 621 622 623 624 625 626 627 628
	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(
629
	void *els, size_t nel, size_t elsize, git__sort_r_cmp cmp, void *payload)
630
{
631 632
#if defined(__MINGW32__) || defined(AMIGA) || \
	defined(__OpenBSD__) || defined(__NetBSD__) || \
633
	defined(__gnu_hurd__) || defined(__ANDROID_API__) || \
634
	defined(__sun) || defined(__CYGWIN__) || \
635 636
	(__GLIBC__ == 2 && __GLIBC_MINOR__ < 8) || \
	(defined(_MSC_VER) && _MSC_VER < 1500)
637 638
	git__insertsort_r(els, nel, elsize, NULL, cmp, payload);
#elif defined(GIT_WIN32)
639 640
	git__qsort_r_glue glue = { cmp, payload };
	qsort_s(els, nel, elsize, git__qsort_r_glue_cmp, &glue);
641
#elif defined(BSD)
642 643 644 645 646
	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
647 648 649 650 651 652
}

void git__insertsort_r(
	void *els, size_t nel, size_t elsize, void *swapel,
	git__sort_r_cmp cmp, void *payload)
{
653 654
	uint8_t *base = els;
	uint8_t *end = base + nel * elsize;
655 656 657 658 659 660 661 662 663 664 665 666 667 668 669
	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);
670
}
671

672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696
/*
 * git__utf8_iterate is taken from the utf8proc project,
 * http://www.public-software-group.org/utf8proc
 *
 * Copyright (c) 2009 Public Software Group e. V., Berlin, Germany
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the ""Software""),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771
static const int8_t utf8proc_utf8class[256] = {
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
	2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
	2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
	3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
	4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0
};

int git__utf8_charlen(const uint8_t *str, int str_len)
{
	int length, i;

	length = utf8proc_utf8class[str[0]];
	if (!length)
		return -1;

	if (str_len >= 0 && length > str_len)
		return -str_len;

	for (i = 1; i < length; i++) {
		if ((str[i] & 0xC0) != 0x80)
			return -i;
	}

	return length;
}

int git__utf8_iterate(const uint8_t *str, int str_len, int32_t *dst)
{
	int length;
	int32_t uc = -1;

	*dst = -1;
	length = git__utf8_charlen(str, str_len);
	if (length < 0)
		return -1;

	switch (length) {
		case 1:
			uc = str[0];
			break;
		case 2:
			uc = ((str[0] & 0x1F) <<  6) + (str[1] & 0x3F);
			if (uc < 0x80) uc = -1;
			break;
		case 3:
			uc = ((str[0] & 0x0F) << 12) + ((str[1] & 0x3F) <<  6)
				+ (str[2] & 0x3F);
			if (uc < 0x800 || (uc >= 0xD800 && uc < 0xE000) ||
					(uc >= 0xFDD0 && uc < 0xFDF0)) uc = -1;
			break;
		case 4:
			uc = ((str[0] & 0x07) << 18) + ((str[1] & 0x3F) << 12)
				+ ((str[2] & 0x3F) <<  6) + (str[3] & 0x3F);
			if (uc < 0x10000 || uc >= 0x110000) uc = -1;
			break;
	}

	if (uc < 0 || ((uc & 0xFFFF) >= 0xFFFE))
		return -1;

	*dst = uc;
	return length;
}
772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815

#ifdef GIT_WIN32
int git__getenv(git_buf *out, const char *name)
{
	wchar_t *wide_name = NULL, *wide_value = NULL;
	DWORD value_len;
	int error = -1;

	git_buf_clear(out);

	if (git__utf8_to_16_alloc(&wide_name, name) < 0)
		return -1;

	if ((value_len = GetEnvironmentVariableW(wide_name, NULL, 0)) > 0) {
		wide_value = git__malloc(value_len * sizeof(wchar_t));
		GITERR_CHECK_ALLOC(wide_value);

		value_len = GetEnvironmentVariableW(wide_name, wide_value, value_len);
	}

	if (value_len)
		error = git_buf_put_w(out, wide_value, value_len);
	else if (GetLastError() == ERROR_ENVVAR_NOT_FOUND)
		error = GIT_ENOTFOUND;
	else
		giterr_set(GITERR_OS, "could not read environment variable '%s'", name);

	git__free(wide_name);
	git__free(wide_value);
	return error;
}
#else
int git__getenv(git_buf *out, const char *name)
{
	const char *val = getenv(name);

	git_buf_clear(out);

	if (!val)
		return GIT_ENOTFOUND;

	return git_buf_puts(out, val);
}
#endif