Lines Matching refs:left
286 // For shorter pattern matching code, this struct matches both the left and
288 // if they appear on the left hand side of a commutative operation.
303 const Left& left() const { return left_; }
307 return left().HasResolvedValue() && right().HasResolvedValue();
309 bool LeftEqualsRight() const { return left().node() == right().node(); }
326 node()->ReplaceInput(0, left().node());
332 if (left().HasResolvedValue() && !right().HasResolvedValue()) {
436 return this->left().node()->InputAt(0);
446 Matcher left_matcher(this->left().node(), true);
465 if ((this->left().opcode() != kSubOpcode &&
466 this->left().opcode() != kAddOpcode) &&
555 Node* left = m.left().node();
564 if (m.HasIndexInput() && OwnedByAddressingOperand(left)) {
567 scale_expression = left;
575 base = right_matcher.left().node();
587 base = right_matcher.left().node();
603 if (left->opcode() == AddMatcher::kSubOpcode &&
604 OwnedByAddressingOperand(left)) {
605 AddMatcher left_matcher(left);
606 Node* left_left = left_matcher.left().node();
630 if (left->opcode() == AddMatcher::kAddOpcode &&
631 OwnedByAddressingOperand(left)) {
632 AddMatcher left_matcher(left);
633 Node* left_left = left_matcher.left().node();
646 if (left->OwnedBy(node)) {
656 base = left;
661 index = left;
671 if (left->OwnedBy(node)) {
678 base = left;
683 index = left;
690 base = left;
694 base = left;