Home
last modified time | relevance | path

Searched refs:RegExpBytecodeLength (Results 1 – 4 of 4) sorted by relevance

/third_party/node/deps/v8/src/regexp/
Dregexp-bytecodes.cc19 for (int i = 0; i < RegExpBytecodeLength(bytecode); i++) { in RegExpBytecodeDisassembleSingle()
25 for (int i = 1; i < RegExpBytecodeLength(bytecode); i++) { in RegExpBytecodeDisassembleSingle()
42 offset += RegExpBytecodeLength(*pc); in RegExpBytecodeDisassemble()
Dregexp-bytecode-peephole.cc296 new_node->start_offset_ = start_offset_ + RegExpBytecodeLength(bytecode_); in FollowedBy()
322 DCHECK_LT(argument_offset, RegExpBytecodeLength(ref_node.bytecode_)); in MapArgument()
337 DCHECK_LT(argument_offset, RegExpBytecodeLength(bytecode_)); in IfArgumentEqualsOffset()
353 DCHECK_LT(argument_offset, RegExpBytecodeLength(bytecode_)); in IfArgumentEqualsValueAtOffset()
359 DCHECK_LT(other_argument_offset, RegExpBytecodeLength(ref_node.bytecode_)); in IfArgumentEqualsValueAtOffset()
379 DCHECK_LT(argument_offset, RegExpBytecodeLength(ref_node.bytecode_)); in IgnoreArgument()
413 return start_offset_ + RegExpBytecodeLength(bytecode_); in SequenceLength()
631 int bc_len = RegExpBytecodeLength(bc); in OptimizeBytecode()
673 current_pc += RegExpBytecodeLength(bytecode[current_pc]); in TryOptimizeSequence()
722 RegExpBytecodeLength(last_node.OptimizedBytecode())); in EmitOptimization()
[all …]
Dregexp-bytecodes.h237 inline constexpr int RegExpBytecodeLength(int bytecode) { in RegExpBytecodeLength() function
Dregexp-interpreter.cc360 next_pc = pc + RegExpBytecodeLength(BC_##name); \
378 current_char, RegExpBytecodeLength(BC_##name), #name);