summaryrefslogtreecommitdiff
path: root/test/smp/regression/threadx_byte_memory_thread_contention_test.c
blob: 96573955a5d23ac8a360677aac4699fe02cc165b (plain)
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
/***************************************************************************/
/* Copyright (c) 2024 Microsoft Corporation                                */
/* Copyright (c) 2026 Eclipse ThreadX contributors                         */
/*                                                                         */
/* This program and the accompanying materials are made available under    */
/* the terms of the MIT License which is available at                      */
/* https://opensource.org/licenses/MIT.                                    */
/*                                                                         */
/* SPDX-License-Identifier: MIT                                            */
/***************************************************************************/

/* This test is designed to test contention of two threads on a single
   memory byte pool.  */

#include   <stdio.h>
#include   "tx_api.h"
#include   "threadx_test_port.h"

static unsigned long   thread_0_counter =  0;
static TX_THREAD       thread_0;
static unsigned long   thread_1_counter =  0;
static TX_THREAD       thread_1;
static unsigned long   thread_2_counter =  0;
static TX_THREAD       thread_2;
static unsigned long   initial_pool_size;


static TX_BYTE_POOL   pool_0;


static int test_done;


/* Define thread prototypes.  */

static void    thread_0_entry(ULONG thread_input);
static void    thread_1_entry(ULONG thread_input);
static void    thread_2_entry(ULONG thread_input);


/* Prototype for test control return.  */
void  test_control_return(UINT status);


/* Define what the initial system looks like.  */

#ifdef CTEST
void test_application_define(void *first_unused_memory)
#else
void    threadx_byte_memory_thread_contention_application_define(void *first_unused_memory)
#endif
{

UINT    status;
CHAR    *pointer;


    /* Put first available memory address into a character pointer.  */
    pointer =  (CHAR *) first_unused_memory;

    /* Put system definition stuff in here, e.g. thread creates and other assorted
       create information.  */

    status =  tx_thread_create(&thread_0, "thread 0", thread_0_entry, 1,
            pointer, TEST_STACK_SIZE_PRINTF,
            17, 17, 1, TX_AUTO_START);
    pointer = pointer + TEST_STACK_SIZE_PRINTF;

    /* Check status.  */
    if (status != TX_SUCCESS)
    {

        printf("Running Byte Memory Thread Contention Test.......................... ERROR #1\n");
        test_control_return(1);
    }

    status =  tx_thread_create(&thread_1, "thread 1", thread_1_entry, 1,
            pointer, TEST_STACK_SIZE_PRINTF,
            17, 17, 1, TX_AUTO_START);
    pointer = pointer + TEST_STACK_SIZE_PRINTF;

    /* Check status.  */
    if (status != TX_SUCCESS)
    {

        printf("Running Byte Memory Thread Contention Test.......................... ERROR #2\n");
        test_control_return(1);
    }

    status =  tx_thread_create(&thread_2, "thread 2", thread_2_entry, 2,
            pointer, TEST_STACK_SIZE_PRINTF,
            17, 17, 1, TX_AUTO_START);
    pointer = pointer + TEST_STACK_SIZE_PRINTF;

    /* Check status.  */
    if (status != TX_SUCCESS)
    {

        printf("Running Byte Memory Thread Contention Test.......................... ERROR #3\n");
        test_control_return(1);
    }

    /* Create byte pool 0.  */
    status =  tx_byte_pool_create(&pool_0, "pool 0", pointer, TX_TEST_BYTE_POOL_BYTES(108));
    pointer = pointer + TX_TEST_BYTE_POOL_BYTES(108);

    /* Save off the intial pool size.  */
    initial_pool_size =  pool_0.tx_byte_pool_available;

    /* Check status.  */
    if (status != TX_SUCCESS)
    {

        printf("Running Byte Memory Thread Contention Test.......................... ERROR #4\n");
        test_control_return(1);
    }

    /* Set the test done flag to false.  */
    test_done =  TX_FALSE;
}



/* Define the test threads.  */

static void    thread_0_entry(ULONG thread_input)
{

UINT    status;
CHAR    *pointer;


    /* Inform user.  */
    printf("Running Byte Memory Thread Contention Test.......................... ");

    /* Set time to 0.  */
    tx_time_set(0);

    while(1)
    {
        /* Allocate memory from the pool.  This size will cause merge activity
           because the search pointer will sit in this large block about half
           the time.  */
        status = tx_byte_allocate(&pool_0, (VOID **) &pointer, 60, TX_WAIT_FOREVER);

        /* Check status.  */
        if (status != TX_SUCCESS)
        {

            /* Byte memory error.  */
            printf("ERROR #5\n");
            test_control_return(1);
        }

        /* Fill the memory.  */
        TX_MEMSET(pointer, (CHAR) 0xEF, 60);

        /* Now release the block. */
        status =  tx_byte_release(pointer);

        /* Check for status.  */
        if (status != TX_SUCCESS)
        {

            /* Byte memory error.  */
            printf("ERROR #6\n");
            test_control_return(1);
        }

        /* Check the time.  */
        if (tx_time_get() > 1280)
            break;

        /* Increment the thread counter.  */
        thread_0_counter++;
    }

    /* Set the done flag.  */
    test_done =  TX_TRUE;

    /* Sleep to let the other threads finish up!  */
    tx_thread_sleep(2);

    /* Determine if we all all the original memory and that thread 1
       is in the proper place.  */
    if (pool_0.tx_byte_pool_available != initial_pool_size)
    {

        /* Byte memory error.  */
        printf("ERROR #7\n");
        test_control_return(1);
    }
    else
    {

        /* Successful test.  */
        printf("SUCCESS!\n");
        test_control_return(0);
    }
}


static void    thread_1_entry(ULONG thread_input)
{

UINT    status;
CHAR    *pointer;

    while(test_done == TX_FALSE)
    {
        /* Allocate memory from the pool.  */
        status = tx_byte_allocate(&pool_0, (VOID **) &pointer, 30, TX_WAIT_FOREVER);

        /* Check status.  */
        if (status != TX_SUCCESS)
            return;

        /* Fill the memory.  */
        TX_MEMSET(pointer, (CHAR) 0xEF, 30);

        /* Now release the block. */
        status =  tx_byte_release(pointer);

        /* Check for status.  */
        if (status != TX_SUCCESS)
            return;

        /* Increment the thread counter.  */
        thread_1_counter++;
    }
}


static void    thread_2_entry(ULONG thread_input)
{

UINT    status;
CHAR    *pointer;

    while(test_done == TX_FALSE)
    {
        /* Allocate memory from the pool.  */
        status = tx_byte_allocate(&pool_0, (VOID **) &pointer, 12, TX_WAIT_FOREVER);

        /* Check status.  */
        if (status != TX_SUCCESS)
            return;

        /* Fill the memory.  */
        TX_MEMSET(pointer, (CHAR) 0xEF, 12);

        /* Now release the block. */
        status =  tx_byte_release(pointer);

        /* Check for status.  */
        if (status != TX_SUCCESS)
            return;

        /* Increment the thread counter.  */
        thread_2_counter++;
    }
}