ffs_l

Computes the number of left shifts required to normalize a 32-bit value, returning a 16-bit result (finds 1st sign bit). Returns a shift count of 31 for an input of 0x00000000.

Note: Does not actually normalize the value! Also, see the intrinsic norm_l which handles the case where the input == 0x00000000 differently.

Prototype

  Word16 ffs_l(Word32 lsrc)

Example

long ll = 0x20000000;/* .25 */

short result;



result = ffs_l(ll);

// Expected value of result: 1