"cmd/internal/dwarf"
"cmd/internal/obj"
"cmd/internal/src"
- "sort"
"strings"
)
// the pre-inlining decls for the target function and assign child
// index accordingly.
for ii, sl := range vmap {
- sort.Sort(byClassThenName(sl))
var m map[varPos]int
if ii == 0 {
if !fnsym.WasInlined() {
return &call.Ranges[len(call.Ranges)-1]
}
-func cmpDwarfVar(a, b *dwarf.Var) bool {
- // named before artificial
- aart := 0
- if strings.HasPrefix(a.Name, "~r") {
- aart = 1
- }
- bart := 0
- if strings.HasPrefix(b.Name, "~r") {
- bart = 1
- }
- if aart != bart {
- return aart < bart
- }
-
- // otherwise sort by name
- return a.Name < b.Name
-}
-
-// byClassThenName implements sort.Interface for []*dwarf.Var using cmpDwarfVar.
-type byClassThenName []*dwarf.Var
-
-func (s byClassThenName) Len() int { return len(s) }
-func (s byClassThenName) Less(i, j int) bool { return cmpDwarfVar(s[i], s[j]) }
-func (s byClassThenName) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
-
func dumpInlCall(inlcalls dwarf.InlCalls, idx, ilevel int) {
for i := 0; i < ilevel; i++ {
Ctxt.Logf(" ")
"fmt"
"math/rand"
"sort"
- "strings"
"sync"
"time"
)
}
rdcl = append(rdcl, n)
}
- sort.Sort(byNodeName(rdcl))
return rdcl
}
-func cmpNodeName(a, b *Node) bool {
- aart := 0
- if strings.HasPrefix(a.Sym.Name, "~") {
- aart = 1
- }
- bart := 0
- if strings.HasPrefix(b.Sym.Name, "~") {
- bart = 1
- }
- if aart != bart {
- return aart < bart
- }
-
- aname := unversion(a.Sym.Name)
- bname := unversion(b.Sym.Name)
- return aname < bname
-}
-
-// byNodeName implements sort.Interface for []*Node using cmpNodeName.
-type byNodeName []*Node
-
-func (s byNodeName) Len() int { return len(s) }
-func (s byNodeName) Less(i, j int) bool { return cmpNodeName(s[i], s[j]) }
-func (s byNodeName) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
-
// stackOffset returns the stack location of a LocalSlot relative to the
// stack pointer, suitable for use in a DWARF location entry. This has nothing
// to do with its offset in the user variable.