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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
|
package gobang
import (
"crypto/hmac"
"crypto/rand"
"crypto/sha256"
"encoding/binary"
"encoding/hex"
"errors"
"fmt"
"hash"
"io"
"log/slog"
"math/big"
"math/bits"
"os"
"reflect"
"runtime"
"runtime/debug"
"slices"
"strings"
"sync"
"syscall"
"time"
)
type logLevel int8
const (
LevelNone logLevel = 0
LevelError logLevel = 1
LevelWarning logLevel = 2
LevelInfo logLevel = 3
LevelDebug logLevel = 4
)
const (
uuidDashCount = 4
uuidByteCount = 16
uuidEncodedLength = (uuidByteCount * 2) + uuidDashCount
)
type UUID struct {
bytes [uuidByteCount]byte
}
type Gauge struct {
Inc func(...any)
Dec func(...any)
}
type CopyResult struct {
Written int64
Err error
Label string
}
const maxInt = int((^uint(0)) >> 1)
const MinimumPasswordLength = 16
const (
scrypt_N = 1 << 15
scrypt_r = 8
scrypt_p = 1
scryptSaltMinLength = 32
scryptDesiredLength = 32
)
// Private variables
// lastV7time is the last time we returned stored as:
//
// 52 bits of time in milliseconds since epoch
// 12 bits of (fractional nanoseconds) >> 8
var lastV7Time int64
var timeMutex sync.Mutex
// Local variables
var (
level logLevel = LevelInfo
emitMetric bool = true
hostname string
)
// Package pbkdf2 implements the key derivation function PBKDF2 as defined in
// RFC 2898 / PKCS #5 v2.0.
//
// A key derivation function is useful when encrypting data based on a password
// or any other not-fully-random data. It uses a pseudorandom function to derive
// a secure encryption key based on the password.
//
// While v2.0 of the standard defines only one pseudorandom function to use,
// HMAC-SHA1, the drafted v2.1 specification allows use of all five FIPS
// Approved Hash Functions SHA-1, SHA-224, SHA-256, SHA-384 and SHA-512 for
// HMAC. To choose, you can pass the `New` functions from the different SHA
// packages to pbkdf2.Key.
//
//
// Key derives a key from the password, salt and iteration count, returning a
// []byte of length keylen that can be used as cryptographic key. The key is
// derived based on the method described as PBKDF2 with the HMAC variant using
// the supplied hash function.
//
// For example, to use a HMAC-SHA-1 based PBKDF2 key derivation function, you
// can get a derived key for e.g. AES-256 (which needs a 32-byte key) by
// doing:
//
// dk := pbkdf2.Key([]byte("some password"), salt, 4096, 32, sha1.New)
//
// Remember to get a good random salt. At least 8 bytes is recommended by the
// RFC.
//
// Using a higher iteration count will increase the cost of an exhaustive
// search but will also make derivation proportionally slower.
func _PBKDF2Key(
password []byte,
salt []byte,
iter int,
keyLen int,
h func() hash.Hash,
) []byte {
prf := hmac.New(h, password)
hashLen := prf.Size()
numBlocks := (keyLen + hashLen - 1) / hashLen
var buffer [4]byte
dk := make([]byte, 0, numBlocks*hashLen)
U := make([]byte, hashLen)
for block := 1; block <= numBlocks; block++ {
// N.B.: || means concatenation, ^ means XOR
// for each block T_i = U_1 ^ U_2 ^ ... ^ U_iter
// U_1 = PRF(password, salt || uint(i))
prf.Reset()
prf.Write(salt)
buffer[0] = byte(block >> 24)
buffer[1] = byte(block >> 16)
buffer[2] = byte(block >> 8)
buffer[3] = byte(block >> 0)
prf.Write(buffer[:4])
dk = prf.Sum(dk)
T := dk[len(dk) - hashLen:]
copy(U, T)
// U_n = PRF(password, U_(n - 1))
for n := 2; n <= iter; n++ {
prf.Reset()
prf.Write(U)
U = U[:0]
U = prf.Sum(U)
for x := range U {
T[x] ^= U[x]
}
}
}
return dk[:keyLen]
}
// blockCopy copies n numbers from src into dst.
func blockCopy(dst []uint32, src []uint32, n int) {
copy(dst, src[:n])
}
// blockXOR XORs numbers from dst with n numbers from src.
func blockXOR(dst []uint32, src []uint32, n int) {
for i, v := range src[:n] {
dst[i] ^= v
}
}
// salsaXOR applies Salsa20/8 to the XOR of 16 numbers from tmp and in,
// and puts the result into both tmp and out.
func salsaXOR(tmp *[16]uint32, in []uint32, out []uint32) {
w0 := tmp[0] ^ in[0]
w1 := tmp[1] ^ in[1]
w2 := tmp[2] ^ in[2]
w3 := tmp[3] ^ in[3]
w4 := tmp[4] ^ in[4]
w5 := tmp[5] ^ in[5]
w6 := tmp[6] ^ in[6]
w7 := tmp[7] ^ in[7]
w8 := tmp[8] ^ in[8]
w9 := tmp[9] ^ in[9]
w10 := tmp[10] ^ in[10]
w11 := tmp[11] ^ in[11]
w12 := tmp[12] ^ in[12]
w13 := tmp[13] ^ in[13]
w14 := tmp[14] ^ in[14]
w15 := tmp[15] ^ in[15]
x0 := w0
x1 := w1
x2 := w2
x3 := w3
x4 := w4
x5 := w5
x6 := w6
x7 := w7
x8 := w8
x9 := w9
x10 := w10
x11 := w11
x12 := w12
x13 := w13
x14 := w14
x15 := w15
for i := 0; i < 8; i += 2 {
x4 ^= bits.RotateLeft32(x0 + x12, 7)
x8 ^= bits.RotateLeft32(x4 + x0, 9)
x12 ^= bits.RotateLeft32(x8 + x4, 13)
x0 ^= bits.RotateLeft32(x12 + x8, 18)
x9 ^= bits.RotateLeft32(x5 + x1, 7)
x13 ^= bits.RotateLeft32(x9 + x5, 9)
x1 ^= bits.RotateLeft32(x13 + x9, 13)
x5 ^= bits.RotateLeft32(x1 + x13, 18)
x14 ^= bits.RotateLeft32(x10 + x6, 7)
x2 ^= bits.RotateLeft32(x14 + x10, 9)
x6 ^= bits.RotateLeft32(x2 + x14, 13)
x10 ^= bits.RotateLeft32(x6 + x2, 18)
x3 ^= bits.RotateLeft32(x15 + x11, 7)
x7 ^= bits.RotateLeft32(x3 + x15, 9)
x11 ^= bits.RotateLeft32(x7 + x3, 13)
x15 ^= bits.RotateLeft32(x11 + x7, 18)
x1 ^= bits.RotateLeft32(x0 + x3, 7)
x2 ^= bits.RotateLeft32(x1 + x0, 9)
x3 ^= bits.RotateLeft32(x2 + x1, 13)
x0 ^= bits.RotateLeft32(x3 + x2, 18)
x6 ^= bits.RotateLeft32(x5 + x4, 7)
x7 ^= bits.RotateLeft32(x6 + x5, 9)
x4 ^= bits.RotateLeft32(x7 + x6, 13)
x5 ^= bits.RotateLeft32(x4 + x7, 18)
x11 ^= bits.RotateLeft32(x10 + x9, 7)
x8 ^= bits.RotateLeft32(x11 + x10, 9)
x9 ^= bits.RotateLeft32(x8 + x11, 13)
x10 ^= bits.RotateLeft32(x9 + x8, 18)
x12 ^= bits.RotateLeft32(x15 + x14, 7)
x13 ^= bits.RotateLeft32(x12 + x15, 9)
x14 ^= bits.RotateLeft32(x13 + x12, 13)
x15 ^= bits.RotateLeft32(x14 + x13, 18)
}
x0 += w0
x1 += w1
x2 += w2
x3 += w3
x4 += w4
x5 += w5
x6 += w6
x7 += w7
x8 += w8
x9 += w9
x10 += w10
x11 += w11
x12 += w12
x13 += w13
x14 += w14
x15 += w15
out[0], tmp[0] = x0, x0
out[1], tmp[1] = x1, x1
out[2], tmp[2] = x2, x2
out[3], tmp[3] = x3, x3
out[4], tmp[4] = x4, x4
out[5], tmp[5] = x5, x5
out[6], tmp[6] = x6, x6
out[7], tmp[7] = x7, x7
out[8], tmp[8] = x8, x8
out[9], tmp[9] = x9, x9
out[10], tmp[10] = x10, x10
out[11], tmp[11] = x11, x11
out[12], tmp[12] = x12, x12
out[13], tmp[13] = x13, x13
out[14], tmp[14] = x14, x14
out[15], tmp[15] = x15, x15
}
func blockMix(tmp *[16]uint32, in []uint32, out []uint32, r int) {
blockCopy(tmp[:], in[(2 * r - 1) * 16:], 16)
for i := 0; i < 2 * r; i += 2 {
salsaXOR(tmp, in[i * 16:], out[i * 8:])
salsaXOR(tmp, in[i * 16 + 16:], out[i * 8 + r * 16:])
}
}
func integer(b []uint32, r int) uint64 {
j := (2 * r - 1) * 16
return uint64(b[j]) | (uint64(b[j + 1]) << 32)
}
func smix(b []byte, r int, N int, v []uint32, xy []uint32) {
var tmp [16]uint32
R := 32 * r
x := xy
y := xy[R:]
j := 0
for i := 0; i < R; i++ {
x[i] = binary.LittleEndian.Uint32(b[j:])
j += 4
}
for i := 0; i < N; i += 2 {
blockCopy(v[i * R:], x, R)
blockMix(&tmp, x, y, r)
blockCopy(v[(i + 1) * R:], y, R)
blockMix(&tmp, y, x, r)
}
for i := 0; i < N; i += 2 {
j := int(integer(x, r) & uint64(N - 1))
blockXOR(x, v[j * R:], R)
blockMix(&tmp, x, y, r)
j = int(integer(y, r) & uint64(N - 1))
blockXOR(y, v[j * R:], R)
blockMix(&tmp, y, x, r)
}
j = 0
for _, v := range x[:R] {
binary.LittleEndian.PutUint32(b[j:], v)
j += 4
}
}
// Package scrypt implements the scrypt key derivation function as defined in
// Colin Percival's paper "Stronger Key Derivation via Sequential Memory-Hard
// Functions" (https://www.tarsnap.com/scrypt/scrypt.pdf).
//
//
// Key derives a key from the password, salt, and cost parameters, returning
// a byte slice of length keyLen that can be used as cryptographic key.
//
// N is a CPU/memory cost parameter, which must be a power of 2 greater than 1.
// r and p must satisfy r * p < 2³⁰. If the parameters do not satisfy the
// limits, the function returns a nil byte slice and an error.
//
// For example, you can get a derived key for e.g. AES-256 (which needs a
// 32-byte key) by doing:
//
// dk, err := scrypt.Key([]byte("some password"), salt, 32768, 8, 1, 32)
//
// The recommended parameters for interactive logins as of 2017 are N=32768, r=8
// and p=1. The parameters N, r, and p should be increased as memory latency and
// CPU parallelism increases; consider setting N to the highest power of 2 you
// can derive within 100 milliseconds. Remember to get a good random salt.
func scrypt(
password []byte,
salt []byte,
N int,
r int,
p int,
keyLen int,
) ([]byte, error) {
if N <= 1 || N & (N - 1) != 0 {
return nil, errors.New("scrypt: N must be > 1 and a power of 2")
}
if ((uint64(r) * uint64(p)) >= (1 << 30)) ||
r > maxInt / 128 / p ||
r > maxInt / 256 ||
N > maxInt / 128 / r {
return nil, errors.New("scrypt: parameters are too large")
}
xy := make([]uint32, 64 * r)
v := make([]uint32, 32 * N * r)
b := _PBKDF2Key(password, salt, 1, p * 128 * r, sha256.New)
for i := 0; i < p; i++ {
smix(b[i * 128 * r:], r, N, v, xy)
}
return _PBKDF2Key(password, b, 1, keyLen, sha256.New), nil
}
func Random(length int) []byte {
buffer := make([]byte, length)
_, err := io.ReadFull(rand.Reader, buffer)
FatalIf(err)
return buffer
}
func Salt() []byte {
return Random(scryptSaltMinLength)
}
func Hash(password []byte, salt []byte) []byte{
Assert(len(salt) >= scryptSaltMinLength, "salt is too small")
hash, err := scrypt(
password,
salt,
scrypt_N,
scrypt_r,
scrypt_p,
scryptDesiredLength,
)
FatalIf(err)
return hash
}
// getV7Time returns the time in milliseconds and nanoseconds / 256.
// The returned (milli << (12 + seq)) is guaranteed to be greater than
// (milli << (12 + seq)) returned by any previous call to getV7Time.
// `seq` Sequence number is between 0 and 3906 (nanoPerMilli >> 8)
func getV7Time(nano int64) (int64, int64) {
const nanoPerMilli = 1000 * 1000
milli := nano / nanoPerMilli
seq := (nano - (milli * nanoPerMilli)) >> 8
now := milli << (12 + seq)
timeMutex.Lock()
defer timeMutex.Unlock()
if now <= lastV7Time {
now = lastV7Time + 1
milli = now >> 12
seq = now & 0xfff
}
lastV7Time = now
return milli, seq
}
func newUUIDFrom(randomBuffer [uuidByteCount]byte, now int64) UUID {
randomBuffer[6] = (randomBuffer[6] & 0x0f) | 0x40 // Version 4
randomBuffer[8] = (randomBuffer[8] & 0x3f) | 0x80 // Variant is 10
t, s := getV7Time(now)
randomBuffer[0] = byte(t >> 40)
randomBuffer[1] = byte(t >> 32)
randomBuffer[2] = byte(t >> 24)
randomBuffer[3] = byte(t >> 16)
randomBuffer[4] = byte(t >> 8)
randomBuffer[5] = byte(t >> 0)
randomBuffer[6] = 0x70 | (0x0f & byte(s >> 8))
randomBuffer[7] = byte(s)
return UUID { bytes: randomBuffer }
}
func NewUUID() UUID {
var buffer [uuidByteCount]byte
_, err := io.ReadFull(rand.Reader, buffer[7:])
FatalIf(err)
now := time.Now().UnixNano()
return newUUIDFrom(buffer, now)
}
func (uuid UUID) String() string {
dst := [uuidEncodedLength]byte {
0, 0, 0, 0,
0, 0, 0, 0,
'-',
0, 0, 0, 0,
'-',
0, 0, 0, 0,
'-',
0, 0, 0, 0,
'-',
0, 0, 0, 0,
0, 0, 0, 0,
0, 0, 0, 0,
}
hex.Encode(dst[ 0:8], uuid.bytes[0:4])
hex.Encode(dst[ 9:13], uuid.bytes[4:6])
hex.Encode(dst[14:18], uuid.bytes[6:8])
hex.Encode(dst[19:23], uuid.bytes[8:10])
hex.Encode(dst[24:36], uuid.bytes[10:])
return string(dst[:])
}
var (
dashIndexes = []int { 8, 13, 18, 23 }
emptyUUID = UUID {}
badUUIDLengthError = errors.New("str isn't of the correct length")
badUUIDDashCountError = errors.New("Bad count of dashes in string")
badUUIDDashPositionError = errors.New("Bad char in string")
)
func ParseUUID(str string) (UUID, error) {
if len(str) != uuidEncodedLength {
return emptyUUID, badUUIDLengthError
}
if strings.Count(str, "-") != uuidDashCount {
return emptyUUID, badUUIDDashCountError
}
for _, idx := range dashIndexes {
if str[idx] != '-' {
return emptyUUID, badUUIDDashPositionError
}
}
hexstr := strings.Join(strings.Split(str, "-"), "")
data, err := hex.DecodeString(hexstr)
if err != nil {
return emptyUUID, err
}
return UUID { bytes: [uuidByteCount]byte(data) }, nil
}
func sourceInfo(skip int) slog.Attr {
pc := make([]uintptr, 10)
n := runtime.Callers(skip, pc)
if n == 0 {
return slog.Group(
"src",
"file", "UNAVAILABLE",
"function", "UNAVAILABLE",
"line", "UNAVAILABLE",
)
}
pc = pc[:n]
frames := runtime.CallersFrames(pc)
frame, _ := frames.Next()
return slog.Group(
"src",
"file", frame.File,
"function", frame.Function,
"line", frame.Line,
)
}
func logArgs(type_ string) []string {
return []string {
"id", NewUUID().String(),
"kind", "log",
"type", type_,
}
}
func anyArr[S ~[]E, E any](arr S) []any {
ret := make([]any, len(arr))
for i , el := range arr {
ret[i] = el
}
return ret
}
func Debug(message string, type_ string, args ...any) {
if level < LevelDebug {
return
}
slog.Debug(
message,
slices.Concat(
anyArr(logArgs(type_)),
[]any { sourceInfo(3) },
args,
)...,
)
}
func Info(message string, type_ string, args ...any) {
if level < LevelInfo {
return
}
slog.Info(
message,
slices.Concat(
anyArr(logArgs(type_)),
[]any { sourceInfo(3) },
args,
)...,
)
}
func Warning(message string, type_ string, args ...any) {
if level < LevelWarning {
return
}
slog.Warn(
message,
slices.Concat(
anyArr(logArgs(type_)),
[]any { sourceInfo(3) },
args,
)...,
)
}
func Error(message string, type_ string, args ...any) {
if level < LevelError {
return
}
slog.Error(
message,
slices.Concat(
anyArr(logArgs(type_)),
[]any { sourceInfo(3) },
args,
)...,
)
}
func metric(type_ string, label string, args ...any) {
if !emitMetric {
return
}
slog.Info(
"_",
slices.Concat(
[]any {
"id", NewUUID().String(),
"kind", "metric",
"type", type_,
"label", label,
},
[]any { sourceInfo(3) },
args,
)...,
)
}
func MakeCounter(label string) func(...any) {
return func(args ...any) {
metric(
"counter", label,
slices.Concat(
[]any { "value", 1 },
args,
)...,
)
}
}
func MakeGauge(label string, staticArgs ...any) Gauge {
var zero = big.NewInt(0)
var one = big.NewInt(1)
count := big.NewInt(0)
emitGauge := func(dynamicArgs ...any) {
if count.Cmp(zero) == -1 {
Error(
"Gauge went negative",
"process-metric",
slices.Concat(
[]any { "value", count },
staticArgs,
dynamicArgs,
)...,
)
return // avoid wrong metrics being emitted
}
metric(
"gauge", label,
slices.Concat(
[]any { "value", count },
staticArgs,
dynamicArgs,
)...,
)
}
return Gauge {
Inc: func(dynamicArgs ...any) {
count.Add(count, one)
emitGauge(dynamicArgs...)
},
Dec: func(dynamicArgs ...any) {
count.Sub(count, one)
emitGauge(dynamicArgs...)
},
}
}
func ErrorIf(err error) {
if err != nil {
fmt.Fprintf(os.Stderr, "Unexpected error: %#v\n", err)
os.Exit(1)
}
}
func ErrorNil(err error) {
if err == nil {
fmt.Fprintf(os.Stderr, "Expected error, got nil\n")
os.Exit(1)
}
}
func showColour() bool {
return os.Getenv("NO_COLOUR") == ""
}
func TestStart(name string) {
fmt.Fprintf(os.Stderr, "%s:\n", name)
}
func Testing(message string, body func()) {
if showColour() {
fmt.Fprintf(
os.Stderr,
"\033[0;33mtesting\033[0m: %s... ",
message,
)
body()
fmt.Fprint(os.Stderr, "\033[0;32mOK\033[0m.\n")
} else {
fmt.Fprintf(os.Stderr, "testing: %s...", message)
body()
fmt.Fprint(os.Stderr, " OK.\n")
}
}
func AssertEqual(given any, expected any) {
if !reflect.DeepEqual(given, expected) {
if showColour() {
fmt.Fprintf(os.Stderr, "\033[0;31mERR\033[0m.\n")
} else {
fmt.Fprintf(os.Stderr, "ERR.\n")
}
fmt.Fprintf(os.Stderr, "given != expected\n")
fmt.Fprintf(os.Stderr, "given: %#v\n", given)
fmt.Fprintf(os.Stderr, "expected: %#v\n", expected)
os.Exit(1)
}
}
func AssertEqualI(i int, given any, expected any) {
if !reflect.DeepEqual(given, expected) {
if showColour() {
fmt.Fprintf(os.Stderr, "\033[0;31mERR\033[0m.\n")
} else {
fmt.Fprintf(os.Stderr, "ERR.\n")
}
fmt.Fprintf(os.Stderr, "given != expected (i = %d)\n", i)
fmt.Fprintf(os.Stderr, "given: %#v\n", given)
fmt.Fprintf(os.Stderr, "expected: %#v\n", expected)
os.Exit(1)
}
}
var unfilteringLevel = new(slog.LevelVar)
func setLoggerOutput(w io.Writer) {
unfilteringLevel.Set(slog.LevelDebug)
slog.SetDefault(slog.New(slog.NewJSONHandler(w, &slog.HandlerOptions {
Level: unfilteringLevel,
})).With(
slog.Group(
"info",
"pid", os.Getpid(),
"ppid", os.Getppid(),
"puuid", NewUUID().String(),
),
))
}
func levelFromString(name string, fallback logLevel) logLevel {
switch strings.ToUpper(name) {
case "NONE":
return LevelNone
case "ERROR":
return LevelError
case "WARNING":
return LevelWarning
case "INFO":
return LevelInfo
case "DEBUG":
return LevelDebug
default:
return fallback
}
}
func setLogLevel() {
level = levelFromString(os.Getenv("LOG_LEVEL"), level)
}
func setMetric() {
if os.Getenv("NO_METRIC") != "" {
emitMetric = false
}
}
func setTraceback() {
if os.Getenv("GOTRACEBACK") == "" {
debug.SetTraceback("crash")
}
}
func Fatal(err error) {
Error(
"Fatal error", "fatal-error",
"error", err,
"stack", string(debug.Stack()),
)
syscall.Kill(os.Getpid(), syscall.SIGABRT)
os.Exit(3)
}
func FatalIf(err error) {
if err != nil {
Fatal(err)
}
}
func Assert(condition bool, message string) {
if !condition {
Fatal(errors.New(message))
}
}
func Unreachable() {
Assert(false, "Unreachable code was reached")
}
func setHostname() {
var err error
hostname, err = os.Hostname()
FatalIf(err)
}
func Init() {
setLoggerOutput(os.Stdout)
setLogLevel()
setMetric()
setTraceback()
setHostname()
}
|