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 5235 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5246 deferred = new(zone()) DeferredCheckMaps(this, instr, reg); | 5246 deferred = new(zone()) DeferredCheckMaps(this, instr, reg); |
5247 __ bind(deferred->check_maps()); | 5247 __ bind(deferred->check_maps()); |
5248 } | 5248 } |
5249 | 5249 |
5250 Label success; | 5250 Label success; |
5251 for (int i = 0; i < map_set->length() - 1; i++) { | 5251 for (int i = 0; i < map_set->length() - 1; i++) { |
5252 Handle<Map> map = map_set->at(i); | 5252 Handle<Map> map = map_set->at(i); |
5253 __ CompareMapAndBranch(map_reg, map, &success, eq, &success); | 5253 __ CompareMapAndBranch(map_reg, map, &success, eq, &success); |
5254 } | 5254 } |
5255 Handle<Map> map = map_set->last(); | 5255 Handle<Map> map = map_set->last(); |
5256 __ CompareMapAndBranch(map_reg, map, &success, eq, &success); | 5256 // Do the CompareMap() directly within the Branch() and DeoptimizeIf(). |
5257 if (instr->hydrogen()->has_migration_target()) { | 5257 if (instr->hydrogen()->has_migration_target()) { |
5258 __ Branch(deferred->entry()); | 5258 __ Branch(deferred->entry(), ne, map_reg, Operand(map)); |
5259 } else { | 5259 } else { |
5260 DeoptimizeIf(al, instr->environment()); | 5260 DeoptimizeIf(ne, instr->environment(), map_reg, Operand(map)); |
5261 } | 5261 } |
5262 | 5262 |
5263 __ bind(&success); | 5263 __ bind(&success); |
5264 } | 5264 } |
5265 | 5265 |
5266 | 5266 |
5267 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { | 5267 void LCodeGen::DoClampDToUint8(LClampDToUint8* instr) { |
5268 DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); | 5268 DoubleRegister value_reg = ToDoubleRegister(instr->unclamped()); |
5269 Register result_reg = ToRegister(instr->result()); | 5269 Register result_reg = ToRegister(instr->result()); |
5270 DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); | 5270 DoubleRegister temp_reg = ToDoubleRegister(instr->temp()); |
(...skipping 594 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5865 __ Subu(scratch, result, scratch); | 5865 __ Subu(scratch, result, scratch); |
5866 __ lw(result, FieldMemOperand(scratch, | 5866 __ lw(result, FieldMemOperand(scratch, |
5867 FixedArray::kHeaderSize - kPointerSize)); | 5867 FixedArray::kHeaderSize - kPointerSize)); |
5868 __ bind(&done); | 5868 __ bind(&done); |
5869 } | 5869 } |
5870 | 5870 |
5871 | 5871 |
5872 #undef __ | 5872 #undef __ |
5873 | 5873 |
5874 } } // namespace v8::internal | 5874 } } // namespace v8::internal |
OLD | NEW |