| OLD | NEW |
| 1 // Copyright (c) 1994-2006 Sun Microsystems Inc. | 1 // Copyright (c) 1994-2006 Sun Microsystems Inc. |
| 2 // All Rights Reserved. | 2 // All Rights Reserved. |
| 3 // | 3 // |
| 4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
| 5 // modification, are permitted provided that the following conditions are | 5 // modification, are permitted provided that the following conditions are |
| 6 // met: | 6 // met: |
| 7 // | 7 // |
| 8 // - Redistributions of source code must retain the above copyright notice, | 8 // - Redistributions of source code must retain the above copyright notice, |
| 9 // this list of conditions and the following disclaimer. | 9 // this list of conditions and the following disclaimer. |
| 10 // | 10 // |
| (...skipping 402 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 413 | 413 |
| 414 // Static variable StackGuard::address_of_jslimit() | 414 // Static variable StackGuard::address_of_jslimit() |
| 415 static ExternalReference address_of_stack_limit(); | 415 static ExternalReference address_of_stack_limit(); |
| 416 | 416 |
| 417 // Static variable StackGuard::address_of_real_jslimit() | 417 // Static variable StackGuard::address_of_real_jslimit() |
| 418 static ExternalReference address_of_real_stack_limit(); | 418 static ExternalReference address_of_real_stack_limit(); |
| 419 | 419 |
| 420 // Static variable RegExpStack::limit_address() | 420 // Static variable RegExpStack::limit_address() |
| 421 static ExternalReference address_of_regexp_stack_limit(); | 421 static ExternalReference address_of_regexp_stack_limit(); |
| 422 | 422 |
| 423 // Static variables for RegExp. |
| 424 static ExternalReference address_of_static_offsets_vector(); |
| 425 static ExternalReference address_of_regexp_stack_memory_address(); |
| 426 static ExternalReference address_of_regexp_stack_memory_size(); |
| 427 |
| 423 // Static variable Heap::NewSpaceStart() | 428 // Static variable Heap::NewSpaceStart() |
| 424 static ExternalReference new_space_start(); | 429 static ExternalReference new_space_start(); |
| 425 static ExternalReference heap_always_allocate_scope_depth(); | 430 static ExternalReference heap_always_allocate_scope_depth(); |
| 426 | 431 |
| 427 // Used for fast allocation in generated code. | 432 // Used for fast allocation in generated code. |
| 428 static ExternalReference new_space_allocation_top_address(); | 433 static ExternalReference new_space_allocation_top_address(); |
| 429 static ExternalReference new_space_allocation_limit_address(); | 434 static ExternalReference new_space_allocation_limit_address(); |
| 430 | 435 |
| 431 static ExternalReference double_fp_operation(Token::Value operation); | 436 static ExternalReference double_fp_operation(Token::Value operation); |
| 432 static ExternalReference compare_doubles(); | 437 static ExternalReference compare_doubles(); |
| (...skipping 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 511 static inline bool is_uint5(int x) { return is_uintn(x, 5); } | 516 static inline bool is_uint5(int x) { return is_uintn(x, 5); } |
| 512 static inline bool is_uint6(int x) { return is_uintn(x, 6); } | 517 static inline bool is_uint6(int x) { return is_uintn(x, 6); } |
| 513 static inline bool is_uint8(int x) { return is_uintn(x, 8); } | 518 static inline bool is_uint8(int x) { return is_uintn(x, 8); } |
| 514 static inline bool is_uint12(int x) { return is_uintn(x, 12); } | 519 static inline bool is_uint12(int x) { return is_uintn(x, 12); } |
| 515 static inline bool is_uint16(int x) { return is_uintn(x, 16); } | 520 static inline bool is_uint16(int x) { return is_uintn(x, 16); } |
| 516 static inline bool is_uint24(int x) { return is_uintn(x, 24); } | 521 static inline bool is_uint24(int x) { return is_uintn(x, 24); } |
| 517 | 522 |
| 518 } } // namespace v8::internal | 523 } } // namespace v8::internal |
| 519 | 524 |
| 520 #endif // V8_ASSEMBLER_H_ | 525 #endif // V8_ASSEMBLER_H_ |
| OLD | NEW |