OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 4929 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4940 __ And(scratch1, scratch1, Operand(HeapNumber::kSignMask)); | 4940 __ And(scratch1, scratch1, Operand(HeapNumber::kSignMask)); |
4941 DeoptimizeIf(ne, instr->environment(), scratch1, Operand(zero_reg)); | 4941 DeoptimizeIf(ne, instr->environment(), scratch1, Operand(zero_reg)); |
4942 __ bind(&done); | 4942 __ bind(&done); |
4943 } | 4943 } |
4944 } | 4944 } |
4945 __ SmiTagCheckOverflow(result_reg, result_reg, scratch1); | 4945 __ SmiTagCheckOverflow(result_reg, result_reg, scratch1); |
4946 DeoptimizeIf(lt, instr->environment(), scratch1, Operand(zero_reg)); | 4946 DeoptimizeIf(lt, instr->environment(), scratch1, Operand(zero_reg)); |
4947 } | 4947 } |
4948 | 4948 |
4949 | 4949 |
4950 void LCodeGen::DoCheckSmiAndReturn(LCheckSmiAndReturn* instr) { | |
4951 LOperand* input = instr->value(); | |
4952 __ And(at, ToRegister(input), Operand(kSmiTagMask)); | |
4953 DeoptimizeIf(ne, instr->environment(), at, Operand(zero_reg)); | |
4954 } | |
4955 | |
4956 | |
4957 void LCodeGen::DoCheckSmi(LCheckSmi* instr) { | 4950 void LCodeGen::DoCheckSmi(LCheckSmi* instr) { |
4958 LOperand* input = instr->value(); | 4951 LOperand* input = instr->value(); |
4959 __ And(at, ToRegister(input), Operand(kSmiTagMask)); | 4952 __ And(at, ToRegister(input), Operand(kSmiTagMask)); |
4960 DeoptimizeIf(ne, instr->environment(), at, Operand(zero_reg)); | 4953 DeoptimizeIf(ne, instr->environment(), at, Operand(zero_reg)); |
4961 } | 4954 } |
4962 | 4955 |
4963 | 4956 |
4964 void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) { | 4957 void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) { |
4965 LOperand* input = instr->value(); | 4958 LOperand* input = instr->value(); |
4966 __ And(at, ToRegister(input), Operand(kSmiTagMask)); | 4959 __ And(at, ToRegister(input), Operand(kSmiTagMask)); |
(...skipping 785 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5752 __ Subu(scratch, result, scratch); | 5745 __ Subu(scratch, result, scratch); |
5753 __ lw(result, FieldMemOperand(scratch, | 5746 __ lw(result, FieldMemOperand(scratch, |
5754 FixedArray::kHeaderSize - kPointerSize)); | 5747 FixedArray::kHeaderSize - kPointerSize)); |
5755 __ bind(&done); | 5748 __ bind(&done); |
5756 } | 5749 } |
5757 | 5750 |
5758 | 5751 |
5759 #undef __ | 5752 #undef __ |
5760 | 5753 |
5761 } } // namespace v8::internal | 5754 } } // namespace v8::internal |
OLD | NEW |