| 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 4868 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4879 void LCodeGen::DoCheckMaps(LCheckMaps* instr) { | 4879 void LCodeGen::DoCheckMaps(LCheckMaps* instr) { |
| 4880 Register scratch = scratch0(); | 4880 Register scratch = scratch0(); |
| 4881 LOperand* input = instr->value(); | 4881 LOperand* input = instr->value(); |
| 4882 ASSERT(input->IsRegister()); | 4882 ASSERT(input->IsRegister()); |
| 4883 Register reg = ToRegister(input); | 4883 Register reg = ToRegister(input); |
| 4884 | 4884 |
| 4885 Label success; | 4885 Label success; |
| 4886 SmallMapList* map_set = instr->hydrogen()->map_set(); | 4886 SmallMapList* map_set = instr->hydrogen()->map_set(); |
| 4887 for (int i = 0; i < map_set->length() - 1; i++) { | 4887 for (int i = 0; i < map_set->length() - 1; i++) { |
| 4888 Handle<Map> map = map_set->at(i); | 4888 Handle<Map> map = map_set->at(i); |
| 4889 __ CompareMap(reg, scratch, map, &success, REQUIRE_EXACT_MAP); | 4889 __ CompareMap(reg, scratch, map, &success, instr->hydrogen()->mode()); |
| 4890 __ b(eq, &success); | 4890 __ b(eq, &success); |
| 4891 } | 4891 } |
| 4892 Handle<Map> map = map_set->last(); | 4892 Handle<Map> map = map_set->last(); |
| 4893 DoCheckMapCommon(reg, scratch, map, REQUIRE_EXACT_MAP, instr->environment()); | 4893 DoCheckMapCommon(reg, scratch, map, instr->hydrogen()->mode(), |
| 4894 instr->environment()); |
| 4894 __ bind(&success); | 4895 __ bind(&success); |
| 4895 } | 4896 } |
| 4896 | 4897 |
| 4897 | 4898 |
| 4898 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { | 4899 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { |
| 4899 DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); | 4900 DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); |
| 4900 Register result_reg = ToRegister(instr->result()); | 4901 Register result_reg = ToRegister(instr->result()); |
| 4901 DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); | 4902 DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); |
| 4902 __ ClampDoubleToUint8(result_reg, value_reg, temp_reg); | 4903 __ ClampDoubleToUint8(result_reg, value_reg, temp_reg); |
| 4903 } | 4904 } |
| (...skipping 811 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5715 __ sub(scratch, result, Operand(index, LSL, kPointerSizeLog2 - kSmiTagSize)); | 5716 __ sub(scratch, result, Operand(index, LSL, kPointerSizeLog2 - kSmiTagSize)); |
| 5716 __ ldr(result, FieldMemOperand(scratch, | 5717 __ ldr(result, FieldMemOperand(scratch, |
| 5717 FixedArray::kHeaderSize - kPointerSize)); | 5718 FixedArray::kHeaderSize - kPointerSize)); |
| 5718 __ bind(&done); | 5719 __ bind(&done); |
| 5719 } | 5720 } |
| 5720 | 5721 |
| 5721 | 5722 |
| 5722 #undef __ | 5723 #undef __ |
| 5723 | 5724 |
| 5724 } } // namespace v8::internal | 5725 } } // namespace v8::internal |
| OLD | NEW |