OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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 #ifndef V8_REGEXP_PPC_REGEXP_MACRO_ASSEMBLER_PPC_H_ | 5 #ifndef V8_REGEXP_PPC_REGEXP_MACRO_ASSEMBLER_PPC_H_ |
6 #define V8_REGEXP_PPC_REGEXP_MACRO_ASSEMBLER_PPC_H_ | 6 #define V8_REGEXP_PPC_REGEXP_MACRO_ASSEMBLER_PPC_H_ |
7 | 7 |
8 #include "src/macro-assembler.h" | 8 #include "src/macro-assembler.h" |
9 #include "src/ppc/assembler-ppc.h" | 9 #include "src/ppc/assembler-ppc.h" |
10 #include "src/ppc/frames-ppc.h" | 10 #include "src/ppc/frames-ppc.h" |
(...skipping 20 matching lines...) Expand all Loading... |
31 Label* on_equal); | 31 Label* on_equal); |
32 virtual void CheckCharacterGT(uc16 limit, Label* on_greater); | 32 virtual void CheckCharacterGT(uc16 limit, Label* on_greater); |
33 virtual void CheckCharacterLT(uc16 limit, Label* on_less); | 33 virtual void CheckCharacterLT(uc16 limit, Label* on_less); |
34 // A "greedy loop" is a loop that is both greedy and with a simple | 34 // A "greedy loop" is a loop that is both greedy and with a simple |
35 // body. It has a particularly simple implementation. | 35 // body. It has a particularly simple implementation. |
36 virtual void CheckGreedyLoop(Label* on_tos_equals_current_position); | 36 virtual void CheckGreedyLoop(Label* on_tos_equals_current_position); |
37 virtual void CheckNotAtStart(int cp_offset, Label* on_not_at_start); | 37 virtual void CheckNotAtStart(int cp_offset, Label* on_not_at_start); |
38 virtual void CheckNotBackReference(int start_reg, bool read_backward, | 38 virtual void CheckNotBackReference(int start_reg, bool read_backward, |
39 Label* on_no_match); | 39 Label* on_no_match); |
40 virtual void CheckNotBackReferenceIgnoreCase(int start_reg, | 40 virtual void CheckNotBackReferenceIgnoreCase(int start_reg, |
41 bool read_backward, | 41 bool read_backward, bool unicode, |
42 Label* on_no_match); | 42 Label* on_no_match); |
43 virtual void CheckNotCharacter(unsigned c, Label* on_not_equal); | 43 virtual void CheckNotCharacter(unsigned c, Label* on_not_equal); |
44 virtual void CheckNotCharacterAfterAnd(unsigned c, unsigned mask, | 44 virtual void CheckNotCharacterAfterAnd(unsigned c, unsigned mask, |
45 Label* on_not_equal); | 45 Label* on_not_equal); |
46 virtual void CheckNotCharacterAfterMinusAnd(uc16 c, uc16 minus, uc16 mask, | 46 virtual void CheckNotCharacterAfterMinusAnd(uc16 c, uc16 minus, uc16 mask, |
47 Label* on_not_equal); | 47 Label* on_not_equal); |
48 virtual void CheckCharacterInRange(uc16 from, uc16 to, Label* on_in_range); | 48 virtual void CheckCharacterInRange(uc16 from, uc16 to, Label* on_in_range); |
49 virtual void CheckCharacterNotInRange(uc16 from, uc16 to, | 49 virtual void CheckCharacterNotInRange(uc16 from, uc16 to, |
50 Label* on_not_in_range); | 50 Label* on_not_in_range); |
51 virtual void CheckBitInTable(Handle<ByteArray> table, Label* on_bit_set); | 51 virtual void CheckBitInTable(Handle<ByteArray> table, Label* on_bit_set); |
(...skipping 155 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
207 | 207 |
208 // Set of non-volatile registers saved/restored by generated regexp code. | 208 // Set of non-volatile registers saved/restored by generated regexp code. |
209 const RegList kRegExpCalleeSaved = | 209 const RegList kRegExpCalleeSaved = |
210 1 << 25 | 1 << 26 | 1 << 27 | 1 << 28 | 1 << 29 | 1 << 30 | 1 << 31; | 210 1 << 25 | 1 << 26 | 1 << 27 | 1 << 28 | 1 << 29 | 1 << 30 | 1 << 31; |
211 | 211 |
212 #endif // V8_INTERPRETED_REGEXP | 212 #endif // V8_INTERPRETED_REGEXP |
213 } // namespace internal | 213 } // namespace internal |
214 } // namespace v8 | 214 } // namespace v8 |
215 | 215 |
216 #endif // V8_REGEXP_PPC_REGEXP_MACRO_ASSEMBLER_PPC_H_ | 216 #endif // V8_REGEXP_PPC_REGEXP_MACRO_ASSEMBLER_PPC_H_ |
OLD | NEW |