source: mainline/uspace/lib/c/include/bitops.h@ 967e7a1

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 967e7a1 was 4805495, checked in by Jiří Zárevúcky <zarevucky.jiri@…>, 6 years ago

Make sure libc and abi header guards are reserved identifiers

It's only needed for a small subset that end up included from standard
headers, but for consistency this changes all of them.

  • Property mode set to 100644
File size: 2.9 KB
Line 
1/*
2 * Copyright (c) 2006 Ondrej Palkovsky
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup libc
30 * @{
31 */
32/** @file
33 */
34
35#ifndef _LIBC_BITOPS_H_
36#define _LIBC_BITOPS_H_
37
38#include <stddef.h>
39#include <stdint.h>
40
41/** Mask with bit @a n set. */
42#define BIT_V(type, n) \
43 ((type) 1 << (n))
44
45/** Mask with rightmost @a n bits set. */
46#define BIT_RRANGE(type, n) \
47 (BIT_V(type, (n)) - 1)
48
49/** Mask with bits @a hi .. @a lo set. @a hi >= @a lo. */
50#define BIT_RANGE(type, hi, lo) \
51 (BIT_RRANGE(type, (hi) - (lo) + 1) << (lo))
52
53/** Extract range of bits @a hi .. @a lo from @a value. */
54#define BIT_RANGE_EXTRACT(type, hi, lo, value) \
55 (((value) >> (lo)) & BIT_RRANGE(type, (hi) - (lo) + 1))
56
57/** Insert @a value between bits @a hi .. @a lo. */
58#define BIT_RANGE_INSERT(type, hi, lo, value) \
59 (((value) & BIT_RRANGE(type, (hi) - (lo) + 1)) << (lo))
60
61/** Return position of first non-zero bit from left (i.e. [log_2(arg)]).
62 *
63 * If number is zero, it returns 0
64 */
65static inline unsigned int fnzb32(uint32_t arg)
66{
67 unsigned int n = 0;
68
69 if (arg >> 16) {
70 arg >>= 16;
71 n += 16;
72 }
73
74 if (arg >> 8) {
75 arg >>= 8;
76 n += 8;
77 }
78
79 if (arg >> 4) {
80 arg >>= 4;
81 n += 4;
82 }
83
84 if (arg >> 2) {
85 arg >>= 2;
86 n += 2;
87 }
88
89 if (arg >> 1) {
90 arg >>= 1;
91 n += 1;
92 }
93
94 return n;
95}
96
97static inline unsigned int fnzb64(uint64_t arg)
98{
99 unsigned int n = 0;
100
101 if (arg >> 32) {
102 arg >>= 32;
103 n += 32;
104 }
105
106 return (n + fnzb32((uint32_t) arg));
107}
108
109static inline unsigned int fnzb(size_t arg)
110{
111 return fnzb64(arg);
112}
113
114#endif
115
116/** @}
117 */
Note: See TracBrowser for help on using the repository browser.