Fix incorrect short cut test that assumed ASCII strings could be Latin1.

src/runtime.cc

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 1068 matching lines @@
   // Cap bad char table to last p chars of pattern. Also max skip value.
   int p = m < kBMHSignificantSuffixLength ?  m : kBMHSignificantSuffixLength;
 
   memset(bad_char_map, p, kBMHBadCharCount);
 
   // Run forwards to populate bad_char_table, so that *last* instance
   // of character equivalence class is the one registered.
   // Notice: Doesn't include last character.
   for (int i = p < m ? m - p : 0; i < m - 1; i++) {
     uc32 c = pattern[i];
-    if (sizeof(schar) == 1 && c > 255) return -1;
+    if (sizeof(schar) == 1 &&
+        sizeof(pchar) > 1 &&
+        c > String::kMaxAsciiCharCode) {
+      return -1;
+    }
     bad_char_map[c & kBMHSignificantBitsMask] = m - 1 - i;
   }
 
   for (int i = start_index + m - 1, j = m - 1; i < n;) {
     schar c = subject[i];
     if (c == pattern[j]) {
       if (j == 0) {
         return i;
       }
       j--;
@@ skipping 4157 matching lines @@
 
 void Runtime::PerformGC(Object* result) {
   Failure* failure = Failure::cast(result);
   // Try to do a garbage collection; ignore it if it fails. The C
   // entry stub will throw an out-of-memory exception in that case.
   Heap::CollectGarbage(failure->requested(), failure->allocation_space());
 }
 
 
 } }  // namespace v8::internal