1

/* $Id$ */

     2

     3

/** @file bitmath_func.cpp */

     4

     5

#include "../stdafx.h"

     6

#include "bitmath_func.hpp"

     7

     8

const uint8 _ffb_64[64] = {

     9

 0,  0,  1,  0,  2,  0,  1,  0,

    10

 3,  0,  1,  0,  2,  0,  1,  0,

    11

 4,  0,  1,  0,  2,  0,  1,  0,

    12

 3,  0,  1,  0,  2,  0,  1,  0,

    13

 5,  0,  1,  0,  2,  0,  1,  0,

    14

 3,  0,  1,  0,  2,  0,  1,  0,

    15

 4,  0,  1,  0,  2,  0,  1,  0,

    16

 3,  0,  1,  0,  2,  0,  1,  0,

    17

};

    18

    19

/**

    20

 * Search the first set bit in a 32 bit variable.

    21

 *

    22

 * This algorithm is a static implementation of a log

    23

 * conguence search algorithm. It checks the first half

    24

 * if there is a bit set search there further. And this

    25

 * way further. If no bit is set return 0.

    26

 *

    27

 * @param x The value to search

    28

 * @param The position of the first bit set

    29

 */

    30

uint8 FindFirstBit(uint32 x)

    31

{

    32

	if (x == 0) return 0;

    33

	/* The macro FIND_FIRST_BIT is better to use when your x is

    34

	  not more than 128. */

    35

    36

	uint8 pos = 0;

    37

    38

	if ((x & 0x0000ffff) == 0) { x >>= 16; pos += 16; }

    39

	if ((x & 0x000000ff) == 0) { x >>= 8;  pos += 8;  }

    40

	if ((x & 0x0000000f) == 0) { x >>= 4;  pos += 4;  }

    41

	if ((x & 0x00000003) == 0) { x >>= 2;  pos += 2;  }

    42

	if ((x & 0x00000001) == 0) { pos += 1; }

    43

    44

	return pos;

    45

}