It_posix_pthread_124.cpp 2.5 KB
Newer Older
L
lnlan 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
/*
 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice, this list of
 * conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
 * of conditions and the following disclaimer in the documentation and/or other materials
 * provided with the distribution.
 *
 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
 * to endorse or promote products derived from this software without specific prior written
 * permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
#include "It_posix_pthread.h"

static VOID *pthread_f01(VOID *num)
{
    intptr_t i = (intptr_t)num;
    printf("Passed argument for thread: %d\n", (int)i);
    ICUNIT_TRACK_EQUAL(g_testCount++, i, g_testCount++);

    pthread_exit(0);

    return NULL;
}

static UINT32 Testcase(VOID)
{
    pthread_t newTh;
    long i;
    INT32 ret = 0;

    g_testCount = 1;

    for (i = 1; i < PTHREAD_THREADS_NUM + 1; i++) {
        ret = pthread_create(&newTh, NULL, pthread_f01, (void *)i);
        ICUNIT_GOTO_EQUAL(ret, PTHREAD_NO_ERROR, ret, EXIT);

        /* Wait for thread to end execution */
        ret = pthread_join(newTh, NULL);
        ICUNIT_GOTO_EQUAL(ret, PTHREAD_NO_ERROR, ret, EXIT);
    }

    return PTHREAD_NO_ERROR;
EXIT:
    pthread_detach(newTh);
    return PTHREAD_NO_ERROR;
}


VOID ItPosixPthread124(VOID)
{
    TEST_ADD_CASE("IT_POSIX_PTHREAD_124", Testcase, TEST_POSIX, TEST_PTHREAD, TEST_LEVEL2, TEST_FUNCTION);
}