summaryrefslogtreecommitdiff
path: root/url.c
blob: 3e71289eefeb1c1d52a3057e23d8188355a080f6 (plain)
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
/*
 * Copyright 2023, Vincent Douillet <vincent@vdouillet.fr>
 *
 * 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. Neither the name of the copyright holder 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 COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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.
 */

#include <assert.h>
#include <stdarg.h>
#include <string.h>

#include "url.h"

bool
check_request_path(char *path)
{
	char   *p_found;

	if (strlen(path) >= URL_LENGTH_MAX)
		return false;

	p_found = strstr(path, "/..");
	if (p_found != NULL)
		return false;

	p_found = strstr(path, "../");
	return p_found == NULL;
}

size_t
url_build(char *dst, size_t dst_size, int count,...)
{
	va_list path_list;
	const char *path;
	int 	path_index;
	size_t 	w_size;

	dst[0] = '\0';
	w_size = 0;
	va_start(path_list, count);
	for (path_index = 0; path_index < count; path_index++) {
		/* no more space in dst buffer */
		if (w_size >= dst_size)
			break;

		path = va_arg(path_list, char *);

		assert(path != NULL);
		if (path[0] == '\0')
			continue;

		if (path[0] == '.' && path[1] == '\0')
			continue;

		if (path[0] != '/' && dst[w_size - 1] != '/')
			strlcat(dst, "/", dst_size);

		w_size = strlcat(dst, path, dst_size);
	}

	va_end(path_list);
	return w_size;
}