2 * Copyright (C) - 2013 Raphaƫl Beamonte <raphael.beamonte@gmail.com>
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License as published by as
6 * published by the Free Software Foundation; only version 2 of the License.
8 * This program is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
13 * You should have received a copy of the GNU General Public License along with
14 * this program; if not, write to the Free Software Foundation, Inc., 51
15 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
25 #include <sys/types.h>
29 #include <common/utils.h>
30 #include <common/common.h>
33 int lttng_opt_quiet
= 1;
34 int lttng_opt_verbose
= 3;
37 struct valid_test_input
{
48 struct symlink_test_input
{
50 char *expected_result
;
53 /* Valid test cases */
54 static struct valid_test_input valid_tests_inputs
[] = {
55 { "/a/b/c/d/e", "", "/a/b/c/d/e" },
56 { "./a/b/c/d/e", ".", "/a/b/c/d/e" },
57 { "../a/b/c/d/../e", "..", "/a/b/c/e" },
58 { ".././a/b/c/d/./e", "..", "/a/b/c/d/e" },
59 { "../../a/b/c/d/e", "../..", "/a/b/c/d/e" },
60 { "./a/b/../c/d/../e", ".", "/a/c/e" },
61 { "../a/b/../../c/./d/./e", "..", "/c/d/e" },
62 { "../../a/b/../c/d/../../e", "../..", "/a/e" },
63 { "./a/b/c/d/../../../../e", ".", "/e" },
64 { ".././a/b/c/d/./e", "..", "/a/b/c/d/e" },
67 { "../../", "../..", "/" },
68 { "../..", "../..", "" },
73 { "/../a/b/c/d/e", "", "/a/b/c/d/e" },
74 { "/a/b/c/d/../../../../../e", "", "/e" },
78 char **valid_tests_expected_results
;
79 static const int num_valid_tests
=
80 sizeof(valid_tests_inputs
) / sizeof(valid_tests_inputs
[0]);
82 /* Symlinks test cases */
83 char tree_origin
[] = "/tmp/test_utils_expand_path.XXXXXX";
85 static const char * const tree_dirs
[] = {
91 static const int num_tree_dirs
=
92 sizeof(tree_dirs
) / sizeof(tree_dirs
[0]);
94 static struct tree_symlink tree_symlinks
[] = {
100 { "a/b/c/g", "../../../" },
102 static const int num_tree_symlinks
=
103 sizeof(tree_symlinks
) / sizeof(tree_symlinks
[0]);
105 static struct symlink_test_input symlink_tests_inputs
[] = {
106 { "a/g/../l/.", "a/b/l" },
107 { "a/g/../l/./", "a/b/l/" },
108 { "a/g/../l/..", "a/b" },
109 { "a/g/../l/../", "a/b/" },
112 static const int num_symlink_tests
=
113 sizeof(symlink_tests_inputs
) / sizeof(symlink_tests_inputs
[0]);
115 /* Invalid test cases */
116 static char *invalid_tests_inputs
[] = {
119 static const int num_invalid_tests
=
120 sizeof(invalid_tests_inputs
) / sizeof(invalid_tests_inputs
[0]);
122 #define PRINT_ERR(fmt, args...) \
123 fprintf(stderr, "test_utils_expand_path: error: " fmt "\n", ## args)
125 int prepare_valid_results(void)
128 char *relative
, *cur_path
= NULL
, *prev_path
= NULL
,
129 *pprev_path
= NULL
, *empty
= NULL
;
132 /* Prepare the relative paths */
133 cur_path
= realpath(".", NULL
);
134 prev_path
= realpath("..", NULL
);
135 pprev_path
= realpath("../..", NULL
);
137 if (!cur_path
|| !prev_path
|| !pprev_path
|| !empty
) {
138 PRINT_ERR("strdup out of memory");
143 /* allocate memory for the expected results */
144 valid_tests_expected_results
= zmalloc(sizeof(char *) * num_valid_tests
);
145 if (!valid_tests_expected_results
) {
146 PRINT_ERR("out of memory");
150 for (i
= 0; i
< num_valid_tests
; i
++) {
151 valid_tests_expected_results
[i
] = malloc(PATH_MAX
);
152 if (valid_tests_expected_results
[i
] == NULL
) {
153 PRINT_ERR("malloc expected results");
158 if (strcmp(valid_tests_inputs
[i
].relative_part
, ".") == 0) {
160 } else if (strcmp(valid_tests_inputs
[i
].relative_part
, "..") == 0) {
161 relative
= prev_path
;
162 } else if (strcmp(valid_tests_inputs
[i
].relative_part
, "../..") == 0) {
163 relative
= pprev_path
;
168 snprintf(valid_tests_expected_results
[i
], PATH_MAX
,
169 "%s%s", relative
, valid_tests_inputs
[i
].absolute_part
);
181 int free_valid_results(void)
185 for (i
= 0; i
< num_valid_tests
; i
++) {
186 free(valid_tests_expected_results
[i
]);
189 free(valid_tests_expected_results
);
194 int prepare_symlink_tree(void)
197 char tmppath
[PATH_MAX
] = {};
199 /* Create the temporary directory */
200 if (mkdtemp(tree_origin
) == NULL
) {
201 PRINT_ERR("failed to mkdtemp");
205 /* Create the directories of the test tree */
206 for (i
= 0; i
< num_tree_dirs
; i
++) {
207 snprintf(tmppath
, sizeof(tmppath
), "%s/%s", tree_origin
,
210 if (mkdir(tmppath
, 0755) != 0) {
211 PRINT_ERR("mkdir failed with path \"%s\"", tmppath
);
216 /* Create the symlinks of the test tree */
217 for (i
= 0; i
< num_tree_symlinks
; i
++) {
218 snprintf(tmppath
, sizeof(tmppath
), "%s/%s",
219 tree_origin
, tree_symlinks
[i
].orig
);
221 if (symlink(tree_symlinks
[i
].dest
, tmppath
) != 0) {
222 PRINT_ERR("failed to symlink \"%s\" to \"%s\"", tmppath
,
223 tree_symlinks
[i
].dest
);
234 int free_symlink_tree(void)
237 char tmppath
[PATH_MAX
];
239 /* Remove the symlinks from the test tree */
240 for (i
= num_tree_symlinks
- 1; i
> -1; i
--) {
241 snprintf(tmppath
, PATH_MAX
, "%s/%s",
242 tree_origin
, tree_symlinks
[i
].orig
);
244 if (unlink(tmppath
) != 0) {
245 PRINT_ERR("failed to unlink \"%s\"", tmppath
);
250 /* Remove the directories from the test tree */
251 for (i
= num_tree_dirs
- 1; i
> -1; i
--) {
252 snprintf(tmppath
, PATH_MAX
, "%s/%s", tree_origin
, tree_dirs
[i
]);
254 if (rmdir(tmppath
) != 0) {
255 PRINT_ERR("failed to rmdir \"%s\"", tmppath
);
260 /* Remove the temporary directory */
261 if (rmdir(tree_origin
) != 0) {
262 PRINT_ERR("failed to rmdir \"%s\"", tree_origin
);
272 static void test_utils_expand_path(void)
275 char name
[100], tmppath
[PATH_MAX
], real_tree_origin
[PATH_MAX
];
278 /* Test valid cases */
279 for (i
= 0; i
< num_valid_tests
; i
++) {
280 sprintf(name
, "valid test case: %s", valid_tests_inputs
[i
].input
);
282 result
= utils_expand_path(valid_tests_inputs
[i
].input
);
284 strcmp(result
, valid_tests_expected_results
[i
]) == 0, name
);
290 * Get the realpath for the tree_origin since it can itself be a
293 result
= realpath(tree_origin
, real_tree_origin
);
295 fail("realpath failed.");
299 /* Test symlink tree cases */
300 treelen
= strlen(real_tree_origin
) + 1;
301 for (i
= 0; i
< num_symlink_tests
; i
++) {
304 sprintf(name
, "symlink tree test case: [tmppath/]%s",
305 symlink_tests_inputs
[i
].input
);
307 ret
= snprintf(tmppath
, PATH_MAX
, "%s/%s",
309 symlink_tests_inputs
[i
].input
);
310 if (ret
== -1 || ret
>= PATH_MAX
) {
311 PRINT_ERR("truncation occurred while concatenating paths \"%s\" and \"%s\"",
313 symlink_tests_inputs
[i
].input
);
317 result
= utils_expand_path(tmppath
);
318 ok(result
!= NULL
&& strcmp(result
+ treelen
,
319 symlink_tests_inputs
[i
].expected_result
) == 0, name
);
324 /* Test invalid cases */
325 for (i
= 0; i
< num_invalid_tests
; i
++) {
326 const char *test_input
= invalid_tests_inputs
[i
];
328 sprintf(name
, "invalid test case: %s", test_input
?
329 test_input
: "NULL");
331 result
= utils_expand_path(test_input
);
332 if (result
!= NULL
) {
335 ok(result
== NULL
, name
);
339 int main(int argc
, char **argv
)
341 if (prepare_symlink_tree() != 0) {
345 if (prepare_valid_results() != 0) {
349 plan_tests(num_valid_tests
+ num_invalid_tests
+ num_symlink_tests
);
351 diag("utils_expand_path tests");
353 test_utils_expand_path();
355 free_valid_results();
358 return exit_status();
361 free_valid_results();