|
QP/C
|
00001 /***************************************************************************** 00002 * Product: QF/C 00003 * Last Updated for Version: 4.4.00 00004 * Date of the Last Update: Jan 15, 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_put") 00032 00033 00039 /* This macro is specifically and exclusively used for checking the range 00040 * of a block pointer returned to the pool. Such a check must rely on the 00041 * pointer arithmetic not compliant with the MISRA-C 2004 rules 17.2(req) and 00042 * 17.3(req). Defining a specific macro for this purpose allows to selectively 00043 * disable the warnings for this particular case. 00044 */ 00045 #define QF_PTR_RANGE_(x_, min_, max_) (((min_) <= (x_)) && ((x_) <= (max_))) 00046 00047 /*..........................................................................*/ 00048 void QMPool_put(QMPool *me, void *b) { 00049 QF_CRIT_STAT_ 00050 00051 Q_REQUIRE(me->nFree <= me->nTot); /* # free blocks must be < total */ 00052 Q_REQUIRE(QF_PTR_RANGE_(b, me->start, me->end)); /* b must be in range */ 00053 00054 QF_CRIT_ENTRY_(); 00055 ((QFreeBlock *)b)->next = (QFreeBlock *)me->free_head;/* link into list */ 00056 me->free_head = b; /* set as new head of the free list */ 00057 ++me->nFree; /* one more free block in this pool */ 00058 00059 QS_BEGIN_NOCRIT_(QS_QF_MPOOL_PUT, QS_mpObj_, me->start) 00060 QS_TIME_(); /* timestamp */ 00061 QS_OBJ_(me->start); /* the memory managed by this pool */ 00062 QS_MPC_(me->nFree); /* the number of free blocks in the pool */ 00063 QS_END_NOCRIT_() 00064 00065 QF_CRIT_EXIT_(); 00066 }
1.7.6.1