QP/C: qmp_get.c Source File

Go to the documentation of this file.
00001 /*****************************************************************************
00002 * Product: QF/C
00003 * Last Updated for Version: 4.4.00
00004 * Date of the Last Update:  Jan 06, 2012
00005 *
00006 *                    Q u a n t u m     L e a P s
00007 *                    ---------------------------
00008 *                    innovating embedded systems
00009 *
00010 * Copyright (C) 2002-2012 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 
00039 /*..........................................................................*/
00040 void *QMPool_get(QMPool *me) {
00041     QFreeBlock *fb;
00042     QF_CRIT_STAT_
00043 
00044     QF_CRIT_ENTRY_();
00045     fb = (QFreeBlock *)me->free_head;           /* get a free block or NULL */
00046     if (fb != (QFreeBlock *)0) {                   /* free block available? */
00047         me->free_head = fb->next;/* adjust list head to the next free block */
00048         --me->nFree;                                 /* one less free block */
00049         if (me->nMin > me->nFree) {
00050             me->nMin = me->nFree;            /* remember the minimum so far */
00051         }
00052     }
00053 
00054     QS_BEGIN_NOCRIT_(QS_QF_MPOOL_GET, QS_mpObj_, me->start)
00055         QS_TIME_();                                            /* timestamp */
00056         QS_OBJ_(me->start);              /* the memory managed by this pool */
00057         QS_MPC_(me->nFree);        /* the number of free blocks in the pool */
00058         QS_MPC_(me->nMin);    /* min number of free blocks ever in the pool */
00059     QS_END_NOCRIT_()
00060 
00061     QF_CRIT_EXIT_();
00062     return fb;            /* return the block or NULL pointer to the caller */
00063 }
00064 /*..........................................................................*/
00065 uint32_t QF_getPoolMargin(uint8_t poolId) {
00066     uint32_t margin;
00067     QF_CRIT_STAT_
00068 
00069     Q_REQUIRE(((uint8_t)1 <= poolId) && (poolId <= QF_maxPool_));
00070 
00071     QF_CRIT_ENTRY_();
00072     margin = (uint32_t)QF_pool_[poolId - (uint8_t)1].nMin;
00073     QF_CRIT_EXIT_();
00074 
00075     return margin;
00076 }