-
Notifications
You must be signed in to change notification settings - Fork 0
/
visualizer.go
96 lines (79 loc) · 1.96 KB
/
visualizer.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
// +build !go1.10
package sizeof
import (
"strconv"
)
func visualize(node Node) string {
var nameLength, typeLength int
rowAmount := len(node.Fields)
for _, field := range node.Fields {
lengthName := len(field.Name)
if lengthName > nameLength {
nameLength = lengthName
}
lengthType := len(field.Type)
if lengthType > typeLength {
typeLength = lengthType
}
if rows := field.Size / node.Alignment; rows > 1 {
rowAmount += rows - 1
}
}
itemSizeString := strconv.Itoa(node.Size)
itemAlignString := strconv.Itoa(node.Alignment)
b := make([]byte, 0, 26+len(node.Type)+len(itemSizeString)+len(itemAlignString)+ // first row
((7+nameLength+typeLength+(node.Alignment*3))*rowAmount))
b = append(b, "sizeof("...)
b = append(b, node.Type...)
b = append(b, ")="...)
b = append(b, itemSizeString...)
b = append(b, " with alignment="...)
b = append(b, itemAlignString...)
var row int
for _, field := range node.Fields {
for ; row < field.Offset; row++ {
b = append(b, empty...)
}
b = append(b, '\n')
b = append(b, " "...)
if field.Anonymous {
b = append(b, '~')
} else {
b = append(b, ' ')
}
b = append(b, field.Name...)
lengthName := len(field.Name)
for ; lengthName <= nameLength; lengthName++ {
b = append(b, ' ')
}
b = append(b, field.Type...)
lengthType := len(field.Type)
for ; lengthType <= typeLength; lengthType++ {
b = append(b, ' ')
}
if field.Offset%node.Alignment != 0 {
for i := row; i%node.Alignment != 0; i-- {
b = append(b, skip...)
}
}
for i := field.Offset; i < field.Offset+field.Size; i++ {
if i != field.Offset && i%node.Alignment == 0 {
b = append(b, '\n')
b = append(b, " "...)
for i := 0; i <= nameLength; i++ {
b = append(b, ' ')
}
for i := 0; i <= typeLength; i++ {
b = append(b, ' ')
}
}
row++
b = append(b, used...)
}
}
for ; row < node.Size; row++ {
b = append(b, empty...)
}
b = append(b, '\n')
return string(b)
}