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 const int PARAM_NUM = 2;
Dup2Test(void)35 static int Dup2Test(void)
36 {
37 int ret = 0;
38 int number1, number2, sum;
39 int savedStdin = -1;
40 int savedStdout = -1;
41
42 CHAR pathname[JFFS_STANDARD_NAME_LENGTH] = { JFFS_PATH_NAME0 };
43 (void)strcat_s(pathname, JFFS_STANDARD_NAME_LENGTH, "/input.txt");
44
45 int inputFds = open(pathname, O_CREAT | O_RDWR, S_IRWXU);
46 ICUNIT_GOTO_NOT_EQUAL(inputFds, -1, inputFds, EXIT);
47
48 savedStdin = dup(STDIN_FILENO);
49 savedStdout = dup(STDOUT_FILENO);
50
51 setbuf(stdout, NULL);
52 setbuf(stdin, NULL);
53
54 ret = dup2(inputFds, STDIN_FILENO);
55 ICUNIT_GOTO_EQUAL(ret, STDIN_FILENO, ret, EXIT);
56
57 ret = dup2(inputFds, STDOUT_FILENO);
58 ICUNIT_GOTO_EQUAL(ret, STDOUT_FILENO, ret, EXIT);
59
60 /* STDIN_FILENO STDOUT_FILENO all be directed */
61 printf("1 1\n");
62 lseek(inputFds, 0, SEEK_SET);
63 ret = scanf_s("%d %d", &number1, &number2);
64 ICUNIT_GOTO_EQUAL(ret, PARAM_NUM, ret, EXIT);
65
66 sum = number1 + number2;
67
68 EXIT:
69 close(inputFds);
70 dup2(savedStdin, STDIN_FILENO);
71 dup2(savedStdout, STDOUT_FILENO);
72 close(savedStdin);
73 close(savedStdout);
74 unlink(pathname);
75 return sum;
76 }
77
78 const int DUP_TEST_RET = 2;
79
TestCase(VOID)80 static UINT32 TestCase(VOID)
81 {
82 INT32 ret;
83 CHAR pathname1[JFFS_STANDARD_NAME_LENGTH] = { JFFS_PATH_NAME0 };
84
85 ret = mkdir(pathname1, S_IRWXU | S_IRWXG | S_IRWXO);
86 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
87
88 ret = Dup2Test();
89 ICUNIT_GOTO_EQUAL(ret, DUP_TEST_RET, ret, EXIT);
90
91 ret = rmdir(pathname1);
92 ICUNIT_GOTO_EQUAL(ret, 0, ret, EXIT);
93
94 return JFFS_NO_ERROR;
95 EXIT:
96 remove(pathname1);
97 return JFFS_NO_ERROR;
98 }
99
ItFsJffs201(VOID)100 VOID ItFsJffs201(VOID)
101 {
102 TEST_ADD_CASE("IT_FS_JFFS_201", TestCase, TEST_VFS, TEST_JFFS, TEST_LEVEL2, TEST_FUNCTION);
103 }