[355ee7d] | 1 | /** |
---|
| 2 | * @file |
---|
| 3 | * |
---|
| 4 | * @brief Scheduler Priority Unblock |
---|
| 5 | * @ingroup ScoreScheduler |
---|
| 6 | */ |
---|
| 7 | |
---|
[0faa9dad] | 8 | /* |
---|
| 9 | * Scheduler Handler |
---|
| 10 | * |
---|
| 11 | * Copyright (C) 2010 Gedare Bloom. |
---|
[010192d] | 12 | * Copyright (C) 2011 On-Line Applications Research Corporation (OAR). |
---|
[0faa9dad] | 13 | * |
---|
| 14 | * The license and distribution terms for this file may be |
---|
[dcf3687] | 15 | * found in the file LICENSE in this distribution or at |
---|
[c499856] | 16 | * http://www.rtems.org/license/LICENSE. |
---|
[0faa9dad] | 17 | */ |
---|
| 18 | |
---|
| 19 | #if HAVE_CONFIG_H |
---|
| 20 | #include "config.h" |
---|
| 21 | #endif |
---|
| 22 | |
---|
[f068384e] | 23 | #include <rtems/score/schedulerpriorityimpl.h> |
---|
[0faa9dad] | 24 | |
---|
[ca1e546e] | 25 | void _Scheduler_priority_Unblock ( |
---|
[e1598a6] | 26 | const Scheduler_Control *scheduler, |
---|
[72e0bdb] | 27 | Thread_Control *the_thread, |
---|
| 28 | Scheduler_Node *node |
---|
[0faa9dad] | 29 | ) |
---|
| 30 | { |
---|
[9bfad8c] | 31 | Scheduler_priority_Context *context; |
---|
[72e0bdb] | 32 | Scheduler_priority_Node *the_node; |
---|
[9bfad8c] | 33 | unsigned int priority; |
---|
[c597fb1] | 34 | unsigned int unmapped_priority; |
---|
[9bfad8c] | 35 | |
---|
| 36 | context = _Scheduler_priority_Get_context( scheduler ); |
---|
[72e0bdb] | 37 | the_node = _Scheduler_priority_Node_downcast( node ); |
---|
[c597fb1] | 38 | priority = (unsigned int ) _Scheduler_Node_get_priority( &the_node->Base ); |
---|
| 39 | unmapped_priority = SCHEDULER_PRIORITY_UNMAP( priority ); |
---|
[9bfad8c] | 40 | |
---|
[c597fb1] | 41 | if ( unmapped_priority != the_node->Ready_queue.current_priority ) { |
---|
[9bfad8c] | 42 | _Scheduler_priority_Ready_queue_update( |
---|
[72e0bdb] | 43 | &the_node->Ready_queue, |
---|
[c597fb1] | 44 | unmapped_priority, |
---|
[9bfad8c] | 45 | &context->Bit_map, |
---|
| 46 | &context->Ready[ 0 ] |
---|
| 47 | ); |
---|
| 48 | } |
---|
[494c2e3] | 49 | |
---|
[beab7329] | 50 | _Scheduler_priority_Ready_queue_enqueue( |
---|
[647b95d] | 51 | &the_thread->Object.Node, |
---|
[72e0bdb] | 52 | &the_node->Ready_queue, |
---|
[beab7329] | 53 | &context->Bit_map |
---|
| 54 | ); |
---|
[108c4b0] | 55 | |
---|
| 56 | /* TODO: flash critical section? */ |
---|
| 57 | |
---|
| 58 | /* |
---|
| 59 | * If the thread that was unblocked is more important than the heir, |
---|
| 60 | * then we have a new heir. This may or may not result in a |
---|
| 61 | * context switch. |
---|
| 62 | * |
---|
| 63 | * Normal case: |
---|
| 64 | * If the current thread is preemptible, then we need to do |
---|
| 65 | * a context switch. |
---|
| 66 | * Pseudo-ISR case: |
---|
| 67 | * Even if the thread isn't preemptible, if the new heir is |
---|
| 68 | * a pseudo-ISR system task, we need to do a context switch. |
---|
| 69 | */ |
---|
[b20b736] | 70 | if ( priority < _Thread_Get_priority( _Thread_Heir ) ) { |
---|
[9bfad8c] | 71 | _Scheduler_Update_heir( the_thread, priority == PRIORITY_PSEUDO_ISR ); |
---|
[108c4b0] | 72 | } |
---|
[0faa9dad] | 73 | } |
---|