| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 27 matching lines...) Expand all Loading... |
| 38 writer->Write(&rinfo); | 38 writer->Write(&rinfo); |
| 39 } | 39 } |
| 40 | 40 |
| 41 | 41 |
| 42 // Tests that writing both types of positions and then reading either | 42 // Tests that writing both types of positions and then reading either |
| 43 // or both works as expected. | 43 // or both works as expected. |
| 44 TEST(Positions) { | 44 TEST(Positions) { |
| 45 const int code_size = 10 * KB; | 45 const int code_size = 10 * KB; |
| 46 int relocation_info_size = 10 * KB; | 46 int relocation_info_size = 10 * KB; |
| 47 const int buffer_size = code_size + relocation_info_size; | 47 const int buffer_size = code_size + relocation_info_size; |
| 48 SmartArrayPointer<byte> buffer(new byte[buffer_size]); | 48 v8::base::SmartArrayPointer<byte> buffer(new byte[buffer_size]); |
| 49 | 49 |
| 50 byte* pc = buffer.get(); | 50 byte* pc = buffer.get(); |
| 51 byte* buffer_end = buffer.get() + buffer_size; | 51 byte* buffer_end = buffer.get() + buffer_size; |
| 52 | 52 |
| 53 RelocInfoWriter writer(buffer_end, pc); | 53 RelocInfoWriter writer(buffer_end, pc); |
| 54 byte* relocation_info_end = buffer_end - relocation_info_size; | 54 byte* relocation_info_end = buffer_end - relocation_info_size; |
| 55 for (int i = 0, pos = 0; i < 100; i++, pc += i, pos += i) { | 55 for (int i = 0, pos = 0; i < 100; i++, pc += i, pos += i) { |
| 56 RelocInfo::Mode mode = (i % 2 == 0) ? | 56 RelocInfo::Mode mode = (i % 2 == 0) ? |
| 57 RelocInfo::STATEMENT_POSITION : RelocInfo::POSITION; | 57 RelocInfo::STATEMENT_POSITION : RelocInfo::POSITION; |
| 58 if (mode == RelocInfo::STATEMENT_POSITION) { | 58 if (mode == RelocInfo::STATEMENT_POSITION) { |
| (...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 115 CHECK_EQ(mode, it.rinfo()->rmode()); | 115 CHECK_EQ(mode, it.rinfo()->rmode()); |
| 116 CHECK_EQ(pos, static_cast<int>(it.rinfo()->data())); | 116 CHECK_EQ(pos, static_cast<int>(it.rinfo()->data())); |
| 117 it.next(); | 117 it.next(); |
| 118 } | 118 } |
| 119 CHECK(it.done()); | 119 CHECK(it.done()); |
| 120 } | 120 } |
| 121 } | 121 } |
| 122 | 122 |
| 123 } // namespace internal | 123 } // namespace internal |
| 124 } // namespace v8 | 124 } // namespace v8 |
| OLD | NEW |