1. 11 Sep, 2012 3 commits
  2. 10 Sep, 2012 11 commits
  3. 09 Sep, 2012 2 commits
    • Rémy Oudompheng's avatar
      cmd/8g: import componentgen from 6g. · ae0862c1
      Rémy Oudompheng authored
      This makes the compilers code more similar and improves
      code generation a lot.
      
      The number of LEAL instructions generated for cmd/go drops
      by 60%.
      
      % GOARCH=386 go build -gcflags -S -a cmd/go | grep LEAL | wc -l
      Before:       89774
      After:        47548
      
      benchmark                              old ns/op    new ns/op    delta
      BenchmarkAppendFloatDecimal                  540          444  -17.78%
      BenchmarkAppendFloat                        1160         1035  -10.78%
      BenchmarkAppendFloatExp                     1060          922  -13.02%
      BenchmarkAppendFloatNegExp                  1053          920  -12.63%
      BenchmarkAppendFloatBig                     1773         1558  -12.13%
      BenchmarkFormatInt                         13065        12481   -4.47%
      BenchmarkAppendInt                         10981         9900   -9.84%
      BenchmarkFormatUint                         3804         3650   -4.05%
      BenchmarkAppendUint                         3506         3303   -5.79%
      BenchmarkUnquoteEasy                         714          683   -4.34%
      BenchmarkUnquoteHard                        5117         2915  -43.03%
      
      Update #1914.
      
      R=nigeltao, rsc, golang-dev
      CC=golang-dev, remy
      https://golang.org/cl/6489067
      ae0862c1
    • Mikio Hara's avatar
      net: change cname lookup test target to iana.org · b7376442
      Mikio Hara authored
      It might be meaningful, and stable than others.
      
      R=golang-dev, agl
      CC=golang-dev
      https://golang.org/cl/6499091
      b7376442
  4. 08 Sep, 2012 3 commits
  5. 07 Sep, 2012 12 commits
  6. 06 Sep, 2012 8 commits
  7. 05 Sep, 2012 1 commit
    • Russ Cox's avatar
      reflect: faster FieldByName, FieldByNameFunc · 5e3224ce
      Russ Cox authored
      The old code was a depth first graph traversal that could, under the
      right conditions, end up re-exploring the same subgraphs multiple
      times, once for each way to arrive at that subgraph at a given depth.
      
      The new code uses a breadth first search to make sure that it only
      visits each reachable embedded struct once.
      
      Also add fast path for the trivial case.
      
      benchmark                old ns/op    new ns/op    delta
      BenchmarkFieldByName1         1321          187  -85.84%
      BenchmarkFieldByName2         6118         5186  -15.23%
      BenchmarkFieldByName3      8218553        42112  -99.49%
      
      R=gri, r
      CC=golang-dev
      https://golang.org/cl/6458090
      5e3224ce