You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
67 lines
1.9 KiB
Go
67 lines
1.9 KiB
Go
package main
|
|
|
|
// The "name" internal/abi passes to this function doesn't have to be a simple "someName"
|
|
|
|
// it can also be for function names like "*pkgName.FuncName" (obfuscated)
|
|
// or for structs the entire struct definition, like
|
|
//
|
|
// *struct { AQ45rr68K string; ipq5aQSIqN string; hNfiW5O5LVq struct { gPTbGR00hu string } }
|
|
//
|
|
// Therefore all obfuscated names which occur within name need to be replaced with their original equivalents.
|
|
// The code below does a more efficient version of:
|
|
//
|
|
// func _originalNames(name string) string {
|
|
// for _, pair := range _originalNamePairs {
|
|
// name = strings.ReplaceAll(name, pair[0], pair[1])
|
|
// }
|
|
// return name
|
|
// }
|
|
//
|
|
// The linknames below are only turned on when the code is injected,
|
|
// so that we can test and benchmark this code normally.
|
|
|
|
// Injected code below this line.
|
|
|
|
//disabledgo:linkname _originalNames internal/abi._originalNames
|
|
func _originalNames(name string) string {
|
|
if len(name) < minHashLength {
|
|
// The name is too short to be obfuscated.
|
|
return name
|
|
}
|
|
// We can stop once there aren't enough bytes to fit another obfuscated name.
|
|
for i := 0; i <= len(name)-minHashLength; {
|
|
switch name[i] {
|
|
case ' ', '.', '*', '{', '}', '[', ']':
|
|
// These characters never start an obfuscated name.
|
|
i++
|
|
continue
|
|
}
|
|
remLen := len(name[i:])
|
|
found := false
|
|
for _, pair := range _originalNamePairs {
|
|
obfName := pair[0]
|
|
real := pair[1]
|
|
keyLen := len(obfName)
|
|
if remLen < keyLen {
|
|
// Since the pairs are sorted from shortest to longest name,
|
|
// we know that the rest of the pairs are at least just as long.
|
|
break
|
|
}
|
|
if name[i:i+keyLen] == obfName {
|
|
name = name[:i] + real + name[i+keyLen:]
|
|
found = true
|
|
i += len(real)
|
|
break
|
|
}
|
|
}
|
|
if !found {
|
|
i++
|
|
}
|
|
}
|
|
return name
|
|
}
|
|
|
|
// Each pair is the obfuscated and then the real name.
|
|
// The slice is sorted from shortest to longest obfuscated name.
|
|
var _originalNamePairs = [][2]string{}
|