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 3021 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3032 __ Addu(t0, t0, Operand(DescriptorArray::kFirstOffset - kHeapObjectTag)); | 3032 __ Addu(t0, t0, Operand(DescriptorArray::kFirstOffset - kHeapObjectTag)); |
3033 // Calculate the end of the descriptor array. | 3033 // Calculate the end of the descriptor array. |
3034 __ mov(a2, t0); | 3034 __ mov(a2, t0); |
3035 __ sll(t1, a3, kPointerSizeLog2 - kSmiTagSize); | 3035 __ sll(t1, a3, kPointerSizeLog2 - kSmiTagSize); |
3036 __ Addu(a2, a2, t1); | 3036 __ Addu(a2, a2, t1); |
3037 | 3037 |
3038 // Loop through all the keys in the descriptor array. If one of these is the | 3038 // Loop through all the keys in the descriptor array. If one of these is the |
3039 // string "valueOf" the result is false. | 3039 // string "valueOf" the result is false. |
3040 // The use of t2 to store the valueOf string assumes that it is not otherwise | 3040 // The use of t2 to store the valueOf string assumes that it is not otherwise |
3041 // used in the loop below. | 3041 // used in the loop below. |
3042 __ li(t2, Operand(FACTORY->value_of_string())); | 3042 __ li(t2, Operand(isolate()->factory()->value_of_string())); |
3043 __ jmp(&entry); | 3043 __ jmp(&entry); |
3044 __ bind(&loop); | 3044 __ bind(&loop); |
3045 __ lw(a3, MemOperand(t0, 0)); | 3045 __ lw(a3, MemOperand(t0, 0)); |
3046 __ Branch(if_false, eq, a3, Operand(t2)); | 3046 __ Branch(if_false, eq, a3, Operand(t2)); |
3047 __ Addu(t0, t0, Operand(DescriptorArray::kDescriptorSize * kPointerSize)); | 3047 __ Addu(t0, t0, Operand(DescriptorArray::kDescriptorSize * kPointerSize)); |
3048 __ bind(&entry); | 3048 __ bind(&entry); |
3049 __ Branch(&loop, ne, t0, Operand(a2)); | 3049 __ Branch(&loop, ne, t0, Operand(a2)); |
3050 | 3050 |
3051 __ bind(&done); | 3051 __ bind(&done); |
3052 // If a valueOf property is not found on the object check that its | 3052 // If a valueOf property is not found on the object check that its |
(...skipping 1859 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4912 *context_length = 0; | 4912 *context_length = 0; |
4913 return previous_; | 4913 return previous_; |
4914 } | 4914 } |
4915 | 4915 |
4916 | 4916 |
4917 #undef __ | 4917 #undef __ |
4918 | 4918 |
4919 } } // namespace v8::internal | 4919 } } // namespace v8::internal |
4920 | 4920 |
4921 #endif // V8_TARGET_ARCH_MIPS | 4921 #endif // V8_TARGET_ARCH_MIPS |
OLD | NEW |