michael@0: // Copyright 2008 Google Inc. All Rights Reserved.
michael@0: //
michael@0: // Redistribution and use in source and binary forms, with or without
michael@0: // modification, are permitted provided that the following conditions are
michael@0: // met:
michael@0: //
michael@0: //     * Redistributions of source code must retain the above copyright
michael@0: // notice, this list of conditions and the following disclaimer.
michael@0: //     * Redistributions in binary form must reproduce the above
michael@0: // copyright notice, this list of conditions and the following disclaimer
michael@0: // in the documentation and/or other materials provided with the
michael@0: // distribution.
michael@0: //     * Neither the name of Google Inc. nor the names of its
michael@0: // contributors may be used to endorse or promote products derived from
michael@0: // this software without specific prior written permission.
michael@0: //
michael@0: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
michael@0: // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
michael@0: // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
michael@0: // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
michael@0: // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
michael@0: // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
michael@0: // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
michael@0: // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
michael@0: // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0: // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0: // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0: 
michael@0: 
michael@0: #ifndef COMMON_DWARF_LINE_STATE_MACHINE_H__
michael@0: #define COMMON_DWARF_LINE_STATE_MACHINE_H__
michael@0: 
michael@0: namespace dwarf2reader {
michael@0: 
michael@0: // This is the format of a DWARF2/3 line state machine that we process
michael@0: // opcodes using.  There is no need for anything outside the lineinfo
michael@0: // processor to know how this works.
michael@0: struct LineStateMachine {
michael@0:   void Reset(bool default_is_stmt) {
michael@0:     file_num = 1;
michael@0:     address = 0;
michael@0:     line_num = 1;
michael@0:     column_num = 0;
michael@0:     is_stmt = default_is_stmt;
michael@0:     basic_block = false;
michael@0:     end_sequence = false;
michael@0:   }
michael@0: 
michael@0:   uint32 file_num;
michael@0:   uint64 address;
michael@0:   uint32 line_num;
michael@0:   uint32 column_num;
michael@0:   bool is_stmt;  // stmt means statement.
michael@0:   bool basic_block;
michael@0:   bool end_sequence;
michael@0: };
michael@0: 
michael@0: }  // namespace dwarf2reader
michael@0: 
michael@0: 
michael@0: #endif  // COMMON_DWARF_LINE_STATE_MACHINE_H__