• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 
34 static constexpr int MAX_FILE_LEN = 10;
35 
Testcase(VOID)36 static UINT32 Testcase(VOID)
37 {
38     INT32 fd[10] = { -1 };
39     INT32 ret, i, len;
40     CHAR pathname1[JFFS_STANDARD_NAME_LENGTH] = { JFFS_PATH_NAME0 };
41     CHAR pathname2[10][JFFS_STANDARD_NAME_LENGTH] = {JFFS_PATH_NAME0};
42     CHAR writebuf[JFFS_STANDARD_NAME_LENGTH] = "0123456789";
43     CHAR readbuf[JFFS_STANDARD_NAME_LENGTH] = "";
44     CHAR bufname[JFFS_SHORT_ARRAY_LENGTH] = "";
45     INT32 randTest1[10] = { 2, 6, 3, 1, 0, 8, 7, 9, 4, 5 };
46     INT32 randTest2[10] = { 5, 3, 1, 6, 7, 2, 4, 9, 0, 8 };
47 
48     ret = mkdir(pathname1, HIGHEST_AUTHORITY);
49     ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT);
50 
51     for (i = 0; i < MAX_FILE_LEN; i++) {
52         memset_s(bufname, JFFS_SHORT_ARRAY_LENGTH, 0, JFFS_SHORT_ARRAY_LENGTH);
53         memset_s(pathname2[i], JFFS_STANDARD_NAME_LENGTH, 0, JFFS_STANDARD_NAME_LENGTH);
54         snprintf_s(bufname, JFFS_SHORT_ARRAY_LENGTH - 1, JFFS_SHORT_ARRAY_LENGTH, "/1071_%d", i);
55         strcat_s(pathname2[i], JFFS_STANDARD_NAME_LENGTH, pathname1);
56         strcat_s(pathname2[i], JFFS_STANDARD_NAME_LENGTH, bufname);
57         fd[i] = open(pathname2[i], O_NONBLOCK | O_CREAT | O_RDWR | O_EXCL, HIGHEST_AUTHORITY);
58         ICUNIT_GOTO_NOT_EQUAL(fd[i], -1, fd[i], EXIT2);
59     }
60     for (i = 0; i < MAX_FILE_LEN; i++) {
61         len = write(fd[randTest1[i]], writebuf, strlen(writebuf));
62         ICUNIT_GOTO_EQUAL(len, strlen(writebuf), len, EXIT2);
63 
64         ret = close(fd[randTest1[i]]);
65         ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT2);
66     }
67 
68     for (i = 0; i < MAX_FILE_LEN; i++) {
69         fd[randTest2[i]] = open(pathname2[randTest2[i]], O_CREAT | O_RDWR, HIGHEST_AUTHORITY);
70         ICUNIT_GOTO_NOT_EQUAL(fd[i], -1, fd[i], EXIT2);
71 
72         len = read(fd[randTest2[i]], readbuf, JFFS_STANDARD_NAME_LENGTH - 1);
73         ICUNIT_GOTO_EQUAL(len, 10, len, EXIT2); // 10 means length of actually read data
74 
75         ret = close(fd[randTest2[i]]);
76         ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT2);
77     }
78 
79     for (i = 0; i < MAX_FILE_LEN; i++) {
80         ret = remove(pathname2[randTest2[i]]);
81         ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT1);
82     }
83 
84     ret = remove(pathname1);
85     ICUNIT_GOTO_EQUAL(ret, JFFS_NO_ERROR, ret, EXIT);
86 
87     return JFFS_NO_ERROR;
88 EXIT2:
89     for (i = 0; i < MAX_FILE_LEN; i++) {
90         close(fd[randTest1[i]]);
91     }
92 EXIT1:
93     for (i = 0; i < MAX_FILE_LEN; i++) {
94         remove(pathname2[randTest2[i]]);
95     }
96 EXIT:
97     remove(pathname1);
98     return JFFS_NO_ERROR;
99 }
100 
ItFsJffs093(VOID)101 VOID ItFsJffs093(VOID)
102 {
103     TEST_ADD_CASE("IT_FS_JFFS_093", Testcase, TEST_VFS, TEST_JFFS, TEST_LEVEL3, TEST_FUNCTION);
104 }
105 
106