|
QP/C++
|
00001 00002 // Product: QK/C++ 00003 // Last Updated for Version: 4.3.00 00004 // Date of the Last Update: Nov 02, 2011 00005 // 00006 // Q u a n t u m L e a P s 00007 // --------------------------- 00008 // innovating embedded systems 00009 // 00010 // Copyright (C) 2002-2011 Quantum Leaps, LLC. All rights reserved. 00011 // 00012 // This software may be distributed and modified under the terms of the GNU 00013 // General Public License version 2 (GPL) as published by the Free Software 00014 // Foundation and appearing in the file GPL.TXT included in the packaging of 00015 // this file. Please note that GPL Section 2[b] requires that all works based 00016 // on this software must also be made publicly available under the terms of 00017 // the GPL ("Copyleft"). 00018 // 00019 // Alternatively, this software may be distributed and modified under the 00020 // terms of Quantum Leaps commercial licenses, which expressly supersede 00021 // the GPL and are specifically designed for licensees interested in 00022 // retaining the proprietary status of their code. 00023 // 00024 // Contact information: 00025 // Quantum Leaps Web site: http://www.quantum-leaps.com 00026 // e-mail: info@quantum-leaps.com 00028 #include "qk_pkg.h" 00029 //#include "qassert.h" 00030 00034 00035 #ifdef QK_NO_MUTEX 00036 #error "qk_mutex.cpp included in the build when QK_NO_MUTEX defined" 00037 #endif 00038 00039 #ifdef Q_USE_NAMESPACE 00040 namespace QP { 00041 #endif 00042 00043 //Q_DEFINE_THIS_MODULE(qk_mutex) 00044 00045 // package-scope objects ----------------------------------------------------- 00046 uint8_t volatile QK_ceilingPrio_; // ceiling priority of a mutex 00047 00048 //............................................................................ 00049 QMutex QK::mutexLock(uint8_t prioCeiling) { 00050 QF_CRIT_STAT_ 00051 QF_CRIT_ENTRY_(); 00052 uint8_t mutex = QK_ceilingPrio_; // original QK priority ceiling to return 00053 if (QK_ceilingPrio_ < prioCeiling) { 00054 QK_ceilingPrio_ = prioCeiling; // raise the QK priority ceiling 00055 } 00056 00057 QS_BEGIN_NOCRIT_(QS_QK_MUTEX_LOCK, (void *)0, (void *)0) 00058 QS_TIME_(); // timestamp 00059 QS_U8_(mutex); // the original priority 00060 QS_U8_(QK_ceilingPrio_); // the current priority ceiling 00061 QS_END_NOCRIT_() 00062 00063 QF_CRIT_EXIT_(); 00064 return mutex; 00065 } 00066 //............................................................................ 00067 void QK::mutexUnlock(QMutex mutex) { 00068 QF_CRIT_STAT_ 00069 QF_CRIT_ENTRY_(); 00070 00071 QS_BEGIN_NOCRIT_(QS_QK_MUTEX_UNLOCK, (void *)0, (void *)0) 00072 QS_TIME_(); // timestamp 00073 QS_U8_(mutex); // the original priority 00074 QS_U8_(QK_ceilingPrio_); // the current priority ceiling 00075 QS_END_NOCRIT_() 00076 00077 if (QK_ceilingPrio_ > mutex) { 00078 QK_ceilingPrio_ = mutex; // restore the saved priority ceiling 00079 mutex = QK_schedPrio_(); // reuse 'mutex' to hold priority 00080 if (mutex != (uint8_t)0) { 00081 QK_sched_(mutex); 00082 } 00083 } 00084 QF_CRIT_EXIT_(); 00085 } 00086 00087 #ifdef Q_USE_NAMESPACE 00088 } // namespace QP 00089 #endif
1.7.5.1