mirror of
https://github.com/brain-hackers/u-boot-brain
synced 2024-08-27 12:28:52 +09:00
![Tom Rini](/assets/img/avatar_default.png)
When U-Boot started using SPDX tags we were among the early adopters and there weren't a lot of other examples to borrow from. So we picked the area of the file that usually had a full license text and replaced it with an appropriate SPDX-License-Identifier: entry. Since then, the Linux Kernel has adopted SPDX tags and they place it as the very first line in a file (except where shebangs are used, then it's second line) and with slightly different comment styles than us. In part due to community overlap, in part due to better tag visibility and in part for other minor reasons, switch over to that style. This commit changes all instances where we have a single declared license in the tag as both the before and after are identical in tag contents. There's also a few places where I found we did not have a tag and have introduced one. Signed-off-by: Tom Rini <trini@konsulko.com>
90 lines
2.5 KiB
C
90 lines
2.5 KiB
C
/* SPDX-License-Identifier: GPL-2.0+ */
|
|
/*
|
|
* Copyright 2013 Broadcom Corporation.
|
|
*/
|
|
|
|
/*
|
|
* Bitfield operations
|
|
*
|
|
* These are generic bitfield operations which allow manipulation of variable
|
|
* width bitfields within a word. One use of this would be to use data tables
|
|
* to determine how to reprogram fields within R/W hardware registers.
|
|
*
|
|
* Example:
|
|
*
|
|
* old_reg_val
|
|
* +--------+----+---+--+-----+----------+
|
|
* | | | | | old | |
|
|
* +--------+----+---+--+-----+----------+
|
|
*
|
|
* new_reg_val
|
|
* +--------+----+---+--+-----+----------+
|
|
* | | | | | new | |
|
|
* +--------+----+---+--+-----+----------+
|
|
*
|
|
* mask = bitfield_mask(10, 5);
|
|
* old = bitfield_extract(old_reg_val, 10, 5);
|
|
* new_reg_val = bitfield_replace(old_reg_val, 10, 5, new);
|
|
*
|
|
* or
|
|
*
|
|
* mask = bitfield_mask(10, 5);
|
|
* old = bitfield_extract_by_mask(old_reg_val, mask);
|
|
* new_reg_val = bitfield_replace_by_mask(old_reg_val, mask, new);
|
|
*
|
|
* The numbers 10 and 5 could for example come from data
|
|
* tables which describe all bitfields in all registers.
|
|
*/
|
|
|
|
#include <linux/types.h>
|
|
|
|
/* Produces a mask of set bits covering a range of a uint value */
|
|
static inline uint bitfield_mask(uint shift, uint width)
|
|
{
|
|
return ((1 << width) - 1) << shift;
|
|
}
|
|
|
|
/* Extract the value of a bitfield found within a given register value */
|
|
static inline uint bitfield_extract(uint reg_val, uint shift, uint width)
|
|
{
|
|
return (reg_val & bitfield_mask(shift, width)) >> shift;
|
|
}
|
|
|
|
/*
|
|
* Replace the value of a bitfield found within a given register value
|
|
* Returns the newly modified uint value with the replaced field.
|
|
*/
|
|
static inline uint bitfield_replace(uint reg_val, uint shift, uint width,
|
|
uint bitfield_val)
|
|
{
|
|
uint mask = bitfield_mask(shift, width);
|
|
|
|
return (reg_val & ~mask) | ((bitfield_val << shift) & mask);
|
|
}
|
|
|
|
/* Produces a shift of the bitfield given a mask */
|
|
static inline uint bitfield_shift(uint mask)
|
|
{
|
|
return mask ? ffs(mask) - 1 : 0;
|
|
}
|
|
|
|
/* Extract the value of a bitfield found within a given register value */
|
|
static inline uint bitfield_extract_by_mask(uint reg_val, uint mask)
|
|
{
|
|
uint shift = bitfield_shift(mask);
|
|
|
|
return (reg_val & mask) >> shift;
|
|
}
|
|
|
|
/*
|
|
* Replace the value of a bitfield found within a given register value
|
|
* Returns the newly modified uint value with the replaced field.
|
|
*/
|
|
static inline uint bitfield_replace_by_mask(uint reg_val, uint mask,
|
|
uint bitfield_val)
|
|
{
|
|
uint shift = bitfield_shift(mask);
|
|
|
|
return (reg_val & ~mask) | ((bitfield_val << shift) & mask);
|
|
}
|