| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 95 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 106 int* offsets_vector, | 106 int* offsets_vector, |
| 107 int offsets_vector_length, | 107 int offsets_vector_length, |
| 108 int previous_index, | 108 int previous_index, |
| 109 Isolate* isolate) { | 109 Isolate* isolate) { |
| 110 | 110 |
| 111 ASSERT(subject->IsFlat()); | 111 ASSERT(subject->IsFlat()); |
| 112 ASSERT(previous_index >= 0); | 112 ASSERT(previous_index >= 0); |
| 113 ASSERT(previous_index <= subject->length()); | 113 ASSERT(previous_index <= subject->length()); |
| 114 | 114 |
| 115 // No allocations before calling the regexp, but we can't use | 115 // No allocations before calling the regexp, but we can't use |
| 116 // AssertNoAllocation, since regexps might be preempted, and another thread | 116 // DisallowHeapAllocation, since regexps might be preempted, and another |
| 117 // might do allocation anyway. | 117 // thread might do allocation anyway. |
| 118 | 118 |
| 119 String* subject_ptr = *subject; | 119 String* subject_ptr = *subject; |
| 120 // Character offsets into string. | 120 // Character offsets into string. |
| 121 int start_offset = previous_index; | 121 int start_offset = previous_index; |
| 122 int char_length = subject_ptr->length() - start_offset; | 122 int char_length = subject_ptr->length() - start_offset; |
| 123 int slice_offset = 0; | 123 int slice_offset = 0; |
| 124 | 124 |
| 125 // The string has been flattened, so if it is a cons string it contains the | 125 // The string has been flattened, so if it is a cons string it contains the |
| 126 // full string in the first part. | 126 // full string in the first part. |
| 127 if (StringShape(subject_ptr).IsCons()) { | 127 if (StringShape(subject_ptr).IsCons()) { |
| (...skipping 155 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 283 return NULL; | 283 return NULL; |
| 284 } | 284 } |
| 285 *stack_base = new_stack_base; | 285 *stack_base = new_stack_base; |
| 286 intptr_t stack_content_size = old_stack_base - stack_pointer; | 286 intptr_t stack_content_size = old_stack_base - stack_pointer; |
| 287 return new_stack_base - stack_content_size; | 287 return new_stack_base - stack_content_size; |
| 288 } | 288 } |
| 289 | 289 |
| 290 #endif // V8_INTERPRETED_REGEXP | 290 #endif // V8_INTERPRETED_REGEXP |
| 291 | 291 |
| 292 } } // namespace v8::internal | 292 } } // namespace v8::internal |
| OLD | NEW |