【Linux kernel】有趣算法

最新推荐文章于 2022-05-07 13:57:15 发布

d5_5d

最新推荐文章于 2022-05-07 13:57:15 发布

阅读量796

点赞数

分类专栏：算法文章标签： Linux kernel 算法

本文链接：https://blog.csdn.net/d5_5d/article/details/8203945

版权

算法专栏收录该内容

1 篇文章 0 订阅

订阅专栏

/**
 * fls - find last (most-significant) bit set
 * @x: the word to search
 *
 * This is defined the same way as ffs.
 * Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
 */

static __always_inline int fls(int x)
{
	int r = 32;

	if (!x)
		return 0;
	if (!(x & 0xffff0000u)) {
		x <<= 16;
		r -= 16;
	}
	if (!(x & 0xff000000u)) {
		x <<= 8;
		r -= 8;
	}
	if (!(x & 0xf0000000u)) {
		x <<= 4;
		r -= 4;
	}
	if (!(x & 0xc0000000u)) {
		x <<= 2;
		r -= 2;
	}
	if (!(x & 0x80000000u)) {
		x <<= 1;
		r -= 1;
	}
	return r;
}