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 <src/common/utils.h>
32 int lttng_opt_quiet
= 1;
33 int lttng_opt_verbose
= 3;
35 struct valid_test_input
{
46 struct symlink_test_input
{
48 char *expected_result
;
51 /* Valid test cases */
52 static struct valid_test_input valid_tests_inputs
[] = {
53 { "/a/b/c/d/e", "", "/a/b/c/d/e" },
54 { "./a/b/c/d/e", ".", "/a/b/c/d/e" },
55 { "../a/b/c/d/../e", "..", "/a/b/c/e" },
56 { ".././a/b/c/d/./e", "..", "/a/b/c/d/e" },
57 { "../../a/b/c/d/e", "../..", "/a/b/c/d/e" },
58 { "./a/b/../c/d/../e", ".", "/a/c/e" },
59 { "../a/b/../../c/./d/./e", "..", "/c/d/e" },
60 { "../../a/b/../c/d/../../e", "../..", "/a/e" },
61 { "./a/b/c/d/../../../../e", ".", "/e" },
62 { ".././a/b/c/d/./e", "..", "/a/b/c/d/e" },
65 { "../../", "../..", "/" },
66 { "../..", "../..", "" },
71 { "/../a/b/c/d/e", "", "/a/b/c/d/e" },
72 { "/a/b/c/d/../../../../../e", "", "/e" },
76 char **valid_tests_expected_results
;
77 static const int num_valid_tests
=
78 sizeof(valid_tests_inputs
) / sizeof(valid_tests_inputs
[0]);
80 /* Symlinks test cases */
81 char tree_origin
[] = "/tmp/test_utils_expand_path.XXXXXX";
83 static const char * const tree_dirs
[] = {
89 static const int num_tree_dirs
=
90 sizeof(tree_dirs
) / sizeof(tree_dirs
[0]);
92 static struct tree_symlink tree_symlinks
[] = {
98 { "a/b/c/g", "../../../" },
100 static const int num_tree_symlinks
=
101 sizeof(tree_symlinks
) / sizeof(tree_symlinks
[0]);
103 static struct symlink_test_input symlink_tests_inputs
[] = {
104 { "a/g/../l/.", "a/b/l" },
105 { "a/g/../l/./", "a/b/l/" },
106 { "a/g/../l/..", "a/b" },
107 { "a/g/../l/../", "a/b/" },
110 static const int num_symlink_tests
=
111 sizeof(symlink_tests_inputs
) / sizeof(symlink_tests_inputs
[0]);
113 /* Invalid test cases */
114 static char *invalid_tests_inputs
[] = {
117 static const int num_invalid_tests
=
118 sizeof(invalid_tests_inputs
) / sizeof(invalid_tests_inputs
[0]);
121 char errmsg
[ERRSIZE
];
122 static void printerr(char *msg
)
124 fprintf(stderr
, "test_utils_expand_path: error: %s\n", msg
);
127 int prepare_valid_results()
130 char *relative
, *cur_path
, *prev_path
, *pprev_path
, *empty
;
132 /* Prepare the relative paths */
133 cur_path
= realpath(".", NULL
);
134 prev_path
= realpath("..", NULL
);
135 pprev_path
= realpath("../..", NULL
);
138 /* allocate memory for the expected results */
139 valid_tests_expected_results
= malloc(sizeof(char *) * num_valid_tests
);
140 for (i
= 0; i
< num_valid_tests
; i
++) {
141 valid_tests_expected_results
[i
] = malloc(PATH_MAX
);
142 if (valid_tests_expected_results
[i
] == NULL
) {
143 printerr("malloc expected results");
147 if (strcmp(valid_tests_inputs
[i
].relative_part
, ".") == 0) {
149 } else if (strcmp(valid_tests_inputs
[i
].relative_part
, "..") == 0) {
150 relative
= prev_path
;
151 } else if (strcmp(valid_tests_inputs
[i
].relative_part
, "../..") == 0) {
152 relative
= pprev_path
;
157 snprintf(valid_tests_expected_results
[i
], PATH_MAX
,
158 "%s%s", relative
, valid_tests_inputs
[i
].absolute_part
);
169 int free_valid_results()
173 for (i
= 0; i
< num_valid_tests
; i
++) {
174 free(valid_tests_expected_results
[i
]);
177 free(valid_tests_expected_results
);
182 int prepare_symlink_tree()
185 char tmppath
[PATH_MAX
];
187 /* Create the temporary directory */
188 if (mkdtemp(tree_origin
) == NULL
) {
193 /* Create the directories of the test tree */
194 for (i
= 0; i
< num_tree_dirs
; i
++) {
195 snprintf(tmppath
, PATH_MAX
, "%s/%s", tree_origin
, tree_dirs
[i
]);
197 if (mkdir(tmppath
, 0755) != 0) {
198 snprintf(errmsg
, ERRSIZE
, "mkdir %s", tmppath
);
204 /* Create the symlinks of the test tree */
205 for (i
= 0; i
< num_tree_symlinks
; i
++) {
206 snprintf(tmppath
, PATH_MAX
, "%s/%s",
207 tree_origin
, tree_symlinks
[i
].orig
);
209 if (symlink(tree_symlinks
[i
].dest
, tmppath
) != 0) {
210 snprintf(errmsg
, ERRSIZE
, "symlink %s to %s",
211 tmppath
, tree_symlinks
[i
].dest
);
223 int free_symlink_tree()
226 char tmppath
[PATH_MAX
];
228 /* Remove the symlinks from the test tree */
229 for (i
= num_tree_symlinks
- 1; i
> -1; i
--) {
230 snprintf(tmppath
, PATH_MAX
, "%s/%s",
231 tree_origin
, tree_symlinks
[i
].orig
);
233 if (unlink(tmppath
) != 0) {
234 snprintf(errmsg
, ERRSIZE
, "unlink %s", tmppath
);
240 /* Remove the directories from the test tree */
241 for (i
= num_tree_dirs
- 1; i
> -1; i
--) {
242 snprintf(tmppath
, PATH_MAX
, "%s/%s", tree_origin
, tree_dirs
[i
]);
244 if (rmdir(tmppath
) != 0) {
245 snprintf(errmsg
, ERRSIZE
, "rmdir %s", tmppath
);
251 /* Remove the temporary directory */
252 if (rmdir(tree_origin
) != 0) {
253 snprintf(errmsg
, ERRSIZE
, "rmdir %s", tree_origin
);
264 static void test_utils_expand_path(void)
267 char name
[100], tmppath
[PATH_MAX
];
270 /* Test valid cases */
271 for (i
= 0; i
< num_valid_tests
; i
++) {
272 sprintf(name
, "valid test case: %s", valid_tests_inputs
[i
].input
);
274 result
= utils_expand_path(valid_tests_inputs
[i
].input
);
276 strcmp(result
, valid_tests_expected_results
[i
]) == 0, name
);
281 /* Test symlink tree cases */
282 int treelen
= strlen(tree_origin
) + 1;
283 for (i
= 0; i
< num_symlink_tests
; i
++) {
284 sprintf(name
, "symlink tree test case: [tmppath/]%s",
285 symlink_tests_inputs
[i
].input
);
287 snprintf(tmppath
, PATH_MAX
, "%s/%s",
288 tree_origin
, symlink_tests_inputs
[i
].input
);
289 result
= utils_expand_path(tmppath
);
290 ok(result
!= NULL
&& strcmp(result
+ treelen
,
291 symlink_tests_inputs
[i
].expected_result
) == 0, name
);
296 /* Test invalid cases */
297 for (i
= 0; i
< num_invalid_tests
; i
++) {
298 sprintf(name
, "invalid test case: %s", invalid_tests_inputs
[i
]);
300 result
= utils_expand_path(invalid_tests_inputs
[i
]);
301 if (result
!= NULL
) {
304 ok(result
== NULL
, name
);
308 int main(int argc
, char **argv
)
310 if (prepare_symlink_tree() != 0) {
314 if (prepare_valid_results() != 0) {
318 plan_tests(num_valid_tests
+ num_invalid_tests
+ num_symlink_tests
);
320 diag("utils_expand_path tests");
322 test_utils_expand_path();
324 free_valid_results();
327 return exit_status();
330 free_valid_results();