Loading...
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 | /* lifo.c */ /* * Copyright (c) 1997-2010, 2013-2014 Wind River Systems, Inc. * * SPDX-License-Identifier: Apache-2.0 */ #include "syskernel.h" struct k_lifo lifo1; struct k_lifo lifo2; static struct k_fifo sync_fifo; /* for synchronization */ /** * * @brief Initialize LIFOs for the test * * @return N/A */ void lifo_test_init(void) { k_lifo_init(&lifo1); k_lifo_init(&lifo2); } /** * * @brief Lifo test thread * * @param par1 Ignored parameter. * @param par2 Number of test loops. * @param par3 unused * * @return N/A */ void lifo_thread1(void *par1, void *par2, void *par3) { int i; intptr_t element_a[2]; intptr_t element_b[2]; intptr_t *pelement; int num_loops = POINTER_TO_INT(par2); ARG_UNUSED(par1); for (i = 0; i < num_loops / 2; i++) { pelement = k_lifo_get(&lifo1, K_FOREVER); if (pelement[1] != 2 * i) { break; } element_a[1] = 2 * i; k_lifo_put(&lifo2, element_a); pelement = k_lifo_get(&lifo1, K_FOREVER); if (pelement[1] != 2 * i + 1) { break; } element_b[1] = 2 * i + 1; k_lifo_put(&lifo2, element_b); } /* wait till it is safe to end: */ k_fifo_get(&sync_fifo, K_FOREVER); } /** * * @brief Lifo test thread * * @param par1 Address of the counter. * @param par2 Number of test cycles. * @param par3 unused * * @return N/A */ void lifo_thread2(void *par1, void *par2, void *par3) { int i; intptr_t element[2]; intptr_t *pelement; int *pcounter = par1; int num_loops = POINTER_TO_INT(par2); for (i = 0; i < num_loops; i++) { element[1] = i; k_lifo_put(&lifo1, element); pelement = k_lifo_get(&lifo2, K_FOREVER); if (pelement[1] != i) { break; } (*pcounter)++; } /* wait till it is safe to end: */ k_fifo_get(&sync_fifo, K_FOREVER); } /** * * @brief Lifo test thread * * @param par1 Address of the counter. * @param par2 Number of test loops. * @param par3 unused * * @return N/A */ void lifo_thread3(void *par1, void *par2, void *par3) { int i; intptr_t element[2]; intptr_t *pelement; int *pcounter = par1; int num_loops = POINTER_TO_INT(par2); for (i = 0; i < num_loops; i++) { element[1] = i; k_lifo_put(&lifo1, element); while ((pelement = k_lifo_get(&lifo2, K_NO_WAIT)) == NULL) { k_yield(); } if (pelement[1] != i) { break; } (*pcounter)++; } /* wait till it is safe to end: */ k_fifo_get(&sync_fifo, K_FOREVER); } /** * * @brief The main test entry * * @return 1 if success and 0 on failure */ int lifo_test(void) { u32_t t; int i = 0; int return_value = 0; intptr_t element[2]; int j; k_fifo_init(&sync_fifo); /* test get/wait & put thread functions between co-op threads */ fprintf(output_file, sz_test_case_fmt, "LIFO #1"); fprintf(output_file, sz_description, "\n\tk_lifo_init" "\n\tk_lifo_get(K_FOREVER)" "\n\tk_lifo_put"); printf(sz_test_start_fmt); lifo_test_init(); t = BENCH_START(); k_thread_create(&thread_data1, thread_stack1, STACK_SIZE, lifo_thread1, NULL, INT_TO_POINTER(number_of_loops), NULL, K_PRIO_COOP(3), 0, K_NO_WAIT); k_thread_create(&thread_data2, thread_stack2, STACK_SIZE, lifo_thread2, &i, INT_TO_POINTER(number_of_loops), NULL, K_PRIO_COOP(3), 0, K_NO_WAIT); t = TIME_STAMP_DELTA_GET(t); return_value += check_result(i, t); /* threads have done their job, they can stop now safely: */ for (j = 0; j < 2; j++) { k_fifo_put(&sync_fifo, element); } /* test get/yield & put thread functions between co-op threads */ fprintf(output_file, sz_test_case_fmt, "LIFO #2"); fprintf(output_file, sz_description, "\n\tk_lifo_init" "\n\tk_lifo_get(K_FOREVER)" "\n\tk_lifo_get(TICKS_NONE)" "\n\tk_lifo_put" "\n\tk_yield"); printf(sz_test_start_fmt); lifo_test_init(); t = BENCH_START(); i = 0; k_thread_create(&thread_data1, thread_stack1, STACK_SIZE, lifo_thread1, NULL, INT_TO_POINTER(number_of_loops), NULL, K_PRIO_COOP(3), 0, K_NO_WAIT); k_thread_create(&thread_data2, thread_stack2, STACK_SIZE, lifo_thread3, &i, INT_TO_POINTER(number_of_loops), NULL, K_PRIO_COOP(3), 0, K_NO_WAIT); t = TIME_STAMP_DELTA_GET(t); return_value += check_result(i, t); /* threads have done their job, they can stop now safely: */ for (j = 0; j < 2; j++) { k_fifo_put(&sync_fifo, element); } /* test get wait & put functions between co-op and premptive threads */ fprintf(output_file, sz_test_case_fmt, "LIFO #3"); fprintf(output_file, sz_description, "\n\tk_lifo_init" "\n\tk_lifo_get(K_FOREVER)" "\n\tk_lifo_put" "\n\tk_lifo_get(K_FOREVER)" "\n\tk_lifo_put"); printf(sz_test_start_fmt); lifo_test_init(); t = BENCH_START(); k_thread_create(&thread_data1, thread_stack1, STACK_SIZE, lifo_thread1, NULL, INT_TO_POINTER(number_of_loops), NULL, K_PRIO_COOP(3), 0, K_NO_WAIT); for (i = 0; i < number_of_loops / 2U; i++) { intptr_t element[2]; intptr_t *pelement; element[1] = 2 * i; k_lifo_put(&lifo1, element); element[1] = 2 * i + 1; k_lifo_put(&lifo1, element); pelement = k_lifo_get(&lifo2, K_FOREVER); if (pelement[1] != 2 * i + 1) { break; } pelement = k_lifo_get(&lifo2, K_FOREVER); if (pelement[1] != 2 * i) { break; } } t = TIME_STAMP_DELTA_GET(t); return_value += check_result(i * 2, t); /* threads have done their job, they can stop now safely: */ for (j = 0; j < 2; j++) { k_fifo_put(&sync_fifo, element); } return return_value; } |