len0rd/FreeRTOS-Kernel
1
0
Fork 0
mirror of https://github.com/FreeRTOS/FreeRTOS-Kernel.git synced 2025-10-26 23:36:32 -04:00
Code Issues Projects Releases Packages Wiki Activity

Use CI-CD-Github-Actions for spelling and formatting, add in the bot formatting action, update the CI-CD workflow files. Fix incorrect spelling and formatting on files. (#1083)

Browse source 
* Use new version of CI-CD Actions,  checkout@v3 instead of checkout@v2 on all jobs
* Use cSpell spell check, and use ubuntu-20.04 for formatting check
* Add in bot formatting action
* Update freertos_demo.yml and freertos_plus_demo.yml files to increase github log readability
* Add in a Qemu demo onto the workflows.
This commit is contained in:
Soren Ptak 2023-09-06 15:35:37 -04:00 • committed by GitHub
parent 537007d96c
commit 3a2f6646f0
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1036 changed files with 134568 additions and 127281 deletions
Download patch file Download diff file Expand all files Collapse all files

200
FreeRTOS-Plus/Source/Reliance-Edge/util/bitmap.c
View file

@ -1,101 +1,99 @@
/* ----> DO NOT REMOVE THE FOLLOWING NOTICE <----
Copyright (c) 2014-2015 Datalight, Inc.
All Rights Reserved Worldwide.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; use version 2 of the License.
This program is distributed in the hope that it will be useful,
but "AS-IS," WITHOUT ANY WARRANTY; without even the implied warranty
of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/* Businesses and individuals that for commercial or other reasons cannot
comply with the terms of the GPLv2 license may obtain a commercial license
before incorporating Reliance Edge into proprietary software for
distribution in any form. Visit http://www.datalight.com/reliance-edge for
more information.
*/
/** @file
@brief Implements utilities for working with bitmaps.
*/
#include <redfs.h>
/** @brief Query the state of a bit in a bitmap.
Bits are counted from most significant to least significant. Thus, the mask
for bit zero is 0x80 applied to the first byte in the bitmap.
@param pbBitmap Pointer to the bitmap.
@param ulBit The bit to query.
@retval Whether the bit is set (true) or clear (false.
*/
bool RedBitGet(
const uint8_t *pbBitmap,
uint32_t ulBit)
{
bool fRet;
if(pbBitmap == NULL)
{
REDERROR();
fRet = false;
}
else
{
fRet = (pbBitmap[ulBit >> 3U] & (0x80U >> (ulBit & 7U))) != 0U;
}
return fRet;
}
/** @brief Set a bit in a bitmap to one.
Bits are counted from most significant to least significant. Thus, the mask
for bit zero is 0x80 applied to the first byte in the bitmap.
@param pbBitmap Pointer to the bitmap.
@param ulBit The bit to set.
*/
void RedBitSet(
uint8_t *pbBitmap,
uint32_t ulBit)
{
REDASSERT(pbBitmap != NULL);
if(pbBitmap != NULL)
{
pbBitmap[ulBit >> 3U] |= (0x80U >> (ulBit & 7U));
}
}
/** @brief Clear a bit in a bitmap to zero.
Bits are counted from most significant to least significant. Thus, the mask
for bit zero is 0x80 applied to the first byte in the bitmap.
@param pbBitmap Pointer to the bitmap.
@param ulBit The bit to clear.
*/
void RedBitClear(
uint8_t *pbBitmap,
uint32_t ulBit)
{
REDASSERT(pbBitmap != NULL);
if(pbBitmap != NULL)
{
pbBitmap[ulBit >> 3U] &= ~(0x80U >> (ulBit & 7U));
}
}
/* ----> DO NOT REMOVE THE FOLLOWING NOTICE <----
*
* Copyright (c) 2014-2015 Datalight, Inc.
* All Rights Reserved Worldwide.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; use version 2 of the License.
*
* This program is distributed in the hope that it will be useful,
* but "AS-IS," WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/* Businesses and individuals that for commercial or other reasons cannot
* comply with the terms of the GPLv2 license may obtain a commercial license
* before incorporating Reliance Edge into proprietary software for
* distribution in any form. Visit http://www.datalight.com/reliance-edge for
* more information.
*/
/** @file
* @brief Implements utilities for working with bitmaps.
*/
#include <redfs.h>
/** @brief Query the state of a bit in a bitmap.
*
* Bits are counted from most significant to least significant. Thus, the mask
* for bit zero is 0x80 applied to the first byte in the bitmap.
*
* @param pbBitmap Pointer to the bitmap.
* @param ulBit The bit to query.
*
* @retval Whether the bit is set (true) or clear (false.
*/
bool RedBitGet( const uint8_t * pbBitmap,
uint32_t ulBit )
{
bool fRet;
if( pbBitmap == NULL )
{
REDERROR();
fRet = false;
}
else
{
fRet = ( pbBitmap[ ulBit >> 3U ] & ( 0x80U >> ( ulBit & 7U ) ) ) != 0U;
}
return fRet;
}
/** @brief Set a bit in a bitmap to one.
*
* Bits are counted from most significant to least significant. Thus, the mask
* for bit zero is 0x80 applied to the first byte in the bitmap.
*
* @param pbBitmap Pointer to the bitmap.
* @param ulBit The bit to set.
*/
void RedBitSet( uint8_t * pbBitmap,
uint32_t ulBit )
{
REDASSERT( pbBitmap != NULL );
if( pbBitmap != NULL )
{
pbBitmap[ ulBit >> 3U ] |= ( 0x80U >> ( ulBit & 7U ) );
}
}
/** @brief Clear a bit in a bitmap to zero.
*
* Bits are counted from most significant to least significant. Thus, the mask
* for bit zero is 0x80 applied to the first byte in the bitmap.
*
* @param pbBitmap Pointer to the bitmap.
* @param ulBit The bit to clear.
*/
void RedBitClear( uint8_t * pbBitmap,
uint32_t ulBit )
{
REDASSERT( pbBitmap != NULL );
if( pbBitmap != NULL )
{
pbBitmap[ ulBit >> 3U ] &= ~( 0x80U >> ( ulBit & 7U ) );
}
}