[f07e037] | 1 | // |
---|
| 2 | // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo |
---|
| 3 | // |
---|
| 4 | // The contents of this file are covered under the licence agreement in the |
---|
| 5 | // file "LICENCE" distributed with Cforall. |
---|
| 6 | // |
---|
[84c52a8] | 7 | // monitor_desc.c -- |
---|
[f07e037] | 8 | // |
---|
| 9 | // Author : Thierry Delisle |
---|
| 10 | // Created On : Thd Feb 23 12:27:26 2017 |
---|
[6b0b624] | 11 | // Last Modified By : Peter A. Buhr |
---|
[38ef0de] | 12 | // Last Modified On : Mon Jul 31 14:59:05 2017 |
---|
| 13 | // Update Count : 3 |
---|
[f07e037] | 14 | // |
---|
| 15 | |
---|
| 16 | #include "monitor" |
---|
| 17 | |
---|
[a933dcf4] | 18 | #include <stdlib> |
---|
| 19 | |
---|
[5ea06d6] | 20 | #include "libhdr.h" |
---|
[2ac095d] | 21 | #include "kernel_private.h" |
---|
[f07e037] | 22 | |
---|
[0c78741] | 23 | //----------------------------------------------------------------------------- |
---|
| 24 | // Forward declarations |
---|
[daacf82] | 25 | static inline void set_owner ( monitor_desc * this, thread_desc * owner ); |
---|
| 26 | static inline void set_owner ( monitor_desc ** storage, short count, thread_desc * owner ); |
---|
| 27 | static inline void set_mask ( monitor_desc ** storage, short count, const __waitfor_mask_t & mask ); |
---|
| 28 | static inline void reset_mask( monitor_desc * this ); |
---|
[6ff4507] | 29 | |
---|
[0c78741] | 30 | static inline thread_desc * next_thread( monitor_desc * this ); |
---|
[6ae8c92] | 31 | static inline bool is_accepted( monitor_desc * this, const __monitor_group_t & monitors ); |
---|
[0c78741] | 32 | |
---|
| 33 | static inline void lock_all( spinlock ** locks, unsigned short count ); |
---|
| 34 | static inline void lock_all( monitor_desc ** source, spinlock ** /*out*/ locks, unsigned short count ); |
---|
| 35 | static inline void unlock_all( spinlock ** locks, unsigned short count ); |
---|
| 36 | static inline void unlock_all( monitor_desc ** locks, unsigned short count ); |
---|
| 37 | |
---|
[6ff4507] | 38 | static inline void save ( monitor_desc ** ctx, short count, spinlock ** locks, unsigned int * /*out*/ recursions, __waitfor_mask_t * /*out*/ masks ); |
---|
| 39 | static inline void restore( monitor_desc ** ctx, short count, spinlock ** locks, unsigned int * /*in */ recursions, __waitfor_mask_t * /*in */ masks ); |
---|
[0c78741] | 40 | |
---|
[97e3296] | 41 | static inline void init ( int count, monitor_desc ** monitors, __condition_node_t * waiter, __condition_criterion_t * criteria ); |
---|
| 42 | static inline void init_push( int count, monitor_desc ** monitors, __condition_node_t * waiter, __condition_criterion_t * criteria ); |
---|
| 43 | |
---|
[6ff4507] | 44 | static inline thread_desc * check_condition ( __condition_criterion_t * ); |
---|
| 45 | static inline void brand_condition ( condition * ); |
---|
[6ae8c92] | 46 | static inline [thread_desc *, int] search_entry_queue( const __waitfor_mask_t &, monitor_desc ** monitors, int count ); |
---|
[b18830e] | 47 | |
---|
[6ff4507] | 48 | forall(dtype T | sized( T )) |
---|
| 49 | static inline short insert_unique( T ** array, short & size, T * val ); |
---|
| 50 | static inline short count_max ( const __waitfor_mask_t & mask ); |
---|
| 51 | static inline short aggregate ( monitor_desc ** storage, const __waitfor_mask_t & mask ); |
---|
[97e3296] | 52 | |
---|
| 53 | //----------------------------------------------------------------------------- |
---|
| 54 | // Useful defines |
---|
[6ff4507] | 55 | #define wait_ctx(thrd, user_info) /* Create the necessary information to use the signaller stack */ \ |
---|
| 56 | __condition_node_t waiter = { thrd, count, user_info }; /* Create the node specific to this wait operation */ \ |
---|
| 57 | __condition_criterion_t criteria[count]; /* Create the creteria this wait operation needs to wake up */ \ |
---|
| 58 | init( count, monitors, &waiter, criteria ); /* Link everything together */ \ |
---|
| 59 | |
---|
| 60 | #define wait_ctx_primed(thrd, user_info) /* Create the necessary information to use the signaller stack */ \ |
---|
| 61 | __condition_node_t waiter = { thrd, count, user_info }; /* Create the node specific to this wait operation */ \ |
---|
| 62 | __condition_criterion_t criteria[count]; /* Create the creteria this wait operation needs to wake up */ \ |
---|
| 63 | init_push( count, monitors, &waiter, criteria ); /* Link everything together and push it to the AS-Stack */ \ |
---|
| 64 | |
---|
| 65 | #define monitor_ctx( mons, cnt ) /* Define that create the necessary struct for internal/external scheduling operations */ \ |
---|
| 66 | monitor_desc ** monitors = mons; /* Save the targeted monitors */ \ |
---|
| 67 | unsigned short count = cnt; /* Save the count to a local variable */ \ |
---|
| 68 | unsigned int recursions[ count ]; /* Save the current recursion levels to restore them later */ \ |
---|
| 69 | __waitfor_mask_t masks[ count ]; /* Save the current waitfor masks to restore them later */ \ |
---|
| 70 | spinlock * locks [ count ]; /* We need to pass-in an array of locks to BlockInternal */ \ |
---|
| 71 | |
---|
| 72 | #define monitor_save save ( monitors, count, locks, recursions, masks ) |
---|
| 73 | #define monitor_restore restore( monitors, count, locks, recursions, masks ) |
---|
| 74 | |
---|
[97e3296] | 75 | |
---|
[0c78741] | 76 | //----------------------------------------------------------------------------- |
---|
| 77 | // Enter/Leave routines |
---|
[690f13c] | 78 | |
---|
| 79 | |
---|
[cb0e6de] | 80 | extern "C" { |
---|
[97e3296] | 81 | // Enter single monitor |
---|
[a843067] | 82 | static void __enter_monitor_desc( monitor_desc * this, const __monitor_group_t & group ) { |
---|
[97e3296] | 83 | // Lock the monitor spinlock, lock_yield to reduce contention |
---|
[b227f68] | 84 | lock_yield( &this->lock DEBUG_CTX2 ); |
---|
[1c273d0] | 85 | thread_desc * thrd = this_thread; |
---|
[f07e037] | 86 | |
---|
[90c4df0] | 87 | LIB_DEBUG_PRINT_SAFE("Kernel : %10p Entering mon %p (%p)\n", thrd, this, this->owner); |
---|
| 88 | |
---|
[cb0e6de] | 89 | if( !this->owner ) { |
---|
[97e3296] | 90 | // No one has the monitor, just take it |
---|
[cd348e7] | 91 | set_owner( this, thrd ); |
---|
[90c4df0] | 92 | |
---|
| 93 | LIB_DEBUG_PRINT_SAFE("Kernel : mon is free \n"); |
---|
[cb0e6de] | 94 | } |
---|
| 95 | else if( this->owner == thrd) { |
---|
[549c006] | 96 | // We already have the monitor, just note how many times we took it |
---|
[4aa2fb2] | 97 | verify( this->recursion > 0 ); |
---|
[cb0e6de] | 98 | this->recursion += 1; |
---|
[90c4df0] | 99 | |
---|
| 100 | LIB_DEBUG_PRINT_SAFE("Kernel : mon already owned \n"); |
---|
[cb0e6de] | 101 | } |
---|
[6ae8c92] | 102 | else if( is_accepted( this, group) ) { |
---|
[97e3296] | 103 | // Some one was waiting for us, enter |
---|
| 104 | set_owner( this, thrd ); |
---|
[90c4df0] | 105 | |
---|
[daacf82] | 106 | // Reset mask |
---|
| 107 | reset_mask( this ); |
---|
| 108 | |
---|
[90c4df0] | 109 | LIB_DEBUG_PRINT_SAFE("Kernel : mon accepts \n"); |
---|
[97e3296] | 110 | } |
---|
[cb0e6de] | 111 | else { |
---|
[90c4df0] | 112 | LIB_DEBUG_PRINT_SAFE("Kernel : blocking \n"); |
---|
| 113 | |
---|
[97e3296] | 114 | // Some one else has the monitor, wait in line for it |
---|
[cb0e6de] | 115 | append( &this->entry_queue, thrd ); |
---|
[82ff5845] | 116 | BlockInternal( &this->lock ); |
---|
[cc7f4b1] | 117 | |
---|
[90c4df0] | 118 | LIB_DEBUG_PRINT_SAFE("Kernel : %10p Entered mon %p\n", thrd, this); |
---|
| 119 | |
---|
[97e3296] | 120 | // BlockInternal will unlock spinlock, no need to unlock ourselves |
---|
[2ac095d] | 121 | return; |
---|
[cb0e6de] | 122 | } |
---|
[f07e037] | 123 | |
---|
[90c4df0] | 124 | LIB_DEBUG_PRINT_SAFE("Kernel : %10p Entered mon %p\n", thrd, this); |
---|
| 125 | |
---|
[97e3296] | 126 | // Release the lock and leave |
---|
[cb0e6de] | 127 | unlock( &this->lock ); |
---|
[5ea06d6] | 128 | return; |
---|
[cb0e6de] | 129 | } |
---|
[f07e037] | 130 | |
---|
[549c006] | 131 | static void __enter_monitor_dtor( monitor_desc * this, fptr_t func ) { |
---|
| 132 | // Lock the monitor spinlock, lock_yield to reduce contention |
---|
| 133 | lock_yield( &this->lock DEBUG_CTX2 ); |
---|
| 134 | thread_desc * thrd = this_thread; |
---|
| 135 | |
---|
| 136 | LIB_DEBUG_PRINT_SAFE("Kernel : %10p Entering dtor for mon %p (%p)\n", thrd, this, this->owner); |
---|
| 137 | |
---|
| 138 | |
---|
| 139 | if( !this->owner ) { |
---|
| 140 | LIB_DEBUG_PRINT_SAFE("Kernel : Destroying free mon %p\n", this); |
---|
| 141 | |
---|
| 142 | // No one has the monitor, just take it |
---|
| 143 | set_owner( this, thrd ); |
---|
| 144 | |
---|
| 145 | unlock( &this->lock ); |
---|
| 146 | return; |
---|
| 147 | } |
---|
| 148 | else if( this->owner == thrd) { |
---|
| 149 | // We already have the monitor... but where about to destroy it so the nesting will fail |
---|
| 150 | // Abort! |
---|
| 151 | abortf("Attempt to destroy monitor %p by thread \"%.256s\" (%p) in nested mutex."); |
---|
| 152 | } |
---|
| 153 | |
---|
| 154 | int count = 1; |
---|
| 155 | monitor_desc ** monitors = &this; |
---|
| 156 | __monitor_group_t group = { &this, 1, func }; |
---|
| 157 | if( is_accepted( this, group) ) { |
---|
| 158 | LIB_DEBUG_PRINT_SAFE("Kernel : mon accepts dtor, block and signal it \n"); |
---|
| 159 | |
---|
[b8116cd] | 160 | // Wake the thread that is waiting for this |
---|
| 161 | __condition_criterion_t * urgent = pop( &this->signal_stack ); |
---|
| 162 | verify( urgent ); |
---|
| 163 | |
---|
[549c006] | 164 | // Reset mask |
---|
| 165 | reset_mask( this ); |
---|
| 166 | |
---|
| 167 | // Create the node specific to this wait operation |
---|
| 168 | wait_ctx_primed( this_thread, 0 ) |
---|
| 169 | |
---|
| 170 | // Some one else has the monitor, wait for him to finish and then run |
---|
[b8116cd] | 171 | BlockInternal( &this->lock, urgent->owner->waiting_thread ); |
---|
[549c006] | 172 | |
---|
| 173 | // Some one was waiting for us, enter |
---|
| 174 | set_owner( this, thrd ); |
---|
| 175 | } |
---|
| 176 | else { |
---|
| 177 | LIB_DEBUG_PRINT_SAFE("Kernel : blocking \n"); |
---|
| 178 | |
---|
| 179 | wait_ctx( this_thread, 0 ) |
---|
| 180 | this->dtor_node = &waiter; |
---|
| 181 | |
---|
| 182 | // Some one else has the monitor, wait in line for it |
---|
| 183 | append( &this->entry_queue, thrd ); |
---|
| 184 | BlockInternal( &this->lock ); |
---|
| 185 | |
---|
| 186 | // BlockInternal will unlock spinlock, no need to unlock ourselves |
---|
| 187 | return; |
---|
| 188 | } |
---|
| 189 | |
---|
| 190 | LIB_DEBUG_PRINT_SAFE("Kernel : Destroying %p\n", this); |
---|
| 191 | |
---|
| 192 | } |
---|
| 193 | |
---|
[97e3296] | 194 | // Leave single monitor |
---|
[1c273d0] | 195 | void __leave_monitor_desc( monitor_desc * this ) { |
---|
[97e3296] | 196 | // Lock the monitor spinlock, lock_yield to reduce contention |
---|
[b227f68] | 197 | lock_yield( &this->lock DEBUG_CTX2 ); |
---|
[f07e037] | 198 | |
---|
[a843067] | 199 | LIB_DEBUG_PRINT_SAFE("Kernel : %10p Leaving mon %p (%p)\n", this_thread, this, this->owner); |
---|
| 200 | |
---|
| 201 | verifyf( this_thread == this->owner, "Expected owner to be %p, got %p (r: %i, m: %p)", this_thread, this->owner, this->recursion, this ); |
---|
[cc7f4b1] | 202 | |
---|
[97e3296] | 203 | // Leaving a recursion level, decrement the counter |
---|
[cb0e6de] | 204 | this->recursion -= 1; |
---|
[f07e037] | 205 | |
---|
[97e3296] | 206 | // If we haven't left the last level of recursion |
---|
| 207 | // it means we don't need to do anything |
---|
[690f13c] | 208 | if( this->recursion != 0) { |
---|
| 209 | unlock( &this->lock ); |
---|
| 210 | return; |
---|
| 211 | } |
---|
[f07e037] | 212 | |
---|
[97e3296] | 213 | // Get the next thread, will be null on low contention monitor |
---|
[0c78741] | 214 | thread_desc * new_owner = next_thread( this ); |
---|
[5ea06d6] | 215 | |
---|
[97e3296] | 216 | // We can now let other threads in safely |
---|
[cb0e6de] | 217 | unlock( &this->lock ); |
---|
[51f3798] | 218 | |
---|
[690f13c] | 219 | //We need to wake-up the thread |
---|
[1c273d0] | 220 | WakeThread( new_owner ); |
---|
| 221 | } |
---|
| 222 | |
---|
[549c006] | 223 | // Leave single monitor for the last time |
---|
| 224 | void __leave_dtor_monitor_desc( monitor_desc * this ) { |
---|
| 225 | LIB_DEBUG_DO( |
---|
| 226 | if( this_thread != this->owner ) { |
---|
| 227 | abortf("Destroyed monitor %p has inconsistent owner, expected %p got %p.\n", this, this_thread, this->owner); |
---|
| 228 | } |
---|
| 229 | if( this->recursion != 1 ) { |
---|
| 230 | abortf("Destroyed monitor %p has %d outstanding nested calls.\n", this, this->recursion - 1); |
---|
| 231 | } |
---|
| 232 | ) |
---|
| 233 | } |
---|
| 234 | |
---|
[97e3296] | 235 | // Leave the thread monitor |
---|
| 236 | // last routine called by a thread. |
---|
| 237 | // Should never return |
---|
[1c273d0] | 238 | void __leave_thread_monitor( thread_desc * thrd ) { |
---|
[b18830e] | 239 | monitor_desc * this = &thrd->self_mon; |
---|
[97e3296] | 240 | |
---|
| 241 | // Lock the monitor now |
---|
[b227f68] | 242 | lock_yield( &this->lock DEBUG_CTX2 ); |
---|
[1c273d0] | 243 | |
---|
| 244 | disable_interrupts(); |
---|
| 245 | |
---|
[b18830e] | 246 | thrd->self_cor.state = Halted; |
---|
[1c273d0] | 247 | |
---|
[a843067] | 248 | verifyf( thrd == this->owner, "Expected owner to be %p, got %p (r: %i, m: %p)", thrd, this->owner, this->recursion, this ); |
---|
[1c273d0] | 249 | |
---|
[97e3296] | 250 | // Leaving a recursion level, decrement the counter |
---|
[1c273d0] | 251 | this->recursion -= 1; |
---|
| 252 | |
---|
[97e3296] | 253 | // If we haven't left the last level of recursion |
---|
| 254 | // it must mean there is an error |
---|
| 255 | if( this->recursion != 0) { abortf("Thread internal monitor has unbalanced recursion"); } |
---|
[1c273d0] | 256 | |
---|
[97e3296] | 257 | // Fetch the next thread, can be null |
---|
[1c273d0] | 258 | thread_desc * new_owner = next_thread( this ); |
---|
| 259 | |
---|
[97e3296] | 260 | // Leave the thread, this will unlock the spinlock |
---|
| 261 | // Use leave thread instead of BlockInternal which is |
---|
| 262 | // specialized for this case and supports null new_owner |
---|
[f2b12406] | 263 | LeaveThread( &this->lock, new_owner ); |
---|
[97e3296] | 264 | |
---|
| 265 | // Control flow should never reach here! |
---|
[cc7f4b1] | 266 | } |
---|
[2781e65] | 267 | } |
---|
| 268 | |
---|
[97e3296] | 269 | // Enter multiple monitor |
---|
| 270 | // relies on the monitor array being sorted |
---|
[6ae8c92] | 271 | static inline void enter( __monitor_group_t monitors ) { |
---|
[b18830e] | 272 | for(int i = 0; i < monitors.size; i++) { |
---|
[a843067] | 273 | __enter_monitor_desc( monitors.list[i], monitors ); |
---|
[97e3296] | 274 | } |
---|
[2781e65] | 275 | } |
---|
| 276 | |
---|
[97e3296] | 277 | // Leave multiple monitor |
---|
| 278 | // relies on the monitor array being sorted |
---|
[5ea06d6] | 279 | static inline void leave(monitor_desc ** monitors, int count) { |
---|
[0c78741] | 280 | for(int i = count - 1; i >= 0; i--) { |
---|
| 281 | __leave_monitor_desc( monitors[i] ); |
---|
[2781e65] | 282 | } |
---|
[5ea06d6] | 283 | } |
---|
| 284 | |
---|
[97e3296] | 285 | // Ctor for monitor guard |
---|
| 286 | // Sorts monitors before entering |
---|
[549c006] | 287 | void ?{}( monitor_guard_t & this, monitor_desc ** m, int count, fptr_t func ) { |
---|
[97e3296] | 288 | // Store current array |
---|
[242a902] | 289 | this.m = m; |
---|
| 290 | this.count = count; |
---|
[97e3296] | 291 | |
---|
| 292 | // Sort monitors based on address -> TODO use a sort specialized for small numbers |
---|
[242a902] | 293 | qsort(this.m, count); |
---|
[5ea06d6] | 294 | |
---|
[97e3296] | 295 | // Save previous thread context |
---|
[b18830e] | 296 | this.prev_mntrs = this_thread->monitors.list; |
---|
| 297 | this.prev_count = this_thread->monitors.size; |
---|
| 298 | this.prev_func = this_thread->monitors.func; |
---|
[5ea06d6] | 299 | |
---|
[97e3296] | 300 | // Update thread context (needed for conditions) |
---|
[b18830e] | 301 | this_thread->monitors.list = m; |
---|
| 302 | this_thread->monitors.size = count; |
---|
| 303 | this_thread->monitors.func = func; |
---|
[90c4df0] | 304 | |
---|
[19c43b7] | 305 | // LIB_DEBUG_PRINT_SAFE("MGUARD : enter %d\n", count); |
---|
[a843067] | 306 | |
---|
[90c4df0] | 307 | // Enter the monitors in order |
---|
[6ae8c92] | 308 | __monitor_group_t group = {this.m, this.count, func}; |
---|
[b18830e] | 309 | enter( group ); |
---|
[a843067] | 310 | |
---|
[19c43b7] | 311 | // LIB_DEBUG_PRINT_SAFE("MGUARD : entered\n"); |
---|
[5ea06d6] | 312 | } |
---|
| 313 | |
---|
[6b224a52] | 314 | |
---|
[97e3296] | 315 | // Dtor for monitor guard |
---|
[242a902] | 316 | void ^?{}( monitor_guard_t & this ) { |
---|
[19c43b7] | 317 | // LIB_DEBUG_PRINT_SAFE("MGUARD : leaving %d\n", this.count); |
---|
[a843067] | 318 | |
---|
[97e3296] | 319 | // Leave the monitors in order |
---|
[242a902] | 320 | leave( this.m, this.count ); |
---|
[5ea06d6] | 321 | |
---|
[19c43b7] | 322 | // LIB_DEBUG_PRINT_SAFE("MGUARD : left\n"); |
---|
[a843067] | 323 | |
---|
[97e3296] | 324 | // Restore thread context |
---|
[b18830e] | 325 | this_thread->monitors.list = this.prev_mntrs; |
---|
| 326 | this_thread->monitors.size = this.prev_count; |
---|
| 327 | this_thread->monitors.func = this.prev_func; |
---|
[5ea06d6] | 328 | } |
---|
| 329 | |
---|
[549c006] | 330 | |
---|
| 331 | // Ctor for monitor guard |
---|
| 332 | // Sorts monitors before entering |
---|
| 333 | void ?{}( monitor_dtor_guard_t & this, monitor_desc ** m, fptr_t func ) { |
---|
| 334 | // Store current array |
---|
| 335 | this.m = *m; |
---|
| 336 | |
---|
| 337 | // Save previous thread context |
---|
| 338 | this.prev_mntrs = this_thread->monitors.list; |
---|
| 339 | this.prev_count = this_thread->monitors.size; |
---|
| 340 | this.prev_func = this_thread->monitors.func; |
---|
| 341 | |
---|
| 342 | // Update thread context (needed for conditions) |
---|
| 343 | this_thread->monitors.list = m; |
---|
| 344 | this_thread->monitors.size = 1; |
---|
| 345 | this_thread->monitors.func = func; |
---|
| 346 | |
---|
| 347 | __enter_monitor_dtor( this.m, func ); |
---|
| 348 | } |
---|
| 349 | |
---|
| 350 | |
---|
| 351 | // Dtor for monitor guard |
---|
| 352 | void ^?{}( monitor_dtor_guard_t & this ) { |
---|
| 353 | // Leave the monitors in order |
---|
| 354 | __leave_dtor_monitor_desc( this.m ); |
---|
| 355 | |
---|
| 356 | // Restore thread context |
---|
| 357 | this_thread->monitors.list = this.prev_mntrs; |
---|
| 358 | this_thread->monitors.size = this.prev_count; |
---|
| 359 | this_thread->monitors.func = this.prev_func; |
---|
| 360 | } |
---|
| 361 | |
---|
[97e3296] | 362 | //----------------------------------------------------------------------------- |
---|
| 363 | // Internal scheduling types |
---|
[242a902] | 364 | void ?{}(__condition_node_t & this, thread_desc * waiting_thread, unsigned short count, uintptr_t user_info ) { |
---|
| 365 | this.waiting_thread = waiting_thread; |
---|
| 366 | this.count = count; |
---|
| 367 | this.next = NULL; |
---|
| 368 | this.user_info = user_info; |
---|
[be3d020] | 369 | } |
---|
| 370 | |
---|
[242a902] | 371 | void ?{}(__condition_criterion_t & this ) { |
---|
| 372 | this.ready = false; |
---|
| 373 | this.target = NULL; |
---|
| 374 | this.owner = NULL; |
---|
| 375 | this.next = NULL; |
---|
[be3d020] | 376 | } |
---|
| 377 | |
---|
[242a902] | 378 | void ?{}(__condition_criterion_t & this, monitor_desc * target, __condition_node_t * owner ) { |
---|
| 379 | this.ready = false; |
---|
| 380 | this.target = target; |
---|
| 381 | this.owner = owner; |
---|
| 382 | this.next = NULL; |
---|
[ad1a8dd] | 383 | } |
---|
| 384 | |
---|
[5ea06d6] | 385 | //----------------------------------------------------------------------------- |
---|
| 386 | // Internal scheduling |
---|
[be3d020] | 387 | void wait( condition * this, uintptr_t user_info = 0 ) { |
---|
[0c78741] | 388 | brand_condition( this ); |
---|
[5ea06d6] | 389 | |
---|
[97e3296] | 390 | // Check that everything is as expected |
---|
[0c78741] | 391 | assertf( this->monitors != NULL, "Waiting with no monitors (%p)", this->monitors ); |
---|
[4aa2fb2] | 392 | verifyf( this->monitor_count != 0, "Waiting with 0 monitors (%i)", this->monitor_count ); |
---|
| 393 | verifyf( this->monitor_count < 32u, "Excessive monitor count (%i)", this->monitor_count ); |
---|
[5ea06d6] | 394 | |
---|
[97e3296] | 395 | // Create storage for monitor context |
---|
| 396 | monitor_ctx( this->monitors, this->monitor_count ); |
---|
[0c78741] | 397 | |
---|
[97e3296] | 398 | // Create the node specific to this wait operation |
---|
| 399 | wait_ctx( this_thread, user_info ); |
---|
[0c78741] | 400 | |
---|
[97e3296] | 401 | // Append the current wait operation to the ones already queued on the condition |
---|
| 402 | // We don't need locks for that since conditions must always be waited on inside monitor mutual exclusion |
---|
| 403 | append( &this->blocked, &waiter ); |
---|
[0c78741] | 404 | |
---|
[6ff4507] | 405 | // Lock all monitors (aggregates the locks as well) |
---|
[97e3296] | 406 | lock_all( monitors, locks, count ); |
---|
[5ea06d6] | 407 | |
---|
[97e3296] | 408 | // Find the next thread(s) to run |
---|
[6ff4507] | 409 | short thread_count = 0; |
---|
[0c78741] | 410 | thread_desc * threads[ count ]; |
---|
[66298de] | 411 | __builtin_memset( threads, 0, sizeof( threads ) ); |
---|
[ad1a8dd] | 412 | |
---|
[a843067] | 413 | // Save monitor states |
---|
| 414 | monitor_save; |
---|
| 415 | |
---|
[97e3296] | 416 | // Remove any duplicate threads |
---|
[0c78741] | 417 | for( int i = 0; i < count; i++) { |
---|
[97e3296] | 418 | thread_desc * new_owner = next_thread( monitors[i] ); |
---|
[6ff4507] | 419 | insert_unique( threads, thread_count, new_owner ); |
---|
[5ea06d6] | 420 | } |
---|
| 421 | |
---|
[a843067] | 422 | // Everything is ready to go to sleep |
---|
| 423 | BlockInternal( locks, count, threads, thread_count ); |
---|
| 424 | |
---|
| 425 | // We are back, restore the owners and recursions |
---|
| 426 | monitor_restore; |
---|
[5ea06d6] | 427 | } |
---|
| 428 | |
---|
[be3d020] | 429 | bool signal( condition * this ) { |
---|
[97e3296] | 430 | if( is_empty( this ) ) { return false; } |
---|
[5ea06d6] | 431 | |
---|
| 432 | //Check that everything is as expected |
---|
[4aa2fb2] | 433 | verify( this->monitors ); |
---|
| 434 | verify( this->monitor_count != 0 ); |
---|
[0c78741] | 435 | |
---|
[44264c5] | 436 | //Some more checking in debug |
---|
[5ea06d6] | 437 | LIB_DEBUG_DO( |
---|
[1c273d0] | 438 | thread_desc * this_thrd = this_thread; |
---|
[b18830e] | 439 | if ( this->monitor_count != this_thrd->monitors.size ) { |
---|
| 440 | abortf( "Signal on condition %p made with different number of monitor(s), expected %i got %i", this, this->monitor_count, this_thrd->monitors.size ); |
---|
[97e3296] | 441 | } |
---|
[0c78741] | 442 | |
---|
| 443 | for(int i = 0; i < this->monitor_count; i++) { |
---|
[b18830e] | 444 | if ( this->monitors[i] != this_thrd->monitors.list[i] ) { |
---|
| 445 | abortf( "Signal on condition %p made with different monitor, expected %p got %i", this, this->monitors[i], this_thrd->monitors.list[i] ); |
---|
[97e3296] | 446 | } |
---|
[0c78741] | 447 | } |
---|
[5ea06d6] | 448 | ); |
---|
| 449 | |
---|
[97e3296] | 450 | unsigned short count = this->monitor_count; |
---|
| 451 | |
---|
| 452 | // Lock all monitors |
---|
[0c78741] | 453 | lock_all( this->monitors, NULL, count ); |
---|
| 454 | |
---|
[44264c5] | 455 | //Pop the head of the waiting queue |
---|
[0c78741] | 456 | __condition_node_t * node = pop_head( &this->blocked ); |
---|
[44264c5] | 457 | |
---|
| 458 | //Add the thread to the proper AS stack |
---|
[0c78741] | 459 | for(int i = 0; i < count; i++) { |
---|
| 460 | __condition_criterion_t * crit = &node->criteria[i]; |
---|
| 461 | assert( !crit->ready ); |
---|
| 462 | push( &crit->target->signal_stack, crit ); |
---|
[5ea06d6] | 463 | } |
---|
[0c78741] | 464 | |
---|
[44264c5] | 465 | //Release |
---|
[0c78741] | 466 | unlock_all( this->monitors, count ); |
---|
[be3d020] | 467 | |
---|
| 468 | return true; |
---|
[5ea06d6] | 469 | } |
---|
| 470 | |
---|
[be3d020] | 471 | bool signal_block( condition * this ) { |
---|
[97e3296] | 472 | if( !this->blocked.head ) { return false; } |
---|
[44264c5] | 473 | |
---|
| 474 | //Check that everything is as expected |
---|
[4aa2fb2] | 475 | verifyf( this->monitors != NULL, "Waiting with no monitors (%p)", this->monitors ); |
---|
| 476 | verifyf( this->monitor_count != 0, "Waiting with 0 monitors (%i)", this->monitor_count ); |
---|
[44264c5] | 477 | |
---|
[97e3296] | 478 | // Create storage for monitor context |
---|
| 479 | monitor_ctx( this->monitors, this->monitor_count ); |
---|
[44264c5] | 480 | |
---|
[97e3296] | 481 | // Lock all monitors (aggregates the locks them as well) |
---|
| 482 | lock_all( monitors, locks, count ); |
---|
[44264c5] | 483 | |
---|
[97e3296] | 484 | // Create the node specific to this wait operation |
---|
| 485 | wait_ctx_primed( this_thread, 0 ) |
---|
[44264c5] | 486 | |
---|
| 487 | //save contexts |
---|
[6ff4507] | 488 | monitor_save; |
---|
[44264c5] | 489 | |
---|
| 490 | //Find the thread to run |
---|
| 491 | thread_desc * signallee = pop_head( &this->blocked )->waiting_thread; |
---|
[6ff4507] | 492 | set_owner( monitors, count, signallee ); |
---|
[44264c5] | 493 | |
---|
| 494 | //Everything is ready to go to sleep |
---|
[82ff5845] | 495 | BlockInternal( locks, count, &signallee, 1 ); |
---|
[44264c5] | 496 | |
---|
[c81ebf9] | 497 | |
---|
[97e3296] | 498 | // WE WOKE UP |
---|
[c81ebf9] | 499 | |
---|
| 500 | |
---|
[6ff4507] | 501 | //We are back, restore the masks and recursions |
---|
| 502 | monitor_restore; |
---|
[be3d020] | 503 | |
---|
| 504 | return true; |
---|
| 505 | } |
---|
| 506 | |
---|
[97e3296] | 507 | // Access the user_info of the thread waiting at the front of the queue |
---|
[be3d020] | 508 | uintptr_t front( condition * this ) { |
---|
[2ac095d] | 509 | verifyf( !is_empty(this), |
---|
[4aa2fb2] | 510 | "Attempt to access user data on an empty condition.\n" |
---|
| 511 | "Possible cause is not checking if the condition is empty before reading stored data." |
---|
[be3d020] | 512 | ); |
---|
| 513 | return this->blocked.head->user_info; |
---|
[44264c5] | 514 | } |
---|
| 515 | |
---|
[c81ebf9] | 516 | //----------------------------------------------------------------------------- |
---|
[b18830e] | 517 | // External scheduling |
---|
| 518 | // cases to handle : |
---|
| 519 | // - target already there : |
---|
| 520 | // block and wake |
---|
| 521 | // - dtor already there |
---|
| 522 | // put thread on signaller stack |
---|
| 523 | // - non-blocking |
---|
| 524 | // return else |
---|
| 525 | // - timeout |
---|
| 526 | // return timeout |
---|
| 527 | // - block |
---|
| 528 | // setup mask |
---|
| 529 | // block |
---|
[6ae8c92] | 530 | void __waitfor_internal( const __waitfor_mask_t & mask, int duration ) { |
---|
[b18830e] | 531 | // This statment doesn't have a contiguous list of monitors... |
---|
| 532 | // Create one! |
---|
[6ae8c92] | 533 | short max = count_max( mask ); |
---|
[b18830e] | 534 | monitor_desc * mon_storage[max]; |
---|
[66298de] | 535 | __builtin_memset( mon_storage, 0, sizeof( mon_storage ) ); |
---|
[6ae8c92] | 536 | short actual_count = aggregate( mon_storage, mask ); |
---|
[97e3296] | 537 | |
---|
[66298de] | 538 | LIB_DEBUG_PRINT_SAFE("Kernel : waitfor %d (s: %d, m: %d)\n", actual_count, mask.size, (short)max); |
---|
| 539 | |
---|
[daacf82] | 540 | if(actual_count == 0) return; |
---|
[19c43b7] | 541 | |
---|
| 542 | LIB_DEBUG_PRINT_SAFE("Kernel : waitfor internal proceeding\n"); |
---|
[4cc9b13] | 543 | |
---|
[97e3296] | 544 | // Create storage for monitor context |
---|
[b18830e] | 545 | monitor_ctx( mon_storage, actual_count ); |
---|
[c81ebf9] | 546 | |
---|
[6ff4507] | 547 | // Lock all monitors (aggregates the locks as well) |
---|
[97e3296] | 548 | lock_all( monitors, locks, count ); |
---|
[c81ebf9] | 549 | |
---|
[b18830e] | 550 | { |
---|
| 551 | // Check if the entry queue |
---|
[6ae8c92] | 552 | thread_desc * next; int index; |
---|
| 553 | [next, index] = search_entry_queue( mask, monitors, count ); |
---|
[b18830e] | 554 | |
---|
| 555 | if( next ) { |
---|
[19c43b7] | 556 | *mask.accepted = index; |
---|
[6ae8c92] | 557 | if( mask.clauses[index].is_dtor ) { |
---|
[b8116cd] | 558 | LIB_DEBUG_PRINT_SAFE("Kernel : dtor already there\n"); |
---|
[549c006] | 559 | verifyf( mask.clauses[index].size == 1 , "ERROR: Accepted dtor has more than 1 mutex parameter." ); |
---|
| 560 | |
---|
| 561 | monitor_desc * mon2dtor = mask.clauses[index].list[0]; |
---|
| 562 | verifyf( mon2dtor->dtor_node, "ERROR: Accepted monitor has no dtor_node." ); |
---|
| 563 | |
---|
| 564 | __condition_criterion_t * dtor_crit = mon2dtor->dtor_node->criteria; |
---|
| 565 | push( &mon2dtor->signal_stack, dtor_crit ); |
---|
| 566 | |
---|
| 567 | unlock_all( locks, count ); |
---|
[b18830e] | 568 | } |
---|
| 569 | else { |
---|
[19c43b7] | 570 | LIB_DEBUG_PRINT_SAFE("Kernel : thread present, baton-passing\n"); |
---|
| 571 | |
---|
| 572 | // Create the node specific to this wait operation |
---|
| 573 | wait_ctx_primed( this_thread, 0 ); |
---|
| 574 | |
---|
| 575 | // Save monitor states |
---|
| 576 | monitor_save; |
---|
| 577 | |
---|
| 578 | // Set the owners to be the next thread |
---|
| 579 | set_owner( monitors, count, next ); |
---|
| 580 | |
---|
| 581 | // Everything is ready to go to sleep |
---|
| 582 | BlockInternal( locks, count, &next, 1 ); |
---|
| 583 | |
---|
| 584 | // We are back, restore the owners and recursions |
---|
| 585 | monitor_restore; |
---|
| 586 | |
---|
| 587 | LIB_DEBUG_PRINT_SAFE("Kernel : thread present, returned\n"); |
---|
[b18830e] | 588 | } |
---|
| 589 | |
---|
[19c43b7] | 590 | LIB_DEBUG_PRINT_SAFE("Kernel : accepted %d\n", *mask.accepted); |
---|
| 591 | |
---|
| 592 | return; |
---|
[90c4df0] | 593 | } |
---|
| 594 | } |
---|
| 595 | |
---|
[c81ebf9] | 596 | |
---|
[4cc9b13] | 597 | if( duration == 0 ) { |
---|
[19c43b7] | 598 | LIB_DEBUG_PRINT_SAFE("Kernel : non-blocking, exiting\n"); |
---|
| 599 | |
---|
[4cc9b13] | 600 | unlock_all( locks, count ); |
---|
[19c43b7] | 601 | |
---|
| 602 | LIB_DEBUG_PRINT_SAFE("Kernel : accepted %d\n", *mask.accepted); |
---|
[4cc9b13] | 603 | return; |
---|
| 604 | } |
---|
[b18830e] | 605 | |
---|
| 606 | |
---|
| 607 | verifyf( duration < 0, "Timeout on waitfor statments not supported yet."); |
---|
| 608 | |
---|
[19c43b7] | 609 | LIB_DEBUG_PRINT_SAFE("Kernel : blocking waitfor\n"); |
---|
| 610 | |
---|
| 611 | // Create the node specific to this wait operation |
---|
| 612 | wait_ctx_primed( this_thread, 0 ); |
---|
[b18830e] | 613 | |
---|
[6ff4507] | 614 | monitor_save; |
---|
[6ae8c92] | 615 | set_mask( monitors, count, mask ); |
---|
[c81ebf9] | 616 | |
---|
[daacf82] | 617 | for(int i = 0; i < count; i++) { |
---|
| 618 | verify( monitors[i]->owner == this_thread ); |
---|
| 619 | } |
---|
| 620 | |
---|
[19c43b7] | 621 | //Everything is ready to go to sleep |
---|
| 622 | BlockInternal( locks, count ); |
---|
| 623 | |
---|
| 624 | |
---|
| 625 | // WE WOKE UP |
---|
| 626 | |
---|
| 627 | |
---|
| 628 | //We are back, restore the masks and recursions |
---|
| 629 | monitor_restore; |
---|
| 630 | |
---|
| 631 | LIB_DEBUG_PRINT_SAFE("Kernel : exiting\n"); |
---|
| 632 | |
---|
| 633 | LIB_DEBUG_PRINT_SAFE("Kernel : accepted %d\n", *mask.accepted); |
---|
[c81ebf9] | 634 | } |
---|
| 635 | |
---|
[0c78741] | 636 | //----------------------------------------------------------------------------- |
---|
| 637 | // Utilities |
---|
| 638 | |
---|
| 639 | static inline void set_owner( monitor_desc * this, thread_desc * owner ) { |
---|
[19c43b7] | 640 | // LIB_DEBUG_PRINT_SAFE("Kernal : Setting owner of %p to %p ( was %p)\n", this, owner, this->owner ); |
---|
[a843067] | 641 | |
---|
[0c78741] | 642 | //Pass the monitor appropriately |
---|
| 643 | this->owner = owner; |
---|
| 644 | |
---|
| 645 | //We are passing the monitor to someone else, which means recursion level is not 0 |
---|
| 646 | this->recursion = owner ? 1 : 0; |
---|
| 647 | } |
---|
| 648 | |
---|
[6ff4507] | 649 | static inline void set_owner( monitor_desc ** monitors, short count, thread_desc * owner ) { |
---|
| 650 | for( int i = 0; i < count; i++ ) { |
---|
| 651 | set_owner( monitors[i], owner ); |
---|
| 652 | } |
---|
| 653 | } |
---|
| 654 | |
---|
| 655 | static inline void set_mask( monitor_desc ** storage, short count, const __waitfor_mask_t & mask ) { |
---|
| 656 | for(int i = 0; i < count; i++) { |
---|
| 657 | storage[i]->mask = mask; |
---|
| 658 | } |
---|
| 659 | } |
---|
| 660 | |
---|
[daacf82] | 661 | static inline void reset_mask( monitor_desc * this ) { |
---|
| 662 | this->mask.accepted = NULL; |
---|
| 663 | this->mask.clauses = NULL; |
---|
| 664 | this->mask.size = 0; |
---|
| 665 | } |
---|
| 666 | |
---|
[0c78741] | 667 | static inline thread_desc * next_thread( monitor_desc * this ) { |
---|
| 668 | //Check the signaller stack |
---|
| 669 | __condition_criterion_t * urgent = pop( &this->signal_stack ); |
---|
| 670 | if( urgent ) { |
---|
| 671 | //The signaller stack is not empty, |
---|
| 672 | //regardless of if we are ready to baton pass, |
---|
| 673 | //we need to set the monitor as in use |
---|
| 674 | set_owner( this, urgent->owner->waiting_thread ); |
---|
| 675 | |
---|
| 676 | return check_condition( urgent ); |
---|
| 677 | } |
---|
| 678 | |
---|
| 679 | // No signaller thread |
---|
| 680 | // Get the next thread in the entry_queue |
---|
| 681 | thread_desc * new_owner = pop_head( &this->entry_queue ); |
---|
| 682 | set_owner( this, new_owner ); |
---|
| 683 | |
---|
| 684 | return new_owner; |
---|
| 685 | } |
---|
| 686 | |
---|
[6ff4507] | 687 | static inline bool is_accepted( monitor_desc * this, const __monitor_group_t & group ) { |
---|
| 688 | __acceptable_t * it = this->mask.clauses; // Optim |
---|
| 689 | int count = this->mask.size; |
---|
| 690 | |
---|
| 691 | // Check if there are any acceptable functions |
---|
[a843067] | 692 | if( !it ) return false; |
---|
[6ff4507] | 693 | |
---|
| 694 | // If this isn't the first monitor to test this, there is no reason to repeat the test. |
---|
| 695 | if( this != group[0] ) return group[0]->mask.accepted >= 0; |
---|
| 696 | |
---|
| 697 | // For all acceptable functions check if this is the current function. |
---|
| 698 | for( short i = 0; i < count; i++, it++ ) { |
---|
| 699 | if( *it == group ) { |
---|
| 700 | *this->mask.accepted = i; |
---|
| 701 | return true; |
---|
| 702 | } |
---|
| 703 | } |
---|
| 704 | |
---|
| 705 | // No function matched |
---|
| 706 | return false; |
---|
| 707 | } |
---|
| 708 | |
---|
[97e3296] | 709 | static inline void init( int count, monitor_desc ** monitors, __condition_node_t * waiter, __condition_criterion_t * criteria ) { |
---|
| 710 | for(int i = 0; i < count; i++) { |
---|
[6b224a52] | 711 | (criteria[i]){ monitors[i], waiter }; |
---|
[97e3296] | 712 | } |
---|
| 713 | |
---|
| 714 | waiter->criteria = criteria; |
---|
| 715 | } |
---|
| 716 | |
---|
| 717 | static inline void init_push( int count, monitor_desc ** monitors, __condition_node_t * waiter, __condition_criterion_t * criteria ) { |
---|
| 718 | for(int i = 0; i < count; i++) { |
---|
[6b224a52] | 719 | (criteria[i]){ monitors[i], waiter }; |
---|
[97e3296] | 720 | push( &criteria[i].target->signal_stack, &criteria[i] ); |
---|
| 721 | } |
---|
| 722 | |
---|
| 723 | waiter->criteria = criteria; |
---|
| 724 | } |
---|
| 725 | |
---|
[0c78741] | 726 | static inline void lock_all( spinlock ** locks, unsigned short count ) { |
---|
| 727 | for( int i = 0; i < count; i++ ) { |
---|
[b227f68] | 728 | lock_yield( locks[i] DEBUG_CTX2 ); |
---|
[0c78741] | 729 | } |
---|
| 730 | } |
---|
| 731 | |
---|
| 732 | static inline void lock_all( monitor_desc ** source, spinlock ** /*out*/ locks, unsigned short count ) { |
---|
| 733 | for( int i = 0; i < count; i++ ) { |
---|
| 734 | spinlock * l = &source[i]->lock; |
---|
[b227f68] | 735 | lock_yield( l DEBUG_CTX2 ); |
---|
[0c78741] | 736 | if(locks) locks[i] = l; |
---|
| 737 | } |
---|
| 738 | } |
---|
| 739 | |
---|
| 740 | static inline void unlock_all( spinlock ** locks, unsigned short count ) { |
---|
| 741 | for( int i = 0; i < count; i++ ) { |
---|
| 742 | unlock( locks[i] ); |
---|
| 743 | } |
---|
| 744 | } |
---|
| 745 | |
---|
| 746 | static inline void unlock_all( monitor_desc ** locks, unsigned short count ) { |
---|
| 747 | for( int i = 0; i < count; i++ ) { |
---|
| 748 | unlock( &locks[i]->lock ); |
---|
| 749 | } |
---|
| 750 | } |
---|
| 751 | |
---|
[daacf82] | 752 | static inline void save( monitor_desc ** ctx, short count, __attribute((unused)) spinlock ** locks, unsigned int * /*out*/ recursions, __waitfor_mask_t * /*out*/ masks ) { |
---|
[0c78741] | 753 | for( int i = 0; i < count; i++ ) { |
---|
| 754 | recursions[i] = ctx[i]->recursion; |
---|
[6ff4507] | 755 | masks[i] = ctx[i]->mask; |
---|
[0c78741] | 756 | } |
---|
| 757 | } |
---|
| 758 | |
---|
[6ff4507] | 759 | static inline void restore( monitor_desc ** ctx, short count, spinlock ** locks, unsigned int * /*out*/ recursions, __waitfor_mask_t * /*out*/ masks ) { |
---|
| 760 | lock_all( locks, count ); |
---|
[0c78741] | 761 | for( int i = 0; i < count; i++ ) { |
---|
| 762 | ctx[i]->recursion = recursions[i]; |
---|
[6ff4507] | 763 | ctx[i]->mask = masks[i]; |
---|
[0c78741] | 764 | } |
---|
[6ff4507] | 765 | unlock_all( locks, count ); |
---|
[0c78741] | 766 | } |
---|
| 767 | |
---|
| 768 | // Function has 2 different behavior |
---|
| 769 | // 1 - Marks a monitors as being ready to run |
---|
| 770 | // 2 - Checks if all the monitors are ready to run |
---|
| 771 | // if so return the thread to run |
---|
| 772 | static inline thread_desc * check_condition( __condition_criterion_t * target ) { |
---|
| 773 | __condition_node_t * node = target->owner; |
---|
| 774 | unsigned short count = node->count; |
---|
| 775 | __condition_criterion_t * criteria = node->criteria; |
---|
| 776 | |
---|
| 777 | bool ready2run = true; |
---|
| 778 | |
---|
| 779 | for( int i = 0; i < count; i++ ) { |
---|
[44264c5] | 780 | |
---|
[b227f68] | 781 | // LIB_DEBUG_PRINT_SAFE( "Checking %p for %p\n", &criteria[i], target ); |
---|
[0c78741] | 782 | if( &criteria[i] == target ) { |
---|
| 783 | criteria[i].ready = true; |
---|
[b227f68] | 784 | // LIB_DEBUG_PRINT_SAFE( "True\n" ); |
---|
[0c78741] | 785 | } |
---|
| 786 | |
---|
| 787 | ready2run = criteria[i].ready && ready2run; |
---|
| 788 | } |
---|
| 789 | |
---|
[b227f68] | 790 | // LIB_DEBUG_PRINT_SAFE( "Runing %i\n", ready2run ); |
---|
[0c78741] | 791 | return ready2run ? node->waiting_thread : NULL; |
---|
| 792 | } |
---|
| 793 | |
---|
| 794 | static inline void brand_condition( condition * this ) { |
---|
[1c273d0] | 795 | thread_desc * thrd = this_thread; |
---|
[0c78741] | 796 | if( !this->monitors ) { |
---|
[b227f68] | 797 | // LIB_DEBUG_PRINT_SAFE("Branding\n"); |
---|
[b18830e] | 798 | assertf( thrd->monitors.list != NULL, "No current monitor to brand condition %p", thrd->monitors.list ); |
---|
| 799 | this->monitor_count = thrd->monitors.size; |
---|
[a933dcf4] | 800 | |
---|
| 801 | this->monitors = malloc( this->monitor_count * sizeof( *this->monitors ) ); |
---|
| 802 | for( int i = 0; i < this->monitor_count; i++ ) { |
---|
[b18830e] | 803 | this->monitors[i] = thrd->monitors.list[i]; |
---|
[a933dcf4] | 804 | } |
---|
[0c78741] | 805 | } |
---|
| 806 | } |
---|
| 807 | |
---|
[6ae8c92] | 808 | static inline [thread_desc *, int] search_entry_queue( const __waitfor_mask_t & mask, monitor_desc ** monitors, int count ) { |
---|
[90c4df0] | 809 | |
---|
| 810 | __thread_queue_t * entry_queue = &monitors[0]->entry_queue; |
---|
| 811 | |
---|
| 812 | // For each thread in the entry-queue |
---|
| 813 | for( thread_desc ** thrd_it = &entry_queue->head; |
---|
| 814 | *thrd_it; |
---|
[4cc9b13] | 815 | thrd_it = &(*thrd_it)->next |
---|
| 816 | ) { |
---|
[90c4df0] | 817 | // For each acceptable check if it matches |
---|
[4cc9b13] | 818 | int i = 0; |
---|
[6ae8c92] | 819 | __acceptable_t * end = mask.clauses + mask.size; |
---|
| 820 | for( __acceptable_t * it = mask.clauses; it != end; it++, i++ ) { |
---|
[90c4df0] | 821 | // Check if we have a match |
---|
[aaa4f93] | 822 | if( *it == (*thrd_it)->monitors ) { |
---|
[90c4df0] | 823 | |
---|
| 824 | // If we have a match return it |
---|
| 825 | // after removeing it from the entry queue |
---|
[b18830e] | 826 | return [remove( entry_queue, thrd_it ), i]; |
---|
[90c4df0] | 827 | } |
---|
| 828 | } |
---|
| 829 | } |
---|
| 830 | |
---|
[b18830e] | 831 | return [0, -1]; |
---|
| 832 | } |
---|
| 833 | |
---|
[6ff4507] | 834 | forall(dtype T | sized( T )) |
---|
| 835 | static inline short insert_unique( T ** array, short & size, T * val ) { |
---|
| 836 | if( !val ) return size; |
---|
| 837 | |
---|
| 838 | for(int i = 0; i <= size; i++) { |
---|
| 839 | if( array[i] == val ) return size; |
---|
| 840 | } |
---|
| 841 | |
---|
| 842 | array[size] = val; |
---|
| 843 | size = size + 1; |
---|
| 844 | return size; |
---|
| 845 | } |
---|
| 846 | |
---|
[6ae8c92] | 847 | static inline short count_max( const __waitfor_mask_t & mask ) { |
---|
[b18830e] | 848 | short max = 0; |
---|
[6ae8c92] | 849 | for( int i = 0; i < mask.size; i++ ) { |
---|
[aaa4f93] | 850 | max += mask.clauses[i].size; |
---|
[b18830e] | 851 | } |
---|
| 852 | return max; |
---|
[97e3296] | 853 | } |
---|
[b18830e] | 854 | |
---|
[6ae8c92] | 855 | static inline short aggregate( monitor_desc ** storage, const __waitfor_mask_t & mask ) { |
---|
[6ff4507] | 856 | short size = 0; |
---|
| 857 | for( int i = 0; i < mask.size; i++ ) { |
---|
| 858 | for( int j = 0; j < mask.clauses[i].size; j++) { |
---|
| 859 | insert_unique( storage, size, mask.clauses[i].list[j] ); |
---|
| 860 | } |
---|
[b18830e] | 861 | } |
---|
[6ff4507] | 862 | qsort( storage, size ); |
---|
| 863 | return size; |
---|
[b18830e] | 864 | } |
---|
| 865 | |
---|
[242a902] | 866 | void ?{}( __condition_blocked_queue_t & this ) { |
---|
| 867 | this.head = NULL; |
---|
| 868 | this.tail = &this.head; |
---|
[0c78741] | 869 | } |
---|
| 870 | |
---|
| 871 | void append( __condition_blocked_queue_t * this, __condition_node_t * c ) { |
---|
[4aa2fb2] | 872 | verify(this->tail != NULL); |
---|
[0c78741] | 873 | *this->tail = c; |
---|
| 874 | this->tail = &c->next; |
---|
| 875 | } |
---|
| 876 | |
---|
| 877 | __condition_node_t * pop_head( __condition_blocked_queue_t * this ) { |
---|
| 878 | __condition_node_t * head = this->head; |
---|
| 879 | if( head ) { |
---|
| 880 | this->head = head->next; |
---|
| 881 | if( !head->next ) { |
---|
| 882 | this->tail = &this->head; |
---|
| 883 | } |
---|
| 884 | head->next = NULL; |
---|
| 885 | } |
---|
| 886 | return head; |
---|
[4aa2fb2] | 887 | } |
---|
[6b0b624] | 888 | |
---|
| 889 | // Local Variables: // |
---|
| 890 | // mode: c // |
---|
| 891 | // tab-width: 4 // |
---|
| 892 | // End: // |
---|