github.com/Rookout/GoSDK@v0.1.48/pkg/services/instrumentation/dwarf/reader/reader.go (about)

     1  // The MIT License (MIT)
     2  
     3  // Copyright (c) 2014 Derek Parker
     4  
     5  // Permission is hereby granted, free of charge, to any person obtaining a copy of
     6  // this software and associated documentation files (the "Software"), to deal in
     7  // the Software without restriction, including without limitation the rights to
     8  // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
     9  // the Software, and to permit persons to whom the Software is furnished to do so,
    10  // subject to the following conditions:
    11  
    12  // The above copyright notice and this permission notice shall be included in all
    13  // copies or substantial portions of the Software.
    14  
    15  // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    16  // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
    17  // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
    18  // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
    19  // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
    20  // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
    21  
    22  package reader
    23  
    24  import (
    25  	"debug/dwarf"
    26  	"github.com/Rookout/GoSDK/pkg/services/instrumentation/dwarf/godwarf"
    27  )
    28  
    29  
    30  
    31  
    32  func InlineStack(root *godwarf.Tree, pc uint64) []*godwarf.Tree {
    33  	v := []*godwarf.Tree{}
    34  	for _, child := range root.Children {
    35  		v = inlineStackInternal(v, child, pc)
    36  	}
    37  	return v
    38  }
    39  
    40  
    41  
    42  
    43  
    44  
    45  
    46  
    47  
    48  
    49  
    50  
    51  
    52  
    53  func inlineStackInternal(stack []*godwarf.Tree, n *godwarf.Tree, pc uint64) []*godwarf.Tree {
    54  	switch n.Tag {
    55  	case dwarf.TagSubprogram, dwarf.TagInlinedSubroutine, dwarf.TagLexDwarfBlock:
    56  		if pc == 0 || n.ContainsPC(pc) {
    57  			for _, child := range n.Children {
    58  				stack = inlineStackInternal(stack, child, pc)
    59  			}
    60  			if n.Tag == dwarf.TagInlinedSubroutine {
    61  				stack = append(stack, n)
    62  			}
    63  		}
    64  	}
    65  	return stack
    66  }