| 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 4924 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4935 void LCodeGen::DoCheckMaps(LCheckMaps* instr) { | 4935 void LCodeGen::DoCheckMaps(LCheckMaps* instr) { |
| 4936 Register scratch = scratch0(); | 4936 Register scratch = scratch0(); |
| 4937 LOperand* input = instr->value(); | 4937 LOperand* input = instr->value(); |
| 4938 ASSERT(input->IsRegister()); | 4938 ASSERT(input->IsRegister()); |
| 4939 Register reg = ToRegister(input); | 4939 Register reg = ToRegister(input); |
| 4940 | 4940 |
| 4941 Label success; | 4941 Label success; |
| 4942 SmallMapList* map_set = instr->hydrogen()->map_set(); | 4942 SmallMapList* map_set = instr->hydrogen()->map_set(); |
| 4943 for (int i = 0; i < map_set->length() - 1; i++) { | 4943 for (int i = 0; i < map_set->length() - 1; i++) { |
| 4944 Handle<Map> map = map_set->at(i); | 4944 Handle<Map> map = map_set->at(i); |
| 4945 __ CompareMap(reg, scratch, map, &success, instr->hydrogen()->mode()); | 4945 __ CompareMap(reg, scratch, map, &success, REQUIRE_EXACT_MAP); |
| 4946 __ b(eq, &success); | 4946 __ b(eq, &success); |
| 4947 } | 4947 } |
| 4948 Handle<Map> map = map_set->last(); | 4948 Handle<Map> map = map_set->last(); |
| 4949 DoCheckMapCommon(reg, scratch, map, instr->hydrogen()->mode(), | 4949 DoCheckMapCommon(reg, scratch, map, REQUIRE_EXACT_MAP, instr->environment()); |
| 4950 instr->environment()); | |
| 4951 __ bind(&success); | 4950 __ bind(&success); |
| 4952 } | 4951 } |
| 4953 | 4952 |
| 4954 | 4953 |
| 4955 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { | 4954 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { |
| 4956 DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); | 4955 DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); |
| 4957 Register result_reg = ToRegister(instr->result()); | 4956 Register result_reg = ToRegister(instr->result()); |
| 4958 DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); | 4957 DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); |
| 4959 __ ClampDoubleToUint8(result_reg, value_reg, temp_reg); | 4958 __ ClampDoubleToUint8(result_reg, value_reg, temp_reg); |
| 4960 } | 4959 } |
| (...skipping 811 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5772 __ sub(scratch, result, Operand(index, LSL, kPointerSizeLog2 - kSmiTagSize)); | 5771 __ sub(scratch, result, Operand(index, LSL, kPointerSizeLog2 - kSmiTagSize)); |
| 5773 __ ldr(result, FieldMemOperand(scratch, | 5772 __ ldr(result, FieldMemOperand(scratch, |
| 5774 FixedArray::kHeaderSize - kPointerSize)); | 5773 FixedArray::kHeaderSize - kPointerSize)); |
| 5775 __ bind(&done); | 5774 __ bind(&done); |
| 5776 } | 5775 } |
| 5777 | 5776 |
| 5778 | 5777 |
| 5779 #undef __ | 5778 #undef __ |
| 5780 | 5779 |
| 5781 } } // namespace v8::internal | 5780 } } // namespace v8::internal |
| OLD | NEW |