1 /*
2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice, this list of
9 * conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 * of conditions and the following disclaimer in the documentation and/or other materials
13 * provided with the distribution.
14 *
15 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
16 * to endorse or promote products derived from this software without specific prior written
17 * permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32 #include "It_vfs_jffs.h"
33
Testcase(VOID)34 static UINT32 Testcase(VOID)
35 {
36 INT32 fd = -1;
37 INT32 ret, i;
38 CHAR pathname1[JFFS_STANDARD_NAME_LENGTH] = { JFFS_PATH_NAME0 };
39 CHAR pathname2[JFFS_STANDARD_NAME_LENGTH][JFFS_STANDARD_NAME_LENGTH] = { JFFS_PATH_NAME0, };
40 CHAR bufname[JFFS_SHORT_ARRAY_LENGTH] = "";
41 DIR *dir = NULL;
42 DIR *dir1[JFFS_STANDARD_NAME_LENGTH] = { NULL, };
43
44 ret = mkdir(pathname1, HIGHEST_AUTHORITY);
45 ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT);
46
47 dir = opendir(pathname1);
48 ICUNIT_GOTO_NOT_EQUAL(dir, NULL, dir, EXIT1);
49
50 for (i = 0; i < JFFS_STANDARD_NAME_LENGTH; i++) {
51 memset_s(bufname, JFFS_SHORT_ARRAY_LENGTH, 0, JFFS_SHORT_ARRAY_LENGTH);
52 memset_s(pathname2[i], JFFS_SHORT_ARRAY_LENGTH, 0, JFFS_SHORT_ARRAY_LENGTH);
53 snprintf_s(bufname, JFFS_SHORT_ARRAY_LENGTH - 1, JFFS_SHORT_ARRAY_LENGTH, "/test%d", i);
54 JffsStrcat2(pathname2[i], bufname, strlen(bufname));
55
56 ret = mkdir(pathname2[i], HIGHEST_AUTHORITY);
57 ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT2);
58 }
59
60 for (i = 0; i < JFFS_STANDARD_NAME_LENGTH; i++) {
61 dir1[i] = opendir(pathname2[i]);
62 ICUNIT_GOTO_NOT_EQUAL(dir1[i], NULL, dir1[i], EXIT3);
63 }
64
65 for (i = 0; i < JFFS_STANDARD_NAME_LENGTH; i++) {
66 ret = closedir(dir1[i]);
67 ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT3);
68 }
69
70 ret = closedir(dir);
71 ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT2);
72
73 for (i = 0; i < JFFS_STANDARD_NAME_LENGTH; i++) {
74 ret = remove(pathname2[i]);
75 ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT2);
76 }
77
78 ret = rmdir(pathname1);
79 ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT);
80
81 return JFFS_NO_ERROR;
82 EXIT3:
83 for (i = 0; i < JFFS_STANDARD_NAME_LENGTH; i++) {
84 closedir(dir1[i]);
85 }
86 EXIT2:
87 for (i = 0; i < JFFS_STANDARD_NAME_LENGTH; i++) {
88 remove(pathname2[i]);
89 }
90 EXIT1:
91 closedir(dir);
92 EXIT:
93 remove(pathname1);
94 return JFFS_NO_ERROR;
95 }
96
ItFsJffs040(VOID)97 VOID ItFsJffs040(VOID)
98 {
99 TEST_ADD_CASE("IT_FS_JFFS_040", Testcase, TEST_VFS, TEST_JFFS, TEST_LEVEL3, TEST_FUNCTION);
100 }
101
102