Home | History | Annotate | Download | only in arm

Lines Matching full:right

129   if (m.right().IsInRange(1, 31)) {
131 *shift_return = g.UseImmediate(m.right().node());
134 *shift_return = g.UseRegister(m.right().node());
148 if (m.right().IsInRange(1, 32)) {
150 *shift_return = g.UseImmediate(m.right().node());
153 *shift_return = g.UseRegister(m.right().node());
167 if (m.right().IsInRange(0, 31)) {
169 *shift_return = g.UseImmediate(m.right().node());
172 *shift_return = g.UseRegister(m.right().node());
186 if (m.right().IsInRange(1, 32)) {
188 *shift_return = g.UseImmediate(m.right().node());
191 *shift_return = g.UseRegister(m.right().node());
239 if (TryMatchImmediateOrShift(selector, &opcode, m.right().node(),
246 inputs[0] = g.UseRegister(m.right().node());
252 inputs[input_count++] = g.UseRegister(m.right().node());
381 Node* left, Node* right) {
386 if (TryMatchShift(selector, &opcode, right, &value_operand, &shift_operand)) {
393 g.UseRegister(right));
402 if (mleft.right().Is(-1)) {
403 EmitBic(this, node, m.right().node(), mleft.left().node());
407 if (m.right().IsWord32Xor() && CanCover(node, m.right().node())) {
408 Int32BinopMatcher mright(m.right().node());
409 if (mright.right().Is(-1)) {
414 if (IsSupported(ARMv7) && m.right().HasValue()) {
415 uint32_t value = m.right().Value();
422 if (mleft.right().IsInRange(0, 31)) {
425 g.UseImmediate(mleft.right().node()), g.TempImmediate(width));
455 if (m.right().Is(-1)) {
524 m.right().IsInRange(0, 31)) {
525 int32_t lsb = m.right().Value();
527 if (mleft.right().HasValue()) {
528 uint32_t value = (mleft.right().Value() >> lsb) << lsb;
560 g.UseRegister(mleft.right().node()), g.UseRegister(m.right().node()));
563 if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) {
564 Int32BinopMatcher mright(m.right().node());
566 g.UseRegister(mright.right().node()), g.UseRegister(m.left().node()));
576 if (IsSupported(MLS) && m.right().IsInt32Mul() &&
577 CanCover(node, m.right().node())) {
578 Int32BinopMatcher mright(m.right().node());
580 g.UseRegister(mright.right().node()), g.UseRegister(m.left().node()));
590 if (m.right().HasValue() && m.right().Value() > 0) {
591 int32_t value = m.right().Value();
608 g.UseRegister(m.right().node()));
640 g.UseRegister(m.right().node()));
662 InstructionOperand* right_operand = g.UseRegister(m.right().node());
720 g.UseRegister(m.right().node()), g.UseRegister(mleft.left().node()),
721 g.UseRegister(mleft.right().node()));
724 if (m.right().IsFloat64Mul() && CanCover(node, m.right().node())) {
725 Int32BinopMatcher mright(m.right().node());
728 g.UseRegister(mright.right().node()));
738 if (m.right().IsFloat64Mul() && CanCover(node, m.right().node())) {
739 Int32BinopMatcher mright(m.right().node());
742 g.UseRegister(mright.right().node()));
752 if (m.right().Is(-1.0)) {
856 if (TryMatchImmediateOrShift(selector, &opcode, m.right().node(),
863 inputs[0] = g.UseRegister(m.right().node());
868 inputs[input_count++] = g.UseRegister(m.right().node());
939 g.UseRegister(m.right().node()), g.Label(cont->true_block()),
944 g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));