QP/C++
qmp_get.cpp
Go to the documentation of this file.
00001 
00002 // Product: QF/C++
00003 // Last Updated for Version: 4.3.00
00004 // Date of the Last Update:  Nov 01, 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 "qf_pkg.h"
00029 #include "qassert.h"
00030 
00034 
00035 #ifdef Q_USE_NAMESPACE
00036 namespace QP {
00037 #endif
00038 
00039 Q_DEFINE_THIS_MODULE(qmp_get)
00040 
00041 //............................................................................
00042 void *QMPool::get(void) {
00043     QF_CRIT_STAT_
00044     QF_CRIT_ENTRY_();
00045 
00046     QFreeBlock *fb = (QFreeBlock *)m_free;         // get a free block or NULL
00047     if (fb != (QFreeBlock *)0) {                      // free block available?
00048         m_free = fb->m_next;          // adjust list head to the next free block
00049         --m_nFree;                                      // one free block less
00050         if (m_nMin > m_nFree) {
00051             m_nMin = m_nFree;                   // remember the minimum so far
00052         }
00053     }
00054 
00055     QS_BEGIN_NOCRIT_(QS_QF_MPOOL_GET, QS::mpObj_, m_start)
00056         QS_TIME_();                                               // timestamp
00057         QS_OBJ_(m_start);                   // the memory managed by this pool
00058         QS_MPC_(m_nFree);             // the number of free blocks in the pool
00059         QS_MPC_(m_nMin);     // the mninimum number of free blocks in the pool
00060     QS_END_NOCRIT_()
00061 
00062     QF_CRIT_EXIT_();
00063     return fb;               // return the block or NULL pointer to the caller
00064 }
00065 //............................................................................
00066 uint32_t QF::getPoolMargin(uint8_t poolId) {
00067     Q_REQUIRE(((uint8_t)1 <= poolId) && (poolId <= QF_maxPool_));
00068 
00069     QF_CRIT_STAT_
00070     QF_CRIT_ENTRY_();
00071     uint32_t margin = (uint32_t)QF_pool_[poolId - (uint8_t)1].m_nMin;
00072     QF_CRIT_EXIT_();
00073 
00074     return margin;
00075 }
00076 
00077 #ifdef Q_USE_NAMESPACE
00078 }                                                              // namespace QP
00079 #endif