2017-04-06 18:14:01 +00:00
package proc
import (
2017-11-21 08:50:14 +00:00
"bytes"
2017-05-29 13:20:01 +00:00
"debug/dwarf"
"debug/elf"
"debug/macho"
2017-04-06 18:14:01 +00:00
"debug/pe"
2017-08-24 07:46:47 +00:00
"encoding/binary"
2018-06-20 10:20:35 +00:00
"encoding/hex"
2017-04-06 18:14:01 +00:00
"errors"
"fmt"
2019-08-08 19:25:50 +00:00
"go/ast"
"go/token"
2017-04-06 18:14:01 +00:00
"io"
"os"
2018-11-07 22:21:35 +00:00
"path/filepath"
2017-09-01 13:30:45 +00:00
"sort"
2019-08-08 19:25:50 +00:00
"strconv"
2017-09-01 13:30:45 +00:00
"strings"
2017-04-06 18:14:01 +00:00
"sync"
"time"
2019-01-04 18:39:25 +00:00
"github.com/go-delve/delve/pkg/dwarf/frame"
"github.com/go-delve/delve/pkg/dwarf/godwarf"
"github.com/go-delve/delve/pkg/dwarf/line"
2019-11-12 19:44:08 +00:00
"github.com/go-delve/delve/pkg/dwarf/loclist"
2019-01-04 18:39:25 +00:00
"github.com/go-delve/delve/pkg/dwarf/op"
"github.com/go-delve/delve/pkg/dwarf/reader"
2020-03-10 16:34:40 +00:00
"github.com/go-delve/delve/pkg/dwarf/util"
2019-01-04 18:39:25 +00:00
"github.com/go-delve/delve/pkg/goversion"
2019-08-08 19:25:50 +00:00
"github.com/go-delve/delve/pkg/logflags"
2020-03-20 17:23:10 +00:00
"github.com/hashicorp/golang-lru/simplelru"
2019-08-08 19:25:50 +00:00
"github.com/sirupsen/logrus"
2017-04-06 18:14:01 +00:00
)
2020-03-23 17:57:01 +00:00
const (
dwarfGoLanguage = 22 // DW_LANG_Go (from DWARF v5, section 7.12, page 231)
dwarfTreeCacheSize = 512 // size of the dwarfTree cache of each image
)
2019-03-20 17:32:51 +00:00
// BinaryInfo holds information on the binaries being executed (this
// includes both the executable and also any loaded libraries).
2017-04-06 18:14:01 +00:00
type BinaryInfo struct {
2018-11-06 22:32:14 +00:00
// Architecture of this binary.
2020-03-30 18:03:29 +00:00
Arch * Arch
2018-11-06 22:32:14 +00:00
// GOOS operating system this binary is executing on.
GOOS string
2019-05-08 21:06:38 +00:00
debugInfoDirectories [ ] string
2018-11-06 22:32:14 +00:00
// Functions is a list of all DW_TAG_subprogram entries in debug_info, sorted by entry point
Functions [ ] Function
// Sources is a list of all source files found in debug_line.
Sources [ ] string
// LookupFunc maps function names to a description of the function.
LookupFunc map [ string ] * Function
2020-03-10 16:34:40 +00:00
// SymNames maps addr to a description *elf.Symbol of this addr.
SymNames map [ uint64 ] * elf . Symbol
2019-03-20 17:32:51 +00:00
// Images is a list of loaded shared libraries (also known as
2019-05-30 15:02:28 +00:00
// shared objects on linux or DLLs on windows).
2019-03-20 17:32:51 +00:00
Images [ ] * Image
ElfDynamicSection ElfDynamicSection
2017-04-06 18:14:01 +00:00
lastModified time . Time // Time the executable of this process was last modified
2018-06-20 10:20:35 +00:00
closer io . Closer
sepDebugCloser io . Closer
2017-04-06 18:14:01 +00:00
2019-11-25 17:10:18 +00:00
// PackageMap maps package names to package paths, needed to lookup types inside DWARF info.
// On Go1.12 this mapping is determined by using the last element of a package path, for example:
// github.com/go-delve/delve
// will map to 'delve' because it ends in '/delve'.
// Starting with Go1.13 debug_info will contain a special attribute
// (godwarf.AttrGoPackageName) containing the canonical package name for
// each package.
// If multiple packages have the same name the map entry will have more
// than one item in the slice.
PackageMap map [ string ] [ ] string
2017-04-06 18:14:01 +00:00
2018-11-06 22:32:14 +00:00
frameEntries frame . FrameDescriptionEntries
2019-06-24 15:02:14 +00:00
compileUnits [ ] * compileUnit // compileUnits is sorted by increasing DWARF offset
types map [ string ] dwarfRef
packageVars [ ] packageVar // packageVars is a list of all global/package variables in debug_info, sorted by address
2017-04-06 18:14:01 +00:00
2018-11-06 22:32:14 +00:00
gStructOffset uint64
2017-05-29 13:20:01 +00:00
2019-05-08 21:06:38 +00:00
// nameOfRuntimeType maps an address of a runtime._type struct to its
// decoded name. Used with versions of Go <= 1.10 to figure out the DIE of
// the concrete type of interfaces.
nameOfRuntimeType map [ uintptr ] nameOfRuntimeTypeEntry
2018-04-18 18:09:33 +00:00
2017-09-08 10:31:20 +00:00
// consts[off] lists all the constants with the type defined at offset off.
consts constantsMap
2019-10-07 16:38:47 +00:00
2019-11-01 19:41:06 +00:00
// inlinedCallLines maps a file:line pair, corresponding to the header line
// of a function to a list of PC addresses where an inlined call to that
// function starts.
inlinedCallLines map [ fileLine ] [ ] uint64
2019-10-07 16:38:47 +00:00
logger * logrus . Entry
2017-04-06 18:14:01 +00:00
}
2020-03-23 17:57:01 +00:00
var (
// ErrCouldNotDetermineRelocation is an error returned when Delve could not determine the base address of a
// position independant executable.
ErrCouldNotDetermineRelocation = errors . New ( "could not determine the base address of a PIE" )
2018-05-29 15:01:51 +00:00
2020-03-23 17:57:01 +00:00
// ErrNoDebugInfoFound is returned when Delve cannot open the debug_info
// section or find an external debug info file.
ErrNoDebugInfoFound = errors . New ( "could not open debug info" )
)
2018-11-07 22:21:35 +00:00
2020-03-23 17:57:01 +00:00
var (
supportedLinuxArch = map [ elf . Machine ] bool {
elf . EM_X86_64 : true ,
elf . EM_AARCH64 : true ,
elf . EM_386 : true ,
}
supportedWindowsArch = map [ PEMachine ] bool {
IMAGE_FILE_MACHINE_AMD64 : true ,
}
supportedDarwinArch = map [ macho . Cpu ] bool {
macho . CpuAmd64 : true ,
}
)
// ErrFunctionNotFound is returned when failing to find the
// function named 'FuncName' within the binary.
type ErrFunctionNotFound struct {
FuncName string
2020-03-10 16:34:40 +00:00
}
2020-03-23 17:57:01 +00:00
func ( err * ErrFunctionNotFound ) Error ( ) string {
return fmt . Sprintf ( "could not find function %s\n" , err . FuncName )
}
// FindFileLocation returns the PC for a given file:line.
// Assumes that `file` is normalized to lower case and '/' on Windows.
func FindFileLocation ( p Process , fileName string , lineno int ) ( [ ] uint64 , error ) {
pcs , err := p . BinInfo ( ) . LineToPC ( fileName , lineno )
if err != nil {
return nil , err
}
var fn * Function
for i := range pcs {
if fn == nil || pcs [ i ] < fn . Entry || pcs [ i ] >= fn . End {
fn = p . BinInfo ( ) . PCToFunc ( pcs [ i ] )
}
if fn != nil && fn . Entry == pcs [ i ] {
pcs [ i ] , _ = FirstPCAfterPrologue ( p , fn , true )
}
}
return pcs , nil
}
// FindFunctionLocation finds address of a function's line
// If lineOffset is passed FindFunctionLocation will return the address of that line
func FindFunctionLocation ( p Process , funcName string , lineOffset int ) ( [ ] uint64 , error ) {
bi := p . BinInfo ( )
origfn := bi . LookupFunc [ funcName ]
if origfn == nil {
return nil , & ErrFunctionNotFound { funcName }
}
if lineOffset <= 0 {
r := make ( [ ] uint64 , 0 , len ( origfn . InlinedCalls ) + 1 )
if origfn . Entry > 0 {
// add concrete implementation of the function
pc , err := FirstPCAfterPrologue ( p , origfn , false )
if err != nil {
return nil , err
}
r = append ( r , pc )
}
// add inlined calls to the function
for _ , call := range origfn . InlinedCalls {
r = append ( r , call . LowPC )
}
if len ( r ) == 0 {
return nil , & ErrFunctionNotFound { funcName }
}
return r , nil
}
filename , lineno := origfn . cu . lineInfo . PCToLine ( origfn . Entry , origfn . Entry )
return bi . LineToPC ( filename , lineno + lineOffset )
}
// FirstPCAfterPrologue returns the address of the first
// instruction after the prologue for function fn.
// If sameline is set FirstPCAfterPrologue will always return an
// address associated with the same line as fn.Entry.
func FirstPCAfterPrologue ( p Process , fn * Function , sameline bool ) ( uint64 , error ) {
pc , _ , line , ok := fn . cu . lineInfo . PrologueEndPC ( fn . Entry , fn . End )
if ok {
if ! sameline {
return pc , nil
}
_ , entryLine := fn . cu . lineInfo . PCToLine ( fn . Entry , fn . Entry )
if entryLine == line {
return pc , nil
}
}
pc , err := firstPCAfterPrologueDisassembly ( p , fn , sameline )
if err != nil {
return fn . Entry , err
}
if pc == fn . Entry {
// Look for the first instruction with the stmt flag set, so that setting a
// breakpoint with file:line and with the function name always result on
// the same instruction being selected.
if pc2 , _ , _ , ok := fn . cu . lineInfo . FirstStmtForLine ( fn . Entry , fn . End ) ; ok {
return pc2 , nil
}
}
return pc , nil
}
// CpuArch is a stringer interface representing CPU architectures.
2020-03-10 16:34:40 +00:00
type CpuArch interface {
String ( ) string
}
2020-03-23 17:57:01 +00:00
// ErrUnsupportedArch is returned when attempting to debug a binary compiled for an unsupported architecture.
type ErrUnsupportedArch struct {
os string
cpuArch CpuArch
}
2020-03-10 16:34:40 +00:00
func ( e * ErrUnsupportedArch ) Error ( ) string {
var supportArchs [ ] CpuArch
switch e . os {
case "linux" :
for linuxArch , _ := range supportedLinuxArch {
supportArchs = append ( supportArchs , linuxArch )
}
case "windows" :
for windowArch , _ := range supportedWindowsArch {
supportArchs = append ( supportArchs , windowArch )
}
case "darwin" :
for darwinArch , _ := range supportedDarwinArch {
supportArchs = append ( supportArchs , darwinArch )
}
}
errStr := "unsupported architecture of " + e . os + "/" + e . cpuArch . String ( )
errStr += " - only"
for _ , arch := range supportArchs {
errStr += " " + e . os + "/" + arch . String ( ) + " "
}
if len ( supportArchs ) == 1 {
errStr += "is supported"
} else {
errStr += "are supported"
}
return errStr
}
2017-09-01 13:30:45 +00:00
type compileUnit struct {
2018-11-06 22:34:26 +00:00
name string // univocal name for non-go compile units
lowPC uint64
ranges [ ] [ 2 ] uint64
2018-08-07 01:08:25 +00:00
2019-11-01 19:41:06 +00:00
entry * dwarf . Entry // debug_info entry describing this compile unit
isgo bool // true if this is the go compile unit
lineInfo * line . DebugLineInfo // debug_line segment associated with this compile unit
optimized bool // this compile unit is optimized
producer string // producer attribute
2018-08-17 06:17:22 +00:00
2019-06-24 15:02:14 +00:00
offset dwarf . Offset // offset of the entry describing the compile unit
2019-05-08 21:06:38 +00:00
image * Image // parent image of this compilation unit.
}
2019-11-01 19:41:06 +00:00
type fileLine struct {
file string
line int
}
2019-05-08 21:06:38 +00:00
// dwarfRef is a reference to a Debug Info Entry inside a shared object.
type dwarfRef struct {
imageIndex int
offset dwarf . Offset
2017-09-01 13:30:45 +00:00
}
2019-11-01 19:41:06 +00:00
// InlinedCall represents a concrete inlined call to a function.
type InlinedCall struct {
cu * compileUnit
LowPC , HighPC uint64 // Address range of the generated inlined instructions
2018-08-07 01:08:25 +00:00
}
2017-09-01 13:30:45 +00:00
// Function describes a function in the target program.
type Function struct {
Name string
Entry , End uint64 // same as DW_AT_lowpc and DW_AT_highpc
offset dwarf . Offset
cu * compileUnit
2019-11-01 19:41:06 +00:00
// InlinedCalls lists all inlined calls to this function
InlinedCalls [ ] InlinedCall
2017-09-01 13:30:45 +00:00
}
// PackageName returns the package part of the symbol name,
// or the empty string if there is none.
// Borrowed from $GOROOT/debug/gosym/symtab.go
func ( fn * Function ) PackageName ( ) string {
2017-09-08 10:31:20 +00:00
return packageName ( fn . Name )
}
func packageName ( name string ) string {
pathend := strings . LastIndex ( name , "/" )
2017-09-01 13:30:45 +00:00
if pathend < 0 {
pathend = 0
}
2017-09-08 10:31:20 +00:00
if i := strings . Index ( name [ pathend : ] , "." ) ; i != - 1 {
return name [ : pathend + i ]
2017-09-01 13:30:45 +00:00
}
return ""
}
// ReceiverName returns the receiver type name of this symbol,
// or the empty string if there is none.
// Borrowed from $GOROOT/debug/gosym/symtab.go
func ( fn * Function ) ReceiverName ( ) string {
pathend := strings . LastIndex ( fn . Name , "/" )
if pathend < 0 {
pathend = 0
}
l := strings . Index ( fn . Name [ pathend : ] , "." )
r := strings . LastIndex ( fn . Name [ pathend : ] , "." )
if l == - 1 || r == - 1 || l == r {
return ""
}
return fn . Name [ pathend + l + 1 : pathend + r ]
}
// BaseName returns the symbol name without the package or receiver name.
// Borrowed from $GOROOT/debug/gosym/symtab.go
func ( fn * Function ) BaseName ( ) string {
if i := strings . LastIndex ( fn . Name , "." ) ; i != - 1 {
return fn . Name [ i + 1 : ]
}
return fn . Name
}
2017-10-27 15:00:41 +00:00
// Optimized returns true if the function was optimized by the compiler.
func ( fn * Function ) Optimized ( ) bool {
return fn . cu . optimized
}
2019-08-13 18:13:28 +00:00
// PrologueEndPC returns the PC just after the function prologue
func ( fn * Function ) PrologueEndPC ( ) uint64 {
pc , _ , _ , ok := fn . cu . lineInfo . PrologueEndPC ( fn . Entry , fn . End )
if ! ok {
return fn . Entry
}
return pc
}
2019-05-08 21:06:38 +00:00
type constantsMap map [ dwarfRef ] * constantType
2017-09-08 10:31:20 +00:00
type constantType struct {
initialized bool
values [ ] constantValue
}
type constantValue struct {
name string
fullName string
value int64
singleBit bool
}
2017-10-26 11:37:19 +00:00
// packageVar represents a package-level variable (or a C global variable).
// If a global variable does not have an address (for example it's stored in
// a register, or non-contiguously) addr will be 0.
type packageVar struct {
name string
2019-05-08 21:06:38 +00:00
cu * compileUnit
2017-10-26 11:37:19 +00:00
offset dwarf . Offset
addr uint64
}
2018-08-31 18:08:18 +00:00
type buildIDHeader struct {
2018-06-20 10:20:35 +00:00
Namesz uint32
Descsz uint32
Type uint32
}
2019-03-20 17:32:51 +00:00
// ElfDynamicSection describes the .dynamic section of an ELF executable.
type ElfDynamicSection struct {
Addr uint64 // relocated address of where the .dynamic section is mapped in memory
Size uint64 // size of the .dynamic section of the executable
}
2018-08-31 18:08:18 +00:00
// NewBinaryInfo returns an initialized but unloaded BinaryInfo struct.
func NewBinaryInfo ( goos , goarch string ) * BinaryInfo {
2019-10-07 16:38:47 +00:00
r := & BinaryInfo { GOOS : goos , nameOfRuntimeType : make ( map [ uintptr ] nameOfRuntimeTypeEntry ) , logger : logflags . DebuggerLogger ( ) }
2017-04-06 18:14:01 +00:00
2018-08-31 18:08:18 +00:00
// TODO: find better way to determine proc arch (perhaps use executable file info).
2017-04-06 18:14:01 +00:00
switch goarch {
2020-03-10 16:34:40 +00:00
case "386" :
r . Arch = I386Arch ( goos )
2017-04-06 18:14:01 +00:00
case "amd64" :
2017-04-21 06:55:53 +00:00
r . Arch = AMD64Arch ( goos )
2019-10-25 13:22:33 +00:00
case "arm64" :
r . Arch = ARM64Arch ( goos )
2017-04-06 18:14:01 +00:00
}
return r
}
2018-08-31 18:08:18 +00:00
// LoadBinaryInfo will load and store the information from the binary at 'path'.
2018-11-12 22:52:13 +00:00
func ( bi * BinaryInfo ) LoadBinaryInfo ( path string , entryPoint uint64 , debugInfoDirs [ ] string ) error {
2017-04-06 18:14:01 +00:00
fi , err := os . Stat ( path )
if err == nil {
2018-08-31 18:08:18 +00:00
bi . lastModified = fi . ModTime ( )
2017-04-06 18:14:01 +00:00
}
2019-05-08 21:06:38 +00:00
bi . debugInfoDirectories = debugInfoDirs
return bi . AddImage ( path , entryPoint )
}
func loadBinaryInfo ( bi * BinaryInfo , image * Image , path string , entryPoint uint64 ) error {
2018-11-12 22:52:13 +00:00
var wg sync . WaitGroup
defer wg . Wait ( )
2019-05-08 21:06:38 +00:00
2018-08-31 18:08:18 +00:00
switch bi . GOOS {
2019-07-13 01:28:04 +00:00
case "linux" , "freebsd" :
2019-05-08 21:06:38 +00:00
return loadBinaryInfoElf ( bi , image , path , entryPoint , & wg )
2017-04-06 18:14:01 +00:00
case "windows" :
2019-05-08 21:06:38 +00:00
return loadBinaryInfoPE ( bi , image , path , entryPoint , & wg )
2017-04-06 18:14:01 +00:00
case "darwin" :
2019-05-08 21:06:38 +00:00
return loadBinaryInfoMacho ( bi , image , path , entryPoint , & wg )
2017-04-06 18:14:01 +00:00
}
return errors . New ( "unsupported operating system" )
}
2017-06-21 22:40:42 +00:00
// GStructOffset returns the offset of the G
// struct in thread local storage.
func ( bi * BinaryInfo ) GStructOffset ( ) uint64 {
return bi . gStructOffset
}
2018-08-31 18:08:18 +00:00
// LastModified returns the last modified time of the binary.
2017-04-06 18:14:01 +00:00
func ( bi * BinaryInfo ) LastModified ( ) time . Time {
return bi . lastModified
}
// DwarfReader returns a reader for the dwarf data
2019-05-08 21:06:38 +00:00
func ( so * Image ) DwarfReader ( ) * reader . Reader {
return reader . New ( so . dwarf )
2017-04-06 18:14:01 +00:00
}
// Types returns list of types present in the debugged program.
func ( bi * BinaryInfo ) Types ( ) ( [ ] string , error ) {
types := make ( [ ] string , 0 , len ( bi . types ) )
for k := range bi . types {
types = append ( types , k )
}
return types , nil
}
// PCToLine converts an instruction address to a file/line/function.
2017-09-01 13:30:45 +00:00
func ( bi * BinaryInfo ) PCToLine ( pc uint64 ) ( string , int , * Function ) {
fn := bi . PCToFunc ( pc )
if fn == nil {
return "" , 0 , nil
}
2017-08-18 17:49:29 +00:00
f , ln := fn . cu . lineInfo . PCToLine ( fn . Entry , pc )
2017-09-01 13:30:45 +00:00
return f , ln , fn
2017-04-06 18:14:01 +00:00
}
2019-10-25 16:59:18 +00:00
type ErrCouldNotFindLine struct {
fileFound bool
filename string
lineno int
}
func ( err * ErrCouldNotFindLine ) Error ( ) string {
if err . fileFound {
return fmt . Sprintf ( "could not find statement at %s:%d, please use a line with a statement" , err . filename , err . lineno )
}
return fmt . Sprintf ( "could not find file %s" , err . filename )
}
2019-11-01 19:41:06 +00:00
// LineToPC converts a file:line into a list of matching memory addresses,
// corresponding to the first instruction matching the specified file:line
// in the containing function and all its inlined calls.
func ( bi * BinaryInfo ) LineToPC ( filename string , lineno int ) ( pcs [ ] uint64 , err error ) {
2019-05-30 15:11:21 +00:00
fileFound := false
2019-11-01 19:41:06 +00:00
var pc uint64
2017-09-01 13:30:45 +00:00
for _ , cu := range bi . compileUnits {
2019-12-03 13:00:30 +00:00
if cu . lineInfo != nil && cu . lineInfo . Lookup [ filename ] == nil {
2019-11-01 19:41:06 +00:00
continue
}
fileFound = true
pc = cu . lineInfo . LineToPC ( filename , lineno )
if pc != 0 {
break
2017-09-01 13:30:45 +00:00
}
}
2017-02-10 14:11:40 +00:00
2019-11-01 19:41:06 +00:00
if pc == 0 {
// Check if the line contained a call to a function that was inlined, in
// that case it's possible for the line itself to not appear in debug_line
// at all, but it will still be in debug_info as the call site for an
// inlined subroutine entry.
if pcs := bi . inlinedCallLines [ fileLine { filename , lineno } ] ; len ( pcs ) != 0 {
return pcs , nil
proc: support inlining
Go 1.10 added inlined calls to debug_info, this commit adds support
for DW_TAG_inlined_call to delve, both for stack traces (where
inlined calls will appear as normal stack frames) and to correct
the behavior of next, step and stepout.
The calls to Next and Frame of stackIterator continue to work
unchanged and only return real stack frames, after reading each line
appendInlinedCalls is called to unpacked all the inlined calls that
involve the current PC.
The fake stack frames produced by appendInlinedCalls are
distinguished from real stack frames by having the Inlined attribute
set to true. Also their Current and Call locations are treated
differently. The Call location will be changed to represent the
position inside the inlined call, while the Current location will
always reference the real stack frame. This is done because:
* next, step and stepout need to access the debug_info entry of
the real function they are stepping through
* we are already manipulating Call in different ways while Current
is just what we read from the call stack
The strategy remains mostly the same, we disassemble the function
and we set a breakpoint on each instruction corresponding to a
different file:line. The function in question will be the one
corresponding to the first real (i.e. non-inlined) stack frame.
* If the current function contains inlined calls, 'next' will not
set any breakpoints on instructions that belong to inlined calls. We
do not do this for 'step'.
* If we are inside an inlined call that makes other inlined
functions, 'next' will not set any breakpoints that belong to
inlined calls that are children of the current inlined call.
* If the current function is inlined the breakpoint on the return
address won't be set, because inlined frames don't have a return
address.
* The code we use for stepout doesn't work at all if we are inside
an inlined call, instead we call 'next' but instruct it to remove
all PCs belonging to the current inlined call.
2017-11-13 15:54:08 +00:00
}
2019-11-01 19:41:06 +00:00
return nil , & ErrCouldNotFindLine { fileFound , filename , lineno }
}
// The code above will find the first occurence of an instruction
// corresponding to filename:line. If the function corresponding to that
// instruction has been inlined we don't just want to return the first
// occurence (which could be either the concrete version of the function or
// one of the inlinings) but instead:
// - the first instruction corresponding to filename:line in the concrete
// version of the function
// - the first instruction corresponding to filename:line in each inlined
// instance of the function.
fn := bi . PCToInlineFunc ( pc )
if fn == nil {
return [ ] uint64 { pc } , nil
proc: support inlining
Go 1.10 added inlined calls to debug_info, this commit adds support
for DW_TAG_inlined_call to delve, both for stack traces (where
inlined calls will appear as normal stack frames) and to correct
the behavior of next, step and stepout.
The calls to Next and Frame of stackIterator continue to work
unchanged and only return real stack frames, after reading each line
appendInlinedCalls is called to unpacked all the inlined calls that
involve the current PC.
The fake stack frames produced by appendInlinedCalls are
distinguished from real stack frames by having the Inlined attribute
set to true. Also their Current and Call locations are treated
differently. The Call location will be changed to represent the
position inside the inlined call, while the Current location will
always reference the real stack frame. This is done because:
* next, step and stepout need to access the debug_info entry of
the real function they are stepping through
* we are already manipulating Call in different ways while Current
is just what we read from the call stack
The strategy remains mostly the same, we disassemble the function
and we set a breakpoint on each instruction corresponding to a
different file:line. The function in question will be the one
corresponding to the first real (i.e. non-inlined) stack frame.
* If the current function contains inlined calls, 'next' will not
set any breakpoints on instructions that belong to inlined calls. We
do not do this for 'step'.
* If we are inside an inlined call that makes other inlined
functions, 'next' will not set any breakpoints that belong to
inlined calls that are children of the current inlined call.
* If the current function is inlined the breakpoint on the return
address won't be set, because inlined frames don't have a return
address.
* The code we use for stepout doesn't work at all if we are inside
an inlined call, instead we call 'next' but instruct it to remove
all PCs belonging to the current inlined call.
2017-11-13 15:54:08 +00:00
}
2019-11-01 19:41:06 +00:00
pcs = make ( [ ] uint64 , 0 , len ( fn . InlinedCalls ) + 1 )
pcs = appendLineToPCIn ( pcs , filename , lineno , fn . cu , fn , fn . Entry , fn . End )
for _ , call := range fn . InlinedCalls {
pcs = appendLineToPCIn ( pcs , filename , lineno , call . cu , bi . PCToFunc ( call . LowPC ) , call . LowPC , call . HighPC )
}
return pcs , nil
}
func appendLineToPCIn ( pcs [ ] uint64 , filename string , lineno int , cu * compileUnit , containingFn * Function , lowPC , highPC uint64 ) [ ] uint64 {
var entry uint64
if containingFn != nil {
entry = containingFn . Entry
}
pc := cu . lineInfo . LineToPCIn ( filename , lineno , entry , lowPC , highPC )
if pc != 0 {
return append ( pcs , pc )
}
return pcs
proc: support inlining
Go 1.10 added inlined calls to debug_info, this commit adds support
for DW_TAG_inlined_call to delve, both for stack traces (where
inlined calls will appear as normal stack frames) and to correct
the behavior of next, step and stepout.
The calls to Next and Frame of stackIterator continue to work
unchanged and only return real stack frames, after reading each line
appendInlinedCalls is called to unpacked all the inlined calls that
involve the current PC.
The fake stack frames produced by appendInlinedCalls are
distinguished from real stack frames by having the Inlined attribute
set to true. Also their Current and Call locations are treated
differently. The Call location will be changed to represent the
position inside the inlined call, while the Current location will
always reference the real stack frame. This is done because:
* next, step and stepout need to access the debug_info entry of
the real function they are stepping through
* we are already manipulating Call in different ways while Current
is just what we read from the call stack
The strategy remains mostly the same, we disassemble the function
and we set a breakpoint on each instruction corresponding to a
different file:line. The function in question will be the one
corresponding to the first real (i.e. non-inlined) stack frame.
* If the current function contains inlined calls, 'next' will not
set any breakpoints on instructions that belong to inlined calls. We
do not do this for 'step'.
* If we are inside an inlined call that makes other inlined
functions, 'next' will not set any breakpoints that belong to
inlined calls that are children of the current inlined call.
* If the current function is inlined the breakpoint on the return
address won't be set, because inlined frames don't have a return
address.
* The code we use for stepout doesn't work at all if we are inside
an inlined call, instead we call 'next' but instruct it to remove
all PCs belonging to the current inlined call.
2017-11-13 15:54:08 +00:00
}
2019-06-28 02:39:15 +00:00
// AllPCsForFileLines returns a map providing all PC addresses for filename and each line in linenos
func ( bi * BinaryInfo ) AllPCsForFileLines ( filename string , linenos [ ] int ) map [ int ] [ ] uint64 {
r := make ( map [ int ] [ ] uint64 )
for _ , line := range linenos {
r [ line ] = make ( [ ] uint64 , 0 , 1 )
}
for _ , cu := range bi . compileUnits {
2019-12-03 13:00:30 +00:00
if cu . lineInfo != nil && cu . lineInfo . Lookup [ filename ] != nil {
2019-06-28 02:39:15 +00:00
cu . lineInfo . AllPCsForFileLines ( filename , r )
}
}
return r
}
2019-11-01 19:41:06 +00:00
// PCToFunc returns the concrete function containing the given PC address.
// If the PC address belongs to an inlined call it will return the containing function.
2017-09-01 13:30:45 +00:00
func ( bi * BinaryInfo ) PCToFunc ( pc uint64 ) * Function {
i := sort . Search ( len ( bi . Functions ) , func ( i int ) bool {
fn := bi . Functions [ i ]
return pc <= fn . Entry || ( fn . Entry <= pc && pc < fn . End )
} )
if i != len ( bi . Functions ) {
fn := & bi . Functions [ i ]
if fn . Entry <= pc && pc < fn . End {
return fn
}
}
return nil
2017-04-21 06:55:53 +00:00
}
2019-11-01 19:41:06 +00:00
// PCToInlineFunc returns the function containing the given PC address.
// If the PC address belongs to an inlined call it will return the inlined function.
func ( bi * BinaryInfo ) PCToInlineFunc ( pc uint64 ) * Function {
fn := bi . PCToFunc ( pc )
2020-03-20 17:23:10 +00:00
dwarfTree , err := fn . cu . image . getDwarfTree ( fn . offset )
if err != nil {
return fn
2019-11-01 19:41:06 +00:00
}
2020-03-20 17:23:10 +00:00
entries := reader . InlineStack ( dwarfTree , pc )
if len ( entries ) == 0 {
2019-11-01 19:41:06 +00:00
return fn
}
2020-03-20 17:23:10 +00:00
fnname , okname := entries [ 0 ] . Val ( dwarf . AttrName ) . ( string )
2019-11-01 19:41:06 +00:00
if ! okname {
return fn
}
return bi . LookupFunc [ fnname ]
}
2019-08-08 03:15:20 +00:00
// PCToImage returns the image containing the given PC address.
func ( bi * BinaryInfo ) PCToImage ( pc uint64 ) * Image {
2019-05-08 21:06:38 +00:00
fn := bi . PCToFunc ( pc )
return bi . funcToImage ( fn )
}
2019-03-20 17:32:51 +00:00
// Image represents a loaded library file (shared object on linux, DLL on windows).
type Image struct {
2019-05-08 21:06:38 +00:00
Path string
StaticBase uint64
addr uint64
index int // index of this object in BinaryInfo.SharedObjects
closer io . Closer
sepDebugCloser io . Closer
dwarf * dwarf . Data
dwarfReader * dwarf . Reader
2019-11-12 19:44:08 +00:00
loclist * loclist . Reader
2019-05-08 21:06:38 +00:00
typeCache map [ dwarf . Offset ] godwarf . Type
2020-03-20 17:23:10 +00:00
dwarfTreeCache * simplelru . LRU
2019-05-08 21:06:38 +00:00
// runtimeTypeToDIE maps between the offset of a runtime._type in
// runtime.moduledata.types and the offset of the DIE in debug_info. This
// map is filled by using the extended attribute godwarf.AttrGoRuntimeType
// which was added in go 1.11.
runtimeTypeToDIE map [ uint64 ] runtimeTypeDIE
loadErrMu sync . Mutex
loadErr error
2019-03-20 17:32:51 +00:00
}
2019-08-08 19:25:50 +00:00
func ( image * Image ) registerRuntimeTypeToDIE ( entry * dwarf . Entry , ardr * reader . Reader ) {
if off , ok := entry . Val ( godwarf . AttrGoRuntimeType ) . ( uint64 ) ; ok {
if _ , ok := image . runtimeTypeToDIE [ off ] ; ! ok {
image . runtimeTypeToDIE [ off + image . StaticBase ] = runtimeTypeDIE { entry . Offset , - 1 }
}
}
}
2019-05-08 21:06:38 +00:00
// AddImage adds the specified image to bi, loading data asynchronously.
// Addr is the relocated entry point for the executable and staticBase (i.e.
// the relocation offset) for all other images.
// The first image added must be the executable file.
func ( bi * BinaryInfo ) AddImage ( path string , addr uint64 ) error {
// Check if the image is already present.
if len ( bi . Images ) > 0 && ! strings . HasPrefix ( path , "/" ) {
return nil
2019-03-20 17:32:51 +00:00
}
for _ , image := range bi . Images {
if image . Path == path && image . addr == addr {
2019-05-08 21:06:38 +00:00
return nil
}
}
// Actually add the image.
image := & Image { Path : path , addr : addr , typeCache : make ( map [ dwarf . Offset ] godwarf . Type ) }
2020-03-20 17:23:10 +00:00
image . dwarfTreeCache , _ = simplelru . NewLRU ( dwarfTreeCacheSize , nil )
2019-05-08 21:06:38 +00:00
// add Image regardless of error so that we don't attempt to re-add it every time we stop
image . index = len ( bi . Images )
bi . Images = append ( bi . Images , image )
err := loadBinaryInfo ( bi , image , path , addr )
if err != nil {
bi . Images [ len ( bi . Images ) - 1 ] . loadErr = err
}
return err
}
// moduleDataToImage finds the image corresponding to the given module data object.
func ( bi * BinaryInfo ) moduleDataToImage ( md * moduleData ) * Image {
return bi . funcToImage ( bi . PCToFunc ( uint64 ( md . text ) ) )
}
// imageToModuleData finds the module data in mds corresponding to the given image.
func ( bi * BinaryInfo ) imageToModuleData ( image * Image , mds [ ] moduleData ) * moduleData {
for _ , md := range mds {
im2 := bi . moduleDataToImage ( & md )
if im2 . index == image . index {
return & md
2019-03-20 17:32:51 +00:00
}
}
2019-05-08 21:06:38 +00:00
return nil
2019-03-20 17:32:51 +00:00
}
2019-05-08 21:06:38 +00:00
// typeToImage returns the image containing the give type.
func ( bi * BinaryInfo ) typeToImage ( typ godwarf . Type ) * Image {
return bi . Images [ typ . Common ( ) . Index ]
}
var errBinaryInfoClose = errors . New ( "multiple errors closing executable files" )
2018-08-31 18:08:18 +00:00
// Close closes all internal readers.
2017-04-06 18:14:01 +00:00
func ( bi * BinaryInfo ) Close ( ) error {
2019-05-08 21:06:38 +00:00
var errs [ ] error
for _ , image := range bi . Images {
if err := image . Close ( ) ; err != nil {
errs = append ( errs , err )
}
2018-06-20 10:20:35 +00:00
}
2019-05-08 21:06:38 +00:00
switch len ( errs ) {
case 0 :
return nil
case 1 :
return errs [ 0 ]
default :
return errBinaryInfoClose
2019-01-28 13:23:10 +00:00
}
2017-04-06 18:14:01 +00:00
}
2019-05-08 21:06:38 +00:00
func ( image * Image ) Close ( ) error {
var err1 , err2 error
if image . sepDebugCloser != nil {
err := image . sepDebugCloser . Close ( )
if err != nil {
err1 = fmt . Errorf ( "closing shared object %q (split dwarf): %v" , image . Path , err )
}
}
if image . closer != nil {
err := image . closer . Close ( )
if err != nil {
err2 = fmt . Errorf ( "closing shared object %q: %v" , image . Path , err )
}
}
if err1 != nil && err2 != nil {
return errBinaryInfoClose
}
if err1 != nil {
return err1
}
return err2
2017-08-15 06:21:24 +00:00
}
2019-05-08 21:06:38 +00:00
func ( image * Image ) setLoadError ( fmtstr string , args ... interface { } ) {
image . loadErrMu . Lock ( )
image . loadErr = fmt . Errorf ( fmtstr , args ... )
image . loadErrMu . Unlock ( )
}
// LoadError returns any error incurred while loading this image.
func ( image * Image ) LoadError ( ) error {
return image . loadErr
2017-08-15 06:21:24 +00:00
}
2020-03-20 17:23:10 +00:00
func ( image * Image ) getDwarfTree ( off dwarf . Offset ) ( * godwarf . Tree , error ) {
if r , ok := image . dwarfTreeCache . Get ( off ) ; ok {
return r . ( * godwarf . Tree ) , nil
}
r , err := godwarf . LoadTree ( off , image . dwarf , image . StaticBase )
if err != nil {
return nil , err
}
image . dwarfTreeCache . Add ( off , r )
return r , nil
}
2017-08-22 14:40:01 +00:00
type nilCloser struct { }
func ( c * nilCloser ) Close ( ) error { return nil }
2019-05-08 21:06:38 +00:00
// LoadImageFromData creates a new Image, using the specified data, and adds it to bi.
2017-08-24 07:46:47 +00:00
// This is used for debugging BinaryInfo, you should use LoadBinary instead.
2019-05-08 21:06:38 +00:00
func ( bi * BinaryInfo ) LoadImageFromData ( dwdata * dwarf . Data , debugFrameBytes , debugLineBytes , debugLocBytes [ ] byte ) {
image := & Image { }
image . closer = ( * nilCloser ) ( nil )
image . sepDebugCloser = ( * nilCloser ) ( nil )
image . dwarf = dwdata
image . typeCache = make ( map [ dwarf . Offset ] godwarf . Type )
2020-03-20 17:23:10 +00:00
image . dwarfTreeCache , _ = simplelru . NewLRU ( dwarfTreeCacheSize , nil )
2017-08-22 14:40:01 +00:00
if debugFrameBytes != nil {
2020-03-10 16:34:40 +00:00
bi . frameEntries = frame . Parse ( debugFrameBytes , frame . DwarfEndian ( debugFrameBytes ) , 0 , bi . Arch . PtrSize ( ) )
2017-08-22 14:40:01 +00:00
}
2019-11-12 19:44:08 +00:00
image . loclist = loclist . New ( debugLocBytes , bi . Arch . PtrSize ( ) )
2019-05-08 21:06:38 +00:00
bi . loadDebugInfoMaps ( image , debugLineBytes , nil , nil )
2017-08-24 07:46:47 +00:00
2019-05-08 21:06:38 +00:00
bi . Images = append ( bi . Images , image )
2017-08-24 07:46:47 +00:00
}
2020-03-20 17:23:10 +00:00
func ( bi * BinaryInfo ) locationExpr ( entry godwarf . Entry , attr dwarf . Attr , pc uint64 ) ( [ ] byte , string , error ) {
2017-08-24 07:46:47 +00:00
a := entry . Val ( attr )
if a == nil {
2018-07-28 19:12:07 +00:00
return nil , "" , fmt . Errorf ( "no location attribute %s" , attr )
2017-08-24 07:46:47 +00:00
}
if instr , ok := a . ( [ ] byte ) ; ok {
2017-11-21 08:50:14 +00:00
var descr bytes . Buffer
fmt . Fprintf ( & descr , "[block] " )
op . PrettyPrint ( & descr , instr )
2018-07-28 19:12:07 +00:00
return instr , descr . String ( ) , nil
2017-08-24 07:46:47 +00:00
}
off , ok := a . ( int64 )
if ! ok {
2018-07-28 19:12:07 +00:00
return nil , "" , fmt . Errorf ( "could not interpret location attribute %s" , attr )
2017-08-24 07:46:47 +00:00
}
instr := bi . loclistEntry ( off , pc )
if instr == nil {
2018-07-28 19:12:07 +00:00
return nil , "" , fmt . Errorf ( "could not find loclist entry at %#x for address %#x" , off , pc )
2017-08-24 07:46:47 +00:00
}
2017-11-21 08:50:14 +00:00
var descr bytes . Buffer
fmt . Fprintf ( & descr , "[%#x:%#x] " , off , pc )
op . PrettyPrint ( & descr , instr )
2018-07-28 19:12:07 +00:00
return instr , descr . String ( ) , nil
}
2019-06-24 15:02:14 +00:00
// LocationCovers returns the list of PC addresses that is covered by the
// location attribute 'attr' of entry 'entry'.
func ( bi * BinaryInfo ) LocationCovers ( entry * dwarf . Entry , attr dwarf . Attr ) ( [ ] [ 2 ] uint64 , error ) {
a := entry . Val ( attr )
if a == nil {
return nil , fmt . Errorf ( "attribute %s not found" , attr )
}
if _ , isblock := a . ( [ ] byte ) ; isblock {
return [ ] [ 2 ] uint64 { [ 2 ] uint64 { 0 , ^ uint64 ( 0 ) } } , nil
}
off , ok := a . ( int64 )
if ! ok {
return nil , fmt . Errorf ( "attribute %s of unsupported type %T" , attr , a )
}
cu := bi . findCompileUnitForOffset ( entry . Offset )
if cu == nil {
return nil , errors . New ( "could not find compile unit" )
}
image := cu . image
base := cu . lowPC
2019-11-12 19:44:08 +00:00
if image == nil || image . loclist . Empty ( ) {
2019-06-24 15:02:14 +00:00
return nil , errors . New ( "malformed executable" )
}
r := [ ] [ 2 ] uint64 { }
2019-11-12 19:44:08 +00:00
var e loclist . Entry
2019-06-24 15:02:14 +00:00
image . loclist . Seek ( int ( off ) )
for image . loclist . Next ( & e ) {
if e . BaseAddressSelection ( ) {
2019-11-12 19:44:08 +00:00
base = e . HighPC
2019-06-24 15:02:14 +00:00
continue
}
2019-11-12 19:44:08 +00:00
r = append ( r , [ 2 ] uint64 { e . LowPC + base , e . HighPC + base } )
2019-06-24 15:02:14 +00:00
}
return r , nil
}
2018-07-28 19:12:07 +00:00
// Location returns the location described by attribute attr of entry.
// This will either be an int64 address or a slice of Pieces for locations
// that don't correspond to a single memory address (registers, composite
// locations).
2020-03-20 17:23:10 +00:00
func ( bi * BinaryInfo ) Location ( entry godwarf . Entry , attr dwarf . Attr , pc uint64 , regs op . DwarfRegisters ) ( int64 , [ ] op . Piece , string , error ) {
2018-07-28 19:12:07 +00:00
instr , descr , err := bi . locationExpr ( entry , attr , pc )
if err != nil {
return 0 , nil , "" , err
}
2020-03-10 16:34:40 +00:00
addr , pieces , err := op . ExecuteStackProgram ( regs , instr , bi . Arch . PtrSize ( ) )
2018-07-28 19:12:07 +00:00
return addr , pieces , descr , err
2017-08-24 07:46:47 +00:00
}
// loclistEntry returns the loclist entry in the loclist starting at off,
// for address pc.
func ( bi * BinaryInfo ) loclistEntry ( off int64 , pc uint64 ) [ ] byte {
var base uint64
2019-05-08 21:06:38 +00:00
image := bi . Images [ 0 ]
2017-08-24 07:46:47 +00:00
if cu := bi . findCompileUnit ( pc ) ; cu != nil {
2018-11-06 22:34:26 +00:00
base = cu . lowPC
2019-05-08 21:06:38 +00:00
image = cu . image
}
2019-11-12 19:44:08 +00:00
if image == nil || image . loclist . Empty ( ) {
2019-05-08 21:06:38 +00:00
return nil
2017-08-24 07:46:47 +00:00
}
2019-05-08 21:06:38 +00:00
image . loclist . Seek ( int ( off ) )
2019-11-12 19:44:08 +00:00
var e loclist . Entry
2019-05-08 21:06:38 +00:00
for image . loclist . Next ( & e ) {
2017-08-24 07:46:47 +00:00
if e . BaseAddressSelection ( ) {
2019-11-12 19:44:08 +00:00
base = e . HighPC
2017-08-24 07:46:47 +00:00
continue
}
2019-12-10 14:07:39 +00:00
if pc >= e . LowPC + base + image . StaticBase && pc < e . HighPC + base + image . StaticBase {
2019-11-12 19:44:08 +00:00
return e . Instr
2017-08-24 07:46:47 +00:00
}
}
return nil
}
// findCompileUnit returns the compile unit containing address pc.
func ( bi * BinaryInfo ) findCompileUnit ( pc uint64 ) * compileUnit {
for _ , cu := range bi . compileUnits {
2018-11-06 22:34:26 +00:00
for _ , rng := range cu . ranges {
2018-05-29 15:01:51 +00:00
if pc >= rng [ 0 ] && pc < rng [ 1 ] {
return cu
}
2018-08-17 06:17:22 +00:00
}
}
return nil
}
func ( bi * BinaryInfo ) findCompileUnitForOffset ( off dwarf . Offset ) * compileUnit {
2019-06-24 15:02:14 +00:00
i := sort . Search ( len ( bi . compileUnits ) , func ( i int ) bool {
return bi . compileUnits [ i ] . offset >= off
} )
if i > 0 {
i --
2017-08-24 07:46:47 +00:00
}
2019-06-24 15:02:14 +00:00
return bi . compileUnits [ i ]
2017-08-22 14:40:01 +00:00
}
2018-08-31 18:08:18 +00:00
// Producer returns the value of DW_AT_producer.
2018-04-14 09:04:14 +00:00
func ( bi * BinaryInfo ) Producer ( ) string {
for _ , cu := range bi . compileUnits {
if cu . isgo && cu . producer != "" {
return cu . producer
}
}
return ""
}
2018-05-04 17:31:45 +00:00
// Type returns the Dwarf type entry at `offset`.
2019-05-08 21:06:38 +00:00
func ( image * Image ) Type ( offset dwarf . Offset ) ( godwarf . Type , error ) {
return godwarf . ReadType ( image . dwarf , image . index , offset , image . typeCache )
}
// funcToImage returns the Image containing function fn, or the
// executable file as a fallback.
func ( bi * BinaryInfo ) funcToImage ( fn * Function ) * Image {
if fn == nil {
return bi . Images [ 0 ]
}
return fn . cu . image
2018-05-04 17:31:45 +00:00
}
2017-04-06 18:14:01 +00:00
// ELF ///////////////////////////////////////////////////////////////
2018-08-31 18:08:18 +00:00
// ErrNoBuildIDNote is used in openSeparateDebugInfo to signal there's no
2018-06-20 10:20:35 +00:00
// build-id note on the binary, so LoadBinaryInfoElf will return
// the error message coming from elfFile.DWARF() instead.
2018-08-31 18:08:18 +00:00
type ErrNoBuildIDNote struct { }
2018-06-20 10:20:35 +00:00
2018-08-31 18:08:18 +00:00
func ( e * ErrNoBuildIDNote ) Error ( ) string {
2018-06-20 10:20:35 +00:00
return "can't find build-id note on binary"
}
// openSeparateDebugInfo searches for a file containing the separate
// debug info for the binary using the "build ID" method as described
// in GDB's documentation [1], and if found returns two handles, one
// for the bare file, and another for its corresponding elf.File.
// [1] https://sourceware.org/gdb/onlinedocs/gdb/Separate-Debug-Files.html
2018-11-07 22:21:35 +00:00
//
// Alternatively, if the debug file cannot be found be the build-id, Delve
// will look in directories specified by the debug-info-directories config value.
2019-05-08 21:06:38 +00:00
func ( bi * BinaryInfo ) openSeparateDebugInfo ( image * Image , exe * elf . File , debugInfoDirectories [ ] string ) ( * os . File , * elf . File , error ) {
2018-11-07 22:21:35 +00:00
var debugFilePath string
for _ , dir := range debugInfoDirectories {
var potentialDebugFilePath string
if strings . Contains ( dir , "build-id" ) {
desc1 , desc2 , err := parseBuildID ( exe )
if err != nil {
continue
}
potentialDebugFilePath = fmt . Sprintf ( "%s/%s/%s.debug" , dir , desc1 , desc2 )
} else {
2019-05-08 21:06:38 +00:00
potentialDebugFilePath = fmt . Sprintf ( "%s/%s.debug" , dir , filepath . Base ( image . Path ) )
2018-11-07 22:21:35 +00:00
}
_ , err := os . Stat ( potentialDebugFilePath )
if err == nil {
debugFilePath = potentialDebugFilePath
break
}
}
if debugFilePath == "" {
return nil , nil , ErrNoDebugInfoFound
}
sepFile , err := os . OpenFile ( debugFilePath , 0 , os . ModePerm )
if err != nil {
return nil , nil , errors . New ( "can't open separate debug file: " + err . Error ( ) )
}
elfFile , err := elf . NewFile ( sepFile )
if err != nil {
sepFile . Close ( )
return nil , nil , fmt . Errorf ( "can't open separate debug file %q: %v" , debugFilePath , err . Error ( ) )
}
2020-03-10 16:34:40 +00:00
if ! supportedLinuxArch [ elfFile . Machine ] {
2018-11-07 22:21:35 +00:00
sepFile . Close ( )
2020-03-10 16:34:40 +00:00
return nil , nil , fmt . Errorf ( "can't open separate debug file %q: %v" , debugFilePath , & ErrUnsupportedArch { os : "linux" , cpuArch : elfFile . Machine } )
2018-11-07 22:21:35 +00:00
}
return sepFile , elfFile , nil
}
func parseBuildID ( exe * elf . File ) ( string , string , error ) {
2018-06-20 10:20:35 +00:00
buildid := exe . Section ( ".note.gnu.build-id" )
if buildid == nil {
2018-11-07 22:21:35 +00:00
return "" , "" , & ErrNoBuildIDNote { }
2018-06-20 10:20:35 +00:00
}
br := buildid . Open ( )
2018-08-31 18:08:18 +00:00
bh := new ( buildIDHeader )
2018-06-20 10:20:35 +00:00
if err := binary . Read ( br , binary . LittleEndian , bh ) ; err != nil {
2018-11-07 22:21:35 +00:00
return "" , "" , errors . New ( "can't read build-id header: " + err . Error ( ) )
2018-06-20 10:20:35 +00:00
}
name := make ( [ ] byte , bh . Namesz )
if err := binary . Read ( br , binary . LittleEndian , name ) ; err != nil {
2018-11-07 22:21:35 +00:00
return "" , "" , errors . New ( "can't read build-id name: " + err . Error ( ) )
2018-06-20 10:20:35 +00:00
}
if strings . TrimSpace ( string ( name ) ) != "GNU\x00" {
2018-11-07 22:21:35 +00:00
return "" , "" , errors . New ( "invalid build-id signature" )
2018-06-20 10:20:35 +00:00
}
descBinary := make ( [ ] byte , bh . Descsz )
if err := binary . Read ( br , binary . LittleEndian , descBinary ) ; err != nil {
2018-11-07 22:21:35 +00:00
return "" , "" , errors . New ( "can't read build-id desc: " + err . Error ( ) )
2018-06-20 10:20:35 +00:00
}
desc := hex . EncodeToString ( descBinary )
2018-11-07 22:21:35 +00:00
return desc [ : 2 ] , desc [ 2 : ] , nil
2018-06-20 10:20:35 +00:00
}
2019-05-08 21:06:38 +00:00
// loadBinaryInfoElf specifically loads information from an ELF binary.
func loadBinaryInfoElf ( bi * BinaryInfo , image * Image , path string , addr uint64 , wg * sync . WaitGroup ) error {
2017-04-06 18:14:01 +00:00
exe , err := os . OpenFile ( path , 0 , os . ModePerm )
if err != nil {
return err
}
2019-05-08 21:06:38 +00:00
image . closer = exe
2017-04-06 18:14:01 +00:00
elfFile , err := elf . NewFile ( exe )
if err != nil {
return err
}
2020-03-10 16:34:40 +00:00
if ! supportedLinuxArch [ elfFile . Machine ] {
return & ErrUnsupportedArch { os : "linux" , cpuArch : elfFile . Machine }
2017-04-06 18:14:01 +00:00
}
2018-05-29 15:01:51 +00:00
2019-05-08 21:06:38 +00:00
if image . index == 0 {
// adding executable file:
// - addr is entryPoint therefore staticBase needs to be calculated by
// subtracting the entry point specified in the executable file from addr.
// - memory address of the .dynamic section needs to be recorded in
// BinaryInfo so that we can find loaded libraries.
if addr != 0 {
image . StaticBase = addr - elfFile . Entry
} else if elfFile . Type == elf . ET_DYN {
2018-05-29 15:01:51 +00:00
return ErrCouldNotDetermineRelocation
}
2019-05-08 21:06:38 +00:00
if dynsec := elfFile . Section ( ".dynamic" ) ; dynsec != nil {
bi . ElfDynamicSection . Addr = dynsec . Addr + image . StaticBase
bi . ElfDynamicSection . Size = dynsec . Size
}
} else {
image . StaticBase = addr
2019-03-20 17:32:51 +00:00
}
2018-06-20 10:20:35 +00:00
dwarfFile := elfFile
2018-05-29 15:01:51 +00:00
2019-05-08 21:06:38 +00:00
image . dwarf , err = elfFile . DWARF ( )
2017-04-06 18:14:01 +00:00
if err != nil {
2018-06-20 10:20:35 +00:00
var sepFile * os . File
var serr error
2019-05-08 21:06:38 +00:00
sepFile , dwarfFile , serr = bi . openSeparateDebugInfo ( image , elfFile , bi . debugInfoDirectories )
2018-06-20 10:20:35 +00:00
if serr != nil {
return serr
}
2019-05-08 21:06:38 +00:00
image . sepDebugCloser = sepFile
image . dwarf , err = dwarfFile . DWARF ( )
2018-06-20 10:20:35 +00:00
if err != nil {
return err
}
2017-04-06 18:14:01 +00:00
}
2019-05-08 21:06:38 +00:00
image . dwarfReader = image . dwarf . Reader ( )
2018-02-13 17:20:45 +00:00
2018-06-18 08:05:21 +00:00
debugLineBytes , err := godwarf . GetDebugSectionElf ( dwarfFile , "line" )
2017-09-01 13:30:45 +00:00
if err != nil {
return err
}
2018-06-18 08:05:21 +00:00
debugLocBytes , _ := godwarf . GetDebugSectionElf ( dwarfFile , "loc" )
2019-11-12 19:44:08 +00:00
image . loclist = loclist . New ( debugLocBytes , bi . Arch . PtrSize ( ) )
2017-09-01 13:30:45 +00:00
2020-03-10 16:34:40 +00:00
wg . Add ( 3 )
2019-05-08 21:06:38 +00:00
go bi . parseDebugFrameElf ( image , dwarfFile , wg )
go bi . loadDebugInfoMaps ( image , debugLineBytes , wg , nil )
2020-03-10 16:34:40 +00:00
go bi . loadSymbolName ( image , elfFile , wg )
2019-05-08 21:06:38 +00:00
if image . index == 0 {
// determine g struct offset only when loading the executable file
wg . Add ( 1 )
go bi . setGStructOffsetElf ( image , dwarfFile , wg )
}
2017-04-06 18:14:01 +00:00
return nil
}
2020-03-10 16:34:40 +00:00
// STT_FUNC is a code object, see /usr/include/elf.h for a full definition.
const STT_FUNC = 2
func ( bi * BinaryInfo ) loadSymbolName ( image * Image , file * elf . File , wg * sync . WaitGroup ) {
defer wg . Done ( )
if bi . SymNames == nil {
bi . SymNames = make ( map [ uint64 ] * elf . Symbol )
}
symSecs , _ := file . Symbols ( )
if symSecs != nil {
for _ , symSec := range symSecs {
if symSec . Info == STT_FUNC { // TODO(chainhelen), need to parse others types.
s := symSec
bi . SymNames [ symSec . Value + image . StaticBase ] = & s
}
}
}
}
2019-05-08 21:06:38 +00:00
func ( bi * BinaryInfo ) parseDebugFrameElf ( image * Image , exe * elf . File , wg * sync . WaitGroup ) {
2017-04-06 18:14:01 +00:00
defer wg . Done ( )
2018-06-18 08:05:21 +00:00
debugFrameData , err := godwarf . GetDebugSectionElf ( exe , "frame" )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not get .debug_frame section: %v" , err )
2017-08-15 06:21:24 +00:00
return
2017-04-06 18:14:01 +00:00
}
2018-06-18 08:05:21 +00:00
debugInfoData , err := godwarf . GetDebugSectionElf ( exe , "info" )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not get .debug_info section: %v" , err )
2018-06-18 08:05:21 +00:00
return
2017-04-06 18:14:01 +00:00
}
2020-03-10 16:34:40 +00:00
bi . frameEntries = bi . frameEntries . Append ( frame . Parse ( debugFrameData , frame . DwarfEndian ( debugInfoData ) , image . StaticBase , bi . Arch . PtrSize ( ) ) )
2017-08-24 07:46:47 +00:00
}
2019-05-08 21:06:38 +00:00
func ( bi * BinaryInfo ) setGStructOffsetElf ( image * Image , exe * elf . File , wg * sync . WaitGroup ) {
2017-06-21 22:40:42 +00:00
defer wg . Done ( )
// This is a bit arcane. Essentially:
// - If the program is pure Go, it can do whatever it wants, and puts the G
2020-03-10 16:34:40 +00:00
// pointer at %fs-8 on 64 bit.
// - %Gs is the index of private storage in GDT on 32 bit, and puts the G
// pointer at -4(tls).
2017-06-21 22:40:42 +00:00
// - Otherwise, Go asks the external linker to place the G pointer by
// emitting runtime.tlsg, a TLS symbol, which is relocated to the chosen
// offset in libc's TLS block.
symbols , err := exe . Symbols ( )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not parse ELF symbols: %v" , err )
2017-08-15 06:21:24 +00:00
return
2017-06-21 22:40:42 +00:00
}
var tlsg * elf . Symbol
for _ , symbol := range symbols {
if symbol . Name == "runtime.tlsg" {
s := symbol
tlsg = & s
break
}
}
var tls * elf . Prog
for _ , prog := range exe . Progs {
if prog . Type == elf . PT_TLS {
tls = prog
break
}
}
2020-03-10 16:34:40 +00:00
if tlsg == nil || tls == nil {
bi . gStructOffset = ^ uint64 ( bi . Arch . PtrSize ( ) ) + 1 //-ptrSize
2019-02-26 17:17:05 +00:00
return
}
2018-11-28 17:26:01 +00:00
2019-09-04 16:01:53 +00:00
// According to https://reviews.llvm.org/D61824, linkers must pad the actual
// size of the TLS segment to ensure that (tlsoffset%align) == (vaddr%align).
// This formula, copied from the lld code, matches that.
// https://github.com/llvm-mirror/lld/blob/9aef969544981d76bea8e4d1961d3a6980980ef9/ELF/InputSection.cpp#L643
memsz := tls . Memsz + ( - tls . Vaddr - tls . Memsz ) & ( tls . Align - 1 )
2017-06-21 22:40:42 +00:00
// The TLS register points to the end of the TLS block, which is
// tls.Memsz long. runtime.tlsg is an offset from the beginning of that block.
2018-11-28 17:26:01 +00:00
bi . gStructOffset = ^ ( memsz ) + 1 + tlsg . Value // -tls.Memsz + tlsg.Value
2017-06-21 22:40:42 +00:00
}
2017-04-06 18:14:01 +00:00
// PE ////////////////////////////////////////////////////////////////
2018-05-29 15:01:51 +00:00
const _IMAGE_DLLCHARACTERISTICS_DYNAMIC_BASE = 0x0040
2019-05-08 21:06:38 +00:00
// loadBinaryInfoPE specifically loads information from a PE binary.
func loadBinaryInfoPE ( bi * BinaryInfo , image * Image , path string , entryPoint uint64 , wg * sync . WaitGroup ) error {
2017-04-06 18:14:01 +00:00
peFile , closer , err := openExecutablePathPE ( path )
if err != nil {
return err
}
2019-05-08 21:06:38 +00:00
image . closer = closer
2020-03-10 16:34:40 +00:00
cpuArch := PEMachine ( peFile . Machine )
if ! supportedWindowsArch [ cpuArch ] {
return & ErrUnsupportedArch { os : "windows" , cpuArch : cpuArch }
2017-04-06 18:14:01 +00:00
}
2019-05-08 21:06:38 +00:00
image . dwarf , err = peFile . DWARF ( )
2017-04-06 18:14:01 +00:00
if err != nil {
return err
}
2018-05-29 15:01:51 +00:00
//TODO(aarzilli): actually test this when Go supports PIE buildmode on Windows.
opth := peFile . OptionalHeader . ( * pe . OptionalHeader64 )
if entryPoint != 0 {
2019-05-08 21:06:38 +00:00
image . StaticBase = entryPoint - opth . ImageBase
2018-05-29 15:01:51 +00:00
} else {
if opth . DllCharacteristics & _IMAGE_DLLCHARACTERISTICS_DYNAMIC_BASE != 0 {
return ErrCouldNotDetermineRelocation
}
}
2019-05-08 21:06:38 +00:00
image . dwarfReader = image . dwarf . Reader ( )
2018-02-13 17:20:45 +00:00
2018-06-18 08:05:21 +00:00
debugLineBytes , err := godwarf . GetDebugSectionPE ( peFile , "line" )
2017-09-01 13:30:45 +00:00
if err != nil {
return err
}
2018-06-18 08:05:21 +00:00
debugLocBytes , _ := godwarf . GetDebugSectionPE ( peFile , "loc" )
2019-11-12 19:44:08 +00:00
image . loclist = loclist . New ( debugLocBytes , bi . Arch . PtrSize ( ) )
2017-09-01 13:30:45 +00:00
wg . Add ( 2 )
2019-05-08 21:06:38 +00:00
go bi . parseDebugFramePE ( image , peFile , wg )
go bi . loadDebugInfoMaps ( image , debugLineBytes , wg , nil )
2017-06-21 22:40:42 +00:00
// Use ArbitraryUserPointer (0x28) as pointer to pointer
// to G struct per:
// https://golang.org/src/runtime/cgo/gcc_windows_amd64.c
bi . gStructOffset = 0x28
2017-04-06 18:14:01 +00:00
return nil
}
func openExecutablePathPE ( path string ) ( * pe . File , io . Closer , error ) {
f , err := os . OpenFile ( path , 0 , os . ModePerm )
if err != nil {
return nil , nil , err
}
peFile , err := pe . NewFile ( f )
if err != nil {
f . Close ( )
return nil , nil , err
}
return peFile , f , nil
}
2019-05-08 21:06:38 +00:00
func ( bi * BinaryInfo ) parseDebugFramePE ( image * Image , exe * pe . File , wg * sync . WaitGroup ) {
2017-04-06 18:14:01 +00:00
defer wg . Done ( )
2018-06-18 08:05:21 +00:00
debugFrameBytes , err := godwarf . GetDebugSectionPE ( exe , "frame" )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not get .debug_frame section: %v" , err )
2017-08-15 06:21:24 +00:00
return
2017-04-06 18:14:01 +00:00
}
2018-06-18 08:05:21 +00:00
debugInfoBytes , err := godwarf . GetDebugSectionPE ( exe , "info" )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not get .debug_info section: %v" , err )
2018-06-18 08:05:21 +00:00
return
}
2020-03-10 16:34:40 +00:00
bi . frameEntries = bi . frameEntries . Append ( frame . Parse ( debugFrameBytes , frame . DwarfEndian ( debugInfoBytes ) , image . StaticBase , bi . Arch . PtrSize ( ) ) )
2017-04-06 18:14:01 +00:00
}
// Borrowed from https://golang.org/src/cmd/internal/objfile/pe.go
func findPESymbol ( f * pe . File , name string ) ( * pe . Symbol , error ) {
for _ , s := range f . Symbols {
if s . Name != name {
continue
}
if s . SectionNumber <= 0 {
return nil , fmt . Errorf ( "symbol %s: invalid section number %d" , name , s . SectionNumber )
}
if len ( f . Sections ) < int ( s . SectionNumber ) {
return nil , fmt . Errorf ( "symbol %s: section number %d is larger than max %d" , name , s . SectionNumber , len ( f . Sections ) )
}
return s , nil
}
return nil , fmt . Errorf ( "no %s symbol found" , name )
}
// MACH-O ////////////////////////////////////////////////////////////
2019-05-08 21:06:38 +00:00
// loadBinaryInfoMacho specifically loads information from a Mach-O binary.
func loadBinaryInfoMacho ( bi * BinaryInfo , image * Image , path string , entryPoint uint64 , wg * sync . WaitGroup ) error {
2017-04-06 18:14:01 +00:00
exe , err := macho . Open ( path )
if err != nil {
return err
}
2019-05-08 21:06:38 +00:00
image . closer = exe
2020-03-10 16:34:40 +00:00
if ! supportedDarwinArch [ exe . Cpu ] {
return & ErrUnsupportedArch { os : "darwin" , cpuArch : exe . Cpu }
2017-04-06 18:14:01 +00:00
}
2019-05-08 21:06:38 +00:00
image . dwarf , err = exe . DWARF ( )
2017-04-06 18:14:01 +00:00
if err != nil {
return err
}
2019-05-08 21:06:38 +00:00
image . dwarfReader = image . dwarf . Reader ( )
2018-02-13 17:20:45 +00:00
2018-06-18 08:05:21 +00:00
debugLineBytes , err := godwarf . GetDebugSectionMacho ( exe , "line" )
2017-09-01 13:30:45 +00:00
if err != nil {
return err
}
2018-06-18 08:05:21 +00:00
debugLocBytes , _ := godwarf . GetDebugSectionMacho ( exe , "loc" )
2019-11-12 19:44:08 +00:00
image . loclist = loclist . New ( debugLocBytes , bi . Arch . PtrSize ( ) )
2017-09-01 13:30:45 +00:00
wg . Add ( 2 )
2019-05-08 21:06:38 +00:00
go bi . parseDebugFrameMacho ( image , exe , wg )
go bi . loadDebugInfoMaps ( image , debugLineBytes , wg , bi . setGStructOffsetMacho )
2017-04-06 18:14:01 +00:00
return nil
}
2018-04-14 09:04:14 +00:00
func ( bi * BinaryInfo ) setGStructOffsetMacho ( ) {
// In go1.11 it's 0x30, before 0x8a0, see:
// https://github.com/golang/go/issues/23617
// and go commit b3a854c733257c5249c3435ffcee194f8439676a
producer := bi . Producer ( )
if producer != "" && goversion . ProducerAfterOrEqual ( producer , 1 , 11 ) {
bi . gStructOffset = 0x30
return
}
bi . gStructOffset = 0x8a0
}
2019-05-08 21:06:38 +00:00
func ( bi * BinaryInfo ) parseDebugFrameMacho ( image * Image , exe * macho . File , wg * sync . WaitGroup ) {
2017-04-06 18:14:01 +00:00
defer wg . Done ( )
2018-06-18 08:05:21 +00:00
debugFrameBytes , err := godwarf . GetDebugSectionMacho ( exe , "frame" )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not get __debug_frame section: %v" , err )
2017-08-15 06:21:24 +00:00
return
2017-04-06 18:14:01 +00:00
}
2018-06-18 08:05:21 +00:00
debugInfoBytes , err := godwarf . GetDebugSectionMacho ( exe , "info" )
if err != nil {
2019-05-08 21:06:38 +00:00
image . setLoadError ( "could not get .debug_info section: %v" , err )
2018-06-18 08:05:21 +00:00
return
2017-04-06 18:14:01 +00:00
}
2017-08-24 07:46:47 +00:00
2020-03-10 16:34:40 +00:00
bi . frameEntries = bi . frameEntries . Append ( frame . Parse ( debugFrameBytes , frame . DwarfEndian ( debugInfoBytes ) , image . StaticBase , bi . Arch . PtrSize ( ) ) )
2017-08-24 07:46:47 +00:00
}
2019-08-08 19:25:50 +00:00
// Do not call this function directly it isn't able to deal correctly with package paths
func ( bi * BinaryInfo ) findType ( name string ) ( godwarf . Type , error ) {
ref , found := bi . types [ name ]
if ! found {
return nil , reader . TypeNotFoundErr
}
image := bi . Images [ ref . imageIndex ]
return godwarf . ReadType ( image . dwarf , ref . imageIndex , ref . offset , image . typeCache )
}
func ( bi * BinaryInfo ) findTypeExpr ( expr ast . Expr ) ( godwarf . Type , error ) {
if lit , islit := expr . ( * ast . BasicLit ) ; islit && lit . Kind == token . STRING {
// Allow users to specify type names verbatim as quoted
// string. Useful as a catch-all workaround for cases where we don't
// parse/serialize types correctly or can not resolve package paths.
typn , _ := strconv . Unquote ( lit . Value )
2019-10-26 15:15:33 +00:00
// Check if the type in question is an array type, in which case we try to
// fake it.
if len ( typn ) > 0 && typn [ 0 ] == '[' {
closedBrace := strings . Index ( typn , "]" )
if closedBrace > 1 {
n , err := strconv . Atoi ( typn [ 1 : closedBrace ] )
if err == nil {
return bi . findArrayType ( n , typn [ closedBrace + 1 : ] )
}
}
}
2019-08-08 19:25:50 +00:00
return bi . findType ( typn )
}
bi . expandPackagesInType ( expr )
if snode , ok := expr . ( * ast . StarExpr ) ; ok {
// Pointer types only appear in the dwarf informations when
// a pointer to the type is used in the target program, here
// we create a pointer type on the fly so that the user can
// specify a pointer to any variable used in the target program
ptyp , err := bi . findTypeExpr ( snode . X )
if err != nil {
return nil , err
}
return pointerTo ( ptyp , bi . Arch ) , nil
}
if anode , ok := expr . ( * ast . ArrayType ) ; ok {
2019-10-26 15:15:33 +00:00
// Array types (for example [N]byte) are only present in DWARF if they are
2019-08-08 19:25:50 +00:00
// used by the program, but it's convenient to make all of them available
2019-10-26 15:15:33 +00:00
// to the user for two reasons:
// 1. to allow reading arbitrary memory byte-by-byte (by casting an
// address to an array of bytes).
// 2. to read the contents of a channel's buffer (we create fake array
// types for them)
2019-08-08 19:25:50 +00:00
alen , litlen := anode . Len . ( * ast . BasicLit )
if litlen && alen . Kind == token . INT {
n , _ := strconv . Atoi ( alen . Value )
2019-10-26 15:15:33 +00:00
return bi . findArrayType ( n , exprToString ( anode . Elt ) )
2019-08-08 19:25:50 +00:00
}
}
return bi . findType ( exprToString ( expr ) )
}
2019-10-26 15:15:33 +00:00
func ( bi * BinaryInfo ) findArrayType ( n int , etyp string ) ( godwarf . Type , error ) {
switch etyp {
case "byte" , "uint8" :
etyp = "uint8"
fallthrough
default :
btyp , err := bi . findType ( etyp )
if err != nil {
return nil , err
}
return fakeArrayType ( uint64 ( n ) , btyp ) , nil
}
}
2019-08-08 19:25:50 +00:00
func complexType ( typename string ) bool {
for _ , ch := range typename {
switch ch {
case '*' , '[' , '<' , '{' , '(' , ' ' :
return true
}
}
return false
}
func ( bi * BinaryInfo ) registerTypeToPackageMap ( entry * dwarf . Entry ) {
if entry . Tag != dwarf . TagTypedef && entry . Tag != dwarf . TagBaseType && entry . Tag != dwarf . TagClassType && entry . Tag != dwarf . TagStructType {
return
}
typename , ok := entry . Val ( dwarf . AttrName ) . ( string )
if ! ok || complexType ( typename ) {
return
}
dot := strings . LastIndex ( typename , "." )
if dot < 0 {
return
}
path := typename [ : dot ]
slash := strings . LastIndex ( path , "/" )
if slash < 0 || slash + 1 >= len ( path ) {
return
}
name := path [ slash + 1 : ]
2019-11-25 17:10:18 +00:00
bi . PackageMap [ name ] = [ ] string { path }
2019-08-08 19:25:50 +00:00
}
func ( bi * BinaryInfo ) loadDebugInfoMaps ( image * Image , debugLineBytes [ ] byte , wg * sync . WaitGroup , cont func ( ) ) {
if wg != nil {
defer wg . Done ( )
}
2019-08-08 19:39:52 +00:00
if bi . types == nil {
2019-08-08 19:25:50 +00:00
bi . types = make ( map [ string ] dwarfRef )
2019-08-08 19:39:52 +00:00
}
if bi . consts == nil {
2019-08-08 19:25:50 +00:00
bi . consts = make ( map [ dwarfRef ] * constantType )
2019-08-08 19:39:52 +00:00
}
2019-11-25 17:10:18 +00:00
if bi . PackageMap == nil {
bi . PackageMap = make ( map [ string ] [ ] string )
2019-08-08 19:25:50 +00:00
}
2019-11-01 19:41:06 +00:00
if bi . inlinedCallLines == nil {
bi . inlinedCallLines = make ( map [ fileLine ] [ ] uint64 )
}
2019-08-08 19:25:50 +00:00
image . runtimeTypeToDIE = make ( map [ uint64 ] runtimeTypeDIE )
ctxt := newLoadDebugInfoMapsContext ( bi , image )
reader := image . DwarfReader ( )
for entry , err := reader . Next ( ) ; entry != nil ; entry , err = reader . Next ( ) {
if err != nil {
image . setLoadError ( "error reading debug_info: %v" , err )
break
}
switch entry . Tag {
case dwarf . TagCompileUnit :
cu := & compileUnit { }
cu . image = image
cu . entry = entry
cu . offset = entry . Offset
if lang , _ := entry . Val ( dwarf . AttrLanguage ) . ( int64 ) ; lang == dwarfGoLanguage {
cu . isgo = true
}
cu . name , _ = entry . Val ( dwarf . AttrName ) . ( string )
compdir , _ := entry . Val ( dwarf . AttrCompDir ) . ( string )
if compdir != "" {
cu . name = filepath . Join ( compdir , cu . name )
}
cu . ranges , _ = image . dwarf . Ranges ( entry )
for i := range cu . ranges {
cu . ranges [ i ] [ 0 ] += image . StaticBase
cu . ranges [ i ] [ 1 ] += image . StaticBase
}
if len ( cu . ranges ) >= 1 {
cu . lowPC = cu . ranges [ 0 ] [ 0 ]
}
2019-12-03 13:00:30 +00:00
lineInfoOffset , hasLineInfo := entry . Val ( dwarf . AttrStmtList ) . ( int64 )
if hasLineInfo && lineInfoOffset >= 0 && lineInfoOffset < int64 ( len ( debugLineBytes ) ) {
2019-08-08 19:25:50 +00:00
var logfn func ( string , ... interface { } )
if logflags . DebugLineErrors ( ) {
logger := logrus . New ( ) . WithFields ( logrus . Fields { "layer" : "dwarf-line" } )
logger . Logger . Level = logrus . DebugLevel
logfn = func ( fmt string , args ... interface { } ) {
logger . Printf ( fmt , args )
}
}
2020-03-10 16:34:40 +00:00
cu . lineInfo = line . Parse ( compdir , bytes . NewBuffer ( debugLineBytes [ lineInfoOffset : ] ) , logfn , image . StaticBase , bi . GOOS == "windows" , bi . Arch . PtrSize ( ) )
2019-08-08 19:25:50 +00:00
}
cu . producer , _ = entry . Val ( dwarf . AttrProducer ) . ( string )
if cu . isgo && cu . producer != "" {
semicolon := strings . Index ( cu . producer , ";" )
if semicolon < 0 {
cu . optimized = goversion . ProducerAfterOrEqual ( cu . producer , 1 , 10 )
} else {
cu . optimized = ! strings . Contains ( cu . producer [ semicolon : ] , "-N" ) || ! strings . Contains ( cu . producer [ semicolon : ] , "-l" )
cu . producer = cu . producer [ : semicolon ]
}
}
2019-11-25 17:10:18 +00:00
gopkg , _ := entry . Val ( godwarf . AttrGoPackageName ) . ( string )
if cu . isgo && gopkg != "" {
bi . PackageMap [ gopkg ] = append ( bi . PackageMap [ gopkg ] , escapePackagePath ( strings . Replace ( cu . name , "\\" , "/" , - 1 ) ) )
}
2019-08-08 19:25:50 +00:00
bi . compileUnits = append ( bi . compileUnits , cu )
if entry . Children {
bi . loadDebugInfoMapsCompileUnit ( ctxt , image , reader , cu )
}
case dwarf . TagPartialUnit :
reader . SkipChildren ( )
default :
// ignore unknown tags
reader . SkipChildren ( )
}
}
sort . Sort ( compileUnitsByOffset ( bi . compileUnits ) )
sort . Sort ( functionsDebugInfoByEntry ( bi . Functions ) )
sort . Sort ( packageVarsByAddr ( bi . packageVars ) )
bi . LookupFunc = make ( map [ string ] * Function )
for i := range bi . Functions {
bi . LookupFunc [ bi . Functions [ i ] . Name ] = & bi . Functions [ i ]
}
bi . Sources = [ ] string { }
for _ , cu := range bi . compileUnits {
if cu . lineInfo != nil {
for _ , fileEntry := range cu . lineInfo . FileNames {
bi . Sources = append ( bi . Sources , fileEntry . Path )
}
}
}
sort . Strings ( bi . Sources )
bi . Sources = uniq ( bi . Sources )
if cont != nil {
cont ( )
}
}
// loadDebugInfoMapsCompileUnit loads entry from a single compile unit.
func ( bi * BinaryInfo ) loadDebugInfoMapsCompileUnit ( ctxt * loadDebugInfoMapsContext , image * Image , reader * reader . Reader , cu * compileUnit ) {
2019-11-25 17:10:18 +00:00
hasAttrGoPkgName := goversion . ProducerAfterOrEqual ( cu . producer , 1 , 13 )
2019-08-08 19:25:50 +00:00
for entry , err := reader . Next ( ) ; entry != nil ; entry , err = reader . Next ( ) {
if err != nil {
image . setLoadError ( "error reading debug_info: %v" , err )
return
}
switch entry . Tag {
case 0 :
return
case dwarf . TagImportedUnit :
bi . loadDebugInfoMapsImportedUnit ( entry , ctxt , image , cu )
reader . SkipChildren ( )
case dwarf . TagArrayType , dwarf . TagBaseType , dwarf . TagClassType , dwarf . TagStructType , dwarf . TagUnionType , dwarf . TagConstType , dwarf . TagVolatileType , dwarf . TagRestrictType , dwarf . TagEnumerationType , dwarf . TagPointerType , dwarf . TagSubroutineType , dwarf . TagTypedef , dwarf . TagUnspecifiedType :
if name , ok := entry . Val ( dwarf . AttrName ) . ( string ) ; ok {
if ! cu . isgo {
name = "C." + name
}
if _ , exists := bi . types [ name ] ; ! exists {
bi . types [ name ] = dwarfRef { image . index , entry . Offset }
}
}
2019-11-25 17:10:18 +00:00
if cu != nil && cu . isgo && ! hasAttrGoPkgName {
2019-08-08 19:25:50 +00:00
bi . registerTypeToPackageMap ( entry )
}
image . registerRuntimeTypeToDIE ( entry , ctxt . ardr )
reader . SkipChildren ( )
case dwarf . TagVariable :
if n , ok := entry . Val ( dwarf . AttrName ) . ( string ) ; ok {
var addr uint64
if loc , ok := entry . Val ( dwarf . AttrLocation ) . ( [ ] byte ) ; ok {
if len ( loc ) == bi . Arch . PtrSize ( ) + 1 && op . Opcode ( loc [ 0 ] ) == op . DW_OP_addr {
2020-03-10 16:34:40 +00:00
addr , _ = util . ReadUintRaw ( bytes . NewReader ( loc [ 1 : ] ) , binary . LittleEndian , bi . Arch . PtrSize ( ) )
2019-08-08 19:25:50 +00:00
}
}
if ! cu . isgo {
n = "C." + n
}
if _ , known := ctxt . knownPackageVars [ n ] ; ! known {
bi . packageVars = append ( bi . packageVars , packageVar { n , cu , entry . Offset , addr + image . StaticBase } )
}
}
reader . SkipChildren ( )
case dwarf . TagConstant :
name , okName := entry . Val ( dwarf . AttrName ) . ( string )
typ , okType := entry . Val ( dwarf . AttrType ) . ( dwarf . Offset )
val , okVal := entry . Val ( dwarf . AttrConstValue ) . ( int64 )
if okName && okType && okVal {
if ! cu . isgo {
name = "C." + name
}
ct := bi . consts [ dwarfRef { image . index , typ } ]
if ct == nil {
ct = & constantType { }
bi . consts [ dwarfRef { image . index , typ } ] = ct
}
ct . values = append ( ct . values , constantValue { name : name , fullName : name , value : val } )
}
reader . SkipChildren ( )
case dwarf . TagSubprogram :
inlined := false
if inval , ok := entry . Val ( dwarf . AttrInline ) . ( int64 ) ; ok {
inlined = inval == 1
}
2019-10-07 16:38:47 +00:00
if inlined {
bi . addAbstractSubprogram ( entry , ctxt , reader , image , cu )
} else {
2019-08-08 19:25:50 +00:00
originOffset , hasAbstractOrigin := entry . Val ( dwarf . AttrAbstractOrigin ) . ( dwarf . Offset )
if hasAbstractOrigin {
2019-10-07 16:38:47 +00:00
bi . addConcreteInlinedSubprogram ( entry , originOffset , ctxt , reader , cu )
} else {
bi . addConcreteSubprogram ( entry , ctxt , reader , cu )
2019-08-08 19:25:50 +00:00
}
}
}
}
}
// loadDebugInfoMapsImportedUnit loads entries into cu from the partial unit
// referenced in a DW_TAG_imported_unit entry.
func ( bi * BinaryInfo ) loadDebugInfoMapsImportedUnit ( entry * dwarf . Entry , ctxt * loadDebugInfoMapsContext , image * Image , cu * compileUnit ) {
off , ok := entry . Val ( dwarf . AttrImport ) . ( dwarf . Offset )
if ! ok {
return
}
reader := image . DwarfReader ( )
reader . Seek ( off )
imentry , err := reader . Next ( )
if err != nil {
return
}
if imentry . Tag != dwarf . TagPartialUnit {
return
}
bi . loadDebugInfoMapsCompileUnit ( ctxt , image , reader , cu )
}
2019-10-07 16:38:47 +00:00
// addAbstractSubprogram adds the abstract entry for an inlined function.
func ( bi * BinaryInfo ) addAbstractSubprogram ( entry * dwarf . Entry , ctxt * loadDebugInfoMapsContext , reader * reader . Reader , image * Image , cu * compileUnit ) {
name , ok := subprogramEntryName ( entry , cu )
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: abstract subprogram without name at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
if entry . Children {
reader . SkipChildren ( )
}
return
}
fn := Function {
Name : name ,
offset : entry . Offset ,
cu : cu ,
}
if entry . Children {
2019-11-01 19:41:06 +00:00
bi . loadDebugInfoMapsInlinedCalls ( ctxt , reader , cu )
2019-10-07 16:38:47 +00:00
}
bi . Functions = append ( bi . Functions , fn )
2019-11-01 19:41:06 +00:00
ctxt . abstractOriginTable [ entry . Offset ] = len ( bi . Functions ) - 1
2019-10-07 16:38:47 +00:00
}
// addConcreteInlinedSubprogram adds the concrete entry of a subprogram that was also inlined.
func ( bi * BinaryInfo ) addConcreteInlinedSubprogram ( entry * dwarf . Entry , originOffset dwarf . Offset , ctxt * loadDebugInfoMapsContext , reader * reader . Reader , cu * compileUnit ) {
lowpc , highpc , ok := subprogramEntryRange ( entry , cu . image )
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: concrete inlined subprogram without address range at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
if entry . Children {
reader . SkipChildren ( )
}
return
}
2019-11-01 19:41:06 +00:00
originIdx , ok := ctxt . abstractOriginTable [ originOffset ]
2019-10-07 16:38:47 +00:00
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: could not find abstract origin of concrete inlined subprogram at %#x (origin offset %#x)" , entry . Offset , originOffset )
2019-10-07 16:38:47 +00:00
if entry . Children {
reader . SkipChildren ( )
}
return
}
2019-11-01 19:41:06 +00:00
fn := & bi . Functions [ originIdx ]
fn . offset = entry . Offset
fn . Entry = lowpc
fn . End = highpc
2019-10-07 16:38:47 +00:00
if entry . Children {
2019-11-01 19:41:06 +00:00
bi . loadDebugInfoMapsInlinedCalls ( ctxt , reader , cu )
2019-10-07 16:38:47 +00:00
}
}
// addConcreteSubprogram adds a concrete subprogram (a normal subprogram
2019-11-01 19:41:06 +00:00
// that doesn't have abstract or inlined entries)
2019-10-07 16:38:47 +00:00
func ( bi * BinaryInfo ) addConcreteSubprogram ( entry * dwarf . Entry , ctxt * loadDebugInfoMapsContext , reader * reader . Reader , cu * compileUnit ) {
lowpc , highpc , ok := subprogramEntryRange ( entry , cu . image )
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: concrete subprogram without address range at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
if entry . Children {
reader . SkipChildren ( )
}
return
}
name , ok := subprogramEntryName ( entry , cu )
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: concrete subprogram without name at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
if entry . Children {
reader . SkipChildren ( )
}
return
}
fn := Function {
Name : name ,
Entry : lowpc ,
End : highpc ,
offset : entry . Offset ,
cu : cu ,
}
bi . Functions = append ( bi . Functions , fn )
if entry . Children {
2019-11-01 19:41:06 +00:00
bi . loadDebugInfoMapsInlinedCalls ( ctxt , reader , cu )
2019-10-07 16:38:47 +00:00
}
}
func subprogramEntryName ( entry * dwarf . Entry , cu * compileUnit ) ( string , bool ) {
name , ok := entry . Val ( dwarf . AttrName ) . ( string )
if ! ok {
return "" , false
}
if ! cu . isgo {
name = "C." + name
}
return name , true
}
func subprogramEntryRange ( entry * dwarf . Entry , image * Image ) ( lowpc , highpc uint64 , ok bool ) {
ok = false
if ranges , _ := image . dwarf . Ranges ( entry ) ; len ( ranges ) >= 1 {
ok = true
lowpc = ranges [ 0 ] [ 0 ] + image . StaticBase
highpc = ranges [ 0 ] [ 1 ] + image . StaticBase
}
return lowpc , highpc , ok
}
2019-11-01 19:41:06 +00:00
func ( bi * BinaryInfo ) loadDebugInfoMapsInlinedCalls ( ctxt * loadDebugInfoMapsContext , reader * reader . Reader , cu * compileUnit ) {
2019-10-07 16:38:47 +00:00
for {
entry , err := reader . Next ( )
if err != nil {
cu . image . setLoadError ( "error reading debug_info: %v" , err )
return
}
switch entry . Tag {
case 0 :
return
case dwarf . TagInlinedSubroutine :
originOffset , ok := entry . Val ( dwarf . AttrAbstractOrigin ) . ( dwarf . Offset )
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: inlined call without origin offset at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
reader . SkipChildren ( )
continue
}
2019-11-01 19:41:06 +00:00
originIdx , ok := ctxt . abstractOriginTable [ originOffset ]
2019-10-07 16:38:47 +00:00
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: could not find abstract origin (%#x) of inlined call at %#x" , originOffset , entry . Offset )
2019-10-07 16:38:47 +00:00
reader . SkipChildren ( )
continue
}
2019-11-01 19:41:06 +00:00
fn := & bi . Functions [ originIdx ]
2019-10-07 16:38:47 +00:00
lowpc , highpc , ok := subprogramEntryRange ( entry , cu . image )
if ! ok {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: inlined call without address range at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
reader . SkipChildren ( )
continue
}
callfileidx , ok1 := entry . Val ( dwarf . AttrCallFile ) . ( int64 )
callline , ok2 := entry . Val ( dwarf . AttrCallLine ) . ( int64 )
if ! ok1 || ! ok2 {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: inlined call without CallFile/CallLine at %#x" , entry . Offset )
2019-10-07 16:38:47 +00:00
reader . SkipChildren ( )
continue
}
2019-10-21 17:43:03 +00:00
if cu . lineInfo == nil {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: inlined call on a compilation unit without debug_line section at %#x" , entry . Offset )
2019-10-21 17:43:03 +00:00
reader . SkipChildren ( )
continue
}
2019-10-07 16:38:47 +00:00
if int ( callfileidx - 1 ) >= len ( cu . lineInfo . FileNames ) {
2019-11-25 17:06:30 +00:00
bi . logger . Warnf ( "reading debug_info: CallFile (%d) of inlined call does not exist in compile unit file table at %#x" , callfileidx , entry . Offset )
2019-10-07 16:38:47 +00:00
reader . SkipChildren ( )
continue
}
callfile := cu . lineInfo . FileNames [ callfileidx - 1 ] . Path
2019-11-01 19:41:06 +00:00
fn . InlinedCalls = append ( fn . InlinedCalls , InlinedCall {
cu : cu ,
LowPC : lowpc ,
HighPC : highpc ,
2019-10-07 16:38:47 +00:00
} )
2019-11-01 19:41:06 +00:00
fl := fileLine { callfile , int ( callline ) }
bi . inlinedCallLines [ fl ] = append ( bi . inlinedCallLines [ fl ] , lowpc )
2019-10-07 16:38:47 +00:00
}
reader . SkipChildren ( )
}
}
2019-08-08 19:25:50 +00:00
func uniq ( s [ ] string ) [ ] string {
if len ( s ) <= 0 {
return s
}
src , dst := 1 , 1
for src < len ( s ) {
if s [ src ] != s [ dst - 1 ] {
s [ dst ] = s [ src ]
dst ++
}
src ++
}
return s [ : dst ]
}
func ( bi * BinaryInfo ) expandPackagesInType ( expr ast . Expr ) {
switch e := expr . ( type ) {
case * ast . ArrayType :
bi . expandPackagesInType ( e . Elt )
case * ast . ChanType :
bi . expandPackagesInType ( e . Value )
case * ast . FuncType :
for i := range e . Params . List {
bi . expandPackagesInType ( e . Params . List [ i ] . Type )
}
if e . Results != nil {
for i := range e . Results . List {
bi . expandPackagesInType ( e . Results . List [ i ] . Type )
}
}
case * ast . MapType :
bi . expandPackagesInType ( e . Key )
bi . expandPackagesInType ( e . Value )
case * ast . ParenExpr :
bi . expandPackagesInType ( e . X )
case * ast . SelectorExpr :
switch x := e . X . ( type ) {
case * ast . Ident :
2019-11-25 17:10:18 +00:00
if len ( bi . PackageMap [ x . Name ] ) > 0 {
// There's no particular reason to expect the first entry to be the
// correct one if the package name is ambiguous, but trying all possible
// expansions of all types mentioned in the expression is complicated
// and, besides type assertions, users can always specify the type they
// want exactly, using a string.
x . Name = bi . PackageMap [ x . Name ] [ 0 ]
2019-08-08 19:25:50 +00:00
}
default :
bi . expandPackagesInType ( e . X )
}
case * ast . StarExpr :
bi . expandPackagesInType ( e . X )
default :
// nothing to do
}
}
2019-11-25 17:10:18 +00:00
// escapePackagePath returns pkg with '.' replaced with '%2e' (in all
// elements of the path except the first one) like Go does in variable and
// type names.
func escapePackagePath ( pkg string ) string {
slash := strings . Index ( pkg , "/" )
if slash < 0 {
slash = 0
}
return pkg [ : slash ] + strings . Replace ( pkg [ slash : ] , "." , "%2e" , - 1 )
}
2019-08-08 19:25:50 +00:00
// Looks up symbol (either functions or global variables) at address addr.
// Used by disassembly formatter.
func ( bi * BinaryInfo ) symLookup ( addr uint64 ) ( string , uint64 ) {
fn := bi . PCToFunc ( addr )
if fn != nil {
if fn . Entry == addr {
// only report the function name if it's the exact address because it's
// easier to read the absolute address than function_name+offset.
return fn . Name , fn . Entry
}
return "" , 0
}
2020-03-10 16:34:40 +00:00
if sym , ok := bi . SymNames [ addr ] ; ok {
return sym . Name , addr
}
2019-08-08 19:25:50 +00:00
i := sort . Search ( len ( bi . packageVars ) , func ( i int ) bool {
return bi . packageVars [ i ] . addr >= addr
} )
if i >= len ( bi . packageVars ) {
return "" , 0
}
if bi . packageVars [ i ] . addr > addr {
// report previous variable + offset if i-th variable starts after addr
i --
}
2019-08-14 15:58:27 +00:00
if i >= 0 && bi . packageVars [ i ] . addr != 0 {
2019-08-08 19:25:50 +00:00
return bi . packageVars [ i ] . name , bi . packageVars [ i ] . addr
}
return "" , 0
}
2019-12-03 13:00:30 +00:00
type PackageBuildInfo struct {
ImportPath string
DirectoryPath string
Files map [ string ] struct { }
}
// ListPackagesBuildInfo returns the list of packages used by the program along with
// the directory where each package was compiled and optionally the list of
// files constituting the package.
func ( bi * BinaryInfo ) ListPackagesBuildInfo ( includeFiles bool ) [ ] * PackageBuildInfo {
m := make ( map [ string ] * PackageBuildInfo )
for _ , cu := range bi . compileUnits {
if cu . image != bi . Images [ 0 ] || ! cu . isgo || cu . lineInfo == nil {
//TODO(aarzilli): what's the correct thing to do for plugins?
continue
}
ip := strings . Replace ( cu . name , "\\" , "/" , - 1 )
if _ , ok := m [ ip ] ; ! ok {
path := cu . lineInfo . FirstFile ( )
if ext := filepath . Ext ( path ) ; ext != ".go" && ext != ".s" {
continue
}
dp := filepath . Dir ( path )
m [ ip ] = & PackageBuildInfo {
ImportPath : ip ,
DirectoryPath : dp ,
Files : make ( map [ string ] struct { } ) ,
}
}
if includeFiles {
pbi := m [ ip ]
for _ , file := range cu . lineInfo . FileNames {
pbi . Files [ file . Path ] = struct { } { }
}
}
}
r := make ( [ ] * PackageBuildInfo , 0 , len ( m ) )
for _ , pbi := range m {
r = append ( r , pbi )
}
sort . Slice ( r , func ( i , j int ) bool { return r [ i ] . ImportPath < r [ j ] . ImportPath } )
return r
}