util.c 7.94 KB
Newer Older
Vicent Marti committed
1
/*
schu committed
2
 * Copyright (C) 2009-2012 the libgit2 contributors
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 10
#include <stdarg.h>
#include <stdio.h>
11
#include <ctype.h>
12
#include "posix.h"
13

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

18 19 20 21 22 23 24
void git_libgit2_version(int *major, int *minor, int *rev)
{
	*major = LIBGIT2_VER_MAJOR;
	*minor = LIBGIT2_VER_MINOR;
	*rev = LIBGIT2_VER_REVISION;
}

25 26 27 28 29 30
int git_libgit2_capabilities()
{
	return 0
#ifdef GIT_THREADS
		| GIT_CAP_THREADS
#endif
31
#if defined(GIT_SSL) || defined(GIT_WINHTTP)
32 33 34 35 36
		| GIT_CAP_HTTPS
#endif
	;
}

37 38 39 40
void git_strarray_free(git_strarray *array)
{
	size_t i;
	for (i = 0; i < array->count; ++i)
41
		git__free(array->strings[i]);
42

43
	git__free(array->strings);
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
int git_strarray_copy(git_strarray *tgt, const git_strarray *src)
{
	size_t i;

	assert(tgt && src);

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

	if (!src->count)
		return 0;

	tgt->strings = git__calloc(src->count, sizeof(char *));
	GITERR_CHECK_ALLOC(tgt->strings);

	for (i = 0; i < src->count; ++i) {
		tgt->strings[tgt->count] = git__strdup(src->strings[i]);

		if (!tgt->strings[tgt->count]) {
			git_strarray_free(tgt);
			memset(tgt, 0, sizeof(*tgt));
			return -1;
		}

		tgt->count++;
	}

	return 0;
}

75
int git__strtol64(int64_t *result, const char *nptr, const char **endptr, int base)
76 77
{
	const char *p;
78
	int64_t n, nn;
79 80 81 82 83 84 85 86 87 88 89
	int c, ovfl, v, neg, ndig;

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

	/*
	 * White space
	 */
90
	while (git__isspace(*p))
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
		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:
140 141 142 143
	if (ndig == 0) {
		giterr_set(GITERR_INVALID, "Failed to convert string to long. Not a number");
		return -1;
	}
144 145 146 147

	if (endptr)
		*endptr = p;

148 149 150 151
	if (ovfl) {
		giterr_set(GITERR_INVALID, "Failed to convert string to long. Overflow error");
		return -1;
	}
152 153

	*result = neg ? -n : n;
154
	return 0;
155 156
}

157
int git__strtol32(int32_t *result, const char *nptr, const char **endptr, int base)
158
{
159
	int error;
160 161
	int32_t tmp_int;
	int64_t tmp_long;
162

163
	if ((error = git__strtol64(&tmp_long, nptr, endptr, base)) < 0)
164 165 166
		return error;

	tmp_int = tmp_long & 0xFFFFFFFF;
167 168 169 170
	if (tmp_int != tmp_long) {
		giterr_set(GITERR_INVALID, "Failed to convert. '%s' is too large", nptr);
		return -1;
	}
171 172

	*result = tmp_int;
173

174 175 176
	return error;
}

177
void git__strntolower(char *str, size_t len)
178
{
179
	size_t i;
180 181

	for (i = 0; i < len; ++i) {
182
		str[i] = (char) tolower(str[i]);
183 184 185 186 187 188 189 190
	}
}

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

191 192 193
int git__prefixcmp(const char *str, const char *prefix)
{
	for (;;) {
194
		unsigned char p = *(prefix++), s;
195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
		if (!p)
			return 0;
		if ((s = *(str++)) != p)
			return s - p;
	}
}

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);
}
210

211
char *git__strtok(char **end, const char *sep)
212
{
213
	char *ptr = *end;
214

215 216
	while (*ptr && strchr(sep, *ptr))
		++ptr;
217

218 219 220
	if (*ptr) {
		char *start = ptr;
		*end = start + 1;
221

222 223
		while (**end && !strchr(sep, **end))
			++*end;
224

225 226 227 228 229 230 231 232 233
		if (**end) {
			**end = '\0';
			++*end;
		}

		return start;
	}

	return NULL;
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
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
267
			printf("	");
268 269 270 271 272 273 274 275 276 277 278 279

		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");
}
280 281 282 283 284 285 286 287 288 289 290 291 292

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

293 294 295 296 297
		k *= m;
		k ^= k >> r;
		k *= m;

		h *= m;
298 299 300 301 302
		h ^= k;

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

304 305 306 307
	switch(len) {
	case 3: h ^= data[2] << 16;
	case 2: h ^= data[1] << 8;
	case 1: h ^= data[0];
Vicent Marti committed
308
			h *= m;
309 310 311 312 313 314 315
	};

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

	return h;
316
}
317 318 319 320 321 322 323 324 325 326 327 328
#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
329 330 331 332 333 334 335
	k1 *= c1; \
	k1 = git__rotl(k1,11);\
	k1 *= c2;\
	h1 ^= k1;\
	h1 = h1*3 + 0x52dce729;\
	c1 = c1*5 + 0x7b7d159c;\
	c2 = c2*5 + 0x6bce6396;\
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
}

	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;
374
}
375
#endif
376

377 378 379 380 381
/**
 * A modified `bsearch` from the BSD glibc.
 *
 * Copyright (c) 1990 Regents of the University of California.
 * All rights reserved.
382
 */
383 384 385 386 387 388
int git__bsearch(
	void **array,
	size_t array_len,
	const void *key,
	int (*compare)(const void *, const void *),
	size_t *position)
389
{
390 391
	unsigned int lim;
	int cmp = -1;
392 393
	void **part, **base = array;

394
	for (lim = (unsigned int)array_len; lim != 0; lim >>= 1) {
395 396 397
		part = base + (lim >> 1);
		cmp = (*compare)(key, *part);
		if (cmp == 0) {
398 399 400 401
			base = part;
			break;
		}
		if (cmp > 0) { /* key > p; take right partition */
402 403 404 405 406
			base = part + 1;
			lim--;
		} /* else take left partition */
	}

407 408 409 410
	if (position)
		*position = (base - array);

	return (cmp == 0) ? 0 : -1;
411 412
}

413 414 415 416 417 418 419 420 421 422 423 424
/**
 * A strcmp wrapper
 * 
 * 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)
{
	const char *stra = (const char *)a;
	const char *strb = (const char *)b;

	return strcmp(stra, strb);
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

int git__parse_bool(int *out, const char *value)
{
	/* A missing value means true */
	if (value == NULL) {
		*out = 1;
		return 0;
	}

	if (!strcasecmp(value, "true") ||
		!strcasecmp(value, "yes") ||
		!strcasecmp(value, "on")) {
		*out = 1;
		return 0;
	}
	if (!strcasecmp(value, "false") ||
		!strcasecmp(value, "no") ||
		!strcasecmp(value, "off")) {
		*out = 0;
		return 0;
	}

	return -1;
}
450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467

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

	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);
}