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 ret, i, j;
37 CHAR pathname[50] = { JFFS_PATH_NAME0 };
38 CHAR pathname1[50] = { JFFS_PATH_NAME0 };
39 CHAR bufname[10] = "";
40 CHAR pathname2[10][50] = { 0 };
41
42 ret = mkdir(pathname, HIGHEST_AUTHORITY);
43 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
44
45 for (i = 0; i < 10; i++) { // 10 means max file num
46 memset_s(bufname, sizeof(bufname), 0, strlen(bufname));
47 snprintf_s(bufname, sizeof(bufname) - 1, sizeof(bufname), "/%d", i);
48 strcat_s(pathname1, sizeof(pathname1), bufname);
49 strcpy_s(pathname2[i], sizeof(pathname2[i]), pathname1);
50
51 ret = mkdir(pathname2[i], HIGHEST_AUTHORITY);
52 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
53 }
54
55 for (i = 0; i < 9; i++) { // 9 means max file num
56 ret = rmdir(pathname2[i]);
57 ICUNIT_GOTO_NOT_EQUAL(ret, 0, ret, EXIT1);
58 }
59 for (i = 9; i >= 0; i--) { // 9 means max file num
60 ret = rmdir(pathname2[i]);
61 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT1);
62 }
63
64 ret = rmdir(JFFS_PATH_NAME0);
65 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
66
67 return JFFS_NO_ERROR;
68 EXIT1:
69 for (i = 9; i >= 0; i--) { // 9 means max file num
70 rmdir(pathname2[i]);
71 }
72 EXIT:
73 rmdir(JFFS_PATH_NAME0);
74 return JFFS_NO_ERROR;
75 }
76
ItFsJffs066(VOID)77 VOID ItFsJffs066(VOID)
78 {
79 TEST_ADD_CASE("IT_FS_JFFS_066", Testcase, TEST_VFS, TEST_JFFS, TEST_LEVEL2, TEST_FUNCTION);
80 }
81
82