path: root/src/util/posix.c

/*
 * Copyright (C) the libgit2 contributors. All rights reserved.
 *
 * This file is part of libgit2, distributed under the GNU GPL v2 with
 * a Linking Exception. For full terms see the included COPYING file.
 */

#include "posix.h"

#include "fs_path.h"
#include <stdio.h>
#include <ctype.h>

size_t p_fsync__cnt = 0;

#ifndef GIT_WIN32

#ifdef NO_ADDRINFO

int p_getaddrinfo(
	const char *host,
	const char *port,
	struct addrinfo *hints,
	struct addrinfo **info)
{
	struct addrinfo *ainfo, *ai;
	int p = 0;

	GIT_UNUSED(hints);

	if ((ainfo = git__malloc(sizeof(struct addrinfo))) == NULL)
		return -1;

	if ((ainfo->ai_hostent = gethostbyname(host)) == NULL) {
		git__free(ainfo);
		return -2;
	}

	ainfo->ai_servent = getservbyname(port, 0);

	if (ainfo->ai_servent)
		ainfo->ai_port = ainfo->ai_servent->s_port;
	else
		ainfo->ai_port = htons(atol(port));

	memcpy(&ainfo->ai_addr_in.sin_addr,
			ainfo->ai_hostent->h_addr_list[0],
			ainfo->ai_hostent->h_length);

	ainfo->ai_protocol = 0;
	ainfo->ai_socktype = hints->ai_socktype;
	ainfo->ai_family = ainfo->ai_hostent->h_addrtype;
	ainfo->ai_addr_in.sin_family = ainfo->ai_family;
	ainfo->ai_addr_in.sin_port = ainfo->ai_port;
	ainfo->ai_addr = (struct addrinfo *)&ainfo->ai_addr_in;
	ainfo->ai_addrlen = sizeof(struct sockaddr_in);

	*info = ainfo;

	if (ainfo->ai_hostent->h_addr_list[1] == NULL) {
		ainfo->ai_next = NULL;
		return 0;
	}

	ai = ainfo;

	for (p = 1; ainfo->ai_hostent->h_addr_list[p] != NULL; p++) {
		if (!(ai->ai_next = git__malloc(sizeof(struct addrinfo)))) {
			p_freeaddrinfo(ainfo);
			return -1;
		}
		memcpy(ai->ai_next, ainfo, sizeof(struct addrinfo));
		memcpy(&ai->ai_next->ai_addr_in.sin_addr,
			ainfo->ai_hostent->h_addr_list[p],
			ainfo->ai_hostent->h_length);
		ai->ai_next->ai_addr = (struct addrinfo *)&ai->ai_next->ai_addr_in;
		ai = ai->ai_next;
	}

	ai->ai_next = NULL;
	return 0;
}

void p_freeaddrinfo(struct addrinfo *info)
{
	struct addrinfo *p, *next;

	p = info;

	while(p != NULL) {
		next = p->ai_next;
		git__free(p);
		p = next;
	}
}

const char *p_gai_strerror(int ret)
{
	switch(ret) {
	case -1: return "Out of memory"; break;
	case -2: return "Address lookup failed"; break;
	default: return "Unknown error"; break;
	}
}

#endif /* NO_ADDRINFO */

int p_open(const char *path, volatile int flags, ...)
{
	mode_t mode = 0;

	#ifdef GIT_DEBUG_STRICT_OPEN
	if (strstr(path, "//") != NULL) {
		errno = EACCES;
		return -1;
	}
	#endif

	if (flags & O_CREAT) {
		va_list arg_list;

		va_start(arg_list, flags);
		mode = (mode_t)va_arg(arg_list, int);
		va_end(arg_list);
	}

	return open(path, flags | O_BINARY | O_CLOEXEC, mode);
}

int p_creat(const char *path, mode_t mode)
{
	return open(path, O_WRONLY | O_CREAT | O_TRUNC | O_BINARY | O_CLOEXEC, mode);
}

int p_getcwd(char *buffer_out, size_t size)
{
	char *cwd_buffer;

	GIT_ASSERT_ARG(buffer_out);
	GIT_ASSERT_ARG(size > 0);

	cwd_buffer = getcwd(buffer_out, size);

	if (cwd_buffer == NULL)
		return -1;

	git_fs_path_mkposix(buffer_out);
	git_fs_path_string_to_dir(buffer_out, size); /* append trailing slash */

	return 0;
}

int p_rename(const char *from, const char *to)
{
	if (!link(from, to)) {
		p_unlink(from);
		return 0;
	}

	if (!rename(from, to))
		return 0;

	return -1;
}

#endif /* GIT_WIN32 */

ssize_t p_read(git_file fd, void *buf, size_t cnt)
{
	char *b = buf;

	if (!git__is_ssizet(cnt)) {
#ifdef GIT_WIN32
		SetLastError(ERROR_INVALID_PARAMETER);
#endif
		errno = EINVAL;
		return -1;
	}

	while (cnt) {
		ssize_t r;
#ifdef GIT_WIN32
		r = read(fd, b, cnt > INT_MAX ? INT_MAX : (unsigned int)cnt);
#else
		r = read(fd, b, cnt);
#endif
		if (r < 0) {
			if (errno == EINTR || errno == EAGAIN)
				continue;
			return -1;
		}
		if (!r)
			break;
		cnt -= r;
		b += r;
	}
	return (b - (char *)buf);
}

int p_write(git_file fd, const void *buf, size_t cnt)
{
	const char *b = buf;

	while (cnt) {
		ssize_t r;
#ifdef GIT_WIN32
		GIT_ASSERT((size_t)((unsigned int)cnt) == cnt);
		r = write(fd, b, (unsigned int)cnt);
#else
		r = write(fd, b, cnt);
#endif
		if (r < 0) {
			if (errno == EINTR || GIT_ISBLOCKED(errno))
				continue;
			return -1;
		}
		if (!r) {
			errno = EPIPE;
			return -1;
		}
		cnt -= r;
		b += r;
	}
	return 0;
}

#ifdef NO_MMAP

#include "map.h"

int git__page_size(size_t *page_size)
{
	/* dummy; here we don't need any alignment anyway */
	*page_size = 4096;
	return 0;
}

int git__mmap_alignment(size_t *alignment)
{
	/* dummy; here we don't need any alignment anyway */
	*alignment = 4096;
	return 0;
}


int p_mmap(git_map *out, size_t len, int prot, int flags, int fd, off64_t offset)
{
	const char *ptr;
	size_t remaining_len;

	GIT_MMAP_VALIDATE(out, len, prot, flags);

	/* writes cannot be emulated without handling pagefaults since write happens by
	 * writing to mapped memory */
	if (prot & GIT_PROT_WRITE) {
		git_error_set(GIT_ERROR_OS, "trying to map %s-writeable",
				((flags & GIT_MAP_TYPE) == GIT_MAP_SHARED) ? "shared": "private");
		return -1;
	}

	if (!git__is_ssizet(len)) {
		errno = EINVAL;
		return -1;
	}

	out->len = 0;
	out->data = git__malloc(len);
	GIT_ERROR_CHECK_ALLOC(out->data);

	remaining_len = len;
	ptr = (const char *)out->data;
	while (remaining_len > 0) {
		ssize_t nb;
		HANDLE_EINTR(nb, p_pread(fd, (void *)ptr, remaining_len, offset));
		if (nb <= 0) {
			git_error_set(GIT_ERROR_OS, "mmap emulation failed");
			git__free(out->data);
			out->data = NULL;
			return -1;
		}

		ptr += nb;
		offset += nb;
		remaining_len -= nb;
	}

	out->len = len;
	return 0;
}

int p_munmap(git_map *map)
{
	GIT_ASSERT_ARG(map);
	git__free(map->data);

	/* Initializing will help debug use-after-free */
	map->len = 0;
	map->data = NULL;

	return 0;
}

#endif

#if defined(GIT_IO_POLL) || defined(GIT_IO_WSAPOLL)

/* Handled by posix.h; this test simplifies the final else */

#elif defined(GIT_IO_SELECT)

int p_poll(struct pollfd *fds, unsigned int nfds, int timeout_ms)
{
	fd_set read_fds, write_fds, except_fds;
	struct timeval timeout = { 0, 0 };
	unsigned int i;
	int max_fd = -1, ret;

	FD_ZERO(&read_fds);
	FD_ZERO(&write_fds);
	FD_ZERO(&except_fds);

	for (i = 0; i < nfds; i++) {
		if ((fds[i].events & POLLIN))
			FD_SET(fds[i].fd, &read_fds);

		if ((fds[i].events & POLLOUT))
			FD_SET(fds[i].fd, &write_fds);

		if ((fds[i].events & POLLPRI))
			FD_SET(fds[i].fd, &except_fds);

		max_fd = MAX(max_fd, fds[i].fd);
	}

	if (timeout_ms > 0) {
		timeout.tv_sec = timeout_ms / 1000;
		timeout.tv_usec = (timeout_ms % 1000) * 1000;
	}

	if ((ret = select(max_fd + 1, &read_fds, &write_fds, &except_fds,
	                  timeout_ms < 0 ? NULL : &timeout)) < 0)
		goto done;

	for (i = 0; i < nfds; i++) {
		fds[i].revents = 0 |
			FD_ISSET(fds[i].fd, &read_fds) ? POLLIN : 0 |
			FD_ISSET(fds[i].fd, &write_fds) ? POLLOUT : 0 |
			FD_ISSET(fds[i].fd, &except_fds) ? POLLPRI : 0;
	}

done:
	return ret;
}

#else
# error no poll compatible implementation
#endif