| OLD | NEW |
| 1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_INTERPRETER_SOURCE_POSITION_TABLE_H_ | 5 #ifndef V8_INTERPRETER_SOURCE_POSITION_TABLE_H_ |
| 6 #define V8_INTERPRETER_SOURCE_POSITION_TABLE_H_ | 6 #define V8_INTERPRETER_SOURCE_POSITION_TABLE_H_ |
| 7 | 7 |
| 8 #include "src/assert-scope.h" | 8 #include "src/assert-scope.h" |
| 9 #include "src/checks.h" |
| 9 #include "src/handles.h" | 10 #include "src/handles.h" |
| 10 #include "src/zone.h" | |
| 11 #include "src/zone-containers.h" | 11 #include "src/zone-containers.h" |
| 12 | 12 |
| 13 namespace v8 { | 13 namespace v8 { |
| 14 namespace internal { | 14 namespace internal { |
| 15 | 15 |
| 16 class BytecodeArray; | 16 class BytecodeArray; |
| 17 class FixedArray; | 17 class ByteArray; |
| 18 class Isolate; | 18 class Isolate; |
| 19 class Zone; |
| 19 | 20 |
| 20 namespace interpreter { | 21 namespace interpreter { |
| 21 | 22 |
| 23 struct PositionTableEntry { |
| 24 PositionTableEntry() |
| 25 : bytecode_offset(0), source_position(0), is_statement(false) {} |
| 26 PositionTableEntry(int bytecode, int source, bool statement) |
| 27 : bytecode_offset(bytecode), |
| 28 source_position(source), |
| 29 is_statement(statement) {} |
| 30 |
| 31 int bytecode_offset; |
| 32 int source_position; |
| 33 bool is_statement; |
| 34 }; |
| 35 |
| 22 class SourcePositionTableBuilder { | 36 class SourcePositionTableBuilder { |
| 23 public: | 37 public: |
| 24 explicit SourcePositionTableBuilder(Isolate* isolate, Zone* zone) | 38 explicit SourcePositionTableBuilder(Isolate* isolate, Zone* zone) |
| 25 : isolate_(isolate), entries_(zone) {} | 39 : isolate_(isolate), bytes_(zone), previous_() {} |
| 26 | 40 |
| 27 void AddStatementPosition(size_t bytecode_offset, int source_position); | 41 void AddStatementPosition(size_t bytecode_offset, int source_position); |
| 28 void AddExpressionPosition(size_t bytecode_offset, int source_position); | 42 void AddExpressionPosition(size_t bytecode_offset, int source_position); |
| 29 void RevertPosition(size_t bytecode_offset); | 43 Handle<ByteArray> ToSourcePositionTable(); |
| 30 Handle<FixedArray> ToFixedArray(); | |
| 31 | 44 |
| 32 private: | 45 private: |
| 33 struct Entry { | 46 void AddEntry(const PositionTableEntry& entry); |
| 34 int bytecode_offset; | |
| 35 uint32_t source_position_and_type; | |
| 36 }; | |
| 37 | |
| 38 bool CodeOffsetHasPosition(int bytecode_offset) { | |
| 39 // Return whether bytecode offset already has a position assigned. | |
| 40 return entries_.size() > 0 && | |
| 41 entries_.back().bytecode_offset == bytecode_offset; | |
| 42 } | |
| 43 | 47 |
| 44 Isolate* isolate_; | 48 Isolate* isolate_; |
| 45 ZoneVector<Entry> entries_; | 49 ZoneVector<byte> bytes_; |
| 50 PositionTableEntry previous_; |
| 51 |
| 52 #ifdef ENABLE_SLOW_DCHECKS |
| 53 std::vector<PositionTableEntry> raw_entries_; |
| 54 #endif |
| 46 }; | 55 }; |
| 47 | 56 |
| 48 class SourcePositionTableIterator { | 57 class SourcePositionTableIterator { |
| 49 public: | 58 public: |
| 50 explicit SourcePositionTableIterator(BytecodeArray* bytecode_array); | 59 explicit SourcePositionTableIterator(ByteArray* byte_array); |
| 51 | 60 |
| 52 void Advance(); | 61 void Advance(); |
| 53 | 62 |
| 54 int bytecode_offset() const { | 63 int bytecode_offset() const { |
| 55 DCHECK(!done()); | 64 DCHECK(!done()); |
| 56 return bytecode_offset_; | 65 return current_.bytecode_offset; |
| 57 } | 66 } |
| 58 int source_position() const { | 67 int source_position() const { |
| 59 DCHECK(!done()); | 68 DCHECK(!done()); |
| 60 return source_position_; | 69 return current_.source_position; |
| 61 } | 70 } |
| 62 bool is_statement() const { | 71 bool is_statement() const { |
| 63 DCHECK(!done()); | 72 DCHECK(!done()); |
| 64 return is_statement_; | 73 return current_.is_statement; |
| 65 } | 74 } |
| 66 bool done() const { return index_ > length_; } | 75 bool done() const { return index_ == kDone; } |
| 67 | 76 |
| 68 private: | 77 private: |
| 69 FixedArray* table_; | 78 static const int kDone = -1; |
| 79 |
| 80 ByteArray* table_; |
| 70 int index_; | 81 int index_; |
| 71 int length_; | 82 PositionTableEntry current_; |
| 72 bool is_statement_; | |
| 73 int bytecode_offset_; | |
| 74 int source_position_; | |
| 75 DisallowHeapAllocation no_gc; | 83 DisallowHeapAllocation no_gc; |
| 76 }; | 84 }; |
| 77 | 85 |
| 78 } // namespace interpreter | 86 } // namespace interpreter |
| 79 } // namespace internal | 87 } // namespace internal |
| 80 } // namespace v8 | 88 } // namespace v8 |
| 81 | 89 |
| 82 #endif // V8_INTERPRETER_SOURCE_POSITION_TABLE_H_ | 90 #endif // V8_INTERPRETER_SOURCE_POSITION_TABLE_H_ |
| OLD | NEW |