[nasm:master] Use a more optimal value for the UNUSED slot

[nasm-bot f. H. P. A. <hp...@li...>]

Commit-ID:  5a8c424d0c4b63d14eb1120475ebc3dee38bac8c
Gitweb:     http://repo.or.cz/w/nasm.git?a=commitdiff;h=5a8c424d0c4b63d14eb1120475ebc3dee38bac8c
Author:     H. Peter Anvin <hp...@li...>
AuthorDate: Fri, 29 Jan 2016 12:05:27 -0800
Committer:  H. Peter Anvin <hp...@li...>
CommitDate: Fri, 29 Jan 2016 12:05:27 -0800

Use a more optimal value for the UNUSED slot

Instead of ~1/4 the range we can use ~1/3 the range for better
distance.  It is possible that using ~1/2 - 1 might be even better,
but this is a trivial tweak.

Signed-off-by: H. Peter Anvin <hp...@li...>


---
 directiv.pl | 2 +-
 macros.pl   | 2 +-
 pptok.pl    | 2 +-
 tokhash.pl  | 2 +-
 4 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/directiv.pl b/directiv.pl
index 51d0ec3..b567aff 100755
--- a/directiv.pl
+++ b/directiv.pl
@@ -143,7 +143,7 @@ if ($output eq 'h') {
     # Put a large value in unused slots.  This makes it extremely unlikely
     # that any combination that involves unused slot will pass the range test.
     # This speeds up rejection of unrecognized tokens, i.e. identifiers.
-    print C "#define UNUSED 16383\n";
+    print C "#define UNUSED (65535/3)\n";
 
     print C "    static const int16_t hash1[$n] = {\n";
     for ($i = 0; $i < $n; $i++) {
diff --git a/macros.pl b/macros.pl
index e64fead..67aa08c 100755
--- a/macros.pl
+++ b/macros.pl
@@ -225,7 +225,7 @@ print OUT "    };\n";
 # Put a large value in unused slots.  This makes it extremely unlikely
 # that any combination that involves unused slot will pass the range test.
 # This speeds up rejection of unrecognized tokens, i.e. identifiers.
-print OUT "#define UNUSED 16383\n";
+print OUT "#define UNUSED (65535/3)\n";
 
 print OUT "    static const int16_t hash1[$n] = {\n";
 for ($i = 0; $i < $n; $i++) {
diff --git a/pptok.pl b/pptok.pl
index 1ea2e7e..2dbf0fe 100755
--- a/pptok.pl
+++ b/pptok.pl
@@ -207,7 +207,7 @@ if ($what eq 'c') {
     # Put a large value in unused slots.  This makes it extremely unlikely
     # that any combination that involves unused slot will pass the range test.
     # This speeds up rejection of unrecognized tokens, i.e. identifiers.
-    print OUT "#define UNUSED 16383\n";
+    print OUT "#define UNUSED (65535/3)\n";
 
     print OUT "    static const int16_t hash1[$n] = {\n";
     for ($i = 0; $i < $n; $i++) {
diff --git a/tokhash.pl b/tokhash.pl
index 509520b..07bc6ab 100755
--- a/tokhash.pl
+++ b/tokhash.pl
@@ -232,7 +232,7 @@ if ($output eq 'h') {
     # Put a large value in unused slots.  This makes it extremely unlikely
     # that any combination that involves unused slot will pass the range test.
     # This speeds up rejection of unrecognized tokens, i.e. identifiers.
-    print "#define UNUSED 16383\n";
+    print "#define UNUSED (65535/3)\n";
 
     print "    static const int16_t hash1[$n] = {\n";
     for ($i = 0; $i < $n; $i++) {