qmp_get.cpp

00001 //////////////////////////////////////////////////////////////////////////////
00002 // Product: QF/C++
00003 // Last Updated for Version: 4.0.00
00004 // Date of the Last Update:  Apr 07, 2008
00005 //
00006 //                    Q u a n t u m     L e a P s
00007 //                    ---------------------------
00008 //                    innovating embedded systems
00009 //
00010 // Copyright (C) 2002-2008 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
00027 //////////////////////////////////////////////////////////////////////////////
00028 #include "qf_pkg.h"
00029 #include "qassert.h"
00030 
00031 Q_DEFINE_THIS_MODULE(qmp_get)
00032 
00033 /// \file
00034 /// \ingroup qf
00035 /// \brief QMPool::get() and QF::getPoolMargin() implementation.
00036 
00037 //............................................................................
00038 void *QMPool::get(void) {
00039     QF_INT_LOCK_KEY_
00040     QF_INT_LOCK_();
00041 
00042     QFreeBlock *fb = (QFreeBlock *)m_free;         // get a free block or NULL
00043     if (fb != (QFreeBlock *)0) {                      // free block available?
00044         m_free = fb->m_next;          // adjust list head to the next free block
00045         --m_nFree;                                      // one free block less
00046         if (m_nMin > m_nFree) {
00047             m_nMin = m_nFree;                   // remember the minimum so far
00048         }
00049     }
00050 
00051     QS_BEGIN_NOLOCK_(QS_QF_MPOOL_GET, QS::mpObj_, m_start)
00052         QS_TIME_();                                               // timestamp
00053         QS_OBJ_(m_start);                   // the memory managed by this pool
00054         QS_MPC_(m_nFree);             // the number of free blocks in the pool
00055         QS_MPC_(m_nMin);     // the mninimum number of free blocks in the pool
00056     QS_END_NOLOCK_()
00057 
00058     QF_INT_UNLOCK_();
00059     return fb;               // return the block or NULL pointer to the caller
00060 }
00061 //............................................................................
00062 uint32_t QF::getPoolMargin(uint8_t poolId) {
00063     Q_REQUIRE(((uint8_t)1 <= poolId) && (poolId <= QF_maxPool_));
00064 
00065     QF_INT_LOCK_KEY_
00066     QF_INT_LOCK_();
00067     uint32_t margin = (uint32_t)QF_pool_[poolId - (uint8_t)1].m_nMin;
00068     QF_INT_UNLOCK_();
00069 
00070     return margin;
00071 }