From: stevenj <stevenj@alum.mit.edu>
Date: Sun, 9 Mar 2008 18:56:25 +0000 (-0400)
Subject: slight improvement in rightzero32
X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?a=commitdiff_plain;h=c871f9d7ea4c382964be7c6f9467d82a4e7cfa4e;p=nlopt.git

slight improvement in rightzero32

darcs-hash:20080309185625-c8de0-0dde7cdd9e32f087b8c8b726c17320c816fb2559.gz
---

diff --git a/util/sobolseq.c b/util/sobolseq.c
index a662fc1..bd73b40 100644
--- a/util/sobolseq.c
+++ b/util/sobolseq.c
@@ -75,7 +75,7 @@ typedef struct nlopt_soboldata_s {
      uint32_t n; /* number of x's generated so far */
 } soboldata;
 
-/* Return position (0, 1, ...) of rightmost zero bit in n.
+/* Return position (0, 1, ...) of rightmost (least-significant) zero bit in n.
  *
  * This code uses a 32-bit version of algorithm to find the rightmost
  * one bit in Knuth, _The Art of Computer Programming_, volume 4A
@@ -90,7 +90,8 @@ static unsigned rightzero32(uint32_t n)
      const uint32_t a = 0x05f66a47; /* magic number, found by brute force */
      static const unsigned decode[32] = {0,1,2,26,23,3,15,27,24,21,19,4,12,16,28,6,31,25,22,14,20,18,11,5,30,13,17,10,29,9,8,7};
      n = ~n; /* change to rightmost-one problem */
-     return decode[(a * (n & (-n))) >> 27];
+     n = a * (n & (-n)); /* store in n to make sure mult. is 32 bits */
+     return decode[n >> 27];
 }
 
 /* generate the next term x_{n+1} in the Sobol sequence, as an array