• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3  * Copyright (c) 2020-2022 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_test_shm.h"
32 
33 #define SHMID_MAX 192
34 #define SHM_FLAG 0777
35 
Testcase(VOID)36 static int Testcase(VOID)
37 {
38     int shmid[SHMID_MAX + 1] = {-1};
39     int ret;
40     int i;
41     struct shm_info shmInfo;
42     int leftShmIds;
43 
44     ret = shmctl(0, SHM_INFO, reinterpret_cast<struct shmid_ds *>(&shmInfo));
45     ICUNIT_ASSERT_EQUAL(ret, SHMID_MAX, ret);
46     leftShmIds = SHMID_MAX - shmInfo.used_ids;
47 
48     shmid[0] = shmget((key_t)0x1234, PAGE_SIZE, SHM_FLAG | IPC_CREAT); // 0x1234: a key used to create shared memory
49     ICUNIT_ASSERT_NOT_EQUAL(shmid[0], -1, shmid[0]);
50 
51     ret = shmctl(shmid[0], IPC_RMID, NULL);
52     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
53 
54     shmid[0] = shmget(IPC_PRIVATE, PAGE_SIZE, SHM_FLAG | IPC_CREAT);
55     ICUNIT_ASSERT_NOT_EQUAL(shmid[0], -1, shmid[0]);
56 
57     ret = shmctl(shmid[0], IPC_RMID, NULL);
58     ICUNIT_ASSERT_EQUAL(ret, 0, ret);
59 
60     for (i = 0; i < leftShmIds; i++) {
61         shmid[i] = shmget(IPC_PRIVATE, PAGE_SIZE, SHM_FLAG | IPC_CREAT);
62         ICUNIT_ASSERT_NOT_EQUAL(shmid[i], -1, shmid[i]);
63     }
64 
65     shmid[leftShmIds] = shmget(IPC_PRIVATE, PAGE_SIZE, SHM_FLAG | IPC_CREAT);
66     ICUNIT_ASSERT_EQUAL(shmid[leftShmIds], -1, shmid[leftShmIds]);
67 
68     for (i = 0; i < leftShmIds; i++) {
69         ret = shmctl(shmid[i], IPC_RMID, NULL);
70         ICUNIT_ASSERT_EQUAL(ret, 0, ret);
71     }
72 
73     for (i = 0; i < leftShmIds; i++) {
74         ret = shmctl(shmid[i], IPC_RMID, NULL);
75         ICUNIT_ASSERT_EQUAL(ret, -1, ret);
76     }
77 
78     return 0;
79 }
80 
ItTestShm002(void)81 void ItTestShm002(void)
82 {
83     TEST_ADD_CASE("IT_MEM_SHM_002", Testcase, TEST_LOS, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
84 }
85