[ { "path": ".github/workflows/test.yml", "content": "on: [push, pull_request]\nname: Test\njobs:\n test:\n strategy:\n matrix:\n go-version: [1.17.x]\n os: [ubuntu-latest, macos-latest, windows-latest]\n runs-on: ${{ matrix.os }}\n steps:\n - uses: actions/setup-go@v3\n with:\n go-version: ${{ matrix.go-version }}\n - uses: actions/checkout@v3\n - run: go install golang.org/x/tools/cmd/stringer@latest\n - run: go test ./...\n" }, { "path": ".gitignore", "content": "/cmd/bitstringer/bitstringer\n/cmd/branchstats/branchstats\n/cmd/memanim/memanim\n/cmd/memheat/memheat\n/cmd/memlat/memlat\n/cmd/perfdump/perfdump\n/cmd/prologuer/prologuer\n" }, { "path": "LICENSE", "content": "Copyright (c) 2015 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "README.md", "content": "go-perf is a set of tools for working with Linux perf.data profiles,\nas well as a set of Go packages for parsing and interpreting such\nprofiles.\n\nmemlat\n------\n\nmemlat is a web-based interactive browser for memory load latency\nprofiles. Such profiles give deep and detailed insight in to the\nsources of memory stalls and conflicts, but are difficult to interpret\nusing traditional profiling tools. See the\n[detailed documentation on godoc](http://godoc.org/github.com/aclements/go-perf/cmd/memlat).\n\nThere is also a predecessor of memlat in `cmd/memheat`. This tool\ngenerates static SVG files summarizing memory load latency\ndistributions by function and source line. This may be removed in the\nfuture.\n\ndump\n----\n\ndump prints the detailed decoded contents of a perf.data profile. It's\nsimilar to `perf report -D`, but is somewhat less mysterious. It's\nparticularly useful when developing with the perffile library because\nit prints everything in terms of perffile structures.\n\nLibraries\n---------\n\nThis repository also contains two Go packages for parsing and\ninterpreting perf.data files.\n\n[perffile](http://godoc.org/github.com/aclements/go-perf/perffile)\nprovides a parser for perf.data files. It can interpret all current\nrecord types and almost all metadata fields.\n\n[perfsession](http://godoc.org/github.com/aclements/go-perf/perfsession)\nprovides utilities for tracking session state while processing a\nperf.data file. Its API is still evolving and should be considered\nunstable.\n" }, { "path": "cmd/bitstringer/main.go", "content": "// Copyright 2016 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Command bitstringer generates String methods for bit-mask types.\n//\n// bitstringer is like the stringer tool, but for bit-mask types. See\n// go doc stringer for details.\n//\n// bitstringer adds one flag, -strip, which specifies a prefix to\n// strip from stringified-constants. For bit-mask types in particular,\n// this can make the string representation much shorter, at the\n// expense of not being unambiguous and syntactically valid Go code.\npackage main\n\nimport (\n\t\"flag\"\n\t\"fmt\"\n\t\"go/ast\"\n\t\"go/build\"\n\t\"go/constant\"\n\t\"go/importer\"\n\t\"go/parser\"\n\t\"go/token\"\n\t\"go/types\"\n\t\"io\"\n\t\"log\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"strings\"\n)\n\nfunc main() {\n\tflagTypes := flag.String(\"type\", \"\", \"comma-separated list of `types` to generate Stringers for\")\n\tflagStrip := flag.String(\"strip\", \"\", \"strip `prefix` from constant names\")\n\tflag.Parse()\n\tif flag.NArg() != 0 {\n\t\tflag.PrintDefaults()\n\t\tos.Exit(2)\n\t}\n\n\t// Find source files.\n\twd, err := os.Getwd()\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tpkg, err := build.ImportDir(wd, 0)\n\tif err != nil {\n\t\tlog.Fatalf(\"importing %s: %v\", wd, err)\n\t}\n\tpaths := prefixDirectory(pkg.Dir, pkg.GoFiles)\n\n\t// Parse source files.\n\tfset := token.NewFileSet()\n\tvar files []*ast.File\n\tfor _, path := range paths {\n\t\tf, err := parser.ParseFile(fset, path, nil, 0)\n\t\tif err != nil {\n\t\t\tlog.Fatalf(\"parsing file %s: %v\", path, err)\n\t\t}\n\t\tfiles = append(files, f)\n\t}\n\n\t// Type check.\n\tconf := types.Config{Importer: importer.Default(), FakeImportC: true}\n\tinfo := &types.Info{\n\t\tDefs: make(map[*ast.Ident]types.Object),\n\t}\n\ttypesPkg, err := conf.Check(pkg.ImportPath, fset, files, info)\n\tif err != nil {\n\t\tlog.Fatalf(\"checking package: %v\", err)\n\t}\n\tscope := typesPkg.Scope()\n\n\t// Find the requested Types.\n\tnames := strings.Split(*flagTypes, \",\")\n\tname2Type := map[string]types.Type{}\n\tconsts := map[types.Type][]*types.Const{}\n\tfor _, name := range names {\n\t\ttname, ok := scope.Lookup(name).(*types.TypeName)\n\t\tif !ok {\n\t\t\tlog.Fatalf(\"unknown type %q\", name)\n\t\t}\n\t\t// Check that it's integral.\n\t\tutype := tname.Type().Underlying()\n\t\tif utype, ok := utype.(*types.Basic); !ok || utype.Info()&types.IsInteger == 0 {\n\t\t\tlog.Fatalf(\"type %q is not an integer type\", name)\n\t\t}\n\t\tname2Type[name] = tname.Type()\n\t\tconsts[tname.Type()] = nil\n\t}\n\n\t// Find all constants with each Type.\n\tfor _, name := range scope.Names() {\n\t\tobj := scope.Lookup(name)\n\t\tcobj, ok := obj.(*types.Const)\n\t\tif !ok {\n\t\t\tcontinue\n\t\t}\n\t\tconstList, ok := consts[cobj.Type()]\n\t\tif !ok {\n\t\t\tcontinue\n\t\t}\n\t\tconstList = append(constList, cobj)\n\t\tconsts[cobj.Type()] = constList\n\t}\n\n\t// Construct String methods.\n\tfor _, name := range names {\n\t\tfname := strings.ToLower(name) + \"_string.go\"\n\t\tf, err := os.Create(fname)\n\t\tif err != nil {\n\t\t\tlog.Fatalf(\"error creating %s: %v\", fname, err)\n\t\t}\n\t\ttyp := name2Type[name]\n\t\twriteStringer(f, pkg.Name, name, *flagStrip, consts[typ])\n\t\tif err := f.Close(); err != nil {\n\t\t\tlog.Fatalf(\"error writing %s: %v\", fname, err)\n\t\t}\n\t}\n}\n\nfunc prefixDirectory(dir string, names []string) []string {\n\tif dir == \".\" {\n\t\treturn names\n\t}\n\tout := make([]string, len(names))\n\tfor i, name := range names {\n\t\tout[i] = filepath.Join(dir, name)\n\t}\n\treturn out\n}\n\nfunc writeStringer(w io.Writer, pkg, tname, prefix string, consts []*types.Const) {\n\tif len(consts) == 0 {\n\t\tfmt.Fprintf(os.Stderr, \"warning: no consts for type %q\\n\", tname)\n\t}\n\n\tfmt.Fprintf(w, `// Code generated by \"bitstringer -type=%s\"; DO NOT EDIT\n\npackage %s\n\nimport \"strconv\"\n\nfunc (i %s) String() string {\n`, tname, pkg, tname)\n\n\tstrip := func(s string) string {\n\t\treturn strings.TrimPrefix(s, prefix)\n\t}\n\n\t// Find and format any zero value.\n\tzero := constant.MakeInt64(0)\n\tzlabel := \"0\"\n\tfor _, c := range consts {\n\t\tval := c.Val()\n\t\tif constant.Compare(val, token.EQL, zero) {\n\t\t\t// Format it.\n\t\t\tzlabel = strip(c.Name())\n\t\t\tbreak\n\t\t}\n\t}\n\tfmt.Fprintf(w, \"\\tif i == 0 {\\n\\t\\treturn %q\\n\\t}\\n\", zlabel)\n\n\t// Create bit value formatters.\n\tfmt.Fprintf(w, \"\\ts := \\\"\\\"\\n\")\n\thave := constant.MakeInt64(0)\n\tfor _, c := range consts {\n\t\t// Does this contribute to the bit set?\n\t\thave2 := constant.BinaryOp(have, token.OR, c.Val())\n\t\tif constant.Compare(have, token.EQL, have2) {\n\t\t\t// Nope.\n\t\t\tcontinue\n\t\t}\n\t\thave = have2\n\t\t// Format it.\n\t\tfmt.Fprintf(w, \"\\tif i&%s != 0 {\\n\\t\\ts += %q\\n\\t}\\n\", c.Name(), strip(c.Name())+\"|\")\n\t}\n\t// Handle any left-over bits.\n\tfmt.Fprintf(w, `\ti &^= %s\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n`, have.ExactString())\n}\n" }, { "path": "cmd/branchstats/main.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Command branchstats analyzes branch profiles for branch mispredict\n// rates.\n//\n// branchstats expects a perf.data collected with\n//\n// perf record -e branches -j any -c 400009\n//\n// To collect only branches in user-space code, use\n//\n// perf record -e branches:u -j any,u -c 400009\n//\n// The output is a table like\n//\n// comm PC branches mispredicts\n// bench scanner.go:258 419609441 309206957 (73.7%)\n// 257 func isLetter(ch rune) bool {\n// 258 return 'a' <= ch && ch <= 'z' || 'A' <= ch && ch <= 'Z' || ch == '_' || ch >= 0x80 && unicode.IsLetter(ch)\n// 259 }\n//\n// bench mgcmark.go:1000 1967244262 236405319 (12.0%)\n// 999 }\n// 1000 if bits&bitPointer == 0 {\n// 1001 continue // not a pointer\n//\n// Each row shows a branch at a particular location and gives the\n// estimated number of times that branch executed, the estimated\n// number of mispredicts, and the mispredict rate. The table is sorted\n// by the number of mispredicts.\npackage main\n\nimport (\n\t\"bufio\"\n\t\"flag\"\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sort\"\n\n\t\"github.com/aclements/go-perf/perffile\"\n\t\"github.com/aclements/go-perf/perfsession\"\n)\n\ntype PC struct {\n\tPC uint64\n\tComm string\n}\n\ntype Agg struct {\n\tMmap *perfsession.Mmap\n\tEvents uint64\n\tPredicted int64\n\tMispredicted int64\n}\n\ntype pair struct {\n\tPC\n\tAgg\n\trate float64\n}\n\nfunc main() {\n\tvar (\n\t\tflagInput = flag.String(\"i\", \"perf.data\", \"input perf.data `file`\")\n\t)\n\tflag.Parse()\n\tif flag.NArg() > 0 {\n\t\tflag.Usage()\n\t\tos.Exit(1)\n\t}\n\n\tf, err := perffile.Open(*flagInput)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer f.Close()\n\ts := perfsession.New(f)\n\n\tagg := make(map[PC]Agg)\n\n\tconst requiredFormat = perffile.SampleFormatTID | perffile.SampleFormatBranchStack\n\trs := f.Records(perffile.RecordsCausalOrder)\n\tfor rs.Next() {\n\t\tr := rs.Record\n\t\ts.Update(r)\n\n\t\tswitch r := r.(type) {\n\t\tcase *perffile.RecordSample:\n\t\t\tif r.Format&requiredFormat != requiredFormat {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tpidinfo := s.LookupPID(r.PID)\n\t\t\tcomm := \"\"\n\t\t\tvar mmap *perfsession.Mmap\n\t\t\tif pidinfo != nil {\n\t\t\t\tcomm = pidinfo.Comm\n\t\t\t\tmmap = pidinfo.LookupMmap(r.BranchStack[0].From)\n\t\t\t}\n\n\t\t\t// We ignore the location of the sample\n\t\t\t// because it's often not a branch (even in\n\t\t\t// precise mode). Instead, we take the most\n\t\t\t// recent branch record as an unbiased,\n\t\t\t// precise sampling of branches. Similarly, we\n\t\t\t// only take the prediction information from\n\t\t\t// the most recent branch. (Too bad there's no\n\t\t\t// way to tell perf we only want one branch\n\t\t\t// record.)\n\t\t\tbr := r.BranchStack[0]\n\t\t\tpc := PC{br.From, comm}\n\n\t\t\tvar events uint64\n\t\t\tif r.Format&perffile.SampleFormatPeriod != 0 {\n\t\t\t\tevents = r.Period\n\t\t\t} else if r.EventAttr.Flags&perffile.EventFlagFreq == 0 {\n\t\t\t\tevents = r.EventAttr.SamplePeriod\n\t\t\t} else {\n\t\t\t\tlog.Fatalf(\"sample %+v has no period\", r)\n\t\t\t}\n\n\t\t\ta := agg[pc]\n\t\t\ta.Events += events\n\t\t\ta.Mmap = mmap\n\t\t\tif br.Flags&perffile.BranchFlagMispredicted != 0 {\n\t\t\t\ta.Mispredicted++\n\t\t\t}\n\t\t\tif br.Flags&perffile.BranchFlagPredicted != 0 {\n\t\t\t\ta.Predicted++\n\t\t\t}\n\t\t\tagg[pc] = a\n\t\t}\n\t}\n\tif err := rs.Err(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\t// Rescale and sort records.\n\tpairs := make([]pair, 0)\n\tfor pc, a := range agg {\n\t\tif a.Events == 0 {\n\t\t\tcontinue\n\t\t}\n\t\trate := float64(a.Mispredicted) / float64(a.Predicted+a.Mispredicted)\n\t\ta.Mispredicted = int64(rate * float64(a.Events))\n\t\ta.Predicted = int64(a.Events) - a.Mispredicted\n\n\t\tpairs = append(pairs, pair{pc, a, rate})\n\t}\n\tsort.Sort(sort.Reverse(pairSorter(pairs)))\n\n\t// Print summary information.\n\tvar total Agg\n\tfor _, a := range pairs {\n\t\ttotal.Events += a.Events\n\t\ttotal.Mispredicted += a.Mispredicted\n\t\ttotal.Predicted += a.Predicted\n\t}\n\tfmt.Printf(\"# Total branches: %d\\n\", total.Events)\n\tfmt.Printf(\"# Total mispredicts: %d (%2.1f%% of all branches)\\n\", total.Mispredicted, 100*float64(total.Mispredicted)/float64(total.Events))\n\tfmt.Printf(\"\\n\")\n\n\t// Print branch details.\n\tvar sym perfsession.Symbolic\n\tfmt.Printf(\"%-8s %-24s %16s %s\\n\", \"comm\", \"PC\", \"branches\", \"mispredicts\")\n\tfor _, pair := range pairs {\n\t\tvar pos string\n\t\tvar lines []string\n\t\tif pair.Mmap != nil && perfsession.Symbolize(s, pair.Mmap, pair.PC.PC, &sym) && sym.Line.File != nil {\n\t\t\tpos = fmt.Sprintf(\"%s:%d\", filepath.Base(sym.Line.File.Name), sym.Line.Line)\n\t\t\tlines, _ = getLines(sym.Line.File.Name, sym.Line.Line-1, sym.Line.Line+1)\n\t\t} else {\n\t\t\tpos = fmt.Sprintf(\"%#-24x\", pair.PC.PC)\n\t\t\tlines = nil\n\t\t}\n\n\t\tfmt.Printf(\"%-8.8s %-24s %16d %d (%2.1f%%)\\n\", pair.Comm, pos, pair.Events, pair.Mispredicted, 100*pair.rate)\n\t\ttrim := stringCommon(lines)\n\t\tfor i, line := range lines {\n\t\t\tfmt.Printf(\"%7d %s\\n\", i+sym.Line.Line-1, line[trim:])\n\t\t}\n\t\tfmt.Printf(\"\\n\")\n\t}\n}\n\ntype pairSorter []pair\n\nfunc (p pairSorter) Len() int {\n\treturn len(p)\n}\n\nfunc (p pairSorter) Swap(i, j int) {\n\tp[i], p[j] = p[j], p[i]\n}\n\nfunc (p pairSorter) Less(i, j int) bool {\n\tif p[i].Mispredicted != p[j].Mispredicted {\n\t\treturn p[i].Mispredicted < p[j].Mispredicted\n\t}\n\tif p[i].Events != p[j].Events {\n\t\treturn p[i].Events < p[j].Events\n\t}\n\tif p[i].Comm != p[j].Comm {\n\t\treturn p[i].Comm < p[j].Comm\n\t}\n\treturn p[i].PC.PC < p[j].PC.PC\n}\n\nfunc getLines(path string, minLine, maxLine int) ([]string, error) {\n\t// TODO: Make a nice line cache API. This isn't the only place\n\t// I've needed this.\n\n\tlines := make([]string, maxLine-minLine+1)\n\n\tfile, err := os.Open(path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer file.Close()\n\n\t// Skip to minLine.\n\tscanner := bufio.NewScanner(file)\n\tfor i := 0; i < minLine && scanner.Scan(); i++ {\n\t\t// Do nothing\n\t}\n\n\tfor line := minLine; line <= maxLine && scanner.Err() == nil; line++ {\n\t\tlines[line-minLine] = scanner.Text()\n\t\tscanner.Scan()\n\t}\n\tif err := scanner.Err(); err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn lines, nil\n}\n\nfunc stringCommon(strs []string) int {\n\tif len(strs) == 0 {\n\t\treturn 0\n\t}\n\n\tfor i := 0; i < len(strs[0]); i++ {\n\t\tc := strs[0][i]\n\t\tfor _, s := range strs {\n\t\t\tif i == len(s) || s[i] != c {\n\t\t\t\treturn i\n\t\t\t}\n\t\t}\n\t}\n\treturn len(strs[0])\n}\n" }, { "path": "cmd/memanim/.gitignore", "content": "/addr.png\n/f*.png\n/out.mp4\n/memanim\n" }, { "path": "cmd/memanim/hilbert_test.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport \"testing\"\n\nfunc TestHilbert(t *testing.T) {\n\tconst n = 64\n\tx0, y0 := hilbert(n, 0)\n\thave := make([]bool, n*n)\n\thave[x0+y0*n] = true\n\tfor d := 1; d < n*n; d++ {\n\t\tx1, y1 := hilbert(n, d)\n\t\tif !(x0 == x1 && abs(y0-y1) == 1 ||\n\t\t\ty0 == y1 && abs(x0-x1) == 1) {\n\t\t\tt.Fatalf(\"moved by more than 1: (%d,%d) -> (%d,%d)\", x0, y0, x1, y1)\n\t\t}\n\t\tif have[x1+y1*n] {\n\t\t\tt.Fatalf(\"repeated point (%d,%d)\", x1, y1)\n\t\t}\n\t\thave[x1+y1*n] = true\n\t\tx0, y0 = x1, y1\n\t}\n}\n\nfunc abs(n int) int {\n\tif n < 0 {\n\t\treturn -n\n\t}\n\treturn n\n}\n" }, { "path": "cmd/memanim/main.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Command memanim creates an animation of memory accesses over time\n// from a \"perf mem record\" profile. In the animation, the address\n// space is compacted to remove pages that have no recorded references\n// and then mapped on to Hilbert curve so that nearby accesses appear\n// nearby in 2-D space. It is then broken in to panels showing all\n// accesses, L2-and-up accesses, etc.\n//\n// The simplest way to record a memory load profile is \"perf mem\n// record \".\n//\n// To record only load latency events over a threshold number of\n// cycles, use the following command on Sandy Bridge or later:\n//\n// perf record -W -d -e cpu/event=0xcd,umask=0x1,ldlat=/pp \n//\n// The minimum (and default) latency threshold is 3 cycles.\n//\n// At a reasonably high latency threshold, such as 50 cycles, it's\n// possible to crank up to recording every single load with, e.g.,\n// --count 1 -m 1024.\n//\n// To collect only user-space loads, change pp to ppu.\npackage main\n\nimport (\n\t\"flag\"\n\t\"fmt\"\n\t\"image\"\n\t\"image/color\"\n\t\"image/draw\"\n\t\"image/png\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"math\"\n\t\"os\"\n\t\"runtime/pprof\"\n\t\"sort\"\n\n\t\"github.com/aclements/go-perf/perffile\"\n\t\"github.com/golang/freetype\"\n)\n\nconst pageBytes = 4096\n\nfunc main() {\n\tvar (\n\t\tflagInput = flag.String(\"i\", \"perf.data\", \"read memory latency profile from `file`\")\n\t\tflagBy = flag.String(\"by\", \"address\", \"`layout` by \\\"address\\\" or \\\"pc\\\"\")\n\t\tflagFPS = flag.Int(\"fps\", 24, \"frames per second\")\n\t\tflagDilation = flag.Float64(\"dilation\", 1, \"time dilation factor\")\n\t\tflagWidth = flag.Int(\"w\", 512, \"output width/height; must be a power of 2\")\n\t\tflagCpuProfile = flag.String(\"cpuprofile\", \"\", \"write cpu profile to file\")\n\t)\n\tflag.Parse()\n\tif flag.NArg() > 0 {\n\t\tflag.Usage()\n\t\tos.Exit(1)\n\t}\n\n\tif *flagWidth <= 0 || *flagWidth&(*flagWidth-1) != 0 {\n\t\tfmt.Fprintln(os.Stderr, \"width must be a power of two\")\n\t\tos.Exit(1)\n\t}\n\n\tif !(*flagBy == \"address\" || *flagBy == \"pc\") {\n\t\tfmt.Fprintln(os.Stderr, \"-by must be address or pc\")\n\t\tos.Exit(1)\n\t}\n\n\tif *flagCpuProfile != \"\" {\n\t\tf, err := os.Create(*flagCpuProfile)\n\t\tif err != nil {\n\t\t\tfmt.Fprintln(os.Stderr, err)\n\t\t\tos.Exit(1)\n\t\t}\n\t\tpprof.StartCPUProfile(f)\n\t\tdefer pprof.StopCPUProfile()\n\t}\n\n\t// TODO: Do something better with weight? I tried blue/red\n\t// coloring, but it really isn't obvious. Fade it out at a\n\t// certain rate? Shade? Ripples?\n\n\tevents := parsePerf(*flagInput, *flagBy)\n\n\t// Canonicalize the events.\n\timgSize := *flagWidth\n\tmapper := newAddrMapper(events, uint64(imgSize*imgSize-1))\n\tnormalizeWeight(events)\n\tzeroTime(events)\n\tlastTime := events[len(events)-1].time\n\n\t// Load font.\n\t//\n\t// TODO Don't hard-code it's location. Unfortunately, there's\n\t// no fontconfig equivalent for Go that I can find.\n\tfontCtx := freetype.NewContext()\n\tfontData, err := ioutil.ReadFile(\"/usr/share/fonts/truetype/dejavu/DejaVuSans.ttf\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tfont, err := freetype.ParseFont(fontData)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tfontCtx.SetFontSize(12)\n\tfontCtx.SetSrc(image.Black)\n\tfontCtx.SetFont(font)\n\tfontBounds := font.Bounds(fontCtx.PointToFixed(12))\n\tlabelHeight := int((fontBounds.Max.Y - fontBounds.Min.Y) >> 6)\n\n\t// Create image.\n\timg := image.NewNRGBA(image.Rect(0, 0, (imgSize+1)*numPanels-1, imgSize+labelHeight))\n\tdraw.Draw(img, img.Bounds(), image.White, image.ZP, draw.Over)\n\tfontCtx.SetDst(img)\n\tfontCtx.SetClip(img.Bounds())\n\n\t// Construct sub-images for panels and draw framing elements.\n\tlevelImgs := make([]*image.NRGBA, numPanels)\n\tfor i := range levelImgs {\n\t\tleft := (imgSize + 1) * i\n\t\tlevelImgs[i] = img.SubImage(image.Rect(left, labelHeight, left+imgSize, imgSize+labelHeight)).(*image.NRGBA)\n\t\tlevelImgs[i].Rect = levelImgs[i].Rect.Sub(levelImgs[i].Rect.Min)\n\n\t\tif i > 0 {\n\t\t\tfor y := img.Rect.Min.Y; y < img.Rect.Max.Y; y++ {\n\t\t\t\timg.Set(left-1, y, color.Black)\n\t\t\t}\n\t\t}\n\t\tfontCtx.DrawString(\">= \"+panelLevels[i].String(), freetype.Pt(left+2, 12))\n\t}\n\n\t// Create address space reference image.\n\t//\n\t// TODO: This isn't very useful, it turns out. I could simply\n\t// print out the map from coordinate to address. Visually, I\n\t// could underlay boundaries between very distinct parts of\n\t// the address space (say, find points that have a >1GB break\n\t// and mark the boundary between all pixels before that break\n\t// and after that break).\n\tif false {\n\t\taddrStep := int(math.Floor(1 / mapper.normFactor))\n\t\tfor pfn := range mapper.pageBase {\n\t\t\tfor offset := 0; offset < pageBytes; offset += addrStep {\n\t\t\t\taddr := pfn*pageBytes + uint64(offset)\n\t\t\t\tx, y := hilbert(imgSize, int(mapper.mapAddr(addr)))\n\t\t\t\tnaddr := float64(addr%(1<<48)) / (1 << 48) * 2 * math.Pi\n\t\t\t\tcb, cr := math.Cos(naddr), -math.Sin(naddr)\n\t\t\t\t//fmt.Println(fmt.Sprintf(\"%016x\", addr), int(mapper.mapAddr(addr)), naddr, cb, cr)\n\t\t\t\tr, g, b := color.YCbCrToRGB(127, uint8((cb+1)*127), uint8((cr+1)*127))\n\t\t\t\timg.SetNRGBA(x, y, color.NRGBA{r, g, b, 255})\n\t\t\t}\n\t\t}\n\t\twritePNG(\"addr.png\", img)\n\t}\n\n\tnsPerFrame := int(1000000000 / (float64(*flagFPS) * *flagDilation))\n\tlastIndex := 0\n\tfor frame := 0; ; frame++ {\n\t\tt0 := uint64(frame * nsPerFrame)\n\t\tt1 := uint64((frame + 1) * nsPerFrame)\n\n\t\tif t0 > lastTime {\n\t\t\tbreak\n\t\t}\n\t\tlog.Println(\"frame\", frame)\n\n\t\t// Fade the frame.\n\t\t//\n\t\t// TODO: The fade rate should be proportional to FPS.\n\t\tfor _, levelImg := range levelImgs {\n\t\t\tfor y := 0; y < levelImg.Rect.Dy(); y++ {\n\t\t\t\tscan := levelImg.Pix[y*levelImg.Stride : y*levelImg.Stride+levelImg.Rect.Dx()*4]\n\t\t\t\tfor i, p := range scan {\n\t\t\t\t\tscan[i] = uint8(255 - (int(255-p) * 3 / 4))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Draw the events.\n\t\tfor evIndex, ev := range events[lastIndex:] {\n\t\t\tif ev.time < t0 {\n\t\t\t\tpanic(\"time went backwards\")\n\t\t\t}\n\t\t\tif t1 <= ev.time {\n\t\t\t\tlastIndex += evIndex\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\taddr := mapper.mapAddr(ev.addr)\n\t\t\tx, y := hilbert(imgSize, int(addr))\n\t\t\t//color := color.NRGBA{R: uint8(ev.weight), G: 0, B: 255 - uint8(ev.weight), A: 255}\n\t\t\tcolor := color.NRGBA{0, 0, 0, 255}\n\t\t\tfor level := 0; level <= ev.level; level++ {\n\t\t\t\tlevelImgs[level].SetNRGBA(x, y, color)\n\t\t\t}\n\t\t}\n\n\t\t// Write the frame out.\n\t\twritePNG(fmt.Sprintf(\"f%08d.png\", frame), img)\n\t}\n\n\tfmt.Printf(\"%g bytes/pixel\\n\", 1/mapper.normFactor)\n\tfmt.Printf(\"%g pixels/page\\n\", mapper.normFactor*pageBytes)\n\n\tfmt.Printf(\"To combine frames:\\n mencoder 'mf://f*.png' -mf fps=%d -nosound -of lavf -lavfopts format=mp4 -ovc x264 -o out.mp4\\n\", *flagFPS)\n}\n\ntype event struct {\n\ttime uint64\n\taddr uint64\n\tweight uint64\n\tlevel int\n}\n\n// parsePerf parses a perf.data profile and returns the cache miss\n// events.\nfunc parsePerf(fileName, by string) []event {\n\tf, err := perffile.Open(fileName)\n\tif err != nil {\n\t\tfmt.Fprintf(os.Stderr, \"error loading profile: %s\\n\", err)\n\t\tos.Exit(1)\n\t}\n\tdefer f.Close()\n\n\tbyPC := by == \"pc\"\n\n\tconst requiredFormat = perffile.SampleFormatTime | perffile.SampleFormatAddr | perffile.SampleFormatWeight | perffile.SampleFormatDataSrc\n\n\tevents := make([]event, 0)\n\trs := f.Records(perffile.RecordsTimeOrder)\n\tfor rs.Next() {\n\t\tr := rs.Record\n\t\tswitch r := r.(type) {\n\t\tcase *perffile.RecordSample:\n\t\t\tif r.Format&requiredFormat != requiredFormat {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tlevel := r.DataSrc.Level\n\t\t\tif r.DataSrc.Miss {\n\t\t\t\tlevel <<= 1\n\t\t\t}\n\t\t\taddr := r.Addr\n\t\t\tif byPC {\n\t\t\t\taddr = r.IP\n\t\t\t}\n\t\t\tevents = append(events, event{r.Time, addr, r.Weight, levelToPanel[level]})\n\t\t}\n\t}\n\n\treturn events\n}\n\ntype addrMapper struct {\n\tpageBase map[uint64]uint64\n\tnormMax uint64\n\tnormFactor float64 // pixels/byte\n}\n\n// newAddrMapper returns an addrMapper that maps addresses in events\n// to a compacted space in the range [0, normMax].\nfunc newAddrMapper(events []event, normMax uint64) *addrMapper {\n\tam := &addrMapper{normMax: normMax}\n\n\t// Find all distinct pages and max address.\n\tpages := make([]uint64, 0)\n\tpageSet := make(map[uint64]bool)\n\tmaxAddr := uint64(0)\n\tfor _, ev := range events {\n\t\tpage := ev.addr / pageBytes\n\t\tif pageSet[page] {\n\t\t\tcontinue\n\t\t}\n\t\tpageSet[page] = true\n\t\tpages = append(pages, page)\n\n\t\tif ev.addr > maxAddr {\n\t\t\tmaxAddr = ev.addr\n\t\t}\n\t}\n\tsort.Sort(uint64Slice(pages))\n\n\t// Map pages to a compact sequence.\n\tam.pageBase = make(map[uint64]uint64, len(pages))\n\tfor i, page := range pages {\n\t\tam.pageBase[page] = uint64(i) * pageBytes\n\t}\n\n\t// Compute normalization factor.\n\tcompactMax := am.pageBase[maxAddr/pageBytes] + maxAddr%pageBytes\n\tif compactMax <= normMax {\n\t\tam.normFactor = 1\n\t} else {\n\t\tam.normFactor = float64(normMax) / float64(compactMax)\n\t}\n\n\treturn am\n}\n\nfunc (am *addrMapper) mapAddr(addr uint64) uint64 {\n\tcompact := am.pageBase[addr/pageBytes] + addr%pageBytes\n\tnorm := uint64(float64(compact) * am.normFactor)\n\tif norm > am.normMax {\n\t\tnorm = am.normMax\n\t}\n\treturn norm\n}\n\nfunc normalizeWeight(events []event) {\n\t// Find the maximum weight.\n\tmaxW := uint64(0)\n\tfor _, ev := range events {\n\t\tif ev.weight > maxW {\n\t\t\tmaxW = ev.weight\n\t\t}\n\t}\n\n\t// TODO: Log scale?\n\n\t// Normalize [0, maxW] to [0, 255].\n\tfactor := float64(255) / float64(maxW)\n\tfor i, ev := range events {\n\t\tw := uint64(float64(ev.weight) * factor)\n\t\tif w > 255 {\n\t\t\tw = 255\n\t\t}\n\t\tevents[i].weight = w\n\t}\n}\n\nfunc zeroTime(events []event) {\n\tif len(events) == 0 {\n\t\treturn\n\t}\n\tt0 := events[0].time\n\tfor i := range events {\n\t\tevents[i].time -= t0\n\t}\n}\n\ntype uint64Slice []uint64\n\nfunc (s uint64Slice) Len() int {\n\treturn len(s)\n}\n\nfunc (s uint64Slice) Less(i, j int) bool {\n\treturn s[i] < s[j]\n}\n\nfunc (s uint64Slice) Swap(i, j int) {\n\ts[i], s[j] = s[j], s[i]\n}\n\n// hilbert converts a 1-D point d to a coordinate (x, y) in an n×n\n// Hilbert space.\nfunc hilbert(n, d int) (x, y int) {\n\t// Based on Wikipedia.\n\trot := func(s, x, y, rx, ry int) (int, int) {\n\t\tif ry == 0 {\n\t\t\tif rx == 1 {\n\t\t\t\tx = s - 1 - x\n\t\t\t\ty = s - 1 - y\n\t\t\t}\n\t\t\tx, y = y, x\n\t\t}\n\t\treturn x, y\n\t}\n\tfor s := 1; s < n; s *= 2 {\n\t\trx := 1 & (d / 2)\n\t\try := 1 & (d ^ rx)\n\t\tx, y = rot(s, x, y, rx, ry)\n\t\tx += s * rx\n\t\ty += s * ry\n\t\td /= 4\n\t}\n\treturn\n}\n\nfunc writePNG(path string, img image.Image) {\n\tf, err := os.Create(path)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tenc := png.Encoder{CompressionLevel: png.BestSpeed}\n\tif err := enc.Encode(f, img); err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tif err := f.Close(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n\n// panelLevels maps from panel number to data source level.\nvar panelLevels = [...]perffile.DataSrcLevel{\n\tperffile.DataSrcLevelL1,\n\tperffile.DataSrcLevelL2,\n\tperffile.DataSrcLevelL3,\n\tperffile.DataSrcLevelLocalRAM,\n\tperffile.DataSrcLevelRemoteRAM1,\n}\n\nconst numPanels = len(panelLevels)\n\n// levelToPanel maps from a data source level to a panel number.\nvar levelToPanel = map[perffile.DataSrcLevel]int{\n\tperffile.DataSrcLevelNA: 0,\n}\n\nfunc init() {\n\tfor panel, level := range panelLevels {\n\t\tlevelToPanel[level] = panel\n\t}\n\n\tvar l int\n\tfor i := perffile.DataSrcLevelL1; i <= perffile.DataSrcLevelUncached; i++ {\n\t\tif l2, ok := levelToPanel[i]; ok {\n\t\t\tl = l2\n\t\t} else {\n\t\t\tlevelToPanel[i] = l\n\t\t}\n\t}\n}\n" }, { "path": "cmd/memheat/draw.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport (\n\t\"fmt\"\n\t\"image/color\"\n\n\t\"github.com/aclements/go-perf/scale\"\n)\n\ntype TicksFormat struct {\n\ttickLen, minorTickLen, textSep float64\n\ttickColor, labelColor color.Color\n\tlabelFormat string\n}\n\nfunc (f *TicksFormat) HTicks(svg *SVG, scale scale.Interface, x scale.OutputScale, y float64) {\n\tx.Crop()\n\n\tmajor, minor := scale.Ticks(5)\n\n\t// Draw ticks\n\tif f.tickColor == nil {\n\t\tsvg.SetStroke(color.Black)\n\t} else {\n\t\tsvg.SetStroke(f.tickColor)\n\t}\n\tsvg.NewPath()\n\tfor _, sx := range major {\n\t\tif x, ok := x.Of(scale.Of(sx)); ok {\n\t\t\tsvg.MoveTo(x, y)\n\t\t\tsvg.LineToRel(0, -f.tickLen)\n\t\t}\n\t}\n\tfor _, sx := range minor {\n\t\tif x, ok := x.Of(scale.Of(sx)); ok {\n\t\t\tsvg.MoveTo(x, y)\n\t\t\tsvg.LineToRel(0, -f.minorTickLen)\n\t\t}\n\t}\n\tsvg.Stroke()\n\tsvg.SetStroke(nil)\n\n\t// Draw labels\n\tlOpts := TextOpts{Anchor: AnchorMiddle}\n\tif f.labelFormat != \"\" {\n\t\tif f.labelColor == nil {\n\t\t\tsvg.SetFill(color.Black)\n\t\t} else {\n\t\t\tsvg.SetFill(f.labelColor)\n\t\t}\n\t\tfor _, sx := range major {\n\t\t\tif x, ok := x.Of(scale.Of(sx)); ok {\n\t\t\t\tl := fmt.Sprintf(f.labelFormat, sx)\n\t\t\t\tsvg.Text(x, y-f.tickLen-f.textSep, lOpts, l)\n\t\t\t}\n\t\t}\n\t\tsvg.SetFill(nil)\n\t}\n}\n" }, { "path": "cmd/memheat/main.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport (\n\t\"bufio\"\n\t\"debug/dwarf\"\n\t\"flag\"\n\t\"fmt\"\n\t\"image/color\"\n\t\"log\"\n\t\"os\"\n\t\"path\"\n\t\"sort\"\n\n\t\"github.com/aclements/go-perf/perffile\"\n\t\"github.com/aclements/go-perf/perfsession\"\n\t\"github.com/aclements/go-perf/scale\"\n)\n\ntype lineStat struct {\n\tip uint64\n\ttotalWeight uint64\n\tweights []uint64\n\n\tfn string\n\tsrc *dwarf.LineEntry\n\n\tyCoord float64\n\thistogram []int\n}\n\nfunc main() {\n\tvar (\n\t\tflagInput = flag.String(\"i\", \"perf.data\", \"input perf.data file\")\n\t\tflagLimit = flag.Int(\"limit\", 30, \"output top N functions\")\n\t)\n\tflag.Parse()\n\tif flag.NArg() > 0 {\n\t\tflag.Usage()\n\t\tos.Exit(1)\n\t}\n\n\tf, err := perffile.Open(*flagInput)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer f.Close()\n\n\ts := perfsession.New(f)\n\n\t// Collect samples by IP (TODO: by (comm, ip) or something)\n\tipToInfo := map[uint64]*lineStat{}\n\trs := f.Records(perffile.RecordsCausalOrder)\n\tfor rs.Next() {\n\t\tr := rs.Record\n\t\ts.Update(r)\n\n\t\tswitch r := r.(type) {\n\t\tcase *perffile.RecordSample:\n\t\t\tmmap := s.LookupPID(r.PID).LookupMmap(r.IP)\n\t\t\tif mmap == nil {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tline, ok := ipToInfo[r.IP]\n\t\t\tif !ok {\n\t\t\t\tvar symb perfsession.Symbolic\n\t\t\t\tif !perfsession.Symbolize(s, mmap, r.IP, &symb) {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tline = &lineStat{\n\t\t\t\t\tip: r.IP,\n\t\t\t\t\tfn: symb.FuncName,\n\t\t\t\t\tsrc: &symb.Line,\n\t\t\t\t}\n\t\t\t\tipToInfo[r.IP] = line\n\t\t\t}\n\t\t\tweight := r.Weight\n\t\t\tif weight == 0 {\n\t\t\t\tweight = uint64(r.Weights.Var1)\n\t\t\t}\n\t\t\tline.weights = append(line.weights, weight)\n\t\t\tline.totalWeight += weight\n\t\t}\n\t}\n\n\t// Compute total function weight\n\tfnWeight := map[string]uint64{}\n\tfor _, ls := range ipToInfo {\n\t\tfnWeight[ls.fn] += ls.totalWeight\n\t}\n\n\t// Sort stats by function weight, line number\n\tstats := make([]*lineStat, 0, len(ipToInfo))\n\tfor _, ls := range ipToInfo {\n\t\tstats = append(stats, ls)\n\t}\n\tsort.Sort(lineStatSorter{stats, fnWeight})\n\n\t// Limit to the top N functions\n\tif *flagLimit > 0 {\n\t\tstats = limitFuncs(stats, *flagLimit)\n\t}\n\n\t// Find max weight\n\tmaxWeight := uint64(0)\n\tfor _, stat := range stats {\n\t\tfor _, w := range stat.weights {\n\t\t\tif w > maxWeight {\n\t\t\t\tmaxWeight = w\n\t\t\t}\n\t\t}\n\t}\n\twscale := scale.NewPower([]float64{0, float64(maxWeight)}, 1/2.0)\n\n\t// Compute histograms and find max bar height\n\tconst buckets = 50\n\tlscale := scale.NewLog([]float64{1, float64(maxWeight + 1)}, 10)\n\tlscale.Nice(5)\n\tmaxHeight := 0\n\tfor _, stat := range stats {\n\t\tstat.histogram = make([]int, buckets)\n\t\tfor _, w := range stat.weights {\n\t\t\tbucket := int(lscale.Of(float64(w)) * buckets)\n\t\t\tstat.histogram[bucket] += int(w)\n\t\t}\n\t\tfor _, height := range stat.histogram {\n\t\t\tif height > maxHeight {\n\t\t\t\tmaxHeight = height\n\t\t\t}\n\t\t}\n\t}\n\n\t// Assign Y coordinates\n\tconst (\n\t\tmarginTop = 45\n\t\tcellHeight = 10\n\t\tcellWidth = 10\n\t\tfnGap = 10\n\t\tlineLabelWidth = 30\n\t\tgroupWidth = 20\n\t\tgroupGap = 5\n\n\t\tmarginLeft = groupWidth*2 + groupGap\n\t\tmarginRight = 300\n\n\t\tsourceLeft = marginLeft + buckets*cellWidth\n\t)\n\ty := marginTop\n\t// lastLine := -1\n\tfor i, stat := range stats {\n\t\tif i != 0 && (stat.fn != stats[i-1].fn || stat.src.File.Name != stats[i-1].src.File.Name) {\n\t\t\ty += fnGap\n\t\t\t// lastLine = -1\n\t\t}\n\t\t// if lastLine != -1 {\n\t\t// \ty += cellHeight * (stat.src.Line - lastLine)\n\t\t// }\n\t\tstat.yCoord = float64(y)\n\t\t// lastLine = stat.src.Line\n\t\ty += cellHeight\n\t}\n\n\t// Emit SVG\n\tsvg := NewSVG(os.Stdout, sourceLeft+marginRight, y)\n\n\tvar ticks = TicksFormat{\n\t\ttickLen: 5,\n\t\tminorTickLen: 3,\n\t\ttextSep: 5,\n\t\tlabelFormat: \"%g\",\n\t}\n\n\t// TODO: Show command line and hostname\n\n\t{\n\t\tlOpts := TextOpts{Anchor: AnchorMiddle}\n\t\tsvg.SetFill(color.Black)\n\t\ty := float64(marginTop - ticks.tickLen - ticks.textSep)\n\t\tsvg.Text(marginLeft+cellWidth*buckets/2, y-20, lOpts, \"memory load latency (cycles)\")\n\t\tsvg.SetFill(nil)\n\t}\n\n\t// TODO: Draw color key\n\n\t// Label lines\n\tsvg.NewPath()\n\tlastLineY := -1.0\n\tfor _, idxs := range sections(len(stats), func(i int) bool {\n\t\treturn stats[i].src.Line != stats[i-1].src.Line\n\t}) {\n\t\tfirst, last := stats[idxs[0]], stats[idxs[1]-1]\n\t\ttop := first.yCoord\n\t\tbot := last.yCoord + cellHeight\n\n\t\tif lastLineY != top {\n\t\t\tsvg.MoveTo(sourceLeft, top)\n\t\t\tsvg.LineToRel(ticks.tickLen, 0)\n\t\t}\n\n\t\tsvg.MoveTo(sourceLeft, bot)\n\t\tsvg.LineToRel(ticks.tickLen, 0)\n\t\tlastLineY = bot\n\n\t\tlOpts := TextOpts{Anchor: AnchorStart, Baseline: BaselineMiddle, FontSize: 10}\n\t\tsvg.Text(sourceLeft+ticks.tickLen, (top+bot)/2, lOpts, fmt.Sprintf(\"%d\", first.src.Line))\n\n\t\tsvg.Text(sourceLeft+lineLabelWidth, (top+bot)/2, lOpts, getLine(first.src.File.Name, first.src.Line))\n\t}\n\tsvg.SetStroke(color.Black)\n\tsvg.Stroke()\n\tsvg.SetStroke(nil)\n\n\tgroupX := float64(marginLeft)\n\n\t// Label function groups\n\tfor _, idxs := range sections(len(stats), func(i int) bool {\n\t\treturn stats[i].fn != stats[i-1].fn\n\t}) {\n\t\tfirst, last := stats[idxs[0]], stats[idxs[1]-1]\n\t\ttop := first.yCoord\n\t\tbot := last.yCoord + cellHeight\n\n\t\t// Ticks at the top of each function\n\t\tticks.HTicks(svg, lscale, scale.NewOutputScale(marginLeft, marginLeft+cellWidth*buckets), top)\n\t\tticks.labelFormat = \"\"\n\n\t\t// Function label\n\t\tlOpts := TextOpts{Anchor: AnchorMiddle, Rotate: -90}\n\t\tsvg.SetFill(color.Gray{192})\n\t\tsvg.Rect(groupX-groupWidth, top, groupWidth, bot-top).FillPreserve().Clip()\n\t\tsvg.SetFill(color.Black)\n\t\tsvg.Text(groupX-5, (top+bot)/2, lOpts, first.fn)\n\t\tsvg.ResetClip()\n\t}\n\tgroupX -= groupWidth + groupGap\n\n\t// Label file name groups\n\tfor _, idxs := range sections(len(stats), func(i int) bool {\n\t\treturn stats[i].src.File.Name != stats[i-1].src.File.Name\n\t}) {\n\t\tlOpts := TextOpts{Anchor: AnchorMiddle, Rotate: -90}\n\t\tsvg.SetFill(color.Gray{192})\n\t\ttop := stats[idxs[0]].yCoord\n\t\tbot := stats[idxs[1]-1].yCoord + cellHeight\n\t\tsvg.Rect(groupX-groupWidth, top, groupWidth, bot-top).FillPreserve().Clip()\n\t\tsvg.SetFill(color.Black)\n\t\tfileName := path.Base(stats[idxs[0]].src.File.Name)\n\t\tsvg.Text(groupX-5, (top+bot)/2, lOpts, fileName)\n\t\tsvg.ResetClip()\n\t}\n\tgroupX -= groupWidth + groupGap\n\n\t// Draw heat map\n\tfor _, stat := range stats {\n\t\tfor x, height := range stat.histogram {\n\t\t\tif height == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tshade := wscale.Of(float64(height))\n\t\t\tsvg.SetFill(color.NRGBA{255, 0, 0, uint8(255 * shade)})\n\t\t\tsvg.Rect(float64(marginLeft+x*cellWidth), stat.yCoord,\n\t\t\t\tcellWidth, cellHeight).Fill()\n\t\t}\n\n\t\t// Tooltip for raw IP\n\t\tsvg.Rect(marginLeft, stat.yCoord, cellWidth*buckets, cellHeight).TooltipHighlight(fmt.Sprintf(\"IP: %#x\", stat.ip))\n\t}\n\tsvg.SetFill(nil)\n\tsvg.Done()\n}\n\ntype lineStatSorter struct {\n\tlines []*lineStat\n\tfnWeight map[string]uint64\n}\n\nfunc (s lineStatSorter) Len() int {\n\treturn len(s.lines)\n}\n\nfunc (s lineStatSorter) Swap(i, j int) {\n\ts.lines[i], s.lines[j] = s.lines[j], s.lines[i]\n}\n\nfunc (s lineStatSorter) Less(i, j int) bool {\n\t// Sort by function weight first\n\tfni, fnj := s.lines[i].fn, s.lines[j].fn\n\tif s.fnWeight[fni] != s.fnWeight[fnj] {\n\t\treturn s.fnWeight[fni] > s.fnWeight[fnj]\n\t}\n\n\t// Sort by file:line\n\tli, lj := s.lines[i].src, s.lines[j].src\n\tif li != nil || lj != nil {\n\t\tif li == nil || lj == nil {\n\t\t\t// Unknown line info comes first\n\t\t\treturn li == nil\n\t\t}\n\t\tif li.File.Name != lj.File.Name {\n\t\t\treturn li.File.Name < lj.File.Name\n\t\t}\n\t\tif li.Line != lj.Line {\n\t\t\treturn li.Line < lj.Line\n\t\t}\n\t}\n\n\t// Finally, sort by IP\n\treturn s.lines[i].ip < s.lines[j].ip\n}\n\nfunc limitFuncs(stats []*lineStat, limit int) []*lineStat {\n\tseen := 0\n\tfor i, stat := range stats {\n\t\tif i == 0 || stat.fn != stats[i-1].fn {\n\t\t\tif seen == limit {\n\t\t\t\treturn stats[:i]\n\t\t\t}\n\t\t\tseen++\n\t\t}\n\t}\n\treturn stats\n}\n\nfunc sections(count int, newGroup func(int) bool) [][2]int {\n\tsections := make([][2]int, 0)\n\tif count == 0 {\n\t\treturn sections\n\t}\n\n\tstart := 0\n\tfor i := 1; i < count; i++ {\n\t\tif newGroup(i) {\n\t\t\tsections = append(sections, [2]int{start, i})\n\t\t\tstart = i\n\t\t}\n\t}\n\tsections = append(sections, [2]int{start, count})\n\treturn sections\n}\n\nfunc getLine(path string, line int) string {\n\t// TODO: Cache parsing\n\n\tfile, err := os.Open(path)\n\tif err != nil {\n\t\tlog.Println(err)\n\t\treturn \"\"\n\t}\n\tdefer file.Close()\n\n\tscanner := bufio.NewScanner(file)\n\tfor i := 0; i < line && scanner.Scan(); i++ {\n\t\t// Do nothing\n\t}\n\n\tif err := scanner.Err(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n\treturn scanner.Text()\n}\n" }, { "path": "cmd/memheat/svg.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport (\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"image/color\"\n\t\"io\"\n\t\"strconv\"\n\t\"strings\"\n)\n\ntype SVG struct {\n\tw io.Writer\n\terr error\n\n\tfill, stroke string\n\tlineWidth string\n\tclipPath string\n\n\tid int\n\n\tpath []string\n}\n\nfunc NewSVG(w io.Writer, width, height int) *SVG {\n\ts := &SVG{w: w}\n\ts.fprintf(\"\\n\", width, height)\n\ts.fprintf(\"\\n\")\n\ts.NewPath()\n\treturn s\n}\n\ntype svglen float64\n\nfunc (v svglen) String() string {\n\treturn strconv.FormatFloat(float64(v), 'f', -1, 32)\n}\n\nfunc colorToCSS(c color.Color) string {\n\tcc := color.NRGBAModel.Convert(c).(color.NRGBA)\n\tif cc.A == 0xff {\n\t\treturn fmt.Sprintf(\"rgb(%d,%d,%d)\", cc.R, cc.G, cc.B)\n\t}\n\treturn fmt.Sprintf(\"rgba(%d,%d,%d,%f)\", cc.R, cc.G, cc.B, float64(cc.A)/0xff)\n}\n\nfunc (s *SVG) fprintf(format string, a ...interface{}) {\n\tif s.err != nil {\n\t\treturn\n\t}\n\t_, s.err = fmt.Fprintf(s.w, format, a...)\n}\n\nfunc (s *SVG) SetFill(c color.Color) {\n\tif c == nil {\n\t\ts.fill = \"\"\n\t} else {\n\t\ts.fill = \"fill:\" + colorToCSS(c)\n\t}\n}\n\nfunc (s *SVG) SetStroke(c color.Color) {\n\tif c == nil {\n\t\ts.stroke = \"\"\n\t} else {\n\t\ts.stroke = \"stroke:\" + colorToCSS(c)\n\t}\n}\n\nfunc (s *SVG) SetLineWidth(lw float64) {\n\ts.lineWidth = fmt.Sprintf(\"stroke-width:%v\", svglen(lw))\n}\n\nfunc (s *SVG) style(parts ...string) string {\n\tval, sep := \"\", \"\"\n\tfor _, part := range parts {\n\t\tif part != \"\" {\n\t\t\tval += sep + part\n\t\t\tsep = \";\"\n\t\t}\n\t}\n\tif val != \"\" {\n\t\treturn \" style=\\\"\" + val + \"\\\"\"\n\t} else {\n\t\treturn \"\"\n\t}\n}\n\nfunc (s *SVG) NewPath() *SVG {\n\ts.path = []string{}\n\treturn s\n}\n\nfunc (s *SVG) MoveTo(x, y float64) *SVG {\n\ts.path = append(s.path, fmt.Sprintf(\"M%v %v\", svglen(x), svglen(y)))\n\treturn s\n}\n\nfunc (s *SVG) LineToRel(xd, yd float64) *SVG {\n\tvar op string\n\tif xd == 0 {\n\t\top = fmt.Sprintf(\"v%v\", svglen(yd))\n\t} else if yd == 0 {\n\t\top = fmt.Sprintf(\"h%v\", svglen(xd))\n\t} else {\n\t\top = fmt.Sprintf(\"l%v %v\", svglen(xd), svglen(yd))\n\t}\n\ts.path = append(s.path, op)\n\treturn s\n}\n\nfunc (s *SVG) Rect(x, y, w, h float64) *SVG {\n\treturn s.MoveTo(x, y).LineToRel(w, 0).LineToRel(0, h).LineToRel(-w, 0).ClosePath()\n}\n\nfunc (s *SVG) ClosePath() *SVG {\n\ts.path = append(s.path, \"z\")\n\treturn s\n}\n\nfunc (s *SVG) pathData() string {\n\treturn strings.Join(s.path, \"\")\n}\n\nfunc (s *SVG) Stroke() *SVG {\n\ts.fprintf(\"\\n\", s.pathData(), s.style(s.stroke, s.lineWidth, s.clipPath))\n\treturn s.NewPath()\n}\n\nfunc (s *SVG) FillPreserve() *SVG {\n\ts.fprintf(\"\\n\", s.pathData(), s.style(s.fill, s.clipPath))\n\treturn s\n}\n\nfunc (s *SVG) Fill() *SVG {\n\treturn s.FillPreserve().NewPath()\n}\n\nfunc (s *SVG) FillStroke() *SVG {\n\ts.fprintf(\"\\n\", s.pathData(), s.style(s.fill, s.stroke, s.lineWidth, s.clipPath))\n\treturn s.NewPath()\n}\n\nfunc (s *SVG) Clip() *SVG {\n\ts.fprintf(\"\", s.id, s.pathData())\n\ts.clipPath = fmt.Sprintf(\"clip-path:url(#i%d)\", s.id)\n\ts.id++\n\treturn s.NewPath()\n}\n\nfunc (s *SVG) ResetClip() *SVG {\n\ts.clipPath = \"\"\n\treturn s\n}\n\nfunc (s *SVG) Tooltip(text string) *SVG {\n\ts.fprintf(\"\", s.pathData())\n\tif s.err == nil {\n\t\ts.err = xml.EscapeText(s.w, []byte(text))\n\t}\n\ts.fprintf(\"\\n\")\n\treturn s.NewPath()\n}\n\nfunc (s *SVG) TooltipHighlight(text string) *SVG {\n\ts.fprintf(\"\", s.pathData())\n\tif s.err == nil {\n\t\ts.err = xml.EscapeText(s.w, []byte(text))\n\t}\n\ts.fprintf(\"\\n\")\n\treturn s.NewPath()\n}\n\ntype Anchor int\n\nconst (\n\tAnchorStart Anchor = iota\n\tAnchorMiddle\n\tAnchorEnd\n)\n\ntype Baseline int\n\nconst (\n\tBaselineAuto Baseline = iota\n\tBaselineBaseline\n\tBaselineMiddle\n)\n\ntype TextOpts struct {\n\tAnchor Anchor\n\tBaseline Baseline\n\tRotate float64\n\tFontSize float64\n}\n\nfunc (s *SVG) Text(x, y float64, opts TextOpts, text string) {\n\tastr := map[Anchor]string{\n\t\tAnchorStart: \"\",\n\t\tAnchorMiddle: \" text-anchor=\\\"middle\\\"\",\n\t\tAnchorEnd: \" text-anchor=\\\"end\\\"\",\n\t}[opts.Anchor]\n\tbstr := map[Baseline]string{\n\t\tBaselineAuto: \"\",\n\t\tBaselineBaseline: \" dominant-baseline=\\\"baseline\\\"\",\n\t\tBaselineMiddle: \" dominant-baseline=\\\"middle\\\"\",\n\t}[opts.Baseline]\n\trstr := \"\"\n\tif opts.Rotate != 0 {\n\t\trstr = fmt.Sprintf(\" transform=\\\"rotate(%v,%v,%v)\\\"\", svglen(opts.Rotate), svglen(x), svglen(y))\n\t}\n\tfstr := \"\"\n\tif opts.FontSize != 0 {\n\t\tfstr = fmt.Sprintf(\" font-size=\\\"%v\\\"\", svglen(opts.FontSize))\n\t}\n\tclose := \"\"\n\tif s.clipPath != \"\" {\n\t\t// Don't apply rotation to clip path\n\t\ts.fprintf(\"\", s.style(s.clipPath))\n\t\tclose = \"\"\n\t}\n\ts.fprintf(\"\", svglen(x), svglen(y), astr, bstr, rstr, fstr, s.style(s.fill))\n\tif s.err == nil {\n\t\ts.err = xml.EscapeText(s.w, []byte(text))\n\t}\n\ts.fprintf(\"%s\\n\", close)\n}\n\nfunc (s *SVG) Done() error {\n\ts.fprintf(\"\")\n\treturn s.err\n}\n" }, { "path": "cmd/memlat/database.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\n\t\"github.com/aclements/go-perf/perffile\"\n\t\"github.com/aclements/go-perf/perfsession\"\n)\n\ntype database struct {\n\t// procs maps from PID to information and records for a\n\t// process.\n\tprocs map[int]*proc\n\n\t// dataSrcs maps dataSrcIDs to full DataSrc information.\n\t// There's a lot of information in a DataSrc, but in practice\n\t// a given architecture will generate a small subset of the\n\t// possibilities. Hence, rather than storing a whole DataSrc\n\t// in every record, we canonicalize it to a small identifier.\n\tdataSrcs []perffile.DataSrc\n\n\t// maxLatency is the maximum latency value across all records\n\t// in this database.\n\tmaxLatency uint32\n\n\t// metadata records metadata fields from the profile.\n\tmetadata Metadata\n}\n\ntype proc struct {\n\tpid int\n\tcomm string\n\trecords []record\n\tipInfo map[uint64]ipInfo\n}\n\ntype record struct {\n\tip uint64\n\taddress uint64\n\tlatency uint32\n\tdataSrc dataSrcID\n}\n\ntype ipInfo struct {\n\tfuncName string\n\tfileName string\n\tline int\n}\n\n// dataSrcID is a small integer identifying a perffile.DataSrc.\ntype dataSrcID uint32\n\ntype Metadata struct {\n\tHostname string\n\tArch string\n\tCPUDesc string `json:\"CPU\"`\n\tCmdLine []string `json:\"Command line\"`\n}\n\n// parsePerf parses a perf.data profile into a database.\nfunc parsePerf(fileName string) *database {\n\tf, err := perffile.Open(fileName)\n\tif os.IsNotExist(err) && fileName == \"perf.data\" {\n\t\t// Give a friendly error for first-time users.\n\t\tfmt.Fprintf(os.Stderr, \"%s.\\nTo record a profile, use\\n perf mem record \\nor specify an alternate profile path with -i.\\n\", err)\n\t\tos.Exit(1)\n\t} else if err != nil {\n\t\tfmt.Fprintf(os.Stderr, \"error loading profile: %s\\n\", err)\n\t\tos.Exit(1)\n\t}\n\tdefer f.Close()\n\n\tdb := &database{\n\t\tprocs: make(map[int]*proc),\n\t}\n\tdb.metadata.Hostname = f.Meta.Hostname\n\tdb.metadata.Arch = f.Meta.Arch\n\tdb.metadata.CPUDesc = f.Meta.CPUDesc\n\tdb.metadata.CmdLine = f.Meta.CmdLine\n\n\tdataSrc2ID := make(map[perffile.DataSrc]dataSrcID)\n\ts := perfsession.New(f)\n\n\tnumSamples := 0\n\tdroppedMmaps := 0\n\tdroppedSymbols := 0\n\n\tconst requiredFormat = perffile.SampleFormatIP | perffile.SampleFormatAddr | perffile.SampleFormatDataSrc\n\n\trs := f.Records(perffile.RecordsCausalOrder)\n\tfor rs.Next() {\n\t\tr := rs.Record\n\t\ts.Update(r)\n\n\t\tswitch r := r.(type) {\n\t\tcase *perffile.RecordComm:\n\t\t\t// Comm events usually happen after the first\n\t\t\t// few samples from this PID.\n\t\t\tp := db.procs[r.PID]\n\t\t\tif p != nil {\n\t\t\t\tp.comm = r.Comm\n\t\t\t}\n\n\t\tcase *perffile.RecordSample:\n\t\t\tif r.Format&requiredFormat != requiredFormat {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\t// Either Weight or WeightStruct is required.\n\t\t\tif r.Format&(perffile.SampleFormatWeight|perffile.SampleFormatWeightStruct) == 0 {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tnumSamples++\n\n\t\t\tpidInfo := s.LookupPID(r.PID)\n\t\t\tmmap := pidInfo.LookupMmap(r.IP)\n\t\t\tif mmap == nil {\n\t\t\t\tdroppedMmaps++\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\t// Find proc for r.PID.\n\t\t\tp, ok := db.procs[r.PID]\n\t\t\tif !ok {\n\t\t\t\tp = &proc{\n\t\t\t\t\tpid: r.PID,\n\t\t\t\t\tcomm: pidInfo.Comm,\n\t\t\t\t\tipInfo: make(map[uint64]ipInfo),\n\t\t\t\t}\n\t\t\t\tdb.procs[r.PID] = p\n\t\t\t}\n\n\t\t\t// Canonicalize data source.\n\t\t\tdsID, ok := dataSrc2ID[r.DataSrc]\n\t\t\tif !ok {\n\t\t\t\tdsID = dataSrcID(len(db.dataSrcs))\n\t\t\t\tdataSrc2ID[r.DataSrc] = dsID\n\t\t\t\tdb.dataSrcs = append(db.dataSrcs, r.DataSrc)\n\t\t\t}\n\n\t\t\t// Create the record.\n\t\t\tp.records = append(p.records, record{\n\t\t\t\tip: r.IP,\n\t\t\t\taddress: r.Addr,\n\t\t\t\tlatency: uint32(r.Weight),\n\t\t\t\tdataSrc: dsID,\n\t\t\t})\n\n\t\t\t// Update database stats.\n\t\t\tif uint32(r.Weight) > db.maxLatency {\n\t\t\t\tdb.maxLatency = uint32(r.Weight)\n\t\t\t}\n\n\t\t\t// Symbolize IP.\n\t\t\tif _, ok := p.ipInfo[r.IP]; !ok {\n\t\t\t\t// TODO: Intern strings\n\t\t\t\tvar symb perfsession.Symbolic\n\t\t\t\tif !perfsession.Symbolize(s, mmap, r.IP, &symb) {\n\t\t\t\t\tdroppedSymbols++\n\t\t\t\t}\n\t\t\t\tif symb.FuncName == \"\" {\n\t\t\t\t\tsymb.FuncName = \"[unknown]\"\n\t\t\t\t}\n\t\t\t\tfileName := \"[unknown]\"\n\t\t\t\tif symb.Line.File != nil && symb.Line.File.Name != \"\" {\n\t\t\t\t\tfileName = symb.Line.File.Name\n\t\t\t\t}\n\t\t\t\tp.ipInfo[r.IP] = ipInfo{\n\t\t\t\t\tfuncName: symb.FuncName,\n\t\t\t\t\tfileName: fileName,\n\t\t\t\t\tline: symb.Line.Line,\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif numSamples == 0 {\n\t\tfmt.Printf(\"no memory latency samples in %s (did you use \\\"perf mem record\\\"?)\\n\", fileName)\n\t\tos.Exit(1)\n\t}\n\tif droppedMmaps > 0 {\n\t\tfmt.Printf(\"warning: %d sample IPs (%d%%) occurred in unmapped memory regions\\n\", droppedMmaps, droppedMmaps*100/numSamples)\n\t}\n\tif droppedSymbols > 0 {\n\t\tfmt.Printf(\"warning: failed to symbolize %d samples (%d%%)\\n\", droppedSymbols, droppedSymbols*100/numSamples)\n\t}\n\n\treturn db\n}\n\n// filter specifies a set of field values to filter records on. The\n// zero value of each field means not to filter on that field.\ntype filter struct {\n\tpid int\n\tfuncName string\n\tfileName string\n\tline int // Requires fileName.\n\taddress uint64\n\tdataSrc perffile.DataSrc\n}\n\n// filter invokes cb for every record matching f.\nfunc (db *database) filter(f *filter, cb func(*proc, *record)) {\n\tdsFilter := f.dataSrc != perffile.DataSrc{}\n\tfilterProc := func(proc *proc) {\n\t\tvar ds perffile.DataSrc\n\n\t\t// TODO: Consider creating indexes for some or all of\n\t\t// these. Then just do a list merge of the record\n\t\t// indexes.\n\t\tfor i := range proc.records {\n\t\t\t// Avoid heap-allocating for passing rec to cb.\n\t\t\trec := &proc.records[i]\n\t\t\tif f.address != 0 && f.address != rec.address {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tipi := proc.ipInfo[rec.ip]\n\t\t\tif f.funcName != \"\" && f.funcName != ipi.funcName {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.fileName != \"\" && f.fileName != ipi.fileName {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.line != 0 && f.line != ipi.line {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif !dsFilter {\n\t\t\t\t// Short-circuit dataSrc checking.\n\t\t\t\tgoto good\n\t\t\t}\n\n\t\t\tds = db.dataSrcs[rec.dataSrc]\n\t\t\tif f.dataSrc.Op != 0 && f.dataSrc.Op != ds.Op {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.dataSrc.Level != 0 && (f.dataSrc.Level != ds.Level || f.dataSrc.Miss != ds.Miss) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.dataSrc.Snoop != 0 && f.dataSrc.Snoop != ds.Snoop {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.dataSrc.Locked != 0 && f.dataSrc.Locked != ds.Locked {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif f.dataSrc.TLB != 0 && f.dataSrc.TLB != ds.TLB {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\tgood:\n\t\t\tcb(proc, rec)\n\t\t}\n\t}\n\n\tif f.pid == 0 {\n\t\tfor _, proc := range db.procs {\n\t\t\tfilterProc(proc)\n\t\t}\n\t} else {\n\t\tproc := db.procs[f.pid]\n\t\tif proc != nil {\n\t\t\tfilterProc(proc)\n\t\t}\n\t}\n}\n" }, { "path": "cmd/memlat/main.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Command memlat is a web-based browser for memory load latency profiles.\n//\n// Memory stalls and conflicts are increasingly important for software\n// performance. Memory load latency profiles can give deep insights in\n// to these problems; however, the richness of these profiles makes\n// them difficult to interpret using traditional profiling tools and\n// techniques.\n//\n// memlat is a profile browser built for understanding and\n// interpreting memory load latency profiles. The central concept is a\n// \"latency distribution\", which is a statistical distribution of the\n// number of cycles spent in memory load or store operations. For\n// example, if there are 10 loads that take 10 cycles and 2 loads that\n// takes 100 cycles, the latency distribution consists of a 100 cycle\n// spike at 10 cycles and a 200 cycle spike at 100 cycles. The total\n// weight of this distribution accounts for the total cycles spent\n// waiting on memory loads or stores.\n//\n// memlat presents a profile as a multidimensional latency\n// distribution and provides a tools for viewing and filtering this\n// distribution on each dimension, such as by function, by source\n// line, by data source (L1 hit, TLB miss, etc), by address, etc. Each\n// tab in the UI browses the profile on a different dimension and\n// clicking on a row filters the profile down to just that function,\n// source line, etc. An active filters can be removed by clicking on\n// it in the filter bar at the top.\n//\n// For example, suppose we want to understand the primary source of\n// memory latency in a profile. Select the \"By source line\" tab and\n// click on the top row to filter to the source line that contributed\n// the most total memory latency. You can select the \"Source\n// annotation\" tab to see the text of this line. To drill down to a\n// particular memory address, select the \"By address\" tab to see the\n// memory addresses touched by this source line. Click the top one to\n// further filter to the hottest address touched by this source line.\n// Then, click the source line filter in the filter bar at the top to\n// remove the source line filter. Finally, select the \"Source\n// annotation\" tab to see the other source code lines that touch this\n// hot address.\n//\n// Note that the latency reported by the hardware is the time from\n// instruction issue to retire. Hence, a \"fast load\" (say, an L1 hit)\n// that happens immediately after a \"slow load\" (say, an LLC miss),\n// will have a high reported latency because it has to wait for the\n// slow load, even though the actual memory operation for the fast\n// load is fast.\n//\n// Usage\n//\n// To download and install memlat, run\n//\n// go get github.com/aclements/go-perf/cmd/memlat\n//\n// memlat works with the memory load latency profiles recorded by the\n// Linux perf tool. This requires hardware support that has been\n// available since Intel Nehalem. To record a memory latency profile,\n// use perf's \"mem\" subcommand. For example,\n//\n// perf mem record # Record a memory profile for command\n// perf mem record -a # Record a system-wide memory profile\n//\n// This will write the profile to a file called perf.data. Then,\n// simply start memlat with\n//\n// memlat\n//\n// memlat will parse and symbolize the profile and start a web server\n// listening by default on localhost;8001.\npackage main\n\nimport (\n\t\"bufio\"\n\t\"embed\"\n\t\"encoding/json\"\n\t\"flag\"\n\t\"fmt\"\n\t\"io/fs\"\n\t\"log\"\n\t\"net/http\"\n\t\"net/url\"\n\t\"os\"\n\t\"sort\"\n\t\"strconv\"\n\n\t\"github.com/aclements/go-moremath/scale\"\n\t\"github.com/aclements/go-moremath/vec\"\n\t\"github.com/aclements/go-perf/perffile\"\n)\n\n//go:embed static\nvar staticFiles embed.FS\n\n// TODO: Open a browser automatically. Maybe bind to any address in\n// this mode.\n\n// TODO: Does this correctly handle the dynamic sampling rate that\n// perf mem record uses by default?\n\nfunc main() {\n\tvar (\n\t\tflagInput = flag.String(\"i\", \"perf.data\", \"read memory latency profile from `file`\")\n\t\tflagHttp = flag.String(\"http\", \"localhost:8001\", \"serve HTTP on `address`\")\n\t\tflagDocRoot = flag.String(\"docroot\", \"\", \"alternate `path` to static web resources\")\n\t)\n\tflag.Parse()\n\tif flag.NArg() > 0 {\n\t\tflag.Usage()\n\t\tos.Exit(1)\n\t}\n\n\tfmt.Fprintln(os.Stderr, \"loading profile...\")\n\tdb := parsePerf(*flagInput)\n\tfmt.Fprintln(os.Stderr, \"profile loaded\")\n\n\tmux := http.NewServeMux()\n\tif *flagDocRoot == \"\" {\n\t\t// Use the embedded static assets.\n\t\tsub, _ := fs.Sub(staticFiles, \"static\")\n\t\tmux.Handle(\"/\", http.FileServer(http.FS(sub)))\n\t} else {\n\t\t// Use assets from the file system.\n\t\tmux.Handle(\"/\", http.FileServer(http.Dir(*flagDocRoot)))\n\t}\n\tmux.Handle(\"/h\", &heatMapHandler{db})\n\tmux.Handle(\"/metadata\", &metadataHandler{*flagInput, db.metadata})\n\n\tfmt.Fprintf(os.Stderr, \"serving on %s\\n\", *flagHttp)\n\tif err := http.ListenAndServe(*flagHttp, mux); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n\ntype heatMapHandler struct {\n\tdb *database\n}\n\nfunc (h *heatMapHandler) ServeHTTP(w http.ResponseWriter, req *http.Request) {\n\t// TOOD: Include a signature for this profile in the request\n\t// and mark the response as cacheable.\n\n\t// TODO: Compress the output.\n\n\t// Request includes filter, group by. Response: map from group\n\t// by to histograms.\n\tqs, err := url.ParseQuery(req.URL.RawQuery)\n\tif err != nil {\n\t\thttp.Error(w, err.Error(), http.StatusBadRequest)\n\t\treturn\n\t}\n\tatoi := func(s string) int {\n\t\tx, _ := strconv.Atoi(s)\n\t\treturn x\n\t}\n\tf := filter{\n\t\tpid: atoi(qs.Get(\"pid\")),\n\t\tfuncName: qs.Get(\"funcName\"),\n\t\tfileName: qs.Get(\"fileName\"),\n\t\tline: atoi(qs.Get(\"line\")),\n\t\taddress: uint64(atoi(qs.Get(\"address\"))),\n\t\tdataSrc: perffile.DataSrc{\n\t\t\tOp: perffile.DataSrcOp(atoi(qs.Get(\"op\"))),\n\t\t\tMiss: qs.Get(\"miss\") == \"miss\",\n\t\t\tLevel: perffile.DataSrcLevel(atoi(qs.Get(\"level\"))),\n\t\t\tSnoop: perffile.DataSrcSnoop(atoi(qs.Get(\"snoop\"))),\n\t\t\tLocked: perffile.DataSrcLock(atoi(qs.Get(\"locked\"))),\n\t\t\tTLB: perffile.DataSrcTLB(atoi(qs.Get(\"tlb\"))),\n\t\t},\n\t}\n\tgroupBy := qs.Get(\"groupBy\")\n\tlimit := atoi(qs.Get(\"limit\"))\n\n\t// Compute the scale for this histogram set.\n\tconst useLocalScale = false\n\tvar maxLatency uint32 = 1\n\tif useLocalScale {\n\t\th.db.filter(&f, func(p *proc, rec *record) {\n\t\t\tif rec.latency > maxLatency {\n\t\t\t\tmaxLatency = rec.latency\n\t\t\t}\n\t\t})\n\t} else {\n\t\tmaxLatency = h.db.maxLatency\n\t}\n\tscaler, err := scale.NewLog(1, float64(maxLatency), 10)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tscaler.Nice(scale.TickOptions{Max: 6})\n\n\tvar histograms []*latencyHistogram\n\tnewHist := func() *latencyHistogram {\n\t\thist := newLatencyHistogram(&scaler)\n\t\thistograms = append(histograms, hist)\n\t\treturn hist\n\t}\n\n\t// Create aggregation function.\n\tvar agg func(*proc, *record)\n\tswitch groupBy {\n\tdefault:\n\t\thttp.Error(w, fmt.Sprintf(\"unknown groupby %q\", groupBy), http.StatusBadRequest)\n\t\treturn\n\n\tcase \"all\":\n\t\thist := newHist()\n\t\tagg = func(p *proc, r *record) {\n\t\t\thist.update(r)\n\n\t\t}\n\n\tcase \"pid\":\n\t\tgroups := make(map[*proc]*latencyHistogram)\n\t\tagg = func(p *proc, r *record) {\n\t\t\thist, ok := groups[p]\n\t\t\tif !ok {\n\t\t\t\thist = newHist()\n\t\t\t\thist.PID = p.pid\n\t\t\t\thist.Comm = p.comm\n\t\t\t\tgroups[p] = hist\n\t\t\t}\n\t\t\thist.update(r)\n\t\t}\n\n\tcase \"funcName\":\n\t\tgroups := make(map[string]*latencyHistogram)\n\t\tagg = func(p *proc, r *record) {\n\t\t\tfuncName := p.ipInfo[r.ip].funcName\n\t\t\thist, ok := groups[funcName]\n\t\t\tif !ok {\n\t\t\t\thist = newHist()\n\t\t\t\thist.FuncName = funcName\n\t\t\t\tgroups[funcName] = hist\n\t\t\t}\n\t\t\thist.update(r)\n\t\t}\n\n\tcase \"annotation\", \"line\":\n\t\tgroups := make(map[ipInfo]*latencyHistogram)\n\t\tagg = func(p *proc, r *record) {\n\t\t\tipInfo := p.ipInfo[r.ip]\n\t\t\thist, ok := groups[ipInfo]\n\t\t\tif !ok {\n\t\t\t\thist = newHist()\n\t\t\t\thist.FileName = ipInfo.fileName\n\t\t\t\thist.Line = ipInfo.line\n\t\t\t\tgroups[ipInfo] = hist\n\t\t\t}\n\t\t\thist.update(r)\n\t\t}\n\n\tcase \"address\":\n\t\tgroups := make(map[uint64]*latencyHistogram)\n\t\tagg = func(p *proc, r *record) {\n\t\t\thist, ok := groups[r.address]\n\t\t\tif !ok {\n\t\t\t\thist = newHist()\n\t\t\t\thist.Address = r.address\n\t\t\t\tgroups[r.address] = hist\n\t\t\t}\n\t\t\thist.update(r)\n\t\t}\n\n\tcase \"dataSrc\":\n\t\tgroups := make(map[perffile.DataSrc]*latencyHistogram)\n\t\tadd1 := func(r *record, key perffile.DataSrc, label, group string) {\n\t\t\thist, ok := groups[key]\n\t\t\tif !ok {\n\t\t\t\thist = newHist()\n\t\t\t\thist.group = group\n\t\t\t\thist.Op = key.Op\n\t\t\t\thist.Miss = key.Miss\n\t\t\t\thist.Level = key.Level\n\t\t\t\thist.Snoop = key.Snoop\n\t\t\t\thist.Locked = key.Locked\n\t\t\t\thist.TLB = key.TLB\n\t\t\t\thist.DataSrcLabel = label\n\t\t\t\tgroups[key] = hist\n\t\t\t}\n\t\t\thist.update(r)\n\t\t}\n\t\tagg = func(p *proc, r *record) {\n\t\t\tds := h.db.dataSrcs[r.dataSrc]\n\t\t\tif ds.Op != 0 {\n\t\t\t\tadd1(r, perffile.DataSrc{Op: ds.Op}, ds.Op.String(), \"Operation\")\n\t\t\t}\n\t\t\tif ds.Level != 0 {\n\t\t\t\tmiss := \" hit\"\n\t\t\t\tif ds.Miss {\n\t\t\t\t\tmiss = \" miss\"\n\t\t\t\t}\n\t\t\t\tadd1(r, perffile.DataSrc{Miss: ds.Miss, Level: ds.Level}, ds.Level.String()+miss, \"Cache level\")\n\t\t\t}\n\t\t\tif ds.Snoop != 0 {\n\t\t\t\tadd1(r, perffile.DataSrc{Snoop: ds.Snoop}, ds.Snoop.String(), \"Snoop\")\n\t\t\t}\n\t\t\tif ds.Locked != 0 {\n\t\t\t\tadd1(r, perffile.DataSrc{Locked: ds.Locked}, ds.Locked.String()[11:], \"Locked\")\n\t\t\t}\n\t\t\tif ds.TLB != 0 {\n\t\t\t\tadd1(r, perffile.DataSrc{TLB: ds.TLB}, ds.TLB.String(), \"TLB\")\n\t\t\t}\n\t\t}\n\t}\n\n\th.db.filter(&f, agg)\n\n\t// Sort histograms by weight.\n\tsort.Sort(sort.Reverse(weightSorter(histograms)))\n\n\t// Take the top N histograms.\n\tif groupBy == \"dataSrc\" {\n\t\tlimit = 0\n\t}\n\tif limit != 0 && limit < len(histograms) {\n\t\thistograms = histograms[:limit]\n\t}\n\n\t// Special processing for some grouping types.\n\tswitch groupBy {\n\tcase \"dataSrc\":\n\t\t// Add group headers\n\t\tfor i := 0; i < len(histograms); i++ {\n\t\t\tif i == 0 || histograms[i-1].group != histograms[i].group {\n\t\t\t\thistograms = append(histograms, nil)\n\t\t\t\tcopy(histograms[i+1:], histograms[i:])\n\t\t\t\thistograms[i] = &latencyHistogram{\n\t\t\t\t\tText: histograms[i+1].group,\n\t\t\t\t\tIsHeader: true,\n\t\t\t\t}\n\t\t\t\ti++\n\t\t\t}\n\t\t}\n\n\tcase \"annotation\":\n\t\tif len(histograms) == 0 {\n\t\t\tbreak\n\t\t}\n\t\t// TODO: When loading profile, check for out-of-date\n\t\t// source files and warn.\n\n\t\tranges := []sourceRange{}\n\t\thistMap := map[ipInfo]*latencyHistogram{}\n\t\tfor _, hist := range histograms {\n\t\t\tranges = append(ranges, sourceRange{hist.FileName, hist.Line, hist.Line + 1, hist.weight})\n\t\t\thistMap[ipInfo{\"\", hist.FileName, hist.Line}] = hist\n\t\t}\n\t\tranges = expandSourceRanges(ranges, 5)\n\n\t\t// Sort ranges by max weight histogram.\n\t\tsort.Slice(ranges, func(i, j int) bool {\n\t\t\treturn ranges[i].maxWeight > ranges[j].maxWeight\n\t\t})\n\n\t\t// Collect lines from ranges.\n\t\thistograms = []*latencyHistogram{}\n\t\tfor _, r := range ranges {\n\t\t\tlines, r, err := getLines(r)\n\t\t\tif err != nil {\n\t\t\t\tlog.Println(err)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif len(lines) == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// Add a header for this range of source.\n\t\t\theader := newLatencyHistogram(&scaler)\n\t\t\theader.Bins = nil\n\t\t\theader.Text = r.file\n\t\t\theader.IsHeader = true\n\t\t\thistograms = append(histograms, header)\n\n\t\t\tfor i, text := range lines {\n\t\t\t\thist := histMap[ipInfo{\"\", r.file, r.start + i}]\n\t\t\t\tif hist == nil {\n\t\t\t\t\thist = newLatencyHistogram(&scaler)\n\t\t\t\t\thist.FileName = r.file\n\t\t\t\t\thist.Line = r.start + i\n\t\t\t\t\thist.Bins = nil\n\t\t\t\t}\n\t\t\t\thist.Text = text\n\t\t\t\thistograms = append(histograms, hist)\n\t\t\t}\n\t\t}\n\t}\n\n\t// Compute maximum bin size for bin scaling.\n\tmaxBin := 0\n\tfor _, hist := range histograms {\n\t\tmax := hist.max()\n\t\tif max > maxBin {\n\t\t\tmaxBin = max\n\t\t}\n\t}\n\n\t// Construct JSON reply.\n\tmajor, minor := scaler.Ticks(scale.TickOptions{Max: 6})\n\tmajorX, minorX := vec.Map(scaler.Map, major), vec.Map(scaler.Map, minor)\n\terr = json.NewEncoder(w).Encode(struct {\n\t\tHistograms []*latencyHistogram\n\t\tMaxBin int\n\n\t\tMajorTicks, MajorTicksX []float64\n\t\tMinorTicksX []float64\n\t}{histograms, maxBin, major, majorX, minorX})\n\tif err != nil {\n\t\tlog.Print(err)\n\t\thttp.Error(w, err.Error(), http.StatusInternalServerError)\n\t}\n}\n\nconst latencyHistogramBins = 60\n\n// TODO: There's a lot of code for transforming between filters in the\n// query string, latencyHistogram, and the filter struct. Unify these\n// better.\n\ntype latencyHistogram struct {\n\tscale scale.Quantitative\n\tBins []int `json:\",omitempty\"`\n\tweight int\n\tgroup string\n\n\t// Filter specification.\n\tPID int `json:\"pid,omitempty\"`\n\tComm string `json:\"comm,omitempty\"`\n\tFuncName string `json:\"funcName,omitempty\"`\n\tFileName string `json:\"fileName,omitempty\"`\n\tLine int `json:\"line,omitempty\"`\n\tAddress uint64 `json:\"address,omitempty\"`\n\n\t// Data source filter specification.\n\tOp perffile.DataSrcOp `json:\"op,omitempty\"`\n\tMiss bool `json:\"miss,omitempty\"`\n\tLevel perffile.DataSrcLevel `json:\"level,omitempty\"`\n\tSnoop perffile.DataSrcSnoop `json:\"snoop,omitempty\"`\n\tLocked perffile.DataSrcLock `json:\"locked,omitempty\"`\n\tTLB perffile.DataSrcTLB `json:\"tlb,omitempty\"`\n\n\t// Presentation.\n\tText string `json:\"text,omitempty\"`\n\tDataSrcLabel string `json:\"dataSrcLabel,omitempty\"`\n\tIsHeader bool `json:\"isHeader,omitempty\"`\n}\n\nfunc newLatencyHistogram(scale scale.Quantitative) *latencyHistogram {\n\treturn &latencyHistogram{\n\t\tscale: scale,\n\t\tBins: make([]int, latencyHistogramBins),\n\t\tweight: 0,\n\t}\n}\n\nfunc (h *latencyHistogram) update(r *record) {\n\tbin := int(h.scale.Map(float64(r.latency)) * latencyHistogramBins)\n\tif bin < 0 {\n\t\tbin = 0\n\t}\n\tif bin >= latencyHistogramBins {\n\t\tbin = latencyHistogramBins\n\t}\n\th.Bins[bin] += int(r.latency)\n\th.weight += int(r.latency)\n}\n\nfunc (h *latencyHistogram) max() int {\n\tout := 0\n\tfor _, count := range h.Bins {\n\t\tif count > out {\n\t\t\tout = count\n\t\t}\n\t}\n\treturn out\n}\n\ntype weightSorter []*latencyHistogram\n\nfunc (w weightSorter) Len() int {\n\treturn len(w)\n}\n\nfunc (w weightSorter) Less(i, j int) bool {\n\tif w[i].group != w[j].group {\n\t\treturn w[i].group > w[j].group\n\t}\n\treturn w[i].weight < w[j].weight\n}\n\nfunc (w weightSorter) Swap(i, j int) {\n\tw[i], w[j] = w[j], w[i]\n}\n\ntype sourceRange struct {\n\tfile string\n\tstart, end int\n\tmaxWeight int\n}\n\nfunc expandSourceRanges(r []sourceRange, by int) []sourceRange {\n\tsort.Slice(r, func(i, j int) bool {\n\t\tif r[i].file != r[j].file {\n\t\t\treturn r[i].file < r[j].file\n\t\t}\n\t\treturn r[i].start < r[j].start\n\t})\n\n\t// Expand ranges.\n\tfor i := range r {\n\t\tr[i].start -= by\n\t\tr[i].end += by\n\t}\n\n\t// Merge ranges.\n\ti := 0\n\tfor j := 1; j < len(r); j++ {\n\t\tif r[i].file == r[j].file && r[i].end >= r[j].start {\n\t\t\tif r[j].end > r[i].end {\n\t\t\t\tr[i].end = r[j].end\n\t\t\t}\n\t\t\tif r[j].maxWeight > r[i].maxWeight {\n\t\t\t\tr[i].maxWeight = r[j].maxWeight\n\t\t\t}\n\t\t} else {\n\t\t\ti++\n\t\t\tr[i] = r[j]\n\t\t}\n\t}\n\treturn r[:i+1]\n}\n\nfunc getLines(r sourceRange) ([]string, sourceRange, error) {\n\tlines := []string{}\n\n\tfile, err := os.Open(r.file)\n\tif err != nil {\n\t\treturn nil, r, err\n\t}\n\tdefer file.Close()\n\n\t// Skip to start.\n\tif r.start < 0 {\n\t\tr.start = 0\n\t}\n\tscanner := bufio.NewScanner(file)\n\tfor i := 0; i < r.start && scanner.Scan(); i++ {\n\t\t// Do nothing\n\t}\n\n\tfor i := 0; i < r.end-r.start && scanner.Err() == nil; i++ {\n\t\tlines = append(lines, scanner.Text())\n\t\tscanner.Scan()\n\t}\n\tif err := scanner.Err(); err != nil {\n\t\treturn nil, r, err\n\t}\n\n\treturn lines, r, nil\n}\n\ntype metadataHandler struct {\n\tFilename string\n\tMetadata\n}\n\nfunc (h *metadataHandler) ServeHTTP(w http.ResponseWriter, req *http.Request) {\n\terr := json.NewEncoder(w).Encode(h)\n\tif err != nil {\n\t\tlog.Print(err)\n\t\thttp.Error(w, err.Error(), http.StatusInternalServerError)\n\t}\n}\n" }, { "path": "cmd/memlat/static/bower.json", "content": "{\n \"name\": \"memlat\",\n \"version\": \"0.0.0\",\n \"homepage\": \"https://github.com/aclements/go-perf\",\n \"authors\": [\n \"Austin Clements <(none)>\"\n ],\n \"license\": \"MIT\",\n \"ignore\": [\n \"**/.*\",\n \"node_modules\",\n \"bower_components\",\n \"test\",\n \"tests\"\n ],\n \"dependencies\": {\n \"polymer\": \"Polymer/polymer#^1.0.0\",\n \"paper-button\": \"PolymerElements/paper-button#~1.0.3\",\n \"paper-tabs\": \"PolymerElements/paper-tabs#~1.0.2\",\n \"paper-styles\": \"PolymerElements/paper-styles#~1.0.11\",\n \"iron-pages\": \"PolymerElements/iron-pages#~1.0.3\",\n \"iron-ajax\": \"PolymerElements/iron-ajax#~1.0.4\",\n \"paper-card\": \"PolymerElements/paper-card#~1.0.3\",\n \"paper-header-panel\": \"PolymerElements/paper-header-panel#~1.0.4\",\n \"paper-toolbar\": \"PolymerElements/paper-toolbar#~1.0.4\",\n \"iron-icon\": \"PolymerElements/iron-icon#~1.0.3\",\n \"iron-icons\": \"PolymerElements/iron-icons#~1.0.3\"\n }\n}\n" }, { "path": "cmd/memlat/static/bower_components/font-roboto/.bower.json", "content": "{\n \"name\": \"font-roboto\",\n \"version\": \"1.0.1\",\n \"description\": \"An HTML import for Roboto\",\n \"authors\": [\n \"The Polymer Authors\"\n ],\n \"keywords\": [\n \"font\",\n \"roboto\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git://github.com/PolymerElements/font-roboto.git\"\n },\n \"main\": \"roboto.html\",\n \"license\": \"http://polymer.github.io/LICENSE.txt\",\n \"homepage\": \"https://github.com/PolymerElements/font-roboto/\",\n \"ignore\": [\n \"/.*\"\n ],\n \"_release\": \"1.0.1\",\n \"_resolution\": {\n \"type\": \"version\",\n \"tag\": \"v1.0.1\",\n \"commit\": \"21ce9b51a417fa9995cf6606e886aba0728f70a1\"\n },\n \"_source\": \"git://github.com/PolymerElements/font-roboto.git\",\n \"_target\": \"^1.0.1\",\n \"_originalSource\": \"PolymerElements/font-roboto\"\n}" }, { "path": "cmd/memlat/static/bower_components/font-roboto/README.md", "content": "# font-roboto\n" }, { "path": "cmd/memlat/static/bower_components/font-roboto/bower.json", "content": "{\n \"name\": \"font-roboto\",\n \"version\": \"1.0.1\",\n \"description\": \"An HTML import for Roboto\",\n \"authors\": [\n \"The Polymer Authors\"\n ],\n \"keywords\": [\n \"font\",\n \"roboto\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git://github.com/PolymerElements/font-roboto.git\"\n },\n \"main\": \"roboto.html\",\n \"license\": \"http://polymer.github.io/LICENSE.txt\",\n \"homepage\": \"https://github.com/PolymerElements/font-roboto/\",\n \"ignore\": [\n \"/.*\"\n ]\n}\n" }, { "path": "cmd/memlat/static/bower_components/font-roboto/roboto.html", "content": "\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/.bower.json", "content": "{\n \"name\": \"paper-styles\",\n \"version\": \"1.0.11\",\n \"description\": \"Common (global) styles for Material Design elements.\",\n \"authors\": [\n \"The Polymer Authors\"\n ],\n \"keywords\": [\n \"web-component\",\n \"polymer\",\n \"style\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git://github.com/PolymerElements/paper-styles.git\"\n },\n \"main\": \"paper-styles.html\",\n \"license\": \"http://polymer.github.io/LICENSE.txt\",\n \"homepage\": \"https://github.com/polymerelements/paper-styles/\",\n \"ignore\": [\n \"/.*\"\n ],\n \"dependencies\": {\n \"iron-flex-layout\": \"PolymerElements/iron-flex-layout#^1.0.0\",\n \"font-roboto\": \"PolymerElements/font-roboto#^1.0.1\",\n \"polymer\": \"Polymer/polymer#^1.0.0\"\n },\n \"devDependencies\": {\n \"webcomponentsjs\": \"webcomponents/webcomponentsjs#^0.7.0\"\n },\n \"_release\": \"1.0.11\",\n \"_resolution\": {\n \"type\": \"version\",\n \"tag\": \"v1.0.11\",\n \"commit\": \"347542e9ebe3e6e5f0830ee10e1c20c12956ff2c\"\n },\n \"_source\": \"git://github.com/polymerelements/paper-styles.git\",\n \"_target\": \"^1.0.0\",\n \"_originalSource\": \"polymerelements/paper-styles\"\n}" }, { "path": "cmd/memlat/static/bower_components/paper-styles/README.md", "content": "# paper-styles\n\nMaterial design CSS styles.\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/bower.json", "content": "{\n \"name\": \"paper-styles\",\n \"version\": \"1.0.11\",\n \"description\": \"Common (global) styles for Material Design elements.\",\n \"authors\": [\n \"The Polymer Authors\"\n ],\n \"keywords\": [\n \"web-component\",\n \"polymer\",\n \"style\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git://github.com/PolymerElements/paper-styles.git\"\n },\n \"main\": \"paper-styles.html\",\n \"license\": \"http://polymer.github.io/LICENSE.txt\",\n \"homepage\": \"https://github.com/polymerelements/paper-styles/\",\n \"ignore\": [\n \"/.*\"\n ],\n \"dependencies\": {\n \"iron-flex-layout\": \"PolymerElements/iron-flex-layout#^1.0.0\",\n \"font-roboto\": \"PolymerElements/font-roboto#^1.0.1\",\n \"polymer\": \"Polymer/polymer#^1.0.0\"\n },\n \"devDependencies\": {\n \"webcomponentsjs\": \"webcomponents/webcomponentsjs#^0.7.0\"\n }\n}\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/classes/global.html", "content": "\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/classes/shadow-layout.html", "content": "\r\n\r\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/classes/shadow.html", "content": "\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/classes/typography.html", "content": "\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/color.html", "content": "\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/default-theme.html", "content": "\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/demo/index.html", "content": "\n\n\n\n\n \n\n \n \n\n paper-styles demo\n\n \n\n \n \n\n \n\n \n \n\n \n \n\n \n\n \n \n\n \n\n \n\n
\n

demo-pages.html

\n\n

Horizontal sections

\n
\n
\n

Column 1

\n
\n
Oxygen
\n
Carbon
\n
Hydrogen
\n
Nitrogen
\n
Calcium
\n
\n
\n\n
\n

Column 2

\n
\n
Oxygen
\n
Carbon
\n
Hydrogen
\n
Nitrogen
\n
Calcium
\n
\n
\n\n
\n

Column 3

\n
\n
Oxygen
\n
Carbon
\n
Hydrogen
\n
Nitrogen
\n
Calcium
\n
\n
\n
\n\n

Vertical sections

\n
\n
\n

Section 1

\n
\n
Oxygen
\n
Carbon
\n
Hydrogen
\n
Nitrogen
\n
Calcium
\n
\n
\n
\n\n
\n

Section 2 (centered)

\n
\n
Oxygen
\n
Carbon
\n
Hydrogen
\n
Nitrogen
\n
Calcium
\n
\n
\n\n
\n\n \n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/demo-pages.html", "content": "\n\n\n\n\n\n\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/demo.css", "content": "/**\n@license\nCopyright (c) 2015 The Polymer Project Authors. All rights reserved.\nThis code may only be used under the BSD style license found at http://polymer.github.io/LICENSE.txt\nThe complete set of authors may be found at http://polymer.github.io/AUTHORS.txt\nThe complete set of contributors may be found at http://polymer.github.io/CONTRIBUTORS.txt\nCode distributed by Google as part of the polymer project is also\nsubject to an additional IP rights grant found at http://polymer.github.io/PATENTS.txt\n\n*/\nbody {\n font-family: 'Roboto', 'Noto', sans-serif;\n font-size: 14px;\n margin: 0;\n padding: 24px;\n}\n\nsection {\n padding: 20px 0;\n}\n\nsection > div {\n padding: 14px;\n font-size: 16px;\n}\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/paper-styles-classes.html", "content": "\n\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/paper-styles.html", "content": "\n\n\n\n\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/shadow.html", "content": "\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/paper-styles/typography.html", "content": "\n\n\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/polymer/.bower.json", "content": "{\n \"name\": \"polymer\",\n \"version\": \"1.1.0\",\n \"main\": [\n \"polymer.html\"\n ],\n \"license\": \"http://polymer.github.io/LICENSE.txt\",\n \"ignore\": [\n \"/.*\",\n \"/test/\"\n ],\n \"authors\": [\n \"The Polymer Authors (http://polymer.github.io/AUTHORS.txt)\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"https://github.com/Polymer/polymer.git\"\n },\n \"dependencies\": {\n \"webcomponentsjs\": \"^0.7.2\"\n },\n \"devDependencies\": {\n \"web-component-tester\": \"*\"\n },\n \"private\": true,\n \"homepage\": \"https://github.com/Polymer/polymer\",\n \"_release\": \"1.1.0\",\n \"_resolution\": {\n \"type\": \"version\",\n \"tag\": \"v1.1.0\",\n \"commit\": \"67fb2f85fd66d8556fc07cf1dec41ff5273fa68a\"\n },\n \"_source\": \"git://github.com/Polymer/polymer.git\",\n \"_target\": \"^1.0.0\",\n \"_originalSource\": \"Polymer/polymer\",\n \"_direct\": true\n}" }, { "path": "cmd/memlat/static/bower_components/polymer/LICENSE.txt", "content": "// Copyright (c) 2014 The Polymer Authors. All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "cmd/memlat/static/bower_components/polymer/bower.json", "content": "{\n \"name\": \"polymer\",\n \"version\": \"1.1.0\",\n \"main\": [\n \"polymer.html\"\n ],\n \"license\": \"http://polymer.github.io/LICENSE.txt\",\n \"ignore\": [\n \"/.*\",\n \"/test/\"\n ],\n \"authors\": [\n \"The Polymer Authors (http://polymer.github.io/AUTHORS.txt)\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"https://github.com/Polymer/polymer.git\"\n },\n \"dependencies\": {\n \"webcomponentsjs\": \"^0.7.2\"\n },\n \"devDependencies\": {\n \"web-component-tester\": \"*\"\n },\n \"private\": true\n}\n" }, { "path": "cmd/memlat/static/bower_components/polymer/build.log", "content": "BUILD LOG\n---------\nBuild Time: 2015-08-13T16:56:33-0700\n\nNODEJS INFORMATION\n==================\nnodejs: v0.12.7\ndel: 1.2.0\ngulp: 3.9.0\ngulp-audit: 1.0.0\ngulp-rename: 1.2.2\ngulp-replace: 0.5.3\ngulp-vulcanize: 6.0.1\nlazypipe: 0.2.4\npolyclean: 1.2.0\nrun-sequence: 1.1.1\n\nREPO REVISIONS\n==============\npolymer: a42ca09c3b99749b1407d5fa68cd957c2eaf5ca6\n\nBUILD HASHES\n============\npolymer-mini.html: b40016f458e85bb815c898378b7bcd5c8abe5661\npolymer-micro.html: ef8ebb2dc40697c845c2b8ec64ee69838d0d7bfc\npolymer.html: 2f874995a3a3ada9e87da48a01d10c6d3ee297bb" }, { "path": "cmd/memlat/static/bower_components/polymer/polymer-micro.html", "content": "\n\n" }, { "path": "cmd/memlat/static/bower_components/polymer/polymer-mini.html", "content": "\n\n\n\n" }, { "path": "cmd/memlat/static/bower_components/polymer/polymer.html", "content": "\n\n\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/.bower.json", "content": "{\n \"name\": \"promise-polyfill\",\n \"version\": \"1.0.0\",\n \"homepage\": \"https://github.com/taylorhakes/promise-polyfill\",\n \"authors\": [\n \"Taylor Hakes\"\n ],\n \"description\": \"Lightweight promise polyfill for the browser and node. A+ Compliant.\",\n \"main\": \"Promise.js\",\n \"moduleType\": [\n \"globals\",\n \"node\"\n ],\n \"keywords\": [\n \"promise\",\n \"es6\",\n \"polyfill\",\n \"html5\"\n ],\n \"license\": \"MIT\",\n \"ignore\": [\n \"**/.*\",\n \"node_modules\",\n \"bower_components\",\n \"test\",\n \"tests\"\n ],\n \"dependencies\": {\n \"polymer\": \"polymer/polymer#^1.0.0\"\n },\n \"_release\": \"1.0.0\",\n \"_resolution\": {\n \"type\": \"version\",\n \"tag\": \"v1.0.0\",\n \"commit\": \"2ef7dada161cae30e69ffff918485c57121d4b88\"\n },\n \"_source\": \"git://github.com/polymerlabs/promise-polyfill.git\",\n \"_target\": \"^1.0.0\",\n \"_originalSource\": \"polymerlabs/promise-polyfill\"\n}" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/Gruntfile.js", "content": "module.exports = function(grunt) {\n\n\tgrunt.initConfig({\n\t\tpkg: grunt.file.readJSON('package.json'),\n\n\t\tuglify: {\n\t\t\toptions: {\n\t\t\t\tbanner: '/*! <%= pkg.name %> <%= pkg.version %> */\\n'\n\t\t\t},\n\t\t\tdist: {\n\t\t\t\tfiles: {\n\t\t\t\t\t'Promise.min.uglify.js': ['Promise.js']\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\n closurecompiler: {\n options: {\n compilation_level: 'ADVANCED_OPTIMIZATIONS',\n },\n dist: {\n files: {\n 'Promise.min.js': ['Promise.js']\n }\n }\n },\n\n bytesize: {\n dist: {\n src: ['Promise*.js']\n }\n }\n\t});\n\n\tgrunt.loadNpmTasks('grunt-contrib-uglify');\n\tgrunt.loadNpmTasks('grunt-closurecompiler');\n\tgrunt.loadNpmTasks('grunt-bytesize');\n\n\tgrunt.registerTask('build', ['closurecompiler', 'bytesize']);\n};\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/LICENSE", "content": "Copyright (c) 2014 Taylor Hakes\nCopyright (c) 2014 Forbes Lindesay\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE." }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/Promise-Statics.js", "content": "Promise.all = Promise.all || function () {\n var args = Array.prototype.slice.call(arguments.length === 1 && Array.isArray(arguments[0]) ? arguments[0] : arguments);\n\n return new Promise(function (resolve, reject) {\n if (args.length === 0) return resolve([]);\n var remaining = args.length;\n function res(i, val) {\n try {\n if (val && (typeof val === 'object' || typeof val === 'function')) {\n var then = val.then;\n if (typeof then === 'function') {\n then.call(val, function (val) { res(i, val) }, reject);\n return;\n }\n }\n args[i] = val;\n if (--remaining === 0) {\n resolve(args);\n }\n } catch (ex) {\n reject(ex);\n }\n }\n for (var i = 0; i < args.length; i++) {\n res(i, args[i]);\n }\n });\n};\n\nPromise.race = Promise.race || function (values) {\n return new Promise(function (resolve, reject) {\n for(var i = 0, len = values.length; i < len; i++) {\n values[i].then(resolve, reject);\n }\n });\n};\n\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/Promise.js", "content": "function MakePromise (asap) {\n function Promise(fn) {\n\t\tif (typeof this !== 'object' || typeof fn !== 'function') throw new TypeError();\n\t\tthis._state = null;\n\t\tthis._value = null;\n\t\tthis._deferreds = []\n\n\t\tdoResolve(fn, resolve.bind(this), reject.bind(this));\n\t}\n\n\tfunction handle(deferred) {\n\t\tvar me = this;\n\t\tif (this._state === null) {\n\t\t\tthis._deferreds.push(deferred);\n\t\t\treturn\n\t\t}\n\t\tasap(function() {\n\t\t\tvar cb = me._state ? deferred.onFulfilled : deferred.onRejected\n\t\t\tif (typeof cb !== 'function') {\n\t\t\t\t(me._state ? deferred.resolve : deferred.reject)(me._value);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tvar ret;\n\t\t\ttry {\n\t\t\t\tret = cb(me._value);\n\t\t\t}\n\t\t\tcatch (e) {\n\t\t\t\tdeferred.reject(e);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdeferred.resolve(ret);\n\t\t})\n\t}\n\n\tfunction resolve(newValue) {\n\t\ttry { //Promise Resolution Procedure: https://github.com/promises-aplus/promises-spec#the-promise-resolution-procedure\n\t\t\tif (newValue === this) throw new TypeError();\n\t\t\tif (newValue && (typeof newValue === 'object' || typeof newValue === 'function')) {\n\t\t\t\tvar then = newValue.then;\n\t\t\t\tif (typeof then === 'function') {\n\t\t\t\t\tdoResolve(then.bind(newValue), resolve.bind(this), reject.bind(this));\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis._state = true;\n\t\t\tthis._value = newValue;\n\t\t\tfinale.call(this);\n\t\t} catch (e) { reject.call(this, e); }\n\t}\n\n\tfunction reject(newValue) {\n\t\tthis._state = false;\n\t\tthis._value = newValue;\n\t\tfinale.call(this);\n\t}\n\n\tfunction finale() {\n\t\tfor (var i = 0, len = this._deferreds.length; i < len; i++) {\n\t\t\thandle.call(this, this._deferreds[i]);\n\t\t}\n\t\tthis._deferreds = null;\n\t}\n\n\t/**\n\t * Take a potentially misbehaving resolver function and make sure\n\t * onFulfilled and onRejected are only called once.\n\t *\n\t * Makes no guarantees about asynchrony.\n\t */\n\tfunction doResolve(fn, onFulfilled, onRejected) {\n\t\tvar done = false;\n\t\ttry {\n\t\t\tfn(function (value) {\n\t\t\t\tif (done) return;\n\t\t\t\tdone = true;\n\t\t\t\tonFulfilled(value);\n\t\t\t}, function (reason) {\n\t\t\t\tif (done) return;\n\t\t\t\tdone = true;\n\t\t\t\tonRejected(reason);\n\t\t\t})\n\t\t} catch (ex) {\n\t\t\tif (done) return;\n\t\t\tdone = true;\n\t\t\tonRejected(ex);\n\t\t}\n\t}\n\n\tPromise.prototype['catch'] = function (onRejected) {\n\t\treturn this.then(null, onRejected);\n\t};\n\n\tPromise.prototype.then = function(onFulfilled, onRejected) {\n\t\tvar me = this;\n\t\treturn new Promise(function(resolve, reject) {\n handle.call(me, {\n onFulfilled: onFulfilled,\n onRejected: onRejected,\n resolve: resolve,\n reject: reject\n });\n\t\t})\n\t};\n\n\tPromise.resolve = function (value) {\n\t\tif (value && typeof value === 'object' && value.constructor === Promise) {\n\t\t\treturn value;\n\t\t}\n\n\t\treturn new Promise(function (resolve) {\n\t\t\tresolve(value);\n\t\t});\n\t};\n\n\tPromise.reject = function (value) {\n\t\treturn new Promise(function (resolve, reject) {\n\t\t\treject(value);\n\t\t});\n\t};\n\n\t\n return Promise;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = MakePromise;\n}\n\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/README.md", "content": "# Promise Polyfill\n\nNote: this is an unsolicited fork of [taylorhakes/promise-polyfill](https://github.com/taylorhakes/promise-polyfill)\nand should be considered experimental and unstable compared to upstream.\n\n## Testing\n```\nnpm install\nnpm test\n```\n\n## License\nMIT\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/bower.json", "content": "{\n \"name\": \"promise-polyfill\",\n \"version\": \"1.0.0\",\n \"homepage\": \"https://github.com/taylorhakes/promise-polyfill\",\n \"authors\": [\n \"Taylor Hakes\"\n ],\n \"description\": \"Lightweight promise polyfill for the browser and node. A+ Compliant.\",\n \"main\": \"Promise.js\",\n \"moduleType\": [\n \"globals\",\n \"node\"\n ],\n \"keywords\": [\n \"promise\",\n \"es6\",\n \"polyfill\",\n \"html5\"\n ],\n \"license\": \"MIT\",\n \"ignore\": [\n \"**/.*\",\n \"node_modules\",\n \"bower_components\",\n \"test\",\n \"tests\"\n ],\n \"dependencies\": {\n \"polymer\": \"polymer/polymer#^1.0.0\"\n }\n}\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/package.json", "content": "{\n \"name\": \"promise-polyfill\",\n \"version\": \"2.0.0\",\n \"description\": \"Lightweight promise polyfill. A+ compliant\",\n \"main\": \"Promise.js\",\n \"scripts\": {\n \"test\": \"./node_modules/.bin/promises-aplus-tests tests/adapter.js; ./node_modules/.bin/promises-es6-tests tests/adapter.js\"\n },\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"https://taylorhakes@github.com/taylorhakes/promise-polyfill.git\"\n },\n \"author\": \"Taylor Hakes\",\n \"license\": \"MIT\",\n \"bugs\": {\n \"url\": \"https://github.com/taylorhakes/promise-polyfill/issues\"\n },\n \"homepage\": \"https://github.com/taylorhakes/promise-polyfill\",\n \"devDependencies\": {\n \"grunt\": \"^0.4.5\",\n \"grunt-bytesize\": \"^0.1.1\",\n \"grunt-closurecompiler\": \"^0.9.9\",\n \"grunt-contrib-uglify\": \"^0.4.0\",\n \"mocha\": \"^2.2.1\",\n \"promises-aplus-tests\": \"*\",\n \"promises-es6-tests\": \"^0.5.0\"\n },\n \"keywords\": [\n \"promise\",\n \"promise-polyfill\",\n \"ES6\",\n \"promises-aplus\"\n ],\n \"dependencies\": {}\n}\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/promise-polyfill-lite.html", "content": "\n\n\n" }, { "path": "cmd/memlat/static/bower_components/promise-polyfill/promise-polyfill.html", "content": "\n\n" }, { "path": "cmd/memlat/static/bower_components/webcomponentsjs/.bower.json", "content": "{\n \"name\": \"webcomponentsjs\",\n \"main\": \"webcomponents.js\",\n \"version\": \"0.7.11\",\n \"homepage\": \"http://webcomponents.org\",\n \"authors\": [\n \"The Polymer Authors\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"https://github.com/webcomponents/webcomponentsjs.git\"\n },\n \"keywords\": [\n \"webcomponents\"\n ],\n \"license\": \"BSD\",\n \"ignore\": [],\n \"_release\": \"0.7.11\",\n \"_resolution\": {\n \"type\": \"version\",\n \"tag\": \"v0.7.11\",\n \"commit\": \"ce6321507de6161ec52b43f82a6c36eda614d750\"\n },\n \"_source\": \"git://github.com/Polymer/webcomponentsjs.git\",\n \"_target\": \"^0.7.2\",\n \"_originalSource\": \"webcomponentsjs\"\n}" }, { "path": "cmd/memlat/static/bower_components/webcomponentsjs/CustomElements.js", "content": "/**\n * @license\n * Copyright (c) 2014 The Polymer Project Authors. All rights reserved.\n * This code may only be used under the BSD style license found at http://polymer.github.io/LICENSE.txt\n * The complete set of authors may be found at http://polymer.github.io/AUTHORS.txt\n * The complete set of contributors may be found at http://polymer.github.io/CONTRIBUTORS.txt\n * Code distributed by Google as part of the polymer project is also\n * subject to an additional IP rights grant found at http://polymer.github.io/PATENTS.txt\n */\n// @version 0.7.11\nif (typeof WeakMap === \"undefined\") {\n (function() {\n var defineProperty = Object.defineProperty;\n var counter = Date.now() % 1e9;\n var WeakMap = function() {\n this.name = \"__st\" + (Math.random() * 1e9 >>> 0) + (counter++ + \"__\");\n };\n WeakMap.prototype = {\n set: function(key, value) {\n var entry = key[this.name];\n if (entry && entry[0] === key) entry[1] = value; else defineProperty(key, this.name, {\n value: [ key, value ],\n writable: true\n });\n return this;\n },\n get: function(key) {\n var entry;\n return (entry = key[this.name]) && entry[0] === key ? entry[1] : undefined;\n },\n \"delete\": function(key) {\n var entry = key[this.name];\n if (!entry || entry[0] !== key) return false;\n entry[0] = entry[1] = undefined;\n return true;\n },\n has: function(key) {\n var entry = key[this.name];\n if (!entry) return false;\n return entry[0] === key;\n }\n };\n window.WeakMap = WeakMap;\n })();\n}\n\n(function(global) {\n var registrationsTable = new WeakMap();\n var setImmediate;\n if (/Trident|Edge/.test(navigator.userAgent)) {\n setImmediate = setTimeout;\n } else if (window.setImmediate) {\n setImmediate = window.setImmediate;\n } else {\n var setImmediateQueue = [];\n var sentinel = String(Math.random());\n window.addEventListener(\"message\", function(e) {\n if (e.data === sentinel) {\n var queue = setImmediateQueue;\n setImmediateQueue = [];\n queue.forEach(function(func) {\n func();\n });\n }\n });\n setImmediate = function(func) {\n setImmediateQueue.push(func);\n window.postMessage(sentinel, \"*\");\n };\n }\n var isScheduled = false;\n var scheduledObservers = [];\n function scheduleCallback(observer) {\n scheduledObservers.push(observer);\n if (!isScheduled) {\n isScheduled = true;\n setImmediate(dispatchCallbacks);\n }\n }\n function wrapIfNeeded(node) {\n return window.ShadowDOMPolyfill && window.ShadowDOMPolyfill.wrapIfNeeded(node) || node;\n }\n function dispatchCallbacks() {\n isScheduled = false;\n var observers = scheduledObservers;\n scheduledObservers = [];\n observers.sort(function(o1, o2) {\n return o1.uid_ - o2.uid_;\n });\n var anyNonEmpty = false;\n observers.forEach(function(observer) {\n var queue = observer.takeRecords();\n removeTransientObserversFor(observer);\n if (queue.length) {\n observer.callback_(queue, observer);\n anyNonEmpty = true;\n }\n });\n if (anyNonEmpty) dispatchCallbacks();\n }\n function removeTransientObserversFor(observer) {\n observer.nodes_.forEach(function(node) {\n var registrations = registrationsTable.get(node);\n if (!registrations) return;\n registrations.forEach(function(registration) {\n if (registration.observer === observer) registration.removeTransientObservers();\n });\n });\n }\n function forEachAncestorAndObserverEnqueueRecord(target, callback) {\n for (var node = target; node; node = node.parentNode) {\n var registrations = registrationsTable.get(node);\n if (registrations) {\n for (var j = 0; j < registrations.length; j++) {\n var registration = registrations[j];\n var options = registration.options;\n if (node !== target && !options.subtree) continue;\n var record = callback(options);\n if (record) registration.enqueue(record);\n }\n }\n }\n }\n var uidCounter = 0;\n function JsMutationObserver(callback) {\n this.callback_ = callback;\n this.nodes_ = [];\n this.records_ = [];\n this.uid_ = ++uidCounter;\n }\n JsMutationObserver.prototype = {\n observe: function(target, options) {\n target = wrapIfNeeded(target);\n if (!options.childList && !options.attributes && !options.characterData || options.attributeOldValue && !options.attributes || options.attributeFilter && options.attributeFilter.length && !options.attributes || options.characterDataOldValue && !options.characterData) {\n throw new SyntaxError();\n }\n var registrations = registrationsTable.get(target);\n if (!registrations) registrationsTable.set(target, registrations = []);\n var registration;\n for (var i = 0; i < registrations.length; i++) {\n if (registrations[i].observer === this) {\n registration = registrations[i];\n registration.removeListeners();\n registration.options = options;\n break;\n }\n }\n if (!registration) {\n registration = new Registration(this, target, options);\n registrations.push(registration);\n this.nodes_.push(target);\n }\n registration.addListeners();\n },\n disconnect: function() {\n this.nodes_.forEach(function(node) {\n var registrations = registrationsTable.get(node);\n for (var i = 0; i < registrations.length; i++) {\n var registration = registrations[i];\n if (registration.observer === this) {\n registration.removeListeners();\n registrations.splice(i, 1);\n break;\n }\n }\n }, this);\n this.records_ = [];\n },\n takeRecords: function() {\n var copyOfRecords = this.records_;\n this.records_ = [];\n return copyOfRecords;\n }\n };\n function MutationRecord(type, target) {\n this.type = type;\n this.target = target;\n this.addedNodes = [];\n this.removedNodes = [];\n this.previousSibling = null;\n this.nextSibling = null;\n this.attributeName = null;\n this.attributeNamespace = null;\n this.oldValue = null;\n }\n function copyMutationRecord(original) {\n var record = new MutationRecord(original.type, original.target);\n record.addedNodes = original.addedNodes.slice();\n record.removedNodes = original.removedNodes.slice();\n record.previousSibling = original.previousSibling;\n record.nextSibling = original.nextSibling;\n record.attributeName = original.attributeName;\n record.attributeNamespace = original.attributeNamespace;\n record.oldValue = original.oldValue;\n return record;\n }\n var currentRecord, recordWithOldValue;\n function getRecord(type, target) {\n return currentRecord = new MutationRecord(type, target);\n }\n function getRecordWithOldValue(oldValue) {\n if (recordWithOldValue) return recordWithOldValue;\n recordWithOldValue = copyMutationRecord(currentRecord);\n recordWithOldValue.oldValue = oldValue;\n return recordWithOldValue;\n }\n function clearRecords() {\n currentRecord = recordWithOldValue = undefined;\n }\n function recordRepresentsCurrentMutation(record) {\n return record === recordWithOldValue || record === currentRecord;\n }\n function selectRecord(lastRecord, newRecord) {\n if (lastRecord === newRecord) return lastRecord;\n if (recordWithOldValue && recordRepresentsCurrentMutation(lastRecord)) return recordWithOldValue;\n return null;\n }\n function Registration(observer, target, options) {\n this.observer = observer;\n this.target = target;\n this.options = options;\n this.transientObservedNodes = [];\n }\n Registration.prototype = {\n enqueue: function(record) {\n var records = this.observer.records_;\n var length = records.length;\n if (records.length > 0) {\n var lastRecord = records[length - 1];\n var recordToReplaceLast = selectRecord(lastRecord, record);\n if (recordToReplaceLast) {\n records[length - 1] = recordToReplaceLast;\n return;\n }\n } else {\n scheduleCallback(this.observer);\n }\n records[length] = record;\n },\n addListeners: function() {\n this.addListeners_(this.target);\n },\n addListeners_: function(node) {\n var options = this.options;\n if (options.attributes) node.addEventListener(\"DOMAttrModified\", this, true);\n if (options.characterData) node.addEventListener(\"DOMCharacterDataModified\", this, true);\n if (options.childList) node.addEventListener(\"DOMNodeInserted\", this, true);\n if (options.childList || options.subtree) node.addEventListener(\"DOMNodeRemoved\", this, true);\n },\n removeListeners: function() {\n this.removeListeners_(this.target);\n },\n removeListeners_: function(node) {\n var options = this.options;\n if (options.attributes) node.removeEventListener(\"DOMAttrModified\", this, true);\n if (options.characterData) node.removeEventListener(\"DOMCharacterDataModified\", this, true);\n if (options.childList) node.removeEventListener(\"DOMNodeInserted\", this, true);\n if (options.childList || options.subtree) node.removeEventListener(\"DOMNodeRemoved\", this, true);\n },\n addTransientObserver: function(node) {\n if (node === this.target) return;\n this.addListeners_(node);\n this.transientObservedNodes.push(node);\n var registrations = registrationsTable.get(node);\n if (!registrations) registrationsTable.set(node, registrations = []);\n registrations.push(this);\n },\n removeTransientObservers: function() {\n var transientObservedNodes = this.transientObservedNodes;\n this.transientObservedNodes = [];\n transientObservedNodes.forEach(function(node) {\n this.removeListeners_(node);\n var registrations = registrationsTable.get(node);\n for (var i = 0; i < registrations.length; i++) {\n if (registrations[i] === this) {\n registrations.splice(i, 1);\n break;\n }\n }\n }, this);\n },\n handleEvent: function(e) {\n e.stopImmediatePropagation();\n switch (e.type) {\n case \"DOMAttrModified\":\n var name = e.attrName;\n var namespace = e.relatedNode.namespaceURI;\n var target = e.target;\n var record = new getRecord(\"attributes\", target);\n record.attributeName = name;\n record.attributeNamespace = namespace;\n var oldValue = e.attrChange === MutationEvent.ADDITION ? null : e.prevValue;\n forEachAncestorAndObserverEnqueueRecord(target, function(options) {\n if (!options.attributes) return;\n if (options.attributeFilter && options.attributeFilter.length && options.attributeFilter.indexOf(name) === -1 && options.attributeFilter.indexOf(namespace) === -1) {\n return;\n }\n if (options.attributeOldValue) return getRecordWithOldValue(oldValue);\n return record;\n });\n break;\n\n case \"DOMCharacterDataModified\":\n var target = e.target;\n var record = getRecord(\"characterData\", target);\n var oldValue = e.prevValue;\n forEachAncestorAndObserverEnqueueRecord(target, function(options) {\n if (!options.characterData) return;\n if (options.characterDataOldValue) return getRecordWithOldValue(oldValue);\n return record;\n });\n break;\n\n case \"DOMNodeRemoved\":\n this.addTransientObserver(e.target);\n\n case \"DOMNodeInserted\":\n var changedNode = e.target;\n var addedNodes, removedNodes;\n if (e.type === \"DOMNodeInserted\") {\n addedNodes = [ changedNode ];\n removedNodes = [];\n } else {\n addedNodes = [];\n removedNodes = [ changedNode ];\n }\n var previousSibling = changedNode.previousSibling;\n var nextSibling = changedNode.nextSibling;\n var record = getRecord(\"childList\", e.target.parentNode);\n record.addedNodes = addedNodes;\n record.removedNodes = removedNodes;\n record.previousSibling = previousSibling;\n record.nextSibling = nextSibling;\n forEachAncestorAndObserverEnqueueRecord(e.relatedNode, function(options) {\n if (!options.childList) return;\n return record;\n });\n }\n clearRecords();\n }\n };\n global.JsMutationObserver = JsMutationObserver;\n if (!global.MutationObserver) global.MutationObserver = JsMutationObserver;\n})(this);\n\nwindow.CustomElements = window.CustomElements || {\n flags: {}\n};\n\n(function(scope) {\n var flags = scope.flags;\n var modules = [];\n var addModule = function(module) {\n modules.push(module);\n };\n var initializeModules = function() {\n modules.forEach(function(module) {\n module(scope);\n });\n };\n scope.addModule = addModule;\n scope.initializeModules = initializeModules;\n scope.hasNative = Boolean(document.registerElement);\n scope.useNative = !flags.register && scope.hasNative && !window.ShadowDOMPolyfill && (!window.HTMLImports || window.HTMLImports.useNative);\n})(window.CustomElements);\n\nwindow.CustomElements.addModule(function(scope) {\n var IMPORT_LINK_TYPE = window.HTMLImports ? window.HTMLImports.IMPORT_LINK_TYPE : \"none\";\n function forSubtree(node, cb) {\n findAllElements(node, function(e) {\n if (cb(e)) {\n return true;\n }\n forRoots(e, cb);\n });\n forRoots(node, cb);\n }\n function findAllElements(node, find, data) {\n var e = node.firstElementChild;\n if (!e) {\n e = node.firstChild;\n while (e && e.nodeType !== Node.ELEMENT_NODE) {\n e = e.nextSibling;\n }\n }\n while (e) {\n if (find(e, data) !== true) {\n findAllElements(e, find, data);\n }\n e = e.nextElementSibling;\n }\n return null;\n }\n function forRoots(node, cb) {\n var root = node.shadowRoot;\n while (root) {\n forSubtree(root, cb);\n root = root.olderShadowRoot;\n }\n }\n function forDocumentTree(doc, cb) {\n _forDocumentTree(doc, cb, []);\n }\n function _forDocumentTree(doc, cb, processingDocuments) {\n doc = window.wrap(doc);\n if (processingDocuments.indexOf(doc) >= 0) {\n return;\n }\n processingDocuments.push(doc);\n var imports = doc.querySelectorAll(\"link[rel=\" + IMPORT_LINK_TYPE + \"]\");\n for (var i = 0, l = imports.length, n; i < l && (n = imports[i]); i++) {\n if (n.import) {\n _forDocumentTree(n.import, cb, processingDocuments);\n }\n }\n cb(doc);\n }\n scope.forDocumentTree = forDocumentTree;\n scope.forSubtree = forSubtree;\n});\n\nwindow.CustomElements.addModule(function(scope) {\n var flags = scope.flags;\n var forSubtree = scope.forSubtree;\n var forDocumentTree = scope.forDocumentTree;\n function addedNode(node, isAttached) {\n return added(node, isAttached) || addedSubtree(node, isAttached);\n }\n function added(node, isAttached) {\n if (scope.upgrade(node, isAttached)) {\n return true;\n }\n if (isAttached) {\n attached(node);\n }\n }\n function addedSubtree(node, isAttached) {\n forSubtree(node, function(e) {\n if (added(e, isAttached)) {\n return true;\n }\n });\n }\n var hasPolyfillMutations = !window.MutationObserver || window.MutationObserver === window.JsMutationObserver;\n scope.hasPolyfillMutations = hasPolyfillMutations;\n var isPendingMutations = false;\n var pendingMutations = [];\n function deferMutation(fn) {\n pendingMutations.push(fn);\n if (!isPendingMutations) {\n isPendingMutations = true;\n setTimeout(takeMutations);\n }\n }\n function takeMutations() {\n isPendingMutations = false;\n var $p = pendingMutations;\n for (var i = 0, l = $p.length, p; i < l && (p = $p[i]); i++) {\n p();\n }\n pendingMutations = [];\n }\n function attached(element) {\n if (hasPolyfillMutations) {\n deferMutation(function() {\n _attached(element);\n });\n } else {\n _attached(element);\n }\n }\n function _attached(element) {\n if (element.__upgraded__ && !element.__attached) {\n element.__attached = true;\n if (element.attachedCallback) {\n element.attachedCallback();\n }\n }\n }\n function detachedNode(node) {\n detached(node);\n forSubtree(node, function(e) {\n detached(e);\n });\n }\n function detached(element) {\n if (hasPolyfillMutations) {\n deferMutation(function() {\n _detached(element);\n });\n } else {\n _detached(element);\n }\n }\n function _detached(element) {\n if (element.__upgraded__ && element.__attached) {\n element.__attached = false;\n if (element.detachedCallback) {\n element.detachedCallback();\n }\n }\n }\n function inDocument(element) {\n var p = element;\n var doc = window.wrap(document);\n while (p) {\n if (p == doc) {\n return true;\n }\n p = p.parentNode || p.nodeType === Node.DOCUMENT_FRAGMENT_NODE && p.host;\n }\n }\n function watchShadow(node) {\n if (node.shadowRoot && !node.shadowRoot.__watched) {\n flags.dom && console.log(\"watching shadow-root for: \", node.localName);\n var root = node.shadowRoot;\n while (root) {\n observe(root);\n root = root.olderShadowRoot;\n }\n }\n }\n function handler(root, mutations) {\n if (flags.dom) {\n var mx = mutations[0];\n if (mx && mx.type === \"childList\" && mx.addedNodes) {\n if (mx.addedNodes) {\n var d = mx.addedNodes[0];\n while (d && d !== document && !d.host) {\n d = d.parentNode;\n }\n var u = d && (d.URL || d._URL || d.host && d.host.localName) || \"\";\n u = u.split(\"/?\").shift().split(\"/\").pop();\n }\n }\n console.group(\"mutations (%d) [%s]\", mutations.length, u || \"\");\n }\n var isAttached = inDocument(root);\n mutations.forEach(function(mx) {\n if (mx.type === \"childList\") {\n forEach(mx.addedNodes, function(n) {\n if (!n.localName) {\n return;\n }\n addedNode(n, isAttached);\n });\n forEach(mx.removedNodes, function(n) {\n if (!n.localName) {\n return;\n }\n detachedNode(n);\n });\n }\n });\n flags.dom && console.groupEnd();\n }\n function takeRecords(node) {\n node = window.wrap(node);\n if (!node) {\n node = window.wrap(document);\n }\n while (node.parentNode) {\n node = node.parentNode;\n }\n var observer = node.__observer;\n if (observer) {\n handler(node, observer.takeRecords());\n takeMutations();\n }\n }\n var forEach = Array.prototype.forEach.call.bind(Array.prototype.forEach);\n function observe(inRoot) {\n if (inRoot.__observer) {\n return;\n }\n var observer = new MutationObserver(handler.bind(this, inRoot));\n observer.observe(inRoot, {\n childList: true,\n subtree: true\n });\n inRoot.__observer = observer;\n }\n function upgradeDocument(doc) {\n doc = window.wrap(doc);\n flags.dom && console.group(\"upgradeDocument: \", doc.baseURI.split(\"/\").pop());\n var isMainDocument = doc === window.wrap(document);\n addedNode(doc, isMainDocument);\n observe(doc);\n flags.dom && console.groupEnd();\n }\n function upgradeDocumentTree(doc) {\n forDocumentTree(doc, upgradeDocument);\n }\n var originalCreateShadowRoot = Element.prototype.createShadowRoot;\n if (originalCreateShadowRoot) {\n Element.prototype.createShadowRoot = function() {\n var root = originalCreateShadowRoot.call(this);\n window.CustomElements.watchShadow(this);\n return root;\n };\n }\n scope.watchShadow = watchShadow;\n scope.upgradeDocumentTree = upgradeDocumentTree;\n scope.upgradeDocument = upgradeDocument;\n scope.upgradeSubtree = addedSubtree;\n scope.upgradeAll = addedNode;\n scope.attached = attached;\n scope.takeRecords = takeRecords;\n});\n\nwindow.CustomElements.addModule(function(scope) {\n var flags = scope.flags;\n function upgrade(node, isAttached) {\n if (!node.__upgraded__ && node.nodeType === Node.ELEMENT_NODE) {\n var is = node.getAttribute(\"is\");\n var definition = scope.getRegisteredDefinition(node.localName) || scope.getRegisteredDefinition(is);\n if (definition) {\n if (is && definition.tag == node.localName || !is && !definition.extends) {\n return upgradeWithDefinition(node, definition, isAttached);\n }\n }\n }\n }\n function upgradeWithDefinition(element, definition, isAttached) {\n flags.upgrade && console.group(\"upgrade:\", element.localName);\n if (definition.is) {\n element.setAttribute(\"is\", definition.is);\n }\n implementPrototype(element, definition);\n element.__upgraded__ = true;\n created(element);\n if (isAttached) {\n scope.attached(element);\n }\n scope.upgradeSubtree(element, isAttached);\n flags.upgrade && console.groupEnd();\n return element;\n }\n function implementPrototype(element, definition) {\n if (Object.__proto__) {\n element.__proto__ = definition.prototype;\n } else {\n customMixin(element, definition.prototype, definition.native);\n element.__proto__ = definition.prototype;\n }\n }\n function customMixin(inTarget, inSrc, inNative) {\n var used = {};\n var p = inSrc;\n while (p !== inNative && p !== HTMLElement.prototype) {\n var keys = Object.getOwnPropertyNames(p);\n for (var i = 0, k; k = keys[i]; i++) {\n if (!used[k]) {\n Object.defineProperty(inTarget, k, Object.getOwnPropertyDescriptor(p, k));\n used[k] = 1;\n }\n }\n p = Object.getPrototypeOf(p);\n }\n }\n function created(element) {\n if (element.createdCallback) {\n element.createdCallback();\n }\n }\n scope.upgrade = upgrade;\n scope.upgradeWithDefinition = upgradeWithDefinition;\n scope.implementPrototype = implementPrototype;\n});\n\nwindow.CustomElements.addModule(function(scope) {\n var isIE11OrOlder = scope.isIE11OrOlder;\n var upgradeDocumentTree = scope.upgradeDocumentTree;\n var upgradeAll = scope.upgradeAll;\n var upgradeWithDefinition = scope.upgradeWithDefinition;\n var implementPrototype = scope.implementPrototype;\n var useNative = scope.useNative;\n function register(name, options) {\n var definition = options || {};\n if (!name) {\n throw new Error(\"document.registerElement: first argument `name` must not be empty\");\n }\n if (name.indexOf(\"-\") < 0) {\n throw new Error(\"document.registerElement: first argument ('name') must contain a dash ('-'). Argument provided was '\" + String(name) + \"'.\");\n }\n if (isReservedTag(name)) {\n throw new Error(\"Failed to execute 'registerElement' on 'Document': Registration failed for type '\" + String(name) + \"'. The type name is invalid.\");\n }\n if (getRegisteredDefinition(name)) {\n throw new Error(\"DuplicateDefinitionError: a type with name '\" + String(name) + \"' is already registered\");\n }\n if (!definition.prototype) {\n definition.prototype = Object.create(HTMLElement.prototype);\n }\n definition.__name = name.toLowerCase();\n definition.lifecycle = definition.lifecycle || {};\n definition.ancestry = ancestry(definition.extends);\n resolveTagName(definition);\n resolvePrototypeChain(definition);\n overrideAttributeApi(definition.prototype);\n registerDefinition(definition.__name, definition);\n definition.ctor = generateConstructor(definition);\n definition.ctor.prototype = definition.prototype;\n definition.prototype.constructor = definition.ctor;\n if (scope.ready) {\n upgradeDocumentTree(document);\n }\n return definition.ctor;\n }\n function overrideAttributeApi(prototype) {\n if (prototype.setAttribute._polyfilled) {\n return;\n }\n var setAttribute = prototype.setAttribute;\n prototype.setAttribute = function(name, value) {\n changeAttribute.call(this, name, value, setAttribute);\n };\n var removeAttribute = prototype.removeAttribute;\n prototype.removeAttribute = function(name) {\n changeAttribute.call(this, name, null, removeAttribute);\n };\n prototype.setAttribute._polyfilled = true;\n }\n function changeAttribute(name, value, operation) {\n name = name.toLowerCase();\n var oldValue = this.getAttribute(name);\n operation.apply(this, arguments);\n var newValue = this.getAttribute(name);\n if (this.attributeChangedCallback && newValue !== oldValue) {\n this.attributeChangedCallback(name, oldValue, newValue);\n }\n }\n function isReservedTag(name) {\n for (var i = 0; i < reservedTagList.length; i++) {\n if (name === reservedTagList[i]) {\n return true;\n }\n }\n }\n var reservedTagList = [ \"annotation-xml\", \"color-profile\", \"font-face\", \"font-face-src\", \"font-face-uri\", \"font-face-format\", \"font-face-name\", \"missing-glyph\" ];\n function ancestry(extnds) {\n var extendee = getRegisteredDefinition(extnds);\n if (extendee) {\n return ancestry(extendee.extends).concat([ extendee ]);\n }\n return [];\n }\n function resolveTagName(definition) {\n var baseTag = definition.extends;\n for (var i = 0, a; a = definition.ancestry[i]; i++) {\n baseTag = a.is && a.tag;\n }\n definition.tag = baseTag || definition.__name;\n if (baseTag) {\n definition.is = definition.__name;\n }\n }\n function resolvePrototypeChain(definition) {\n if (!Object.__proto__) {\n var nativePrototype = HTMLElement.prototype;\n if (definition.is) {\n var inst = document.createElement(definition.tag);\n nativePrototype = Object.getPrototypeOf(inst);\n }\n var proto = definition.prototype, ancestor;\n var foundPrototype = false;\n while (proto) {\n if (proto == nativePrototype) {\n foundPrototype = true;\n }\n ancestor = Object.getPrototypeOf(proto);\n if (ancestor) {\n proto.__proto__ = ancestor;\n }\n proto = ancestor;\n }\n if (!foundPrototype) {\n console.warn(definition.tag + \" prototype not found in prototype chain for \" + definition.is);\n }\n definition.native = nativePrototype;\n }\n }\n function instantiate(definition) {\n return upgradeWithDefinition(domCreateElement(definition.tag), definition);\n }\n var registry = {};\n function getRegisteredDefinition(name) {\n if (name) {\n return registry[name.toLowerCase()];\n }\n }\n function registerDefinition(name, definition) {\n registry[name] = definition;\n }\n function generateConstructor(definition) {\n return function() {\n return instantiate(definition);\n };\n }\n var HTML_NAMESPACE = \"http://www.w3.org/1999/xhtml\";\n function createElementNS(namespace, tag, typeExtension) {\n if (namespace === HTML_NAMESPACE) {\n return createElement(tag, typeExtension);\n } else {\n return domCreateElementNS(namespace, tag);\n }\n }\n function createElement(tag, typeExtension) {\n if (tag) {\n tag = tag.toLowerCase();\n }\n if (typeExtension) {\n typeExtension = typeExtension.toLowerCase();\n }\n var definition = getRegisteredDefinition(typeExtension || tag);\n if (definition) {\n if (tag == definition.tag && typeExtension == definition.is) {\n return new definition.ctor();\n }\n if (!typeExtension && !definition.is) {\n return new definition.ctor();\n }\n }\n var element;\n if (typeExtension) {\n element = createElement(tag);\n element.setAttribute(\"is\", typeExtension);\n return element;\n }\n element = domCreateElement(tag);\n if (tag.indexOf(\"-\") >= 0) {\n implementPrototype(element, HTMLElement);\n }\n return element;\n }\n var domCreateElement = document.createElement.bind(document);\n var domCreateElementNS = document.createElementNS.bind(document);\n var isInstance;\n if (!Object.__proto__ && !useNative) {\n isInstance = function(obj, ctor) {\n if (obj instanceof ctor) {\n return true;\n }\n var p = obj;\n while (p) {\n if (p === ctor.prototype) {\n return true;\n }\n p = p.__proto__;\n }\n return false;\n };\n } else {\n isInstance = function(obj, base) {\n return obj instanceof base;\n };\n }\n function wrapDomMethodToForceUpgrade(obj, methodName) {\n var orig = obj[methodName];\n obj[methodName] = function() {\n var n = orig.apply(this, arguments);\n upgradeAll(n);\n return n;\n };\n }\n wrapDomMethodToForceUpgrade(Node.prototype, \"cloneNode\");\n wrapDomMethodToForceUpgrade(document, \"importNode\");\n if (isIE11OrOlder) {\n (function() {\n var importNode = document.importNode;\n document.importNode = function() {\n var n = importNode.apply(document, arguments);\n if (n.nodeType == n.DOCUMENT_FRAGMENT_NODE) {\n var f = document.createDocumentFragment();\n f.appendChild(n);\n return f;\n } else {\n return n;\n }\n };\n })();\n }\n document.registerElement = register;\n document.createElement = createElement;\n document.createElementNS = createElementNS;\n scope.registry = registry;\n scope.instanceof = isInstance;\n scope.reservedTagList = reservedTagList;\n scope.getRegisteredDefinition = getRegisteredDefinition;\n document.register = document.registerElement;\n});\n\n(function(scope) {\n var useNative = scope.useNative;\n var initializeModules = scope.initializeModules;\n var isIE11OrOlder = /Trident/.test(navigator.userAgent);\n if (useNative) {\n var nop = function() {};\n scope.watchShadow = nop;\n scope.upgrade = nop;\n scope.upgradeAll = nop;\n scope.upgradeDocumentTree = nop;\n scope.upgradeSubtree = nop;\n scope.takeRecords = nop;\n scope.instanceof = function(obj, base) {\n return obj instanceof base;\n };\n } else {\n initializeModules();\n }\n var upgradeDocumentTree = scope.upgradeDocumentTree;\n var upgradeDocument = scope.upgradeDocument;\n if (!window.wrap) {\n if (window.ShadowDOMPolyfill) {\n window.wrap = window.ShadowDOMPolyfill.wrapIfNeeded;\n window.unwrap = window.ShadowDOMPolyfill.unwrapIfNeeded;\n } else {\n window.wrap = window.unwrap = function(node) {\n return node;\n };\n }\n }\n if (window.HTMLImports) {\n window.HTMLImports.__importsParsingHook = function(elt) {\n if (elt.import) {\n upgradeDocument(wrap(elt.import));\n }\n };\n }\n function bootstrap() {\n upgradeDocumentTree(window.wrap(document));\n window.CustomElements.ready = true;\n requestAnimationFrame(function() {\n setTimeout(function() {\n window.CustomElements.readyTime = Date.now();\n if (window.HTMLImports) {\n window.CustomElements.elapsed = window.CustomElements.readyTime - window.HTMLImports.readyTime;\n }\n document.dispatchEvent(new CustomEvent(\"WebComponentsReady\", {\n bubbles: true\n }));\n });\n });\n }\n if (isIE11OrOlder && typeof window.CustomEvent !== \"function\") {\n window.CustomEvent = function(inType, params) {\n params = params || {};\n var e = document.createEvent(\"CustomEvent\");\n e.initCustomEvent(inType, Boolean(params.bubbles), Boolean(params.cancelable), params.detail);\n e.preventDefault = function() {\n Object.defineProperty(this, \"defaultPrevented\", {\n get: function() {\n return true;\n }\n });\n };\n return e;\n };\n window.CustomEvent.prototype = window.Event.prototype;\n }\n if (document.readyState === \"complete\" || scope.flags.eager) {\n bootstrap();\n } else if (document.readyState === \"interactive\" && !window.attachEvent && (!window.HTMLImports || window.HTMLImports.ready)) {\n bootstrap();\n } else {\n var loadEvent = window.HTMLImports && !window.HTMLImports.ready ? \"HTMLImportsLoaded\" : \"DOMContentLoaded\";\n window.addEventListener(loadEvent, bootstrap);\n }\n scope.isIE11OrOlder = isIE11OrOlder;\n})(window.CustomElements);" }, { "path": "cmd/memlat/static/bower_components/webcomponentsjs/HTMLImports.js", "content": "/**\n * @license\n * Copyright (c) 2014 The Polymer Project Authors. All rights reserved.\n * This code may only be used under the BSD style license found at http://polymer.github.io/LICENSE.txt\n * The complete set of authors may be found at http://polymer.github.io/AUTHORS.txt\n * The complete set of contributors may be found at http://polymer.github.io/CONTRIBUTORS.txt\n * Code distributed by Google as part of the polymer project is also\n * subject to an additional IP rights grant found at http://polymer.github.io/PATENTS.txt\n */\n// @version 0.7.11\nif (typeof WeakMap === \"undefined\") {\n (function() {\n var defineProperty = Object.defineProperty;\n var counter = Date.now() % 1e9;\n var WeakMap = function() {\n this.name = \"__st\" + (Math.random() * 1e9 >>> 0) + (counter++ + \"__\");\n };\n WeakMap.prototype = {\n set: function(key, value) {\n var entry = key[this.name];\n if (entry && entry[0] === key) entry[1] = value; else defineProperty(key, this.name, {\n value: [ key, value ],\n writable: true\n });\n return this;\n },\n get: function(key) {\n var entry;\n return (entry = key[this.name]) && entry[0] === key ? entry[1] : undefined;\n },\n \"delete\": function(key) {\n var entry = key[this.name];\n if (!entry || entry[0] !== key) return false;\n entry[0] = entry[1] = undefined;\n return true;\n },\n has: function(key) {\n var entry = key[this.name];\n if (!entry) return false;\n return entry[0] === key;\n }\n };\n window.WeakMap = WeakMap;\n })();\n}\n\n(function(global) {\n var registrationsTable = new WeakMap();\n var setImmediate;\n if (/Trident|Edge/.test(navigator.userAgent)) {\n setImmediate = setTimeout;\n } else if (window.setImmediate) {\n setImmediate = window.setImmediate;\n } else {\n var setImmediateQueue = [];\n var sentinel = String(Math.random());\n window.addEventListener(\"message\", function(e) {\n if (e.data === sentinel) {\n var queue = setImmediateQueue;\n setImmediateQueue = [];\n queue.forEach(function(func) {\n func();\n });\n }\n });\n setImmediate = function(func) {\n setImmediateQueue.push(func);\n window.postMessage(sentinel, \"*\");\n };\n }\n var isScheduled = false;\n var scheduledObservers = [];\n function scheduleCallback(observer) {\n scheduledObservers.push(observer);\n if (!isScheduled) {\n isScheduled = true;\n setImmediate(dispatchCallbacks);\n }\n }\n function wrapIfNeeded(node) {\n return window.ShadowDOMPolyfill && window.ShadowDOMPolyfill.wrapIfNeeded(node) || node;\n }\n function dispatchCallbacks() {\n isScheduled = false;\n var observers = scheduledObservers;\n scheduledObservers = [];\n observers.sort(function(o1, o2) {\n return o1.uid_ - o2.uid_;\n });\n var anyNonEmpty = false;\n observers.forEach(function(observer) {\n var queue = observer.takeRecords();\n removeTransientObserversFor(observer);\n if (queue.length) {\n observer.callback_(queue, observer);\n anyNonEmpty = true;\n }\n });\n if (anyNonEmpty) dispatchCallbacks();\n }\n function removeTransientObserversFor(observer) {\n observer.nodes_.forEach(function(node) {\n var registrations = registrationsTable.get(node);\n if (!registrations) return;\n registrations.forEach(function(registration) {\n if (registration.observer === observer) registration.removeTransientObservers();\n });\n });\n }\n function forEachAncestorAndObserverEnqueueRecord(target, callback) {\n for (var node = target; node; node = node.parentNode) {\n var registrations = registrationsTable.get(node);\n if (registrations) {\n for (var j = 0; j < registrations.length; j++) {\n var registration = registrations[j];\n var options = registration.options;\n if (node !== target && !options.subtree) continue;\n var record = callback(options);\n if (record) registration.enqueue(record);\n }\n }\n }\n }\n var uidCounter = 0;\n function JsMutationObserver(callback) {\n this.callback_ = callback;\n this.nodes_ = [];\n this.records_ = [];\n this.uid_ = ++uidCounter;\n }\n JsMutationObserver.prototype = {\n observe: function(target, options) {\n target = wrapIfNeeded(target);\n if (!options.childList && !options.attributes && !options.characterData || options.attributeOldValue && !options.attributes || options.attributeFilter && options.attributeFilter.length && !options.attributes || options.characterDataOldValue && !options.characterData) {\n throw new SyntaxError();\n }\n var registrations = registrationsTable.get(target);\n if (!registrations) registrationsTable.set(target, registrations = []);\n var registration;\n for (var i = 0; i < registrations.length; i++) {\n if (registrations[i].observer === this) {\n registration = registrations[i];\n registration.removeListeners();\n registration.options = options;\n break;\n }\n }\n if (!registration) {\n registration = new Registration(this, target, options);\n registrations.push(registration);\n this.nodes_.push(target);\n }\n registration.addListeners();\n },\n disconnect: function() {\n this.nodes_.forEach(function(node) {\n var registrations = registrationsTable.get(node);\n for (var i = 0; i < registrations.length; i++) {\n var registration = registrations[i];\n if (registration.observer === this) {\n registration.removeListeners();\n registrations.splice(i, 1);\n break;\n }\n }\n }, this);\n this.records_ = [];\n },\n takeRecords: function() {\n var copyOfRecords = this.records_;\n this.records_ = [];\n return copyOfRecords;\n }\n };\n function MutationRecord(type, target) {\n this.type = type;\n this.target = target;\n this.addedNodes = [];\n this.removedNodes = [];\n this.previousSibling = null;\n this.nextSibling = null;\n this.attributeName = null;\n this.attributeNamespace = null;\n this.oldValue = null;\n }\n function copyMutationRecord(original) {\n var record = new MutationRecord(original.type, original.target);\n record.addedNodes = original.addedNodes.slice();\n record.removedNodes = original.removedNodes.slice();\n record.previousSibling = original.previousSibling;\n record.nextSibling = original.nextSibling;\n record.attributeName = original.attributeName;\n record.attributeNamespace = original.attributeNamespace;\n record.oldValue = original.oldValue;\n return record;\n }\n var currentRecord, recordWithOldValue;\n function getRecord(type, target) {\n return currentRecord = new MutationRecord(type, target);\n }\n function getRecordWithOldValue(oldValue) {\n if (recordWithOldValue) return recordWithOldValue;\n recordWithOldValue = copyMutationRecord(currentRecord);\n recordWithOldValue.oldValue = oldValue;\n return recordWithOldValue;\n }\n function clearRecords() {\n currentRecord = recordWithOldValue = undefined;\n }\n function recordRepresentsCurrentMutation(record) {\n return record === recordWithOldValue || record === currentRecord;\n }\n function selectRecord(lastRecord, newRecord) {\n if (lastRecord === newRecord) return lastRecord;\n if (recordWithOldValue && recordRepresentsCurrentMutation(lastRecord)) return recordWithOldValue;\n return null;\n }\n function Registration(observer, target, options) {\n this.observer = observer;\n this.target = target;\n this.options = options;\n this.transientObservedNodes = [];\n }\n Registration.prototype = {\n enqueue: function(record) {\n var records = this.observer.records_;\n var length = records.length;\n if (records.length > 0) {\n var lastRecord = records[length - 1];\n var recordToReplaceLast = selectRecord(lastRecord, record);\n if (recordToReplaceLast) {\n records[length - 1] = recordToReplaceLast;\n return;\n }\n } else {\n scheduleCallback(this.observer);\n }\n records[length] = record;\n },\n addListeners: function() {\n this.addListeners_(this.target);\n },\n addListeners_: function(node) {\n var options = this.options;\n if (options.attributes) node.addEventListener(\"DOMAttrModified\", this, true);\n if (options.characterData) node.addEventListener(\"DOMCharacterDataModified\", this, true);\n if (options.childList) node.addEventListener(\"DOMNodeInserted\", this, true);\n if (options.childList || options.subtree) node.addEventListener(\"DOMNodeRemoved\", this, true);\n },\n removeListeners: function() {\n this.removeListeners_(this.target);\n },\n removeListeners_: function(node) {\n var options = this.options;\n if (options.attributes) node.removeEventListener(\"DOMAttrModified\", this, true);\n if (options.characterData) node.removeEventListener(\"DOMCharacterDataModified\", this, true);\n if (options.childList) node.removeEventListener(\"DOMNodeInserted\", this, true);\n if (options.childList || options.subtree) node.removeEventListener(\"DOMNodeRemoved\", this, true);\n },\n addTransientObserver: function(node) {\n if (node === this.target) return;\n this.addListeners_(node);\n this.transientObservedNodes.push(node);\n var registrations = registrationsTable.get(node);\n if (!registrations) registrationsTable.set(node, registrations = []);\n registrations.push(this);\n },\n removeTransientObservers: function() {\n var transientObservedNodes = this.transientObservedNodes;\n this.transientObservedNodes = [];\n transientObservedNodes.forEach(function(node) {\n this.removeListeners_(node);\n var registrations = registrationsTable.get(node);\n for (var i = 0; i < registrations.length; i++) {\n if (registrations[i] === this) {\n registrations.splice(i, 1);\n break;\n }\n }\n }, this);\n },\n handleEvent: function(e) {\n e.stopImmediatePropagation();\n switch (e.type) {\n case \"DOMAttrModified\":\n var name = e.attrName;\n var namespace = e.relatedNode.namespaceURI;\n var target = e.target;\n var record = new getRecord(\"attributes\", target);\n record.attributeName = name;\n record.attributeNamespace = namespace;\n var oldValue = e.attrChange === MutationEvent.ADDITION ? null : e.prevValue;\n forEachAncestorAndObserverEnqueueRecord(target, function(options) {\n if (!options.attributes) return;\n if (options.attributeFilter && options.attributeFilter.length && options.attributeFilter.indexOf(name) === -1 && options.attributeFilter.indexOf(namespace) === -1) {\n return;\n }\n if (options.attributeOldValue) return getRecordWithOldValue(oldValue);\n return record;\n });\n break;\n\n case \"DOMCharacterDataModified\":\n var target = e.target;\n var record = getRecord(\"characterData\", target);\n var oldValue = e.prevValue;\n forEachAncestorAndObserverEnqueueRecord(target, function(options) {\n if (!options.characterData) return;\n if (options.characterDataOldValue) return getRecordWithOldValue(oldValue);\n return record;\n });\n break;\n\n case \"DOMNodeRemoved\":\n this.addTransientObserver(e.target);\n\n case \"DOMNodeInserted\":\n var changedNode = e.target;\n var addedNodes, removedNodes;\n if (e.type === \"DOMNodeInserted\") {\n addedNodes = [ changedNode ];\n removedNodes = [];\n } else {\n addedNodes = [];\n removedNodes = [ changedNode ];\n }\n var previousSibling = changedNode.previousSibling;\n var nextSibling = changedNode.nextSibling;\n var record = getRecord(\"childList\", e.target.parentNode);\n record.addedNodes = addedNodes;\n record.removedNodes = removedNodes;\n record.previousSibling = previousSibling;\n record.nextSibling = nextSibling;\n forEachAncestorAndObserverEnqueueRecord(e.relatedNode, function(options) {\n if (!options.childList) return;\n return record;\n });\n }\n clearRecords();\n }\n };\n global.JsMutationObserver = JsMutationObserver;\n if (!global.MutationObserver) global.MutationObserver = JsMutationObserver;\n})(this);\n\nwindow.HTMLImports = window.HTMLImports || {\n flags: {}\n};\n\n(function(scope) {\n var IMPORT_LINK_TYPE = \"import\";\n var useNative = Boolean(IMPORT_LINK_TYPE in document.createElement(\"link\"));\n var hasShadowDOMPolyfill = Boolean(window.ShadowDOMPolyfill);\n var wrap = function(node) {\n return hasShadowDOMPolyfill ? window.ShadowDOMPolyfill.wrapIfNeeded(node) : node;\n };\n var rootDocument = wrap(document);\n var currentScriptDescriptor = {\n get: function() {\n var script = window.HTMLImports.currentScript || document.currentScript || (document.readyState !== \"complete\" ? document.scripts[document.scripts.length - 1] : null);\n return wrap(script);\n },\n configurable: true\n };\n Object.defineProperty(document, \"_currentScript\", currentScriptDescriptor);\n Object.defineProperty(rootDocument, \"_currentScript\", currentScriptDescriptor);\n var isIE = /Trident/.test(navigator.userAgent);\n function whenReady(callback, doc) {\n doc = doc || rootDocument;\n whenDocumentReady(function() {\n watchImportsLoad(callback, doc);\n }, doc);\n }\n var requiredReadyState = isIE ? \"complete\" : \"interactive\";\n var READY_EVENT = \"readystatechange\";\n function isDocumentReady(doc) {\n return doc.readyState === \"complete\" || doc.readyState === requiredReadyState;\n }\n function whenDocumentReady(callback, doc) {\n if (!isDocumentReady(doc)) {\n var checkReady = function() {\n if (doc.readyState === \"complete\" || doc.readyState === requiredReadyState) {\n doc.removeEventListener(READY_EVENT, checkReady);\n whenDocumentReady(callback, doc);\n }\n };\n doc.addEventListener(READY_EVENT, checkReady);\n } else if (callback) {\n callback();\n }\n }\n function markTargetLoaded(event) {\n event.target.__loaded = true;\n }\n function watchImportsLoad(callback, doc) {\n var imports = doc.querySelectorAll(\"link[rel=import]\");\n var parsedCount = 0, importCount = imports.length, newImports = [], errorImports = [];\n function checkDone() {\n if (parsedCount == importCount && callback) {\n callback({\n allImports: imports,\n loadedImports: newImports,\n errorImports: errorImports\n });\n }\n }\n function loadedImport(e) {\n markTargetLoaded(e);\n newImports.push(this);\n parsedCount++;\n checkDone();\n }\n function errorLoadingImport(e) {\n errorImports.push(this);\n parsedCount++;\n checkDone();\n }\n if (importCount) {\n for (var i = 0, imp; i < importCount && (imp = imports[i]); i++) {\n if (isImportLoaded(imp)) {\n parsedCount++;\n checkDone();\n } else {\n imp.addEventListener(\"load\", loadedImport);\n imp.addEventListener(\"error\", errorLoadingImport);\n }\n }\n } else {\n checkDone();\n }\n }\n function isImportLoaded(link) {\n return useNative ? link.__loaded || link.import && link.import.readyState !== \"loading\" : link.__importParsed;\n }\n if (useNative) {\n new MutationObserver(function(mxns) {\n for (var i = 0, l = mxns.length, m; i < l && (m = mxns[i]); i++) {\n if (m.addedNodes) {\n handleImports(m.addedNodes);\n }\n }\n }).observe(document.head, {\n childList: true\n });\n function handleImports(nodes) {\n for (var i = 0, l = nodes.length, n; i < l && (n = nodes[i]); i++) {\n if (isImport(n)) {\n handleImport(n);\n }\n }\n }\n function isImport(element) {\n return element.localName === \"link\" && element.rel === \"import\";\n }\n function handleImport(element) {\n var loaded = element.import;\n if (loaded) {\n markTargetLoaded({\n target: element\n });\n } else {\n element.addEventListener(\"load\", markTargetLoaded);\n element.addEventListener(\"error\", markTargetLoaded);\n }\n }\n (function() {\n if (document.readyState === \"loading\") {\n var imports = document.querySelectorAll(\"link[rel=import]\");\n for (var i = 0, l = imports.length, imp; i < l && (imp = imports[i]); i++) {\n handleImport(imp);\n }\n }\n })();\n }\n whenReady(function(detail) {\n window.HTMLImports.ready = true;\n window.HTMLImports.readyTime = new Date().getTime();\n var evt = rootDocument.createEvent(\"CustomEvent\");\n evt.initCustomEvent(\"HTMLImportsLoaded\", true, true, detail);\n rootDocument.dispatchEvent(evt);\n });\n scope.IMPORT_LINK_TYPE = IMPORT_LINK_TYPE;\n scope.useNative = useNative;\n scope.rootDocument = rootDocument;\n scope.whenReady = whenReady;\n scope.isIE = isIE;\n})(window.HTMLImports);\n\n(function(scope) {\n var modules = [];\n var addModule = function(module) {\n modules.push(module);\n };\n var initializeModules = function() {\n modules.forEach(function(module) {\n module(scope);\n });\n };\n scope.addModule = addModule;\n scope.initializeModules = initializeModules;\n})(window.HTMLImports);\n\nwindow.HTMLImports.addModule(function(scope) {\n var CSS_URL_REGEXP = /(url\\()([^)]*)(\\))/g;\n var CSS_IMPORT_REGEXP = /(@import[\\s]+(?!url\\())([^;]*)(;)/g;\n var path = {\n resolveUrlsInStyle: function(style, linkUrl) {\n var doc = style.ownerDocument;\n var resolver = doc.createElement(\"a\");\n style.textContent = this.resolveUrlsInCssText(style.textContent, linkUrl, resolver);\n return style;\n },\n resolveUrlsInCssText: function(cssText, linkUrl, urlObj) {\n var r = this.replaceUrls(cssText, urlObj, linkUrl, CSS_URL_REGEXP);\n r = this.replaceUrls(r, urlObj, linkUrl, CSS_IMPORT_REGEXP);\n return r;\n },\n replaceUrls: function(text, urlObj, linkUrl, regexp) {\n return text.replace(regexp, function(m, pre, url, post) {\n var urlPath = url.replace(/[\"']/g, \"\");\n if (linkUrl) {\n urlPath = new URL(urlPath, linkUrl).href;\n }\n urlObj.href = urlPath;\n urlPath = urlObj.href;\n return pre + \"'\" + urlPath + \"'\" + post;\n });\n }\n };\n scope.path = path;\n});\n\nwindow.HTMLImports.addModule(function(scope) {\n var xhr = {\n async: true,\n ok: function(request) {\n return request.status >= 200 && request.status < 300 || request.status === 304 || request.status === 0;\n },\n load: function(url, next, nextContext) {\n var request = new XMLHttpRequest();\n if (scope.flags.debug || scope.flags.bust) {\n url += \"?\" + Math.random();\n }\n request.open(\"GET\", url, xhr.async);\n request.addEventListener(\"readystatechange\", function(e) {\n if (request.readyState === 4) {\n var locationHeader = request.getResponseHeader(\"Location\");\n var redirectedUrl = null;\n if (locationHeader) {\n var redirectedUrl = locationHeader.substr(0, 1) === \"/\" ? location.origin + locationHeader : locationHeader;\n }\n next.call(nextContext, !xhr.ok(request) && request, request.response || request.responseText, redirectedUrl);\n }\n });\n request.send();\n return request;\n },\n loadDocument: function(url, next, nextContext) {\n this.load(url, next, nextContext).responseType = \"document\";\n }\n };\n scope.xhr = xhr;\n});\n\nwindow.HTMLImports.addModule(function(scope) {\n var xhr = scope.xhr;\n var flags = scope.flags;\n var Loader = function(onLoad, onComplete) {\n this.cache = {};\n this.onload = onLoad;\n this.oncomplete = onComplete;\n this.inflight = 0;\n this.pending = {};\n };\n Loader.prototype = {\n addNodes: function(nodes) {\n this.inflight += nodes.length;\n for (var i = 0, l = nodes.length, n; i < l && (n = nodes[i]); i++) {\n this.require(n);\n }\n this.checkDone();\n },\n addNode: function(node) {\n this.inflight++;\n this.require(node);\n this.checkDone();\n },\n require: function(elt) {\n var url = elt.src || elt.href;\n elt.__nodeUrl = url;\n if (!this.dedupe(url, elt)) {\n this.fetch(url, elt);\n }\n },\n dedupe: function(url, elt) {\n if (this.pending[url]) {\n this.pending[url].push(elt);\n return true;\n }\n var resource;\n if (this.cache[url]) {\n this.onload(url, elt, this.cache[url]);\n this.tail();\n return true;\n }\n this.pending[url] = [ elt ];\n return false;\n },\n fetch: function(url, elt) {\n flags.load && console.log(\"fetch\", url, elt);\n if (!url) {\n setTimeout(function() {\n this.receive(url, elt, {\n error: \"href must be specified\"\n }, null);\n }.bind(this), 0);\n } else if (url.match(/^data:/)) {\n var pieces = url.split(\",\");\n var header = pieces[0];\n var body = pieces[1];\n if (header.indexOf(\";base64\") > -1) {\n body = atob(body);\n } else {\n body = decodeURIComponent(body);\n }\n setTimeout(function() {\n this.receive(url, elt, null, body);\n }.bind(this), 0);\n } else {\n var receiveXhr = function(err, resource, redirectedUrl) {\n this.receive(url, elt, err, resource, redirectedUrl);\n }.bind(this);\n xhr.load(url, receiveXhr);\n }\n },\n receive: function(url, elt, err, resource, redirectedUrl) {\n this.cache[url] = resource;\n var $p = this.pending[url];\n for (var i = 0, l = $p.length, p; i < l && (p = $p[i]); i++) {\n this.onload(url, p, resource, err, redirectedUrl);\n this.tail();\n }\n this.pending[url] = null;\n },\n tail: function() {\n --this.inflight;\n this.checkDone();\n },\n checkDone: function() {\n if (!this.inflight) {\n this.oncomplete();\n }\n }\n };\n scope.Loader = Loader;\n});\n\nwindow.HTMLImports.addModule(function(scope) {\n var Observer = function(addCallback) {\n this.addCallback = addCallback;\n this.mo = new MutationObserver(this.handler.bind(this));\n };\n Observer.prototype = {\n handler: function(mutations) {\n for (var i = 0, l = mutations.length, m; i < l && (m = mutations[i]); i++) {\n if (m.type === \"childList\" && m.addedNodes.length) {\n this.addedNodes(m.addedNodes);\n }\n }\n },\n addedNodes: function(nodes) {\n if (this.addCallback) {\n this.addCallback(nodes);\n }\n for (var i = 0, l = nodes.length, n, loading; i < l && (n = nodes[i]); i++) {\n if (n.children && n.children.length) {\n this.addedNodes(n.children);\n }\n }\n },\n observe: function(root) {\n this.mo.observe(root, {\n childList: true,\n subtree: true\n });\n }\n };\n scope.Observer = Observer;\n});\n\nwindow.HTMLImports.addModule(function(scope) {\n var path = scope.path;\n var rootDocument = scope.rootDocument;\n var flags = scope.flags;\n var isIE = scope.isIE;\n var IMPORT_LINK_TYPE = scope.IMPORT_LINK_TYPE;\n var IMPORT_SELECTOR = \"link[rel=\" + IMPORT_LINK_TYPE + \"]\";\n var importParser = {\n documentSelectors: IMPORT_SELECTOR,\n importsSelectors: [ IMPORT_SELECTOR, \"link[rel=stylesheet]:not([type])\", \"style:not([type])\", \"script:not([type])\", 'script[type=\"application/javascript\"]', 'script[type=\"text/javascript\"]' ].join(\",\"),\n map: {\n link: \"parseLink\",\n script: \"parseScript\",\n style: \"parseStyle\"\n },\n dynamicElements: [],\n parseNext: function() {\n var next = this.nextToParse();\n if (next) {\n this.parse(next);\n }\n },\n parse: function(elt) {\n if (this.isParsed(elt)) {\n flags.parse && console.log(\"[%s] is already parsed\", elt.localName);\n return;\n }\n var fn = this[this.map[elt.localName]];\n if (fn) {\n this.markParsing(elt);\n fn.call(this, elt);\n }\n },\n parseDynamic: function(elt, quiet) {\n this.dynamicElements.push(elt);\n if (!quiet) {\n this.parseNext();\n }\n },\n markParsing: function(elt) {\n flags.parse && console.log(\"parsing\", elt);\n this.parsingElement = elt;\n },\n markParsingComplete: function(elt) {\n elt.__importParsed = true;\n this.markDynamicParsingComplete(elt);\n if (elt.__importElement) {\n elt.__importElement.__importParsed = true;\n this.markDynamicParsingComplete(elt.__importElement);\n }\n this.parsingElement = null;\n flags.parse && console.log(\"completed\", elt);\n },\n markDynamicParsingComplete: function(elt) {\n var i = this.dynamicElements.indexOf(elt);\n if (i >= 0) {\n this.dynamicElements.splice(i, 1);\n }\n },\n parseImport: function(elt) {\n elt.import = elt.__doc;\n if (window.HTMLImports.__importsParsingHook) {\n window.HTMLImports.__importsParsingHook(elt);\n }\n if (elt.import) {\n elt.import.__importParsed = true;\n }\n this.markParsingComplete(elt);\n if (elt.__resource && !elt.__error) {\n elt.dispatchEvent(new CustomEvent(\"load\", {\n bubbles: false\n }));\n } else {\n elt.dispatchEvent(new CustomEvent(\"error\", {\n bubbles: false\n }));\n }\n if (elt.__pending) {\n var fn;\n while (elt.__pending.length) {\n fn = elt.__pending.shift();\n if (fn) {\n fn({\n target: elt\n });\n }\n }\n }\n this.parseNext();\n },\n parseLink: function(linkElt) {\n if (nodeIsImport(linkElt)) {\n this.parseImport(linkElt);\n } else {\n linkElt.href = linkElt.href;\n this.parseGeneric(linkElt);\n }\n },\n parseStyle: function(elt) {\n var src = elt;\n elt = cloneStyle(elt);\n src.__appliedElement = elt;\n elt.__importElement = src;\n this.parseGeneric(elt);\n },\n parseGeneric: function(elt) {\n this.trackElement(elt);\n this.addElementToDocument(elt);\n },\n rootImportForElement: function(elt) {\n var n = elt;\n while (n.ownerDocument.__importLink) {\n n = n.ownerDocument.__importLink;\n }\n return n;\n },\n addElementToDocument: function(elt) {\n var port = this.rootImportForElement(elt.__importElement || elt);\n port.parentNode.insertBefore(elt, port);\n },\n trackElement: function(elt, callback) {\n var self = this;\n var done = function(e) {\n elt.removeEventListener(\"load\", done);\n elt.removeEventListener(\"error\", done);\n if (callback) {\n callback(e);\n }\n self.markParsingComplete(elt);\n self.parseNext();\n };\n elt.addEventListener(\"load\", done);\n elt.addEventListener(\"error\", done);\n if (isIE && elt.localName === \"style\") {\n var fakeLoad = false;\n if (elt.textContent.indexOf(\"@import\") == -1) {\n fakeLoad = true;\n } else if (elt.sheet) {\n fakeLoad = true;\n var csr = elt.sheet.cssRules;\n var len = csr ? csr.length : 0;\n for (var i = 0, r; i < len && (r = csr[i]); i++) {\n if (r.type === CSSRule.IMPORT_RULE) {\n fakeLoad = fakeLoad && Boolean(r.styleSheet);\n }\n }\n }\n if (fakeLoad) {\n setTimeout(function() {\n elt.dispatchEvent(new CustomEvent(\"load\", {\n bubbles: false\n }));\n });\n }\n }\n },\n parseScript: function(scriptElt) {\n var script = document.createElement(\"script\");\n script.__importElement = scriptElt;\n script.src = scriptElt.src ? scriptElt.src : generateScriptDataUrl(scriptElt);\n scope.currentScript = scriptElt;\n this.trackElement(script, function(e) {\n if (script.parentNode) {\n script.parentNode.removeChild(script);\n }\n scope.currentScript = null;\n });\n this.addElementToDocument(script);\n },\n nextToParse: function() {\n this._mayParse = [];\n return !this.parsingElement && (this.nextToParseInDoc(rootDocument) || this.nextToParseDynamic());\n },\n nextToParseInDoc: function(doc, link) {\n if (doc && this._mayParse.indexOf(doc) < 0) {\n this._mayParse.push(doc);\n var nodes = doc.querySelectorAll(this.parseSelectorsForNode(doc));\n for (var i = 0, l = nodes.length, p = 0, n; i < l && (n = nodes[i]); i++) {\n if (!this.isParsed(n)) {\n if (this.hasResource(n)) {\n return nodeIsImport(n) ? this.nextToParseInDoc(n.__doc, n) : n;\n } else {\n return;\n }\n }\n }\n }\n return link;\n },\n nextToParseDynamic: function() {\n return this.dynamicElements[0];\n },\n parseSelectorsForNode: function(node) {\n var doc = node.ownerDocument || node;\n return doc === rootDocument ? this.documentSelectors : this.importsSelectors;\n },\n isParsed: function(node) {\n return node.__importParsed;\n },\n needsDynamicParsing: function(elt) {\n return this.dynamicElements.indexOf(elt) >= 0;\n },\n hasResource: function(node) {\n if (nodeIsImport(node) && node.__doc === undefined) {\n return false;\n }\n return true;\n }\n };\n function nodeIsImport(elt) {\n return elt.localName === \"link\" && elt.rel === IMPORT_LINK_TYPE;\n }\n function generateScriptDataUrl(script) {\n var scriptContent = generateScriptContent(script);\n return \"data:text/javascript;charset=utf-8,\" + encodeURIComponent(scriptContent);\n }\n function generateScriptContent(script) {\n return script.textContent + generateSourceMapHint(script);\n }\n function generateSourceMapHint(script) {\n var owner = script.ownerDocument;\n owner.__importedScripts = owner.__importedScripts || 0;\n var moniker = script.ownerDocument.baseURI;\n var num = owner.__importedScripts ? \"-\" + owner.__importedScripts : \"\";\n owner.__importedScripts++;\n return \"\\n//# sourceURL=\" + moniker + num + \".js\\n\";\n }\n function cloneStyle(style) {\n var clone = style.ownerDocument.createElement(\"style\");\n clone.textContent = style.textContent;\n path.resolveUrlsInStyle(clone);\n return clone;\n }\n scope.parser = importParser;\n scope.IMPORT_SELECTOR = IMPORT_SELECTOR;\n});\n\nwindow.HTMLImports.addModule(function(scope) {\n var flags = scope.flags;\n var IMPORT_LINK_TYPE = scope.IMPORT_LINK_TYPE;\n var IMPORT_SELECTOR = scope.IMPORT_SELECTOR;\n var rootDocument = scope.rootDocument;\n var Loader = scope.Loader;\n var Observer = scope.Observer;\n var parser = scope.parser;\n var importer = {\n documents: {},\n documentPreloadSelectors: IMPORT_SELECTOR,\n importsPreloadSelectors: [ IMPORT_SELECTOR ].join(\",\"),\n loadNode: function(node) {\n importLoader.addNode(node);\n },\n loadSubtree: function(parent) {\n var nodes = this.marshalNodes(parent);\n importLoader.addNodes(nodes);\n },\n marshalNodes: function(parent) {\n return parent.querySelectorAll(this.loadSelectorsForNode(parent));\n },\n loadSelectorsForNode: function(node) {\n var doc = node.ownerDocument || node;\n return doc === rootDocument ? this.documentPreloadSelectors : this.importsPreloadSelectors;\n },\n loaded: function(url, elt, resource, err, redirectedUrl) {\n flags.load && console.log(\"loaded\", url, elt);\n elt.__resource = resource;\n elt.__error = err;\n if (isImportLink(elt)) {\n var doc = this.documents[url];\n if (doc === undefined) {\n doc = err ? null : makeDocument(resource, redirectedUrl || url);\n if (doc) {\n doc.__importLink = elt;\n this.bootDocument(doc);\n }\n this.documents[url] = doc;\n }\n elt.__doc = doc;\n }\n parser.parseNext();\n },\n bootDocument: function(doc) {\n this.loadSubtree(doc);\n this.observer.observe(doc);\n parser.parseNext();\n },\n loadedAll: function() {\n parser.parseNext();\n }\n };\n var importLoader = new Loader(importer.loaded.bind(importer), importer.loadedAll.bind(importer));\n importer.observer = new Observer();\n function isImportLink(elt) {\n return isLinkRel(elt, IMPORT_LINK_TYPE);\n }\n function isLinkRel(elt, rel) {\n return elt.localName === \"link\" && elt.getAttribute(\"rel\") === rel;\n }\n function hasBaseURIAccessor(doc) {\n return !!Object.getOwnPropertyDescriptor(doc, \"baseURI\");\n }\n function makeDocument(resource, url) {\n var doc = document.implementation.createHTMLDocument(IMPORT_LINK_TYPE);\n doc._URL = url;\n var base = doc.createElement(\"base\");\n base.setAttribute(\"href\", url);\n if (!doc.baseURI && !hasBaseURIAccessor(doc)) {\n Object.defineProperty(doc, \"baseURI\", {\n value: url\n });\n }\n var meta = doc.createElement(\"meta\");\n meta.setAttribute(\"charset\", \"utf-8\");\n doc.head.appendChild(meta);\n doc.head.appendChild(base);\n doc.body.innerHTML = resource;\n if (window.HTMLTemplateElement && HTMLTemplateElement.bootstrap) {\n HTMLTemplateElement.bootstrap(doc);\n }\n return doc;\n }\n if (!document.baseURI) {\n var baseURIDescriptor = {\n get: function() {\n var base = document.querySelector(\"base\");\n return base ? base.href : window.location.href;\n },\n configurable: true\n };\n Object.defineProperty(document, \"baseURI\", baseURIDescriptor);\n Object.defineProperty(rootDocument, \"baseURI\", baseURIDescriptor);\n }\n scope.importer = importer;\n scope.importLoader = importLoader;\n});\n\nwindow.HTMLImports.addModule(function(scope) {\n var parser = scope.parser;\n var importer = scope.importer;\n var dynamic = {\n added: function(nodes) {\n var owner, parsed, loading;\n for (var i = 0, l = nodes.length, n; i < l && (n = nodes[i]); i++) {\n if (!owner) {\n owner = n.ownerDocument;\n parsed = parser.isParsed(owner);\n }\n loading = this.shouldLoadNode(n);\n if (loading) {\n importer.loadNode(n);\n }\n if (this.shouldParseNode(n) && parsed) {\n parser.parseDynamic(n, loading);\n }\n }\n },\n shouldLoadNode: function(node) {\n return node.nodeType === 1 && matches.call(node, importer.loadSelectorsForNode(node));\n },\n shouldParseNode: function(node) {\n return node.nodeType === 1 && matches.call(node, parser.parseSelectorsForNode(node));\n }\n };\n importer.observer.addCallback = dynamic.added.bind(dynamic);\n var matches = HTMLElement.prototype.matches || HTMLElement.prototype.matchesSelector || HTMLElement.prototype.webkitMatchesSelector || HTMLElement.prototype.mozMatchesSelector || HTMLElement.prototype.msMatchesSelector;\n});\n\n(function(scope) {\n var initializeModules = scope.initializeModules;\n var isIE = scope.isIE;\n if (scope.useNative) {\n return;\n }\n if (isIE && typeof window.CustomEvent !== \"function\") {\n window.CustomEvent = function(inType, params) {\n params = params || {};\n var e = document.createEvent(\"CustomEvent\");\n e.initCustomEvent(inType, Boolean(params.bubbles), Boolean(params.cancelable), params.detail);\n e.preventDefault = function() {\n Object.defineProperty(this, \"defaultPrevented\", {\n get: function() {\n return true;\n }\n });\n };\n return e;\n };\n window.CustomEvent.prototype = window.Event.prototype;\n }\n initializeModules();\n var rootDocument = scope.rootDocument;\n function bootstrap() {\n window.HTMLImports.importer.bootDocument(rootDocument);\n }\n if (document.readyState === \"complete\" || document.readyState === \"interactive\" && !window.attachEvent) {\n bootstrap();\n } else {\n document.addEventListener(\"DOMContentLoaded\", bootstrap);\n }\n})(window.HTMLImports);" }, { "path": "cmd/memlat/static/bower_components/webcomponentsjs/MutationObserver.js", "content": "/**\n * @license\n * Copyright (c) 2014 The Polymer Project Authors. All rights reserved.\n * This code may only be used under the BSD style license found at http://polymer.github.io/LICENSE.txt\n * The complete set of authors may be found at http://polymer.github.io/AUTHORS.txt\n * The complete set of contributors may be found at http://polymer.github.io/CONTRIBUTORS.txt\n * Code distributed by Google as part of the polymer project is also\n * subject to an additional IP rights grant found at http://polymer.github.io/PATENTS.txt\n */\n// @version 0.7.11\nif (typeof WeakMap === \"undefined\") {\n (function() {\n var defineProperty = Object.defineProperty;\n var counter = Date.now() % 1e9;\n var WeakMap = function() {\n this.name = \"__st\" + (Math.random() * 1e9 >>> 0) + (counter++ + \"__\");\n };\n WeakMap.prototype = {\n set: function(key, value) {\n var entry = key[this.name];\n if (entry && entry[0] === key) entry[1] = value; else defineProperty(key, this.name, {\n value: [ key, value ],\n writable: true\n });\n return this;\n },\n get: function(key) {\n var entry;\n return (entry = key[this.name]) && entry[0] === key ? entry[1] : undefined;\n },\n \"delete\": function(key) {\n var entry = key[this.name];\n if (!entry || entry[0] !== key) return false;\n entry[0] = entry[1] = undefined;\n return true;\n },\n has: function(key) {\n var entry = key[this.name];\n if (!entry) return false;\n return entry[0] === key;\n }\n };\n window.WeakMap = WeakMap;\n })();\n}\n\n(function(global) {\n var registrationsTable = new WeakMap();\n var setImmediate;\n if (/Trident|Edge/.test(navigator.userAgent)) {\n setImmediate = setTimeout;\n } else if (window.setImmediate) {\n setImmediate = window.setImmediate;\n } else {\n var setImmediateQueue = [];\n var sentinel = String(Math.random());\n window.addEventListener(\"message\", function(e) {\n if (e.data === sentinel) {\n var queue = setImmediateQueue;\n setImmediateQueue = [];\n queue.forEach(function(func) {\n func();\n });\n }\n });\n setImmediate = function(func) {\n setImmediateQueue.push(func);\n window.postMessage(sentinel, \"*\");\n };\n }\n var isScheduled = false;\n var scheduledObservers = [];\n function scheduleCallback(observer) {\n scheduledObservers.push(observer);\n if (!isScheduled) {\n isScheduled = true;\n setImmediate(dispatchCallbacks);\n }\n }\n function wrapIfNeeded(node) {\n return window.ShadowDOMPolyfill && window.ShadowDOMPolyfill.wrapIfNeeded(node) || node;\n }\n function dispatchCallbacks() {\n isScheduled = false;\n var observers = scheduledObservers;\n scheduledObservers = [];\n observers.sort(function(o1, o2) {\n return o1.uid_ - o2.uid_;\n });\n var anyNonEmpty = false;\n observers.forEach(function(observer) {\n var queue = observer.takeRecords();\n removeTransientObserversFor(observer);\n if (queue.length) {\n observer.callback_(queue, observer);\n anyNonEmpty = true;\n }\n });\n if (anyNonEmpty) dispatchCallbacks();\n }\n function removeTransientObserversFor(observer) {\n observer.nodes_.forEach(function(node) {\n var registrations = registrationsTable.get(node);\n if (!registrations) return;\n registrations.forEach(function(registration) {\n if (registration.observer === observer) registration.removeTransientObservers();\n });\n });\n }\n function forEachAncestorAndObserverEnqueueRecord(target, callback) {\n for (var node = target; node; node = node.parentNode) {\n var registrations = registrationsTable.get(node);\n if (registrations) {\n for (var j = 0; j < registrations.length; j++) {\n var registration = registrations[j];\n var options = registration.options;\n if (node !== target && !options.subtree) continue;\n var record = callback(options);\n if (record) registration.enqueue(record);\n }\n }\n }\n }\n var uidCounter = 0;\n function JsMutationObserver(callback) {\n this.callback_ = callback;\n this.nodes_ = [];\n this.records_ = [];\n this.uid_ = ++uidCounter;\n }\n JsMutationObserver.prototype = {\n observe: function(target, options) {\n target = wrapIfNeeded(target);\n if (!options.childList && !options.attributes && !options.characterData || options.attributeOldValue && !options.attributes || options.attributeFilter && options.attributeFilter.length && !options.attributes || options.characterDataOldValue && !options.characterData) {\n throw new SyntaxError();\n }\n var registrations = registrationsTable.get(target);\n if (!registrations) registrationsTable.set(target, registrations = []);\n var registration;\n for (var i = 0; i < registrations.length; i++) {\n if (registrations[i].observer === this) {\n registration = registrations[i];\n registration.removeListeners();\n registration.options = options;\n break;\n }\n }\n if (!registration) {\n registration = new Registration(this, target, options);\n registrations.push(registration);\n this.nodes_.push(target);\n }\n registration.addListeners();\n },\n disconnect: function() {\n this.nodes_.forEach(function(node) {\n var registrations = registrationsTable.get(node);\n for (var i = 0; i < registrations.length; i++) {\n var registration = registrations[i];\n if (registration.observer === this) {\n registration.removeListeners();\n registrations.splice(i, 1);\n break;\n }\n }\n }, this);\n this.records_ = [];\n },\n takeRecords: function() {\n var copyOfRecords = this.records_;\n this.records_ = [];\n return copyOfRecords;\n }\n };\n function MutationRecord(type, target) {\n this.type = type;\n this.target = target;\n this.addedNodes = [];\n this.removedNodes = [];\n this.previousSibling = null;\n this.nextSibling = null;\n this.attributeName = null;\n this.attributeNamespace = null;\n this.oldValue = null;\n }\n function copyMutationRecord(original) {\n var record = new MutationRecord(original.type, original.target);\n record.addedNodes = original.addedNodes.slice();\n record.removedNodes = original.removedNodes.slice();\n record.previousSibling = original.previousSibling;\n record.nextSibling = original.nextSibling;\n record.attributeName = original.attributeName;\n record.attributeNamespace = original.attributeNamespace;\n record.oldValue = original.oldValue;\n return record;\n }\n var currentRecord, recordWithOldValue;\n function getRecord(type, target) {\n return currentRecord = new MutationRecord(type, target);\n }\n function getRecordWithOldValue(oldValue) {\n if (recordWithOldValue) return recordWithOldValue;\n recordWithOldValue = copyMutationRecord(currentRecord);\n recordWithOldValue.oldValue = oldValue;\n return recordWithOldValue;\n }\n function clearRecords() {\n currentRecord = recordWithOldValue = undefined;\n }\n function recordRepresentsCurrentMutation(record) {\n return record === recordWithOldValue || record === currentRecord;\n }\n function selectRecord(lastRecord, newRecord) {\n if (lastRecord === newRecord) return lastRecord;\n if (recordWithOldValue && recordRepresentsCurrentMutation(lastRecord)) return recordWithOldValue;\n return null;\n }\n function Registration(observer, target, options) {\n this.observer = observer;\n this.target = target;\n this.options = options;\n this.transientObservedNodes = [];\n }\n Registration.prototype = {\n enqueue: function(record) {\n var records = this.observer.records_;\n var length = records.length;\n if (records.length > 0) {\n var lastRecord = records[length - 1];\n var recordToReplaceLast = selectRecord(lastRecord, record);\n if (recordToReplaceLast) {\n records[length - 1] = recordToReplaceLast;\n return;\n }\n } else {\n scheduleCallback(this.observer);\n }\n records[length] = record;\n },\n addListeners: function() {\n this.addListeners_(this.target);\n },\n addListeners_: function(node) {\n var options = this.options;\n if (options.attributes) node.addEventListener(\"DOMAttrModified\", this, true);\n if (options.characterData) node.addEventListener(\"DOMCharacterDataModified\", this, true);\n if (options.childList) node.addEventListener(\"DOMNodeInserted\", this, true);\n if (options.childList || options.subtree) node.addEventListener(\"DOMNodeRemoved\", this, true);\n },\n removeListeners: function() {\n this.removeListeners_(this.target);\n },\n removeListeners_: function(node) {\n var options = this.options;\n if (options.attributes) node.removeEventListener(\"DOMAttrModified\", this, true);\n if (options.characterData) node.removeEventListener(\"DOMCharacterDataModified\", this, true);\n if (options.childList) node.removeEventListener(\"DOMNodeInserted\", this, true);\n if (options.childList || options.subtree) node.removeEventListener(\"DOMNodeRemoved\", this, true);\n },\n addTransientObserver: function(node) {\n if (node === this.target) return;\n this.addListeners_(node);\n this.transientObservedNodes.push(node);\n var registrations = registrationsTable.get(node);\n if (!registrations) registrationsTable.set(node, registrations = []);\n registrations.push(this);\n },\n removeTransientObservers: function() {\n var transientObservedNodes = this.transientObservedNodes;\n this.transientObservedNodes = [];\n transientObservedNodes.forEach(function(node) {\n this.removeListeners_(node);\n var registrations = registrationsTable.get(node);\n for (var i = 0; i < registrations.length; i++) {\n if (registrations[i] === this) {\n registrations.splice(i, 1);\n break;\n }\n }\n }, this);\n },\n handleEvent: function(e) {\n e.stopImmediatePropagation();\n switch (e.type) {\n case \"DOMAttrModified\":\n var name = e.attrName;\n var namespace = e.relatedNode.namespaceURI;\n var target = e.target;\n var record = new getRecord(\"attributes\", target);\n record.attributeName = name;\n record.attributeNamespace = namespace;\n var oldValue = e.attrChange === MutationEvent.ADDITION ? null : e.prevValue;\n forEachAncestorAndObserverEnqueueRecord(target, function(options) {\n if (!options.attributes) return;\n if (options.attributeFilter && options.attributeFilter.length && options.attributeFilter.indexOf(name) === -1 && options.attributeFilter.indexOf(namespace) === -1) {\n return;\n }\n if (options.attributeOldValue) return getRecordWithOldValue(oldValue);\n return record;\n });\n break;\n\n case \"DOMCharacterDataModified\":\n var target = e.target;\n var record = getRecord(\"characterData\", target);\n var oldValue = e.prevValue;\n forEachAncestorAndObserverEnqueueRecord(target, function(options) {\n if (!options.characterData) return;\n if (options.characterDataOldValue) return getRecordWithOldValue(oldValue);\n return record;\n });\n break;\n\n case \"DOMNodeRemoved\":\n this.addTransientObserver(e.target);\n\n case \"DOMNodeInserted\":\n var changedNode = e.target;\n var addedNodes, removedNodes;\n if (e.type === \"DOMNodeInserted\") {\n addedNodes = [ changedNode ];\n removedNodes = [];\n } else {\n addedNodes = [];\n removedNodes = [ changedNode ];\n }\n var previousSibling = changedNode.previousSibling;\n var nextSibling = changedNode.nextSibling;\n var record = getRecord(\"childList\", e.target.parentNode);\n record.addedNodes = addedNodes;\n record.removedNodes = removedNodes;\n record.previousSibling = previousSibling;\n record.nextSibling = nextSibling;\n forEachAncestorAndObserverEnqueueRecord(e.relatedNode, function(options) {\n if (!options.childList) return;\n return record;\n });\n }\n clearRecords();\n }\n };\n global.JsMutationObserver = JsMutationObserver;\n if (!global.MutationObserver) global.MutationObserver = JsMutationObserver;\n})(this);" }, { "path": "cmd/memlat/static/bower_components/webcomponentsjs/README.md", "content": "webcomponents.js\n================\n\n[![Join the chat at https://gitter.im/webcomponents/webcomponentsjs](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/webcomponents/webcomponentsjs?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)\n\nA suite of polyfills supporting the [Web Components](http://webcomponents.org) specs:\n\n**Custom Elements**: allows authors to define their own custom tags ([spec](https://w3c.github.io/webcomponents/spec/custom/)).\n\n**HTML Imports**: a way to include and reuse HTML documents via other HTML documents ([spec](https://w3c.github.io/webcomponents/spec/imports/)).\n\n**Shadow DOM**: provides encapsulation by hiding DOM subtrees under shadow roots ([spec](https://w3c.github.io/webcomponents/spec/shadow/)).\n\nThis also folds in polyfills for `MutationObserver` and `WeakMap`.\n\n\n## Releases\n\nPre-built (concatenated & minified) versions of the polyfills are maintained in the [tagged versions](https://github.com/webcomponents/webcomponentsjs/releases) of this repo. There are two variants:\n\n`webcomponents.js` includes all of the polyfills.\n\n`webcomponents-lite.js` includes all polyfills except for shadow DOM.\n\n\n## Browser Support\n\nOur polyfills are intended to work in the latest versions of evergreen browsers. See below\nfor our complete browser support matrix:\n\n| Polyfill | IE10 | IE11+ | Chrome* | Firefox* | Safari 7+* | Chrome Android* | Mobile Safari* |\n| ---------- |:----:|:-----:|:-------:|:--------:|:----------:|:---------------:|:--------------:|\n| Custom Elements | ~ | ✓ | ✓ | ✓ | ✓ | ✓| ✓ |\n| HTML Imports | ~ | ✓ | ✓ | ✓ | ✓| ✓| ✓ |\n| Shadow DOM | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ |\n| Templates | ✓ | ✓ | ✓ | ✓| ✓ | ✓ | ✓ |\n\n\n*Indicates the current version of the browser\n\n~Indicates support may be flaky. If using Custom Elements or HTML Imports with Shadow DOM,\nyou will get the non-flaky Mutation Observer polyfill that Shadow DOM includes.\n\nThe polyfills may work in older browsers, however require additional polyfills (such as classList)\nto be used. We cannot guarantee support for browsers outside of our compatibility matrix.\n\n\n### Manually Building\n\nIf you wish to build the polyfills yourself, you'll need `node` and `gulp` on your system:\n\n * install [node.js](http://nodejs.org/) using the instructions on their website\n * use `npm` to install [gulp.js](http://gulpjs.com/): `npm install -g gulp`\n\nNow you are ready to build the polyfills with:\n\n # install dependencies\n npm install\n # build\n gulp build\n\nThe builds will be placed into the `dist/` directory.\n\n## Contribute\n\nSee the [contributing guide](CONTRIBUTING.md)\n\n## License\n\nEverything in this repository is BSD style license unless otherwise specified.\n\nCopyright (c) 2015 The Polymer Authors. All rights reserved.\n\n## Helper utilities\n\n### `WebComponentsReady`\n\nUnder native HTML Imports, `\n \n \n \n \n \n \n \n\n" }, { "path": "cmd/memlat/static/memlat-browser.html", "content": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n \n\n \n\n \n\n\n\n\n \n\n \n\n \n\n \n\n\n\n\n \n\n \n\n \n\n \n\n\n\n\n \n\n \n\n \n\n \n\n\n\n\n \n\n \n\n \n\n \n\n \n\n\n\n\n \n\n \n\n \n\n\n\n\n \n\n \n\n \n\n \n\n\n" }, { "path": "cmd/perfdump/main.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Command perfdump prints the raw contents of a perf.data profile.\npackage main\n\nimport (\n\t\"flag\"\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"reflect\"\n\n\t\"github.com/aclements/go-perf/perffile\"\n)\n\nfunc main() {\n\tvar (\n\t\tflagInput = flag.String(\"i\", \"perf.data\", \"input perf.data `file`\")\n\t\tflagOrder = flag.String(\"order\", \"time\", \"sort `order`; one of: file, time, causal\")\n\t)\n\tflag.Parse()\n\torder, ok := parseOrder(*flagOrder)\n\tif flag.NArg() > 0 || !ok {\n\t\tflag.Usage()\n\t\tos.Exit(1)\n\t}\n\n\tf, err := perffile.Open(*flagInput)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer f.Close()\n\n\tfmt.Printf(\"events:\\n\")\n\tfor _, event := range f.Events {\n\t\tfmt.Printf(\" %p=%+v\\n\", event, *event)\n\t}\n\n\tif f.Meta.BuildIDs != nil {\n\t\tfmt.Printf(\"build IDs:\\n\")\n\t\tfor _, bid := range f.Meta.BuildIDs {\n\t\t\tfmt.Printf(\" %v\\n\", bid)\n\t\t}\n\t}\n\n\tfor _, hdr := range []struct {\n\t\tlabel string\n\t\tval interface{}\n\t}{\n\t\t//{\"build IDs\", &f.Meta.BuildIDs},\n\t\t{\"hostname\", f.Meta.Hostname},\n\t\t{\"OS release\", f.Meta.OSRelease},\n\t\t{\"version\", f.Meta.Version},\n\t\t{\"arch\", f.Meta.Arch},\n\t\t{\"CPUs online\", f.Meta.CPUsOnline},\n\t\t{\"CPUs available\", f.Meta.CPUsAvail},\n\t\t{\"CPU desc\", f.Meta.CPUDesc},\n\t\t{\"CPUID\", f.Meta.CPUID},\n\t\t{\"total memory\", f.Meta.TotalMem},\n\t\t{\"cmdline\", f.Meta.CmdLine},\n\t\t{\"core groups\", f.Meta.CoreGroups},\n\t\t{\"thread groups\", f.Meta.ThreadGroups},\n\t\t{\"NUMA nodes\", f.Meta.NUMANodes},\n\t\t{\"PMU mappings\", f.Meta.PMUMappings},\n\t\t{\"groups\", f.Meta.Groups},\n\t} {\n\t\tif hdr.val == reflect.Zero(reflect.ValueOf(hdr.val).Type()) {\n\t\t\tcontinue\n\t\t}\n\t\tfmt.Printf(\"%s: %v\\n\", hdr.label, hdr.val)\n\t}\n\n\tfmt.Println()\n\n\trs := f.Records(order)\n\tfor rs.Next() {\n\t\tfmt.Printf(\"%v{\\n\", rs.Record.Type())\n\t\tswitch r := rs.Record.(type) {\n\t\tcase *perffile.RecordSample:\n\t\t\tv := reflect.ValueOf(r).Elem()\n\t\t\tfor _, n := range r.Fields() {\n\t\t\t\tf := v.FieldByName(n)\n\t\t\t\tfmt.Printf(\"\\t%s,\\n\", fmtVal(n, f))\n\t\t\t}\n\t\tdefault:\n\t\t\tprintFields(reflect.ValueOf(r))\n\t\t}\n\t\tfmt.Printf(\"}\\n\")\n\n\t\t//fmt.Printf(\"%v %+v\\n\", rs.Record.Type(), rs.Record)\n\t}\n\tif err := rs.Err(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n\nfunc parseOrder(order string) (perffile.RecordsOrder, bool) {\n\tswitch order {\n\tcase \"file\":\n\t\treturn perffile.RecordsFileOrder, true\n\tcase \"time\":\n\t\treturn perffile.RecordsTimeOrder, true\n\tcase \"causal\":\n\t\treturn perffile.RecordsCausalOrder, true\n\t}\n\treturn 0, false\n}\n\nfunc printFields(v reflect.Value) {\n\tfor v.Kind() == reflect.Ptr {\n\t\tv = v.Elem()\n\t}\n\tt := v.Type()\n\tfor i := 0; i < t.NumField(); i++ {\n\t\tinfo := t.Field(i)\n\t\tf := v.Field(i)\n\t\tif info.Anonymous {\n\t\t\tprintFields(f)\n\t\t} else if (f.Kind() == reflect.Ptr || f.Kind() == reflect.Slice) && f.IsNil() {\n\t\t\t// Skip\n\t\t} else {\n\t\t\tfmt.Printf(\"\\t%s,\\n\", fmtVal(info.Name, f))\n\t\t}\n\t}\n}\n\nfunc fmtVal(name string, v reflect.Value) string {\n\tif v.Kind() == reflect.Ptr {\n\t\treturn fmt.Sprintf(\"%-14s %p\", name+\":\", v.Interface())\n\t}\n\tswitch name {\n\tcase \"IP\", \"Addr\", \"Callchain\":\n\t\treturn fmt.Sprintf(\"%-14s %#x\", name+\":\", v.Interface())\n\t}\n\treturn fmt.Sprintf(\"%-14s %+v\", name+\":\", v.Interface())\n}\n" }, { "path": "cmd/prologuer/main.go", "content": "// Copyright 2019 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Command prologuer reports what fraction of samples from a profile\n// are from IPs marked as function prologue in DWARF line tables.\n//\n// In Go binaries (as of Go 1.12), this counts the stack bounds check\n// up to and including the conditional branch to morestack. It does\n// not the instructions that call morestack or the instructions that\n// create a function's stack frame.\n//\n// This is best used with precise profile samples, such as\n//\n// perf record -e cycles:ppp -- \npackage main\n\nimport (\n\t\"debug/dwarf\"\n\t\"debug/elf\"\n\t\"flag\"\n\t\"fmt\"\n\t\"io\"\n\t\"log\"\n\t\"os\"\n\t\"sort\"\n\n\t\"github.com/aclements/go-perf/perffile\"\n\t\"github.com/aclements/go-perf/perfsession\"\n)\n\nfunc main() {\n\tvar flagInput = flag.String(\"i\", \"perf.data\", \"input perf.data `file`\")\n\tflag.Parse()\n\tif flag.NArg() > 0 {\n\t\tflag.Usage()\n\t\tos.Exit(1)\n\t}\n\n\tf, err := perffile.Open(*flagInput)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer f.Close()\n\n\ts := perfsession.New(f)\n\n\tvar samples, prologueSamples uint64\n\trs := f.Records(perffile.RecordsFileOrder)\n\tfor rs.Next() {\n\t\ts.Update(rs.Record)\n\n\t\tswitch r := rs.Record.(type) {\n\t\tcase *perffile.RecordSample:\n\t\t\tpidInfo := s.LookupPID(r.PID)\n\t\t\tmmap := pidInfo.LookupMmap(r.IP)\n\t\t\tif mmap == nil {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tsamples++\n\t\t\tpr := prologueRanges(s, mmap)\n\t\t\tif _, _, _, ok := pr.Get(r.IP); ok {\n\t\t\t\tprologueSamples++\n\t\t\t}\n\t\t}\n\t}\n\n\tfmt.Printf(\"%d of %d samples (%.2f%%) in prologue\\n\", prologueSamples, samples, float64(prologueSamples)*100/float64(samples))\n}\n\nvar prologueRangesKey = perfsession.NewExtraKey(\"prologuer.prologueRanges\")\n\nfunc prologueRanges(session *perfsession.Session, mmap *perfsession.Mmap) *perfsession.Ranges {\n\tfileTab, ok := session.Extra[prologueRangesKey].(map[string]*perfsession.Ranges)\n\tif !ok {\n\t\tfileTab = make(map[string]*perfsession.Ranges)\n\t\tsession.Extra[prologueRangesKey] = fileTab\n\t}\n\tfilename := mmap.Filename\n\tif r, ok := fileTab[filename]; ok {\n\t\treturn r\n\t}\n\n\tif len(filename) > 0 && filename[0] == '[' {\n\t\t// Not a real file.\n\t\treturn nil\n\t}\n\n\tr := new(perfsession.Ranges)\n\tfileTab[filename] = r\n\n\telff, err := elf.Open(filename)\n\tif err != nil {\n\t\tlog.Printf(\"error loading ELF file %s: %s\", filename, err)\n\t\treturn r\n\t}\n\tdefer elff.Close()\n\n\tif elff.Section(\".debug_info\") == nil && elff.Section(\".zdebug_info\") == nil {\n\t\t// No DWARF info.\n\t\treturn r\n\t}\n\n\tdwarff, err := elff.DWARF()\n\tif err != nil {\n\t\tlog.Printf(\"error loading DWARF from %s: %s\", filename, err)\n\t\treturn r\n\t}\n\n\tpb, cb := fillRanges(r, dwarff)\n\tfmt.Printf(\"%s: %d of %d bytes (%.2f%%) in prologue\\n\", filename, pb, cb, float64(pb)*100/float64(cb))\n\n\treturn r\n}\n\nfunc fillRanges(r *perfsession.Ranges, dwarff *dwarf.Data) (prologueBytes, codeBytes uint64) {\n\tdr := dwarff.Reader()\n\tfor {\n\t\tent, err := dr.Next()\n\t\tif ent == nil || err != nil {\n\t\t\tbreak\n\t\t}\n\n\t\tswitch ent.Tag {\n\t\tdefault:\n\t\t\tdr.SkipChildren()\n\n\t\tcase dwarf.TagModule, dwarf.TagNamespace:\n\t\t\tbreak\n\n\t\tcase dwarf.TagCompileUnit:\n\t\t\tpend := prologueEndPCs(dwarff, ent)\n\n\t\t\t// Process functions in this CU.\n\t\t\tvar funcRanges [][2]uint64\n\t\tcu:\n\t\t\tfor {\n\t\t\t\tent, err = dr.Next()\n\t\t\t\tif ent == nil || err != nil {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\n\t\t\t\tswitch ent.Tag {\n\t\t\t\tcase 0:\n\t\t\t\t\t// End of children of the CU.\n\t\t\t\t\tbreak cu\n\n\t\t\t\tdefault:\n\t\t\t\t\tdr.SkipChildren()\n\n\t\t\t\tcase dwarf.TagSubprogram:\n\t\t\t\t\tdr.SkipChildren()\n\t\t\t\t\tfr, err := dwarff.Ranges(ent)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\tlog.Fatal(err)\n\t\t\t\t\t}\n\t\t\t\t\tfuncRanges = append(funcRanges, fr...)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor _, fr := range funcRanges {\n\t\t\t\tcodeBytes += fr[1] - fr[0]\n\t\t\t}\n\n\t\t\t// Match function ranges against prologue ends.\n\t\t\tsort.Slice(funcRanges, func(i, j int) bool {\n\t\t\t\treturn funcRanges[i][0] < funcRanges[j][0]\n\t\t\t})\n\t\t\tfor len(pend) > 0 && len(funcRanges) > 0 {\n\t\t\t\tif pend[0] < funcRanges[0][0] {\n\t\t\t\t\tpend = pend[1:]\n\t\t\t\t} else if pend[0] >= funcRanges[0][1] {\n\t\t\t\t\tfuncRanges = funcRanges[1:]\n\t\t\t\t} else {\n\t\t\t\t\tr.Add(funcRanges[0][0], pend[0], nil)\n\t\t\t\t\tprologueBytes += pend[0] - funcRanges[0][0]\n\t\t\t\t\tpend = pend[1:]\n\t\t\t\t\tfuncRanges = funcRanges[1:]\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\nfunc prologueEndPCs(dwarff *dwarf.Data, cu *dwarf.Entry) []uint64 {\n\t// Decode CU's line table to find prologue end\n\t// PCs\n\tvar pend []uint64\n\tlr, err := dwarff.LineReader(cu)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t} else if lr == nil {\n\t\treturn nil\n\t}\n\n\tfor {\n\t\tvar lent dwarf.LineEntry\n\t\terr := lr.Next(&lent)\n\t\tif err != nil {\n\t\t\tif err == io.EOF {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tlog.Fatal(err)\n\t\t}\n\t\tif lent.PrologueEnd {\n\t\t\tpend = append(pend, lent.Address)\n\t\t}\n\t}\n\n\treturn pend\n}\n" }, { "path": "fmt_test.go", "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"io/fs\"\n\t\"os\"\n\t\"os/exec\"\n\t\"path/filepath\"\n\t\"strings\"\n\t\"testing\"\n)\n\n// TestGofmt tests that all files are formatted.\nfunc TestGofmt(t *testing.T) {\n\troot, fileMap := copyTree(t)\n\n\tgofmt := exec.Command(\"gofmt\", \"-w\", \".\")\n\tgofmt.Dir = root\n\tgofmt.Stdout, gofmt.Stderr = os.Stdout, os.Stderr\n\tif err := gofmt.Run(); err != nil {\n\t\tt.Fatalf(\"gofmt failed: %v\", err)\n\t}\n\n\t// Diff the trees.\n\tif diffFiles(t, fileMap) {\n\t\tt.Errorf(\"Files are not gofmt clean. Please run gofmt.\")\n\t}\n}\n\n// TestGenerated tests that all generated files are up-to-date.\nfunc TestGenerated(t *testing.T) {\n\troot, fileMap := copyTree(t)\n\n\t// Build bitstringer\n\tbuild := exec.Command(\"go\", \"build\")\n\tbuild.Dir = filepath.Join(root, \"cmd/bitstringer\")\n\tbuild.Stdout, build.Stderr = os.Stdout, os.Stderr\n\tif err := build.Run(); err != nil {\n\t\tt.Fatalf(\"go build failed: %v\", err)\n\t}\n\n\tgen := exec.Command(\"go\", \"generate\", \"./...\")\n\tgen.Dir = root\n\tgen.Stdout, gen.Stderr = os.Stdout, os.Stderr\n\tif err := gen.Run(); err != nil {\n\t\tt.Fatalf(\"go generate failed: %v\", err)\n\t}\n\n\t// Diff the trees.\n\tif diffFiles(t, fileMap) {\n\t\tt.Errorf(\"Please run go generate.\")\n\t}\n}\n\nfunc copyTree(t *testing.T) (string, map[string]string) {\n\tsrc, err := os.Getwd()\n\tif err != nil {\n\t\tt.Fatalf(\"getting working directory: %v\", err)\n\t}\n\tdst := t.TempDir()\n\n\t// Ensure src ends with \"/\"\n\tsrc = fmt.Sprintf(\"%s%c\", filepath.Clean(src), filepath.Separator)\n\n\tfileMap := make(map[string]string)\n\terr = filepath.WalkDir(src, func(path string, d fs.DirEntry, err error) error {\n\t\tif !strings.HasPrefix(path, src) {\n\t\t\tpanic(fmt.Sprintf(\"WalkDir path %q does not start with source path %q\", path, src))\n\t\t}\n\n\t\trel := path[len(src):]\n\t\tif d.Name() == \".git\" {\n\t\t\treturn filepath.SkipDir\n\t\t}\n\t\tif d.IsDir() {\n\t\t\tif rel == \"\" {\n\t\t\t\t// This is the root of the tree, so\n\t\t\t\t// the destination already exists.\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\treturn os.Mkdir(filepath.Join(dst, rel), 0777)\n\t\t}\n\t\t// Only copy .go and related files.\n\t\tif n := d.Name(); !(filepath.Ext(n) == \".go\" || n == \"go.mod\" || n == \"go.sum\") {\n\t\t\treturn nil\n\t\t}\n\n\t\t// Copy file.\n\t\tfileMap[path] = filepath.Join(dst, rel)\n\t\treturn copyFile(path, filepath.Join(dst, rel))\n\t})\n\tif err != nil {\n\t\tt.Fatalf(\"error copying source tree: %v\", err)\n\t}\n\n\tt.Logf(\"copied source tree to %s\", dst)\n\n\treturn dst, fileMap\n}\n\nfunc copyFile(src, dst string) error {\n\tout, err := os.Create(dst)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer out.Close()\n\n\tin, err := os.Open(src)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer in.Close()\n\n\t_, err = io.Copy(out, in)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn out.Close()\n}\n\nfunc diffFiles(t *testing.T, fileMap map[string]string) bool {\n\tdiffs := 0\n\tfor orig, new := range fileMap {\n\t\t// --strip-trailing-cr is important on Windows where\n\t\t// git and gofmt may disagree on newline conventions.\n\t\tdiff := exec.Command(\"diff\", \"-u\", \"--strip-trailing-cr\", orig, new)\n\t\tdiff.Stdout = os.Stdout\n\t\tdiff.Stderr = os.Stderr\n\t\tif err := diff.Run(); err != nil {\n\t\t\tswitch err := err.(type) {\n\t\t\tcase *exec.ExitError:\n\t\t\t\tif err.ExitCode() == 1 {\n\t\t\t\t\tdiffs++\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t\tt.Errorf(\"diff failed: %v\", err)\n\t\t}\n\t}\n\treturn diffs != 0\n}\n" }, { "path": "go.mod", "content": "module github.com/aclements/go-perf\n\ngo 1.18\n\nrequire (\n\tgithub.com/aclements/go-moremath v0.0.0-20210112150236-f10218a38794\n\tgithub.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0\n\tgithub.com/ianlancetaylor/demangle v0.0.0-20220517205856-0058ec4f073c\n)\n\nrequire golang.org/x/image v0.0.0-20220413100746-70e8d0d3baa9 // indirect\n" }, { "path": "go.sum", "content": "github.com/aclements/go-moremath v0.0.0-20210112150236-f10218a38794 h1:xlwdaKcTNVW4PtpQb8aKA4Pjy0CdJHEqvFbAnvR5m2g=\ngithub.com/aclements/go-moremath v0.0.0-20210112150236-f10218a38794/go.mod h1:7e+I0LQFUI9AXWxOfsQROs9xPhoJtbsyWcjJqDd4KPY=\ngithub.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0 h1:DACJavvAHhabrF08vX0COfcOBJRhZ8lUbR+ZWIs0Y5g=\ngithub.com/golang/freetype v0.0.0-20170609003504-e2365dfdc4a0/go.mod h1:E/TSTwGwJL78qG/PmXZO1EjYhfJinVAhrmmHX6Z8B9k=\ngithub.com/ianlancetaylor/demangle v0.0.0-20220517205856-0058ec4f073c h1:rwmN+hgiyp8QyBqzdEX43lTjKAxaqCrYHaU5op5P9J8=\ngithub.com/ianlancetaylor/demangle v0.0.0-20220517205856-0058ec4f073c/go.mod h1:aYm2/VgdVmcIU8iMfdMvDMsRAQjcfZSKFby6HOFvi/w=\ngolang.org/x/image v0.0.0-20220413100746-70e8d0d3baa9 h1:LRtI4W37N+KFebI/qV0OFiLUv4GLOWeEW5hn/KEJvxE=\ngolang.org/x/image v0.0.0-20220413100746-70e8d0d3baa9/go.mod h1:023OzeP/+EPmXeapQh35lcL3II3LrY8Ic+EFFKVhULM=\ngolang.org/x/text v0.3.6/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=\ngolang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=\n" }, { "path": "internal/cparse/enums.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"fmt\"\n)\n\ntype Enum struct {\n\tTag Tok\n\tIdent Tok\n}\n\n// FindEnums finds top-level enumeration constants in toks.\nfunc FindEnums(tokens []Tok) ([]Enum, error) {\n\tt := toks(tokens)\n\tvar enums []Enum\n\tfor len(t) > 0 {\n\t\tswitch {\n\t\tcase t.Try(TokOp, \"{\"):\n\t\t\tt.SkipBalanced(\"}\")\n\t\tcase t.Try(TokOp, \"(\"):\n\t\t\tt.SkipBalanced(\")\")\n\t\tcase t.Try(TokOp, \"[\"):\n\t\t\tt.SkipBalanced(\"]\")\n\t\tcase t.Try(TokKeyword, \"enum\"):\n\t\t\t// Found an enum. Skip tag, if any.\n\t\t\ttag, _ := t.TryIdent()\n\t\t\tif t.Try(TokOp, \"{\") {\n\t\t\t\tfor {\n\t\t\t\t\tif t.Try(TokOp, \"}\") {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t\tid, ok := t.TryIdent()\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\treturn nil, fmt.Errorf(\"expected identifier\")\n\t\t\t\t\t}\n\t\t\t\t\tenums = append(enums, Enum{tag, id})\n\t\t\t\t\t// Consume initializer.\n\t\t\t\t\tif t.Try(TokOp, \"=\") {\n\t\t\t\t\t\tt.SkipBalanced(\",\", \"}\")\n\t\t\t\t\t}\n\t\t\t\t\tt.Try(TokOp, \",\")\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t\tt.Skip(1)\n\t\t}\n\t}\n\treturn enums, nil\n}\n" }, { "path": "internal/cparse/enums_test.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"testing\"\n)\n\nfunc TestFindEnums(t *testing.T) {\n\tneedCC(t)\n\n\tpp := preprocess(t, \"int foo(); enum tag { A, B = 2 + (C, D), E };\")\n\ttoks, err := Tokenize(pp)\n\tif err != nil {\n\t\tt.Fatal(err)\n\t}\n\tenums, err := FindEnums(toks)\n\tif err != nil {\n\t\tt.Fatal(err)\n\t}\n\tif len(enums) != 3 {\n\t\tt.Fatalf(\"expected 3 enums, got %d\", len(enums))\n\t}\n\tfor i, name := range []string{\"A\", \"B\", \"E\"} {\n\t\tif enums[i].Tag.Text != \"tag\" || enums[i].Ident.Text != name {\n\t\t\tt.Errorf(\"expected enum tag.%s, got %v\", name, enums[i])\n\t\t}\n\t}\n}\n" }, { "path": "internal/cparse/lex.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"strconv\"\n)\n\ntype Toks struct {\n\tToks []Tok\n}\n\ntype Tok struct {\n\tKind TokKind\n\tText string\n}\n\ntype TokKind uint8\n\nconst (\n\tTokKeyword TokKind = 1 + iota\n\tTokIdent\n\tTokNumber\n\tTokString\n\tTokChar\n\tTokOp\n\tTokEOF\n)\n\nfunc (t Tok) Int() int {\n\tif t.Kind != TokNumber {\n\t\tpanic(\"token is not a number\")\n\t}\n\tv, err := strconv.Atoi(t.Text)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn v\n}\n\nfunc (t Tok) Match(kind TokKind, text string) bool {\n\treturn t.Kind == kind && t.Text == text\n}\n\nvar tokTab, puncTab, keyTab = mkTokTab([]string{\n\t\"[\", \"]\", \"(\", \")\", \"{\", \"}\", \".\", \"->\",\n\t\"++\", \"--\", \"&\", \"*\", \"+\", \"-\", \"~\", \"!\",\n\t\"/\", \"%\", \"<<\", \">>\", \"<\", \">\", \"<=\", \">=\", \"!=\",\n\t\"^\", \"|\", \"&&\", \"||\",\n\t\"?\", \":\", \";\", \"...\",\n\t\"=\", \"*=\", \"/=\", \"%=\", \"+=\", \"-=\", \"<<=\", \">>=\", \"&=\", \"^=\", \"|=\",\n\t\",\", \"#\", \"##\",\n}, []string{\"auto\", \"break\", \"case\", \"char\", \"const\",\n\t\"continue\", \"default\", \"do\", \"double\", \"else\",\n\t\"enum\", \"extern\", \"float\", \"for\", \"goto\",\n\t\"if\", \"inline\", \"int\", \"long\", \"register\",\n\t\"restrict\", \"return\", \"short\", \"signed\", \"sizeof\",\n\t\"static\", \"struct\", \"switch\", \"typedef\", \"union\",\n\t\"unsigned\", \"void\", \"volatile\", \"while\", \"_Bool\",\n\t\"_Complex\", \"_Imaginary\",\n})\n\nvar escTab = map[byte]byte{\n\t'\\'': '\\'', '\"': '\"', '?': '?', '\\\\': '\\\\',\n\t'a': '\\a', 'b': '\\b', 'f': '\\f', 'n': '\\n',\n\t'r': '\\r', 't': '\\t', 'v': '\\v'}\n\ntype chProps uint8\n\nconst (\n\tchNonDigit chProps = 1 << iota\n\tchDigit\n\tchOct\n\tchHex\n\tchChars // Character constant or string literal\n\tchPunct\n)\n\nfunc mkTokTab(punct, keywords []string) (tab [256]chProps, ptab map[string]bool, ktab map[string]bool) {\n\tfor i := range tab {\n\t\tif i == '_' || 'a' <= i && i <= 'z' || 'A' <= i && i <= 'Z' {\n\t\t\ttab[i] |= chNonDigit\n\t\t\tif 'a' <= i && i <= 'f' || 'A' <= i && i <= 'F' {\n\t\t\t\ttab[i] |= chHex\n\t\t\t}\n\t\t} else if '0' <= i && i <= '9' {\n\t\t\ttab[i] |= chDigit | chHex\n\t\t\tif i <= '7' {\n\t\t\t\ttab[i] |= chOct\n\t\t\t}\n\t\t} else {\n\t\t\tswitch i {\n\t\t\tcase '\\'', '\"':\n\t\t\t\ttab[i] |= chChars\n\t\t\t}\n\t\t}\n\t}\n\n\tptab = make(map[string]bool)\n\tfor _, p := range punct {\n\t\ttab[p[0]] |= chPunct\n\t\tptab[p] = true\n\t}\n\n\tktab = make(map[string]bool)\n\tfor _, k := range keywords {\n\t\tktab[k] = true\n\t}\n\n\treturn\n}\n\ntype pos struct {\n\tpath string\n\tline, col int\n}\n\nfunc (p pos) error(f string, args ...interface{}) error {\n\tmsg := fmt.Sprintf(f, args...)\n\treturn fmt.Errorf(\"%s:%d:%d: %s\", p.path, p.line, p.col, msg)\n}\n\n// charReader implements translation phases 1 and 2: mapping to the\n// source character set, and deleting \"\\\\\\n\". It doesn't implement\n// trigraph sequences, so phase 1 is trivial.\ntype charReader struct {\n\tsrc []byte\n\tpos pos\n}\n\nfunc (r *charReader) ReadByte() byte {\n\t// Fold \"\\\\\\n\".\n\tfor len(r.src) >= 2 && r.src[0] == '\\\\' && r.src[1] == '\\n' {\n\t\tr.pos.line++\n\t\tr.pos.col = 0\n\t\tr.src = r.src[2:]\n\t}\n\tif len(r.src) == 0 {\n\t\treturn 0\n\t}\n\tnext := r.src[0]\n\tr.src = r.src[1:]\n\tr.pos.col++\n\tif next == '\\n' {\n\t\tr.pos.line++\n\t\tr.pos.col = 0\n\t}\n\treturn next\n}\n\nfunc (r *charReader) EOF() bool {\n\treturn len(r.src) == 0\n}\n\n// Tokenize parses src into C tokens. src must already be\n// pre-processed.\nfunc Tokenize(src []byte) ([]Tok, error) {\n\ttoks := []Tok{}\n\tcr := charReader{src: src, pos: pos{\"\", 1, 0}}\n\n\tvar buf []byte\n\tvar ch byte\n\thaveCh := false\n\tinLine, lineStart := false, 0 // Processing line directive\n\n\tfor {\n\t\tif !haveCh {\n\t\t\tch = cr.ReadByte()\n\t\t}\n\t\thaveCh = false\n\n\t\tif inLine && (ch == '\\n' || cr.EOF()) {\n\t\t\t// Line directive complete.\n\t\t\tinLine = false\n\t\t\tlineToks := toks[lineStart:]\n\t\t\ttoks = toks[:lineStart]\n\t\t\tcr.pos = pos{lineToks[2].Text, lineToks[1].Int(), 0}\n\t\t}\n\n\t\tif cr.EOF() {\n\t\t\treturn toks, nil\n\t\t}\n\n\t\t// Skip whitespace.\n\t\tif bytes.IndexByte([]byte(\" \\t\\n\\v\\f\"), ch) >= 0 {\n\t\t\tcontinue\n\t\t}\n\n\t\t// Consume token.\n\t\tbuf = append(buf[:0], ch)\n\t\tstart := cr.pos\n\t\tswitch {\n\t\tcase tokTab[ch]&chNonDigit != 0:\n\t\t\t// Identifier or keyword\n\t\t\tfor {\n\t\t\t\tch = cr.ReadByte()\n\t\t\t\tif tokTab[ch]&(chNonDigit|chDigit) == 0 {\n\t\t\t\t\thaveCh = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tbuf = append(buf, ch)\n\t\t\t}\n\t\t\tif keyTab[string(buf)] {\n\t\t\t\ttoks = append(toks, Tok{TokKeyword, string(buf)})\n\t\t\t} else {\n\t\t\t\ttoks = append(toks, Tok{TokIdent, string(buf)})\n\t\t\t}\n\n\t\tcase tokTab[ch]&chDigit != 0:\n\t\t\t// Number\n\t\t\t//\n\t\t\t// TODO: Floating-point constants.\n\t\t\thex, oct := false, false\n\t\t\tfor i := 0; ; i++ {\n\t\t\t\tch = cr.ReadByte()\n\t\t\t\tif i == 0 && ch == 'x' {\n\t\t\t\t\thex = true\n\t\t\t\t} else if i == 0 && ch == '0' {\n\t\t\t\t\toct = true\n\t\t\t\t} else if hex && tokTab[ch]&chHex != 0 ||\n\t\t\t\t\toct && tokTab[ch]&chOct != 0 ||\n\t\t\t\t\ttokTab[ch]&chDigit != 0 {\n\t\t\t\t\t// Consume\n\t\t\t\t} else {\n\t\t\t\t\thaveCh = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tbuf = append(buf, ch)\n\t\t\t}\n\t\t\ttoks = append(toks, Tok{TokNumber, string(buf)})\n\n\t\tcase tokTab[ch]&chChars != 0:\n\t\t\t// Character constant or string literal\n\t\t\tterm := ch\n\t\t\tkind := \"character constant\"\n\t\t\tif ch == '\"' {\n\t\t\t\tkind = \"string literal\"\n\t\t\t}\n\t\t\tbuf = buf[:0]\n\t\t\tvar escPos pos\n\t\t\tesc, hex, oct := false, 0, 0\n\t\t\tval := uint8(0)\n\t\t\tfor {\n\t\t\t\tch = cr.ReadByte()\n\t\t\tunread:\n\t\t\t\tif cr.EOF() {\n\t\t\t\t\treturn nil, start.error(\"unterminated \" + kind)\n\t\t\t\t}\n\n\t\t\t\tif esc {\n\t\t\t\t\tesc = false\n\t\t\t\t\tif rep, ok := escTab[ch]; ok {\n\t\t\t\t\t\t// Simple escape sequence\n\t\t\t\t\t\tbuf = append(buf, rep)\n\t\t\t\t\t} else if ch == 'x' {\n\t\t\t\t\t\t// Hex escape sequence\n\t\t\t\t\t\thex, val = 1, 0\n\t\t\t\t\t} else if tokTab[ch]&chOct != 0 {\n\t\t\t\t\t\toct = 1\n\t\t\t\t\t\tval = ch - '0'\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn nil, escPos.error(\"bad escape sequence\")\n\t\t\t\t\t}\n\t\t\t\t} else if hex > 0 {\n\t\t\t\t\tif tokTab[ch]&chHex != 0 {\n\t\t\t\t\t\thex++\n\t\t\t\t\t\tval = (val << 4) | hexVal(ch)\n\t\t\t\t\t} else if hex == 1 {\n\t\t\t\t\t\treturn nil, escPos.error(\"bad escape sequence\")\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbuf = append(buf, val)\n\t\t\t\t\t\thex = 0\n\t\t\t\t\t\tgoto unread\n\t\t\t\t\t}\n\t\t\t\t} else if oct > 0 {\n\t\t\t\t\tif oct <= 3 && tokTab[ch]&chOct != 0 {\n\t\t\t\t\t\toct++\n\t\t\t\t\t\tval = (val << 3) | (ch - '0')\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbuf = append(buf, val)\n\t\t\t\t\t\toct = 0\n\t\t\t\t\t\tgoto unread\n\t\t\t\t\t}\n\t\t\t\t} else if ch == term {\n\t\t\t\t\tbreak\n\t\t\t\t} else if ch == '\\\\' {\n\t\t\t\t\tesc = true\n\t\t\t\t\tescPos = cr.pos\n\t\t\t\t} else if ch == '\\n' {\n\t\t\t\t\treturn nil, start.error(\"newline in \" + kind)\n\t\t\t\t} else {\n\t\t\t\t\tbuf = append(buf, ch)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif term == '\"' {\n\t\t\t\ttoks = append(toks, Tok{TokString, string(buf)})\n\t\t\t} else {\n\t\t\t\ttoks = append(toks, Tok{TokChar, string(buf)})\n\t\t\t}\n\n\t\tcase tokTab[ch]&chPunct != 0:\n\t\t\t// Punctuation or line directive\n\t\t\tsol := cr.pos.col == 1\n\t\t\tfor {\n\t\t\t\tch = cr.ReadByte()\n\t\t\t\tbuf = append(buf, ch)\n\t\t\t\tif !puncTab[string(buf)] {\n\t\t\t\t\tbuf = buf[:len(buf)-1]\n\t\t\t\t\thaveCh = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttext := string(buf)\n\t\t\tif sol && text == \"#\" {\n\t\t\t\t// Line directive.\n\t\t\t\tlineStart, inLine = len(toks), true\n\t\t\t}\n\t\t\ttoks = append(toks, Tok{TokOp, text})\n\n\t\tdefault:\n\t\t\treturn nil, start.error(\"unexpected character %q\", string(ch))\n\t\t}\n\t}\n}\n\nfunc hexVal(ch byte) uint8 {\n\tswitch {\n\tcase '0' <= ch && ch <= '9':\n\t\treturn ch - '0'\n\tcase 'a' <= ch && ch <= 'f':\n\t\treturn ch - 'a' + 10\n\tcase 'A' <= ch && ch <= 'F':\n\t\treturn ch - 'A' + 10\n\t}\n\tpanic(\"not a hex digit\")\n}\n\ntype toks []Tok\n\nfunc (s toks) Next() Tok {\n\tif len(s) > 0 {\n\t\treturn s[0]\n\t}\n\treturn Tok{Kind: TokEOF, Text: \"EOF\"}\n}\n\nfunc (s toks) Peek(kind TokKind, text string) bool {\n\treturn len(s) > 0 && s[0].Match(kind, text)\n}\n\nfunc (s *toks) Try(kind TokKind, text string) bool {\n\tif s.Peek(kind, text) {\n\t\t*s = (*s)[1:]\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (s *toks) TryIdent() (Tok, bool) {\n\ttok := s.Next()\n\tif tok.Kind == TokIdent {\n\t\ts.Skip(1)\n\t\treturn tok, true\n\t}\n\treturn Tok{}, false\n}\n\nfunc (s *toks) Skip(n int) {\n\tif n > len(*s) {\n\t\tn = len(*s)\n\t}\n\t(*s) = (*s)[n:]\n}\n\nfunc (s *toks) SkipBalanced(until ...string) {\n\tlevel := 0\n\tfor len(*s) != 0 {\n\t\tnext := s.Next()\n\t\tif level == 0 {\n\t\t\t// Are we at a terminator?\n\t\t\tfor _, u := range until {\n\t\t\t\tif next.Match(TokOp, u) {\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ts.Skip(1)\n\t\tif next.Kind == TokOp {\n\t\t\tswitch next.Text {\n\t\t\tcase \"{\", \"(\", \"[\":\n\t\t\t\tlevel++\n\t\t\tcase \"]\", \")\", \"}\":\n\t\t\t\tlevel--\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "internal/cparse/lex_test.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"testing\"\n)\n\nfunc TestTokenize(t *testing.T) {\n\tneedCC(t)\n\n\tpp := preprocess(t, \"#include \")\n\ttoks, err := Tokenize(pp)\n\tif err != nil {\n\t\tt.Fatal(err)\n\t}\n\t// Look for \"int fprintf(FILE *\".\n\tsubSeq := []Tok{{TokKeyword, \"int\"}, {TokIdent, \"fprintf\"}, {TokOp, \"(\"}, {TokIdent, \"FILE\"}, {TokOp, \"*\"}}\nouter:\n\tfor start := range toks {\n\t\tif len(toks)-start < len(subSeq) {\n\t\t\tt.Fatal(\"didn't find fprintf declaration in token stream\")\n\t\t}\n\t\tfor i, tok := range subSeq {\n\t\t\tif toks[start+i] != tok {\n\t\t\t\tcontinue outer\n\t\t\t}\n\t\t}\n\t\t// Found the subsequence.\n\t\tbreak\n\t}\n}\n" }, { "path": "internal/cparse/pp.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"os/exec\"\n\t\"regexp\"\n\t\"strings\"\n)\n\ntype BuildEnv struct {\n\tCCArgs []string\n}\n\nvar macroRe = regexp.MustCompile(`^#define ([_a-zA-Z][_a-zA-Z0-9]*)`)\n\n// FindMacros returns the names of all macros defined by the C source\n// in r.\nfunc FindMacros(env *BuildEnv, r io.Reader) ([]string, error) {\n\tccArgs := append([]string(nil), env.CCArgs...)\n\tccArgs = append(ccArgs, \"-x\", \"c\", \"-E\", \"-dM\", \"-\")\n\tcc := exec.Command(\"cc\", ccArgs...)\n\tcc.Stdin = r\n\tcc.Stderr = os.Stderr\n\tout, err := cc.Output()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tvar macros []string\n\tlines := strings.Split(string(out), \"\\n\")\n\tfor _, line := range lines {\n\t\tif line == \"\" {\n\t\t\tcontinue\n\t\t}\n\t\tm := macroRe.FindStringSubmatch(line)\n\t\tif m == nil {\n\t\t\treturn nil, fmt.Errorf(\"failed to parse macro %q\", line)\n\t\t}\n\t\tmacros = append(macros, m[1])\n\t}\n\treturn macros, nil\n}\n\n// Preprocess invokes the C preprocessor to pre-process the C source\n// in r.\nfunc Preprocess(env *BuildEnv, r io.Reader) ([]byte, error) {\n\t// Invoke C compiler for pre-processing.\n\tccArgs := append([]string(nil), env.CCArgs...)\n\tccArgs = append(ccArgs, \"-x\", \"c\", \"-E\", \"-\")\n\tcc := exec.Command(\"cc\", ccArgs...)\n\tcc.Stdin = r\n\tcc.Stderr = os.Stderr\n\treturn cc.Output()\n}\n" }, { "path": "internal/cparse/pp_test.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"bytes\"\n\t\"os/exec\"\n\t\"testing\"\n)\n\nvar defaultEnv = BuildEnv{}\n\nfunc TestMacros(t *testing.T) {\n\tneedCC(t)\n\n\tsrc := bytes.NewBufferString(\"#define TEST 123\\n#define EMPTY\")\n\tmacros, err := FindMacros(&defaultEnv, src)\n\tif err != nil {\n\t\tt.Fatal(err)\n\t}\nouter:\n\tfor _, want := range []string{\"EMPTY\", \"TEST\", \"__STDC__\"} {\n\t\tfor _, have := range macros {\n\t\t\tif have == want {\n\t\t\t\tcontinue outer\n\t\t\t}\n\t\t}\n\t\tt.Errorf(\"%q is not defined\", want)\n\t}\n}\n\nfunc needCC(t *testing.T) {\n\tt.Helper()\n\n\tconst bin = \"cc\"\n\tif _, err := exec.LookPath(bin); err != nil {\n\t\tt.Skipf(\"need %s binary in PATH\", bin)\n\t}\n}\n\nfunc preprocess(t *testing.T, src string) []byte {\n\tt.Helper()\n\n\tsb := bytes.NewBufferString(src)\n\tpp, err := Preprocess(&defaultEnv, sb)\n\tif err != nil {\n\t\tt.Fatal(err)\n\t}\n\treturn pp\n}\n" }, { "path": "internal/cparse/vals.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage cparse\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"os/exec\"\n\t\"path/filepath\"\n\t\"strconv\"\n\t\"strings\"\n)\n\ntype Extractor struct {\n\tPrologue string\n\tNames []string\n\tVals map[string]interface{}\n}\n\nfunc (e *Extractor) Extract(env *BuildEnv) error {\n\t// Other ways to do this:\n\t//\n\t// __typeof__(x) xxx = x;\n\t//\n\t// Or generate inline assembly.\n\t//\n\t// Extract from object file (requires different object format\n\t// readers) or asm.\n\n\t// Construct printer program.\n\tsrc := bytes.NewBufferString(e.Prologue)\n\tsrc.WriteString(`\n#include \n#include \n\n#define __CPARSE_PR(x) _Generic((x), \\\n\tint : __cparse_pr_int, \\\n\tlong : __cparse_pr_int, \\\n\tlong long : __cparse_pr_int, \\\n\tunsigned int : __cparse_pr_uint, \\\n\tunsigned long : __cparse_pr_uint, \\\n\tunsigned long long : __cparse_pr_uint, \\\n\tchar* : __cparse_pr_str)(x)\nvoid __cparse_pr_int(long long x) {\n\tprintf(\"int %lld\\n\", x);\n}\nvoid __cparse_pr_uint(unsigned long long x) {\n\tprintf(\"uint %llu\\n\", x);\n}\nvoid __cparse_pr_str(const char *x) {\n\tprintf(\"str %zu %s\\n\", strlen(x), x);\n}\n\nint main(int argc, char **argv) {\n`)\n\tfor _, n := range e.Names {\n\t\tfmt.Fprintf(src, \"__CPARSE_PR(%s);\\n\", n)\n\t}\n\tsrc.WriteString(\"return 0;\\n}\\n\")\n\n\t// Compiler printer.\n\ttdir, err := ioutil.TempDir(\"\", \"cparse-\")\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer os.RemoveAll(tdir)\n\tprPath := filepath.Join(tdir, \"cparse-pr.exe\")\n\n\tccArgs := append([]string(nil), env.CCArgs...)\n\tccArgs = append(ccArgs, \"-Wformat\", \"-Werror\", \"-std=c11\", \"-x\", \"c\", \"-o\", prPath, \"-\")\n\tcc := exec.Command(\"cc\", ccArgs...)\n\tcc.Stdin = src\n\tcc.Stderr = os.Stderr\n\tif _, err := cc.Output(); err != nil {\n\t\tfmt.Fprintf(os.Stderr, \"compiling source:\\n%s\", src)\n\t\treturn err\n\t}\n\n\t// Run printer.\n\tpr := exec.Command(prPath)\n\toutb, err := pr.Output()\n\tif err != nil {\n\t\treturn err\n\t}\n\tout := string(outb)\n\n\t// Parse printer output.\n\te.Vals = make(map[string]interface{})\n\tfor i := 0; len(out) > 0; i++ {\n\t\tsep := strings.Index(out, \" \")\n\t\ttyp := out[:sep]\n\t\tout = out[sep+1:]\n\t\tswitch typ {\n\t\tcase \"int\":\n\t\t\tsep = strings.Index(out, \"\\n\")\n\t\t\tval, err := strconv.Atoi(out[:sep])\n\t\t\tif err != nil {\n\t\t\t\tpanic(err)\n\t\t\t}\n\t\t\tout = out[sep+1:]\n\t\t\te.Vals[e.Names[i]] = val\n\t\tcase \"uint\":\n\t\t\tsep = strings.Index(out, \"\\n\")\n\t\t\tval, err := strconv.ParseUint(out[:sep], 10, 0)\n\t\t\tif err != nil {\n\t\t\t\tpanic(err)\n\t\t\t}\n\t\t\tout = out[sep+1:]\n\t\t\te.Vals[e.Names[i]] = uint(val)\n\t\tcase \"str\":\n\t\t\tpanic(\"not implemented: str\")\n\t\tdefault:\n\t\t\tpanic(\"unexpected type \" + typ)\n\t\t}\n\t}\n\n\treturn nil\n}\n" }, { "path": "internal/gendefs/edit.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport \"sort\"\n\ntype Edit struct {\n\tPos int // Byte offset of edit\n\tDel int // Number of bytes to delete at Pos\n\tInsert []byte // Bytes to insert at Pos\n}\n\nfunc DoEdit(src []byte, edits []Edit) []byte {\n\t// Sort the edits in order.\n\tsort.SliceStable(edits, func(i, j int) bool {\n\t\treturn edits[i].Pos < edits[j].Pos\n\t})\n\n\t// Check for overlapping edits.\n\tfor i := 1; i < len(edits); i++ {\n\t\tif edits[i-1].Pos+edits[i-1].Del > edits[i].Pos {\n\t\t\tpanic(\"overlapping edits\")\n\t\t}\n\t}\n\n\t// Process edits.\n\tout := []byte{}\n\tsrcPos := 0\n\tfor _, edit := range edits {\n\t\tout = append(out, src[srcPos:edit.Pos]...)\n\t\tout = append(out, edit.Insert...)\n\t\tsrcPos = edit.Pos + edit.Del\n\t}\n\tout = append(out, src[srcPos:]...)\n\n\treturn out\n}\n" }, { "path": "internal/gendefs/main.go", "content": "// Copyright 2018 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage main\n\nimport (\n\t\"bytes\"\n\t\"flag\"\n\t\"fmt\"\n\t\"go/ast\"\n\t\"go/parser\"\n\t\"go/printer\"\n\t\"go/token\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"os\"\n\t\"strings\"\n\t\"unicode\"\n\n\t\"github.com/aclements/go-perf/internal/cparse\"\n)\n\nvar ccflags = flag.String(\"ccflags\", \"\", \"space-separated list of flags to pass to cc\")\n\nfunc main() {\n\tflag.Parse()\n\n\t// Process each Go source file.\n\tfor _, path := range flag.Args() {\n\t\tprocess(path)\n\t}\n}\n\nfunc process(path string) {\n\tsrc, err := ioutil.ReadFile(path)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tfset := token.NewFileSet()\n\tf, err := parser.ParseFile(fset, path, src, parser.ParseComments)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\t// Extract directives.\n\tvar defs []*def\n\tcsrc := new(bytes.Buffer)\n\tfor _, cg := range f.Comments {\n\t\tfor _, c := range cg.List {\n\t\t\tsp := strings.IndexAny(c.Text, \" \\r\\n\\t\\v\\f\")\n\t\t\tif sp < 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tcmd := c.Text[2:sp]\n\t\t\tif cmd == \"gendefs:C\" {\n\t\t\t\tfmt.Fprintf(csrc, \"%s\\n\", c.Text[sp:len(c.Text)-2])\n\t\t\t} else if cmd == \"gendefs\" {\n\t\t\t\tdefs = append(defs, parseDef(c))\n\t\t\t}\n\t\t}\n\t}\n\t// Attach declaration blocks to def directives.\n\tdefsTodo := defs\n\tfor _, decl := range f.Decls {\n\t\t// Skip decls before the next def.\n\t\tif len(defsTodo) == 0 {\n\t\t\tbreak\n\t\t}\n\t\tif decl.Pos() < defsTodo[0].Pos {\n\t\t\tcontinue\n\t\t}\n\t\t// Attach this decl.\n\t\tif decl, ok := decl.(*ast.GenDecl); !ok || decl.Tok != token.CONST {\n\t\t\tlog.Fatalf(\"%s: def must be applied to const\", fset.Position(defsTodo[0].Pos))\n\t\t}\n\t\tdefsTodo[0].Decl = decl.(*ast.GenDecl)\n\t\tdefsTodo = defsTodo[1:]\n\t\t// Check for more than one def per decl.\n\t\tif len(defsTodo) > 0 && defsTodo[0].Pos < decl.Pos() {\n\t\t\tlog.Fatalf(\"%s: multiple defs for declaration\", fset.Position(decl.Pos()))\n\t\t}\n\t}\n\tif len(defsTodo) > 0 {\n\t\tlog.Fatalf(\"%s: def without a declaration\", fset.Position(defsTodo[0].Pos))\n\t}\n\n\t// Get identifier names from C code.\n\tenv := cparse.BuildEnv{CCArgs: strings.Fields(*ccflags)}\n\tpp, err := cparse.Preprocess(&env, bytes.NewBuffer(csrc.Bytes()))\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\ttoks, err := cparse.Tokenize(pp)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\t// TODO: Macros aren't in source order. :( Maybe I need to\n\t// sort them by value? Or do my own pre-processor scan just to\n\t// get the names (and hope that ignoring other pre-processor\n\t// directives is okay)?\n\tmacros, err := cparse.FindMacros(&env, bytes.NewBuffer(csrc.Bytes()))\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tconsts, err := cparse.FindEnums(toks)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tfor _, m := range macros {\n\t\tconsts = append(consts, cparse.Enum{Ident: cparse.Tok{Text: m}})\n\t}\n\n\t// Extract values of defs.\n\tex := cparse.Extractor{Prologue: csrc.String()}\n\tfor _, def := range defs {\n\t\tfor i, c := range consts {\n\t\t\tid := c.Ident.Text\n\t\t\tif def.OmitMax && i == len(consts)-1 && strings.HasSuffix(id, \"_MAX\") {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif def.Omit[id] {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t_, ok1 := def.CTag(c.Tag.Text)\n\t\t\t_, ok2 := def.CIdent(id)\n\t\t\tif ok1 && ok2 {\n\t\t\t\tdef.Names = append(def.Names, id)\n\t\t\t\tex.Names = append(ex.Names, id)\n\t\t\t}\n\t\t}\n\t\tif def.OmitMax && len(def.Names) > 0 {\n\t\t\tif last := def.Names[len(def.Names)-1]; !strings.HasSuffix(last, \"_MAX\") {\n\t\t\t\tlog.Fatalf(\"%s: final name is %s, expected *_MAX\", fset.Position(def.Pos), last)\n\t\t\t}\n\t\t\tdef.Names = def.Names[:len(def.Names)-1]\n\t\t\tex.Names = ex.Names[:len(ex.Names)-1]\n\t\t}\n\n\t\tif len(def.Names) == 0 {\n\t\t\tlog.Fatalf(\"%s: no constants match C name\", fset.Position(def.Pos))\n\t\t}\n\t}\n\n\tif err := ex.Extract(&env); err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\t// Replace decls.\n\tvar edits []Edit\n\tfilePos := func(pos token.Pos) int {\n\t\treturn fset.Position(pos).Offset\n\t}\n\tfor _, def := range defs {\n\t\t// Delete the const block.\n\t\tlparen := filePos(def.Decl.Lparen)\n\t\trparen := filePos(def.Decl.Rparen)\n\t\tedit := Edit{Pos: lparen + 1, Del: rparen - lparen - 1}\n\t\tinsert := new(bytes.Buffer)\n\n\t\t// Translate values to expressions.\n\t\tvar vals []interface{}\n\t\tfor _, name := range def.Names {\n\t\t\tvals = append(vals, ex.Vals[name])\n\t\t}\n\n\t\t// Clean up value sequence.\n\t\tvalExprs := cleanVals(vals)\n\n\t\t// Collect comments on existing values. We do this\n\t\t// straight from the text to avoid depending on how\n\t\t// package ast attaches comments to nodes. This\n\t\t// maintains interstitial comments and other\n\t\t// formatting.\n\t\tdocText := map[string][]byte{}\n\t\tlineText := map[string][]byte{}\n\t\tprevEnd := lparen + 2 // Skip newline\n\t\tfor _, spec := range def.Decl.Specs {\n\t\t\tspec := spec.(*ast.ValueSpec)\n\t\t\tdocEnd := filePos(spec.Pos())\n\t\t\t// Back up to the end of the previous line,\n\t\t\t// where the comment ended.\n\t\t\tfor src[docEnd] != '\\n' {\n\t\t\t\tdocEnd--\n\t\t\t}\n\t\t\tdocEnd++\n\t\t\t// Extract the doc text from before the spec.\n\t\t\tif prevEnd < docEnd {\n\t\t\t\tdocText[spec.Names[0].Name] = src[prevEnd:docEnd]\n\t\t\t}\n\n\t\t\t// Extract the line text from after the spec.\n\t\t\tend := filePos(spec.End())\n\t\t\tlineLen := bytes.IndexByte(src[end:], '\\n')\n\t\t\tif lineLen > 0 {\n\t\t\t\tlineText[spec.Names[0].Name] = src[end : end+lineLen]\n\t\t\t}\n\t\t\tprevEnd = end + lineLen + 1 // Skip newline\n\t\t}\n\n\t\tvar prevType string\n\t\tfor i, name := range def.Names {\n\t\t\tsuff, _ := def.CIdent(name)\n\t\t\tgoName := def.GoPrefix + cNameToGo(suff)\n\n\t\t\t// Emit doc comment.\n\t\t\tif text, ok := docText[goName]; ok {\n\t\t\t\tfmt.Fprintf(insert, \"\\n%s\", text)\n\t\t\t}\n\n\t\t\t// Emit name.\n\t\t\tfmt.Fprintf(insert, \"\\n\\t%s\", goName)\n\n\t\t\t// Emit type.\n\t\t\tif def.GoType != prevType {\n\t\t\t\tfmt.Fprintf(insert, \" %s\", def.GoType)\n\t\t\t\tprevType = def.GoType\n\t\t\t}\n\n\t\t\t// Emit value.\n\t\t\tif valExprs[i] != nil {\n\t\t\t\tfmt.Fprintf(insert, \"=\")\n\t\t\t\tprinter.Fprint(insert, fset, valExprs[i])\n\t\t\t}\n\n\t\t\t// Emit line comment.\n\t\t\tif text, ok := lineText[goName]; ok {\n\t\t\t\tfmt.Fprintf(insert, \"%s\", text)\n\t\t\t}\n\t\t}\n\n\t\tfmt.Fprintf(insert, \"\\n\")\n\t\tedit.Insert = insert.Bytes()\n\t\tedits = append(edits, edit)\n\t}\n\n\tfmt.Printf(\"%s\", format(DoEdit(src, edits)))\n}\n\ntype def struct {\n\tCTag func(string) (string, bool)\n\tCIdent func(string) (string, bool)\n\tGoPrefix string\n\tGoType string\n\tOmit map[string]bool\n\tOmitMax bool\n\tPos token.Pos\n\tDecl *ast.GenDecl\n\tNames []string\n}\n\nfunc parseDef(c *ast.Comment) *def {\n\tvar d def\n\targs := strings.Fields(c.Text)[1:]\n\n\t// Extract flags, leaving only positional args.\n\tvar pos []string\n\tfor len(args) > 0 {\n\t\targ := args[0]\n\t\targs = args[1:]\n\t\tswitch {\n\t\tcase arg == \"-omit\":\n\t\t\tif len(args) < 1 {\n\t\t\t\tlog.Fatalf(\"missing argument: -no\")\n\t\t\t}\n\t\t\tif d.Omit == nil {\n\t\t\t\td.Omit = make(map[string]bool)\n\t\t\t}\n\t\t\td.Omit[args[0]] = true\n\t\t\targs = args[1:]\n\t\tcase arg == \"-omit-max\":\n\t\t\td.OmitMax = true\n\t\tcase arg[0] == '-':\n\t\t\tlog.Fatalf(\"unknown directive flag %s\", arg)\n\t\tdefault:\n\t\t\tpos = append(pos, arg)\n\t\t}\n\t}\n\n\tif len(pos) < 2 || len(pos) > 3 {\n\t\tlog.Fatalf(\"wrong number of directive arguments; expected 2 or 3\")\n\t}\n\tif i := strings.Index(pos[0], \".\"); i < 0 {\n\t\td.CTag = func(x string) (string, bool) { return x, true }\n\t\td.CIdent = compileGlob(pos[0])\n\t} else {\n\t\td.CTag = compileGlob(pos[0][:i])\n\t\td.CIdent = compileGlob(pos[0][i+1:])\n\t}\n\td.GoPrefix = pos[1]\n\tif len(pos) == 2 {\n\t\td.GoType = pos[1]\n\t} else {\n\t\td.GoType = pos[2]\n\t}\n\td.Pos = c.Slash\n\n\treturn &d\n}\n\nfunc compileGlob(glob string) func(string) (suff string, match bool) {\n\tif !strings.HasSuffix(glob, \"*\") {\n\t\treturn func(x string) (string, bool) {\n\t\t\treturn \"\", glob == x\n\t\t}\n\t}\n\tpfx := glob[:len(glob)-1]\n\treturn func(x string) (string, bool) {\n\t\tif strings.HasPrefix(x, pfx) {\n\t\t\treturn x[len(pfx):], true\n\t\t}\n\t\treturn \"\", false\n\t}\n}\n\nfunc cleanVals(lits []interface{}) []ast.Expr {\n\t// Look for sequential patterns.\n\tisOffset := make([]bool, len(lits))\n\toffsets := make([]int, len(lits))\n\tisShift := make([]bool, len(lits))\n\tfor i, lit := range lits {\n\t\tswitch val := lit.(type) {\n\t\tcase int:\n\t\t\tisOffset[i] = true\n\t\t\toffsets[i] = val - i\n\t\t\tisShift[i] = val == (1 << uint(i))\n\t\tcase uint:\n\t\tdefault:\n\t\t\tlog.Fatalf(\"unhandled constant type %T\", lit)\n\t\t}\n\t}\n\n\t// Extract longest runs and create exprs.\n\trunLen := func(len int, fn func(int) bool) int {\n\t\tfor i := 0; i < len; i++ {\n\t\t\tif !fn(i) {\n\t\t\t\treturn i\n\t\t\t}\n\t\t}\n\t\treturn len\n\t}\n\tintLit := func(v int) ast.Expr {\n\t\treturn &ast.BasicLit{\n\t\t\tKind: token.INT,\n\t\t\tValue: fmt.Sprint(v),\n\t\t}\n\t}\n\texprs := make([]ast.Expr, len(lits))\n\tiota := ast.NewIdent(\"iota\")\n\tfor i := 0; i < len(lits); {\n\t\toffsetRun := runLen(len(offsets)-i, func(j int) bool {\n\t\t\treturn isOffset[i+j] && offsets[i+j] == offsets[i]\n\t\t})\n\t\tshiftRun := runLen(len(isShift)-i, func(j int) bool {\n\t\t\treturn isShift[i+j]\n\t\t})\n\t\tif offsetRun > 1 && offsetRun >= shiftRun {\n\t\t\t// Run of iota offsets.\n\t\t\tif offsets[i] == 0 {\n\t\t\t\texprs[i] = iota\n\t\t\t} else {\n\t\t\t\texprs[i] = &ast.BinaryExpr{X: iota, Op: token.ADD, Y: intLit(offsets[i])}\n\t\t\t}\n\t\t\ti += offsetRun\n\t\t} else if shiftRun > 1 {\n\t\t\t// Run of iota shifts.\n\t\t\texprs[i] = &ast.BinaryExpr{X: intLit(1), Op: token.SHL, Y: iota}\n\t\t\ti += shiftRun\n\t\t} else {\n\t\t\t// Singleton.\n\t\t\tswitch val := lits[i].(type) {\n\t\t\tcase int:\n\t\t\t\texprs[i] = intLit(val)\n\t\t\tcase uint:\n\t\t\t\texprs[i] = &ast.BasicLit{\n\t\t\t\t\tKind: token.INT,\n\t\t\t\t\tValue: fmt.Sprintf(\"%#x\", val),\n\t\t\t\t}\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t}\n\treturn exprs\n}\n\nvar words = map[string]string{\n\t\"CPU\": \"CPU\",\n\t\"PMU\": \"PMU\",\n\t\"TSC\": \"TSC\",\n\t\"MTC\": \"MTC\",\n\t\"CTC\": \"CTC\",\n\t\"ID\": \"ID\",\n\t\"PID\": \"PID\",\n\t\"TID\": \"TID\",\n\t\"IP\": \"IP\",\n\t\"L1D\": \"L1D\",\n\t\"L1I\": \"L1I\",\n\t\"LL\": \"LL\",\n\t\"DTLB\": \"DTLB\",\n\t\"ITLB\": \"ITLB\",\n\t\"BPU\": \"BPU\", // Branch prediction unit?\n\t\"HW\": \"HW\", // Hardware\n\t\"TX\": \"TX\", // Transaction\n\t\"HV\": \"HV\", // Hypervisor\n\n\t\"CGROUP\": \"CGroup\",\n\t\"CPUMODE\": \"CPUMode\",\n}\n\nfunc cNameToGo(c string) string {\n\tvar out []rune\n\tparts := strings.Split(c, \"_\")\n\tfor _, part := range parts {\n\t\tif w, ok := words[part]; ok {\n\t\t\tout = append(out, []rune(w)...)\n\t\t\tcontinue\n\t\t}\n\t\tfor i, r := range part {\n\t\t\tif i == 0 {\n\t\t\t\tout = append(out, unicode.ToTitle(r))\n\t\t\t} else {\n\t\t\t\tout = append(out, unicode.ToLower(r))\n\t\t\t}\n\t\t}\n\t}\n\treturn string(out)\n}\n\nfunc format(src []byte) []byte {\n\tfset := token.NewFileSet()\n\tf, err := parser.ParseFile(fset, \"\", src, parser.ParseComments)\n\tif err != nil {\n\t\tfmt.Fprintf(os.Stderr, \"%s\", src)\n\t\tlog.Fatal(err)\n\t}\n\n\tcfg := printer.Config{Mode: printer.TabIndent | printer.UseSpaces, Tabwidth: 8}\n\tbuf := new(bytes.Buffer)\n\tcfg.Fprint(buf, fset, f)\n\treturn buf.Bytes()\n}\n" }, { "path": "perffile/auxflags_string.go", "content": "// Code generated by \"bitstringer -type=AuxFlags\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i AuxFlags) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&AuxFlagCollision != 0 {\n\t\ts += \"Collision|\"\n\t}\n\tif i&AuxFlagOverwrite != 0 {\n\t\ts += \"Overwrite|\"\n\t}\n\tif i&AuxFlagPartial != 0 {\n\t\ts += \"Partial|\"\n\t}\n\tif i&AuxFlagTruncated != 0 {\n\t\ts += \"Truncated|\"\n\t}\n\ti &^= 15\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/auxpmuformat_string.go", "content": "// Code generated by \"stringer -type=AuxPMUFormat\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[AuxPMUFormatCoresightCoresight-0]\n\t_ = x[AuxPMUFormatCoresightRaw-1]\n\t_ = x[AuxPMUFormatDefault-0]\n}\n\nconst _AuxPMUFormat_name = \"AuxPMUFormatCoresightCoresightAuxPMUFormatCoresightRaw\"\n\nvar _AuxPMUFormat_index = [...]uint8{0, 30, 54}\n\nfunc (i AuxPMUFormat) String() string {\n\tif i >= AuxPMUFormat(len(_AuxPMUFormat_index)-1) {\n\t\treturn \"AuxPMUFormat(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _AuxPMUFormat_name[_AuxPMUFormat_index[i]:_AuxPMUFormat_index[i+1]]\n}\n" }, { "path": "perffile/bpfeventtype_string.go", "content": "// Code generated by \"bitstringer -type=BPFEventType\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i BPFEventType) String() string {\n\tif i == 0 {\n\t\treturn \"Unknown\"\n\t}\n\ts := \"\"\n\tif i&BPFEventTypeProgLoad != 0 {\n\t\ts += \"ProgLoad|\"\n\t}\n\tif i&BPFEventTypeProgUnload != 0 {\n\t\ts += \"ProgUnload|\"\n\t}\n\ti &^= 3\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/branchflags_string.go", "content": "// Code generated by \"bitstringer -type=BranchFlags\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i BranchFlags) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&BranchFlagAbort != 0 {\n\t\ts += \"Abort|\"\n\t}\n\tif i&BranchFlagInTransaction != 0 {\n\t\ts += \"InTransaction|\"\n\t}\n\tif i&BranchFlagMispredicted != 0 {\n\t\ts += \"Mispredicted|\"\n\t}\n\tif i&BranchFlagPredicted != 0 {\n\t\ts += \"Predicted|\"\n\t}\n\ti &^= 15\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/branchsampletype_string.go", "content": "// Code generated by \"bitstringer -type=BranchSampleType\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i BranchSampleType) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&BranchSampleAbortTX != 0 {\n\t\ts += \"AbortTX|\"\n\t}\n\tif i&BranchSampleAny != 0 {\n\t\ts += \"Any|\"\n\t}\n\tif i&BranchSampleAnyCall != 0 {\n\t\ts += \"AnyCall|\"\n\t}\n\tif i&BranchSampleAnyReturn != 0 {\n\t\ts += \"AnyReturn|\"\n\t}\n\tif i&BranchSampleCall != 0 {\n\t\ts += \"Call|\"\n\t}\n\tif i&BranchSampleCallStack != 0 {\n\t\ts += \"CallStack|\"\n\t}\n\tif i&BranchSampleCond != 0 {\n\t\ts += \"Cond|\"\n\t}\n\tif i&BranchSampleHV != 0 {\n\t\ts += \"HV|\"\n\t}\n\tif i&BranchSampleHWIndex != 0 {\n\t\ts += \"HWIndex|\"\n\t}\n\tif i&BranchSampleInTX != 0 {\n\t\ts += \"InTX|\"\n\t}\n\tif i&BranchSampleIndCall != 0 {\n\t\ts += \"IndCall|\"\n\t}\n\tif i&BranchSampleIndJump != 0 {\n\t\ts += \"IndJump|\"\n\t}\n\tif i&BranchSampleKernel != 0 {\n\t\ts += \"Kernel|\"\n\t}\n\tif i&BranchSampleNoCycles != 0 {\n\t\ts += \"NoCycles|\"\n\t}\n\tif i&BranchSampleNoFlags != 0 {\n\t\ts += \"NoFlags|\"\n\t}\n\tif i&BranchSampleNoTX != 0 {\n\t\ts += \"NoTX|\"\n\t}\n\tif i&BranchSampleTypeSave != 0 {\n\t\ts += \"TypeSave|\"\n\t}\n\tif i&BranchSampleUser != 0 {\n\t\ts += \"User|\"\n\t}\n\ti &^= 262143\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/breakpointop_string.go", "content": "// Code generated by \"bitstringer -type=BreakpointOp\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i BreakpointOp) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&BreakpointOpR != 0 {\n\t\ts += \"R|\"\n\t}\n\tif i&BreakpointOpRW != 0 {\n\t\ts += \"RW|\"\n\t}\n\ti &^= 3\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/buf.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"errors\"\n\t\"io\"\n)\n\n// bufferedSectionReader is a buffered io.SectionReader with offset\n// tracking.\n//\n// This is based on bufio.Reader. This could apply to an arbitrary\n// io.Reader, but it's specialized for our one current use so the\n// linker can statically resolve the method calls.\ntype bufferedSectionReader struct {\n\tbuf []byte\n\trd *io.SectionReader\n\tr, w int // buf read and write positions\n\terr error\n\tpos int64 // file position of read\n}\n\nfunc newBufferedSectionReader(rd *io.SectionReader) *bufferedSectionReader {\n\tpos, err := rd.Seek(0, 1)\n\treturn &bufferedSectionReader{\n\t\tbuf: make([]byte, 16<<10),\n\t\trd: rd,\n\t\tpos: pos,\n\t\terr: err,\n\t}\n}\n\nvar errNegativeRead = errors.New(\"reader returned negative count from Read\")\n\nfunc (b *bufferedSectionReader) readErr() error {\n\terr := b.err\n\tb.err = nil\n\treturn err\n}\n\nfunc (b *bufferedSectionReader) Seek(offset int64, whence int) (int64, error) {\n\tif whence == 0 && offset == b.pos || whence == 1 && offset == 0 {\n\t\treturn b.pos, nil\n\t}\n\n\tvar err error\n\tb.pos, err = b.rd.Seek(offset, whence)\n\tif err == nil {\n\t\tb.r, b.w = 0, 0\n\t}\n\treturn b.pos, err\n}\n\nfunc (b *bufferedSectionReader) Read(p []byte) (n int, err error) {\n\tn = len(p)\n\tif n == 0 {\n\t\treturn 0, b.readErr()\n\t}\n\tif b.r == b.w {\n\t\tif b.err != nil {\n\t\t\treturn 0, b.readErr()\n\t\t}\n\t\tif len(p) >= len(b.buf) {\n\t\t\t// Large read, empty buffer.\n\t\t\t// Read directly into p to avoid copy.\n\t\t\tn, b.err = b.rd.Read(p)\n\t\t\tif n < 0 {\n\t\t\t\tpanic(errNegativeRead)\n\t\t\t}\n\t\t\tb.pos += int64(n)\n\t\t\treturn n, b.readErr()\n\t\t}\n\t\tb.fill() // buffer is empty\n\t\tif b.r == b.w {\n\t\t\treturn 0, b.readErr()\n\t\t}\n\t}\n\n\t// copy as much as we can\n\tn = copy(p, b.buf[b.r:b.w])\n\tb.r += n\n\tb.pos += int64(n)\n\treturn n, nil\n}\n\n// fill reads a new chunk into the buffer.\nfunc (b *bufferedSectionReader) fill() {\n\t// Slide existing data to beginning.\n\tif b.r > 0 {\n\t\tcopy(b.buf, b.buf[b.r:b.w])\n\t\tb.w -= b.r\n\t\tb.r = 0\n\t}\n\n\tif b.w >= len(b.buf) {\n\t\tpanic(\"tried to fill full buffer\")\n\t}\n\n\t// Read new data: try a limited number of times.\n\tfor i := 0; i < 100; i++ {\n\t\tn, err := b.rd.Read(b.buf[b.w:])\n\t\tif n < 0 {\n\t\t\tpanic(errNegativeRead)\n\t\t}\n\t\tb.w += n\n\t\tif err != nil {\n\t\t\tb.err = err\n\t\t\treturn\n\t\t}\n\t\tif n > 0 {\n\t\t\treturn\n\t\t}\n\t}\n\tb.err = io.ErrNoProgress\n}\n" }, { "path": "perffile/bufdecoder.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport \"encoding/binary\"\n\ntype bufDecoder struct {\n\tbuf []byte\n\torder binary.ByteOrder\n}\n\nfunc (b *bufDecoder) skip(n int) {\n\tb.buf = b.buf[n:]\n}\n\nfunc (b *bufDecoder) bytes(x []byte) {\n\tcopy(x, b.buf)\n\tb.buf = b.buf[len(x):]\n}\n\nfunc (b *bufDecoder) u8() uint8 {\n\tx := b.buf[0]\n\tb.buf = b.buf[1:]\n\treturn x\n}\n\nfunc (b *bufDecoder) u16() uint16 {\n\tx := b.order.Uint16(b.buf)\n\tb.buf = b.buf[2:]\n\treturn x\n}\n\nfunc (b *bufDecoder) u32() uint32 {\n\tx := b.order.Uint32(b.buf)\n\tb.buf = b.buf[4:]\n\treturn x\n}\n\nfunc (b *bufDecoder) i32() int32 {\n\tx := int32(b.order.Uint32(b.buf))\n\tb.buf = b.buf[4:]\n\treturn x\n}\n\nfunc (b *bufDecoder) u64() uint64 {\n\tx := b.order.Uint64(b.buf)\n\tb.buf = b.buf[8:]\n\treturn x\n}\n\nfunc (b *bufDecoder) i64() int64 {\n\tx := int64(b.order.Uint64(b.buf))\n\tb.buf = b.buf[8:]\n\treturn x\n}\n\nfunc (b *bufDecoder) u64s(x []uint64) {\n\tfor i := range x {\n\t\tx[i] = b.order.Uint64(b.buf[i*8:])\n\t}\n\tb.buf = b.buf[len(x)*8:]\n}\n\nfunc (b *bufDecoder) u32If(cond bool) uint32 {\n\tif cond {\n\t\treturn b.u32()\n\t}\n\treturn 0\n}\n\nfunc (b *bufDecoder) i32If(cond bool) int32 {\n\tif cond {\n\t\treturn b.i32()\n\t}\n\treturn 0\n}\n\nfunc (b *bufDecoder) u64If(cond bool) uint64 {\n\tif cond {\n\t\treturn b.u64()\n\t}\n\treturn 0\n}\n\nfunc (b *bufDecoder) i64If(cond bool) int64 {\n\tif cond {\n\t\treturn b.i64()\n\t}\n\treturn 0\n}\n\nfunc (b *bufDecoder) cstring() string {\n\tfor i, c := range b.buf {\n\t\tif c == 0 {\n\t\t\tx := string(b.buf[:i])\n\t\t\tb.buf = b.buf[i+1:]\n\t\t\treturn x\n\t\t}\n\t}\n\t// TODO: Error?\n\tx := string(b.buf)\n\tb.buf = b.buf[:1]\n\treturn x\n}\n\nfunc (b *bufDecoder) lenString() string {\n\tl := b.u32()\n\tif l > uint32(len(b.buf)) {\n\t\t// TODO: Error?\n\t\tl = uint32(len(b.buf))\n\t}\n\tstr := (&bufDecoder{b.buf[:l], nil}).cstring()\n\tb.buf = b.buf[l:]\n\treturn str\n}\n\nfunc (b *bufDecoder) stringList() []string {\n\tout := []string{}\n\tcount := b.u32()\n\tfor i := uint32(0); i < count; i++ {\n\t\tout = append(out, b.lenString())\n\t}\n\treturn out\n}\n" }, { "path": "perffile/cpumode_string.go", "content": "// Code generated by \"stringer -type=CPUMode\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[CPUModeUnknown-0]\n\t_ = x[CPUModeKernel-1]\n\t_ = x[CPUModeUser-2]\n\t_ = x[CPUModeHypervisor-3]\n\t_ = x[CPUModeGuestKernel-4]\n\t_ = x[CPUModeGuestUser-5]\n}\n\nconst _CPUMode_name = \"CPUModeUnknownCPUModeKernelCPUModeUserCPUModeHypervisorCPUModeGuestKernelCPUModeGuestUser\"\n\nvar _CPUMode_index = [...]uint8{0, 14, 27, 38, 55, 73, 89}\n\nfunc (i CPUMode) String() string {\n\tif i >= CPUMode(len(_CPUMode_index)-1) {\n\t\treturn \"CPUMode(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _CPUMode_name[_CPUMode_index[i]:_CPUMode_index[i+1]]\n}\n" }, { "path": "perffile/cpuset.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// A CPUSet represents a set of CPUs by CPU index.\ntype CPUSet []int\n\nfunc parseCPUSet(str string) (CPUSet, error) {\n\tvar err error\n\tout := CPUSet{}\n\tfor _, r := range strings.Split(str, \",\") {\n\t\tvar lo, hi int\n\t\tdash := strings.Index(r, \"-\")\n\t\tif dash == -1 {\n\t\t\tlo, err = strconv.Atoi(r)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\thi = lo\n\t\t} else {\n\t\t\tlo, err = strconv.Atoi(r[:dash])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\thi, err = strconv.Atoi(r[dash+1:])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\tfor cpu := lo; cpu <= hi; cpu++ {\n\t\t\tout = append(out, cpu)\n\t\t}\n\t}\n\tsort.Ints(out)\n\ti, j := 0, 0\n\tfor ; i < len(out); i++ {\n\t\tif i != j && out[i] == out[j] {\n\t\t\tcontinue\n\t\t}\n\t\tout[j] = out[i]\n\t\tj++\n\t}\n\treturn out, nil\n}\n\nfunc (c CPUSet) String() string {\n\tif len(c) == 0 {\n\t\treturn \"\"\n\t}\n\n\tout := \"\"\n\tlo, hi := c[0], c[0]-1\n\tflush := func() {\n\t\tif lo == hi {\n\t\t\tout = fmt.Sprintf(\"%s,%d\", out, lo)\n\t\t} else {\n\t\t\tout = fmt.Sprintf(\"%s,%d-%d\", out, lo, hi)\n\t\t}\n\t}\n\tfor _, cpu := range c {\n\t\tif cpu == hi+1 {\n\t\t\thi = cpu\n\t\t} else {\n\t\t\tflush()\n\t\t\tlo, hi = cpu, cpu\n\t\t}\n\t}\n\tflush()\n\treturn out[1:]\n}\n" }, { "path": "perffile/datasrcblock_string.go", "content": "// Code generated by \"bitstringer -type=DataSrcBlock\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i DataSrcBlock) String() string {\n\tif i == 0 {\n\t\treturn \"NA\"\n\t}\n\ts := \"\"\n\tif i&DataSrcBlockAddr != 0 {\n\t\ts += \"Addr|\"\n\t}\n\tif i&DataSrcBlockData != 0 {\n\t\ts += \"Data|\"\n\t}\n\ti &^= 3\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/datasrchops_string.go", "content": "// Code generated by \"stringer -type=DataSrcHops\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[DataSrcHopsCore-1]\n\t_ = x[DataSrcHopsNode-3]\n\t_ = x[DataSrcHopsSocket-3]\n\t_ = x[DataSrcHopesBoard-4]\n\t_ = x[DataSrcHopsNA-0]\n}\n\nconst (\n\t_DataSrcHops_name_0 = \"DataSrcHopsNADataSrcHopsCore\"\n\t_DataSrcHops_name_1 = \"DataSrcHopsNodeDataSrcHopesBoard\"\n)\n\nvar (\n\t_DataSrcHops_index_0 = [...]uint8{0, 13, 28}\n\t_DataSrcHops_index_1 = [...]uint8{0, 15, 32}\n)\n\nfunc (i DataSrcHops) String() string {\n\tswitch {\n\tcase 0 <= i && i <= 1:\n\t\treturn _DataSrcHops_name_0[_DataSrcHops_index_0[i]:_DataSrcHops_index_0[i+1]]\n\tcase 3 <= i && i <= 4:\n\t\ti -= 3\n\t\treturn _DataSrcHops_name_1[_DataSrcHops_index_1[i]:_DataSrcHops_index_1[i+1]]\n\tdefault:\n\t\treturn \"DataSrcHops(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n}\n" }, { "path": "perffile/datasrclevel_string.go", "content": "// Code generated by \"bitstringer -type=DataSrcLevel\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i DataSrcLevel) String() string {\n\tif i == 0 {\n\t\treturn \"NA\"\n\t}\n\ts := \"\"\n\tif i&DataSrcLevelIO != 0 {\n\t\ts += \"IO|\"\n\t}\n\tif i&DataSrcLevelL1 != 0 {\n\t\ts += \"L1|\"\n\t}\n\tif i&DataSrcLevelL2 != 0 {\n\t\ts += \"L2|\"\n\t}\n\tif i&DataSrcLevelL3 != 0 {\n\t\ts += \"L3|\"\n\t}\n\tif i&DataSrcLevelLFB != 0 {\n\t\ts += \"LFB|\"\n\t}\n\tif i&DataSrcLevelLocalRAM != 0 {\n\t\ts += \"LocalRAM|\"\n\t}\n\tif i&DataSrcLevelRemoteCache1 != 0 {\n\t\ts += \"RemoteCache1|\"\n\t}\n\tif i&DataSrcLevelRemoteCache2 != 0 {\n\t\ts += \"RemoteCache2|\"\n\t}\n\tif i&DataSrcLevelRemoteRAM1 != 0 {\n\t\ts += \"RemoteRAM1|\"\n\t}\n\tif i&DataSrcLevelRemoteRAM2 != 0 {\n\t\ts += \"RemoteRAM2|\"\n\t}\n\tif i&DataSrcLevelUncached != 0 {\n\t\ts += \"Uncached|\"\n\t}\n\ti &^= 2047\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/datasrclevelnum_string.go", "content": "// Code generated by \"stringer -type=DataSrcLevelNum\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[DataSrcLevelNumL1-1]\n\t_ = x[DataSrcLevelNumL2-2]\n\t_ = x[DataSrcLevelNumL3-3]\n\t_ = x[DataSrcLevelNumL4-4]\n\t_ = x[DataSrcLevelNumAnyCache-11]\n\t_ = x[DataSrcLevelNumLFB-12]\n\t_ = x[DataSrcLevelNumRAM-13]\n\t_ = x[DataSrcLevelNumPMEM-14]\n\t_ = x[DataSrcLevelNumNA-15]\n}\n\nconst (\n\t_DataSrcLevelNum_name_0 = \"DataSrcLevelNumL1DataSrcLevelNumL2DataSrcLevelNumL3DataSrcLevelNumL4\"\n\t_DataSrcLevelNum_name_1 = \"DataSrcLevelNumAnyCacheDataSrcLevelNumLFBDataSrcLevelNumRAMDataSrcLevelNumPMEMDataSrcLevelNumNA\"\n)\n\nvar (\n\t_DataSrcLevelNum_index_0 = [...]uint8{0, 17, 34, 51, 68}\n\t_DataSrcLevelNum_index_1 = [...]uint8{0, 23, 41, 59, 78, 95}\n)\n\nfunc (i DataSrcLevelNum) String() string {\n\tswitch {\n\tcase 1 <= i && i <= 4:\n\t\ti -= 1\n\t\treturn _DataSrcLevelNum_name_0[_DataSrcLevelNum_index_0[i]:_DataSrcLevelNum_index_0[i+1]]\n\tcase 11 <= i && i <= 15:\n\t\ti -= 11\n\t\treturn _DataSrcLevelNum_name_1[_DataSrcLevelNum_index_1[i]:_DataSrcLevelNum_index_1[i+1]]\n\tdefault:\n\t\treturn \"DataSrcLevelNum(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n}\n" }, { "path": "perffile/datasrclock_string.go", "content": "// Code generated by \"stringer -type=DataSrcLock\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[DataSrcLockNA-0]\n\t_ = x[DataSrcLockUnlocked-1]\n\t_ = x[DataSrcLockLocked-2]\n}\n\nconst _DataSrcLock_name = \"DataSrcLockNADataSrcLockUnlockedDataSrcLockLocked\"\n\nvar _DataSrcLock_index = [...]uint8{0, 13, 32, 49}\n\nfunc (i DataSrcLock) String() string {\n\tif i < 0 || i >= DataSrcLock(len(_DataSrcLock_index)-1) {\n\t\treturn \"DataSrcLock(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _DataSrcLock_name[_DataSrcLock_index[i]:_DataSrcLock_index[i+1]]\n}\n" }, { "path": "perffile/datasrcop_string.go", "content": "// Code generated by \"bitstringer -type=DataSrcOp\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i DataSrcOp) String() string {\n\tif i == 0 {\n\t\treturn \"NA\"\n\t}\n\ts := \"\"\n\tif i&DataSrcOpExec != 0 {\n\t\ts += \"Exec|\"\n\t}\n\tif i&DataSrcOpLoad != 0 {\n\t\ts += \"Load|\"\n\t}\n\tif i&DataSrcOpPrefetch != 0 {\n\t\ts += \"Prefetch|\"\n\t}\n\tif i&DataSrcOpStore != 0 {\n\t\ts += \"Store|\"\n\t}\n\ti &^= 15\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/datasrcsnoop_string.go", "content": "// Code generated by \"bitstringer -type=DataSrcSnoop\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i DataSrcSnoop) String() string {\n\tif i == 0 {\n\t\treturn \"NA\"\n\t}\n\ts := \"\"\n\tif i&DataSrcSnoopFwd != 0 {\n\t\ts += \"Fwd|\"\n\t}\n\tif i&DataSrcSnoopHit != 0 {\n\t\ts += \"Hit|\"\n\t}\n\tif i&DataSrcSnoopHitM != 0 {\n\t\ts += \"HitM|\"\n\t}\n\tif i&DataSrcSnoopMiss != 0 {\n\t\ts += \"Miss|\"\n\t}\n\tif i&DataSrcSnoopNone != 0 {\n\t\ts += \"None|\"\n\t}\n\ti &^= 31\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/datasrctlb_string.go", "content": "// Code generated by \"bitstringer -type=DataSrcTLB\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i DataSrcTLB) String() string {\n\tif i == 0 {\n\t\treturn \"NA\"\n\t}\n\ts := \"\"\n\tif i&DataSrcTLBHardwareWalker != 0 {\n\t\ts += \"HardwareWalker|\"\n\t}\n\tif i&DataSrcTLBHit != 0 {\n\t\ts += \"Hit|\"\n\t}\n\tif i&DataSrcTLBL1 != 0 {\n\t\ts += \"L1|\"\n\t}\n\tif i&DataSrcTLBL2 != 0 {\n\t\ts += \"L2|\"\n\t}\n\tif i&DataSrcTLBMiss != 0 {\n\t\ts += \"Miss|\"\n\t}\n\tif i&DataSrcTLBOSFaultHandler != 0 {\n\t\ts += \"OSFaultHandler|\"\n\t}\n\ti &^= 63\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/doc_test.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"fmt\"\n\t\"log\"\n)\n\nfunc Example() {\n\tf, err := Open(\"perf.data\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer f.Close()\n\n\trs := f.Records(RecordsTimeOrder)\n\tfor rs.Next() {\n\t\tswitch r := rs.Record.(type) {\n\t\tcase *RecordSample:\n\t\t\tfmt.Printf(\"sample: %+v\\n\", r)\n\t\t}\n\t}\n\tif err := rs.Err(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n" }, { "path": "perffile/eventflags_string.go", "content": "// Code generated by \"bitstringer -type=EventFlags\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i EventFlags) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&EventFlagAuxOutput != 0 {\n\t\ts += \"AuxOutput|\"\n\t}\n\tif i&EventFlagBuildID != 0 {\n\t\ts += \"BuildID|\"\n\t}\n\tif i&EventFlagCGroup != 0 {\n\t\ts += \"CGroup|\"\n\t}\n\tif i&EventFlagClockID != 0 {\n\t\ts += \"ClockID|\"\n\t}\n\tif i&EventFlagComm != 0 {\n\t\ts += \"Comm|\"\n\t}\n\tif i&EventFlagCommExec != 0 {\n\t\ts += \"CommExec|\"\n\t}\n\tif i&EventFlagContextSwitch != 0 {\n\t\ts += \"ContextSwitch|\"\n\t}\n\tif i&EventFlagDisabled != 0 {\n\t\ts += \"Disabled|\"\n\t}\n\tif i&EventFlagEnableOnExec != 0 {\n\t\ts += \"EnableOnExec|\"\n\t}\n\tif i&EventFlagExcludeCallchainKernel != 0 {\n\t\ts += \"ExcludeCallchainKernel|\"\n\t}\n\tif i&EventFlagExcludeCallchainUser != 0 {\n\t\ts += \"ExcludeCallchainUser|\"\n\t}\n\tif i&EventFlagExcludeGuest != 0 {\n\t\ts += \"ExcludeGuest|\"\n\t}\n\tif i&EventFlagExcludeHost != 0 {\n\t\ts += \"ExcludeHost|\"\n\t}\n\tif i&EventFlagExcludeHypervisor != 0 {\n\t\ts += \"ExcludeHypervisor|\"\n\t}\n\tif i&EventFlagExcludeIdle != 0 {\n\t\ts += \"ExcludeIdle|\"\n\t}\n\tif i&EventFlagExcludeKernel != 0 {\n\t\ts += \"ExcludeKernel|\"\n\t}\n\tif i&EventFlagExcludeUser != 0 {\n\t\ts += \"ExcludeUser|\"\n\t}\n\tif i&EventFlagExclusive != 0 {\n\t\ts += \"Exclusive|\"\n\t}\n\tif i&EventFlagFreq != 0 {\n\t\ts += \"Freq|\"\n\t}\n\tif i&EventFlagInherit != 0 {\n\t\ts += \"Inherit|\"\n\t}\n\tif i&EventFlagInheritStat != 0 {\n\t\ts += \"InheritStat|\"\n\t}\n\tif i&EventFlagInheritThread != 0 {\n\t\ts += \"InheritThread|\"\n\t}\n\tif i&EventFlagKsymbol != 0 {\n\t\ts += \"Ksymbol|\"\n\t}\n\tif i&EventFlagMmap != 0 {\n\t\ts += \"Mmap|\"\n\t}\n\tif i&EventFlagMmapData != 0 {\n\t\ts += \"MmapData|\"\n\t}\n\tif i&EventFlagMmapInodeData != 0 {\n\t\ts += \"MmapInodeData|\"\n\t}\n\tif i&EventFlagNamespaces != 0 {\n\t\ts += \"Namespaces|\"\n\t}\n\tif i&EventFlagPinned != 0 {\n\t\ts += \"Pinned|\"\n\t}\n\tif i&EventFlagRemoveOnExec != 0 {\n\t\ts += \"RemoveOnExec|\"\n\t}\n\tif i&EventFlagSampleIDAll != 0 {\n\t\ts += \"SampleIDAll|\"\n\t}\n\tif i&EventFlagSigtrap != 0 {\n\t\ts += \"Sigtrap|\"\n\t}\n\tif i&EventFlagTask != 0 {\n\t\ts += \"Task|\"\n\t}\n\tif i&EventFlagTextPoke != 0 {\n\t\ts += \"TextPoke|\"\n\t}\n\tif i&EventFlagWakeupWatermark != 0 {\n\t\ts += \"WakeupWatermark|\"\n\t}\n\tif i&EventFlagWriteBackward != 0 {\n\t\ts += \"WriteBackward|\"\n\t}\n\ti &^= 137438855167\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/eventhardwareid_string.go", "content": "// Code generated by \"stringer -type=EventHardwareID,EventSoftware,HWCache,HWCacheOp,HWCacheResult\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[EventHardwareIDCPUCycles-0]\n\t_ = x[EventHardwareIDInstructions-1]\n\t_ = x[EventHardwareIDCacheReferences-2]\n\t_ = x[EventHardwareIDCacheMisses-3]\n\t_ = x[EventHardwareIDBranchInstructions-4]\n\t_ = x[EventHardwareIDBranchMisses-5]\n\t_ = x[EventHardwareIDBusCycles-6]\n\t_ = x[EventHardwareIDStalledCyclesFrontend-7]\n\t_ = x[EventHardwareIDStalledCyclesBackend-8]\n\t_ = x[EventHardwareIDRefCPUCycles-9]\n}\n\nconst _EventHardwareID_name = \"EventHardwareIDCPUCyclesEventHardwareIDInstructionsEventHardwareIDCacheReferencesEventHardwareIDCacheMissesEventHardwareIDBranchInstructionsEventHardwareIDBranchMissesEventHardwareIDBusCyclesEventHardwareIDStalledCyclesFrontendEventHardwareIDStalledCyclesBackendEventHardwareIDRefCPUCycles\"\n\nvar _EventHardwareID_index = [...]uint16{0, 24, 51, 81, 107, 140, 167, 191, 227, 262, 289}\n\nfunc (i EventHardwareID) String() string {\n\tif i >= EventHardwareID(len(_EventHardwareID_index)-1) {\n\t\treturn \"EventHardwareID(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _EventHardwareID_name[_EventHardwareID_index[i]:_EventHardwareID_index[i+1]]\n}\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[EventSoftwareCPUClock-0]\n\t_ = x[EventSoftwareTaskClock-1]\n\t_ = x[EventSoftwarePageFaults-2]\n\t_ = x[EventSoftwareContextSwitches-3]\n\t_ = x[EventSoftwareCPUMigrations-4]\n\t_ = x[EventSoftwarePageFaultsMin-5]\n\t_ = x[EventSoftwarePageFaultsMaj-6]\n\t_ = x[EventSoftwareAlignmentFaults-7]\n\t_ = x[EventSoftwareEmulationFaults-8]\n\t_ = x[EventSoftwareDummy-9]\n\t_ = x[EventSoftwareBpfOutput-10]\n\t_ = x[EventSoftwareCGroupSwitches-11]\n}\n\nconst _EventSoftware_name = \"EventSoftwareCPUClockEventSoftwareTaskClockEventSoftwarePageFaultsEventSoftwareContextSwitchesEventSoftwareCPUMigrationsEventSoftwarePageFaultsMinEventSoftwarePageFaultsMajEventSoftwareAlignmentFaultsEventSoftwareEmulationFaultsEventSoftwareDummyEventSoftwareBpfOutputEventSoftwareCGroupSwitches\"\n\nvar _EventSoftware_index = [...]uint16{0, 21, 43, 66, 94, 120, 146, 172, 200, 228, 246, 268, 295}\n\nfunc (i EventSoftware) String() string {\n\tif i >= EventSoftware(len(_EventSoftware_index)-1) {\n\t\treturn \"EventSoftware(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _EventSoftware_name[_EventSoftware_index[i]:_EventSoftware_index[i+1]]\n}\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[HWCacheL1D-0]\n\t_ = x[HWCacheL1I-1]\n\t_ = x[HWCacheLL-2]\n\t_ = x[HWCacheDTLB-3]\n\t_ = x[HWCacheITLB-4]\n\t_ = x[HWCacheBPU-5]\n\t_ = x[HWCacheNode-6]\n}\n\nconst _HWCache_name = \"HWCacheL1DHWCacheL1IHWCacheLLHWCacheDTLBHWCacheITLBHWCacheBPUHWCacheNode\"\n\nvar _HWCache_index = [...]uint8{0, 10, 20, 29, 40, 51, 61, 72}\n\nfunc (i HWCache) String() string {\n\tif i >= HWCache(len(_HWCache_index)-1) {\n\t\treturn \"HWCache(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _HWCache_name[_HWCache_index[i]:_HWCache_index[i+1]]\n}\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[HWCacheOpRead-0]\n\t_ = x[HWCacheOpWrite-1]\n\t_ = x[HWCacheOpPrefetch-2]\n}\n\nconst _HWCacheOp_name = \"HWCacheOpReadHWCacheOpWriteHWCacheOpPrefetch\"\n\nvar _HWCacheOp_index = [...]uint8{0, 13, 27, 44}\n\nfunc (i HWCacheOp) String() string {\n\tif i >= HWCacheOp(len(_HWCacheOp_index)-1) {\n\t\treturn \"HWCacheOp(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _HWCacheOp_name[_HWCacheOp_index[i]:_HWCacheOp_index[i+1]]\n}\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[HWCacheResultAccess-0]\n\t_ = x[HWCacheResultMiss-1]\n}\n\nconst _HWCacheResult_name = \"HWCacheResultAccessHWCacheResultMiss\"\n\nvar _HWCacheResult_index = [...]uint8{0, 19, 36}\n\nfunc (i HWCacheResult) String() string {\n\tif i >= HWCacheResult(len(_HWCacheResult_index)-1) {\n\t\treturn \"HWCacheResult(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _HWCacheResult_name[_HWCacheResult_index[i]:_HWCacheResult_index[i+1]]\n}\n" }, { "path": "perffile/eventprecision_string.go", "content": "// Code generated by \"stringer -type=EventPrecision\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[EventPrecisionArbitrarySkid-0]\n\t_ = x[EventPrecisionConstantSkid-1]\n\t_ = x[EventPrecisionTryZeroSkid-2]\n\t_ = x[EventPrecisionZeroSkip-3]\n}\n\nconst _EventPrecision_name = \"EventPrecisionArbitrarySkidEventPrecisionConstantSkidEventPrecisionTryZeroSkidEventPrecisionZeroSkip\"\n\nvar _EventPrecision_index = [...]uint8{0, 27, 53, 78, 100}\n\nfunc (i EventPrecision) String() string {\n\tif i < 0 || i >= EventPrecision(len(_EventPrecision_index)-1) {\n\t\treturn \"EventPrecision(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _EventPrecision_name[_EventPrecision_index[i]:_EventPrecision_index[i+1]]\n}\n" }, { "path": "perffile/events.go", "content": "package perffile\n\n/*gendefs:C\n#include \n*/\n\n//go:generate -command bitstringer ../cmd/bitstringer/bitstringer\n\n//go:generate stringer -type=EventHardwareID,EventSoftware,HWCache,HWCacheOp,HWCacheResult\n//go:generate bitstringer -type=BreakpointOp -strip=BreakpointOp\n\n// EventGeneric is a generic representation of a performance event.\n//\n// Any perf event can be represented by EventGeneric, but some\n// encoding is generally necessary. Hence, EventGeneric can be\n// translated back and forth between specific Event* types.\ntype EventGeneric struct {\n\t// Type specifies the major type of this event, such as\n\t// hardware event, software event, or tracepoint.\n\tType EventType\n\n\t// ID is the specific event within the class described by\n\t// Type.\n\t//\n\t// In perf_event_attr, this corresponds to either\n\t// perf_event_attr.config or, if Type == EventTypeBreakpoint,\n\t// perf_event_attr.bp_type.\n\tID uint64\n\n\t// Config gives additional configuration specific to the event\n\t// described by Type and ID.\n\t//\n\t// In perf_event_attr, this corresponds to\n\t// perf_event_attr.config1 and config2.\n\tConfig []uint64\n}\n\n// Decode decodes a generic event g into a specific event type.\nfunc (g *EventGeneric) Decode() Event {\n\tswitch g.Type {\n\tcase EventTypeHardware:\n\t\treturn EventHardware{\n\t\t\tID: EventHardwareID(g.ID),\n\t\t\tPMUTypeID: PMUTypeID(g.ID >> 32),\n\t\t}\n\n\tcase EventTypeSoftware:\n\t\treturn EventSoftware(g.ID)\n\n\tcase EventTypeTracepoint:\n\t\treturn EventTracepoint(g.ID)\n\n\tcase EventTypeHWCache:\n\t\treturn EventHWCache{\n\t\t\tLevel: HWCache(g.ID),\n\t\t\tOp: HWCacheOp(g.ID >> 8),\n\t\t\tResult: HWCacheResult(g.ID >> 16),\n\t\t\tPMUTypeID: uint32(g.ID >> 32),\n\t\t}\n\n\tcase EventTypeRaw:\n\t\treturn EventRaw(g.ID)\n\n\tcase EventTypeBreakpoint:\n\t\treturn EventBreakpoint{\n\t\t\tBreakpointOp(g.ID),\n\t\t\tg.Config[0],\n\t\t\tg.Config[1],\n\t\t}\n\t}\n\n\treturn eventUnknown{*g}\n}\n\ntype eventUnknown struct {\n\tg EventGeneric\n}\n\nfunc (e eventUnknown) Generic() EventGeneric {\n\treturn e.g\n}\n\n// EventHardware represents a hardware event.\ntype EventHardware struct {\n\tID EventHardwareID\n\tPMUTypeID PMUTypeID // Map back to name with FileMeta.PMUMappings\n}\n\nfunc (e EventHardware) Generic() EventGeneric {\n\tid := uint64(e.ID) | uint64(e.PMUTypeID)<<32\n\treturn EventGeneric{Type: EventTypeHardware, ID: id}\n}\n\n// EventHardwareID represents a hardware event type.\n//\n// This corresponds to the perf_hw_id enum from\n// include/uapi/linux/perf_event.h\ntype EventHardwareID uint8\n\n//gendefs perf_hw_id.PERF_COUNT_HW_* EventHardwareID -omit-max\n\nconst (\n\tEventHardwareIDCPUCycles EventHardwareID = iota\n\tEventHardwareIDInstructions\n\tEventHardwareIDCacheReferences\n\tEventHardwareIDCacheMisses\n\tEventHardwareIDBranchInstructions\n\tEventHardwareIDBranchMisses\n\tEventHardwareIDBusCycles\n\tEventHardwareIDStalledCyclesFrontend\n\tEventHardwareIDStalledCyclesBackend\n\tEventHardwareIDRefCPUCycles\n)\n\n// PMUTypeID is a kernel-assigned type id assigned on PMU registration, visible\n// at /sys/bus/event_source/devices/$PMU/type.\ntype PMUTypeID uint32\n\n// EventSoftware represents a software event.\n//\n// This corresponds to the perf_sw_ids enum from\n// include/uapi/linux/perf_event.h\ntype EventSoftware uint64\n\n//gendefs perf_sw_ids.PERF_COUNT_SW_* EventSoftware -omit-max\n\nconst (\n\tEventSoftwareCPUClock EventSoftware = iota\n\tEventSoftwareTaskClock\n\tEventSoftwarePageFaults\n\tEventSoftwareContextSwitches\n\tEventSoftwareCPUMigrations\n\tEventSoftwarePageFaultsMin\n\tEventSoftwarePageFaultsMaj\n\tEventSoftwareAlignmentFaults\n\tEventSoftwareEmulationFaults\n\tEventSoftwareDummy\n\tEventSoftwareBpfOutput\n\tEventSoftwareCGroupSwitches\n)\n\nfunc (e EventSoftware) Generic() EventGeneric {\n\treturn EventGeneric{Type: EventTypeSoftware, ID: uint64(e)}\n}\n\n// EventTracepoint represents a kernel tracepoint event.\n//\n// The IDs of the tracepoint events are given by the\n// tracing/events/*/*/id files under debugfs.\ntype EventTracepoint uint64\n\nfunc (e EventTracepoint) Generic() EventGeneric {\n\treturn EventGeneric{Type: EventTypeTracepoint, ID: uint64(e)}\n}\n\n// EventHWCache represents a hardware cache event.\ntype EventHWCache struct {\n\tLevel HWCache\n\tOp HWCacheOp\n\tResult HWCacheResult\n\tPMUTypeID uint32\n}\n\nfunc (e EventHWCache) Generic() EventGeneric {\n\tid := uint64(e.Level) | uint64(e.Op)<<8 | uint64(e.Result)<<16 | uint64(e.PMUTypeID)<<32\n\treturn EventGeneric{Type: EventTypeHWCache, ID: id}\n}\n\n// HWCache represents a level in the hardware cache.\n//\n// This corresponds to the perf_hw_cache_id enum from\n// include/uapi/linux/perf_event.h\ntype HWCache uint8\n\n//gendefs perf_hw_cache_id.PERF_COUNT_HW_CACHE_* HWCache -omit-max\n\nconst (\n\tHWCacheL1D HWCache = iota\n\tHWCacheL1I\n\tHWCacheLL\n\tHWCacheDTLB\n\tHWCacheITLB\n\tHWCacheBPU\n\tHWCacheNode\n)\n\n// HWCacheOp represents a type of access to a hardware cache.\n//\n// This corresponds to the perf_hw_cache_op_id enum from\n// include/uapi/linux/perf_event.h\ntype HWCacheOp uint8\n\n//gendefs perf_hw_cache_op_id.PERF_COUNT_HW_CACHE_OP_* HWCacheOp -omit-max\n\nconst (\n\tHWCacheOpRead HWCacheOp = iota\n\tHWCacheOpWrite\n\tHWCacheOpPrefetch\n)\n\n// HWCacheResult represents the result of a accessing a hardware\n// cache.\n//\n// This corresponds to the perf_hw_cache_op_result_id enum from\n// include/uapi/linux/perf_event.h\ntype HWCacheResult uint8\n\n//gendefs perf_hw_cache_op_result_id.PERF_COUNT_HW_CACHE_RESULT_* HWCacheResult -omit-max\n\nconst (\n\tHWCacheResultAccess HWCacheResult = iota\n\tHWCacheResultMiss\n)\n\n// EventRaw represents a \"raw\" hardware PMU event in a CPU-specific\n// format.\ntype EventRaw uint64\n\nfunc (e EventRaw) Generic() EventGeneric {\n\treturn EventGeneric{Type: EventTypeRaw, ID: uint64(e)}\n}\n\n// EventBreakpoint represents a breakpoint event.\n//\n// Breakpoint events are triggered by a specific type of access to an\n// address in memory.\ntype EventBreakpoint struct {\n\t// Op specifies what type of access to Addr should trigger\n\t// this event.\n\tOp BreakpointOp\n\t// Addr is the address to watch for operation Op.\n\tAddr uint64\n\t// Len is the number of bytes to watch at Addr. What sizes are\n\t// supported depends on the hardware, but it generally must be\n\t// a small power of 2.\n\tLen uint64\n}\n\nfunc (e EventBreakpoint) Generic() EventGeneric {\n\treturn EventGeneric{Type: EventTypeBreakpoint, ID: uint64(e.Op), Config: []uint64{e.Addr, e.Len}}\n}\n\n// BreakpointOp is a type of memory access that can trigger a\n// breakpoint event.\n//\n// This corresponds to the HW_BREAKPOINT_* constants from\n// include/uapi/linux/hw_breakpoint.h\ntype BreakpointOp uint32\n\nconst (\n\tBreakpointOpR BreakpointOp = 1\n\tBreakpointOpW = 2\n\tBreakpointOpRW = BreakpointOpR | BreakpointOpW\n\tBreakpointOpX = 4\n)\n" }, { "path": "perffile/eventtype_string.go", "content": "// Code generated by \"stringer -type=EventType\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[EventTypeHardware-0]\n\t_ = x[EventTypeSoftware-1]\n\t_ = x[EventTypeTracepoint-2]\n\t_ = x[EventTypeHWCache-3]\n\t_ = x[EventTypeRaw-4]\n\t_ = x[EventTypeBreakpoint-5]\n}\n\nconst _EventType_name = \"EventTypeHardwareEventTypeSoftwareEventTypeTracepointEventTypeHWCacheEventTypeRawEventTypeBreakpoint\"\n\nvar _EventType_index = [...]uint8{0, 17, 34, 53, 69, 81, 100}\n\nfunc (i EventType) String() string {\n\tif i >= EventType(len(_EventType_index)-1) {\n\t\treturn \"EventType(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _EventType_name[_EventType_index[i]:_EventType_index[i+1]]\n}\n" }, { "path": "perffile/format.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"fmt\"\n\t\"io\"\n)\n\n/*gendefs:C\n#include \n*/\n\n//go:generate -command bitstringer ../cmd/bitstringer/bitstringer\n\nconst numFeatureBits = 256\n\n// perf_file_header from tools/perf/util/header.h\ntype fileHeader struct {\n\tMagic [8]byte\n\tSize uint64 // Size of fileHeader on disk\n\tAttrSize uint64 // Size of fileAttr on disk\n\tAttrs fileSection // Array of fileAttr\n\tData fileSection // Alternating recordHeader and record\n\t_ fileSection // event_types; ignored in v2\n\n\tFeatures [numFeatureBits / 64]uint64 // Bitmap of feature\n}\n\nfunc (h *fileHeader) hasFeature(f feature) bool {\n\treturn h.Features[f/64]&(1<<(uint(f)%64)) != 0\n}\n\n// perf_file_section from tools/perf/util/header.h\ntype fileSection struct {\n\tOffset, Size uint64\n}\n\nfunc (s fileSection) sectionReader(r io.ReaderAt) *io.SectionReader {\n\treturn io.NewSectionReader(r, int64(s.Offset), int64(s.Size))\n}\n\nfunc (s fileSection) data(r io.ReaderAt) ([]byte, error) {\n\tout := make([]byte, s.Size)\n\tn, err := r.ReadAt(out, int64(s.Offset))\n\tif n == len(out) {\n\t\treturn out, nil\n\t}\n\treturn nil, err\n}\n\n// HEADER_* enum from tools/perf/util/header.h\ntype feature int\n\n// TODO: gendefs HEADER_* feature -omit HEADER_FIRST_FEATURE -omit HEADER_FEAT_BITS\n// Tricky because tools/perf/util/header.h pulls in all sorts of other junk.\n\nconst (\n\tfeatureReserved feature = iota // always cleared\n\tfeatureTracingData\n\tfeatureBuildID\n\n\tfeatureHostname\n\tfeatureOSRelease\n\tfeatureVersion\n\tfeatureArch\n\tfeatureNrCpus\n\tfeatureCPUDesc\n\tfeatureCPUID\n\tfeatureTotalMem\n\tfeatureCmdline\n\tfeatureEventDesc\n\tfeatureCPUTopology\n\tfeatureNUMATopology\n\tfeatureBranchStack\n\tfeaturePMUMappings\n\tfeatureGroupDesc\n)\n\n// perf_file_attr from tools/perf/util/header.c\ntype fileAttr struct {\n\tAttr EventAttr\n\tIDs fileSection // array of attrID, one per core/thread\n}\n\n// eventAttrV0 is on-disk version 0 of the perf_event_attr structure.\n// Later versions extended this with additional fields, but the header\n// is always the same.\ntype eventAttrV0 struct {\n\tType EventType\n\tSize uint32\n\tConfig uint64\n\tSamplePeriodOrFreq uint64\n\tSampleFormat SampleFormat\n\tReadFormat ReadFormat\n\tFlags EventFlags\n\tWakeupEventsOrWatermark uint32\n\tBPType uint32\n\t// BPAddrOrConfig1 can also contain kprobe_func or uprobe_path,\n\t// but these are just pointers to strings used by the\n\t// perf_event_open API, so are not meaningful in perf files.\n\tBPAddrOrConfig1 uint64\n}\n\n// eventAttrVN is the on-disk latest version of the perf_event_attr\n// structure (currently version 7).\ntype eventAttrVN struct {\n\teventAttrV0\n\n\t// ABI v1\n\t//\n\t// BPLenOrConfig2 can also contain kprobe_addr or\n\t// probe_offset, which are used in conjunction with\n\t// kprobe_func and uprobe_path (above).\n\tBPLenOrConfig2 uint64\n\n\t// ABI v2\n\tBranchSampleType BranchSampleType\n\n\t// ABI v3\n\tSampleRegsUser uint64\n\tSampleStackUser uint32\n\tClockID int32\n\n\t// ABI v4\n\tSampleRegsIntr uint64\n\n\t// ABI v5\n\tAuxWatermark uint32\n\tSampleMaxStack uint16 // Max number of frame pointers in a callchain; should be < /proc/sys/kernel/perf_event_max_stack\n\tPad uint16 // Align to uint64\n\n\t// ABI v6\n\tAuxSampleSize uint32 // Size of aux samples to include in SampleFormatAux.\n\tPad2 uint32 // Align to uint64\n\n\t// ABI v7\n\tSigData uint64 // User-provided data passed in sigcontext to SIGTRAP.\n}\n\n// TODO: Make public\ntype attrID uint64\n\n// Event describes a specific performance monitoring event.\n//\n// Events are quite general. They can be hardware events such as\n// cycles or cache misses. They can be kernel software events such as\n// page faults. They can be user or kernel trace-points, or many other\n// things. All events happen at some instant and can be counted.\ntype Event interface {\n\t// Generic returns the generic representation of this Event.\n\tGeneric() EventGeneric\n}\n\n// An EventType is a general class of performance event.\n//\n// This corresponds to the perf_type_id enum from\n// include/uapi/linux/perf_event.h\ntype EventType uint32\n\n//gendefs perf_type_id.PERF_TYPE_* EventType -omit-max\n//go:generate stringer -type=EventType\n\nconst (\n\tEventTypeHardware EventType = iota\n\tEventTypeSoftware\n\tEventTypeTracepoint\n\tEventTypeHWCache\n\tEventTypeRaw\n\tEventTypeBreakpoint\n)\n\n// An EventID combined with an EventType describes a specific event.\ntype EventID uint64\n\n// EventAttr describes an event and how that event should be recorded.\n//\n// This corresponds to the perf_event_attr struct from\n// include/uapi/linux/perf_event.h\ntype EventAttr struct {\n\t// Event describes the event that will be (or was) counted or\n\t// sampled.\n\tEvent Event\n\n\t// SamplePeriod, if non-zero, is the approximate number of\n\t// events between each sample.\n\t//\n\t// For a sampled event, SamplePeriod will be set if\n\t// Flags&EventFlagsFreq == 0. See also SampleFreq.\n\tSamplePeriod uint64\n\n\t// SampleFreq, if non-zero, is the approximate number of\n\t// samples to record per second per core. This is approximated\n\t// by dynamically adjusting the event sampling period (see\n\t// perf_calculate_period) and thus is not particularly\n\t// accurate (and even less accurate for events that don't\n\t// happen at a regular rate). If SampleFormat includes\n\t// SampleFormatPeriod, each sample includes the number of\n\t// events until the next sample on the same CPU.\n\t//\n\t// For a sampled event, SampleFreq will be set if\n\t// Flags&EventFlagsFreq != 0. See also SamplePeriod.\n\tSampleFreq uint64\n\n\t// The format of RecordSamples\n\tSampleFormat SampleFormat\n\n\t// The format of SampleRead\n\tReadFormat ReadFormat\n\n\tFlags EventFlags\n\n\t// Precise indicates the precision of instruction pointers\n\t// recorded by this event.\n\tPrecise EventPrecision\n\n\t// WakeupEvents specifies to wake up every WakeupEvents\n\t// events. Either this or WakeupWatermark will be non-zero,\n\t// depending on Flags&EventFlagWakeupWatermark.\n\tWakeupEvents uint32\n\t// WakeupWatermark specifies to wake up every WakeupWatermark\n\t// bytes.\n\tWakeupWatermark uint32\n\n\t// BranchSampleType specifies the types of branches to record\n\t// in the branch stack if SampleFormat&SampleFormatBranchStack\n\t// is set, as well as what information to record about each\n\t// branch.\n\tBranchSampleType BranchSampleType\n\n\t// SampleRegsUser is a bitmask of user-space registers\n\t// captured at each sample in RecordSample.RegsUser. The\n\t// hardware register corresponding to each bit depends on the\n\t// register ABI.\n\tSampleRegsUser uint64\n\n\t// Size of user stack to dump on samples\n\tSampleStackUser uint32\n\n\t// SampleRegsIntr is a bitmask of registers captured at each\n\t// sample in RecordSample.RegsIntr. If Precise ==\n\t// EventPrecisionArbitrarySkid, these registers are captured\n\t// at the PMU interrupt. Otherwise, these registers are\n\t// captured by the hardware when it samples an instruction.\n\tSampleRegsIntr uint64\n\n\t// AuxWatermark is the watermark for the AUX area in bytes at\n\t// which user space is woken up to collect the AUX area.\n\tAuxWatermark uint32\n\n\t// SampleMaxStack is the maximum number of frame pointers in a\n\t// callchain. Should be < /proc/sys/kernel/perf_event_max_stack.\n\tSampleMaxStack uint16\n}\n\n// A SampleFormat is a bitmask of the fields recorded by a sample.\n//\n// This corresponds to the perf_event_sample_format enum from\n// include/uapi/linux/perf_event.h\ntype SampleFormat uint64\n\n//gendefs perf_event_sample_format.PERF_SAMPLE_* SampleFormat -omit-max\n//go:generate bitstringer -type=SampleFormat -strip=SampleFormat\n\nconst (\n\tSampleFormatIP SampleFormat = 1 << iota\n\tSampleFormatTID\n\tSampleFormatTime\n\tSampleFormatAddr\n\tSampleFormatRead\n\tSampleFormatCallchain\n\tSampleFormatID\n\tSampleFormatCPU\n\tSampleFormatPeriod\n\tSampleFormatStreamID\n\tSampleFormatRaw\n\tSampleFormatBranchStack\n\tSampleFormatRegsUser\n\tSampleFormatStackUser\n\tSampleFormatWeight\n\tSampleFormatDataSrc\n\tSampleFormatIdentifier\n\tSampleFormatTransaction\n\tSampleFormatRegsIntr\n\tSampleFormatPhysAddr\n\tSampleFormatAux\n\tSampleFormatCGroup\n\tSampleFormatDataPageSize\n\tSampleFormatCodePageSize\n\tSampleFormatWeightStruct\n)\n\n// sampleIDOffset returns the byte offset of the ID field within an\n// on-disk sample record with this sample format. If there is no ID\n// field, it returns -1.\nfunc (s SampleFormat) sampleIDOffset() int {\n\t// See __perf_evsel__calc_id_pos in tools/perf/util/evsel.c.\n\n\tif s&SampleFormatIdentifier != 0 {\n\t\treturn 0\n\t}\n\tif s&SampleFormatID == 0 {\n\t\treturn -1\n\t}\n\n\toff := 0\n\tif s&SampleFormatIP != 0 {\n\t\toff += 8\n\t}\n\tif s&SampleFormatTID != 0 {\n\t\toff += 8\n\t}\n\tif s&SampleFormatTime != 0 {\n\t\toff += 8\n\t}\n\tif s&SampleFormatAddr != 0 {\n\t\toff += 8\n\t}\n\treturn off\n}\n\n// recordIDOffset returns the byte offset of the ID field of\n// non-sample records relative to the end of the on-disk sample. If\n// there is no ID field, it returns -1.\nfunc (s SampleFormat) recordIDOffset() int {\n\t// See __perf_evsel__calc_is_pos in tools/perf/util/evsel.c.\n\n\tif s&SampleFormatIdentifier != 0 {\n\t\treturn -8\n\t}\n\tif s&SampleFormatID == 0 {\n\t\treturn -1\n\t}\n\n\toff := 0\n\tif s&SampleFormatCPU != 0 {\n\t\toff -= 8\n\t}\n\tif s&SampleFormatStreamID != 0 {\n\t\toff -= 8\n\t}\n\treturn off - 8\n}\n\n// trailerBytes returns the length in the sample_id trailer for\n// non-sample records.\nfunc (s SampleFormat) trailerBytes() int {\n\ts &= SampleFormatTID | SampleFormatTime | SampleFormatID | SampleFormatStreamID | SampleFormatCPU | SampleFormatIdentifier\n\treturn 8 * weight(uint64(s))\n}\n\n// ReadFormat is a bitmask of the fields recorded in the SampleRead\n// field(s) of a sample.\n//\n// This corresponds to the perf_event_read_format enum from\n// include/uapi/linux/perf_event.h\ntype ReadFormat uint64\n\n//gendefs perf_event_read_format.PERF_FORMAT_* ReadFormat -omit-max\n//go:generate bitstringer -type=ReadFormat -strip=ReadFormat\n\nconst (\n\tReadFormatTotalTimeEnabled ReadFormat = 1 << iota\n\tReadFormatTotalTimeRunning\n\tReadFormatID\n\tReadFormatGroup\n)\n\n// EventFlags is a bitmask of boolean properties of an event.\n//\n// This corresponds to the perf_event_attr enum from\n// include/uapi/linux/perf_event.h\ntype EventFlags uint64\n\n// TODO: gendefs (need to understand skip in the middle)\n//go:generate bitstringer -type=EventFlags -strip=EventFlag\n\nconst (\n\t// Event is disabled by default\n\tEventFlagDisabled EventFlags = 1 << iota\n\t// Children inherit this event\n\tEventFlagInherit\n\t// Event must always be on the PMU\n\tEventFlagPinned\n\t// Event is only group on PMU\n\tEventFlagExclusive\n\t// Don't count events in user/kernel/hypervisor/when idle\n\tEventFlagExcludeUser\n\tEventFlagExcludeKernel\n\tEventFlagExcludeHypervisor\n\tEventFlagExcludeIdle\n\t// Include mmap data\n\tEventFlagMmap\n\t// Include comm data\n\tEventFlagComm\n\t// Use frequency, not period\n\tEventFlagFreq\n\t// Per task counts\n\tEventFlagInheritStat\n\t// Next exec enables this event\n\tEventFlagEnableOnExec\n\t// Trace fork/exit\n\tEventFlagTask\n\t// WakeupWatermark is set rather than WakeupEvents.\n\tEventFlagWakeupWatermark\n\n\t// Skip two bits here for EventFlagPreciseIPMask\n\n\t// Non-exec mmap data\n\tEventFlagMmapData EventFlags = 1 << (2 + iota)\n\t// All events have SampleField fields\n\tEventFlagSampleIDAll\n\t// Don't count events in host/guest\n\tEventFlagExcludeHost\n\tEventFlagExcludeGuest\n\t// Don't include kernel/user callchains\n\tEventFlagExcludeCallchainKernel\n\tEventFlagExcludeCallchainUser\n\t// Include inode data in mmap events\n\tEventFlagMmapInodeData\n\t// Flag comm events that are due to an exec\n\tEventFlagCommExec\n\t// Use clock specified by clockid for time fields\n\tEventFlagClockID\n\t// Record context switch data. Enables RecordTypeSwitch and\n\t// RecordTypeSwitchCPUWide events.\n\tEventFlagContextSwitch\n\t// Write ring buffer from end to beginning.\n\tEventFlagWriteBackward\n\t// Include namespaces data.\n\tEventFlagNamespaces\n\t// Include ksymbol events.\n\tEventFlagKsymbol\n\t// Generate aux records instead of events.\n\tEventFlagAuxOutput\n\t// Include cgroup events.\n\tEventFlagCGroup\n\t// Include text poke events.\n\tEventFlagTextPoke\n\t// Use build ID in mmap2 events instead of inode.\n\tEventFlagBuildID\n\t// Children only inherit if cloned with CLONE_THREAD.\n\tEventFlagInheritThread\n\t// Event is removed from task on exec.\n\tEventFlagRemoveOnExec\n\t// Send synchronous SIGTRAP on event.\n\tEventFlagSigtrap\n\n\teventFlagPreciseShift = 15\n\teventFlagPreciseMask = 0x3 << eventFlagPreciseShift\n)\n\n// An EventPrecision indicates the precision of instruction pointers\n// recorded by an event. This can vary depending on the exact method\n// used to capture IPs.\ntype EventPrecision int\n\n//go:generate stringer -type=EventPrecision\n\nconst (\n\tEventPrecisionArbitrarySkid EventPrecision = iota\n\tEventPrecisionConstantSkid\n\tEventPrecisionTryZeroSkid\n\tEventPrecisionZeroSkip\n)\n\n// BranchSampleType is a bit-field of the types of branches to record\n// in the branch stack.\n//\n// This can include privilege levels to record, which can be different\n// from the privilege levels of the event being sampled. If none of\n// the privilege level bits are set, it defaults to the privilege\n// levels of the event.\n//\n// This corresponds to the perf_branch_sample_type enum from\n// include/uapi/linux/perf_event.h\ntype BranchSampleType uint64\n\n//gendefs perf_branch_sample_type.PERF_SAMPLE_BRANCH_* BranchSample BranchSampleType -omit-max\n//go:generate bitstringer -type=BranchSampleType -strip=BranchSample\n\nconst (\n\tBranchSampleUser BranchSampleType = 1 << iota // User branches\n\tBranchSampleKernel // Kernel branches\n\tBranchSampleHV // Hypervisor branches\n\n\tBranchSampleAny // Any branch types\n\tBranchSampleAnyCall // Any call branch\n\tBranchSampleAnyReturn // Any return branch\n\tBranchSampleIndCall // Indirect calls\n\tBranchSampleAbortTX // Transaction aborts\n\tBranchSampleInTX // In transaction\n\tBranchSampleNoTX // Not in transaction\n\tBranchSampleCond // Conditional branches\n\n\tBranchSampleCallStack // Call/ret stack\n\tBranchSampleIndJump // Indirect jumps\n\tBranchSampleCall // Direct call\n\n\tBranchSampleNoFlags // Don't set BranchRecord.Flags\n\tBranchSampleNoCycles // Don't set BranchRecord.Cycles\n\tBranchSampleTypeSave // Do set BranchRecord.Type\n\tBranchSampleHWIndex // Do set RecordSample.BranchHWIndex\n)\n\n// perf_event_header from include/uapi/linux/perf_event.h\ntype recordHeader struct {\n\tType RecordType\n\tMisc recordMisc\n\tSize uint16\n}\n\n// A RecordType indicates the type of a record in a profile. A record\n// can either be a profiling sample or give information about changes\n// to system state, such as a process calling mmap.\ntype RecordType uint32\n\n// TODO gendefs (mix of exported and unexported)\n//go:generate stringer -type=RecordType\n\nconst (\n\tRecordTypeMmap RecordType = 1 + iota\n\tRecordTypeLost\n\tRecordTypeComm\n\tRecordTypeExit\n\tRecordTypeThrottle\n\tRecordTypeUnthrottle\n\tRecordTypeFork\n\tRecordTypeRead\n\tRecordTypeSample\n\trecordTypeMmap2 // internal extended RecordTypeMmap\n\tRecordTypeAux\n\tRecordTypeItraceStart\n\tRecordTypeLostSamples // TODO: How does this differ from RecordTypeLost?\n\tRecordTypeSwitch\n\tRecordTypeSwitchCPUWide\n\tRecordTypeNamespaces\n\tRecordTypeKsymbol\n\tRecordTypeBPFEvent\n\tRecordTypeCGroup\n\tRecordTypeTextPoke\n\tRecordTypeAuxOutputHardwareID\n\n\trecordTypeUserStart RecordType = 64\n)\n\n// perf_user_event_type in tools/perf/util/event.h\n//\n// TODO: Figure out what to do with these. Some of these are only to\n// direct parsing so they should never escape the API. Some of these\n// are only for perf.data pipes.\nconst (\n\trecordTypeAttr RecordType = recordTypeUserStart + iota\n\trecordTypeEventType // deprecated\n\trecordTypeTracingData\n\trecordTypeBuildID\n\trecordTypeFinishedRound\n\trecordTypeIDIndex\n\tRecordTypeAuxtraceInfo // TODO\n\tRecordTypeAuxtrace\n\tRecordTypeAuxtraceError // TODO\n\trecordTypeThreadMap\n\trecordTypeCPUMap\n\trecordTypeStatConfig\n\trecordTypeStat\n\trecordTypeStatRound\n\trecordTypeEventUpdate\n\trecordTypeTimeConv\n\trecordTypeHeaderFeature\n)\n\n// PERF_RECORD_MISC_* from include/uapi/linux/perf_event.h\ntype recordMisc uint16\n\n// TODO gendefs PERF_RECORD_MISC_* recordMisc -omit PERF_RECORD_MISC_CPUMODE_UNKNOWN -omit PERF_RECORD_MISC_KERNEL -omit PERF_RECORD_MISC_USER -omit PERF_RECORD_MISC_HYPERVISOR -omit PERF_RECORD_MISC_GUEST_KERNEL -omit PERF_RECORD_MISC_GUEST_USER\n// (macros)\n\nconst (\n\trecordMiscCPUModeMask recordMisc = 7\n\trecordMiscProcMapParseTimeout = 1 << 12 // /proc/PID/maps parsing was truncated by a time-out (TODO: What record is this set on?)\n\trecordMiscMmapData = 1 << 13 // RecordTypeMmap* events\n\trecordMiscCommExec = 1 << 13 // RecordTypeComm events\n\trecordMiscForkExec = 1 << 13 // RecordTypeFork events (perf tool internal)\n\trecordMiscSwitchOut = 1 << 13 // RecordTypeSwitch* events\n\n\t// recordMiscExactIP applies to RecordTypeSample records. It\n\t// indicates that the sample IP points to the actual\n\t// instruction that triggered the event.\n\trecordMiscExactIP = 1 << 14\n\n\t// recordMiscSwitchOutPreempt applies to RecordTypeSwitch*\n\t// records. It indicates that the thread was preempted in a\n\t// TASK_RUNNING state.\n\trecordMiscSwitchOutPreempt = 1 << 14\n\n\t// recordMiscMmapBuildID applies to recordTypeMmap2 records. It\n\t// indicates that the event contain build ID data rather than inode\n\t// data.\n\trecordMiscMmapBuildID = 1 << 14\n)\n\n// Record is the common interface implemented by all profile record\n// types.\ntype Record interface {\n\tType() RecordType\n\tCommon() *RecordCommon\n}\n\n// RecordCommon stores fields that are common to all record types, as\n// well as additional metadata. It is not itself a Record.\n//\n// Many fields are optional and their presence is determined by the\n// bitmask EventAttr.SampleFormat. Some record types guarantee that\n// some of these fields will be filled.\ntype RecordCommon struct {\n\t// Offset is the byte offset of this event in the perf.data\n\t// file.\n\tOffset int64\n\n\t// Format is a bit mask of SampleFormat* values that indicate\n\t// which optional fields of this record are valid.\n\tFormat SampleFormat\n\n\t// EventAttr is the event, if any, associated with this record.\n\tEventAttr *EventAttr\n\n\tPID, TID int // if SampleFormatTID\n\tTime uint64 // if SampleFormatTime\n\tID attrID // if SampleFormatID or SampleFormatIdentifier\n\tStreamID uint64 // if SampleFormatStreamID\n\tCPU, Res uint32 // if SampleFormatCPU\n}\n\nfunc (r *RecordCommon) Common() *RecordCommon {\n\treturn r\n}\n\n// A RecordUnknown is a Record of unknown or unimplemented type.\ntype RecordUnknown struct {\n\trecordHeader\n\n\tRecordCommon\n\n\tData []byte\n}\n\nfunc (r *RecordUnknown) Type() RecordType {\n\treturn RecordType(r.recordHeader.Type)\n}\n\n// A RecordMmap records when a process being profiled called mmap.\n// RecordMmaps can also occur at the beginning of a profile to\n// describe the existing memory layout.\ntype RecordMmap struct {\n\t// RecordCommon.PID and .TID will always be filled\n\tRecordCommon\n\n\tData bool // from header.misc\n\n\t// Addr and Len are the virtual address of the start of this\n\t// mapping and its length in bytes.\n\tAddr, Len uint64\n\t// FileOffset is the byte offset in the mapped file of the\n\t// beginning of this mapping.\n\tFileOffset uint64\n\n\tMajor, Minor uint32 // if !EventFlagBuildID\n\tIno, InoGeneration uint64 // if !EventFlagBuildID\n\n\tBuildID []byte // if EventFlagBuildID\n\n\tProt, Flags uint32\n\tFilename string\n}\n\nfunc (r *RecordMmap) Type() RecordType {\n\treturn RecordTypeMmap\n}\n\n// A RecordLost records that profiling events were lost because of a\n// buffer overflow.\ntype RecordLost struct {\n\t// RecordCommon.ID and .EventAttr will always be filled\n\tRecordCommon\n\n\tNumLost uint64\n}\n\nfunc (r *RecordLost) Type() RecordType {\n\treturn RecordTypeLost\n}\n\n// A RecordComm records that a process being profiled called exec.\n// RecordComms can also occur at the beginning of a profile to\n// describe the existing set of processes.\ntype RecordComm struct {\n\t// RecordCommon.PID and .TID will always be filled\n\tRecordCommon\n\n\tExec bool // from header.misc\n\n\tComm string\n}\n\nfunc (r *RecordComm) Type() RecordType {\n\treturn RecordTypeComm\n}\n\n// A RecordExit records that a process or thread exited.\ntype RecordExit struct {\n\t// RecordCommon.PID, .TID, and .Time will always be filled\n\tRecordCommon\n\n\tPPID, PTID int\n}\n\nfunc (r *RecordExit) Type() RecordType {\n\treturn RecordTypeExit\n}\n\n// A RecordThrottle records that interrupt throttling was enabled or\n// disabled.\ntype RecordThrottle struct {\n\t// RecordCommon.Time, .ID, and .StreamID, and .EventAttr will\n\t// always be filled\n\tRecordCommon\n\n\tEnable bool\n}\n\nfunc (r *RecordThrottle) Type() RecordType {\n\treturn RecordTypeThrottle\n}\n\n// A RecordFork records that a process called clone to either fork the\n// process or create a new thread.\ntype RecordFork struct {\n\t// RecordCommon.PID, .TID, and .Time will always be filled\n\tRecordCommon\n\n\tPPID, PTID int\n}\n\nfunc (r *RecordFork) Type() RecordType {\n\treturn RecordTypeFork\n}\n\n// A RecordAux records the data was added to the AUX buffer.\ntype RecordAux struct {\n\tRecordCommon\n\n\tOffset, Size uint64\n\tFlags AuxFlags\n\tPMUFormat AuxPMUFormat\n}\n\nfunc (r *RecordAux) Type() RecordType {\n\treturn RecordTypeAux\n}\n\n// AuxFlags gives flags for an RecordAux event.\ntype AuxFlags uint64\n\n//TODO gendefs PERF_AUX_FLAG_* AuxFlag AuxFlags (macros)\n//go:generate bitstringer -type=AuxFlags -strip=AuxFlag\n\nconst (\n\t// Record was truncated to fit in the ring buffer.\n\tAuxFlagTruncated AuxFlags = 1 << iota\n\n\t// AUX data was collected in overwrite mode, so the AUX buffer\n\t// was treated as a circular ring buffer.\n\tAuxFlagOverwrite\n\n\t// Record contains gaps.\n\tAuxFlagPartial\n\n\t// Sample collided with another.\n\tAuxFlagCollision\n)\n\n// AuxPMUFormat is the PMU specific trace format type. Values are architecture dependent.\ntype AuxPMUFormat uint8\n\n//go:generate stringer -type=AuxPMUFormat\n\nconst (\n\t// ARM\n\tAuxPMUFormatCoresightCoresight AuxPMUFormat = 0 // ARM Coresight format CORESIGHT.\n\tAuxPMUFormatCoresightRaw AuxPMUFormat = 1 // ARM Coresight format RAW.\n\n\tAuxPMUFormatDefault AuxPMUFormat = 0\n)\n\n// A RecordItraceStart indicates that an instruction trace started.\ntype RecordItraceStart struct {\n\t// PID and TID will always be filled in.\n\tRecordCommon\n}\n\nfunc (r *RecordItraceStart) Type() RecordType {\n\treturn RecordTypeItraceStart\n}\n\n// A RecordLostSamples records the number of dropped or lost samples.\ntype RecordLostSamples struct {\n\tRecordCommon\n\n\tLost uint64\n}\n\nfunc (r *RecordLostSamples) Type() RecordType {\n\treturn RecordTypeLostSamples\n}\n\n// A RecordSwitch records a context switch in or out of the monitored\n// process. See also RecordSwitchCPUWide.\ntype RecordSwitch struct {\n\tRecordCommon\n\n\t// Out indicates this is a switch out. Otherwise, this is a\n\t// switch in.\n\tOut bool\n}\n\nfunc (r *RecordSwitch) Type() RecordType {\n\treturn RecordTypeSwitch\n}\n\n// RecordSwitchCPUWide is a CPU-wide version of RecordSwitch.\ntype RecordSwitchCPUWide struct {\n\tRecordCommon\n\n\t// Out indicates this is a switch out. Otherwise, this is a\n\t// switch in.\n\tOut bool\n\n\t// Preempt indicates that the preempted thread was in\n\t// TASK_RUNNING state. That is, this was an involuntary\n\t// preemption.\n\tPreempt bool\n\n\t// SwitchPID and SwitchTID are the PID and TID of the process\n\t// being switched in or switched out.\n\tSwitchPID, SwitchTID int\n}\n\nfunc (r *RecordSwitchCPUWide) Type() RecordType {\n\treturn RecordTypeSwitchCPUWide\n}\n\ntype RecordNamespaces struct {\n\t// PID and TID are always filled in.\n\tRecordCommon\n\n\tNamespaces []Namespace\n}\n\nfunc (r *RecordNamespaces) Type() RecordType {\n\treturn RecordTypeNamespaces\n}\n\ntype Namespace struct {\n\tDev, Inode uint64\n}\n\n// RecordKsymbol record kernel symbol register/unregister information, for\n// dynamically loaded or JITed kernel functions.\ntype RecordKsymbol struct {\n\tRecordCommon\n\n\tAddr uint64\n\tLen uint32\n\tKsymType KsymbolType\n\tFlags KsymbolFlags\n\tName string\n}\n\nfunc (r *RecordKsymbol) Type() RecordType {\n\treturn RecordTypeKsymbol\n}\n\ntype KsymbolType uint16\n\n//gendefs perf_record_ksymbol_type.PERF_RECORD_KSYMBOL_TYPE_* KsymbolType -omit-max\n//go:generate bitstringer -type=KsymbolType -strip=KsymbolType\n\nconst (\n\tKsymbolTypeUnknown KsymbolType = iota\n\tKsymbolTypeBpf\n\tKsymbolTypeOol\n)\n\n// KsymbolFlags gives flags for a RecordKsymbol event.\ntype KsymbolFlags uint64\n\n// TODO gendefs PERF_RECORD_KSYMBOL_FLAGS_* KsymbolFlag KsymbolFlags (macros)\n//go:generate bitstringer -type=KsymbolFlags -strip=KsymbolFlag\n\nconst (\n\t// Ksymbol was unregistered.\n\tKsymbolFlagUnregister KsymbolFlags = iota\n)\n\n// RecordBPFEvent records BPF program load/unload information.\ntype RecordBPFEvent struct {\n\tRecordCommon\n\n\tEventType BPFEventType\n\tFlags BPFEventFlags\n\tID uint32\n\tTag uint64\n}\n\nfunc (r *RecordBPFEvent) Type() RecordType {\n\treturn RecordTypeBPFEvent\n}\n\ntype BPFEventType uint16\n\n// gendefs perf_bpf_event_type.PERF_BPF_EVENT_* BPFEventType -omit-max\n//go:generate bitstringer -type=BPFEventType -strip=BPFEventType\n\nconst (\n\tBPFEventTypeUnknown BPFEventType = iota\n\tBPFEventTypeProgLoad\n\tBPFEventTypeProgUnload\n)\n\ntype BPFEventFlags uint16\n\n// No BPFEvent flags are defined yet.\n\n// RecordCGroup records the assosciation between a cgroup id and path.\ntype RecordCGroup struct {\n\tRecordCommon\n\n\tID uint32\n\tPath string\n}\n\nfunc (r *RecordCGroup) Type() RecordType {\n\treturn RecordTypeCGroup\n}\n\n// RecordTextPoke records single instruction changes to the kernel text. This\n// event records the address modified and the old and new code.\ntype RecordTextPoke struct {\n\tRecordCommon\n\n\tAddr uint64\n\tOld []byte\n\tNew []byte\n}\n\nfunc (r *RecordTextPoke) Type() RecordType {\n\treturn RecordTypeTextPoke\n}\n\n// RecordAuxOutputHardwareID records an archtecture-specific hardware ID\n// assosciated with the aux data for this event ID.\n//\n// e.g., this is used to disambiguate different PEBS event types from each\n// other when using PEBS-via-PT.\ntype RecordAuxOutputHardwareID struct {\n\tRecordCommon\n\n\tID uint64\n}\n\nfunc (r *RecordAuxOutputHardwareID) Type() RecordType {\n\treturn RecordTypeAuxOutputHardwareID\n}\n\ntype RecordAuxtraceInfo struct {\n\tRecordCommon\n\n\tKind uint32\n\n\tPriv []uint64\n}\n\nfunc (r *RecordAuxtraceInfo) Type() RecordType {\n\treturn RecordTypeAuxtraceInfo\n}\n\ntype RecordAuxtrace struct {\n\t// TID and CPU are always filled in.\n\tRecordCommon\n\n\t// Offset is the byte offset of the aux data in the aux mmap.\n\t// Not meaningful in perf data files.\n\tOffset uint64\n\n\t// Ref is a unique identifier for this auxtrace block.\n\t//\n\t// TODO: What's the point of this? Is it cross-referenced\n\t// against something?\n\tRef uint64\n\n\t// Idx is the index of the aux mmap region of this data.\n\t// Not meaningful in perf data files.\n\tIdx uint32\n\n\t// Data is the raw auxiliary data. The encoding of this\n\t// depends on the latest RecordAuxtraceInfo.\n\tData []byte\n}\n\nfunc (r *RecordAuxtrace) Type() RecordType {\n\treturn RecordTypeAuxtrace\n}\n\n// A RecordSample records a profiling sample event.\n//\n// Typically only a subset of the fields are used. Which fields are\n// set can be determined from the bitmask\n// RecordSample.EventAttr.SampleFormat.\ntype RecordSample struct {\n\t// RecordCommon.EventAttr will always be filled.\n\t// RecordCommon.Format descibes the optional fields in this\n\t// structure, as well as the optional common fields.\n\tRecordCommon\n\n\tCPUMode CPUMode // from header.misc\n\tExactIP bool // from header.misc\n\n\tIP uint64 // if SampleFormatIP\n\tAddr uint64 // if SampleFormatAddr\n\n\t// Period is the number of events on this CPU until the next\n\t// sample. In frequency sampling mode, this is adjusted\n\t// dynamically based on the rate of recent events. In period\n\t// sampling mode, this is fixed.\n\tPeriod uint64 // if SampleFormatPeriod\n\n\t// SampleRead records raw event counter values. If this is an\n\t// event group, this slice will have more than one element;\n\t// otherwise, it will have one element.\n\tSampleRead []Count // if SampleFormatRead\n\n\t// Callchain gives the call stack of the sampled instruction,\n\t// starting from the sampled instruction itself. The call\n\t// chain may span several types of stacks (e.g., it may start\n\t// in a kernel stack, then transition to a user stack). Before\n\t// the first IP from each stack there will be a Callchain*\n\t// constant indicating the stack type for the following IPs.\n\tCallchain []uint64 // if SampleFormatCallchain\n\n\t// BranchHWIndex is the low level index of the raw hardware branch\n\t// record (e.g., LBR) for BranchStack[0].\n\t//\n\t// BranchStack is an abstraction of the raw hardware branch records,\n\t// and the index of the raw entry can be very useful for stitching the\n\t// stacks of multiple samples to reconstruct the call stack.\n\t//\n\t// The value is between -1 (unknown) and the max depth from\n\t// /sys/devices/cpu/caps/branches.\n\tBranchHWIndex int64 // if BranchSampleHWIndex\n\n\tBranchStack []BranchRecord // if SampleFormatBranchStack\n\n\t// RegsUserABI and RegsUser record the ABI and values of\n\t// user-space registers as of this sample. Note that these are\n\t// the current user-space registers even if this sample\n\t// occurred at a kernel PC. RegsUser[i] records the value of\n\t// the register indicated by the i-th set bit of\n\t// EventAttr.SampleRegsUser.\n\tRegsUserABI SampleRegsABI // if SampleFormatRegsUser\n\tRegsUser []uint64 // if SampleFormatRegsUser\n\n\t// RegsIntrABI And RegsIntr record the ABI and values of\n\t// registers as of this sample. Unlike RegsUser, these can be\n\t// kernel-space registers if this sample occurs in the kernel.\n\t// RegsIntr[i] records the value of the register indicated by\n\t// the i-th set bit of EventAttr.SampleRegsIntr.\n\tRegsIntrABI SampleRegsABI // if SampleFormatRegsIntr\n\tRegsIntr []uint64 // if SampleFormatRegsIntr\n\n\tStackUser []byte // if SampleFormatStackUser\n\tStackUserDynSize uint64 // if SampleFormatStackUser\n\n\tWeight uint64 // if SampleFormatWeight or SampleFormatWeightStruct\n\tWeights Weights // if SampleFormatWeightStruct\n\n\tDataSrc DataSrc // if SampleFormatDataSrc\n\n\tTransaction Transaction // if SampleFormatTransaction\n\tAbortCode uint32 // if SampleFormatTransaction\n\n\tPhysAddr uint64 // if SampleFormatPhysAddr\n\n\tCGroup uint64 // if SampleFormatCGroup\n\n\tDataPageSize uint64 // if SampleFormatDataPageSize\n\tCodePageSize uint64 // if SampleFormatCodePageSize\n\n\tAux []byte // if SampleFormatAux\n}\n\nfunc (r *RecordSample) Type() RecordType {\n\treturn RecordTypeSample\n}\n\nfunc (r *RecordSample) String() string {\n\t// TODO: Stringers for other record types\n\tf := r.Format\n\ts := fmt.Sprintf(\"{Offset:%v Format:%v EventAttr:%p CPUMode:%v ExactIP:%v\", r.Offset, r.Format, r.EventAttr, r.CPUMode, r.ExactIP)\n\tif f&(SampleFormatID|SampleFormatIdentifier) != 0 {\n\t\ts += fmt.Sprintf(\" ID:%d\", r.ID)\n\t}\n\tif f&SampleFormatIP != 0 {\n\t\ts += fmt.Sprintf(\" IP:%#x\", r.IP)\n\t}\n\tif f&SampleFormatTID != 0 {\n\t\ts += fmt.Sprintf(\" PID:%d TID:%d\", r.PID, r.TID)\n\t}\n\tif f&SampleFormatTime != 0 {\n\t\ts += fmt.Sprintf(\" Time:%d\", r.Time)\n\t}\n\tif f&SampleFormatAddr != 0 {\n\t\ts += fmt.Sprintf(\" Addr:%#x\", r.Addr)\n\t}\n\tif f&SampleFormatStreamID != 0 {\n\t\ts += fmt.Sprintf(\" StreamID:%d\", r.StreamID)\n\t}\n\tif f&SampleFormatCPU != 0 {\n\t\ts += fmt.Sprintf(\" CPU:%d Res:%d\", r.CPU, r.Res)\n\t}\n\tif f&SampleFormatPeriod != 0 {\n\t\ts += fmt.Sprintf(\" Period:%d\", r.Period)\n\t}\n\tif f&SampleFormatRead != 0 {\n\t\ts += fmt.Sprintf(\" SampleRead:%v\", r.SampleRead)\n\t}\n\tif f&SampleFormatCallchain != 0 {\n\t\ts += fmt.Sprintf(\" Callchain:%#x\", r.Callchain)\n\t}\n\tif f&SampleFormatBranchStack != 0 {\n\t\ts += fmt.Sprintf(\" BranchStack:%v\", r.BranchStack)\n\t}\n\tif f&SampleFormatRegsUser != 0 {\n\t\ts += fmt.Sprintf(\" RegsUserABI:%v RegsUser:%v\", r.RegsUserABI, r.RegsUser)\n\t}\n\tif f&SampleFormatRegsIntr != 0 {\n\t\ts += fmt.Sprintf(\" RegsIntrABI:%v RegsIntr:%v\", r.RegsIntrABI, r.RegsIntr)\n\t}\n\tif f&SampleFormatStackUser != 0 {\n\t\ts += fmt.Sprintf(\" StackUser:[...] StackUserDynSize:%d\", r.StackUserDynSize)\n\t}\n\tif f&SampleFormatWeight != 0 {\n\t\ts += fmt.Sprintf(\" Weight:%d\", r.Weight)\n\t}\n\tif f&SampleFormatDataSrc != 0 {\n\t\ts += fmt.Sprintf(\" DataSrc:%+v\", r.DataSrc)\n\t}\n\tif f&SampleFormatTransaction != 0 {\n\t\ts += fmt.Sprintf(\" Transaction:%v AbortCode:%d\", r.Transaction, r.AbortCode)\n\t}\n\tif f&SampleFormatPhysAddr != 0 {\n\t\ts += fmt.Sprintf(\" PhysAddr:%#x\", r.PhysAddr)\n\t}\n\tif f&SampleFormatAux != 0 {\n\t\ts += fmt.Sprintf(\" Aux:%v\", r.Aux)\n\t}\n\tif f&SampleFormatCGroup != 0 {\n\t\ts += fmt.Sprintf(\" CGroup:%d\", r.CGroup)\n\t}\n\tif f&SampleFormatDataPageSize != 0 {\n\t\ts += fmt.Sprintf(\" DataPageSize:%#x\", r.DataPageSize)\n\t}\n\tif f&SampleFormatCodePageSize != 0 {\n\t\ts += fmt.Sprintf(\" CodePageSize:%#x\", r.CodePageSize)\n\t}\n\tif f&SampleFormatWeightStruct != 0 {\n\t\ts += fmt.Sprintf(\" Weights:%v\", r.Weights)\n\t}\n\treturn s + \"}\"\n}\n\n// Fields returns the list of names of valid fields in r based on\n// r.Format. This is useful for writing custom printing functions.\nfunc (r *RecordSample) Fields() []string {\n\tf := r.Format\n\tfs := []string{\"Offset\", \"Format\", \"EventAttr\", \"CPUMode\", \"ExactIP\"}\n\tif f&(SampleFormatID|SampleFormatIdentifier) != 0 {\n\t\tfs = append(fs, \"ID\")\n\t}\n\tif f&SampleFormatIP != 0 {\n\t\tfs = append(fs, \"IP\")\n\t}\n\tif f&SampleFormatTID != 0 {\n\t\tfs = append(fs, \"PID\", \"TID\")\n\t}\n\tif f&SampleFormatTime != 0 {\n\t\tfs = append(fs, \"Time\")\n\t}\n\tif f&SampleFormatAddr != 0 {\n\t\tfs = append(fs, \"Addr\")\n\t}\n\tif f&SampleFormatStreamID != 0 {\n\t\tfs = append(fs, \"StreamID\")\n\t}\n\tif f&SampleFormatCPU != 0 {\n\t\tfs = append(fs, \"CPU\", \"Res\")\n\t}\n\tif f&SampleFormatPeriod != 0 {\n\t\tfs = append(fs, \"Period\")\n\t}\n\tif f&SampleFormatRead != 0 {\n\t\tfs = append(fs, \"SampleRead\")\n\t}\n\tif f&SampleFormatCallchain != 0 {\n\t\tfs = append(fs, \"Callchain\")\n\t}\n\tif f&SampleFormatBranchStack != 0 {\n\t\tfs = append(fs, \"BranchStack\")\n\t}\n\tif f&SampleFormatRegsUser != 0 {\n\t\tfs = append(fs, \"RegsUserABI\", \"RegsUser\")\n\t}\n\tif f&SampleFormatRegsIntr != 0 {\n\t\tfs = append(fs, \"RegsIntrABI\", \"RegsIntr\")\n\t}\n\tif f&SampleFormatStackUser != 0 {\n\t\tfs = append(fs, \"StackUser\", \"StackUserDynSize\")\n\t}\n\tif f&SampleFormatWeight != 0 {\n\t\tfs = append(fs, \"Weight\")\n\t}\n\tif f&SampleFormatDataSrc != 0 {\n\t\tfs = append(fs, \"DataSrc\")\n\t}\n\tif f&SampleFormatTransaction != 0 {\n\t\tfs = append(fs, \"Transaction\", \"AbortCode\")\n\t}\n\tif f&SampleFormatPhysAddr != 0 {\n\t\tfs = append(fs, \"PhysAddr\")\n\t}\n\tif f&SampleFormatAux != 0 {\n\t\tfs = append(fs, \"Aux\")\n\t}\n\tif f&SampleFormatCGroup != 0 {\n\t\tfs = append(fs, \"CGroup\")\n\t}\n\tif f&SampleFormatDataPageSize != 0 {\n\t\tfs = append(fs, \"DataPageSize\")\n\t}\n\tif f&SampleFormatCodePageSize != 0 {\n\t\tfs = append(fs, \"CodePageSize\")\n\t}\n\tif f&SampleFormatWeightStruct != 0 {\n\t\tfs = append(fs, \"Weights\")\n\t}\n\treturn fs\n}\n\n// A CPUMode indicates the privilege level of a sample or event.\n//\n// This corresponds to PERF_RECORD_MISC_CPUMODE from\n// include/uapi/linux/perf_event.h\ntype CPUMode uint16\n\n// TODO: gendefs (need to extract from PERF_RECORD_MISC_* flags)\n//go:generate stringer -type=CPUMode\n\nconst (\n\tCPUModeUnknown CPUMode = iota\n\tCPUModeKernel\n\tCPUModeUser\n\tCPUModeHypervisor\n\tCPUModeGuestKernel\n\tCPUModeGuestUser\n)\n\n// A Count records the raw value of an event counter.\n//\n// Typically only a subset of the fields are used. Which fields are\n// set can be determined from the bitmask in the sample's\n// EventAttr.ReadFormat.\n//\n// This corresponds to perf_event_read_format from\n// include/uapi/linux/perf_event.h\ntype Count struct {\n\tValue uint64 // Event counter value\n\tTimeEnabled uint64 // if ReadFormatTotalTimeEnabled\n\tTimeRunning uint64 // if ReadFormatTotalTimeRunning\n\tEventAttr *EventAttr // if ReadFormatID\n}\n\n// A BranchRecord records a single branching event in a sample.\ntype BranchRecord struct {\n\tFrom, To uint64\n\tFlags BranchFlags\n\n\tCycles uint16 // Cycle count to last branch (or 0)\n\n\t// Type is the type of branch instruction that caused this\n\t// branch. If supported, this is set by the kernel by\n\t// disassembling the branch instruction, since the binary\n\t// itself may not be available at decoding time. This is only\n\t// set if EventAttr.BranchSampleType&BranchSampleTypeSave is\n\t// set in the event.\n\tType BranchType\n}\n\ntype BranchFlags uint64\n\n//go:generate bitstringer -type=BranchFlags -strip=BranchFlag\n\nconst (\n\t// BranchFlagMispredicted indicates branch target was mispredicted.\n\tBranchFlagMispredicted BranchFlags = 1 << iota\n\n\t// BranchFlagPredicted indicates branch target was predicted.\n\t// In case predicted/mispredicted information is unavailable,\n\t// both flags will be unset.\n\tBranchFlagPredicted\n\n\t// BranchFlagInTransaction indicates the branch occurred in a\n\t// transaction.\n\tBranchFlagInTransaction\n\n\t// BranchFlagAbort indicates the branch is a transaction abort.\n\tBranchFlagAbort\n)\n\ntype BranchType uint8\n\n//gendefs PERF_BR_* BranchType -omit-max\n\nconst (\n\tBranchTypeUnknown BranchType = iota // unknown\n\tBranchTypeCond // conditional\n\tBranchTypeUncond // unconditional\n\tBranchTypeInd // indirect\n\tBranchTypeCall // function call\n\tBranchTypeIndCall // indirect function call\n\tBranchTypeRet // function return\n\tBranchTypeSyscall // syscall\n\tBranchTypeSysret // syscall return\n\tBranchTypeCondCall // conditional function call\n\tBranchTypeCondRet // conditional function return\n\tBranchTypeEret // exception return\n\tBranchTypeIrq // interrupt\n)\n\n//gendefs perf_callchain_context.PERF_CONTEXT_* Callchain uint64 -omit-max\n\n// Special markers used in RecordSample.Callchain to mark boundaries\n// between types of stacks.\n//\n// These correspond to PERF_CONTEXT_* from\n// include/uapi/linux/perf_event.h\nconst (\n\tCallchainHV uint64 = 0xffffffffffffffe0 // -32\n\tCallchainKernel = 0xffffffffffffff80 // -128\n\tCallchainUser = 0xfffffffffffffe00 // -512\n\tCallchainGuest = 0xfffffffffffff800 // -2048\n\tCallchainGuestKernel = 0xfffffffffffff780 // -2176\n\tCallchainGuestUser = 0xfffffffffffff600 // -2560\n)\n\n// SampleRegsABI indicates the register ABI of a given sample for\n// architectures that support multiple ABIs.\n//\n// This corresponds to the perf_sample_regs_abi enum from\n// include/uapi/linux/perf_event.h\ntype SampleRegsABI uint64\n\n//gendefs perf_sample_regs_abi.PERF_SAMPLE_REGS_ABI_* SampleRegsABI\n//go:generate stringer -type=SampleRegsABI\n\nconst (\n\tSampleRegsABINone SampleRegsABI = iota\n\tSampleRegsABI32\n\tSampleRegsABI64\n)\n\ntype DataSrc struct {\n\tOp DataSrcOp\n\tMiss bool // if true, Level specifies miss, rather than hit\n\tLevel DataSrcLevel\n\tSnoop DataSrcSnoop\n\tLocked DataSrcLock\n\tTLB DataSrcTLB\n\tLevelNum DataSrcLevelNum\n\tRemote bool\n\tBlock DataSrcBlock\n\tHops DataSrcHops\n}\n\ntype DataSrcOp int\n\n//go:generate bitstringer -type=DataSrcOp -strip=DataSrcOp\n\nconst (\n\tDataSrcOpLoad DataSrcOp = 1 << iota\n\tDataSrcOpStore\n\tDataSrcOpPrefetch\n\tDataSrcOpExec\n\n\tDataSrcOpNA DataSrcOp = 0\n)\n\ntype DataSrcLevel int\n\n//go:generate bitstringer -type=DataSrcLevel -strip=DataSrcLevel\n\nconst (\n\tDataSrcLevelL1 DataSrcLevel = 1 << iota\n\tDataSrcLevelLFB // Line fill buffer\n\tDataSrcLevelL2\n\tDataSrcLevelL3\n\tDataSrcLevelLocalRAM // Local DRAM\n\tDataSrcLevelRemoteRAM1 // Remote DRAM (1 hop)\n\tDataSrcLevelRemoteRAM2 // Remote DRAM (2 hops)\n\tDataSrcLevelRemoteCache1 // Remote cache (1 hop)\n\tDataSrcLevelRemoteCache2 // Remote cache (2 hops)\n\tDataSrcLevelIO // I/O memory\n\tDataSrcLevelUncached\n\n\tDataSrcLevelNA DataSrcLevel = 0\n)\n\ntype DataSrcSnoop int\n\n//go:generate bitstringer -type=DataSrcSnoop -strip=DataSrcSnoop\n\nconst (\n\tDataSrcSnoopNone DataSrcSnoop = 1 << iota\n\tDataSrcSnoopHit\n\tDataSrcSnoopMiss\n\tDataSrcSnoopHitM // Snoop hit modified\n\tDataSrcSnoopFwd\n\n\tDataSrcSnoopNA DataSrcSnoop = 0\n)\n\ntype DataSrcLock int\n\n//go:generate stringer -type=DataSrcLock\n\nconst (\n\tDataSrcLockNA DataSrcLock = iota\n\tDataSrcLockUnlocked\n\tDataSrcLockLocked\n)\n\ntype DataSrcTLB int\n\n//go:generate bitstringer -type=DataSrcTLB -strip=DataSrcTLB\n\nconst (\n\tDataSrcTLBHit DataSrcTLB = 1 << iota\n\tDataSrcTLBMiss\n\tDataSrcTLBL1\n\tDataSrcTLBL2\n\tDataSrcTLBHardwareWalker\n\tDataSrcTLBOSFaultHandler\n\n\tDataSrcTLBNA DataSrcTLB = 0\n)\n\ntype DataSrcLevelNum int\n\n// TODO gendefs (macros)\n//go:generate stringer -type=DataSrcLevelNum\n\nconst (\n\tDataSrcLevelNumL1 DataSrcLevelNum = 0x01 // L1\n\tDataSrcLevelNumL2 DataSrcLevelNum = 0x02 // L2\n\tDataSrcLevelNumL3 DataSrcLevelNum = 0x03 // L3\n\tDataSrcLevelNumL4 DataSrcLevelNum = 0x04 // L4\n\tDataSrcLevelNumAnyCache DataSrcLevelNum = 0x0b // Any cache\n\tDataSrcLevelNumLFB DataSrcLevelNum = 0x0c // LFB\n\tDataSrcLevelNumRAM DataSrcLevelNum = 0x0d // RAM\n\tDataSrcLevelNumPMEM DataSrcLevelNum = 0x0e // PMEM\n\tDataSrcLevelNumNA DataSrcLevelNum = 0x0f // N/A\n)\n\ntype DataSrcBlock int\n\n//go:generate bitstringer -type=DataSrcBlock -strip=DataSrcBlock\n\nconst (\n\tDataSrcBlockData DataSrcBlock = 1 << iota // Data could not be forwarded\n\tDataSrcBlockAddr // Address conflict\n\n\tDataSrcBlockNA DataSrcBlock = 0\n)\n\ntype DataSrcHops int\n\n//go:generate stringer -type=DataSrcHops\n\nconst (\n\tDataSrcHopsCore DataSrcHops = 1 // Remote core, same node\n\tDataSrcHopsNode DataSrcHops = 3 // Remote node, same socket\n\tDataSrcHopsSocket DataSrcHops = 3 // Remote socket, same board\n\tDataSrcHopesBoard DataSrcHops = 4 // Remote board\n\n\tDataSrcHopsNA DataSrcHops = 0\n)\n\ntype Transaction int\n\n// TODO: Handle abort code mask\n\n//gendefs PERF_TXN_* Transaction -omit-max -omit PERF_TXN_ABORT_MASK -omit PERF_TXN_ABORT_SHIFT\n//go:generate bitstringer -type=Transaction -strip=Transaction\n\nconst (\n\tTransactionElision Transaction = 1 << iota // From elision\n\tTransactionTransaction // From transaction\n\tTransactionSync // Instruction is related\n\tTransactionAsync // Instruction is not related\n\tTransactionRetry // Retry possible\n\tTransactionConflict // Conflict abort\n\tTransactionCapacityWrite // Capactiy write abort\n\tTransactionCapacityRead // Capactiy read abort\n)\n\ntype Weights struct {\n\tVar1 uint32\n\tVar2 uint16\n\tVar3 uint16\n}\n" }, { "path": "perffile/gendefs.sh", "content": "#!/bin/sh\n\nset -e\n\nif [ \"$1\" = -u ]; then\n update=1\n shift\nfi\n\nif [ \"$#\" != 1 ]; then\n echo \"Usage: $0 [-u] \" 2>&1\n exit 2\nfi\nlinux=\"$1\"\n\ngo build ../internal/gendefs\n\nprocess() {\n ./gendefs -ccflags \"-I $linux\" $1 > .$1.tmp\n if [ -z \"$update\" ]; then\n diff -u $1 .$1.tmp || true\n rm .$1.tmp\n else\n mv .$1.tmp $1\n fi\n}\n\nprocess events.go\nprocess format.go\nrm gendefs\n" }, { "path": "perffile/ksymbolflags_string.go", "content": "// Code generated by \"bitstringer -type=KsymbolFlags\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i KsymbolFlags) String() string {\n\tif i == 0 {\n\t\treturn \"Unregister\"\n\t}\n\ts := \"\"\n\ti &^= 0\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/ksymboltype_string.go", "content": "// Code generated by \"bitstringer -type=KsymbolType\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i KsymbolType) String() string {\n\tif i == 0 {\n\t\treturn \"Unknown\"\n\t}\n\ts := \"\"\n\tif i&KsymbolTypeBpf != 0 {\n\t\ts += \"Bpf|\"\n\t}\n\tif i&KsymbolTypeOol != 0 {\n\t\ts += \"Ool|\"\n\t}\n\ti &^= 3\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/meta.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n)\n\ntype FileMeta struct {\n\t// BuildIDs is the list of build IDs for processes and\n\t// libraries in this profile, or nil if unknown. Note that in\n\t// \"live mode\" (e.g., a file written by perf inject), it's\n\t// possible for build IDs to be introduced in the sample\n\t// stream itself.\n\tBuildIDs []BuildIDInfo\n\n\t// Hostname is the hostname of the machine that recorded this\n\t// profile, or \"\" if unknown.\n\tHostname string\n\n\t// OSRelease is the OS release of the machine that recorded\n\t// this profile such as \"3.13.0-62\", or \"\" if unknown.\n\tOSRelease string\n\n\t// Version is the perf version that recorded this profile such\n\t// as \"3.13.11\", or \"\" if unknown.\n\tVersion string\n\n\t// Arch is the host architecture of the machine that recorded\n\t// this profile such as \"x86_64\", or \"\" if unknown.\n\tArch string\n\n\t// CPUsOnline and CPUsAvail are the number of online and\n\t// available CPUs of the machine that recorded this profile,\n\t// or 0, 0 if unknown.\n\tCPUsOnline, CPUsAvail int\n\n\t// CPUDesc describes the CPU of the machine that recorded this\n\t// profile such as \"Intel(R) Core(TM) i7-4600U CPU @ 2.10GHz\",\n\t// or \"\" if unknown.\n\tCPUDesc string\n\n\t// CPUID describes the CPU type of the machine that recorded\n\t// this profile, or \"\" if unknown. The exact format of this\n\t// varies between architectures. On x86 architectures, it is a\n\t// comma-separated list of vendor, family, model, and\n\t// stepping, such as \"GenuineIntel,6,69,1\".\n\tCPUID string\n\n\t// TotalMem is the total memory in bytes of the machine that\n\t// recorded this profile, or 0 if unknown.\n\tTotalMem int64\n\n\t// CmdLine is the list of command line arguments perf was\n\t// invoked with, or nil if unknown.\n\tCmdLine []string\n\n\t// CoreGroups and ThreadGroups describe the CPU topology of\n\t// the machine that recorded this profile. Each CPUSet in\n\t// CoreGroups is a set of CPUs in the same package, and each\n\t// CPUSet in ThreadGroups is a set of hardware threads in the\n\t// same core. These will be nil if unkneon.\n\tCoreGroups, ThreadGroups []CPUSet\n\n\t// NUMANodes is the set of NUMA nodes in the NUMA topology of\n\t// the machine that recorded this profile, or nil if unknown.\n\tNUMANodes []NUMANode\n\n\t// PMUMappings is a map from numerical PMUTypeID to name for\n\t// event classes supported by the machine that recorded this\n\t// profile, or nil if unknown.\n\tPMUMappings map[PMUTypeID]string\n\n\t// Groups is the descriptions of each perf event group in this\n\t// profile, or nil if unknown.\n\tGroups []GroupDesc\n}\n\n// A BuildIDInfo records the mapping between a single build ID and the\n// path of an executable with that build ID.\ntype BuildIDInfo struct {\n\tCPUMode CPUMode\n\tPID int // Usually -1; for VM kernels\n\tBuildID BuildID\n\tFilename string\n}\n\ntype BuildID []byte\n\nfunc (b BuildID) String() string {\n\treturn fmt.Sprintf(\"%x\", []byte(b))\n}\n\n// A NUMANode represents a single hardware NUMA node.\ntype NUMANode struct {\n\t// Node is the system identifier of this NUMA node.\n\tNode int\n\n\t// MemTotal and MemFree are the total and free number of bytes\n\t// of memory in this NUMA node.\n\tMemTotal, MemFree int64\n\n\t// CPUs is the set of CPUs in this NUMA node.\n\tCPUs CPUSet\n}\n\n// A GroupDesc describes a group of PMU events that are scheduled\n// together.\n//\n// TODO: Are Leader and NumMembers attribute IDs? If so, we should\n// probably map them to *EventAttrs to make this useful.\ntype GroupDesc struct {\n\tName string\n\tLeader int\n\tNumMembers int\n}\n\nvar featureParsers = map[feature]func(*FileMeta, bufDecoder) error{\n\tfeatureBuildID: (*FileMeta).parseBuildID,\n\tfeatureHostname: stringFeature(\"Hostname\"),\n\tfeatureOSRelease: stringFeature(\"OSRelease\"),\n\tfeatureVersion: stringFeature(\"Version\"),\n\tfeatureArch: stringFeature(\"Arch\"),\n\tfeatureNrCpus: (*FileMeta).parseNrCPUs,\n\tfeatureCPUDesc: stringFeature(\"CPUDesc\"),\n\tfeatureCPUID: stringFeature(\"CPUID\"),\n\tfeatureTotalMem: (*FileMeta).parseTotalMem,\n\tfeatureCmdline: (*FileMeta).parseCmdLine,\n\tfeatureCPUTopology: (*FileMeta).parseCPUTopology,\n\tfeatureNUMATopology: (*FileMeta).parseNUMATopology,\n\tfeaturePMUMappings: (*FileMeta).parsePMUMappings,\n\tfeatureGroupDesc: (*FileMeta).parseGroupDesc,\n}\n\nfunc (m *FileMeta) parse(f feature, sec fileSection, r io.ReaderAt) error {\n\tparser := featureParsers[f]\n\tif parser == nil {\n\t\treturn nil\n\t}\n\n\t// Load the section.\n\tdata, err := sec.data(r)\n\tif err != nil {\n\t\treturn err\n\t}\n\tbd := bufDecoder{data, binary.LittleEndian}\n\n\t// Parse the section.\n\treturn parser(m, bd)\n}\n\nfunc stringFeature(name string) func(*FileMeta, bufDecoder) error {\n\treturn func(m *FileMeta, bd bufDecoder) error {\n\t\tbd.u32() // Ignore length; string is \\0-terminated\n\t\tstr := bd.cstring()\n\t\treflect.ValueOf(m).Elem().FieldByName(name).SetString(str)\n\t\treturn nil\n\t}\n}\n\nfunc (m *FileMeta) parseBuildID(bd bufDecoder) error {\n\tm.BuildIDs = make([]BuildIDInfo, 0)\n\tfor len(bd.buf) > 0 {\n\t\tvar bid BuildIDInfo\n\t\tstart := bd.buf\n\t\t// This starts with a recordHeader.\n\t\t_ = bd.u32() // type, unused\n\t\tbid.CPUMode = CPUMode(bd.u16() & uint16(recordMiscCPUModeMask))\n\t\tsize := bd.u16()\n\t\tbid.PID = int(bd.i32())\n\t\t// The build ID is 20 bytes, but padded to 8 bytes.\n\t\tbuildID := make([]byte, 24)\n\t\tbd.bytes(buildID)\n\t\tbid.BuildID = BuildID(buildID[:20])\n\t\tbid.Filename = bd.cstring()\n\t\tm.BuildIDs = append(m.BuildIDs, bid)\n\t\tbd.buf = start[size:]\n\t}\n\treturn nil\n}\n\nfunc (m *FileMeta) parseNrCPUs(bd bufDecoder) error {\n\tm.CPUsOnline, m.CPUsAvail = int(bd.u32()), int(bd.u32())\n\treturn nil\n}\n\nfunc (m *FileMeta) parseTotalMem(bd bufDecoder) error {\n\tm.TotalMem = int64(bd.u64()) * 1024\n\treturn nil\n}\n\nfunc (m *FileMeta) parseCmdLine(bd bufDecoder) error {\n\tm.CmdLine = bd.stringList()\n\treturn nil\n}\n\n// TODO: Implement featureEventDesc. This isn't useful unless we also\n// expose attribute IDs or something to make it possible to match up\n// the event descriptions with the samples. Probably we should hide\n// this as a feature section and just expose the set of events in the\n// file, augmented with the string names from this section if\n// available. As far as I can tell, the string name is the *only*\n// thing this section adds over the EventAttrs in the file header.\n\nfunc (m *FileMeta) parseCPUTopology(bd bufDecoder) error {\n\tvar err error\n\tcores, threads := bd.stringList(), bd.stringList()\n\tm.CoreGroups = make([]CPUSet, len(cores))\n\tfor i, str := range cores {\n\t\tm.CoreGroups[i], err = parseCPUSet(str)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tm.ThreadGroups = make([]CPUSet, len(threads))\n\tfor i, str := range threads {\n\t\tm.ThreadGroups[i], err = parseCPUSet(str)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (m *FileMeta) parseNUMATopology(bd bufDecoder) error {\n\tvar err error\n\tcount := bd.u32()\n\tm.NUMANodes = []NUMANode{}\n\tfor i := uint32(0); i < count; i++ {\n\t\tnode := NUMANode{\n\t\t\tNode: int(bd.u32()),\n\t\t\tMemTotal: int64(bd.u64()) * 1024,\n\t\t\tMemFree: int64(bd.u64()) * 1024,\n\t\t}\n\t\tnode.CPUs, err = parseCPUSet(bd.lenString())\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tm.NUMANodes = append(m.NUMANodes, node)\n\t}\n\treturn nil\n}\n\nfunc (m *FileMeta) parsePMUMappings(bd bufDecoder) error {\n\tcount := bd.u32()\n\tm.PMUMappings = map[PMUTypeID]string{}\n\tfor i := uint32(0); i < count; i++ {\n\t\tm.PMUMappings[PMUTypeID(bd.u32())] = bd.lenString()\n\t}\n\treturn nil\n}\n\nfunc (m *FileMeta) parseGroupDesc(bd bufDecoder) error {\n\tcount := bd.u32()\n\tm.Groups = []GroupDesc{}\n\tfor i := uint32(0); i < count; i++ {\n\t\tm.Groups = append(m.Groups, GroupDesc{\n\t\t\tName: bd.lenString(),\n\t\t\tLeader: int(bd.u32()),\n\t\t\tNumMembers: int(bd.u32()),\n\t\t})\n\t}\n\treturn nil\n}\n" }, { "path": "perffile/package.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package perffile is a parser for Linux perf.data profiles.\n//\n// Parsing a perf.data profile starts with a call to New or Open to\n// open a perf.data file. A perf.data file consists of a sequence of\n// records, which can be retrieved with File.Records, as well as\n// several metadata fields, which can be retrieved with other methods\n// of File.\npackage perffile // import \"github.com/aclements/go-perf/perffile\"\n" }, { "path": "perffile/reader.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"reflect\"\n\t\"sort\"\n)\n\n// TODO: Type for file format errors.\n\n// A File is a perf.data file. It consists of a sequence of records,\n// which can be retrieved with the Records method, as well as several\n// optional metadata fields.\ntype File struct {\n\t// Meta contains the metadata for this profile, such as\n\t// information about the hardware.\n\tMeta FileMeta\n\n\t// Events lists all events that may appear in this profile.\n\tEvents []*EventAttr\n\n\tr io.ReaderAt\n\tcloser io.Closer\n\thdr fileHeader\n\n\tattrs []fileAttr\n\tidToAttr map[attrID]*EventAttr\n\n\tsampleIDOffset int // byte offset of AttrID in sample\n\n\tsampleIDAll bool // non-samples have sample_id trailer\n\trecordIDOffset int // byte offset of AttrID in non-sample, from end\n}\n\n// New reads a \"perf.data\" file from r.\n//\n// The caller must keep r open as long as it is using the returned\n// *File.\nfunc New(r io.ReaderAt) (*File, error) {\n\t// See perf_session__open in tools/perf/util/session.c.\n\tfile := &File{r: r, Events: make([]*EventAttr, 0)}\n\n\t// Read and process the file header.\n\t//\n\t// See perf_session__read_header in tools/perf/util/header.c\n\n\tsr := io.NewSectionReader(r, 0, 1024)\n\tif err := binary.Read(sr, binary.LittleEndian, &file.hdr); err != nil {\n\t\treturn nil, err\n\t}\n\tswitch string(file.hdr.Magic[:]) {\n\tcase \"PERFILE2\":\n\t\t// Version 2, little endian.\n\t\tbreak\n\tcase \"2ELIFREP\":\n\t\t// Version 2, big endian.\n\t\t//\n\t\t// TODO: Support big endian profiles.\n\t\treturn nil, fmt.Errorf(\"big endian profiles not supported\")\n\tcase \"PERFFILE\":\n\t\t// Version 1 file.\n\t\treturn nil, fmt.Errorf(\"version 1 profiles not supported\")\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"bad or unsupported file magic %q\", string(file.hdr.Magic[:]))\n\t}\n\tif file.hdr.Size != uint64(binary.Size(&file.hdr)) {\n\t\treturn nil, fmt.Errorf(\"bad header size %d\", file.hdr.Size)\n\t}\n\n\t// hdr.Data.Size is the last thing written out by perf, so if\n\t// it's zero, we're working with a partial file.\n\tif file.hdr.Data.Size == 0 {\n\t\treturn nil, fmt.Errorf(\"truncated data file; was 'perf record' properly terminated?\")\n\t}\n\n\t// Read EventAttrs. Note that the attr size is represented in\n\t// both the file header and in each individual attr, but perf\n\t// doesn't validate the file-level attr size.\n\tif file.hdr.AttrSize == 0 {\n\t\treturn nil, fmt.Errorf(\"bad attr size 0\")\n\t}\n\tnAttrs := int(file.hdr.Attrs.Size / file.hdr.AttrSize)\n\tif nAttrs == 0 {\n\t\treturn nil, fmt.Errorf(\"no event types\")\n\t} else if nAttrs > 64*1024 {\n\t\treturn nil, fmt.Errorf(\"too many attrs or bad attr size\")\n\t}\n\tfile.attrs = make([]fileAttr, nAttrs)\n\tattrSR := file.hdr.Attrs.sectionReader(r)\n\tfor i := 0; i < nAttrs; i++ {\n\t\tif err := readFileAttr(attrSR, &file.attrs[i]); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tfile.Events = append(file.Events, &file.attrs[i].Attr)\n\t}\n\n\t// Read EventAttr IDs and create ID -> EventAttr map\n\tfile.idToAttr = make(map[attrID]*EventAttr)\n\tfor _, attr := range file.attrs {\n\t\tvar ids []attrID\n\t\tif err := readSlice(attr.IDs.sectionReader(r), &ids); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tfor _, id := range ids {\n\t\t\tfile.idToAttr[id] = &attr.Attr\n\t\t}\n\t}\n\n\t// Check that sample formats are consistent across all event\n\t// types and record cross-event sample format information.\n\tfirstEvent := &file.attrs[0].Attr\n\tfile.sampleIDOffset = firstEvent.SampleFormat.sampleIDOffset()\n\tfile.recordIDOffset = firstEvent.SampleFormat.recordIDOffset()\n\tfile.sampleIDAll = firstEvent.Flags&EventFlagSampleIDAll != 0\n\tif len(file.attrs) > 1 {\n\t\tif len(file.idToAttr) == 0 {\n\t\t\treturn nil, fmt.Errorf(\"file has multiple EventAttrs, but no IDs\")\n\t\t}\n\t\tfor _, attr := range file.attrs {\n\t\t\t// See perf_evlist__valid_sample_type.\n\t\t\tx := attr.Attr.SampleFormat.sampleIDOffset()\n\t\t\tif x == -1 {\n\t\t\t\treturn nil, fmt.Errorf(\"multiple events, but samples have no event ID field\")\n\t\t\t} else if file.sampleIDOffset != x {\n\t\t\t\treturn nil, fmt.Errorf(\"events have incompatible ID offsets %d and %d\", file.sampleIDOffset, x)\n\t\t\t}\n\n\t\t\tx = attr.Attr.SampleFormat.recordIDOffset()\n\t\t\tif x == -1 {\n\t\t\t\treturn nil, fmt.Errorf(\"multiple events, but records have no event ID field\")\n\t\t\t} else if file.recordIDOffset != x {\n\t\t\t\treturn nil, fmt.Errorf(\"records have incompatible ID offsets %d and %d\", file.recordIDOffset, x)\n\t\t\t}\n\n\t\t\t// See perf_evlist__valid_sample_id_all.\n\t\t\tidAll := attr.Attr.Flags&EventFlagSampleIDAll != 0\n\t\t\tif file.sampleIDAll != idAll {\n\t\t\t\treturn nil, fmt.Errorf(\"events have incompatible SampleIDAll flags\")\n\t\t\t}\n\n\t\t\t// See perf_evlist__valid_read_format.\n\t\t\tif firstEvent.ReadFormat != attr.Attr.ReadFormat {\n\t\t\t\treturn nil, fmt.Errorf(\"events have incompatible read formats\")\n\t\t\t}\n\t\t}\n\t\tif firstEvent.SampleFormat&SampleFormatRead != 0 &&\n\t\t\tfirstEvent.ReadFormat&ReadFormatID == 0 {\n\t\t\treturn nil, fmt.Errorf(\"bad event read format\")\n\t\t}\n\t}\n\n\t// Load feature sections.\n\tsr = io.NewSectionReader(r, int64(file.hdr.Data.Offset+file.hdr.Data.Size), int64(numFeatureBits*binary.Size(fileSection{})))\n\tfor bit := feature(0); bit < feature(numFeatureBits); bit++ {\n\t\tif !file.hdr.hasFeature(bit) {\n\t\t\tcontinue\n\t\t}\n\t\tsec := fileSection{}\n\t\tif err := binary.Read(sr, binary.LittleEndian, &sec); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tfile.Meta.parse(bit, sec, file.r)\n\t}\n\n\treturn file, nil\n}\n\n// Open opens the named \"perf.data\" file using os.Open.\n//\n// The caller must call f.Close() on the returned file when it is\n// done.\nfunc Open(name string) (*File, error) {\n\tf, err := os.Open(name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tff, err := New(f)\n\tif err != nil {\n\t\tf.Close()\n\t\treturn nil, err\n\t}\n\tff.closer = f\n\treturn ff, nil\n}\n\nfunc readFileAttr(sr *io.SectionReader, fa *fileAttr) error {\n\t// See read_attr in tools/perf/util/header.c.\n\n\t// Read the common prefix of all event attr versions.\n\tvar attr eventAttrVN\n\tif err := binary.Read(sr, binary.LittleEndian, &attr.eventAttrV0); err != nil {\n\t\treturn err\n\t}\n\tif attr.Size == 0 {\n\t\t// Assume ABI v0\n\t\tattr.Size = 64\n\t} else if attr.Size > uint32(binary.Size(&attr)) {\n\t\treturn fmt.Errorf(\"event attr size %d too large; more recent and unsupported format\", attr.Size)\n\t} else {\n\t\t// Read whatever's left. There are specific versions\n\t\t// of this structure, but perf doesn't try to\n\t\t// distinguish them, so neither do we.\n\t\tleft := int(attr.Size) - binary.Size(&attr.eventAttrV0)\n\t\trattr := reflect.ValueOf(&attr).Elem()\n\t\tfor i := 1; i < rattr.NumField() && left > 0; i++ {\n\t\t\tfield := rattr.Field(i).Addr().Interface()\n\t\t\terr := binary.Read(sr, binary.LittleEndian, field)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tleft -= binary.Size(field)\n\t\t}\n\t}\n\n\t// Convert on-disk perf_event_attr in to EventAttr.\n\tvar ev EventGeneric\n\tev.Type = attr.Type\n\tev.ID = attr.Config\n\tif attr.Flags&EventFlagFreq == 0 {\n\t\tfa.Attr.SamplePeriod = attr.SamplePeriodOrFreq\n\t} else {\n\t\tfa.Attr.SampleFreq = attr.SamplePeriodOrFreq\n\t}\n\tfa.Attr.SampleFormat = attr.SampleFormat\n\tfa.Attr.ReadFormat = attr.ReadFormat\n\tfa.Attr.Flags = attr.Flags &^ eventFlagPreciseMask\n\tfa.Attr.Precise = EventPrecision((attr.Flags & eventFlagPreciseMask) >> eventFlagPreciseShift)\n\tif attr.Flags&EventFlagWakeupWatermark == 0 {\n\t\tfa.Attr.WakeupEvents = attr.WakeupEventsOrWatermark\n\t} else {\n\t\tfa.Attr.WakeupWatermark = attr.WakeupEventsOrWatermark\n\t}\n\tif attr.Type == EventTypeBreakpoint {\n\t\t// For EventTypeBreakpoint, attr.Config is 0 and the\n\t\t// breakpoint type is described in BPType. We merge\n\t\t// the two.\n\t\tev.ID = uint64(attr.BPType)\n\t}\n\tev.Config = make([]uint64, 2)\n\tev.Config[0] = attr.BPAddrOrConfig1\n\tev.Config[1] = attr.BPLenOrConfig2\n\tfa.Attr.SampleRegsUser = attr.SampleRegsUser\n\tfa.Attr.SampleStackUser = attr.SampleStackUser\n\tfa.Attr.AuxWatermark = attr.AuxWatermark\n\tfa.Attr.SampleMaxStack = attr.SampleMaxStack\n\n\tfa.Attr.Event = ev.Decode()\n\n\t// Finally, read IDs fileSection, which follows the eventAttr.\n\treturn binary.Read(sr, binary.LittleEndian, &fa.IDs)\n}\n\n// Close closes the File.\n//\n// If the File was created using New directly instead of Open, Close\n// has no effect.\nfunc (f *File) Close() error {\n\tvar err error\n\tif f.closer != nil {\n\t\terr = f.closer.Close()\n\t\tf.closer = nil\n\t}\n\treturn err\n}\n\n// readSlice reads an entire section into a slice. v must be a\n// pointer to a slice; the slice itself may be nil. The section size\n// must be an exact multiple of the size of the element type of v.\nfunc readSlice(sr *io.SectionReader, v interface{}) error {\n\t// Figure out slice value size\n\tvt := reflect.TypeOf(v)\n\tif vt.Kind() != reflect.Ptr || vt.Elem().Kind() != reflect.Slice {\n\t\tpanic(\"v must be a pointer to a slice\")\n\t}\n\tet := vt.Elem().Elem()\n\tesize := binary.Size(reflect.Zero(et).Interface())\n\tnelem := int(sr.Size() / int64(esize))\n\tif sr.Size()%int64(esize) != 0 {\n\t\treturn fmt.Errorf(\"section size %d is not a multiple of element size %d\", sr.Size(), esize)\n\t}\n\n\t// Create slice\n\treflect.ValueOf(v).Elem().Set(reflect.MakeSlice(vt.Elem(), nelem, nelem))\n\n\t// Read in to slice\n\treturn binary.Read(sr, binary.LittleEndian, v)\n}\n\n//go:generate stringer -type=RecordsOrder\n\ntype RecordsOrder int\n\nconst (\n\t// RecordsFileOrder requests records in file order. This is\n\t// efficient because it allows streaming the records directly\n\t// from the file, but the records may not be in time-stamp or\n\t// even causal order.\n\tRecordsFileOrder RecordsOrder = iota\n\n\t// RecordsCausalOrder requests records in causal order. This\n\t// is weakly time-ordered: any two records will be in\n\t// time-stamp order *unless* those records are both\n\t// RecordSamples. This is potentially more efficient than\n\t// RecordsTimeOrder, though currently the implementation does\n\t// not distinguish.\n\tRecordsCausalOrder\n\n\t// RecordsTimeOrder requests records in time-stamp order. This\n\t// is the most expensive iteration order because it requires\n\t// buffering and/or re-reading potentially large sections of\n\t// the input file in order to sort the records.\n\tRecordsTimeOrder\n)\n\n// Records returns an iterator over the records in the profile. The\n// order argument specifies the order for iterating through the\n// records in this File. Callers should choose the least\n// resource-intensive iteration order that satisfies their needs.\nfunc (f *File) Records(order RecordsOrder) *Records {\n\tif order == RecordsCausalOrder || order == RecordsTimeOrder {\n\t\t// Sort the records by making two passes: first record\n\t\t// the offsets and time-stamps of all records, then\n\t\t// sort this by time-stamp and re-read in the new\n\t\t// offset order.\n\t\t//\n\t\t// See process_finished_round in session.c for how\n\t\t// perf does this. process_finished_round uses a\n\t\t// special flush event; however, I've never actually\n\t\t// observed in a perf.data file, so I think perf may\n\t\t// be reading and sorting the whole file looking for a\n\t\t// flush.\n\n\t\t// TODO: Optimize the first pass to decode only the\n\t\t// record length and time-stamp.\n\n\t\t// TODO: Optimize IO on the second pass by keeping\n\t\t// track of the non-monotonic boundaries and\n\t\t// performing separately buffered reads of each\n\t\t// sub-stream.\n\n\t\trs := f.Records(RecordsFileOrder)\n\t\tpos, ts := make([]int64, 0), make([]uint64, 0)\n\t\tfor rs.Next() {\n\t\t\tc := rs.Record.Common()\n\t\t\tpos = append(pos, c.Offset)\n\t\t\tts = append(ts, c.Time)\n\t\t}\n\t\tif rs.Err() != nil {\n\t\t\treturn &Records{err: rs.Err()}\n\t\t}\n\t\tsort.Stable(&timeSorter{pos, ts})\n\t\treturn &Records{f: f, sr: newBufferedSectionReader(f.hdr.Data.sectionReader(f.r)), order: pos}\n\t}\n\n\treturn &Records{f: f, sr: newBufferedSectionReader(f.hdr.Data.sectionReader(f.r))}\n}\n\ntype timeSorter struct {\n\tpos []int64\n\tts []uint64\n}\n\nfunc (s *timeSorter) Len() int {\n\treturn len(s.pos)\n}\n\nfunc (s *timeSorter) Less(i, j int) bool {\n\treturn s.ts[i] < s.ts[j]\n}\n\nfunc (s *timeSorter) Swap(i, j int) {\n\ts.pos[i], s.pos[j] = s.pos[j], s.pos[i]\n\ts.ts[i], s.ts[j] = s.ts[j], s.ts[i]\n}\n" }, { "path": "perffile/readformat_string.go", "content": "// Code generated by \"bitstringer -type=ReadFormat\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i ReadFormat) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&ReadFormatGroup != 0 {\n\t\ts += \"Group|\"\n\t}\n\tif i&ReadFormatID != 0 {\n\t\ts += \"ID|\"\n\t}\n\tif i&ReadFormatTotalTimeEnabled != 0 {\n\t\ts += \"TotalTimeEnabled|\"\n\t}\n\tif i&ReadFormatTotalTimeRunning != 0 {\n\t\ts += \"TotalTimeRunning|\"\n\t}\n\ti &^= 15\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/records.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perffile\n\nimport (\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"io\"\n)\n\n// A Records is an iterator over the records in a \"perf.data\" file.\n// Each record will be one of the Record* types.\n//\n// Typical usage is\n//\n//\trs := file.Records()\n//\tfor rs.Next() {\n//\t switch r := rs.Record.(type) {\n//\t case *perffile.RecordSample:\n//\t ...\n//\t }\n//\t}\n//\tif rs.Err() { ... }\ntype Records struct {\n\t// The current record. The concrete type of this will be one\n\t// of the Record* types. Determine which type of record this\n\t// is using a type switch.\n\tRecord Record\n\n\tf *File\n\tsr *bufferedSectionReader // or *io.SectionReader\n\terr error\n\n\t// order specifies the seek order to read records in. If nil,\n\t// records are read in file order until EOF. If non-nil,\n\t// records are read in this order.\n\torder []int64\n\n\t// Read buffer. Reused (and resized) by Next.\n\tbuf []byte\n\n\t// Cache for common record types\n\trecordMmap RecordMmap\n\trecordComm RecordComm\n\trecordExit RecordExit\n\trecordFork RecordFork\n\trecordSample RecordSample\n\trecordAux RecordAux\n\trecordSwitch RecordSwitch\n\trecordSwitchCPUWide RecordSwitchCPUWide\n}\n\n// Err returns the first error encountered by Records.\nfunc (r *Records) Err() error {\n\treturn r.err\n}\n\n// Next fetches the next record into r.Record. It returns true if\n// successful, and false if it reaches the end of the record stream or\n// encounters an error.\n//\n// The record stored in r.Record may be reused by later invocations of\n// Next, so if the caller may need the record after another call to\n// Next, it must make its own copy.\nfunc (r *Records) Next() bool {\n\t// See perf_evsel__parse_sample\n\tif r.err != nil {\n\t\treturn false\n\t}\n\n\tif r.order != nil {\n\t\tif len(r.order) == 0 {\n\t\t\treturn false\n\t\t}\n\t\tpos := r.order[0]\n\t\tr.order = r.order[1:]\n\t\t_, r.err = r.sr.Seek(pos-int64(r.f.hdr.Data.Offset), 0)\n\t\tif r.err != nil {\n\t\t\treturn false\n\t\t}\n\t}\n\n\tvar common RecordCommon\n\toffset, _ := r.sr.Seek(0, 1)\n\tcommon.Offset = offset + int64(r.f.hdr.Data.Offset)\n\n\t// Read record header\n\tvar hdr recordHeader\n\tif err := binary.Read(r.sr, binary.LittleEndian, &hdr); err != nil {\n\t\tif err != io.EOF {\n\t\t\tr.err = err\n\t\t}\n\t\treturn false\n\t}\n\n\t// Read record data\n\trlen := int(hdr.Size - 8)\n\tif rlen > len(r.buf) {\n\t\tr.buf = make([]byte, rlen)\n\t}\n\tvar bd = &bufDecoder{r.buf[:rlen], binary.LittleEndian}\n\tif _, err := io.ReadFull(r.sr, bd.buf); err != nil {\n\t\tr.err = err\n\t\treturn false\n\t}\n\n\t// Parse common sample_id fields\n\tif r.f.sampleIDAll && hdr.Type != RecordTypeSample && hdr.Type < recordTypeUserStart {\n\t\t// mmap records in the prologue don't have eventAttrs\n\t\t// in recent perf versions, but that's okay.\n\t\t//\n\t\t// TODO: When is perf okay with missing eventAttrs?\n\t\tr.parseCommon(bd, &common, hdr.Type == RecordTypeMmap)\n\t}\n\n\t// Parse record\n\t// TODO: Don't array out-of-bounds on short records\n\tswitch hdr.Type {\n\tdefault:\n\t\t// As far as I can tell, RecordTypeRead can never\n\t\t// appear in a perf.data file.\n\t\tr.Record = &RecordUnknown{hdr, common, bd.buf}\n\n\tcase RecordTypeMmap:\n\t\tr.Record = r.parseMmap(bd, &hdr, &common, false)\n\n\tcase RecordTypeLost:\n\t\tr.Record = r.parseLost(bd, &hdr, &common)\n\n\tcase RecordTypeComm:\n\t\tr.Record = r.parseComm(bd, &hdr, &common)\n\n\tcase RecordTypeExit:\n\t\tr.Record = r.parseExit(bd, &hdr, &common)\n\n\tcase RecordTypeThrottle:\n\t\tr.Record = r.parseThrottle(bd, &hdr, &common, true)\n\n\tcase RecordTypeUnthrottle:\n\t\tr.Record = r.parseThrottle(bd, &hdr, &common, false)\n\n\tcase RecordTypeFork:\n\t\tr.Record = r.parseFork(bd, &hdr, &common)\n\n\tcase RecordTypeSample:\n\t\tr.Record = r.parseSample(bd, &hdr, &common)\n\n\tcase recordTypeMmap2:\n\t\tr.Record = r.parseMmap(bd, &hdr, &common, true)\n\n\tcase RecordTypeAux:\n\t\tr.Record = r.parseAux(bd, &hdr, &common)\n\n\tcase RecordTypeItraceStart:\n\t\tr.Record = r.parseItraceStart(bd, &hdr, &common)\n\n\tcase RecordTypeLostSamples:\n\t\tr.Record = r.parseLostSamples(bd, &hdr, &common)\n\n\tcase RecordTypeSwitch:\n\t\tr.Record = r.parseSwitch(bd, &hdr, &common)\n\n\tcase RecordTypeSwitchCPUWide:\n\t\tr.Record = r.parseSwitchCPUWide(bd, &hdr, &common)\n\n\tcase RecordTypeNamespaces:\n\t\tr.Record = r.parseNamespaces(bd, &hdr, &common)\n\n\tcase RecordTypeKsymbol:\n\t\tr.Record = r.parseKsymbol(bd, &hdr, &common)\n\n\tcase RecordTypeBPFEvent:\n\t\tr.Record = r.parseBPFEvent(bd, &hdr, &common)\n\n\tcase RecordTypeCGroup:\n\t\tr.Record = r.parseCGroup(bd, &hdr, &common)\n\n\tcase RecordTypeTextPoke:\n\t\tr.Record = r.parseTextPoke(bd, &hdr, &common)\n\n\tcase RecordTypeAuxOutputHardwareID:\n\t\tr.Record = r.parseAuxOutputHardwareID(bd, &hdr, &common)\n\n\tcase RecordTypeAuxtraceInfo:\n\t\tr.Record = r.parseAuxtraceInfo(bd, &hdr, &common)\n\n\tcase RecordTypeAuxtrace:\n\t\t// Note: This appears to be the only record type that\n\t\t// has additional payload data following it that isn't\n\t\t// included in the header size.\n\t\tr.Record = r.parseAuxtrace(bd, &hdr, &common)\n\t}\n\tif r.err != nil {\n\t\treturn false\n\t}\n\treturn true\n}\n\nfunc (r *Records) getAttr(id attrID, nilOk bool) *EventAttr {\n\t// See perf_evlist__id2evsel in tools/perf/util/evlist.c.\n\n\t// If there's only one event, all records implicitly use it.\n\tif len(r.f.attrs) == 1 || id == 0 {\n\t\treturn &r.f.attrs[0].Attr\n\t}\n\t// Otherwise, look up the event by ID.\n\tif attr, ok := r.f.idToAttr[id]; ok {\n\t\treturn attr\n\t}\n\tif !nilOk {\n\t\tr.err = fmt.Errorf(\"event has unknown eventAttr ID %d\", id)\n\t}\n\treturn nil\n}\n\n// parseCommon parses the common sample_id structure in the trailer of\n// non-sample records.\nfunc (r *Records) parseCommon(bd *bufDecoder, o *RecordCommon, missingOk bool) bool {\n\t// Get EventAttr ID\n\tif r.f.recordIDOffset == -1 {\n\t\to.ID = 0\n\t} else {\n\t\to.ID = attrID(bd.order.Uint64(bd.buf[len(bd.buf)+r.f.recordIDOffset:]))\n\t}\n\to.EventAttr = r.getAttr(o.ID, missingOk && o.ID == 0)\n\tif o.EventAttr == nil {\n\t\treturn false\n\t}\n\n\t// Narrow decoder to the trailer\n\tcommonLen := o.EventAttr.SampleFormat.trailerBytes()\n\tbd = &bufDecoder{bd.buf[len(bd.buf)-commonLen:], bd.order}\n\n\t// Decode trailer\n\tt := o.EventAttr.SampleFormat\n\to.Format = t\n\to.PID = int(bd.i32If(t&SampleFormatTID != 0))\n\to.TID = int(bd.i32If(t&SampleFormatTID != 0))\n\to.Time = bd.u64If(t&SampleFormatTime != 0)\n\tbd.u64If(t&SampleFormatID != 0)\n\to.StreamID = bd.u64If(t&SampleFormatStreamID != 0)\n\to.CPU = bd.u32If(t&SampleFormatCPU != 0)\n\to.Res = bd.u32If(t&SampleFormatCPU != 0)\n\treturn true\n}\n\nfunc (r *Records) parseMmap(bd *bufDecoder, hdr *recordHeader, common *RecordCommon, v2 bool) Record {\n\to := &r.recordMmap\n\to.RecordCommon = *common\n\to.Format |= SampleFormatTID\n\n\t// Decode hdr.Misc\n\to.Data = (hdr.Misc&recordMiscMmapData != 0)\n\n\t// Decode fields. Note that perf calls the file offset\n\t// \"pgoff\", but it's actually a byte offset.\n\to.PID, o.TID = int(bd.i32()), int(bd.i32())\n\to.Addr, o.Len, o.FileOffset = bd.u64(), bd.u64(), bd.u64()\n\tif v2 {\n\t\tbuildID := (hdr.Misc&recordMiscMmapBuildID != 0)\n\t\tif buildID {\n\t\t\tbuildIDLen := int(bd.u8())\n\t\t\tif o.BuildID == nil || cap(o.BuildID) < buildIDLen {\n\t\t\t\to.BuildID = make([]byte, buildIDLen)\n\t\t\t} else {\n\t\t\t\to.BuildID = o.BuildID[:buildIDLen]\n\t\t\t}\n\t\t\tbd.skip(3)\n\t\t\tbd.bytes(o.BuildID)\n\n\t\t\to.Major, o.Minor = 0, 0\n\t\t\to.Ino, o.InoGeneration = 0, 0\n\t\t} else {\n\t\t\to.Major, o.Minor = bd.u32(), bd.u32()\n\t\t\to.Ino, o.InoGeneration = bd.u64(), bd.u64()\n\n\t\t\to.BuildID = nil\n\t\t}\n\n\t\to.Prot, o.Flags = bd.u32(), bd.u32()\n\t}\n\to.Filename = bd.cstring()\n\n\treturn o\n}\n\nfunc (r *Records) parseLost(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordLost{RecordCommon: *common}\n\to.Format |= SampleFormatID\n\n\to.ID = attrID(bd.u64())\n\to.EventAttr = r.getAttr(o.ID, false)\n\to.NumLost = bd.u64()\n\n\treturn o\n}\n\nfunc (r *Records) parseComm(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordComm\n\to.RecordCommon = *common\n\to.Format |= SampleFormatTID\n\n\t// Decode hdr.Misc\n\to.Exec = (hdr.Misc&recordMiscCommExec != 0)\n\n\t// Decode fields\n\to.PID, o.TID = int(bd.i32()), int(bd.i32())\n\to.Comm = bd.cstring()\n\n\treturn o\n}\n\nfunc (r *Records) parseExit(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordExit\n\to.RecordCommon = *common\n\to.Format |= SampleFormatTID | SampleFormatTime\n\n\to.PID, o.PPID = int(bd.i32()), int(bd.i32())\n\to.TID, o.PTID = int(bd.i32()), int(bd.i32())\n\to.Time = bd.u64()\n\n\treturn o\n}\n\nfunc (r *Records) parseThrottle(bd *bufDecoder, hdr *recordHeader, common *RecordCommon, enable bool) Record {\n\to := &RecordThrottle{RecordCommon: *common, Enable: enable}\n\to.Format |= SampleFormatTime | SampleFormatID | SampleFormatStreamID\n\n\to.Time = bd.u64()\n\t// Throttle events always have an event attr ID, even if the\n\t// IDs aren't recorded. So if we see an unknown attr ID, just\n\t// assume it's the default event.\n\tid := attrID(bd.u64())\n\tif r.f.idToAttr[id] == nil && r.f.idToAttr[0] != nil {\n\t\to.EventAttr = r.f.idToAttr[0]\n\t} else {\n\t\to.EventAttr = r.getAttr(id, false)\n\t}\n\to.StreamID = bd.u64()\n\n\treturn o\n}\n\nfunc (r *Records) parseFork(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordFork\n\to.RecordCommon = *common\n\to.Format |= SampleFormatTID | SampleFormatTime\n\n\to.PID, o.PPID = int(bd.i32()), int(bd.i32())\n\to.TID, o.PTID = int(bd.i32()), int(bd.i32())\n\to.Time = bd.u64()\n\n\treturn o\n}\n\nfunc (r *Records) parseAux(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordAux\n\to.RecordCommon = *common\n\n\to.Offset, o.Size = bd.u64(), bd.u64()\n\n\tflags := bd.u64()\n\tformat := (flags & 0xff00) >> 8\n\tflags &^= 0xff00\n\n\to.Flags = AuxFlags(flags)\n\to.PMUFormat = AuxPMUFormat(format)\n\n\treturn o\n}\n\nfunc (r *Records) parseItraceStart(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordItraceStart{RecordCommon: *common}\n\to.Format |= SampleFormatTID\n\to.PID, o.TID = int(bd.i32()), int(bd.i32())\n\treturn o\n}\n\nfunc (r *Records) parseLostSamples(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordLostSamples{RecordCommon: *common}\n\to.Lost = bd.u64()\n\treturn o\n}\n\nfunc (r *Records) parseSwitch(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordSwitch\n\to.RecordCommon = *common\n\to.Out = hdr.Misc&recordMiscSwitchOut != 0\n\treturn o\n}\n\nfunc (r *Records) parseSwitchCPUWide(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordSwitchCPUWide\n\to.RecordCommon = *common\n\to.SwitchPID, o.SwitchTID = int(bd.i32()), int(bd.i32())\n\to.Out = hdr.Misc&recordMiscSwitchOut != 0\n\to.Preempt = hdr.Misc&recordMiscSwitchOutPreempt != 0\n\treturn o\n}\n\nfunc (r *Records) parseNamespaces(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordNamespaces{RecordCommon: *common}\n\to.Format |= SampleFormatTID\n\to.PID, o.TID = int(bd.i32()), int(bd.i32())\n\tn := bd.u64()\n\to.Namespaces = make([]Namespace, n)\n\tfor i := range o.Namespaces {\n\t\to.Namespaces[i] = Namespace{bd.u64(), bd.u64()}\n\t}\n\treturn o\n}\n\nfunc (r *Records) parseKsymbol(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordKsymbol{RecordCommon: *common}\n\to.Addr, o.Len = bd.u64(), bd.u32()\n\to.KsymType = KsymbolType(bd.u16())\n\to.Flags = KsymbolFlags(bd.u64())\n\to.Name = bd.cstring()\n\n\treturn o\n}\n\nfunc (r *Records) parseBPFEvent(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordBPFEvent{RecordCommon: *common}\n\to.EventType = BPFEventType(bd.u16())\n\to.Flags = BPFEventFlags(bd.u16())\n\to.ID = bd.u32()\n\to.Tag = bd.u64()\n\n\treturn o\n}\n\nfunc (r *Records) parseCGroup(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordCGroup{RecordCommon: *common}\n\to.ID = bd.u32()\n\to.Path = bd.cstring()\n\n\treturn o\n}\n\nfunc (r *Records) parseTextPoke(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordTextPoke{RecordCommon: *common}\n\to.Addr = bd.u64()\n\n\toldLen, newLen := bd.u16(), bd.u16()\n\n\to.Old = make([]byte, oldLen)\n\tbd.bytes(o.Old)\n\n\to.New = make([]byte, newLen)\n\tbd.bytes(o.New)\n\n\treturn o\n}\n\nfunc (r *Records) parseAuxOutputHardwareID(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordAuxOutputHardwareID{RecordCommon: *common}\n\to.ID = bd.u64()\n\treturn o\n}\n\nfunc (r *Records) parseAuxtraceInfo(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordAuxtraceInfo{RecordCommon: *common}\n\to.Kind = bd.u32()\n\tbd.u32() // Alignment\n\t// TODO: Decode remainder according to Kind\n\to.Priv = make([]uint64, len(bd.buf)/8)\n\tbd.u64s(o.Priv)\n\treturn o\n}\n\nfunc (r *Records) parseAuxtrace(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &RecordAuxtrace{RecordCommon: *common}\n\tsize := bd.u64()\n\to.Offset, o.Ref = bd.u64(), bd.u64()\n\to.Idx, o.TID, o.CPU = bd.u32(), int(bd.u32()), bd.u32()\n\to.Data = make([]byte, size)\n\tif _, err := io.ReadFull(r.sr, o.Data); err != nil {\n\t\tr.err = err\n\t\treturn nil\n\t}\n\treturn o\n}\n\nfunc (r *Records) parseSample(bd *bufDecoder, hdr *recordHeader, common *RecordCommon) Record {\n\to := &r.recordSample\n\to.RecordCommon = *common\n\n\t// Get sample EventAttr ID\n\tif r.f.sampleIDOffset == -1 {\n\t\to.ID = 0\n\t} else {\n\t\to.ID = attrID(bd.order.Uint64(bd.buf[r.f.sampleIDOffset:]))\n\t}\n\to.EventAttr = r.getAttr(o.ID, false)\n\tif o.EventAttr == nil {\n\t\treturn nil\n\t}\n\n\t// Decode hdr.Misc\n\to.CPUMode = CPUMode(hdr.Misc & recordMiscCPUModeMask)\n\to.ExactIP = (hdr.Misc&recordMiscExactIP != 0)\n\n\t// Decode the rest of the sample\n\tt := o.EventAttr.SampleFormat\n\to.Format = t\n\tbd.u64If(t&SampleFormatIdentifier != 0)\n\to.IP = bd.u64If(t&SampleFormatIP != 0)\n\to.PID = int(bd.i32If(t&SampleFormatTID != 0))\n\to.TID = int(bd.i32If(t&SampleFormatTID != 0))\n\to.Time = bd.u64If(t&SampleFormatTime != 0)\n\to.Addr = bd.u64If(t&SampleFormatAddr != 0)\n\tbd.u64If(t&SampleFormatID != 0)\n\to.StreamID = bd.u64If(t&SampleFormatStreamID != 0)\n\to.CPU = bd.u32If(t&SampleFormatCPU != 0)\n\to.Res = bd.u32If(t&SampleFormatCPU != 0)\n\to.Period = bd.u64If(t&SampleFormatPeriod != 0)\n\n\tif t&SampleFormatRead != 0 {\n\t\tr.parseReadFormat(bd, o.EventAttr.ReadFormat, &o.SampleRead)\n\t}\n\n\tif t&SampleFormatCallchain != 0 {\n\t\tcallchainLen := int(bd.u64())\n\t\tif o.Callchain == nil || cap(o.Callchain) < callchainLen {\n\t\t\to.Callchain = make([]uint64, callchainLen)\n\t\t} else {\n\t\t\to.Callchain = o.Callchain[:callchainLen]\n\t\t}\n\t\tbd.u64s(o.Callchain)\n\t} else {\n\t\to.Callchain = nil\n\t}\n\n\trawSize := bd.u32If(t&SampleFormatRaw != 0)\n\tbd.skip(int(rawSize))\n\n\to.BranchHWIndex = bd.i64If(o.EventAttr.BranchSampleType&BranchSampleHWIndex != 0)\n\n\tif t&SampleFormatBranchStack != 0 {\n\t\tcount := int(bd.u64())\n\t\tif o.BranchStack == nil || cap(o.BranchStack) < count {\n\t\t\to.BranchStack = make([]BranchRecord, count)\n\t\t} else {\n\t\t\to.BranchStack = o.BranchStack[:count]\n\t\t}\n\t\tfor i := range o.BranchStack {\n\t\t\tbr := &o.BranchStack[i]\n\t\t\tbr.From = bd.u64()\n\t\t\tbr.To = bd.u64()\n\t\t\tflags := bd.u64()\n\t\t\t// First 4 bits are flags\n\t\t\tbr.Flags = BranchFlags(flags & 0x0f)\n\t\t\t// Next 16 bits are cycles\n\t\t\tbr.Cycles = uint16(flags >> 4)\n\t\t\t// Next 4 bits are type\n\t\t\tbr.Type = BranchType((flags >> 20) & 0x0f)\n\t\t}\n\t}\n\n\tif t&SampleFormatRegsUser != 0 {\n\t\to.RegsUserABI = SampleRegsABI(bd.u64())\n\t\tcount := weight(o.EventAttr.SampleRegsUser)\n\t\tif o.RegsUser == nil || cap(o.RegsUser) < count {\n\t\t\to.RegsUser = make([]uint64, count)\n\t\t} else {\n\t\t\to.RegsUser = o.RegsUser[:count]\n\t\t}\n\t\tif o.RegsUserABI == SampleRegsABINone {\n\t\t\to.RegsUser = o.RegsUser[:0:0]\n\t\t} else {\n\t\t\tbd.u64s(o.RegsUser)\n\t\t}\n\t}\n\n\tif t&SampleFormatStackUser != 0 {\n\t\tsize := int(bd.u64())\n\t\tif o.StackUser == nil || cap(o.StackUser) < size {\n\t\t\to.StackUser = make([]byte, size)\n\t\t} else {\n\t\t\to.StackUser = o.StackUser[:size]\n\t\t}\n\t\tbd.bytes(o.StackUser)\n\t\to.StackUserDynSize = bd.u64()\n\t} else {\n\t\to.StackUser = nil\n\t\to.StackUserDynSize = 0\n\t}\n\n\tif t&SampleFormatWeight != 0 {\n\t\to.Weight = bd.u64()\n\t\to.Weights = Weights{}\n\t} else if t&SampleFormatWeightStruct != 0 {\n\t\t// N.B. the kernel memcpys the 64-bit union value regardless of\n\t\t// format, so on big endian systems the fields appear in the\n\t\t// opposite order. Read as a 64-bit value and extract the\n\t\t// fields to handle both little and big endian.\n\t\tweight := bd.u64()\n\t\to.Weights.Var1 = uint32(weight)\n\t\to.Weights.Var2 = uint16(weight >> 32)\n\t\to.Weights.Var3 = uint16(weight >> 48)\n\t\t// For ease of use, also put Var1 in Weight. If you\n\t\t// only care about one weight, that's the one.\n\t\to.Weight = uint64(o.Weights.Var1)\n\t}\n\n\tif t&SampleFormatDataSrc != 0 {\n\t\to.DataSrc = decodeDataSrc(bd.u64())\n\t}\n\n\ttransaction := bd.u64If(t&SampleFormatTransaction != 0)\n\to.Transaction = Transaction(transaction & 0xffffffff)\n\to.AbortCode = uint32(transaction >> 32)\n\n\tif t&SampleFormatRegsIntr != 0 {\n\t\to.RegsIntrABI = SampleRegsABI(bd.u64())\n\t\tcount := weight(o.EventAttr.SampleRegsIntr)\n\t\tif o.RegsIntr == nil || cap(o.RegsIntr) < count {\n\t\t\to.RegsIntr = make([]uint64, count)\n\t\t} else {\n\t\t\to.RegsIntr = o.RegsIntr[:count]\n\t\t}\n\t\tif o.RegsIntrABI == SampleRegsABINone {\n\t\t\to.RegsIntr = o.RegsIntr[:0:0]\n\t\t} else {\n\t\t\tbd.u64s(o.RegsIntr)\n\t\t}\n\t}\n\n\tif t&SampleFormatPhysAddr != 0 {\n\t\to.PhysAddr = bd.u64()\n\t}\n\n\tif t&SampleFormatCGroup != 0 {\n\t\to.CGroup = bd.u64()\n\t}\n\n\tif t&SampleFormatDataPageSize != 0 {\n\t\to.DataPageSize = bd.u64()\n\t}\n\n\tif t&SampleFormatCodePageSize != 0 {\n\t\to.CodePageSize = bd.u64()\n\t}\n\n\tif t&SampleFormatAux != 0 {\n\t\tauxLen := int(bd.u64())\n\t\tif o.Aux == nil || cap(o.Aux) < auxLen {\n\t\t\to.Aux = make([]byte, auxLen)\n\t\t} else {\n\t\t\to.Aux = o.Aux[:auxLen]\n\t\t}\n\t\tbd.bytes(o.Aux)\n\t} else {\n\t\to.Aux = nil\n\t}\n\n\treturn o\n}\n\nfunc (r *Records) parseReadFormat(bd *bufDecoder, f ReadFormat, out *[]Count) {\n\tn := 1\n\tif f&ReadFormatGroup != 0 {\n\t\tn = int(bd.u64())\n\t}\n\n\tif *out == nil || cap(*out) < n {\n\t\t*out = make([]Count, n)\n\t} else {\n\t\t*out = (*out)[:n]\n\t}\n\n\tif f&ReadFormatGroup == 0 {\n\t\to := &(*out)[0]\n\t\to.Value = bd.u64()\n\t\to.TimeEnabled = bd.u64If(f&ReadFormatTotalTimeEnabled != 0)\n\t\to.TimeRunning = bd.u64If(f&ReadFormatTotalTimeRunning != 0)\n\t\tif f&ReadFormatID != 0 {\n\t\t\to.EventAttr = r.getAttr(attrID(bd.u64()), false)\n\t\t} else {\n\t\t\to.EventAttr = nil\n\t\t}\n\t} else {\n\t\tfor i := range *out {\n\t\t\to := &(*out)[i]\n\t\t\to.TimeEnabled = bd.u64If(f&ReadFormatTotalTimeEnabled != 0)\n\t\t\to.TimeRunning = bd.u64If(f&ReadFormatTotalTimeRunning != 0)\n\t\t\to.Value = bd.u64()\n\t\t\tif f&ReadFormatID != 0 {\n\t\t\t\to.EventAttr = r.getAttr(attrID(bd.u64()), false)\n\t\t\t} else {\n\t\t\t\to.EventAttr = nil\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc decodeDataSrc(d uint64) (out DataSrc) {\n\t// See perf_mem_data_src in include/uapi/linux/perf_event.h\n\top := (d >> 0) & 0x1f\n\tlvl := (d >> 5) & 0x3fff\n\tsnoop := (d >> 19) & 0x1f\n\tlock := (d >> 24) & 0x3\n\tdtlb := (d >> 26) & 0x7f\n\tlevelNum := (d >> 33) & 0xf\n\tremote := (d >> 37) & 0x1\n\tsnoopX := (d >> 38) & 0x3 // two bit extension of snoop\n\tblk := (d >> 40) & 0x7\n\thops := (d >> 43) & 0x7\n\n\tif op&0x1 != 0 {\n\t\tout.Op = DataSrcOpNA\n\t} else {\n\t\tout.Op = DataSrcOp(op >> 1)\n\t}\n\n\tif lvl&0x1 != 0 {\n\t\tout.Miss, out.Level = false, DataSrcLevelNA\n\t} else {\n\t\tout.Miss = (lvl & 0x4) != 0\n\t\tout.Level = DataSrcLevel(lvl >> 3)\n\t}\n\n\tif snoop&0x1 != 0 {\n\t\tout.Snoop = DataSrcSnoopNA\n\t} else {\n\t\tout.Snoop = DataSrcSnoop(snoop >> 1)\n\t\tif snoopX&0x1 != 0 {\n\t\t\tout.Snoop |= DataSrcSnoopFwd\n\t\t}\n\t}\n\n\tif lock&0x1 != 0 {\n\t\tout.Locked = DataSrcLockNA\n\t} else if lock&0x02 != 0 {\n\t\tout.Locked = DataSrcLockLocked\n\t} else {\n\t\tout.Locked = DataSrcLockUnlocked\n\t}\n\n\tif dtlb&0x1 != 0 {\n\t\tout.TLB = DataSrcTLBNA\n\t} else {\n\t\tout.TLB = DataSrcTLB(dtlb >> 1)\n\t}\n\n\tout.LevelNum = DataSrcLevelNum(levelNum)\n\tout.Remote = remote != 0\n\n\tif blk&0x1 != 0 {\n\t\tout.Block = DataSrcBlockNA\n\t} else {\n\t\tout.Block = DataSrcBlock(blk >> 1)\n\t}\n\n\tout.Hops = DataSrcHops(hops)\n\n\treturn\n}\n\nfunc weight(x uint64) int {\n\tx -= (x >> 1) & 0x5555555555555555\n\tx = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)\n\tx = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f\n\treturn int((x * 0x0101010101010101) >> 56)\n}\n" }, { "path": "perffile/recordsorder_string.go", "content": "// Code generated by \"stringer -type=RecordsOrder\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[RecordsFileOrder-0]\n\t_ = x[RecordsCausalOrder-1]\n\t_ = x[RecordsTimeOrder-2]\n}\n\nconst _RecordsOrder_name = \"RecordsFileOrderRecordsCausalOrderRecordsTimeOrder\"\n\nvar _RecordsOrder_index = [...]uint8{0, 16, 34, 50}\n\nfunc (i RecordsOrder) String() string {\n\tif i < 0 || i >= RecordsOrder(len(_RecordsOrder_index)-1) {\n\t\treturn \"RecordsOrder(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _RecordsOrder_name[_RecordsOrder_index[i]:_RecordsOrder_index[i+1]]\n}\n" }, { "path": "perffile/recordtype_string.go", "content": "// Code generated by \"stringer -type=RecordType\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[RecordTypeMmap-1]\n\t_ = x[RecordTypeLost-2]\n\t_ = x[RecordTypeComm-3]\n\t_ = x[RecordTypeExit-4]\n\t_ = x[RecordTypeThrottle-5]\n\t_ = x[RecordTypeUnthrottle-6]\n\t_ = x[RecordTypeFork-7]\n\t_ = x[RecordTypeRead-8]\n\t_ = x[RecordTypeSample-9]\n\t_ = x[recordTypeMmap2-10]\n\t_ = x[RecordTypeAux-11]\n\t_ = x[RecordTypeItraceStart-12]\n\t_ = x[RecordTypeLostSamples-13]\n\t_ = x[RecordTypeSwitch-14]\n\t_ = x[RecordTypeSwitchCPUWide-15]\n\t_ = x[RecordTypeNamespaces-16]\n\t_ = x[RecordTypeKsymbol-17]\n\t_ = x[RecordTypeBPFEvent-18]\n\t_ = x[RecordTypeCGroup-19]\n\t_ = x[RecordTypeTextPoke-20]\n\t_ = x[RecordTypeAuxOutputHardwareID-21]\n\t_ = x[recordTypeUserStart-64]\n\t_ = x[recordTypeAttr-64]\n\t_ = x[recordTypeEventType-65]\n\t_ = x[recordTypeTracingData-66]\n\t_ = x[recordTypeBuildID-67]\n\t_ = x[recordTypeFinishedRound-68]\n\t_ = x[recordTypeIDIndex-69]\n\t_ = x[RecordTypeAuxtraceInfo-70]\n\t_ = x[RecordTypeAuxtrace-71]\n\t_ = x[RecordTypeAuxtraceError-72]\n\t_ = x[recordTypeThreadMap-73]\n\t_ = x[recordTypeCPUMap-74]\n\t_ = x[recordTypeStatConfig-75]\n\t_ = x[recordTypeStat-76]\n\t_ = x[recordTypeStatRound-77]\n\t_ = x[recordTypeEventUpdate-78]\n\t_ = x[recordTypeTimeConv-79]\n\t_ = x[recordTypeHeaderFeature-80]\n}\n\nconst (\n\t_RecordType_name_0 = \"RecordTypeMmapRecordTypeLostRecordTypeCommRecordTypeExitRecordTypeThrottleRecordTypeUnthrottleRecordTypeForkRecordTypeReadRecordTypeSamplerecordTypeMmap2RecordTypeAuxRecordTypeItraceStartRecordTypeLostSamplesRecordTypeSwitchRecordTypeSwitchCPUWideRecordTypeNamespacesRecordTypeKsymbolRecordTypeBPFEventRecordTypeCGroupRecordTypeTextPokeRecordTypeAuxOutputHardwareID\"\n\t_RecordType_name_1 = \"recordTypeUserStartrecordTypeEventTyperecordTypeTracingDatarecordTypeBuildIDrecordTypeFinishedRoundrecordTypeIDIndexRecordTypeAuxtraceInfoRecordTypeAuxtraceRecordTypeAuxtraceErrorrecordTypeThreadMaprecordTypeCPUMaprecordTypeStatConfigrecordTypeStatrecordTypeStatRoundrecordTypeEventUpdaterecordTypeTimeConvrecordTypeHeaderFeature\"\n)\n\nvar (\n\t_RecordType_index_0 = [...]uint16{0, 14, 28, 42, 56, 74, 94, 108, 122, 138, 153, 166, 187, 208, 224, 247, 267, 284, 302, 318, 336, 365}\n\t_RecordType_index_1 = [...]uint16{0, 19, 38, 59, 76, 99, 116, 138, 156, 179, 198, 214, 234, 248, 267, 288, 306, 329}\n)\n\nfunc (i RecordType) String() string {\n\tswitch {\n\tcase 1 <= i && i <= 21:\n\t\ti -= 1\n\t\treturn _RecordType_name_0[_RecordType_index_0[i]:_RecordType_index_0[i+1]]\n\tcase 64 <= i && i <= 80:\n\t\ti -= 64\n\t\treturn _RecordType_name_1[_RecordType_index_1[i]:_RecordType_index_1[i+1]]\n\tdefault:\n\t\treturn \"RecordType(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n}\n" }, { "path": "perffile/sampleformat_string.go", "content": "// Code generated by \"bitstringer -type=SampleFormat\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i SampleFormat) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&SampleFormatAddr != 0 {\n\t\ts += \"Addr|\"\n\t}\n\tif i&SampleFormatAux != 0 {\n\t\ts += \"Aux|\"\n\t}\n\tif i&SampleFormatBranchStack != 0 {\n\t\ts += \"BranchStack|\"\n\t}\n\tif i&SampleFormatCGroup != 0 {\n\t\ts += \"CGroup|\"\n\t}\n\tif i&SampleFormatCPU != 0 {\n\t\ts += \"CPU|\"\n\t}\n\tif i&SampleFormatCallchain != 0 {\n\t\ts += \"Callchain|\"\n\t}\n\tif i&SampleFormatCodePageSize != 0 {\n\t\ts += \"CodePageSize|\"\n\t}\n\tif i&SampleFormatDataPageSize != 0 {\n\t\ts += \"DataPageSize|\"\n\t}\n\tif i&SampleFormatDataSrc != 0 {\n\t\ts += \"DataSrc|\"\n\t}\n\tif i&SampleFormatID != 0 {\n\t\ts += \"ID|\"\n\t}\n\tif i&SampleFormatIP != 0 {\n\t\ts += \"IP|\"\n\t}\n\tif i&SampleFormatIdentifier != 0 {\n\t\ts += \"Identifier|\"\n\t}\n\tif i&SampleFormatPeriod != 0 {\n\t\ts += \"Period|\"\n\t}\n\tif i&SampleFormatPhysAddr != 0 {\n\t\ts += \"PhysAddr|\"\n\t}\n\tif i&SampleFormatRaw != 0 {\n\t\ts += \"Raw|\"\n\t}\n\tif i&SampleFormatRead != 0 {\n\t\ts += \"Read|\"\n\t}\n\tif i&SampleFormatRegsIntr != 0 {\n\t\ts += \"RegsIntr|\"\n\t}\n\tif i&SampleFormatRegsUser != 0 {\n\t\ts += \"RegsUser|\"\n\t}\n\tif i&SampleFormatStackUser != 0 {\n\t\ts += \"StackUser|\"\n\t}\n\tif i&SampleFormatStreamID != 0 {\n\t\ts += \"StreamID|\"\n\t}\n\tif i&SampleFormatTID != 0 {\n\t\ts += \"TID|\"\n\t}\n\tif i&SampleFormatTime != 0 {\n\t\ts += \"Time|\"\n\t}\n\tif i&SampleFormatTransaction != 0 {\n\t\ts += \"Transaction|\"\n\t}\n\tif i&SampleFormatWeight != 0 {\n\t\ts += \"Weight|\"\n\t}\n\tif i&SampleFormatWeightStruct != 0 {\n\t\ts += \"WeightStruct|\"\n\t}\n\ti &^= 33554431\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perffile/sampleregsabi_string.go", "content": "// Code generated by \"stringer -type=SampleRegsABI\"; DO NOT EDIT.\n\npackage perffile\n\nimport \"strconv\"\n\nfunc _() {\n\t// An \"invalid array index\" compiler error signifies that the constant values have changed.\n\t// Re-run the stringer command to generate them again.\n\tvar x [1]struct{}\n\t_ = x[SampleRegsABINone-0]\n\t_ = x[SampleRegsABI32-1]\n\t_ = x[SampleRegsABI64-2]\n}\n\nconst _SampleRegsABI_name = \"SampleRegsABINoneSampleRegsABI32SampleRegsABI64\"\n\nvar _SampleRegsABI_index = [...]uint8{0, 17, 32, 47}\n\nfunc (i SampleRegsABI) String() string {\n\tif i >= SampleRegsABI(len(_SampleRegsABI_index)-1) {\n\t\treturn \"SampleRegsABI(\" + strconv.FormatInt(int64(i), 10) + \")\"\n\t}\n\treturn _SampleRegsABI_name[_SampleRegsABI_index[i]:_SampleRegsABI_index[i+1]]\n}\n" }, { "path": "perffile/transaction_string.go", "content": "// Code generated by \"bitstringer -type=Transaction\"; DO NOT EDIT\n\npackage perffile\n\nimport \"strconv\"\n\nfunc (i Transaction) String() string {\n\tif i == 0 {\n\t\treturn \"0\"\n\t}\n\ts := \"\"\n\tif i&TransactionAsync != 0 {\n\t\ts += \"Async|\"\n\t}\n\tif i&TransactionCapacityRead != 0 {\n\t\ts += \"CapacityRead|\"\n\t}\n\tif i&TransactionCapacityWrite != 0 {\n\t\ts += \"CapacityWrite|\"\n\t}\n\tif i&TransactionConflict != 0 {\n\t\ts += \"Conflict|\"\n\t}\n\tif i&TransactionElision != 0 {\n\t\ts += \"Elision|\"\n\t}\n\tif i&TransactionRetry != 0 {\n\t\ts += \"Retry|\"\n\t}\n\tif i&TransactionSync != 0 {\n\t\ts += \"Sync|\"\n\t}\n\tif i&TransactionTransaction != 0 {\n\t\ts += \"Transaction|\"\n\t}\n\ti &^= 255\n\tif i == 0 {\n\t\treturn s[:len(s)-1]\n\t}\n\treturn s + \"0x\" + strconv.FormatUint(uint64(i), 16)\n}\n" }, { "path": "perfsession/package.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package perfsession provides utilities for tracking session state\n// while processing a perf.data profile.\n//\n// The API of perfsession should be considered unstable at this point.\npackage perfsession // import \"github.com/aclements/go-perf/perfsession\"\n" }, { "path": "perfsession/ranges.go", "content": "// Copyright 2019 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perfsession\n\nimport \"sort\"\n\n// Ranges stores data associated with ranges of uint64 values and\n// supports efficient lookup.\ntype Ranges struct {\n\trs []rangeEnt\n\tsorted bool\n}\n\ntype rangeEnt struct {\n\tlo, hi uint64\n\tval interface{}\n}\n\n// Add inserts val for range [lo, hi).\n//\n// Add is undefined if [lo, hi) overlaps a range already in r.\nfunc (r *Ranges) Add(lo, hi uint64, val interface{}) {\n\tr.rs = append(r.rs, rangeEnt{lo, hi, val})\n\tr.sorted = false\n}\n\n// Get returns the range and the value for the range containing idx.\nfunc (r *Ranges) Get(idx uint64) (lo, hi uint64, val interface{}, ok bool) {\n\tif r == nil {\n\t\treturn 0, 0, nil, false\n\t}\n\n\trs := r.rs\n\tif !r.sorted {\n\t\tsort.Slice(rs, func(i, j int) bool {\n\t\t\treturn rs[i].lo < rs[j].lo\n\t\t})\n\t\tr.sorted = true\n\t}\n\n\ti := sort.Search(len(rs), func(i int) bool {\n\t\treturn idx < rs[i].hi\n\t})\n\tif i < len(rs) && rs[i].lo <= idx && idx < rs[i].hi {\n\t\treturn rs[i].lo, rs[i].hi, rs[i].val, true\n\t}\n\treturn 0, 0, nil, false\n}\n" }, { "path": "perfsession/session.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perfsession\n\nimport \"github.com/aclements/go-perf/perffile\"\n\n// TODO: Per-TID state.\n\ntype Session struct {\n\tkernel *PIDInfo\n\tpidInfo map[int]*PIDInfo\n\n\tFile *perffile.File\n\tExtra map[ExtraKey]interface{}\n}\n\nfunc New(f *perffile.File) *Session {\n\tkernel := &PIDInfo{\n\t\tComm: \"[kernel]\",\n\t\tExtra: make(ForkableExtra),\n\t}\n\treturn &Session{\n\t\tkernel: kernel,\n\t\tpidInfo: map[int]*PIDInfo{\n\t\t\t// The kernel is implicitly PID -1\n\t\t\t-1: kernel,\n\t\t},\n\t\tFile: f,\n\t\tExtra: make(map[ExtraKey]interface{}),\n\t}\n}\n\nfunc (s *Session) Update(r perffile.Record) {\n\tensurePID := func(pid int) *PIDInfo {\n\t\tpidInfo, ok := s.pidInfo[pid]\n\t\tif !ok {\n\t\t\tpidInfo = &PIDInfo{\n\t\t\t\tkernel: s.kernel,\n\t\t\t\tExtra: make(ForkableExtra),\n\t\t\t}\n\t\t\ts.pidInfo[pid] = pidInfo\n\t\t}\n\t\treturn pidInfo\n\t}\n\n\tswitch r := r.(type) {\n\tcase *perffile.RecordComm:\n\t\tensurePID(r.PID).Comm = r.Comm\n\n\tcase *perffile.RecordExit:\n\t\tif r.PID == r.TID {\n\t\t\tdelete(s.pidInfo, r.PID)\n\t\t}\n\t\t// Otherwise this is thread exit\n\n\tcase *perffile.RecordFork:\n\t\tif r.PID == r.TID {\n\t\t\ts.pidInfo[r.PID] = ensurePID(r.PPID).fork(r.PID)\n\t\t}\n\t\t// Otherwise this is thread creation\n\n\tcase *perffile.RecordMmap:\n\t\tinfo := ensurePID(r.PID)\n\t\tinfo.munmap(r.Addr, r.Len)\n\t\tinfo.maps = append(info.maps, &Mmap{make(ForkableExtra), *r})\n\n\tcase *perffile.RecordSample:\n\t\t// Sometimes (particularly early in sample files), we\n\t\t// see kernel samples before the RecordComm.\n\t\tensurePID(r.PID)\n\t}\n}\n\nfunc (s *Session) LookupPID(pid int) *PIDInfo {\n\treturn s.pidInfo[pid]\n}\n\ntype PIDInfo struct {\n\tExtra ForkableExtra\n\n\tComm string\n\tkernel *PIDInfo\n\tmaps []*Mmap\n}\n\nfunc (p *PIDInfo) fork(pid int) *PIDInfo {\n\tmaps := make([]*Mmap, len(p.maps))\n\tfor i, mmap := range p.maps {\n\t\tmaps[i] = mmap.fork(pid)\n\t}\n\treturn &PIDInfo{p.Extra.Fork(pid).(ForkableExtra), p.Comm, p.kernel, maps}\n}\n\nfunc (p *PIDInfo) munmap(addr, mlen uint64) {\n\tend := addr + mlen\n\tremoved := false\n\tnmaps := p.maps\n\tfor i, mmap := range p.maps {\n\t\tif addr <= mmap.Addr {\n\t\t\tif end >= mmap.Addr+mmap.Len {\n\t\t\t\tp.maps[i] = nil\n\t\t\t\tremoved = true\n\t\t\t} else if end > mmap.Addr {\n\t\t\t\t// Remove beginning of mmap\n\t\t\t\tmmap.Len -= (end - mmap.Addr)\n\t\t\t\tmmap.Addr = end\n\t\t\t}\n\t\t} else if addr < mmap.Addr+mmap.Len {\n\t\t\tif end >= mmap.Addr+mmap.Len {\n\t\t\t\t// Remove end of mmap\n\t\t\t\tmmap.Len = addr - mmap.Addr\n\t\t\t} else {\n\t\t\t\t// Split mmap in two\n\t\t\t\tnmmap := *mmap\n\t\t\t\tnmmap.Len = end - (mmap.Addr + mmap.Len)\n\t\t\t\tnmaps = append(nmaps, &nmmap)\n\t\t\t\tmmap.Len = addr - mmap.Addr\n\t\t\t}\n\t\t}\n\t}\n\t// Fill holes\n\tif removed {\n\t\td := 0\n\t\tfor s := 0; s < len(nmaps); s++ {\n\t\t\tif nmaps[d] == nil {\n\t\t\t\tnmaps[d] = nmaps[s]\n\t\t\t}\n\t\t\tif nmaps[d] != nil {\n\t\t\t\td++\n\t\t\t}\n\t\t}\n\t\tnmaps = nmaps[:d]\n\t}\n\tp.maps = nmaps\n}\n\nfunc (p *PIDInfo) mapFind(addr uint64) *Mmap {\n\tfor _, mmap := range p.maps {\n\t\tif mmap.Addr <= addr && addr < mmap.Addr+mmap.Len {\n\t\t\treturn mmap\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (p *PIDInfo) LookupMmap(addr uint64) *Mmap {\n\tm := p.mapFind(addr)\n\tif m == nil && p.kernel != nil {\n\t\tm = p.kernel.mapFind(addr)\n\t}\n\treturn m\n}\n\ntype Mmap struct {\n\tExtra ForkableExtra\n\n\tperffile.RecordMmap\n}\n\nfunc (m *Mmap) fork(pid int) *Mmap {\n\treturn &Mmap{m.Extra.Fork(pid).(ForkableExtra), m.RecordMmap}\n}\n\ntype Forkable interface {\n\tFork(pid int) Forkable\n}\n\ntype ExtraKey *struct {\n\tprivate struct{}\n\tName string\n}\n\nfunc NewExtraKey(name string) ExtraKey {\n\treturn ExtraKey(&struct {\n\t\tprivate struct{}\n\t\tName string\n\t}{Name: name})\n}\n\ntype ForkableExtra map[ExtraKey]Forkable\n\nfunc (f ForkableExtra) Fork(pid int) Forkable {\n\tf2 := make(ForkableExtra, len(f))\n\tfor k, v := range f {\n\t\tf2[k] = v.Fork(pid)\n\t}\n\treturn f2\n}\n" }, { "path": "perfsession/symbolize.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage perfsession\n\nimport (\n\t\"bufio\"\n\t\"debug/dwarf\"\n\t\"debug/elf\"\n\t\"fmt\"\n\t\"io\"\n\t\"log\"\n\t\"os\"\n\t\"os/user\"\n\t\"regexp\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\n\t\"github.com/ianlancetaylor/demangle\"\n)\n\ntype Symbolic struct {\n\tFuncName string\n\tLine dwarf.LineEntry\n}\n\n// TODO: Take a PID and look up the mmap.\n\nfunc Symbolize(session *Session, mmap *Mmap, ip uint64, out *Symbolic) bool {\n\ts := getSymbolicExtra(session, mmap.Filename)\n\tif s == nil {\n\t\treturn false\n\t}\n\tf, l := s.findIP(mmap, ip)\n\tif f == nil {\n\t\tout.FuncName = \"\"\n\t} else {\n\t\tout.FuncName = f.name\n\t}\n\tif l == nil {\n\t\tout.Line = dwarf.LineEntry{}\n\t} else {\n\t\tout.Line = *l\n\t}\n\treturn true\n}\n\nvar symbolicExtraKey = NewExtraKey(\"perfsession.symbolicExtra\")\n\nvar buildIDDir = (func() string {\n\t// See set_buildid_dir in tools/perf/util/config.c.\n\tu, err := user.Current()\n\tif err != nil {\n\t\treturn \".debug\"\n\t}\n\treturn fmt.Sprintf(\"%s/.debug\", u.HomeDir)\n})()\n\nfunc getSymbolicExtra(session *Session, filename string) *symbolicExtra {\n\tvar err error\n\n\ttables, ok := session.Extra[symbolicExtraKey].(map[string]*symbolicExtra)\n\tif !ok {\n\t\ttables = make(map[string]*symbolicExtra)\n\t\tsession.Extra[symbolicExtraKey] = tables\n\t}\n\n\t// For some reason, the filename for the kernel mapping looks\n\t// like \"[kernel.kallsyms]_text\", but the build ID file name\n\t// is just \"[kernel.kallsyms]\". Match them up.\n\t//\n\t// TODO: There may be a reason the file name is different that\n\t// I don't understand. perf doesn't seem to have any special\n\t// treatment of \"_text\".\n\t//\n\t// TODO: perf works a lot harder to find kernel symbols. See\n\t// dso__find_kallsyms in tools/perf/util/symbol.c.\n\tisKallsyms := false\n\tif strings.HasPrefix(filename, \"[kernel.kallsyms]\") {\n\t\tisKallsyms = true\n\t\tfilename = \"[kernel.kallsyms]\"\n\t}\n\n\textra, ok := tables[filename]\n\tif ok {\n\t\treturn extra\n\t}\n\ttables[filename] = (*symbolicExtra)(nil)\n\n\t// See dso__data_fd in toosl/perf/util/dso.c.\n\n\t// Try build ID cache first.\n\t//\n\t// TODO: Cache filename to build ID mapping.\n\tfor _, bid := range session.File.Meta.BuildIDs {\n\t\tif bid.Filename == filename {\n\t\t\tnfilename := fmt.Sprintf(\"%s/.build-id/%.2s/%s\", buildIDDir, bid.BuildID, bid.BuildID.String()[2:])\n\t\t\tif isKallsyms {\n\t\t\t\textra, err = newKallsyms(nfilename)\n\t\t\t} else {\n\t\t\t\textra, err = newSymbolicExtra(nfilename)\n\t\t\t}\n\t\t\tif err == nil {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\t// Try original path.\n\tif extra == nil {\n\t\textra, err = newSymbolicExtra(filename)\n\t\tif err != nil {\n\t\t\tlog.Println(err)\n\t\t}\n\t}\n\n\ttables[filename] = extra\n\treturn extra\n}\n\nfunc newSymbolicExtra(filename string) (*symbolicExtra, error) {\n\t// Load ELF\n\telff, err := elf.Open(filename)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"error loading ELF file %s: %s\", filename, err)\n\t}\n\tdefer elff.Close()\n\n\textra := &symbolicExtra{}\n\n\t// Load DWARF\n\t//\n\t// TODO: Support build IDs and debug links\n\t//\n\t// TODO: Support DWARF for relocatable objects\n\tif elff.Type == elf.ET_EXEC && (elff.Section(\".debug_info\") != nil || elff.Section(\".zdebug_info\") != nil) {\n\t\tdwarff, err := elff.DWARF()\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"error loading DWARF from %s: %s\", filename, err)\n\t\t}\n\n\t\textra.functab = dwarfFuncTable(dwarff)\n\t\textra.linetab = dwarfLineTable(dwarff)\n\n\t\treturn &symbolicExtra{\n\t\t\tdwarfFuncTable(dwarff),\n\t\t\tdwarfLineTable(dwarff),\n\t\t\tfalse,\n\t\t}, nil\n\t}\n\n\tif extra.functab == nil {\n\t\t// Make do with the ELF symbols.\n\t\textra.functab, extra.isReloc = elfFuncTable(filename, elff)\n\t}\n\n\treturn extra, nil\n}\n\nvar kallsymsRe = regexp.MustCompile(\"^([0-9a-fA-F]*) +(.) (.*)\")\n\nfunc newKallsyms(filename string) (*symbolicExtra, error) {\n\tf, err := os.Open(filename)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"error loading kallsyms from %s: %s\", filename, err)\n\t}\n\tdefer f.Close()\n\n\t// This file is a nm-style object list. See kallsyms__parse in\n\t// tools/lib/symbol/kallsyms.c.\n\tfunctab := make([]funcRange, 0)\n\tscanner := bufio.NewScanner(f)\n\tfor scanner.Scan() {\n\t\tsubs := kallsymsRe.FindStringSubmatch(scanner.Text())\n\t\tif subs == nil {\n\t\t\tcontinue\n\t\t}\n\t\ttyp, name := subs[2][0], subs[3]\n\t\tif !(typ == 't' || typ == 'T') {\n\t\t\tcontinue\n\t\t}\n\t\taddr, _ := strconv.ParseUint(subs[1], 16, 64)\n\t\tfunctab = append(functab, funcRange{name, addr, addr, true})\n\t}\n\tif err := scanner.Err(); err != nil {\n\t\treturn nil, err\n\t}\n\n\tsort.Sort(funcRangeSorter(functab))\n\tsetFuncHighPCs(functab)\n\n\treturn &symbolicExtra{functab, nil, false}, nil\n}\n\ntype symbolicExtra struct {\n\tfunctab []funcRange\n\tlinetab []dwarf.LineEntry\n\n\t// isReloc indicates that lowpc/highpc in functab are ELF file\n\t// offsets rather than virtual addresses.\n\tisReloc bool\n}\n\nfunc (s *symbolicExtra) findIP(mmap *Mmap, ip uint64) (f *funcRange, l *dwarf.LineEntry) {\n\tif s.functab != nil {\n\t\tif s.isReloc {\n\t\t\t// functab is indexed by file offset.\n\t\t\tip = ip - mmap.Addr + mmap.FileOffset\n\t\t}\n\t\ti := sort.Search(len(s.functab), func(i int) bool {\n\t\t\treturn ip < s.functab[i].highpc\n\t\t})\n\t\tif i < len(s.functab) && s.functab[i].lowpc <= ip && ip < s.functab[i].highpc {\n\t\t\tf = &s.functab[i]\n\t\t\tif !f.demangled {\n\t\t\t\tf.name = demangle.Filter(f.name)\n\t\t\t\tf.demangled = true\n\t\t\t}\n\t\t}\n\t}\n\n\tif s.linetab != nil {\n\t\ti := sort.Search(len(s.linetab), func(i int) bool {\n\t\t\treturn ip < s.linetab[i].Address\n\t\t})\n\t\tif i != 0 && !s.linetab[i-1].EndSequence {\n\t\t\tl = &s.linetab[i-1]\n\t\t}\n\t}\n\n\treturn\n}\n\ntype funcRange struct {\n\tname string\n\tlowpc, highpc uint64\n\tdemangled bool\n}\n\nfunc dwarfFuncTable(dwarff *dwarf.Data) []funcRange {\n\t// Walk DWARF for functions\n\t// TODO: Use .debug_pubnames (not supported by dwarf package)\n\tr := dwarff.Reader()\n\tout := make([]funcRange, 0)\n\tfor {\n\t\tent, err := r.Next()\n\t\tif ent == nil || err != nil {\n\t\t\tbreak\n\t\t}\n\t\t// TODO: We should process TagInlinedSubroutine, but\n\t\t// apparently gc doesn't produce these.\n\t\t//\n\t\t// TODO: Support DW_AT_ranges.\n\ttag:\n\t\tswitch ent.Tag {\n\t\tcase dwarf.TagSubprogram:\n\t\t\tr.SkipChildren()\n\t\t\tconst AttrLinkageName dwarf.Attr = 0x6e\n\t\t\tname, ok := ent.Val(AttrLinkageName).(string)\n\t\t\tdemangled := true\n\t\t\tif !ok {\n\t\t\t\tname, ok = ent.Val(dwarf.AttrName).(string)\n\t\t\t\tdemangled = false\n\t\t\t\tif !ok {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tlowpc, ok := ent.Val(dwarf.AttrLowpc).(uint64)\n\t\t\tif !ok {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tvar highpc uint64\n\t\t\tswitch highpcx := ent.Val(dwarf.AttrHighpc).(type) {\n\t\t\tcase uint64:\n\t\t\t\thighpc = highpcx\n\t\t\tcase int64:\n\t\t\t\thighpc = lowpc + uint64(highpcx)\n\t\t\tdefault:\n\t\t\t\tbreak tag\n\t\t\t}\n\t\t\tout = append(out, funcRange{name, lowpc, highpc, demangled})\n\n\t\tcase dwarf.TagCompileUnit, dwarf.TagModule, dwarf.TagNamespace:\n\t\t\tbreak\n\n\t\tdefault:\n\t\t\tr.SkipChildren()\n\t\t}\n\t}\n\n\tsort.Sort(funcRangeSorter(out))\n\n\tif len(out) == 0 {\n\t\treturn nil\n\t}\n\treturn out\n}\n\nfunc elfFuncTable(filename string, elff *elf.File) (out []funcRange, isReloc bool) {\n\tswitch elff.Type {\n\tcase elf.ET_EXEC:\n\t\t// Symbol values are virtual addresses.\n\t\tisReloc = false\n\tcase elf.ET_DYN:\n\t\t// Symbol values are section-relative offsets. This\n\t\t// will resolve them to file offsets.\n\t\tisReloc = true\n\tdefault:\n\t\treturn nil, false\n\t}\n\n\tout = make([]funcRange, 0)\n\tsyms, err := elff.Symbols()\n\tif err != nil {\n\t\tif err != elf.ErrNoSymbols {\n\t\t\tlog.Fatalf(\"%s: %s\", filename, err)\n\t\t}\n\t\treturn nil, false\n\t}\n\tfor _, sym := range syms {\n\t\tif elf.SymType(sym.Info&0xF) != elf.STT_FUNC || sym.Section == elf.SHN_UNDEF {\n\t\t\tcontinue\n\t\t}\n\t\tlowpc := sym.Value\n\t\tif isReloc {\n\t\t\t// lowpc is a section-relative offset.\n\t\t\t// Translate it to a file offset.\n\t\t\tif int(sym.Section) >= len(elff.Sections) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tsec := elff.Sections[sym.Section]\n\t\t\tlowpc = lowpc - sec.Addr + sec.Offset\n\t\t}\n\t\tout = append(out, funcRange{sym.Name, lowpc, lowpc + sym.Size, false})\n\t}\n\n\tsort.Sort(funcRangeSorter(out))\n\tsetFuncHighPCs(out)\n\n\treturn\n}\n\ntype funcRangeSorter []funcRange\n\nfunc (s funcRangeSorter) Len() int {\n\treturn len(s)\n}\n\nfunc (s funcRangeSorter) Swap(i, j int) {\n\ts[i], s[j] = s[j], s[i]\n}\n\nfunc (s funcRangeSorter) Less(i, j int) bool {\n\treturn s[i].lowpc < s[j].lowpc\n}\n\n// setFuncHighPCs fills in missing highpc values in functab. functab\n// must be sorted.\nfunc setFuncHighPCs(functab []funcRange) {\n\t// Assign symbols highpcs if they don't have them.\n\tfor i := range functab {\n\t\tif functab[i].highpc == functab[i].lowpc {\n\t\t\tif i == len(functab)-1 {\n\t\t\t\tfunctab[i].highpc++\n\t\t\t} else {\n\t\t\t\tfunctab[i].highpc = functab[i+1].lowpc\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc dwarfLineTable(dwarff *dwarf.Data) []dwarf.LineEntry {\n\tout := make([]dwarf.LineEntry, 0)\n\n\t// Iterate over compilation units\n\tdr := dwarff.Reader()\n\tfor {\n\t\tent, err := dr.Next()\n\t\tif ent == nil || err != nil {\n\t\t\tbreak\n\t\t}\n\n\t\tif ent.Tag != dwarf.TagCompileUnit {\n\t\t\tdr.SkipChildren()\n\t\t\tcontinue\n\t\t}\n\n\t\t// Decode CU's line table\n\t\tlr, err := dwarff.LineReader(ent)\n\t\tif err != nil {\n\t\t\tlog.Fatal(err)\n\t\t} else if lr == nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tfor {\n\t\t\tvar lent dwarf.LineEntry\n\t\t\terr := lr.Next(&lent)\n\t\t\tif err != nil {\n\t\t\t\tif err == io.EOF {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tlog.Fatal(err)\n\t\t\t}\n\t\t\tout = append(out, lent)\n\t\t}\n\t}\n\n\tsort.Slice(out, func(i, j int) bool {\n\t\treturn out[i].Address < out[j].Address\n\t})\n\n\treturn out\n}\n" }, { "path": "scale/interface.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage scale\n\n// A scale satisfies Interface if it maps from some input range to an\n// output interval [0, 1].\ntype Interface interface {\n\tOf(x float64) float64\n\tTicks(n int) (major, minor []float64)\n}\n" }, { "path": "scale/linear.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage scale\n\ntype Linear struct {\n\tmin, width float64\n}\n\n// NewLinear returns a new linear scale.\nfunc NewLinear(input []float64) Linear {\n\tmin, max := minmax(input)\n\treturn Linear{min, max - min}\n}\n\nfunc (s Linear) Of(x float64) float64 {\n\treturn (x - s.min) / s.width\n}\n\nfunc (s Linear) Ticks(n int) (major, minor []float64) {\n\tmajor, minor = make([]float64, n), []float64{}\n\n\t// TODO: Pick good ticks\n\n\tfor i := range major {\n\t\tmajor[i] = float64(i)*s.width/float64(n) + s.min\n\t}\n\n\treturn\n}\n" }, { "path": "scale/log.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage scale\n\nimport \"math\"\n\ntype Log struct {\n\tmin, max, base float64\n\tlogMin, denom float64\n}\n\n// NewLog returns a new logarithmic scale.\n//\n// base has no effect on the scaling. It is only used for computing\n// tick marks.\nfunc NewLog(input []float64, base float64) *Log {\n\tmin, max := minmax(input)\n\ts := &Log{min: min, max: max, base: base}\n\ts.precompute()\n\treturn s\n}\n\nfunc (s *Log) precompute() {\n\ts.logMin = math.Log(s.min)\n\ts.denom = math.Log(s.max) - s.logMin\n}\n\nfunc (s *Log) Of(x float64) float64 {\n\treturn (math.Log(x) - s.logMin) / s.denom\n}\n\n// Nice expands the domain of s to \"nice\" values of the scale, which\n// will translate into major tick marks.\n//\n// n is the maximum number of major ticks. n must be >= 2.\nfunc (s *Log) Nice(n int) {\n\tif n < 2 {\n\t\tpanic(\"n must be >= 2\")\n\t}\n\n\t// Increase the effective base until there are <= n major ticks\n\tfor ebase := s.base; ; ebase *= s.base {\n\t\t// TODO: Allow for some round-off error\n\n\t\t// Compute major tick below s.min and above s.max\n\t\tlo := math.Pow(ebase, math.Floor(math.Log(s.min)/math.Log(ebase)))\n\t\thi := math.Pow(ebase, math.Ceil(math.Log(s.max)/math.Log(ebase)))\n\n\t\t// Compute number of ticks between lo and hi\n\t\tnticks := 1 + (math.Log(hi)-math.Log(lo))/math.Log(ebase)\n\n\t\tif nticks <= float64(n) {\n\t\t\t// Found it\n\t\t\ts.min, s.max = lo, hi\n\t\t\ts.precompute()\n\t\t\tbreak\n\t\t}\n\t}\n}\n\nfunc (s *Log) Ticks(n int) (major, minor []float64) {\n\tif n < 2 {\n\t\tpanic(\"n must be >= 2\")\n\t}\n\n\tmajor, minor = []float64{}, []float64{}\n\n\t// Increase the effective base until there are <= n major ticks\n\tebase := s.base\n\tfor ; ; ebase *= s.base {\n\t\t// Compute number of ticks between lo and hi\n\t\tnticks := 1 + (math.Log(s.max)-math.Log(s.min))/math.Log(ebase)\n\n\t\tif nticks <= float64(n) {\n\t\t\t// Found it\n\t\t\tbreak\n\t\t}\n\t}\n\n\t// Start at the major tick below s.min\n\tx := math.Pow(ebase, math.Floor(math.Log(s.min)/math.Log(ebase)))\n\tfor x <= s.max {\n\t\tfor step := 0.0; step < ebase; step += ebase / s.base {\n\t\t\tx2 := x + step*x\n\t\t\tif x2 < s.min {\n\t\t\t\tcontinue\n\t\t\t} else if x2 > s.max {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tif step == 0 {\n\t\t\t\tmajor = append(major, x2)\n\t\t\t} else {\n\t\t\t\tminor = append(minor, x2)\n\t\t\t}\n\t\t}\n\n\t\tx *= ebase\n\t}\n\n\treturn\n}\n" }, { "path": "scale/output.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage scale\n\ntype OutputScale struct {\n\tmin, max float64\n\tclamp int\n}\n\nconst (\n\tclampCrop = iota\n\tclampNone\n\tclampClamp\n)\n\nfunc NewOutputScale(min, max float64) OutputScale {\n\treturn OutputScale{min, max, clampCrop}\n}\n\nfunc (s *OutputScale) Crop() {\n\ts.clamp = clampCrop\n}\n\nfunc (s *OutputScale) Unclamp() {\n\ts.clamp = clampNone\n}\n\nfunc (s *OutputScale) Clamp() {\n\ts.clamp = clampClamp\n}\n\nfunc (s OutputScale) Of(x float64) (float64, bool) {\n\tif s.clamp == clampCrop {\n\t\tif x < 0 || x > 1 {\n\t\t\treturn 0, false\n\t\t}\n\t} else if s.clamp == clampClamp {\n\t\tif x < 0 {\n\t\t\tx = 0\n\t\t} else if x > 1 {\n\t\t\tx = 1\n\t\t}\n\t}\n\treturn x*(s.max-s.min) + s.min, true\n}\n" }, { "path": "scale/power.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage scale\n\nimport \"math\"\n\ntype Power struct {\n\tlin Linear\n\texp float64\n}\n\n// NewPower returns a new power scale.\nfunc NewPower(input []float64, exp float64) Power {\n\treturn Power{NewLinear(input), exp}\n}\n\nfunc (s Power) Of(x float64) float64 {\n\treturn math.Pow(s.lin.Of(x), s.exp)\n}\n\nfunc (s Power) Ticks(n int) (major, minor []float64) {\n\treturn s.lin.Ticks(n)\n}\n" }, { "path": "scale/util.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage scale\n\nfunc minmax(xs []float64) (min float64, max float64) {\n\tmin, max = xs[0], xs[0]\n\tfor _, x := range xs {\n\t\tif x < min {\n\t\t\tmin = x\n\t\t}\n\t\tif x > max {\n\t\t\tmax = x\n\t\t}\n\t}\n\treturn\n}\n" }, { "path": "scripts/membw", "content": "#!/bin/zsh\n\n# Measure read/write memory bandwidth at memory controllers.\n#\n# Based on \"Intel® Xeon® Processor E5 v2 and E7 v2 Product Families\n# Uncore Performance Monitoring Reference Manual\".\n\nset -e\n\nfamily=$(grep '^cpu family' /proc/cpuinfo | awk '{print $4; exit}')\nmodel=$(grep '^model' /proc/cpuinfo | awk '{print $3; exit}')\nfm=$(printf \"%02x\" $family)_$(printf \"%02x\" $model)\n\n# TODO: This works for all E5 v2 and E7 v2. There are probably other\n# CPUIDs that apply.\nif [[ $fm != 06_3e ]]; then\n echo \"Unsupported family/model $fm\" >&2\n exit 1\nfi\n\n# Get iMC uncore boxes. In the E5 v2 there are four.\nimcs=($(cd -q /sys/bus/event_source/devices/; echo uncore_imc_*))\n\n# Construct the event list.\nevents=()\nfor imc in $imcs; do\n events=($events -e $imc/event=0x04,umask=0x03/ -e $imc/event=0x04,umask=0x0c/)\ndone\n\n# Uncore events must be monitored system-wide.\noutput=$(perf stat -a $events $* 2>&1)\necho $output\n\necho $output | awk '\n/uncore_imc_.*umask=0x03/ {read += $1}\n/uncore_imc_.*umask=0x0c/ {write += $1}\n/time elapsed/ {time = $1}\nEND {\n print (64 * read / time / 1024 / 1024) \" MiB read per second\"\n print (64 * write / time / 1024 / 1024) \" MiB written per second\"\n}'\n" }, { "path": "scripts/memload.py", "content": "#!/usr/bin/python3\n\nimport os\nimport sys\nimport subprocess\nimport operator\n\ndef gather(counters):\n counters = list(frozenset(counters))\n r, w = os.pipe()\n args = [\"ocperf.py\", \"stat\", \"-x;\", \"--log-fd\", str(w)]\n for counter in counters:\n args.extend([\"-e\", counter])\n args.extend(sys.argv[1:])\n perf = subprocess.Popen(args, pass_fds=[w])\n os.close(w)\n r = os.fdopen(r)\n output = r.read()\n r.close()\n res = perf.wait()\n if res:\n sys.exit(res)\n\n #print(output, file=sys.stderr) # Debugging\n\n # Parse output. Annoyingly, column 3 is the names, but ocperf\n # generated names trim off modifiers, so we can't distinguish\n # cmasks and such. Hence, we just match them up by order.\n cmap = {}\n for line in output.splitlines():\n line = line.split(\"#\", 1)[0].strip()\n if not line:\n continue\n row = line.split(\";\")\n\n # TODO: What's column 2? Column 3 is name. Column 4 is run\n # time of the counter. Column 5 is fraction of time counter\n # was running.\n cmap[counters[len(cmap)]] = int(row[0])\n\n return cmap\n\ndef cpu_family_model():\n family = model = None\n for l in open(\"/proc/cpuinfo\").readlines():\n if l.startswith(\"cpu family\\t\"):\n family = int(l.split(\":\")[1])\n if l.startswith(\"model\\t\"):\n model = int(l.split(\":\")[1])\n if family != None and model != None:\n return family, model\n print(\"failed to get CPU family and model from /proc/cpuinfo\",\n file=sys.stderr)\n sys.exit(1)\n\ndef main():\n # Only Ivy Bridge for now.\n family, model = cpu_family_model()\n if (family, model) not in [(0x06, 0x3a), (0x06, 0x3e)]:\n print(\"unsupported CPU model %02x_%02xH\" % (family, model),\n file=sys.stderr)\n sys.exit(1)\n\n events = [\"OFFCORE_REQUESTS_OUTSTANDING.DEMAND_DATA_RD:cmask=%d\" % cmask\n for cmask in range(1, 18)]\n ctx = gather([\"CPU_CLK_UNHALTED.THREAD\"] + events)\n\n # Print PDF\n clocks = ctx[\"CPU_CLK_UNHALTED.THREAD\"]\n for i, (ev1, ev2) in enumerate(zip(events, events[1:])):\n print(i + 1, 100 * (ctx[ev1] - ctx[ev2]) / clocks)\n\n if ctx[events[-1]] != 0:\n print(\"Warning: Highest cmask has non-zero event count %d\" % ctx[events[-1]],\n file=sys.stderr)\n\nif __name__ == \"__main__\":\n main()\n" }, { "path": "scripts/topdown.py", "content": "#!/usr/bin/python3\n\nimport os\nimport sys\nimport subprocess\nimport operator\n\n# TODO: Improve the quality of computed metrics using event groups.\n\ndef gather(counters):\n counters = list(frozenset(counters))\n r, w = os.pipe()\n args = [\"ocperf.py\", \"stat\", \"-x;\", \"--log-fd\", str(w)]\n for counter in counters:\n args.extend([\"-e\", counter])\n args.extend(sys.argv[1:])\n perf = subprocess.Popen(args, pass_fds=[w])\n os.close(w)\n r = os.fdopen(r)\n output = r.read()\n r.close()\n res = perf.wait()\n if res:\n sys.exit(res)\n\n #print(output, file=sys.stderr) # Debugging\n\n # Parse output. Annoyingly, column 3 is the names, but ocperf\n # generated names trim off modifiers, so we can't distinguish\n # cmasks and such. Hence, we just match them up by order.\n cmap = {}\n for line in output.splitlines():\n line = line.split(\"#\", 1)[0].strip()\n if not line:\n continue\n row = line.split(\";\")\n\n # TODO: What's column 2? Column 3 is name. Column 4 is run\n # time of the counter. Column 5 is fraction of time counter\n # was running.\n cmap[counters[len(cmap)]] = int(row[0])\n\n return cmap\n\nclass Formula:\n def __init__(self, children):\n self.children = children\n\n def eval(self, ctx):\n raise NotImplementedError(\"eval is abstract\")\n\n def events(self):\n raise NotImplementedError(\"events is abstract\")\n\n def __add__(self, o):\n return FormulaOp(operator.add, self, o)\n\n def __radd__(self, o):\n return FormulaOp(operator.add, o, self)\n\n def __sub__(self, o):\n return FormulaOp(operator.sub, self, o)\n\n def __rsub__(self, o):\n return FormulaOp(operator.sub, o, self)\n\n def __mul__(self, o):\n return FormulaOp(operator.mul, self, o)\n\n def __rmul__(self, o):\n return FormulaOp(operator.mul, o, self)\n\n def __truediv__(self, o):\n return FormulaOp(operator.truediv, self, o)\n\n def __rtruediv__(self, o):\n return FormulaOp(operator.truediv, o, self)\n\nclass FormulaOp(Formula):\n def __init__(self, op, *args):\n super().__init__(args)\n self.op = op\n\n def eval(self, ctx):\n args = [c.eval(ctx) if isinstance(c, Formula) else c\n for c in self.children]\n return self.op(*args)\n\n def events(self):\n events = []\n for child in self.children:\n if isinstance(child, Formula):\n events.extend(child.events())\n return events\n\nclass E(Formula):\n def __init__(self, event):\n super().__init__([])\n self.event = event\n\n def eval(self, ctx):\n return ctx[self.event]\n\n def events(self):\n return [self.event]\n\n# Top-Down bottleneck formulas. These are mostly from Yasin 2014, \"A\n# Top-Down Method for Performance Analysis and Counters Architecture\"\n# with some more detailed metrics from pmu-tools' toplev.py.\n\nclocks = E(\"CPU_CLK_UNHALTED.THREAD\")\nissueWidth = 4\nslots = issueWidth * clocks\n\nfrontendBound = E(\"IDQ_UOPS_NOT_DELIVERED.CORE\") / slots\nfetchLatencyBound = E(\"IDQ_UOPS_NOT_DELIVERED.CORE:cmask=4\") / clocks\nfetchBandwidthBound = frontendBound - fetchLatencyBound\n\n# Fetch bandwidth breakdown from toplev.py. NOTE: These are just\n# fractions of all cycles. They don't add up to fetchBandwidthBound,\n# since they're not gated on the front end being bottlenecked.\nfe_MITE = (E(\"IDQ.ALL_MITE_CYCLES_ANY_UOPS\") - E(\"IDQ.ALL_MITE_CYCLES_4_UOPS\")) / clocks\nfe_DSB = (E(\"IDQ.ALL_DSB_CYCLES_ANY_UOPS\") - E(\"IDQ.ALL_DSB_CYCLES_4_UOPS\")) / clocks\nfe_LSD = (E(\"LSD.CYCLES_ACTIVE\") - E(\"LSD.CYCLES_4_UOPS\")) / clocks\n\nbadSpeculation = (E(\"UOPS_ISSUED.ANY\") - E(\"UOPS_RETIRED.RETIRE_SLOTS\") + 4 * E(\"INT_MISC.RECOVERY_CYCLES\")) / slots\n\nretiring = E(\"UOPS_RETIRED.RETIRE_SLOTS\") / slots\n\nmemoryBound = (E(\"CYCLE_ACTIVITY.STALLS_MEM_ANY\") + E(\"RESOURCE_STALLS.SB\")) / clocks\nnumExecutionStalls = (E(\"CYCLE_ACTIVITY.CYCLES_NO_EXECUTE\") - E(\"RS_EVENTS.EMPTY_CYCLES\") + E(\"UOPS_EXECUTED.THREAD:cmask=1\") - E(\"UOPS_EXECUTED.THREAD:cmask=2\")) / clocks\ncoreBound = numExecutionStalls - memoryBound\n\n# See https://software.intel.com/en-us/node/544440 for detailed\n# explanations of L1 bound reasons.\nl1Bound = (E(\"CYCLE_ACTIVITY.STALLS_MEM_ANY\") - E(\"CYCLE_ACTIVITY.STALLS_L1D_MISS\")) / clocks\nl1_STLBHitCost = 7\nl1_DTLBMiss = (l1_STLBHitCost * E(\"DTLB_LOAD_MISSES.STLB_HIT\") + E(\"DTLB_LOAD_MISSES.WALK_DURATION\")) / clocks\nl1_SFBCost = 13\nl1_StoreForwardBlocked = l1_SFBCost * E(\"LD_BLOCKS.STORE_FORWARD\") / clocks\nl1_LockStoreFraction = E(\"MEM_UOPS_RETIRED.LOCK_LOADS\") / E(\"MEM_UOPS_RETIRED.ALL_STORES\")\noroDemandRFOC1 = FormulaOp(min, E(\"CPU_CLK_UNHALTED.THREAD\"), E(\"OFFCORE_REQUESTS_OUTSTANDING.CYCLES_WITH_DEMAND_RFO\"))\nl1_LockLatency = l1_LockStoreFraction * oroDemandRFOC1 / clocks\n# Load spans two cache lines.\nl1_SplitLoads = 13 * E(\"LD_BLOCKS.NO_SR\") / clocks\n# Earlier load conflicts with later store on bottom 12 bits.\nl1_4KAliasCost = 7\nl1_4KAliasing = (l1_4KAliasCost * E(\"LD_BLOCKS_PARTIAL.ADDRESS_ALIAS\")) / clocks\n# L1D fill buffer limits further demand loads.\nl1_LoadMissRealLatency = E(\"L1D_PEND_MISS.PENDING\") / (E(\"MEM_LOAD_UOPS_RETIRED.L1_MISS\") + E(\"MEM_LOAD_UOPS_RETIRED.HIT_LFB\"))\nl1_FBFull = l1_LoadMissRealLatency * E(\"L1D_PEND_MISS.FB_FULL:cmask=1\") / clocks\n\nl2Bound = (E(\"CYCLE_ACTIVITY.STALLS_L1D_MISS\") - E(\"CYCLE_ACTIVITY.STALLS_L2_MISS\")) / clocks\n# toplev.py gives the following alternate formula, but the results\n# don't seem any different.\n#l2Bound = (E(\"CYCLE_ACTIVITY.STALLS_L1D_PENDING\") - E(\"CYCLE_ACTIVITY.STALLS_L2_PENDING\")) / clocks\nl3HitFraction = E(\"MEM_LOAD_UOPS_RETIRED.LLC_HIT\") / (E(\"MEM_LOAD_UOPS_RETIRED.LLC_HIT\") + 7*E(\"MEM_LOAD_UOPS_RETIRED.LLC_MISS\"))\nl3Bound = l3HitFraction * E(\"CYCLE_ACTIVITY.STALLS_L2_MISS\") / clocks\nextMemoryBound = (1 - l3HitFraction) * E(\"CYCLE_ACTIVITY.STALLS_L2_MISS\") / clocks\n\n# These formulas come from toplev.py. They're very different from the\n# Yasin paper, but are based on the same idea, and don't depend on\n# undocumented uncore counters.\nextMem_BandwidthBound = E(\"OFFCORE_REQUESTS_OUTSTANDING.DEMAND_DATA_RD:cmask=6\") / clocks\nextMem_LatencyBound = (E(\"OFFCORE_REQUESTS_OUTSTANDING.CYCLES_WITH_DEMAND_DATA_RD\") - E(\"OFFCORE_REQUESTS_OUTSTANDING.DEMAND_DATA_RD:cmask=6\")) / clocks\n\nclass Node:\n def __init__(self, label, value, *children):\n self.label, self.value, self.children = label, value, children\n\n def events(self):\n counters = []\n if self.value is not None:\n counters.extend(self.value.events())\n for child in self.children:\n counters.extend(child.events())\n return counters\n\n def eval(self, ctx):\n if self.value is None:\n return sum(child.eval(ctx) for child in self.children)\n return self.value.eval(ctx)\n\n def show(self, ctx, indent=0):\n value = self.eval(ctx)\n print(\"%-30s %6.2f%%\" % (\" \" * indent + self.label, 100*value))\n for child in self.children:\n child.show(ctx, indent+1)\n\ntree = Node(\"All slots\", None,\n Node(\"µop issued\", None,\n Node(\"Retires\", retiring),\n Node(\"Bad speculation\", badSpeculation)),\n Node(\"No µop issued\", None,\n Node(\"Front end bound\", frontendBound,\n Node(\"Fetch latency bound\", fetchLatencyBound),\n Node(\"Fetch bandwidth bound\", fetchBandwidthBound,\n Node(\"MITE *\", fe_MITE),\n Node(\"DSB *\", fe_DSB),\n Node(\"LSD *\", fe_LSD))),\n Node(\"Back end bound\", None,\n Node(\"Core bound\", coreBound),\n Node(\"Memory bound\", memoryBound,\n Node(\"L1 bound\", l1Bound,\n Node(\"DTLB load miss\", l1_DTLBMiss),\n Node(\"Load blocked by store forwarding\", l1_StoreForwardBlocked),\n Node(\"Lock latency\", l1_LockLatency),\n Node(\"Split loads\", l1_SplitLoads),\n Node(\"4K aliasing\", l1_4KAliasing),\n Node(\"Fill buffer full\", l1_FBFull)),\n Node(\"L2 bound\", l2Bound),\n Node(\"L3 bound\", l3Bound),\n Node(\"Ext mem bound\", extMemoryBound,\n Node(\"Bandwidth *\", extMem_BandwidthBound),\n Node(\"Latency *\", extMem_LatencyBound))))))\n\ndef cpu_family_model():\n family = model = None\n for l in open(\"/proc/cpuinfo\").readlines():\n if l.startswith(\"cpu family\\t\"):\n family = int(l.split(\":\")[1])\n if l.startswith(\"model\\t\"):\n model = int(l.split(\":\")[1])\n if family != None and model != None:\n return family, model\n print(\"failed to get CPU family and model from /proc/cpuinfo\",\n file=sys.stderr)\n sys.exit(1)\n\ndef main():\n # Only Ivy Bridge for now.\n family, model = cpu_family_model()\n if (family, model) not in [(0x06, 0x3a), (0x06, 0x3e)]:\n print(\"unsupported CPU model %02x_%02xH\" % (family, model),\n file=sys.stderr)\n sys.exit(1)\n\n events = tree.events()\n ctx = gather(events)\n tree.show(ctx)\n\nif __name__ == \"__main__\":\n main()\n" } ]