Fix windows build again: one more memchr call.

src/runtime.cc

 // Copyright 2006-2009 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 2428 matching lines @@
 }
 
 // Simple indexOf that never bails out. For short patterns only.
 template <typename pchar, typename schar>
 static int SimpleIndexOf(Vector<const schar> subject,
                          Vector<const pchar> pattern,
                          int idx) {
   pchar pattern_first_char = pattern[0];
   for (int i = idx, n = subject.length() - pattern.length(); i <= n; i++) {
     if (sizeof(schar) == 1 && sizeof(pchar) == 1) {
-      schar* pos = reinterpret_cast<schar*>(memchr(subject.start() + i,
-                                                   pattern_first_char,
-                                                   n - i + 1));
+      const schar* pos = reinterpret_cast<const schar*>(
+          memchr(subject.start() + i,
+                 pattern_first_char,
+                 n - i + 1));
       if (pos == NULL) return -1;
       i = pos - subject.start();
     } else {
       if (subject[i] != pattern_first_char) continue;
     }
     int j = 1;
     do {
       if (pattern[j] != subject[i+j]) {
         break;
       }
@@ skipping 6939 matching lines @@
   } else {
     // Handle last resort GC and make sure to allow future allocations
     // to grow the heap without causing GCs (if possible).
     Counters::gc_last_resort_from_js.Increment();
     Heap::CollectAllGarbage(false);
   }
 }
 
 
 } }  // namespace v8::internal