| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 | 5 |
| 6 #ifndef V8_REGEXP_JSREGEXP_INL_H_ | 6 #ifndef V8_REGEXP_JSREGEXP_INL_H_ |
| 7 #define V8_REGEXP_JSREGEXP_INL_H_ | 7 #define V8_REGEXP_JSREGEXP_INL_H_ |
| 8 | 8 |
| 9 #include "src/allocation.h" | 9 #include "src/allocation.h" |
| 10 #include "src/handles.h" | 10 #include "src/handles.h" |
| (...skipping 60 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 71 int32_t* RegExpImpl::GlobalCache::LastSuccessfulMatch() { | 71 int32_t* RegExpImpl::GlobalCache::LastSuccessfulMatch() { |
| 72 int index = current_match_index_ * registers_per_match_; | 72 int index = current_match_index_ * registers_per_match_; |
| 73 if (num_matches_ == 0) { | 73 if (num_matches_ == 0) { |
| 74 // After a failed match we shift back by one result. | 74 // After a failed match we shift back by one result. |
| 75 index -= registers_per_match_; | 75 index -= registers_per_match_; |
| 76 } | 76 } |
| 77 return ®ister_array_[index]; | 77 return ®ister_array_[index]; |
| 78 } | 78 } |
| 79 | 79 |
| 80 | 80 |
| 81 } } // namespace v8::internal | 81 } // namespace internal |
| 82 } // namespace v8 |
| 82 | 83 |
| 83 #endif // V8_REGEXP_JSREGEXP_INL_H_ | 84 #endif // V8_REGEXP_JSREGEXP_INL_H_ |
| OLD | NEW |