bitops.h

/*
 * Copyright (c) 2020 jindongsheng1024@163.com
 *
 * SPDX-License-Identifier: Apache-2.0
 */

#ifndef _BITOPS_H_
#define _BITOPS_H_

#ifdef __cplusplus
extern "C" {
#endif

#include <stdint.h>

#define OP_BITS_PER_LONG 32
#define OP_BIT(nr)       (1UL << (nr))
#define OP_BIT_MASK(nr)  (1UL << ((nr) % OP_BITS_PER_LONG))
#define OP_BIT_WORD(nr)  ((nr) / OP_BITS_PER_LONG)

/*
 * Set a bit in memory
 */
static inline void set_bit(uint32_t *addr, uint32_t nr)
{
    uint32_t mask = OP_BIT_MASK(nr);
    uint32_t *p = ((uint32_t *)addr) + OP_BIT_WORD(nr);
    *p |= mask;
}

/*
 * Clear a bit in memory
 */
static inline void clear_bit(uint32_t *addr, uint32_t nr)
{
    uint32_t mask = OP_BIT_MASK(nr);
    uint32_t *p = ((uint32_t *)addr) + OP_BIT_WORD(nr);
    *p &= ~mask;
}

/*
 * Toggle a bit in memory
 */
static inline void change_bit(uint32_t *addr, uint32_t nr)
{
    uint32_t mask = OP_BIT_MASK(nr);
    uint32_t *p = ((uint32_t *)addr) + OP_BIT_WORD(nr);
    *p ^= mask;
}

/*
 * Set a bit and return its old value
 */
static inline int test_and_set_bit(uint32_t *addr, uint32_t nr)
{
    uint32_t mask = OP_BIT_MASK(nr);
    uint32_t *p = ((uint32_t *)addr) + OP_BIT_WORD(nr);
    uint32_t old = *p;
    *p = old | mask;
    return (old & mask) != 0;
}

/*
 * Clear a bit and return its old value
 */
static inline int test_and_clear_bit(uint32_t *addr, uint32_t nr)
{
    uint32_t mask = OP_BIT_MASK(nr);
    uint32_t *p = ((uint32_t *)addr) + OP_BIT_WORD(nr);
    uint32_t old = *p;
    *p = old & ~mask;
    return (old & mask) != 0;
}

/*
 * Toggle a bit and return its old value
 */
static inline int test_and_change_bit(uint32_t *addr, uint32_t nr)
{
    uint32_t mask = OP_BIT_MASK(nr);
    uint32_t *p = ((uint32_t *)addr) + OP_BIT_WORD(nr);
    uint32_t old = *p;
    *p = old ^ mask;
    return (old & mask) != 0;
}

/*
 * Determine whether a bit is set
 */
static inline int test_bit(uint32_t *addr, uint32_t nr)
{
    return 1UL & (addr[OP_BIT_WORD(nr)] >> (nr & (OP_BITS_PER_LONG-1)));
}

#ifdef __cplusplus
}
#endif

#endif

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值