OLD | NEW |
1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 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 317 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
328 | 328 |
329 // Here we use masm_-> instead of the __ macro to avoid the code coverage | 329 // Here we use masm_-> instead of the __ macro to avoid the code coverage |
330 // tool from instrumenting as we rely on the code size here. | 330 // tool from instrumenting as we rely on the code size here. |
331 masm_->add(sp, sp, Operand((scope_->num_parameters() + 1) * kPointerSize)); | 331 masm_->add(sp, sp, Operand((scope_->num_parameters() + 1) * kPointerSize)); |
332 masm_->Jump(lr); | 332 masm_->Jump(lr); |
333 | 333 |
334 // Check that the size of the code used for returning matches what is | 334 // Check that the size of the code used for returning matches what is |
335 // expected by the debugger. | 335 // expected by the debugger. |
336 ASSERT_EQ(kJSReturnSequenceLength, | 336 ASSERT_EQ(kJSReturnSequenceLength, |
337 masm_->InstructionsGeneratedSince(&check_exit_codesize)); | 337 masm_->InstructionsGeneratedSince(&check_exit_codesize)); |
338 | |
339 } | 338 } |
340 | 339 |
341 // Code generation state must be reset. | 340 // Code generation state must be reset. |
342 ASSERT(!has_cc()); | 341 ASSERT(!has_cc()); |
343 ASSERT(state_ == NULL); | 342 ASSERT(state_ == NULL); |
344 ASSERT(!function_return_is_shadowed_); | 343 ASSERT(!function_return_is_shadowed_); |
345 function_return_.Unuse(); | 344 function_return_.Unuse(); |
346 DeleteFrame(); | 345 DeleteFrame(); |
347 | 346 |
348 // Process any deferred code using the register allocator. | 347 // Process any deferred code using the register allocator. |
(...skipping 5920 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6269 int CompareStub::MinorKey() { | 6268 int CompareStub::MinorKey() { |
6270 // Encode the two parameters in a unique 16 bit value. | 6269 // Encode the two parameters in a unique 16 bit value. |
6271 ASSERT(static_cast<unsigned>(cc_) >> 28 < (1 << 15)); | 6270 ASSERT(static_cast<unsigned>(cc_) >> 28 < (1 << 15)); |
6272 return (static_cast<unsigned>(cc_) >> 27) | (strict_ ? 1 : 0); | 6271 return (static_cast<unsigned>(cc_) >> 27) | (strict_ ? 1 : 0); |
6273 } | 6272 } |
6274 | 6273 |
6275 | 6274 |
6276 #undef __ | 6275 #undef __ |
6277 | 6276 |
6278 } } // namespace v8::internal | 6277 } } // namespace v8::internal |
OLD | NEW |