Lines Matching full:last
77 // An action shouldn't leave a NOP as last bytecode unless it has
87 // The rules for allowing the elision of the last bytecode based
102 // expression positions. Whenever the last bytecode is elided it's
106 // The last bytecode could be elided for the MAYBE cases if the last
121 Bytecode new_bytecode, BytecodeNode* const last,
123 DCHECK_EQ(last->bytecode(), Bytecode::kLdaSmi);
124 BytecodeNode node(new_bytecode, last->operand(0), current->operand(0),
126 if (last->source_info().is_valid()) {
127 node.set_source_info(last->source_info());
133 Bytecode new_bytecode, BytecodeNode* const last,
135 DCHECK_EQ(last->bytecode(), Bytecode::kLdaZero);
138 if (last->source_info().is_valid()) {
139 node.set_source_info(last->source_info());
145 BytecodeNode* const last,
147 DCHECK((last->bytecode() == Bytecode::kLdaNull) ||
148 (last->bytecode() == Bytecode::kLdaUndefined));
152 if (last->source_info().is_valid()) {
153 node.set_source_info(last->source_info());
165 next_stage()->Write(last());
198 // Nothing to do, keep last and wait for next bytecode to pair with it.
207 if (last()->operand(0) == node->operand(0)) {
220 if (last()->source_info().is_valid()) {
222 // position of last() is valid (per rules in
224 node->set_source_info(last()->source_info());
246 if (!node->source_info().is_valid() || !last()->source_info().is_valid()) {
247 // Fused last and current into current.
249 action_data->bytecode, last(), node));
261 if (!node->source_info().is_valid() || !last()->source_info().is_valid()) {
262 // Fused last and current into current.
264 action_data->bytecode, last(), node));
275 // Fused last and current into current.
277 action_data->bytecode, last(), node));
286 next_stage()->Write(last());
301 next_stage()->Write(last());
312 next_stage()->Write(last());
314 node->set_source_info(last()->source_info());
326 PeepholeActionTable::Lookup(last()->bytecode(), node->bytecode());
