Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 1 | // Copyright 2011 the V8 project authors. All rights reserved. |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | |
| 28 | |
| 29 | #include "cctest.h" |
| 30 | #include "assembler.h" |
| 31 | |
| 32 | namespace v8 { |
| 33 | namespace internal { |
| 34 | |
| 35 | static void WriteRinfo(RelocInfoWriter* writer, |
| 36 | byte* pc, RelocInfo::Mode mode, intptr_t data) { |
| 37 | RelocInfo rinfo(pc, mode, data); |
| 38 | writer->Write(&rinfo); |
| 39 | } |
| 40 | |
| 41 | |
| 42 | // Tests that writing both types of positions and then reading either |
| 43 | // or both works as expected. |
| 44 | TEST(Positions) { |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 45 | const int code_size = 10 * KB; |
| 46 | int relocation_info_size = 10 * KB; |
| 47 | const int buffer_size = code_size + relocation_info_size; |
Ben Murdoch | 589d697 | 2011-11-30 16:04:58 +0000 | [diff] [blame^] | 48 | SmartArrayPointer<byte> buffer(new byte[buffer_size]); |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 49 | |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 50 | byte* pc = *buffer; |
| 51 | byte* buffer_end = *buffer + buffer_size; |
| 52 | |
| 53 | RelocInfoWriter writer(buffer_end, pc); |
| 54 | byte* relocation_info_end = buffer_end - relocation_info_size; |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 55 | for (int i = 0, pos = 0; i < 100; i++, pc += i, pos += i) { |
| 56 | RelocInfo::Mode mode = (i % 2 == 0) ? |
| 57 | RelocInfo::STATEMENT_POSITION : RelocInfo::POSITION; |
| 58 | WriteRinfo(&writer, pc, mode, pos); |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 59 | CHECK(writer.pos() - RelocInfoWriter::kMaxSize >= relocation_info_end); |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 60 | } |
| 61 | |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 62 | relocation_info_size = static_cast<int>(buffer_end - writer.pos()); |
| 63 | CodeDesc desc = { *buffer, buffer_size, code_size, |
| 64 | relocation_info_size, NULL }; |
| 65 | |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 66 | // Read only (non-statement) positions. |
| 67 | { |
| 68 | RelocIterator it(desc, RelocInfo::ModeMask(RelocInfo::POSITION)); |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 69 | pc = *buffer; |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 70 | for (int i = 0, pos = 0; i < 100; i++, pc += i, pos += i) { |
| 71 | RelocInfo::Mode mode = (i % 2 == 0) ? |
| 72 | RelocInfo::STATEMENT_POSITION : RelocInfo::POSITION; |
| 73 | if (mode == RelocInfo::POSITION) { |
| 74 | CHECK_EQ(pc, it.rinfo()->pc()); |
| 75 | CHECK_EQ(mode, it.rinfo()->rmode()); |
| 76 | CHECK_EQ(pos, static_cast<int>(it.rinfo()->data())); |
| 77 | it.next(); |
| 78 | } |
| 79 | } |
| 80 | CHECK(it.done()); |
| 81 | } |
| 82 | |
| 83 | // Read only statement positions. |
| 84 | { |
| 85 | RelocIterator it(desc, RelocInfo::ModeMask(RelocInfo::STATEMENT_POSITION)); |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 86 | pc = *buffer; |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 87 | for (int i = 0, pos = 0; i < 100; i++, pc += i, pos += i) { |
| 88 | RelocInfo::Mode mode = (i % 2 == 0) ? |
| 89 | RelocInfo::STATEMENT_POSITION : RelocInfo::POSITION; |
| 90 | if (mode == RelocInfo::STATEMENT_POSITION) { |
| 91 | CHECK_EQ(pc, it.rinfo()->pc()); |
| 92 | CHECK_EQ(mode, it.rinfo()->rmode()); |
| 93 | CHECK_EQ(pos, static_cast<int>(it.rinfo()->data())); |
| 94 | it.next(); |
| 95 | } |
| 96 | } |
| 97 | CHECK(it.done()); |
| 98 | } |
| 99 | |
| 100 | // Read both types of positions. |
| 101 | { |
| 102 | RelocIterator it(desc, RelocInfo::kPositionMask); |
Steve Block | 44f0eee | 2011-05-26 01:26:41 +0100 | [diff] [blame] | 103 | pc = *buffer; |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 104 | for (int i = 0, pos = 0; i < 100; i++, pc += i, pos += i) { |
| 105 | RelocInfo::Mode mode = (i % 2 == 0) ? |
| 106 | RelocInfo::STATEMENT_POSITION : RelocInfo::POSITION; |
| 107 | CHECK_EQ(pc, it.rinfo()->pc()); |
| 108 | CHECK_EQ(mode, it.rinfo()->rmode()); |
| 109 | CHECK_EQ(pos, static_cast<int>(it.rinfo()->data())); |
| 110 | it.next(); |
| 111 | } |
| 112 | CHECK(it.done()); |
| 113 | } |
| 114 | } |
| 115 | |
| 116 | } } // namespace v8::internal |