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 226 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
237 // Called from RegExp if the backtrack stack limit is hit. | 237 // Called from RegExp if the backtrack stack limit is hit. |
238 // Tries to expand the stack. Returns the new stack-pointer if | 238 // Tries to expand the stack. Returns the new stack-pointer if |
239 // successful, and updates the stack_top address, or returns 0 if unable | 239 // successful, and updates the stack_top address, or returns 0 if unable |
240 // to grow the stack. | 240 // to grow the stack. |
241 // This function must not trigger a garbage collection. | 241 // This function must not trigger a garbage collection. |
242 static Address GrowStack(Address stack_pointer, Address* stack_top, | 242 static Address GrowStack(Address stack_pointer, Address* stack_top, |
243 Isolate* isolate); | 243 Isolate* isolate); |
244 | 244 |
245 static const byte* StringCharacterPosition(String* subject, int start_index); | 245 static const byte* StringCharacterPosition(String* subject, int start_index); |
246 | 246 |
247 // Byte map of ASCII characters with a 0xff if the character is a word | 247 // Byte map of one byte characters with a 0xff if the character is a word |
248 // character (digit, letter or underscore) and 0x00 otherwise. | 248 // character (digit, letter or underscore) and 0x00 otherwise. |
249 // Used by generated RegExp code. | 249 // Used by generated RegExp code. |
250 static const byte word_character_map[128]; | 250 static const byte word_character_map[256]; |
251 | 251 |
252 static Address word_character_map_address() { | 252 static Address word_character_map_address() { |
253 return const_cast<Address>(&word_character_map[0]); | 253 return const_cast<Address>(&word_character_map[0]); |
254 } | 254 } |
255 | 255 |
256 static Result Execute(Code* code, | 256 static Result Execute(Code* code, |
257 String* input, | 257 String* input, |
258 int start_offset, | 258 int start_offset, |
259 const byte* input_start, | 259 const byte* input_start, |
260 const byte* input_end, | 260 const byte* input_end, |
261 int* output, | 261 int* output, |
262 int output_size, | 262 int output_size, |
263 Isolate* isolate); | 263 Isolate* isolate); |
264 }; | 264 }; |
265 | 265 |
266 #endif // V8_INTERPRETED_REGEXP | 266 #endif // V8_INTERPRETED_REGEXP |
267 | 267 |
268 } } // namespace v8::internal | 268 } } // namespace v8::internal |
269 | 269 |
270 #endif // V8_REGEXP_MACRO_ASSEMBLER_H_ | 270 #endif // V8_REGEXP_MACRO_ASSEMBLER_H_ |
OLD | NEW |