commit 6f4b83bce07100bdef792238260c66a1fa6bd589
author Dan Hipschman <dsh@linux.ucla.edu> Mon Sep 11 17:53:53 2006 -0700
committer Alexandre Julliard <julliard@winehq.org> Tue Sep 12 11:01:12 2006 +0200
tree 4d939e966dbf3eb20d242fd033e23c5a40dd779c
parent 6a585fcafc66b2535062975168b353d1629923a3

widl: Replace a loop with a simple computation.

tools/widl/hash.c

diff --git a/tools/widl/hash.c b/tools/widl/hash.c
index d67cb6b..2d6f1d3 100644
--- a/tools/widl/hash.c
+++ b/tools/widl/hash.c
@@ -605,13 +605,7 @@
 
   while (*str)
   {
-    ULONG newLoWord = 0, i;
-
-    /* Cumulative prime multiplication (*37) with modulo 2^32 wrap-around */
-    for (i = 0; i < 37; i++)
-      newLoWord += nLoWord;
-
-    nLoWord = newLoWord + pnLookup[*str > 0x7f && nMask ? *str + 0x80 : *str];
+    nLoWord = 37 * nLoWord + pnLookup[*str > 0x7f && nMask ? *str + 0x80 : *str];
     str++;
   }
   /* Constrain to a prime modulo and sizeof(WORD) */