| 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 1982 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 1993   } | 1993   } | 
| 1994 } | 1994 } | 
| 1995 | 1995 | 
| 1996 | 1996 | 
| 1997 void LCodeGen::DoArithmeticT(LArithmeticT* instr) { | 1997 void LCodeGen::DoArithmeticT(LArithmeticT* instr) { | 
| 1998   ASSERT(ToRegister(instr->context()).is(cp)); | 1998   ASSERT(ToRegister(instr->context()).is(cp)); | 
| 1999   ASSERT(ToRegister(instr->left()).is(a1)); | 1999   ASSERT(ToRegister(instr->left()).is(a1)); | 
| 2000   ASSERT(ToRegister(instr->right()).is(a0)); | 2000   ASSERT(ToRegister(instr->right()).is(a0)); | 
| 2001   ASSERT(ToRegister(instr->result()).is(v0)); | 2001   ASSERT(ToRegister(instr->result()).is(v0)); | 
| 2002 | 2002 | 
| 2003   BinaryOpStub stub(instr->op(), NO_OVERWRITE); | 2003   BinaryOpICStub stub(instr->op(), NO_OVERWRITE); | 
| 2004   CallCode(stub.GetCode(isolate()), RelocInfo::CODE_TARGET, instr); | 2004   CallCode(stub.GetCode(isolate()), RelocInfo::CODE_TARGET, instr); | 
| 2005   // Other arch use a nop here, to signal that there is no inlined | 2005   // Other arch use a nop here, to signal that there is no inlined | 
| 2006   // patchable code. Mips does not need the nop, since our marker | 2006   // patchable code. Mips does not need the nop, since our marker | 
| 2007   // instruction (andi zero_reg) will never be used in normal code. | 2007   // instruction (andi zero_reg) will never be used in normal code. | 
| 2008 } | 2008 } | 
| 2009 | 2009 | 
| 2010 | 2010 | 
| 2011 template<class InstrType> | 2011 template<class InstrType> | 
| 2012 void LCodeGen::EmitBranch(InstrType instr, | 2012 void LCodeGen::EmitBranch(InstrType instr, | 
| 2013                           Condition condition, | 2013                           Condition condition, | 
| (...skipping 3855 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 5869   __ Subu(scratch, result, scratch); | 5869   __ Subu(scratch, result, scratch); | 
| 5870   __ lw(result, FieldMemOperand(scratch, | 5870   __ lw(result, FieldMemOperand(scratch, | 
| 5871                                 FixedArray::kHeaderSize - kPointerSize)); | 5871                                 FixedArray::kHeaderSize - kPointerSize)); | 
| 5872   __ bind(&done); | 5872   __ bind(&done); | 
| 5873 } | 5873 } | 
| 5874 | 5874 | 
| 5875 | 5875 | 
| 5876 #undef __ | 5876 #undef __ | 
| 5877 | 5877 | 
| 5878 } }  // namespace v8::internal | 5878 } }  // namespace v8::internal | 
| OLD | NEW | 
|---|