forked from humanlogio/humanlog
/
logrus_handler.go
175 lines (147 loc) · 3.71 KB
/
logrus_handler.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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
package humanlog
import (
"bytes"
"fmt"
"sort"
"strings"
"text/tabwriter"
"time"
"github.com/aybabtme/rgbterm"
)
// LogrusHandler can handle logs emmited by logrus.TextFormatter loggers.
type LogrusHandler struct {
buf *bytes.Buffer
out *tabwriter.Writer
truncKV int
Opts *HandlerOptions
Level string
Time time.Time
Message string
Fields map[string]string
last map[string]string
}
func (h *LogrusHandler) clear() {
h.Level = ""
h.Time = time.Time{}
h.Message = ""
h.last = h.Fields
h.Fields = make(map[string]string)
h.buf.Reset()
}
// CanHandle tells if this line can be handled by this handler.
func (h *LogrusHandler) CanHandle(d []byte) bool {
if !bytes.Contains(d, []byte(`level="`)) {
return false
}
if !bytes.Contains(d, []byte(`time="`)) {
return false
}
if !bytes.Contains(d, []byte(`msg="`)) {
return false
}
return true
}
// HandleLogfmt sets the fields of the handler.
func (h *LogrusHandler) visit(key, val []byte) bool {
switch {
case bytes.Equal(key, []byte("level")):
h.setLevel(val)
case bytes.Equal(key, []byte("msg")):
h.setMessage(val)
case bytes.Equal(key, []byte("time")):
h.setTime(val)
default:
h.setField(key, val)
}
return true
}
// Prettify the output in a logrus like fashion.
func (h *LogrusHandler) Prettify(skipUnchanged bool) []byte {
defer h.clear()
if h.out == nil {
if h.Opts == nil {
h.Opts = DefaultOptions
}
h.buf = bytes.NewBuffer(nil)
h.out = tabwriter.NewWriter(h.buf, 0, 1, 0, '\t', 0)
}
var msg string
if h.Message == "" {
msg = rgbterm.FgString("<no msg>", 190, 190, 190)
} else {
msg = rgbterm.FgString(h.Message, 255, 255, 255)
}
lvl := strings.ToUpper(h.Level)[:imin(4, len(h.Level))]
var level string
switch h.Level {
case "debug":
level = rgbterm.FgString(lvl, 221, 28, 119)
case "info":
level = rgbterm.FgString(lvl, 20, 172, 190)
case "warn", "warning":
level = rgbterm.FgString(lvl, 255, 245, 32)
case "error":
level = rgbterm.FgString(lvl, 255, 0, 0)
case "fatal", "panic":
level = rgbterm.BgString(lvl, 255, 0, 0)
default:
level = rgbterm.FgString(lvl, 221, 28, 119)
}
_, _ = fmt.Fprintf(h.out, "%s |%s| %s\t %s",
rgbterm.FgString(h.Time.Format(time.Stamp), 99, 99, 99),
level,
msg,
strings.Join(h.joinKVs(skipUnchanged, "="), "\t "),
)
_ = h.out.Flush()
return h.buf.Bytes()
}
func (h *LogrusHandler) setLevel(val []byte) { h.Level = string(val) }
func (h *LogrusHandler) setMessage(val []byte) { h.Message = string(val) }
func (h *LogrusHandler) setTime(val []byte) (parsed bool) {
h.Time, parsed = tryParseTime(string(val))
return
}
func (h *LogrusHandler) setField(key, val []byte) {
if h.Fields == nil {
h.Fields = make(map[string]string)
}
h.Fields[string(key)] = string(val)
}
func (h *LogrusHandler) joinKVs(skipUnchanged bool, sep string) []string {
kv := make([]string, 0, len(h.Fields))
for k, v := range h.Fields {
if !h.Opts.shouldShowKey(k) {
continue
}
if skipUnchanged {
if lastV, ok := h.last[k]; ok && lastV == v {
continue
}
}
kstr := rgbterm.FgString(k, h.Opts.KeyRGB.R, h.Opts.KeyRGB.G, h.Opts.KeyRGB.B)
var vstr string
if h.Opts.Truncates && len(v) > h.Opts.TruncateLength {
vstr = v[:h.Opts.TruncateLength] + "..."
} else {
vstr = v
}
vstr = rgbterm.FgString(vstr, h.Opts.ValRGB.R, h.Opts.ValRGB.G, h.Opts.ValRGB.B)
kv = append(kv, kstr+sep+vstr)
}
sort.Strings(kv)
if h.Opts.SortLongest {
sort.Stable(byLongest(kv))
}
return kv
}
type byLongest []string
func (s byLongest) Len() int { return len(s) }
func (s byLongest) Less(i, j int) bool { return len(s[i]) < len(s[j]) }
func (s byLongest) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
func imin(a, b int) int {
if a < b {
return a
}
return b
}