Update Yasm to 1.2.0 (Yasm Part 1/3)

third_party/yasm/patched-yasm/libyasm/hamt.c

 /*
  * Hash Array Mapped Trie (HAMT) implementation
  *
  *  Copyright (C) 2001-2007  Peter Johnson
  *
  *  Based on the paper "Ideal Hash Tries" by Phil Bagwell [2000].
  *  One algorithmic change from that described in the paper: we use the LSB's
  *  of the key to index the root table and move upward in the key rather than
  *  use the MSBs as described in the paper.  The LSBs have more entropy.
  *
@@ skipping 12 matching lines @@
  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR OTHER CONTRIBUTORS BE
  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  * POSSIBILITY OF SUCH DAMAGE.
  */
 #include "util.h"
-/*@unused@*/ RCSID("$Id: hamt.c 1907 2007-08-05 16:44:07Z peter $");
 
 #include <ctype.h>
 
 #include "libyasm-stdint.h"
 #include "coretype.h"
 #include "hamt.h"
 
 struct HAMTEntry {
     STAILQ_ENTRY(HAMTEntry) next;       /* next hash table entry */
     /*@dependent@*/ const char *str;    /* string being hashed */
@@ skipping 369 matching lines @@
         /* Count bits below */
         BitCount(Map, node->BitMapKey & ~((~0UL)<<keypart));
         Map &= 0x1F;    /* Clamp to <32 */
 
         /* Go down a level */
         level++;
         node = &(GetSubTrie(node))[Map];
     }
 }