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 | /* * Copyright (c) 2018 Intel Corporation * * SPDX-License-Identifier: Apache-2.0 */ /** * @file * * Dining philosophers demo * * The demo can be configured to use SEMAPHORES or MUTEXES as object types for its * synchronization. To configure a specific object, set the value of FORKS to one * of these. * * By default, the demo uses MUTEXES. * * The demo can be configured to work with threads of the same priority or * not. If using different priorities of preemptible threads; if using one * priority, there will be six preemptible threads of priority normal. * * By default, the demo uses different priorities. * * The number of threads is set via NUM_PHIL. The demo has only been tested * with six threads. In theory it should work with any number of threads, but * not without making changes to the thread attributes and corresponding kernel * object attributes array in the phil_obj_abstract.h * header file. */ #include <kernel.h> #include <cmsis_os.h> #include <zephyr.h> #if defined(CONFIG_STDOUT_CONSOLE) #include <stdio.h> #else #include <sys/printk.h> #endif #include <sys/__assert.h> #include "phil_obj_abstract.h" #define SEMAPHORES 1 #define MUTEXES 2 /**************************************/ /* control the behaviour of the demo **/ #ifndef DEBUG_PRINTF #define DEBUG_PRINTF 0 #endif #ifndef FORKS #define FORKS MUTEXES #if 0 #define FORKS SEMAPHORES #endif #endif #ifndef SAME_PRIO #define SAME_PRIO 0 #endif #ifndef NUM_PHIL #define NUM_PHIL 6 #endif /* end - control behaviour of the demo */ /***************************************/ osSemaphoreId forks[NUM_PHIL]; #define fork(x) (forks[x]) #define STACK_SIZE CONFIG_CMSIS_THREAD_MAX_STACK_SIZE #if DEBUG_PRINTF #define PR_DEBUG printk #else #define PR_DEBUG(...) #endif #include "phil_obj_abstract.h" static void set_phil_state_pos(int id) { #if !DEBUG_PRINTF printk("\x1b[%d;%dH", id + 1, 1); #endif } #include <stdarg.h> static void print_phil_state(int id, const char *fmt, s32_t delay) { int prio = osThreadGetPriority(osThreadGetId()); set_phil_state_pos(id); printk("Philosopher %d [%s:%s%d] ", id, prio < 0 ? "C" : "P", prio < 0 ? "" : " ", prio); if (delay) { printk(fmt, delay < 1000 ? " " : "", delay); } else { printk(fmt, ""); } printk("\n"); } static s32_t get_random_delay(int id, int period_in_ms) { /* * The random delay is unit-less, and is based on the philosopher's ID * and the current uptime to create some pseudo-randomness. It produces * a value between 0 and 31. */ s32_t delay = (k_uptime_get_32() / 100 * (id + 1)) & 0x1f; /* add 1 to not generate a delay of 0 */ s32_t ms = (delay + 1) * period_in_ms; return ms; } static inline int is_last_philosopher(int id) { return id == (NUM_PHIL - 1); } void philosopher(void const *id) { fork_t fork1; fork_t fork2; int my_id = POINTER_TO_INT(id); /* Djkstra's solution: always pick up the lowest numbered fork first */ if (is_last_philosopher(my_id)) { fork1 = fork(0); fork2 = fork(my_id); } else { fork1 = fork(my_id); fork2 = fork(my_id + 1); } while (1) { s32_t delay; print_phil_state(my_id, " STARVING ", 0); take(fork1); print_phil_state(my_id, " HOLDING ONE FORK ", 0); take(fork2); delay = get_random_delay(my_id, 25); print_phil_state(my_id, " EATING [ %s%d ms ] ", delay); osDelay(delay); drop(fork2); print_phil_state(my_id, " DROPPED ONE FORK ", 0); drop(fork1); delay = get_random_delay(my_id, 25); print_phil_state(my_id, " THINKING [ %s%d ms ] ", delay); osDelay(delay); } } osThreadDef(philosopher, osPriorityLow, 6, STACK_SIZE); static int new_prio(int phil) { #if SAME_PRIO return osPriorityNormal; #else return osPriorityLow + phil; #endif } static void start_threads(void) { osThreadId id; for (int i = 0; i < NUM_PHIL; i++) { int prio = new_prio(i); id = osThreadCreate(osThread(philosopher), INT_TO_POINTER(i)); osThreadSetPriority(id, prio); } } #define DEMO_DESCRIPTION \ "\x1b[2J\x1b[15;1H" \ "Demo Description\n" \ "----------------\n" \ "An implementation of a solution to the Dining Philosophers\n" \ "problem (a classic multi-thread synchronization problem) using\n" \ "CMSIS RTOS V1 APIs. This particular implementation demonstrates the\n" \ "usage of multiple preemptible threads of differing\n" \ "priorities, as well as %s and thread sleeping.\n", fork_type_str static void display_demo_description(void) { #if !DEBUG_PRINTF printk(DEMO_DESCRIPTION); #endif } void main(void) { display_demo_description(); start_threads(); } |