Lines Matching defs:length
22 int length;
24 BytecodeArgument(int offset, int length) : offset(offset), length(length) {}
30 BytecodeArgumentMapping(int offset, int length, int new_length)
31 : BytecodeArgument(offset, length), new_length(new_length) {}
40 BytecodeArgumentCheck(int offset, int length, int check_offset)
41 : BytecodeArgument(offset, length),
44 BytecodeArgumentCheck(int offset, int length, int check_offset,
46 : BytecodeArgument(offset, length),
122 // Returns the length of the sequence in bytes.
179 bool OptimizeBytecode(const byte* bytecode, int length);
191 // the internal buffer. Returns the length of replaced bytecodes in bytes.
220 void CopyRangeToOutput(const byte* orig_bytecode, int start, int length);
263 int32_t GetArgumentValue(const byte* bytecode, int offset, int length) {
264 switch (length) {
394 GetArgumentValue(bytecode, pc + check_iter->offset, check_iter->length);
620 int length) {
624 while (old_pc < length) {
625 int replaced_len = TryOptimizeSequence(bytecode, length, old_pc);
786 // fixed relative to the length of the optimized sequence including
920 int start, int length) {
925 orig_bytecode + start + length);
938 switch (arg.length) {
940 DCHECK_EQ(arg.new_length, arg.length);
944 DCHECK_EQ(arg.new_length, arg.length);
986 DCHECK_EQ(arg.new_length, arg.length);
990 DCHECK_EQ(arg.new_length, arg.length);
995 std::min(arg.length, arg.new_length));
996 if (arg.length < arg.new_length) {
997 SetRange(0x00, arg.new_length - arg.length);
1015 int length, const ZoneUnorderedMap<int, int>& jump_edges) {
1016 RegExpBytecodePeephole peephole(zone, length, jump_edges);
1017 bool did_optimize = peephole.OptimizeBytecode(bytecode, length);
1023 RegExpBytecodeDisassemble(bytecode, length, source->ToCString().get());