Rename IsAsciiRepresentation

src/handles.cc

 // Copyright 2012 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 897 matching lines @@
                      int from,
                      int to,
                      bool followed_by_surrogate,
                      int max_recursion,
                      bool* failure,
                      bool* starts_with_surrogate) {
   if (from == to) return 0;
   int total = 0;
   bool dummy;
   while (true) {
-    if (input->IsAsciiRepresentation()) {
+    if (input->IsOneByteRepresentation()) {
       *starts_with_surrogate = false;
       return total + to - from;
     }
     switch (StringShape(input).representation_tag()) {
       case kConsStringTag: {
         ConsString* str = ConsString::cast(input);
         String* first = str->first();
         String* second = str->second();
         int first_length = first->length();
         if (first_length - from > to - first_length) {
@@ skipping 12 matching lines @@
             followed_by_surrogate = right_starts_with_surrogate;
             input = first;
             to = first_length;
           } else {
             // We only need the left hand side.
             input = first;
           }
         } else {
           if (first_length > from) {
             // Left hand side is shorter.
-            if (first->IsAsciiRepresentation()) {
+            if (first->IsOneByteRepresentation()) {
               total += first_length - from;
               *starts_with_surrogate = false;
               starts_with_surrogate = &dummy;
               input = second;
               from = 0;
               to -= first_length;
-            } else if (second->IsAsciiRepresentation()) {
+            } else if (second->IsOneByteRepresentation()) {
               followed_by_surrogate = false;
               total += to - first_length;
               input = first;
               to = first_length;
             } else if (max_recursion > 0) {
               bool right_starts_with_surrogate = false;
               // Recursing on the long one.  This may fail.
               total += Utf8LengthHelper(second,
                                         0,
                                         to - first_length,
@@ skipping 108 matching lines @@
   data->next = prev_next_;
   data->limit = prev_limit_;
 #ifdef DEBUG
   handles_detached_ = true;
 #endif
   return deferred;
 }
 
 
 } }  // namespace v8::internal