| // Copyright 2022 The Go Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style |
| // license that can be found in the LICENSE file. |
| |
| package slog |
| |
| import ( |
| "strings" |
| "testing" |
| "time" |
| |
| "golang.org/x/exp/slices" |
| "golang.org/x/exp/slog/internal/buffer" |
| ) |
| |
| func TestRecordAttrs(t *testing.T) { |
| as := []Attr{Int("k1", 1), String("k2", "foo"), Int("k3", 3), |
| Int64("k4", -1), Float64("f", 3.1), Uint64("u", 999)} |
| r := newRecordWithAttrs(as) |
| if g, w := r.NumAttrs(), len(as); g != w { |
| t.Errorf("NumAttrs: got %d, want %d", g, w) |
| } |
| if got := attrsSlice(r); !attrsEqual(got, as) { |
| t.Errorf("got %v, want %v", got, as) |
| } |
| } |
| |
| func TestRecordSourceLine(t *testing.T) { |
| // Zero call depth => empty file/line |
| for _, test := range []struct { |
| depth int |
| wantFile string |
| wantLinePositive bool |
| }{ |
| {0, "", false}, |
| {-16, "", false}, |
| {1, "record.go", true}, |
| } { |
| r := NewRecord(time.Time{}, 0, "", test.depth, nil) |
| gotFile, gotLine := r.SourceLine() |
| if i := strings.LastIndexByte(gotFile, '/'); i >= 0 { |
| gotFile = gotFile[i+1:] |
| } |
| if gotFile != test.wantFile || (gotLine > 0) != test.wantLinePositive { |
| t.Errorf("depth %d: got (%q, %d), want (%q, %t)", |
| test.depth, gotFile, gotLine, test.wantFile, test.wantLinePositive) |
| } |
| } |
| } |
| |
| func TestAliasingAndClone(t *testing.T) { |
| intAttrs := func(from, to int) []Attr { |
| var as []Attr |
| for i := from; i < to; i++ { |
| as = append(as, Int("k", i)) |
| } |
| return as |
| } |
| |
| check := func(r Record, want []Attr) { |
| t.Helper() |
| got := attrsSlice(r) |
| if !attrsEqual(got, want) { |
| t.Errorf("got %v, want %v", got, want) |
| } |
| } |
| |
| // Create a record whose Attrs overflow the inline array, |
| // creating a slice in r.back. |
| r1 := NewRecord(time.Time{}, 0, "", 0, nil) |
| r1.AddAttrs(intAttrs(0, nAttrsInline+1)...) |
| // Ensure that r1.back's capacity exceeds its length. |
| b := make([]Attr, len(r1.back), len(r1.back)+1) |
| copy(b, r1.back) |
| r1.back = b |
| // Make a copy that shares state. |
| r2 := r1 |
| // Adding to both should panic. |
| r1.AddAttrs(Int("p", 0)) |
| if !panics(func() { r2.AddAttrs(Int("p", 1)) }) { |
| t.Error("expected panic") |
| } |
| r1Attrs := attrsSlice(r1) |
| // Adding to a clone is fine. |
| r2 = r1.Clone() |
| check(r2, r1Attrs) |
| r2.AddAttrs(Int("p", 2)) |
| check(r1, r1Attrs) // r1 is unchanged |
| check(r2, append(slices.Clip(r1Attrs), Int("p", 2))) |
| } |
| |
| func newRecordWithAttrs(as []Attr) Record { |
| r := NewRecord(time.Now(), InfoLevel, "", 0, nil) |
| r.AddAttrs(as...) |
| return r |
| } |
| |
| func attrsSlice(r Record) []Attr { |
| s := make([]Attr, 0, r.NumAttrs()) |
| r.Attrs(func(a Attr) { s = append(s, a) }) |
| return s |
| } |
| |
| func attrsEqual(as1, as2 []Attr) bool { |
| return slices.EqualFunc(as1, as2, Attr.Equal) |
| } |
| |
| // Currently, pc(2) takes over 400ns, which is too expensive |
| // to call it for every log message. |
| func BenchmarkPC(b *testing.B) { |
| b.ReportAllocs() |
| var x uintptr |
| for i := 0; i < b.N; i++ { |
| x = pc(3) |
| } |
| _ = x |
| } |
| |
| func BenchmarkSourceLine(b *testing.B) { |
| r := NewRecord(time.Now(), InfoLevel, "", 5, nil) |
| b.Run("alone", func(b *testing.B) { |
| for i := 0; i < b.N; i++ { |
| file, line := r.SourceLine() |
| _ = file |
| _ = line |
| } |
| }) |
| b.Run("stringifying", func(b *testing.B) { |
| for i := 0; i < b.N; i++ { |
| file, line := r.SourceLine() |
| buf := buffer.New() |
| buf.WriteString(file) |
| buf.WriteByte(':') |
| buf.WritePosInt(line) |
| s := buf.String() |
| buf.Free() |
| _ = s |
| } |
| }) |
| } |
| |
| func BenchmarkRecord(b *testing.B) { |
| const nAttrs = nAttrsInline * 10 |
| var a Attr |
| |
| for i := 0; i < b.N; i++ { |
| r := NewRecord(time.Time{}, InfoLevel, "", 0, nil) |
| for j := 0; j < nAttrs; j++ { |
| r.AddAttrs(Int("k", j)) |
| } |
| r.Attrs(func(b Attr) { a = b }) |
| } |
| _ = a |
| } |