1. 04 Jun, 2012 16 commits
  2. 03 Jun, 2012 7 commits
  3. 02 Jun, 2012 9 commits
  4. 01 Jun, 2012 5 commits
  5. 31 May, 2012 3 commits
    • Nigel Tao's avatar
      exp/html/atom: faster, hash-based lookup. · d2a6098e
      Nigel Tao authored
      exp/html/atom benchmark:
      benchmark          old ns/op    new ns/op    delta
      BenchmarkLookup       199226        80770  -59.46%
      
      exp/html benchmark:
      benchmark                      old ns/op    new ns/op    delta
      BenchmarkParser                  4864890      4510834   -7.28%
      BenchmarkHighLevelTokenizer      2209192      1969684  -10.84%
      benchmark                       old MB/s     new MB/s  speedup
      BenchmarkParser                    16.07        17.33    1.08x
      BenchmarkHighLevelTokenizer        35.38        39.68    1.12x
      
      R=r
      CC=golang-dev
      https://golang.org/cl/6261054
      d2a6098e
    • Rémy Oudompheng's avatar
      runtime: lower memory overhead of heap profiling. · baf91c31
      Rémy Oudompheng authored
      The previous code was preparing arrays of entries that would be
      filled if there was one entry every 128 bytes. Moving to a 4096
      byte interval reduces the overhead per megabyte of address space
      to 2kB from 64kB (on 64-bit systems).
      The performance impact will be negative for very small MemProfileRate.
      
      test/bench/garbage/tree2 -heapsize 800000000 (default memprofilerate)
      Before: mprof 65993056 bytes (1664 bucketmem + 65991392 addrmem)
      After:  mprof  1989984 bytes (1680 bucketmem +  1988304 addrmem)
      
      R=golang-dev, rsc
      CC=golang-dev, remy
      https://golang.org/cl/6257069
      baf91c31
    • Sameer Ajmani's avatar
      CONTRIBUTORS: Add Ryan Barrett (Google CLA) · 29e32d73
      Sameer Ajmani authored
      R=golang-dev, r
      CC=golang-dev
      https://golang.org/cl/6244071
      29e32d73