• 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 #include "It_posix_pthread.h"
32 
PthreadCleanF01(void * arg)33 static void PthreadCleanF01(void *arg)
34 {
35     if (g_testCount == 1)
36         ICUNIT_ASSERT_EQUAL_VOID((int)arg, 8, (int)arg);
37     if (g_testCount == 2)
38         ICUNIT_ASSERT_EQUAL_VOID((int)arg, 9, (int)arg);
39 
40     g_testCount++;
41 
42     return;
43 }
44 
pthread_f01(void * argument)45 static VOID *pthread_f01(void *argument)
46 {
47     g_testCount++;
48 
49     pthread_cleanup_push(PthreadCleanF01, static_cast<void *>(9)); // 9: arg that routine is called with
50     pthread_cleanup_push(PthreadCleanF01, static_cast<void *>(8)); // 8: arg that routine is called with
51     pthread_exit(static_cast<void *>(8)); // 8: exit value for testing
52     pthread_cleanup_pop(1);
53     pthread_cleanup_pop(1);
54 
55     return static_cast<void *>(9); // 9: return value for testing
56 }
57 
Testcase(VOID)58 static UINT32 Testcase(VOID)
59 {
60     pthread_t newTh;
61 
62     UINT32 ret;
63     UINTPTR uwtemp = 1;
64 
65     g_testCount = 0;
66 
67     ret = pthread_create(&newTh, NULL, pthread_f01, NULL);
68     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
69     LosTaskDelay(1);
70     ICUNIT_ASSERT_EQUAL(g_testCount, 3, g_testCount);
71 
72     ret = pthread_join(newTh, (void **)&uwtemp);
73     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
74     ICUNIT_ASSERT_EQUAL(uwtemp, 8, uwtemp);
75 
76     return PTHREAD_NO_ERROR;
77 }
78 
ItPosixPthread027(VOID)79 VOID ItPosixPthread027(VOID) // IT_Layer_ModuleORFeature_No
80 {
81     TEST_ADD_CASE("IT_POSIX_PTHREAD_027", Testcase, TEST_POSIX, TEST_PTHREAD, TEST_LEVEL2, TEST_FUNCTION);
82 }
83