We use cookies to ensure you get the best experience on our website
Home Esplora Aiuto
Registrati Accedi
0ct0pu5
/
moby
1
0
Forka 0
File Problemi 0 Pull Requests 0 Wiki
Sfoglia il codice sorgente

Merge pull request #43236 from thaJeztah/less_replaces

vendor.mod: reduce number of `replace` rules: update some dependencies
Akihiro Suda 3 anni fa
parent
469749947b fada92c393
commit
67b4b032f3
100 ha cambiato i file con 4000 aggiunte e 1003 eliminazioni
Visualizzazione separata Mostra Diff Stats
  1. 1 16
      vendor.mod
  2. 273 16
      vendor.sum
  3. 0 0
      vendor/github.com/golang/snappy/.gitignore
  4. 2 0
      vendor/github.com/golang/snappy/AUTHORS
  5. 2 0
      vendor/github.com/golang/snappy/CONTRIBUTORS
  6. 0 0
      vendor/github.com/golang/snappy/LICENSE
  7. 0 0
      vendor/github.com/golang/snappy/README
  8. 4 0
      vendor/github.com/golang/snappy/decode.go
  9. 12 4
      vendor/github.com/golang/snappy/decode_amd64.s
  10. 494 0
      vendor/github.com/golang/snappy/decode_arm64.s
  11. 1 0
      vendor/github.com/golang/snappy/decode_asm.go
  12. 2 2
      vendor/github.com/golang/snappy/decode_other.go
  13. 4 0
      vendor/github.com/golang/snappy/encode.go
  14. 0 0
      vendor/github.com/golang/snappy/encode_amd64.s
  15. 722 0
      vendor/github.com/golang/snappy/encode_arm64.s
  16. 1 0
      vendor/github.com/golang/snappy/encode_asm.go
  17. 1 1
      vendor/github.com/golang/snappy/encode_other.go
  18. 2 2
      vendor/github.com/golang/snappy/snappy.go
  19. 1 1
      vendor/github.com/google/uuid/README.md
  20. 2 2
      vendor/github.com/google/uuid/hash.go
  21. 4 3
      vendor/github.com/google/uuid/marshal.go
  22. 118 0
      vendor/github.com/google/uuid/null.go
  23. 1 1
      vendor/github.com/google/uuid/sql.go
  24. 52 3
      vendor/github.com/google/uuid/uuid.go
  25. 6 6
      vendor/github.com/google/uuid/version1.go
  26. 39 1
      vendor/github.com/google/uuid/version4.go
  27. 4 3
      vendor/github.com/grpc-ecosystem/go-grpc-middleware/.travis.yml
  28. 4 3
      vendor/github.com/grpc-ecosystem/go-grpc-middleware/README.md
  29. 2 2
      vendor/github.com/grpc-ecosystem/go-grpc-middleware/doc.go
  30. 0 1
      vendor/github.com/klauspost/compress/fse/compress.go
  31. 0 1
      vendor/github.com/klauspost/compress/huff0/compress.go
  32. 0 2
      vendor/github.com/klauspost/compress/snappy/runbench.cmd
  33. 30 16
      vendor/github.com/klauspost/compress/zstd/README.md
  34. 4 7
      vendor/github.com/klauspost/compress/zstd/blockdec.go
  35. 6 6
      vendor/github.com/klauspost/compress/zstd/blockenc.go
  36. 12 9
      vendor/github.com/klauspost/compress/zstd/bytebuf.go
  37. 2 2
      vendor/github.com/klauspost/compress/zstd/decodeheader.go
  38. 11 15
      vendor/github.com/klauspost/compress/zstd/decoder.go
  39. 2 3
      vendor/github.com/klauspost/compress/zstd/decoder_options.go
  40. 7 6
      vendor/github.com/klauspost/compress/zstd/enc_base.go
  41. 14 0
      vendor/github.com/klauspost/compress/zstd/enc_best.go
  42. 69 4
      vendor/github.com/klauspost/compress/zstd/enc_better.go
  43. 1 1
      vendor/github.com/klauspost/compress/zstd/encoder.go
  44. 1 1
      vendor/github.com/klauspost/compress/zstd/encoder_options.go
  45. 26 22
      vendor/github.com/klauspost/compress/zstd/framedec.go
  46. 0 1
      vendor/github.com/klauspost/compress/zstd/fse_encoder.go
  47. 1 1
      vendor/github.com/klauspost/compress/zstd/fse_predefined.go
  48. 0 1
      vendor/github.com/klauspost/compress/zstd/seqenc.go
  49. 1 2
      vendor/github.com/klauspost/compress/zstd/snappy.go
  50. 121 0
      vendor/github.com/klauspost/compress/zstd/zip.go
  51. 4 14
      vendor/github.com/klauspost/compress/zstd/zstd.go
  52. 2 2
      vendor/github.com/pelletier/go-toml/CONTRIBUTING.md
  53. 1 1
      vendor/github.com/pelletier/go-toml/LICENSE
  54. 6 6
      vendor/github.com/pelletier/go-toml/README.md
  55. 16 58
      vendor/github.com/pelletier/go-toml/azure-pipelines.yml
  56. 0 26
      vendor/github.com/pelletier/go-toml/fuzzit.sh
  57. 265 41
      vendor/github.com/pelletier/go-toml/lexer.go
  58. 38 6
      vendor/github.com/pelletier/go-toml/marshal.go
  59. 54 39
      vendor/github.com/pelletier/go-toml/parser.go
  60. 4 2
      vendor/github.com/pelletier/go-toml/token.go
  61. 4 0
      vendor/github.com/pelletier/go-toml/toml.go
  62. 71 0
      vendor/github.com/pelletier/go-toml/tomlpub.go
  63. 34 6
      vendor/github.com/pelletier/go-toml/tomltree_write.go
  64. 6 0
      vendor/github.com/pelletier/go-toml/tomltree_writepub.go
  65. 4 0
      vendor/github.com/prometheus/common/model/time.go
  66. 2 0
      vendor/go.etcd.io/bbolt/.gitignore
  67. 2 1
      vendor/go.etcd.io/bbolt/.travis.yml
  68. 0 2
      vendor/go.etcd.io/bbolt/Makefile
  69. 3 2
      vendor/go.etcd.io/bbolt/README.md
  70. 5 12
      vendor/go.etcd.io/bbolt/bolt_unix.go
  71. 114 0
      vendor/go.etcd.io/bbolt/compact.go
  72. 62 4
      vendor/go.etcd.io/bbolt/db.go
  73. 3 3
      vendor/go.etcd.io/bbolt/freelist_hmap.go
  74. 36 0
      vendor/go.etcd.io/bbolt/mlock_unix.go
  75. 11 0
      vendor/go.etcd.io/bbolt/mlock_windows.go
  76. 1 2
      vendor/go.etcd.io/bbolt/tx.go
  77. 6 4
      vendor/golang.org/x/net/http/httpguts/httplex.go
  78. 1 1
      vendor/golang.org/x/net/http2/Dockerfile
  79. 0 20
      vendor/golang.org/x/net/http2/README
  80. 53 0
      vendor/golang.org/x/net/http2/ascii.go
  81. 76 44
      vendor/golang.org/x/net/http2/client_conn_pool.go
  82. 12 0
      vendor/golang.org/x/net/http2/errors.go
  83. 48 14
      vendor/golang.org/x/net/http2/frame.go
  84. 27 0
      vendor/golang.org/x/net/http2/go115.go
  85. 3 4
      vendor/golang.org/x/net/http2/headermap.go
  86. 21 17
      vendor/golang.org/x/net/http2/hpack/huffman.go
  87. 31 0
      vendor/golang.org/x/net/http2/not_go115.go
  88. 11 0
      vendor/golang.org/x/net/http2/pipe.go
  89. 95 55
      vendor/golang.org/x/net/http2/server.go
  90. 556 364
      vendor/golang.org/x/net/http2/transport.go
  91. 6 1
      vendor/golang.org/x/net/http2/write.go
  92. 14 0
      vendor/golang.org/x/net/idna/go118.go
  93. 76 41
      vendor/golang.org/x/net/idna/idna10.0.0.go
  94. 66 31
      vendor/golang.org/x/net/idna/idna9.0.0.go
  95. 12 0
      vendor/golang.org/x/net/idna/pre_go118.go
  96. 25 11
      vendor/golang.org/x/net/idna/punycode.go
  97. 2 2
      vendor/golang.org/x/net/internal/socket/cmsghdr_linux_32bit.go
  98. 26 0
      vendor/golang.org/x/net/internal/socket/complete_dontwait.go
  99. 22 0
      vendor/golang.org/x/net/internal/socket/complete_nodontwait.go
  100. 1 0
      vendor/golang.org/x/net/internal/socket/empty.s

+ 1 - 16
vendor.mod
Vedi File 

@@ -91,7 +91,6 @@ require (
 
 	github.com/Azure/go-ansiterm v0.0.0-20210617225240-d185dfc1b5a1 // indirect
 
 	github.com/armon/go-metrics v0.0.0-20180917152333-f0300d1749da // indirect
 
 	github.com/beorn7/perks v1.0.1 // indirect
 
-	github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 // indirect
 
 	github.com/cespare/xxhash/v2 v2.1.1 // indirect
 
 	github.com/cilium/ebpf v0.7.0 // indirect
 
 	github.com/containerd/console v1.0.3 // indirect
 
@@ -106,6 +105,7 @@ require (
 
 	github.com/gogo/googleapis v1.4.0 // indirect
 
 	github.com/golang/groupcache v0.0.0-20210331224755-41bb18bfe9da // indirect
 
 	github.com/golang/protobuf v1.5.2 // indirect
 
+	github.com/golang/snappy v0.0.3 // indirect
 
 	github.com/google/btree v1.0.1 // indirect
 
 	github.com/google/certificate-transparency-go v1.0.20 // indirect
 
 	github.com/google/shlex v0.0.0-20191202100458-e7afc7fbc510 // indirect
 
@@ -153,39 +153,24 @@ replace (
 
 	cloud.google.com/go/logging => cloud.google.com/go/logging v1.0.1-0.20190813144457-ceeb313ad77b
 
 	github.com/armon/go-metrics => github.com/armon/go-metrics v0.0.0-20150106224455-eb0af217e5e9
 
 	github.com/armon/go-radix => github.com/armon/go-radix v0.0.0-20150105235045-e39d623f12e8
 
-	github.com/containerd/containerd => github.com/containerd/containerd v1.5.8
 
 	github.com/coreos/go-systemd => github.com/coreos/go-systemd v0.0.0-20180511133405-39ca1b05acc7
 
 	github.com/coreos/pkg => github.com/coreos/pkg v0.0.0-20180108230652-97fdf19511ea
 
 	github.com/gogo/googleapis => github.com/gogo/googleapis v1.3.2
 
 	github.com/golang/protobuf => github.com/golang/protobuf v1.3.5
 
 	github.com/google/go-cmp => github.com/google/go-cmp v0.2.0
 
-	github.com/google/uuid => github.com/google/uuid v1.1.1
 
-	github.com/grpc-ecosystem/go-grpc-middleware => github.com/grpc-ecosystem/go-grpc-middleware v1.2.0
 
 	github.com/hashicorp/go-immutable-radix => github.com/tonistiigi/go-immutable-radix v0.0.0-20170803185627-826af9ccf0fe
 
 	github.com/hashicorp/go-msgpack => github.com/hashicorp/go-msgpack v0.0.0-20140221154404-71c2886f5a67
 
 	github.com/hashicorp/go-multierror => github.com/hashicorp/go-multierror v1.0.0
 
 	github.com/hashicorp/serf => github.com/hashicorp/serf v0.7.1-0.20160317193612-598c54895cc5
 
-	github.com/hpcloud/tail => github.com/hpcloud/tail v1.0.0
 
-	github.com/klauspost/compress => github.com/klauspost/compress v1.11.13
 
 	github.com/matttproud/golang_protobuf_extensions => github.com/matttproud/golang_protobuf_extensions v1.0.1
 
-	github.com/onsi/ginkgo => github.com/onsi/ginkgo v1.8.0
 
-	github.com/onsi/gomega => github.com/onsi/gomega v1.5.0
 
-	github.com/pelletier/go-toml => github.com/pelletier/go-toml v1.8.1
 
 	github.com/prometheus/client_golang => github.com/prometheus/client_golang v1.6.0
 
-	github.com/prometheus/common => github.com/prometheus/common v0.9.1
 
 	github.com/prometheus/procfs => github.com/prometheus/procfs v0.0.11
 
-	github.com/stretchr/testify => github.com/stretchr/testify v1.3.0
 
 	github.com/vishvananda/netlink => github.com/vishvananda/netlink v1.1.0
 
-	go.etcd.io/bbolt => go.etcd.io/bbolt v1.3.5
 
 	go.opencensus.io => go.opencensus.io v0.22.3
 
-	golang.org/x/net => golang.org/x/net v0.0.0-20210226172049-e18ecbb05110
 
 	golang.org/x/oauth2 => golang.org/x/oauth2 v0.0.0-20200107190931-bf48bf16ab8d
 
-	golang.org/x/text => golang.org/x/text v0.3.3
 
-	golang.org/x/time => golang.org/x/time v0.0.0-20200630173020-3af7569d3a1e
 
 	google.golang.org/api => google.golang.org/api v0.8.0
 
 	google.golang.org/genproto => google.golang.org/genproto v0.0.0-20200227132054-3f1135a288c9
 
 	google.golang.org/grpc => google.golang.org/grpc v1.27.1
 
-	gopkg.in/fsnotify.v1 => gopkg.in/fsnotify.v1 v1.4.7
 
 )
 
 
 // autogen/winresources/dockerd is generated a build time, this replacement is only for the purpose of `go mod vendor`

+ 273 - 16
vendor.sum
Vedi File 

@@ -16,9 +16,11 @@ cloud.google.com/go/storage v1.8.0/go.mod h1:Wv1Oy7z6Yz3DshWRJFhqM/UCfaWIRTdp0RX
 
 code.cloudfoundry.org/clock v1.0.0 h1:kFXWQM4bxYvdBw2X8BbBeXwQNgfoWv1vqAk2ZZyBN2o=
 
 code.cloudfoundry.org/clock v1.0.0/go.mod h1:QD9Lzhd/ux6eNQVUDVRJX/RKTigpewimNYBi7ivZKY8=
 
 dmitri.shuralyov.com/gpu/mtl v0.0.0-20190408044501-666a987793e9/go.mod h1:H6x//7gZCb22OMCxBHrMx7a5I7Hp++hsVxbQ4BYO7hU=
 
+github.com/Azure/azure-sdk-for-go v16.2.1+incompatible/go.mod h1:9XXNKU+eRnpl9moKnB4QOLf1HestfXbmab5FXxiDBjc=
 
 github.com/Azure/go-ansiterm v0.0.0-20170929234023-d6e3b3328b78/go.mod h1:LmzpDX56iTiv29bbRTIsUNlaFfuhWRQBWjQdVyAevI8=
 
 github.com/Azure/go-ansiterm v0.0.0-20210617225240-d185dfc1b5a1 h1:UQHMgLO+TxOElx5B5HZ4hJQsoJ/PvUvKRhJHDQXO8P8=
 
 github.com/Azure/go-ansiterm v0.0.0-20210617225240-d185dfc1b5a1/go.mod h1:xomTg63KZ2rFqZQzSB4Vz2SUXa1BpHTVz9L5PTmPC4E=
 
+github.com/Azure/go-autorest v10.8.1+incompatible/go.mod h1:r+4oMnoxhatjLLJ6zxSWATqVooLgysK6ZNox3g/xq24=
 
 github.com/Azure/go-autorest v14.2.0+incompatible/go.mod h1:r+4oMnoxhatjLLJ6zxSWATqVooLgysK6ZNox3g/xq24=
 
 github.com/Azure/go-autorest/autorest v0.11.1/go.mod h1:JFgpikqFJ/MleTTxwepExTKnFUKKszPS8UavbQYUMuw=
 
 github.com/Azure/go-autorest/autorest/adal v0.9.0/go.mod h1:/c022QCutn2P7uY+/oQWWNcK9YU+MH96NgK+jErpbcg=
 
@@ -33,20 +35,32 @@ github.com/BurntSushi/xgb v0.0.0-20160522181843-27f122750802/go.mod h1:IVnqGOEym
 
 github.com/Graylog2/go-gelf v0.0.0-20191017102106-1550ee647df0 h1:cOjLyhBhe91glgZZNbQUg9BJC57l6BiSKov0Ivv7k0U=
 
 github.com/Graylog2/go-gelf v0.0.0-20191017102106-1550ee647df0/go.mod h1:fBaQWrftOD5CrVCUfoYGHs4X4VViTuGOXA8WloCjTY0=
 
 github.com/Microsoft/go-winio v0.4.11/go.mod h1:VhR8bwka0BXejwEJY73c50VrPtXAaKcyvVC4A4RozmA=
 
+github.com/Microsoft/go-winio v0.4.14/go.mod h1:qXqCSQ3Xa7+6tgxaGTIe4Kpcdsi+P8jBhyzoq1bpyYA=
 
+github.com/Microsoft/go-winio v0.4.15-0.20190919025122-fc70bd9a86b5/go.mod h1:tTuCMEN+UleMWgg9dVx4Hu52b1bJo+59jBh3ajtinzw=
 
+github.com/Microsoft/go-winio v0.4.16-0.20201130162521-d1ffc52c7331/go.mod h1:XB6nPKklQyQ7GC9LdcBEcBl8PF76WugXOPRXwdLnMv0=
 
+github.com/Microsoft/go-winio v0.4.16/go.mod h1:XB6nPKklQyQ7GC9LdcBEcBl8PF76WugXOPRXwdLnMv0=
 
 github.com/Microsoft/go-winio v0.4.17-0.20210211115548-6eac466e5fa3/go.mod h1:JPGBdM1cNvN/6ISo+n8V5iA4v8pBzdOpzfwIujj1a84=
 
 github.com/Microsoft/go-winio v0.4.17-0.20210324224401-5516f17a5958/go.mod h1:JPGBdM1cNvN/6ISo+n8V5iA4v8pBzdOpzfwIujj1a84=
 
 github.com/Microsoft/go-winio v0.4.17/go.mod h1:JPGBdM1cNvN/6ISo+n8V5iA4v8pBzdOpzfwIujj1a84=
 
 github.com/Microsoft/go-winio v0.5.1 h1:aPJp2QD7OOrhO5tQXqQoGSJc+DjDtWTGLOmNyAm6FgY=
 
 github.com/Microsoft/go-winio v0.5.1/go.mod h1:JPGBdM1cNvN/6ISo+n8V5iA4v8pBzdOpzfwIujj1a84=
 
 github.com/Microsoft/hcsshim v0.8.6/go.mod h1:Op3hHsoHPAvb6lceZHDtd9OkTew38wNoXnJs8iY7rUg=
 
+github.com/Microsoft/hcsshim v0.8.7-0.20190325164909-8abdbb8205e4/go.mod h1:Op3hHsoHPAvb6lceZHDtd9OkTew38wNoXnJs8iY7rUg=
 
+github.com/Microsoft/hcsshim v0.8.7/go.mod h1:OHd7sQqRFrYd3RmSgbgji+ctCwkbq2wbEYNSzOYtcBQ=
 
+github.com/Microsoft/hcsshim v0.8.9/go.mod h1:5692vkUqntj1idxauYlpoINNKeqCiG6Sg38RRsjT5y8=
 
+github.com/Microsoft/hcsshim v0.8.14/go.mod h1:NtVKoYxQuTLx6gEq0L96c9Ju4JbRJ4nY2ow3VK6a9Lg=
 
+github.com/Microsoft/hcsshim v0.8.15/go.mod h1:x38A4YbHbdxJtc0sF6oIz+RG0npwSCAvn69iY6URG00=
 
 github.com/Microsoft/hcsshim v0.8.16/go.mod h1:o5/SZqmR7x9JNKsW3pu+nqHm0MF8vbA+VxGOoXdC600=
 
 github.com/Microsoft/hcsshim v0.8.23 h1:47MSwtKGXet80aIn+7h4YI6fwPmwIghAnsx2aOUrG2M=
 
 github.com/Microsoft/hcsshim v0.8.23/go.mod h1:4zegtUJth7lAvFyc6cH2gGQ5B3OFQim01nnU2M8jKDg=
 
+github.com/Microsoft/hcsshim/test v0.0.0-20201218223536-d3e5debf77da/go.mod h1:5hlzMzRKMLyo42nCZ9oml8AdTlq/0cvIaBv6tK1RehU=
 
+github.com/Microsoft/hcsshim/test v0.0.0-20210227013316-43a75bb4edd3/go.mod h1:mw7qgWloBUl75W/gVH3cQszUg1+gUITj7D6NY7ywVnY=
 
 github.com/NYTimes/gziphandler v0.0.0-20170623195520-56545f4a5d46/go.mod h1:3wb06e3pkSAbeQ52E9H9iFoQsEEwGN64994WTCIhntQ=
 
 github.com/PuerkitoBio/purell v1.1.1/go.mod h1:c11w/QuzBsJSee3cPx9rAFu61PvFxuPbtSwDGJws/X0=
 
 github.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578/go.mod h1:uGdkoq3SwY9Y+13GIhn11/XLaGBb4BfwItxLd5jeuXE=
 
 github.com/RackSec/srslog v0.0.0-20180709174129-a4725f04ec91 h1:vX+gnvBc56EbWYrmlhYbFYRaeikAke1GL84N4BEYOFE=
 
 github.com/RackSec/srslog v0.0.0-20180709174129-a4725f04ec91/go.mod h1:cDLGBht23g0XQdLjzn6xOGXDkLK182YfINAaZEQLCHQ=
 
+github.com/Shopify/logrus-bugsnag v0.0.0-20171204204709-577dee27f20d/go.mod h1:HI8ITrYtUY+O+ZhtlqUnD8+KwNPOyugEhfP9fdUIaEQ=
 
 github.com/alecthomas/template v0.0.0-20190718012654-fb15b899a751/go.mod h1:LOuyumcjzFXgccqObfd/Ljyb9UuFJ6TxHnclSeseNhc=
 
 github.com/alecthomas/units v0.0.0-20190717042225-c3de453c63f4/go.mod h1:ybxpYRFXyAe+OPACYpWeL0wqObRcbAqCMya13uyzqw0=
 
 github.com/alexflint/go-filemutex v0.0.0-20171022225611-72bdc8eae2ae/go.mod h1:CgnQgUtFrFz9mxFNtED3jI5tLDjKlOM+oUF/sTk6ps0=
 
@@ -56,19 +70,27 @@ github.com/armon/go-metrics v0.0.0-20150106224455-eb0af217e5e9/go.mod h1:Q73ZrmV
 
 github.com/armon/go-radix v0.0.0-20150105235045-e39d623f12e8 h1:XGHqlQXxwVly7mpcroyCGuEaGv/yvtS6r4PSHryDgxU=
 
 github.com/armon/go-radix v0.0.0-20150105235045-e39d623f12e8/go.mod h1:ufUuZ+zHj4x4TnLV4JWEpy2hxWSpsRywHrMgIH9cCH8=
 
 github.com/asaskevich/govalidator v0.0.0-20190424111038-f61b66f89f4a/go.mod h1:lB+ZfQJz7igIIfQNfa7Ml4HSf2uFQQRzpGGRXenZAgY=
 
+github.com/aws/aws-sdk-go v1.15.11/go.mod h1:mFuSZ37Z9YOHbQEwBWztmVzqXrEkub65tZoCYDt7FT0=
 
 github.com/aws/aws-sdk-go v1.28.11 h1:L2G5qI91s51cUP3hJli4mXRIZZ3alZHcwHWOJdMclKk=
 
 github.com/aws/aws-sdk-go v1.28.11/go.mod h1:KmX6BPdI08NWTb3/sm4ZGu5ShLoqVDhKgpiN924inxo=
 
+github.com/beorn7/perks v0.0.0-20160804104726-4c0e84591b9a/go.mod h1:Dwedo/Wpr24TaqPxmxbtue+5NUziq4I4S80YR8gNf3Q=
 
 github.com/beorn7/perks v1.0.1 h1:VlbKKnNfV8bJzeqoa4cOKqO6bYr3WgKZxO8Z16+hsOM=
 
 github.com/beorn7/perks v1.0.1/go.mod h1:G2ZrVWU2WbWT9wwq4/hrbKbnv/1ERSJQ0ibhJ6rlkpw=
 
 github.com/bgentry/speakeasy v0.1.0/go.mod h1:+zsyZBPWlz7T6j88CTgSN5bM796AkVf0kBD4zp0CCIs=
 
+github.com/bitly/go-simplejson v0.5.0/go.mod h1:cXHtHw4XUPsvGaxgjIAn8PhEWG9NfngEKAMDJEczWVA=
 
 github.com/bits-and-blooms/bitset v1.2.0/go.mod h1:gIdJ4wp64HaoK2YrL1Q5/N7Y16edYb8uY+O0FJTyyDA=
 
 github.com/bketelsen/crypt v0.0.3-0.20200106085610-5cbc8cc4026c/go.mod h1:MKsuJmJgSg28kpZDP6UIiPt0e0Oz0kqKNGyRaWEPv84=
 
+github.com/blang/semver v3.1.0+incompatible/go.mod h1:kRBLl5iJ+tD4TcOOxsy/0fnwebNt5EWlYSAyrTnjyyk=
 
 github.com/blang/semver v3.5.1+incompatible/go.mod h1:kRBLl5iJ+tD4TcOOxsy/0fnwebNt5EWlYSAyrTnjyyk=
 
 github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 h1:DDGfHa7BWjL4YnC6+E63dPcxHo2sUxDIu8g3QgEJdRY=
 
 github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869/go.mod h1:Ekp36dRnpXw/yCqJaO+ZrUyxD+3VXMFFr56k5XYrpB4=
 
+github.com/bshuster-repo/logrus-logstash-hook v0.4.1/go.mod h1:zsTqEiSzDgAa/8GZR7E1qaXrhYNDKBYy5/dWPTIflbk=
 
 github.com/bsphere/le_go v0.0.0-20170215134836-7a984a84b549 h1:QJJnIXZ34OUK5JfWlq1l3n0SfO9g1amiLFIcTECgpq0=
 
 github.com/bsphere/le_go v0.0.0-20170215134836-7a984a84b549/go.mod h1:313oBJKClgRD/+t59eUnrfG7/xHXZJd7v+SjCacDm4Q=
 
 github.com/buger/jsonparser v0.0.0-20180808090653-f4dd9f5a6b44/go.mod h1:bbYlZJ7hK1yFx9hf58LP0zeX7UjIGs20ufpu3evjr+s=
 
+github.com/bugsnag/bugsnag-go v0.0.0-20141110184014-b1d153021fcd/go.mod h1:2oa8nejYd4cQ/b0hMIopN0lCRxU0bueqREvZLWFrtK8=
 
+github.com/bugsnag/osext v0.0.0-20130617224835-0dd3f918b21b/go.mod h1:obH5gd0BsqsP2LwDJ9aOkm/6J86V6lyAXCoQWGw3K50=
 
+github.com/bugsnag/panicwrap v0.0.0-20151223152923-e2c28503fcd0/go.mod h1:D/8v3kj0zr8ZAKg1AQ6crr+5VwKN5eIywRkfhyM/+dE=
 
 github.com/cenkalti/backoff/v4 v4.1.1/go.mod h1:scbssz8iZGpm3xbr14ovlUdkxfGXNInqkPWOWmG2CLw=
 
 github.com/census-instrumentation/opencensus-proto v0.2.1/go.mod h1:f6KPmirojxKA12rnyqOA5BBL4O983OfeGPqjHWSTneU=
 
 github.com/cespare/xxhash/v2 v2.1.1 h1:6MnRN8NT7+YBpUIWxHtefFZOKTAPgGjpQSxqLNn0+qY=
 
@@ -79,6 +101,8 @@ github.com/checkpoint-restore/go-criu/v5 v5.3.0/go.mod h1:E/eQpaFtUKGOOSEBZgmKAc
 
 github.com/chzyer/logex v1.1.10/go.mod h1:+Ywpsq7O8HXn0nuIou7OrIPyXbp3wmkHB+jjWRnGsAI=
 
 github.com/chzyer/readline v0.0.0-20180603132655-2972be24d48e/go.mod h1:nSuG5e5PlCu98SY8svDHJxuZscDgtXS6KTTbou5AhLI=
 
 github.com/chzyer/test v0.0.0-20180213035817-a1ea475d72b1/go.mod h1:Q3SI9o4m/ZMnBNeIyt5eFwwo7qiLfzFZmjNmxjkiQlU=
 
+github.com/cilium/ebpf v0.0.0-20200110133405-4032b1d8aae3/go.mod h1:MA5e5Lr8slmEg9bt0VpxxWqJlO4iwu3FBdHUzV7wQVg=
 
+github.com/cilium/ebpf v0.0.0-20200702112145-1c8d4c9ef775/go.mod h1:7cR51M8ViRLIdUjrmSXlK9pkrsDlLHbO8jiB8X8JnOc=
 
 github.com/cilium/ebpf v0.2.0/go.mod h1:To2CFviqOWL/M0gIMsvSMlqe7em/l1ALkX1PyjrX2Qs=
 
 github.com/cilium/ebpf v0.4.0/go.mod h1:4tRaxcgiL706VnOzHOdBlY8IEAIdxINsQBcU4xJJXRs=
 
 github.com/cilium/ebpf v0.6.2/go.mod h1:4tRaxcgiL706VnOzHOdBlY8IEAIdxINsQBcU4xJJXRs=
 
@@ -88,53 +112,115 @@ github.com/cloudflare/cfssl v0.0.0-20180323000720-5d63dbd981b5 h1:PqZ3bA4yzwywiv
 
 github.com/cloudflare/cfssl v0.0.0-20180323000720-5d63dbd981b5/go.mod h1:yMWuSON2oQp+43nFtAV/uvKQIFpSPerB57DCt9t8sSA=
 
 github.com/cockroachdb/datadriven v0.0.0-20190809214429-80d97fb3cbaa/go.mod h1:zn76sxSg3SzpJ0PPJaLDCu+Bu0Lg3sKTORVIj19EIF8=
 
 github.com/codahale/hdrhistogram v0.0.0-20160425231609-f8ad88b59a58/go.mod h1:sE/e/2PUdi/liOCUjSTXgM1o87ZssimdTWN964YiIeI=
 
+github.com/containerd/aufs v0.0.0-20200908144142-dab0cbea06f4/go.mod h1:nukgQABAEopAHvB6j7cnP5zJ+/3aVcE7hCYqvIwAHyE=
 
+github.com/containerd/aufs v0.0.0-20201003224125-76a6863f2989/go.mod h1:AkGGQs9NM2vtYHaUen+NljV0/baGCAPELGm2q9ZXpWU=
 
+github.com/containerd/aufs v0.0.0-20210316121734-20793ff83c97/go.mod h1:kL5kd6KM5TzQjR79jljyi4olc1Vrx6XBlcyj3gNv2PU=
 
 github.com/containerd/aufs v1.0.0/go.mod h1:kL5kd6KM5TzQjR79jljyi4olc1Vrx6XBlcyj3gNv2PU=
 
+github.com/containerd/btrfs v0.0.0-20201111183144-404b9149801e/go.mod h1:jg2QkJcsabfHugurUvvPhS3E08Oxiuh5W/g1ybB4e0E=
 
+github.com/containerd/btrfs v0.0.0-20210316141732-918d888fb676/go.mod h1:zMcX3qkXTAi9GI50+0HOeuV8LU2ryCE/V2vG/ZBiTss=
 
 github.com/containerd/btrfs v1.0.0/go.mod h1:zMcX3qkXTAi9GI50+0HOeuV8LU2ryCE/V2vG/ZBiTss=
 
+github.com/containerd/cgroups v0.0.0-20190717030353-c4b9ac5c7601/go.mod h1:X9rLEHIqSf/wfK8NsPqxJmeZgW4pcfzdXITDrUSJ6uI=
 
+github.com/containerd/cgroups v0.0.0-20190919134610-bf292b21730f/go.mod h1:OApqhQ4XNSNC13gXIwDjhOQxjWa/NxkwZXJ1EvqT0ko=
 
+github.com/containerd/cgroups v0.0.0-20200531161412-0dbf7f05ba59/go.mod h1:pA0z1pT8KYB3TCXK/ocprsh7MAkoW8bZVzPdih9snmM=
 
+github.com/containerd/cgroups v0.0.0-20200710171044-318312a37340/go.mod h1:s5q4SojHctfxANBDvMeIaIovkq29IP48TKAxnhYRxvo=
 
+github.com/containerd/cgroups v0.0.0-20200824123100-0b889c03f102/go.mod h1:s5q4SojHctfxANBDvMeIaIovkq29IP48TKAxnhYRxvo=
 
 github.com/containerd/cgroups v0.0.0-20210114181951-8a68de567b68/go.mod h1:ZJeTFisyysqgcCdecO57Dj79RfL0LNeGiFUqLYQRYLE=
 
 github.com/containerd/cgroups v1.0.1 h1:iJnMvco9XGvKUvNQkv88bE4uJXxRQH18efbKo9w5vHQ=
 
 github.com/containerd/cgroups v1.0.1/go.mod h1:0SJrPIenamHDcZhEcJMNBB85rHcUsw4f25ZfBiPYRkU=
 
+github.com/containerd/console v0.0.0-20180822173158-c12b1e7919c1/go.mod h1:Tj/on1eG8kiEhd0+fhSDzsPAFESxzBBvdyEgyryXffw=
 
+github.com/containerd/console v0.0.0-20181022165439-0650fd9eeb50/go.mod h1:Tj/on1eG8kiEhd0+fhSDzsPAFESxzBBvdyEgyryXffw=
 
+github.com/containerd/console v0.0.0-20191206165004-02ecf6a7291e/go.mod h1:8Pf4gM6VEbTNRIT26AyyU7hxdQU3MvAvxVI0sc00XBE=
 
 github.com/containerd/console v1.0.1/go.mod h1:XUsP6YE/mKtz6bxc+I8UiKKTP04qjQL4qcS3XoQ5xkw=
 
 github.com/containerd/console v1.0.2/go.mod h1:ytZPjGgY2oeTkAONYafi2kSj0aYggsf8acV1PGKCbzQ=
 
 github.com/containerd/console v1.0.3 h1:lIr7SlA5PxZyMV30bDW0MGbiOPXwc63yRuCP0ARubLw=
 
 github.com/containerd/console v1.0.3/go.mod h1:7LqA/THxQ86k76b8c/EMSiaJ3h1eZkMkXar0TQ1gf3U=
 
+github.com/containerd/containerd v1.2.10/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.3.0-beta.2.0.20190828155532-0293cbd26c69/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.3.0/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.3.1-0.20191213020239-082f7e3aed57/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.3.2/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.4.0-beta.2.0.20200729163537-40b22ef07410/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.4.1/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.4.3/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.4.9/go.mod h1:bC6axHOhabU15QhwfG7w5PipXdVtMXFTttgp+kVtyUA=
 
+github.com/containerd/containerd v1.5.0-beta.1/go.mod h1:5HfvG1V2FsKesEGQ17k5/T7V960Tmcumvqn8Mc+pCYQ=
 
+github.com/containerd/containerd v1.5.0-beta.3/go.mod h1:/wr9AVtEM7x9c+n0+stptlo/uBBoBORwEx6ardVcmKU=
 
+github.com/containerd/containerd v1.5.0-beta.4/go.mod h1:GmdgZd2zA2GYIBZ0w09ZvgqEq8EfBp/m3lcVZIvPHhI=
 
+github.com/containerd/containerd v1.5.0-rc.0/go.mod h1:V/IXoMqNGgBlabz3tHD2TWDoTJseu1FGOKuoA4nNb2s=
 
+github.com/containerd/containerd v1.5.2/go.mod h1:0DOxVqwDy2iZvrZp2JUx/E+hS0UNTVn7dJnIOwtYR4g=
 
 github.com/containerd/containerd v1.5.8 h1:NmkCC1/QxyZFBny8JogwLpOy2f+VEbO/f6bV2Mqtwuw=
 
 github.com/containerd/containerd v1.5.8/go.mod h1:YdFSv5bTFLpG2HIYmfqDpSYYTDX+mc5qtSuYx1YUb/s=
 
+github.com/containerd/continuity v0.0.0-20190426062206-aaeac12a7ffc/go.mod h1:GL3xCUCBDV3CZiTSEKksMWbLE66hEyuu9qyDOOqM47Y=
 
+github.com/containerd/continuity v0.0.0-20190815185530-f2a389ac0a02/go.mod h1:GL3xCUCBDV3CZiTSEKksMWbLE66hEyuu9qyDOOqM47Y=
 
+github.com/containerd/continuity v0.0.0-20191127005431-f65d91d395eb/go.mod h1:GL3xCUCBDV3CZiTSEKksMWbLE66hEyuu9qyDOOqM47Y=
 
+github.com/containerd/continuity v0.0.0-20200710164510-efbc4488d8fe/go.mod h1:cECdGN1O8G9bgKTlLhuPJimka6Xb/Gg7vYzCTNVxhvo=
 
+github.com/containerd/continuity v0.0.0-20201208142359-180525291bb7/go.mod h1:kR3BEg7bDFaEddKm54WSmrol1fKWDU1nKYkgrcgZT7Y=
 
 github.com/containerd/continuity v0.0.0-20210208174643-50096c924a4e/go.mod h1:EXlVlkqNba9rJe3j7w3Xa924itAMLgZH4UD/Q4PExuQ=
 
 github.com/containerd/continuity v0.1.0 h1:UFRRY5JemiAhPZrr/uE0n8fMTLcZsUvySPr1+D7pgr8=
 
 github.com/containerd/continuity v0.1.0/go.mod h1:ICJu0PwR54nI0yPEnJ6jcS+J7CZAUXrLh8lPo2knzsM=
 
+github.com/containerd/fifo v0.0.0-20180307165137-3d5202aec260/go.mod h1:ODA38xgv3Kuk8dQz2ZQXpnv/UZZUHUCL7pnLehbXgQI=
 
+github.com/containerd/fifo v0.0.0-20190226154929-a9fb20d87448/go.mod h1:ODA38xgv3Kuk8dQz2ZQXpnv/UZZUHUCL7pnLehbXgQI=
 
+github.com/containerd/fifo v0.0.0-20200410184934-f15a3290365b/go.mod h1:jPQ2IAeZRCYxpS/Cm1495vGFww6ecHmMk1YJH2Q5ln0=
 
+github.com/containerd/fifo v0.0.0-20201026212402-0724c46b320c/go.mod h1:jPQ2IAeZRCYxpS/Cm1495vGFww6ecHmMk1YJH2Q5ln0=
 
+github.com/containerd/fifo v0.0.0-20210316144830-115abcc95a1d/go.mod h1:ocF/ME1SX5b1AOlWi9r677YJmCPSwwWnQ9O123vzpE4=
 
 github.com/containerd/fifo v1.0.0 h1:6PirWBr9/L7GDamKr+XM0IeUFXu5mf3M/BPpH9gaLBU=
 
 github.com/containerd/fifo v1.0.0/go.mod h1:ocF/ME1SX5b1AOlWi9r677YJmCPSwwWnQ9O123vzpE4=
 
 github.com/containerd/fuse-overlayfs-snapshotter v1.0.2/go.mod h1:nRZceC8a7dRm3Ao6cJAwuJWPFiBPaibHiFntRUnzhwU=
 
+github.com/containerd/go-cni v1.0.1/go.mod h1:+vUpYxKvAF72G9i1WoDOiPGRtQpqsNW/ZHtSlv++smU=
 
 github.com/containerd/go-cni v1.0.2/go.mod h1:nrNABBHzu0ZwCug9Ije8hL2xBCYh/pjfMb1aZGrrohk=
 
+github.com/containerd/go-runc v0.0.0-20180907222934-5a6d9f37cfa3/go.mod h1:IV7qH3hrUgRmyYrtgEeGWJfWbgcHL9CSRruz2Vqcph0=
 
+github.com/containerd/go-runc v0.0.0-20190911050354-e029b79d8cda/go.mod h1:IV7qH3hrUgRmyYrtgEeGWJfWbgcHL9CSRruz2Vqcph0=
 
+github.com/containerd/go-runc v0.0.0-20200220073739-7016d3ce2328/go.mod h1:PpyHrqVs8FTi9vpyHwPwiNEGaACDxT/N/pLcvMSRA9g=
 
 github.com/containerd/go-runc v0.0.0-20201020171139-16b287bc67d0/go.mod h1:cNU0ZbCgCQVZK4lgG3P+9tn9/PaJNmoDXPpoJhDR+Ok=
 
 github.com/containerd/go-runc v1.0.0 h1:oU+lLv1ULm5taqgV/CJivypVODI4SUz1znWjv3nNYS0=
 
 github.com/containerd/go-runc v1.0.0/go.mod h1:cNU0ZbCgCQVZK4lgG3P+9tn9/PaJNmoDXPpoJhDR+Ok=
 
+github.com/containerd/imgcrypt v1.0.1/go.mod h1:mdd8cEPW7TPgNG4FpuP3sGBiQ7Yi/zak9TYCG3juvb0=
 
+github.com/containerd/imgcrypt v1.0.4-0.20210301171431-0ae5c75f59ba/go.mod h1:6TNsg0ctmizkrOgXRNQjAPFWpMYRWuiB6dSF4Pfa5SA=
 
+github.com/containerd/imgcrypt v1.1.1-0.20210312161619-7ed62a527887/go.mod h1:5AZJNI6sLHJljKuI9IHnw1pWqo/F0nGDOuR9zgTs7ow=
 
 github.com/containerd/imgcrypt v1.1.1/go.mod h1:xpLnwiQmEUJPvQoAapeb2SNCxz7Xr6PJrXQb0Dpc4ms=
 
+github.com/containerd/nri v0.0.0-20201007170849-eb1350a75164/go.mod h1:+2wGSDGFYfE5+So4M5syatU0N0f0LbWpuqyMi4/BE8c=
 
+github.com/containerd/nri v0.0.0-20210316161719-dbaa18c31c14/go.mod h1:lmxnXF6oMkbqs39FiCt1s0R2HSMhcLel9vNL3m4AaeY=
 
 github.com/containerd/nri v0.1.0/go.mod h1:lmxnXF6oMkbqs39FiCt1s0R2HSMhcLel9vNL3m4AaeY=
 
 github.com/containerd/stargz-snapshotter v0.6.4/go.mod h1:1t0SF1gAHJhCSftWKDLVitvfF3c2qhL5hymG7C50wto=
 
 github.com/containerd/stargz-snapshotter/estargz v0.6.4/go.mod h1:83VWDqHnurTKliEB0YvWMiCfLDwv4Cjj1X9Vk98GJZw=
 
+github.com/containerd/ttrpc v0.0.0-20190828154514-0e0f228740de/go.mod h1:PvCDdDGpgqzQIzDW1TphrGLssLDZp2GuS+X5DkEJB8o=
 
+github.com/containerd/ttrpc v0.0.0-20190828172938-92c8520ef9f8/go.mod h1:PvCDdDGpgqzQIzDW1TphrGLssLDZp2GuS+X5DkEJB8o=
 
+github.com/containerd/ttrpc v0.0.0-20191028202541-4f1b8fe65a5c/go.mod h1:LPm1u0xBw8r8NOKoOdNMeVHSawSsltak+Ihv+etqsE8=
 
+github.com/containerd/ttrpc v1.0.1/go.mod h1:UAxOpgT9ziI0gJrmKvgcZivgxOp8iFPSk8httJEt98Y=
 
 github.com/containerd/ttrpc v1.0.2/go.mod h1:UAxOpgT9ziI0gJrmKvgcZivgxOp8iFPSk8httJEt98Y=
 
 github.com/containerd/ttrpc v1.1.0 h1:GbtyLRxb0gOLR0TYQWt3O6B0NvT8tMdorEHqIQo/lWI=
 
 github.com/containerd/ttrpc v1.1.0/go.mod h1:XX4ZTnoOId4HklF4edwc4DcqskFZuvXB1Evzy5KFQpQ=
 
+github.com/containerd/typeurl v0.0.0-20180627222232-a93fcdb778cd/go.mod h1:Cm3kwCdlkCfMSHURc+r6fwoGH6/F1hH3S4sg0rLFWPc=
 
+github.com/containerd/typeurl v0.0.0-20190911142611-5eb25027c9fd/go.mod h1:GeKYzf2pQcqv7tJ0AoCuuhtnqhva5LNU3U+OyKxxJpk=
 
 github.com/containerd/typeurl v1.0.1/go.mod h1:TB1hUtrpaiO88KEK56ijojHS1+NeF0izUACaJW2mdXg=
 
 github.com/containerd/typeurl v1.0.2 h1:Chlt8zIieDbzQFzXzAeBEF92KhExuE4p9p92/QmY7aY=
 
 github.com/containerd/typeurl v1.0.2/go.mod h1:9trJWW2sRlGub4wZJRTW83VtbOLS6hwcDZXTn6oPz9s=
 
+github.com/containerd/zfs v0.0.0-20200918131355-0a33824f23a2/go.mod h1:8IgZOBdv8fAgXddBT4dBXJPtxyRsejFIpXoklgxgEjw=
 
+github.com/containerd/zfs v0.0.0-20210301145711-11e8f1707f62/go.mod h1:A9zfAbMlQwE+/is6hi0Xw8ktpL+6glmqZYtevJgaB8Y=
 
+github.com/containerd/zfs v0.0.0-20210315114300-dde8f0fda960/go.mod h1:m+m51S1DvAP6r3FcmYCp54bQ34pyOwTieQDNRIRHsFY=
 
+github.com/containerd/zfs v0.0.0-20210324211415-d5c4544f0433/go.mod h1:m+m51S1DvAP6r3FcmYCp54bQ34pyOwTieQDNRIRHsFY=
 
 github.com/containerd/zfs v1.0.0/go.mod h1:m+m51S1DvAP6r3FcmYCp54bQ34pyOwTieQDNRIRHsFY=
 
+github.com/containernetworking/cni v0.7.1/go.mod h1:LGwApLUm2FpoOfxTDEeq8T9ipbpZ61X79hmU3w8FmsY=
 
 github.com/containernetworking/cni v0.8.0/go.mod h1:LGwApLUm2FpoOfxTDEeq8T9ipbpZ61X79hmU3w8FmsY=
 
 github.com/containernetworking/cni v0.8.1/go.mod h1:LGwApLUm2FpoOfxTDEeq8T9ipbpZ61X79hmU3w8FmsY=
 
+github.com/containernetworking/plugins v0.8.6/go.mod h1:qnw5mN19D8fIwkqW7oHHYDHVlzhJpcY6TQxn/fUyDDM=
 
 github.com/containernetworking/plugins v0.9.1/go.mod h1:xP/idU2ldlzN6m4p5LmGiwRDjeJr6FLK6vuiUwoH7P8=
 
+github.com/containers/ocicrypt v1.0.1/go.mod h1:MeJDzk1RJHv89LjsH0Sp5KTY3ZYkjXO/C+bKAeWFIrc=
 
+github.com/containers/ocicrypt v1.1.0/go.mod h1:b8AOe0YR67uU8OqfVNcznfFpAzu3rdgUV4GP9qXPfu4=
 
 github.com/containers/ocicrypt v1.1.1/go.mod h1:Dm55fwWm1YZAjYRaJ94z2mfZikIyIN4B0oB3dj3jFxY=
 
 github.com/coreos/bbolt v1.3.2/go.mod h1:iRUV2dpdMOn7Bo10OQBFzIJO9kkE559Wcmn+qkEiiKk=
 
 github.com/coreos/etcd v3.3.10+incompatible/go.mod h1:uF7uidLiAD3TWHmW31ZFd/JWoc32PjwdhPthX9715RE=
 
 github.com/coreos/etcd v3.3.13+incompatible/go.mod h1:uF7uidLiAD3TWHmW31ZFd/JWoc32PjwdhPthX9715RE=
 
 github.com/coreos/etcd v3.3.27+incompatible h1:QIudLb9KeBsE5zyYxd1mjzRSkzLg9Wf9QlRwFgd6oTA=
 
 github.com/coreos/etcd v3.3.27+incompatible/go.mod h1:uF7uidLiAD3TWHmW31ZFd/JWoc32PjwdhPthX9715RE=
 
+github.com/coreos/go-iptables v0.4.5/go.mod h1:/mVI274lEDI2ns62jHCDnCyBF9Iwsmekav8Dbxlm1MU=
 
 github.com/coreos/go-iptables v0.5.0/go.mod h1:/mVI274lEDI2ns62jHCDnCyBF9Iwsmekav8Dbxlm1MU=
 
 github.com/coreos/go-oidc v2.1.0+incompatible/go.mod h1:CgnwVTmzoESiwO9qyAFEMiHoZ1nMCKZlZ9V6mm3/LKc=
 
 github.com/coreos/go-semver v0.2.0/go.mod h1:nnelYz7RCh+5ahJtPPxZlU+153eP4D4r3EedlOD2RNk=
 
 github.com/coreos/go-semver v0.3.0/go.mod h1:nnelYz7RCh+5ahJtPPxZlU+153eP4D4r3EedlOD2RNk=
 
 github.com/coreos/go-systemd v0.0.0-20180511133405-39ca1b05acc7 h1:u9SHYsPQNyt5tgDm3YN7+9dYrpK96E5wFilTFWIDZOM=
 
 github.com/coreos/go-systemd v0.0.0-20180511133405-39ca1b05acc7/go.mod h1:F5haX7vjVVG0kc13fIWeqUViNPyEJxv/OmvnBo0Yme4=
 
+github.com/coreos/go-systemd/v22 v22.0.0/go.mod h1:xO0FLkIi5MaZafQlIrOotqXZ90ih+1atmu1JpKERPPk=
 
 github.com/coreos/go-systemd/v22 v22.1.0/go.mod h1:xO0FLkIi5MaZafQlIrOotqXZ90ih+1atmu1JpKERPPk=
 
 github.com/coreos/go-systemd/v22 v22.3.2 h1:D9/bQk5vlXQFZ6Kwuu6zaiXJ9oTPe68++AzAJc1DzSI=
 
 github.com/coreos/go-systemd/v22 v22.3.2/go.mod h1:Y58oyj3AT4RCenI/lSvhwexgC+NSVTIJ3seZv2GcEnc=
 
@@ -157,9 +243,14 @@ github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c
 
 github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
 
 github.com/deckarep/golang-set v0.0.0-20141123011944-ef32fa3046d9 h1:YpTz1+8tEHbybtxtMJNkV3U3GBAA05EakMRTR3dXkis=
 
 github.com/deckarep/golang-set v0.0.0-20141123011944-ef32fa3046d9/go.mod h1:93vsz/8Wt4joVM7c2AVqh+YRMiUSc14yDtF28KmMOgQ=
 
+github.com/denverdino/aliyungo v0.0.0-20190125010748-a747050bb1ba/go.mod h1:dV8lFg6daOBZbT6/BDGIz6Y3WFGn8juu6G+CQ6LHtl0=
 
+github.com/dgrijalva/jwt-go v0.0.0-20170104182250-a601269ab70c/go.mod h1:E3ru+11k8xSBh+hMPgOLZmtrrCbhqsmaPHjLKYnJCaQ=
 
 github.com/dgrijalva/jwt-go v3.2.0+incompatible/go.mod h1:E3ru+11k8xSBh+hMPgOLZmtrrCbhqsmaPHjLKYnJCaQ=
 
+github.com/dnaeon/go-vcr v1.0.1/go.mod h1:aBB1+wY4s93YsC3HHjMBMrwTj2R9FHDzUr9KyGc8n1E=
 
 github.com/docker/cli v20.10.6+incompatible/go.mod h1:JLrzqnKDaYBop7H2jaqPtU4hHvMKP+vjCwu2uszcLI8=
 
 github.com/docker/cli v20.10.7+incompatible/go.mod h1:JLrzqnKDaYBop7H2jaqPtU4hHvMKP+vjCwu2uszcLI8=
 
+github.com/docker/distribution v0.0.0-20190905152932-14b96e55d84c/go.mod h1:0+TTO4EOBfRPhZXAeF1Vu+W3hHZ8eLp8PgKVZlcvtFY=
 
+github.com/docker/distribution v2.7.1-0.20190205005809-0d3efadf0154+incompatible/go.mod h1:J2gT2udsDAN96Uj4KfcMRqY0/ypR+oyYUYmja8H+y+w=
 
 github.com/docker/distribution v2.7.1+incompatible/go.mod h1:J2gT2udsDAN96Uj4KfcMRqY0/ypR+oyYUYmja8H+y+w=
 
 github.com/docker/distribution v2.8.0+incompatible h1:l9EaZDICImO1ngI+uTifW+ZYvvz7fKISBAKpg+MbWbY=
 
 github.com/docker/distribution v2.8.0+incompatible/go.mod h1:J2gT2udsDAN96Uj4KfcMRqY0/ypR+oyYUYmja8H+y+w=
 
@@ -169,14 +260,17 @@ github.com/docker/docker v20.10.7+incompatible/go.mod h1:eEKB0N0r5NX/I1kEveEz05b
 
 github.com/docker/docker-credential-helpers v0.6.3/go.mod h1:WRaJzqw3CTB9bk10avuGsjVBZsD05qeibJ1/TYlvc0Y=
 
 github.com/docker/go-connections v0.4.0 h1:El9xVISelRB7BuFusrZozjnkIM5YnzCViNKohAFqRJQ=
 
 github.com/docker/go-connections v0.4.0/go.mod h1:Gbd7IOopHjR8Iph03tsViu4nIes5XhDvyHbTtUxmeec=
 
+github.com/docker/go-events v0.0.0-20170721190031-9461782956ad/go.mod h1:Uw6UezgYA44ePAFQYUehOuCzmy5zmg/+nl2ZfMWGkpA=
 
 github.com/docker/go-events v0.0.0-20190806004212-e31b211e4f1c h1:+pKlWGMw7gf6bQ+oDZB4KHQFypsfjYlq/C4rfL7D3g8=
 
 github.com/docker/go-events v0.0.0-20190806004212-e31b211e4f1c/go.mod h1:Uw6UezgYA44ePAFQYUehOuCzmy5zmg/+nl2ZfMWGkpA=
 
+github.com/docker/go-metrics v0.0.0-20180209012529-399ea8c73916/go.mod h1:/u0gXw0Gay3ceNrsHubL3BtdOL2fHf93USgMTe0W5dI=
 
 github.com/docker/go-metrics v0.0.1 h1:AgB/0SvBxihN0X8OR4SjsblXkbMvalQ8cjmtKQ2rQV8=
 
 github.com/docker/go-metrics v0.0.1/go.mod h1:cG1hvH2utMXtqgqqYE9plW6lDxS3/5ayHzueweSI3Vw=
 
 github.com/docker/go-units v0.4.0 h1:3uh0PgVws3nIA0Q+MwDC8yjEPf9zjRfZZWXZYDct3Tw=
 
 github.com/docker/go-units v0.4.0/go.mod h1:fgPhTUdO+D/Jk86RDLlptpiXQzgHJF7gydDDbaIK4Dk=
 
 github.com/docker/libkv v0.2.2-0.20211217103745-e480589147e3 h1:q6MhOaE4xsrl6cAiFYrazobNFSQN6ckhD6Et9zYbcrU=
 
 github.com/docker/libkv v0.2.2-0.20211217103745-e480589147e3/go.mod h1:r5hEwHwW8dr0TFBYGCarMNbrQOiwL1xoqDYZ/JqoTK0=
 
+github.com/docker/libtrust v0.0.0-20150114040149-fa567046d9b1/go.mod h1:cyGadeNEkKy96OOhEzfZl+yxihPEzKnqJwvfuSUqbZE=
 
 github.com/docker/libtrust v0.0.0-20150526203908-9cbd2a1374f4 h1:k8TfKGeAcDQFFQOGCQMRN04N4a9YrPlRMMKnzAuvM9Q=
 
 github.com/docker/libtrust v0.0.0-20150526203908-9cbd2a1374f4/go.mod h1:cyGadeNEkKy96OOhEzfZl+yxihPEzKnqJwvfuSUqbZE=
 
 github.com/docker/spdystream v0.0.0-20160310174837-449fdfce4d96/go.mod h1:Qh8CwZgvJUkLughtfhJv5dyTYa91l1fOUCrgjqmcifM=
 
@@ -202,10 +296,13 @@ github.com/frankban/quicktest v1.11.3/go.mod h1:wRf/ReqHper53s+kmmSZizM8NamnL3IM
 
 github.com/fsnotify/fsnotify v1.4.7/go.mod h1:jwhsz4b93w/PPRr/qN1Yymfu8t87LnFCMoQvtojpjFo=
 
 github.com/fsnotify/fsnotify v1.4.9 h1:hsms1Qyu0jgnwNXIxa+/V/PDsU6CfLf6CNO8H7IWoS4=
 
 github.com/fsnotify/fsnotify v1.4.9/go.mod h1:znqG4EE+3YCdAaPaxE2ZRY/06pZUdp0tY4IgpuI1SZQ=
 
+github.com/fullsailor/pkcs7 v0.0.0-20190404230743-d7302db945fa/go.mod h1:KnogPXtdwXqoenmZCw6S+25EAm2MkxbG0deNDu4cbSA=
 
+github.com/garyburd/redigo v0.0.0-20150301180006-535138d7bcd7/go.mod h1:NR3MbYisc3/PwhQ00EMzDiPmrwpPxAn5GI05/YaO1SY=
 
 github.com/ghodss/yaml v0.0.0-20150909031657-73d445a93680/go.mod h1:4dBDuWmgqj2HViK6kFavaiC9ZROes6MMH2rRYeMEF04=
 
 github.com/ghodss/yaml v1.0.0/go.mod h1:4dBDuWmgqj2HViK6kFavaiC9ZROes6MMH2rRYeMEF04=
 
 github.com/go-gl/glfw v0.0.0-20190409004039-e6da0acd62b1/go.mod h1:vR7hzQXu2zJy9AVAgeJqvqgH9Q5CA+iKCZ2gyEVpxRU=
 
 github.com/go-gl/glfw/v3.3/glfw v0.0.0-20191125211704-12ad95a8df72/go.mod h1:tQ2UAYgL5IevRw8kRxooKSPJfGvJ9fJQFa0TUsXzTg8=
 
+github.com/go-ini/ini v1.25.4/go.mod h1:ByCAeIL28uOIIG0E3PJtZPDL8WnHpFKFOtgjp+3Ies8=
 
 github.com/go-kit/kit v0.9.0/go.mod h1:xBxKIO96dXMWWy0MnWVtmwkA9/13aqxPnvrjFYMA2as=
 
 github.com/go-logfmt/logfmt v0.4.0/go.mod h1:3RMwSq7FuexP4Kalkev3ejPJsZTpXXBr9+V4qmtdjCk=
 
 github.com/go-logr/logr v0.1.0/go.mod h1:ixOQHD9gLJUVQQ2ZOR7zLEifBX6tGkNJF4QyIY7sIas=
 
@@ -218,7 +315,9 @@ github.com/go-openapi/spec v0.19.3/go.mod h1:FpwSN1ksY1eteniUU7X0N/BgJ7a4WvBFVA8
 
 github.com/go-openapi/swag v0.19.2/go.mod h1:POnQmlKehdgb5mhVOsnJFsivZCEZ/vjK9gh66Z9tfKk=
 
 github.com/go-openapi/swag v0.19.5/go.mod h1:POnQmlKehdgb5mhVOsnJFsivZCEZ/vjK9gh66Z9tfKk=
 
 github.com/go-stack/stack v1.8.0/go.mod h1:v0f6uXyyMGvRgIKkXu+yp6POWl0qKG85gN/melR3HDY=
 
+github.com/godbus/dbus v0.0.0-20151105175453-c7fdd8b5cd55/go.mod h1:/YcGZj5zSblfDWMMoOzV4fas9FZnQYTkDnsGvmh2Grw=
 
 github.com/godbus/dbus v0.0.0-20180201030542-885f9cc04c9c/go.mod h1:/YcGZj5zSblfDWMMoOzV4fas9FZnQYTkDnsGvmh2Grw=
 
+github.com/godbus/dbus v0.0.0-20190422162347-ade71ed3457e/go.mod h1:bBOAhwG1umN6/6ZUMtDFBMQR8jRg9O75tm9K00oMsK4=
 
 github.com/godbus/dbus/v5 v5.0.3/go.mod h1:xhWf0FNVPg57R7Z0UbKHbJfkEywrmjJnf7w5xrFpKfA=
 
 github.com/godbus/dbus/v5 v5.0.4/go.mod h1:xhWf0FNVPg57R7Z0UbKHbJfkEywrmjJnf7w5xrFpKfA=
 
 github.com/godbus/dbus/v5 v5.0.6 h1:mkgN1ofwASrYnJ5W6U/BxG15eXXXjirgZc7CLqkcaro=
 
@@ -228,6 +327,8 @@ github.com/gofrs/flock v0.7.3/go.mod h1:F1TvTiK9OcQqauNUHlbJvyl9Qa1QvF/gOUDKA14j
 
 github.com/gogo/googleapis v1.3.2 h1:kX1es4djPJrsDhY7aZKJy7aZasdcB5oSOEphMjSB53c=
 
 github.com/gogo/googleapis v1.3.2/go.mod h1:5YRNX2z1oM5gXdAkurHa942MDgEJyk02w4OecKY87+c=
 
 github.com/gogo/protobuf v1.2.1/go.mod h1:hp+jE20tsWTFYpLwKvXlhS1hjn+gTNwPg2I6zVXpSg4=
 
+github.com/gogo/protobuf v1.2.2-0.20190723190241-65acae22fc9d/go.mod h1:SlYgWuQ5SjCEi6WLHjHCa1yvBfUnHcTbrrZtXPKa29o=
 
+github.com/gogo/protobuf v1.3.0/go.mod h1:SlYgWuQ5SjCEi6WLHjHCa1yvBfUnHcTbrrZtXPKa29o=
 
 github.com/gogo/protobuf v1.3.1/go.mod h1:SlYgWuQ5SjCEi6WLHjHCa1yvBfUnHcTbrrZtXPKa29o=
 
 github.com/gogo/protobuf v1.3.2 h1:Ov1cvc58UF3b5XjBnZv7+opcTcQFZebYjWzi34vdm4Q=
 
 github.com/gogo/protobuf v1.3.2/go.mod h1:P1XiOD3dCwIKUDQYPy72D8LYyHL2YPYrpS2s69NZV8Q=
 
@@ -245,6 +346,8 @@ github.com/golang/mock v1.1.1/go.mod h1:oTYuIxOrZwtPieC+H1uAHpcLFnEyAGVDL/k47Jfb
 
 github.com/golang/mock v1.4.3/go.mod h1:UOMv5ysSaYNkG+OFQykRIcU/QvvxJf3p21QfJ2Bt3cw=
 
 github.com/golang/protobuf v1.3.5 h1:F768QJ1E9tib+q5Sc8MkdJi1RxLTbRcTf8LJV56aRls=
 
 github.com/golang/protobuf v1.3.5/go.mod h1:6O5/vntMXwX2lRkT1hjjk0nAC1IDOTvTlVgjlRvqsdk=
 
+github.com/golang/snappy v0.0.3 h1:fHPg5GQYlCeLIPB9BZqMVR5nR9A+IM5zcgeTdjMYmLA=
 
+github.com/golang/snappy v0.0.3/go.mod h1:/XxbfmMg8lxefKM7IXC3fBNl/7bRcc72aCRzEWrmP2Q=
 
 github.com/google/btree v0.0.0-20180813153112-4030bb1f1f0c/go.mod h1:lNA+9X1NB3Zf8V7Ke586lFgjr2dZNuvo3lPJSGZ5JPQ=
 
 github.com/google/btree v1.0.0/go.mod h1:lNA+9X1NB3Zf8V7Ke586lFgjr2dZNuvo3lPJSGZ5JPQ=
 
 github.com/google/btree v1.0.1 h1:gK4Kx5IaGY9CD5sPJ36FHiBJ6ZXl0kilRiiCj+jdYp4=
 
@@ -259,20 +362,29 @@ github.com/google/martian v2.1.0+incompatible/go.mod h1:9I4somxYTbIHy5NJKHRl3wXi
 
 github.com/google/pprof v0.0.0-20200507031123-427632fa3b1c/go.mod h1:ZgVRPoUq/hfqzAqh7sHMqb3I9Rq5C59dIz2SbBwJ4eM=
 
 github.com/google/shlex v0.0.0-20191202100458-e7afc7fbc510 h1:El6M4kTTCOh6aBiKaUGG7oYTSPP8MxqL4YI3kZKwcP4=
 
 github.com/google/shlex v0.0.0-20191202100458-e7afc7fbc510/go.mod h1:pupxD2MaaD3pAXIBCelhxNneeOaAeabZDe5s4K6zSpQ=
 
-github.com/google/uuid v1.1.1 h1:Gkbcsh/GbpXz7lPftLA3P6TYMwjCLYm83jiFQZF/3gY=
 
+github.com/google/uuid v1.0.0/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo=
 
 github.com/google/uuid v1.1.1/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo=
 
+github.com/google/uuid v1.1.2/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo=
 
+github.com/google/uuid v1.2.0/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo=
 
+github.com/google/uuid v1.3.0 h1:t6JiXgmwXMjEs8VusXIJk2BXHsn+wx8BZdTaoZ5fu7I=
 
+github.com/google/uuid v1.3.0/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo=
 
 github.com/googleapis/gax-go/v2 v2.0.5 h1:sjZBwGj9Jlw33ImPtvFviGYvseOtDM7hkSKB7+Tv3SM=
 
 github.com/googleapis/gax-go/v2 v2.0.5/go.mod h1:DWXyrwAJ9X0FpwwEdw+IPEYBICEFu5mhpdKc/us6bOk=
 
 github.com/googleapis/gnostic v0.4.1/go.mod h1:LRhVm6pbyptWbWbuZ38d1eyptfvIytN3ir6b65WBswg=
 
 github.com/gopherjs/gopherjs v0.0.0-20181017120253-0766667cb4d1/go.mod h1:wJfORRmW1u3UXTncJ5qlYoELFm8eSnnEO6hX4iZ3EWY=
 
+github.com/gorilla/handlers v0.0.0-20150720190736-60c7bfde3e33/go.mod h1:Qkdc/uu4tH4g6mTK6auzZ766c4CA0Ng8+o/OAirnOIQ=
 
+github.com/gorilla/mux v1.7.2/go.mod h1:1lud6UwP+6orDFRuTfBEV8e9/aOM/c4fVVCaMa2zaAs=
 
 github.com/gorilla/mux v1.8.0 h1:i40aqfkR1h2SlN9hojwV5ZA91wcXFOvkdNIeFDP5koI=
 
 github.com/gorilla/mux v1.8.0/go.mod h1:DVbg23sWSpFRCP0SfiEN6jmj59UnW/n46BH5rLB71So=
 
 github.com/gorilla/websocket v0.0.0-20170926233335-4201258b820c/go.mod h1:E7qHFY5m1UJ88s3WnNqhKjPHQ0heANvMoAMk2YaljkQ=
 
 github.com/gorilla/websocket v1.4.0/go.mod h1:E7qHFY5m1UJ88s3WnNqhKjPHQ0heANvMoAMk2YaljkQ=
 
 github.com/gorilla/websocket v1.4.2/go.mod h1:YR8l580nyteQvAITg2hZ9XVh4b55+EU/adAjf1fMHhE=
 
 github.com/gregjones/httpcache v0.0.0-20180305231024-9cad4c3443a7/go.mod h1:FecbI9+v66THATjSRHfNgh1IVFe/9kFxbXtjV0ctIMA=
 
-github.com/grpc-ecosystem/go-grpc-middleware v1.2.0 h1:0IKlLyQ3Hs9nDaiK5cSHAGmcQEIC8l2Ts1u6x5Dfrqg=
 
+github.com/grpc-ecosystem/go-grpc-middleware v1.0.0/go.mod h1:FiyG127CGDf3tlThmgyCl78X/SZQqEOJBCDaAfeWzPs=
 
+github.com/grpc-ecosystem/go-grpc-middleware v1.0.1-0.20190118093823-f849b5445de4/go.mod h1:FiyG127CGDf3tlThmgyCl78X/SZQqEOJBCDaAfeWzPs=
 
 github.com/grpc-ecosystem/go-grpc-middleware v1.2.0/go.mod h1:mJzapYve32yjrKlk9GbyCZHuPgZsrbyIbyKhSzOpg6s=
 
+github.com/grpc-ecosystem/go-grpc-middleware v1.3.0 h1:+9834+KizmvFV7pXQGSXQTsaWhq2GjuNUt0aUU0YBYw=
 
+github.com/grpc-ecosystem/go-grpc-middleware v1.3.0/go.mod h1:z0ButlSOZa5vEBq9m2m2hlwIgKw+rp3sdCBRoJY+30Y=
 
 github.com/grpc-ecosystem/go-grpc-prometheus v1.2.0 h1:Ovs26xHkKqVztRpIrF/92BcuyuQ/YW4NSIpoGtfXNho=
 
 github.com/grpc-ecosystem/go-grpc-prometheus v1.2.0/go.mod h1:8NvIoxWQoOIhqOTXgfV/d3M/q6VIi02HzZEHgUlZvzk=
 
 github.com/grpc-ecosystem/grpc-gateway v1.9.0/go.mod h1:vNeuVxBJEsws4ogUvrchl83t/GYV9WGTSLVdBhOQFDY=
 
@@ -283,6 +395,7 @@ github.com/hanwen/go-fuse v1.0.0/go.mod h1:unqXarDXqzAk0rt98O2tVndEPIpUgLD9+rwFi
 
 github.com/hanwen/go-fuse/v2 v2.1.0/go.mod h1:oRyA5eK+pvJyv5otpO/DgccS8y/RvYMaO00GgRLGryc=
 
 github.com/hashicorp/consul/api v1.1.0/go.mod h1:VmuI/Lkw1nC05EYQWNKwWGbkg+FbDBtguAZLlVdkD9Q=
 
 github.com/hashicorp/consul/sdk v0.1.1/go.mod h1:VKf9jXwCTEY1QZP2MOLRhb5i/I/ssyNV1vwHyQBF0x8=
 
+github.com/hashicorp/errwrap v0.0.0-20141028054710-7554cd9344ce/go.mod h1:YH+1FKiLXxHSkmPseP+kNlulaMuP3n2brvKWEqk/Jc4=
 
 github.com/hashicorp/errwrap v1.0.0 h1:hLrqtEDnRye3+sgx6z4qVLNuviH3MR5aQ0ykNJa/UYA=
 
 github.com/hashicorp/errwrap v1.0.0/go.mod h1:YH+1FKiLXxHSkmPseP+kNlulaMuP3n2brvKWEqk/Jc4=
 
 github.com/hashicorp/go-cleanhttp v0.5.1/go.mod h1:JpRdi6/HCYpAwUzNwuwqhbovhLtngrth3wmdIIUrZ80=
 
@@ -307,10 +420,12 @@ github.com/hashicorp/serf v0.7.1-0.20160317193612-598c54895cc5 h1:c0ibg28HTeX1LY
 
 github.com/hashicorp/serf v0.7.1-0.20160317193612-598c54895cc5/go.mod h1:h/Ru6tmZazX7WO/GDmwdpS975F019L4t5ng5IgwbNrE=
 
 github.com/hashicorp/uuid v0.0.0-20160311170451-ebb0a03e909c h1:nQcv325vxv2fFHJsOt53eSRf1eINt6vOdYUFfXs4rgk=
 
 github.com/hashicorp/uuid v0.0.0-20160311170451-ebb0a03e909c/go.mod h1:fHzc09UnyJyqyW+bFuq864eh+wC7dj65aXmXLRe5to0=
 
-github.com/hpcloud/tail v1.0.0 h1:nfCOvKYfkgYP8hkirhJocXT2+zOD8yUNjXaWfTlyFKI=
 
 github.com/hpcloud/tail v1.0.0/go.mod h1:ab1qPbhIpdTxEkNHXyeSf5vhxWSCs/tWer42PpOxQnU=
 
 github.com/ianlancetaylor/demangle v0.0.0-20181102032728-5e5cf60278f6/go.mod h1:aSSvb/t6k1mPoxDqO4vJh6VOCGPwU4O0C2/Eqndh1Sc=
 
 github.com/imdario/mergo v0.3.5/go.mod h1:2EnlNZ0deacrJVfApfmtdGgDfMuh/nq6Ok1EcJh5FfA=
 
+github.com/imdario/mergo v0.3.8/go.mod h1:2EnlNZ0deacrJVfApfmtdGgDfMuh/nq6Ok1EcJh5FfA=
 
+github.com/imdario/mergo v0.3.10/go.mod h1:jmQim1M+e3UYxmgPu/WyfjB3N3VflVyUjjjwH0dnCYA=
 
+github.com/imdario/mergo v0.3.11/go.mod h1:jmQim1M+e3UYxmgPu/WyfjB3N3VflVyUjjjwH0dnCYA=
 
 github.com/imdario/mergo v0.3.12 h1:b6R2BslTbIEToALKP7LxUvijTsNI9TAe80pLWN2g/HU=
 
 github.com/imdario/mergo v0.3.12/go.mod h1:jmQim1M+e3UYxmgPu/WyfjB3N3VflVyUjjjwH0dnCYA=
 
 github.com/inconshreveable/mousetrap v1.0.0 h1:Z8tu5sraLXCXIcARxBp/8cbvlwVa7Z1NHg9XEKhtSvM=
 
@@ -319,6 +434,8 @@ github.com/ishidawataru/sctp v0.0.0-20210226210310-f2269e66cdee h1:PAXLXk1heNZ5y
 
 github.com/ishidawataru/sctp v0.0.0-20210226210310-f2269e66cdee/go.mod h1:co9pwDoBCm1kGxawmb4sPq0cSIOOWNPT4KnHotMP1Zg=
 
 github.com/j-keck/arping v0.0.0-20160618110441-2cf9dc699c56/go.mod h1:ymszkNOg6tORTn+6F6j+Jc8TOr5osrynvN6ivFWZ2GA=
 
 github.com/jaguilar/vt100 v0.0.0-20150826170717-2703a27b14ea/go.mod h1:QMdK4dGB3YhEW2BmA1wgGpPYI3HZy/5gD705PXKUVSg=
 
+github.com/jmespath/go-jmespath v0.0.0-20160202185014-0b12d6b521d8/go.mod h1:Nht3zPeWKUH0NzdCt2Blrr5ys8VGpn0CEB0cQHVjt7k=
 
+github.com/jmespath/go-jmespath v0.0.0-20160803190731-bd40a432e4c7/go.mod h1:Nht3zPeWKUH0NzdCt2Blrr5ys8VGpn0CEB0cQHVjt7k=
 
 github.com/jmespath/go-jmespath v0.0.0-20180206201540-c2b33e8439af/go.mod h1:Nht3zPeWKUH0NzdCt2Blrr5ys8VGpn0CEB0cQHVjt7k=
 
 github.com/jmespath/go-jmespath v0.3.0 h1:OS12ieG61fsCg5+qLJ+SsW9NicxNkg3b25OyT2yCeUc=
 
 github.com/jmespath/go-jmespath v0.3.0/go.mod h1:9QtRXoHjLGCJ5IBSaohpXITPlowMeeYCZ7fLUTSywik=
 
@@ -335,8 +452,10 @@ github.com/kisielk/errcheck v1.1.0/go.mod h1:EZBBE59ingxPouuu3KfxchcWSUPOHkagtvW
 
 github.com/kisielk/errcheck v1.2.0/go.mod h1:/BMXB+zMLi60iA8Vv6Ksmxu/1UDYcXs4uQLJ+jE2L00=
 
 github.com/kisielk/errcheck v1.5.0/go.mod h1:pFxgyoBC7bSaBwPgfKdkLd5X25qrDl4LWUI2bnpBCr8=
 
 github.com/kisielk/gotool v1.0.0/go.mod h1:XhKaO+MFFWcvkIS/tQcRk01m1F5IRFswLeQ+oQHNcck=
 
-github.com/klauspost/compress v1.11.13 h1:eSvu8Tmq6j2psUJqJrLcWH6K3w5Dwc+qipbaA6eVEN4=
 
+github.com/klauspost/compress v1.11.3/go.mod h1:aoV0uJVorq1K+umq18yTdKaF57EivdYsUV+/s2qKfXs=
 
 github.com/klauspost/compress v1.11.13/go.mod h1:aoV0uJVorq1K+umq18yTdKaF57EivdYsUV+/s2qKfXs=
 
+github.com/klauspost/compress v1.12.3 h1:G5AfA94pHPysR56qqrkO2pxEexdDzrpFJ6yt/VqWxVU=
 
+github.com/klauspost/compress v1.12.3/go.mod h1:8dP1Hq4DHOhN9w426knH3Rhby4rFm6D8eO+e+Dq5Gzg=
 
 github.com/konsorten/go-windows-terminal-sequences v1.0.1/go.mod h1:T0+1ngSBFLxvqU3pZ+m/2kptfBszLMUkC4ZK/EgS/cQ=
 
 github.com/konsorten/go-windows-terminal-sequences v1.0.2/go.mod h1:T0+1ngSBFLxvqU3pZ+m/2kptfBszLMUkC4ZK/EgS/cQ=
 
 github.com/konsorten/go-windows-terminal-sequences v1.0.3/go.mod h1:T0+1ngSBFLxvqU3pZ+m/2kptfBszLMUkC4ZK/EgS/cQ=
 
@@ -355,6 +474,7 @@ github.com/magiconair/properties v1.8.1/go.mod h1:PppfXfuXeibc/6YijjN8zIbojt8czP
 
 github.com/mailru/easyjson v0.0.0-20190614124828-94de47d64c63/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=
 
 github.com/mailru/easyjson v0.0.0-20190626092158-b2ccc519800e/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=
 
 github.com/mailru/easyjson v0.7.0/go.mod h1:KAzv3t3aY1NaHWoQz1+4F1ccyAH66Jk7yos7ldAVICs=
 
+github.com/marstr/guid v1.1.0/go.mod h1:74gB1z2wpxxInTG6yaqA7KrtM0NZ+RbrcqDvYHefzho=
 
 github.com/mattn/go-colorable v0.0.9/go.mod h1:9vuHe8Xs5qXnSaW/c/ABM9alt+Vo+STaOChaDxuIBZU=
 
 github.com/mattn/go-isatty v0.0.3/go.mod h1:M+lRXTBqGeGNdLjl/ufCoiOlB5xdOkqRJdNxMWT7Zi4=
 
 github.com/mattn/go-isatty v0.0.4/go.mod h1:M+lRXTBqGeGNdLjl/ufCoiOlB5xdOkqRJdNxMWT7Zi4=
 
@@ -376,6 +496,7 @@ github.com/mitchellh/go-wordwrap v1.0.0/go.mod h1:ZXFpozHsX6DPmq2I0TCekCxypsnAUb
 
 github.com/mitchellh/hashstructure v1.0.0 h1:ZkRJX1CyOoTkar7p/mLS5TZU4nJ1Rn/F8u9dGS02Q3Y=
 
 github.com/mitchellh/hashstructure v1.0.0/go.mod h1:QjSHrPWS+BGUVBYkbTZWEnOh3G1DutKwClXU/ABz6AQ=
 
 github.com/mitchellh/mapstructure v1.1.2/go.mod h1:FVVH3fgwuzCH5S8UJGiWEs2h04kUh9fWfEaFds41c1Y=
 
+github.com/mitchellh/osext v0.0.0-20151018003038-5e2d6d41470f/go.mod h1:OkQIRizQZAeMln+1tSwduZz7+Af5oFlKirV/MSYes2A=
 
 github.com/moby/buildkit v0.8.2-0.20210615162540-9f254e18360a h1:1KdH8CRFygJ8oj8l8wD2TUy3hGaGUzXO2h6gyQKg780=
 
 github.com/moby/buildkit v0.8.2-0.20210615162540-9f254e18360a/go.mod h1:OieevFziOisPBM43fLKG+lPcVp9XW+BlUiws8VIpG6k=
 
 github.com/moby/ipvs v1.0.1 h1:aoZ7fhLTXgDbzVrAnvV+XbKOU8kOET7B3+xULDF/1o0=
 
@@ -409,24 +530,51 @@ github.com/munnerz/goautoneg v0.0.0-20120707110453-a547fc61f48d/go.mod h1:+n7T8m
 
 github.com/munnerz/goautoneg v0.0.0-20191010083416-a7dc8b61c822/go.mod h1:+n7T8mK8HuQTcFwEeznm/DIxMOiR9yIdICNftLE1DvQ=
 
 github.com/mwitkow/go-conntrack v0.0.0-20161129095857-cc309e4a2223/go.mod h1:qRWi+5nqEBWmkhHvq77mSJWrCKwh8bxhgT7d/eI7P4U=
 
 github.com/mxk/go-flowrate v0.0.0-20140419014527-cca7078d478f/go.mod h1:ZdcZmHo+o7JKHSa8/e818NopupXU1YMK5fe1lsApnBw=
 
+github.com/ncw/swift v1.0.47/go.mod h1:23YIA4yWVnGwv2dQlN4bB7egfYX6YLn0Yo/S6zZO/ZM=
 
+github.com/nxadm/tail v1.4.4 h1:DQuhQpB1tVlglWS2hLQ5OV6B5r8aGxSrPc5Qo6uTN78=
 
+github.com/nxadm/tail v1.4.4/go.mod h1:kenIhsEOeOJmVchQTgglprH7qJGnHDVpk1VPCcaMI8A=
 
 github.com/olekukonko/tablewriter v0.0.0-20170122224234-a0225b3f23b5/go.mod h1:vsDQFd/mU46D+Z4whnwzcISnGGzXWMclvtLoiIKAKIo=
 
-github.com/onsi/ginkgo v1.8.0 h1:VkHVNpR4iVnU8XQR6DBm8BqYjN7CRzw+xKUbVVbbW9w=
 
-github.com/onsi/ginkgo v1.8.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
-github.com/onsi/gomega v1.5.0 h1:izbySO9zDPmjJ8rDjLvkA2zJHIo+HkYXHnf7eN7SSyo=
 
-github.com/onsi/gomega v1.5.0/go.mod h1:ex+gbHU/CVuBBDIJjb2X0qEXbFg53c61hWP/1CpauHY=
 
+github.com/onsi/ginkgo v0.0.0-20151202141238-7f8ab55aaf3b/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
+github.com/onsi/ginkgo v0.0.0-20170829012221-11459a886d9c/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
+github.com/onsi/ginkgo v1.6.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
+github.com/onsi/ginkgo v1.10.1/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
+github.com/onsi/ginkgo v1.10.3/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
+github.com/onsi/ginkgo v1.11.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=
 
+github.com/onsi/ginkgo v1.12.1 h1:mFwc4LvZ0xpSvDZ3E+k8Yte0hLOMxXUlP+yXtJqkYfQ=
 
+github.com/onsi/ginkgo v1.12.1/go.mod h1:zj2OWP4+oCPe1qIXoGWkgMRwljMUYCdkwsT2108oapk=
 
+github.com/onsi/gomega v0.0.0-20151007035656-2152b45fa28a/go.mod h1:C1qb7wdrVGGVU+Z6iS04AVkA3Q65CEZX59MT0QO5uiA=
 
+github.com/onsi/gomega v0.0.0-20170829124025-dcabb60a477c/go.mod h1:C1qb7wdrVGGVU+Z6iS04AVkA3Q65CEZX59MT0QO5uiA=
 
+github.com/onsi/gomega v1.7.0/go.mod h1:ex+gbHU/CVuBBDIJjb2X0qEXbFg53c61hWP/1CpauHY=
 
+github.com/onsi/gomega v1.7.1/go.mod h1:XdKZgCCFLUoM/7CFJVPcG8C1xQ1AJ0vpAezJrB7JYyY=
 
+github.com/onsi/gomega v1.10.3 h1:gph6h/qe9GSUw1NhH1gp+qb+h8rXD8Cy60Z32Qw3ELA=
 
+github.com/onsi/gomega v1.10.3/go.mod h1:V9xEwhxec5O8UDM77eCW8vLymOMltsqPVYWrpDsH8xc=
 
+github.com/opencontainers/go-digest v0.0.0-20170106003457-a6d0ee40d420/go.mod h1:cMLVZDEM3+U2I4VmLI6N8jQYUd2OVphdqWwCJHrFt2s=
 
+github.com/opencontainers/go-digest v0.0.0-20180430190053-c9281466c8b2/go.mod h1:cMLVZDEM3+U2I4VmLI6N8jQYUd2OVphdqWwCJHrFt2s=
 
+github.com/opencontainers/go-digest v1.0.0-rc1/go.mod h1:cMLVZDEM3+U2I4VmLI6N8jQYUd2OVphdqWwCJHrFt2s=
 
+github.com/opencontainers/go-digest v1.0.0-rc1.0.20180430190053-c9281466c8b2/go.mod h1:cMLVZDEM3+U2I4VmLI6N8jQYUd2OVphdqWwCJHrFt2s=
 
 github.com/opencontainers/go-digest v1.0.0 h1:apOUWs51W5PlhuyGyz9FCeeBIOUDA/6nW8Oi/yOhh5U=
 
 github.com/opencontainers/go-digest v1.0.0/go.mod h1:0JzlMkj0TRzQZfJkVvzbP0HBR3IKzErnv2BNG4W4MAM=
 
+github.com/opencontainers/image-spec v1.0.0/go.mod h1:BtxoFyWECRxE4U/7sNtV5W15zMzWCbyJoFRP3s7yZA0=
 
 github.com/opencontainers/image-spec v1.0.1/go.mod h1:BtxoFyWECRxE4U/7sNtV5W15zMzWCbyJoFRP3s7yZA0=
 
 github.com/opencontainers/image-spec v1.0.2 h1:9yCKha/T5XdGtO0q9Q9a6T5NUCsTn/DrBg0D7ufOcFM=
 
 github.com/opencontainers/image-spec v1.0.2/go.mod h1:BtxoFyWECRxE4U/7sNtV5W15zMzWCbyJoFRP3s7yZA0=
 
+github.com/opencontainers/runc v0.0.0-20190115041553-12f6a991201f/go.mod h1:qT5XzbpPznkRYVz/mWwUaVBUv2rmF59PVA73FjuZG0U=
 
+github.com/opencontainers/runc v0.1.1/go.mod h1:qT5XzbpPznkRYVz/mWwUaVBUv2rmF59PVA73FjuZG0U=
 
+github.com/opencontainers/runc v1.0.0-rc8.0.20190926000215-3e425f80a8c9/go.mod h1:qT5XzbpPznkRYVz/mWwUaVBUv2rmF59PVA73FjuZG0U=
 
+github.com/opencontainers/runc v1.0.0-rc9/go.mod h1:qT5XzbpPznkRYVz/mWwUaVBUv2rmF59PVA73FjuZG0U=
 
 github.com/opencontainers/runc v1.0.0-rc93/go.mod h1:3NOsor4w32B2tC0Zbl8Knk4Wg84SM2ImC1fxBuqJ/H0=
 
 github.com/opencontainers/runc v1.0.2/go.mod h1:aTaHFFwQXuA71CiyxOdFFIorAoemI04suvGRQFzWTD0=
 
 github.com/opencontainers/runc v1.1.0 h1:O9+X96OcDjkmmZyfaG996kV7yq8HsoU2h1XRRQcefG8=
 
 github.com/opencontainers/runc v1.1.0/go.mod h1:Tj1hFw6eFWp/o33uxGf5yF2BX5yz2Z6iptFpuvbbKqc=
 
+github.com/opencontainers/runtime-spec v0.1.2-0.20190507144316-5b71a03e2700/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
 
+github.com/opencontainers/runtime-spec v1.0.1/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
 
+github.com/opencontainers/runtime-spec v1.0.2-0.20190207185410-29686dbc5559/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
 
 github.com/opencontainers/runtime-spec v1.0.2/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
 
 github.com/opencontainers/runtime-spec v1.0.3-0.20200929063507-e6143ca7d51d/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
 
 github.com/opencontainers/runtime-spec v1.0.3-0.20210326190908-1c3f411f0417 h1:3snG66yBm59tKhhSPQrQ/0bCrv1LQbKt40LnUPiUxdc=
 
 github.com/opencontainers/runtime-spec v1.0.3-0.20210326190908-1c3f411f0417/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
 
+github.com/opencontainers/runtime-tools v0.0.0-20181011054405-1d69bd0f9c39/go.mod h1:r3f7wjNzSs2extwzU3Y+6pKfobzPh+kKFJ3ofN+3nfs=
 
+github.com/opencontainers/selinux v1.6.0/go.mod h1:VVGKuOLlE7v4PJyT6h7mNWvq1rzqiriPsEqVhc+svHE=
 
 github.com/opencontainers/selinux v1.8.0/go.mod h1:RScLhm78qiWa2gbVCcGkC7tCGdgk3ogry1nUQF8Evvo=
 
 github.com/opencontainers/selinux v1.8.2/go.mod h1:MUIHuUEvKB1wtJjQdOyYRgOnLD2xAPP8dBsCoU0KuF8=
 
 github.com/opencontainers/selinux v1.10.0 h1:rAiKF8hTcgLI3w0DHm6i0ylVVcOrlgR1kK99DRLDhyU=
 
@@ -437,13 +585,16 @@ github.com/opentracing/opentracing-go v1.1.0/go.mod h1:UkNAQd3GIcIGf0SeVgPpRdFSt
 
 github.com/opentracing/opentracing-go v1.2.0 h1:uEJPy/1a5RIPAJ0Ov+OIO8OxWu77jEv+1B0VhjKrZUs=
 
 github.com/opentracing/opentracing-go v1.2.0/go.mod h1:GxEUsuufX4nBwe+T+Wl9TAgYrxe9dPLANfrWvHYVTgc=
 
 github.com/pascaldekloe/goe v0.0.0-20180627143212-57f6aae5913c/go.mod h1:lzWF7FIEvWOWxwDKqyGYQf6ZUaNfKdP144TG7ZOy1lc=
 
-github.com/pelletier/go-toml v1.8.1 h1:1Nf83orprkJyknT6h7zbuEGUEjcyVlCxSUGTENmNCRM=
 
+github.com/pelletier/go-toml v1.2.0/go.mod h1:5z9KED0ma1S8pY6P1sdut58dfprrGBbd/94hg7ilaic=
 
 github.com/pelletier/go-toml v1.8.1/go.mod h1:T2/BmBdy8dvIRq1a/8aqjN41wvWlN4lrapLU/GW4pbc=
 
+github.com/pelletier/go-toml v1.9.1 h1:a6qW1EVNZWH9WGI6CsYdD8WAylkoXBS5yv0XHlh17Tc=
 
+github.com/pelletier/go-toml v1.9.1/go.mod h1:u1nR/EPcESfeI/szUZKdtJ0xRNbUoANCkoOuaOx1Y+c=
 
 github.com/peterbourgon/diskv v2.0.1+incompatible/go.mod h1:uqqh8zWWbv1HBMNONnaR/tNboyR3/BZd58JJSHlUSCU=
 
 github.com/phayes/permbits v0.0.0-20190612203442-39d7c581d2ee h1:P6U24L02WMfj9ymZTxl7CxS73JC99x3ukk+DBkgQGQs=
 
 github.com/phayes/permbits v0.0.0-20190612203442-39d7c581d2ee/go.mod h1:3uODdxMgOaPYeWU7RzZLxVtJHZ/x1f/iHkBZuKJDzuY=
 
 github.com/philhofer/fwd v1.0.0 h1:UbZqGr5Y38ApvM/V/jEljVxwocdweyH+vmYvRPBnbqQ=
 
 github.com/philhofer/fwd v1.0.0/go.mod h1:gk3iGcWd9+svBvR0sR+KPcfE+RNWozjowpeBVG3ZVNU=
 
+github.com/pkg/errors v0.8.1-0.20171018195549-f15c970de5b7/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0=
 
 github.com/pkg/errors v0.8.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0=
 
 github.com/pkg/errors v0.9.1 h1:FEBLx1zS214owpjy7qsBeixbURkuhQAwrK5UwLGTwt4=
 
 github.com/pkg/errors v0.9.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0=
 
@@ -454,11 +605,14 @@ github.com/posener/complete v1.1.1/go.mod h1:em0nMJCgc9GFtwrmVmEMR/ZL6WyhyjMBndr
 
 github.com/pquerna/cachecontrol v0.0.0-20171018203845-0dec1b30a021/go.mod h1:prYjPmNq4d1NPVmpShWobRqXY3q7Vp+80DqgxxUrUIA=
 
 github.com/prometheus/client_golang v1.6.0 h1:YVPodQOcK15POxhgARIvnDRVpLcuK8mglnMrWfyrw6A=
 
 github.com/prometheus/client_golang v1.6.0/go.mod h1:ZLOG9ck3JLRdB5MgO8f+lLTe83AXG6ro35rLTxvnIl4=
 
+github.com/prometheus/client_model v0.0.0-20171117100541-99fa1f4be8e5/go.mod h1:MbSGuTsp3dbXC40dX6PRTWyKYBIrTGTE9sqQNg2J8bo=
 
 github.com/prometheus/client_model v0.0.0-20190812154241-14fe0d1b01d4/go.mod h1:xMI15A0UPsDsEKsMN9yxemIoYk6Tm2C1GtYGdfGttqA=
 
 github.com/prometheus/client_model v0.2.0 h1:uq5h0d+GuxiXLJLNABMgp2qUWDPiLvgCzz2dUR+/W/M=
 
 github.com/prometheus/client_model v0.2.0/go.mod h1:xMI15A0UPsDsEKsMN9yxemIoYk6Tm2C1GtYGdfGttqA=
 
-github.com/prometheus/common v0.9.1 h1:KOMtN28tlbam3/7ZKEYKHhKoJZYYj3gMH4uc62x7X7U=
 
+github.com/prometheus/common v0.0.0-20180110214958-89604d197083/go.mod h1:daVV7qP5qjZbuso7PdcryaAu0sAZbrN9i7WWcTMWvro=
 
 github.com/prometheus/common v0.9.1/go.mod h1:yhUN8i9wzaXS3w1O07YhxHEBxD+W35wd8bs7vj7HSQ4=
 
+github.com/prometheus/common v0.10.0 h1:RyRA7RzGXQZiW+tGMr7sxa85G1z0yOpM1qq5c8lNawc=
 
+github.com/prometheus/common v0.10.0/go.mod h1:Tlit/dnDKsSWFlCLTWaA1cyBgKHSMdTB80sz/V91rCo=
 
 github.com/prometheus/procfs v0.0.11 h1:DhHlBtkHWPYi8O2y31JkK0TF+DGM+51OopZjH/Ia5qI=
 
 github.com/prometheus/procfs v0.0.11/go.mod h1:lV6e/gmhEcM9IjHGsFOCxxuZ+z1YqCvr4OA4YeYWdaU=
 
 github.com/rogpeppe/fastuuid v0.0.0-20150106093220-6724a57986af/go.mod h1:XWv6SoW27p1b0cqNHllgS5HIMJraePCO15w5zCzIWYg=
 
@@ -473,13 +627,16 @@ github.com/seccomp/libseccomp-golang v0.9.1/go.mod h1:GbW5+tmTXfcxTToHLXlScSlAvW
 
 github.com/seccomp/libseccomp-golang v0.9.2-0.20210429002308-3879420cc921/go.mod h1:JA8cRccbGaA1s33RQf7Y1+q9gHmZX1yB/z9WDN1C6fg=
 
 github.com/serialx/hashring v0.0.0-20190422032157-8b2912629002/go.mod h1:/yeG0My1xr/u+HZrFQ1tOQQQQrOawfyMUH13ai5brBc=
 
 github.com/shurcooL/sanitized_anchor_name v1.0.0/go.mod h1:1NzhyTcUVG4SuEtjjoZeVRXNmyL/1OwPU0+IJeTBvfc=
 
+github.com/sirupsen/logrus v1.0.4-0.20170822132746-89742aefa4b2/go.mod h1:pMByvHTf9Beacp5x1UXfOR9xyW/9antXMhjMPG0dEzc=
 
 github.com/sirupsen/logrus v1.0.6/go.mod h1:pMByvHTf9Beacp5x1UXfOR9xyW/9antXMhjMPG0dEzc=
 
+github.com/sirupsen/logrus v1.4.1/go.mod h1:ni0Sbl8bgC9z8RoU9G6nDWqqs/fq4eDPysMBDgk/93Q=
 
 github.com/sirupsen/logrus v1.4.2/go.mod h1:tLMulIdttU9McNUspp0xgXVQah82FyeX6MwdIuYE2rE=
 
 github.com/sirupsen/logrus v1.6.0/go.mod h1:7uNnSEd1DgxDLC74fIahvMZmmYsHGZGEOFrfsX/uA88=
 
 github.com/sirupsen/logrus v1.7.0/go.mod h1:yWOB1SBYBC5VeMP7gHvWumXLIWorT60ONWic61uBYv0=
 
 github.com/sirupsen/logrus v1.8.1 h1:dJKuHgqk1NNQlqoA6BTlM1Wf9DOH3NBjQyu0h9+AZZE=
 
 github.com/sirupsen/logrus v1.8.1/go.mod h1:yWOB1SBYBC5VeMP7gHvWumXLIWorT60ONWic61uBYv0=
 
 github.com/smartystreets/assertions v0.0.0-20180927180507-b2de0cb4f26d/go.mod h1:OnSkiWE9lh6wB0YB77sQom3nweQdgAjqCqsofrRNTgc=
 
+github.com/smartystreets/goconvey v0.0.0-20190330032615-68dc04aab96a/go.mod h1:syvi0/a8iFYH4r/RixwvyeAJjdLS9QV7WQ/tjFTllLA=
 
 github.com/smartystreets/goconvey v1.6.4/go.mod h1:syvi0/a8iFYH4r/RixwvyeAJjdLS9QV7WQ/tjFTllLA=
 
 github.com/soheilhy/cmux v0.1.4/go.mod h1:IM3LyeVVIOuxMH7sFAkER9+bJ4dT7Ms6E4xg4kGIyLM=
 
 github.com/spf13/afero v1.1.2/go.mod h1:j4pytiNVoe2o6bmDsKpLACNPDBIoEAkihy7loJ1B0CQ=
 
@@ -500,12 +657,21 @@ github.com/spf13/pflag v1.0.5/go.mod h1:McXfInJRrz4CZXVZOBLb0bTZqETkiAhM9Iw0y3An
 
 github.com/spf13/viper v1.4.0/go.mod h1:PTJ7Z/lr49W6bUbkmS1V3by4uWynFiR9p7+dSq/yZzE=
 
 github.com/spf13/viper v1.7.0/go.mod h1:8WkrPz2fc9jxqZNCJI/76HCieCp4Q8HaLFoCha5qpdg=
 
 github.com/stefanberger/go-pkcs11uri v0.0.0-20201008174630-78d3cae3a980/go.mod h1:AO3tvPzVZ/ayst6UlUKUv6rcPQInYe3IknH3jYhAKu8=
 
+github.com/stretchr/objx v0.0.0-20180129172003-8a3f7159479f/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
 
 github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
 
 github.com/stretchr/objx v0.1.1/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
 
 github.com/stretchr/objx v0.2.0/go.mod h1:qt09Ya8vawLte6SNmTgCsAVtYtaKzEcn8ATUoHMkEqE=
 
-github.com/stretchr/testify v1.3.0 h1:TivCn/peBQ7UY8ooIcPgZFpTNSz0Q2U6UrFlUfqbe0Q=
 
+github.com/stretchr/testify v0.0.0-20180303142811-b89eecf5ca5d/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=
 
+github.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs=
 
 github.com/stretchr/testify v1.3.0/go.mod h1:M5WIy9Dh21IEIfnGCwXGc5bZfKNJtfHm1UVUgZn+9EI=
 
+github.com/stretchr/testify v1.4.0/go.mod h1:j7eGeouHqKxXV5pUuKE4zz7dFj8WfuZ+81PSLYec5m4=
 
+github.com/stretchr/testify v1.5.1/go.mod h1:5W2xD1RspED5o8YsWQXVCued0rvSQ+mT+I5cxcmMvtA=
 
+github.com/stretchr/testify v1.6.1/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
 
+github.com/stretchr/testify v1.7.0 h1:nwc3DEeHmmLAfoZucVR881uASk0Mfjw8xYJ99tb5CcY=
 
+github.com/stretchr/testify v1.7.0/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
 
 github.com/subosito/gotenv v1.2.0/go.mod h1:N0PQaV/YGNqwC0u51sEeR/aUtSLEXKX9iv69rRypqCw=
 
+github.com/syndtr/gocapability v0.0.0-20170704070218-db04d3cc01c8/go.mod h1:hkRG7XYTFWNJGYcbNJQlaLq0fg1yr4J4t/NcTQtrfww=
 
+github.com/syndtr/gocapability v0.0.0-20180916011248-d98352740cb2/go.mod h1:hkRG7XYTFWNJGYcbNJQlaLq0fg1yr4J4t/NcTQtrfww=
 
 github.com/syndtr/gocapability v0.0.0-20200815063812-42c35b437635/go.mod h1:hkRG7XYTFWNJGYcbNJQlaLq0fg1yr4J4t/NcTQtrfww=
 
 github.com/tchap/go-patricia v2.2.6+incompatible/go.mod h1:bmLyhP68RS6kStMGxByiQ23RP/odRBOTVjwp2cDyi6I=
 
 github.com/tchap/go-patricia v2.3.0+incompatible h1:GkY4dP3cEfEASBPPkWd+AmjYxhmDkqO9/zg7R0lSQRs=
 
@@ -523,6 +689,7 @@ github.com/tonistiigi/units v0.0.0-20180711220420-6950e57a87ea/go.mod h1:WPnis/6
 
 github.com/uber/jaeger-client-go v2.25.0+incompatible/go.mod h1:WVhlPFC8FDjOFMMWRy2pZqQJSXxYSwNYOkTr/Z6d3Kk=
 
 github.com/uber/jaeger-lib v2.2.0+incompatible/go.mod h1:ComeNDZlWwrWnDv8aPp0Ba6+uUTzImX/AauajbLI56U=
 
 github.com/ugorji/go v1.1.4/go.mod h1:uQMGLiO92mf5W77hV/PUCpI3pbzQx3CRekS0kk+RGrc=
 
+github.com/urfave/cli v0.0.0-20171014202726-7bc6a0acffa5/go.mod h1:70zkFmudgCuE/ngEzBv17Jvp/497gISqfk5gWijbERA=
 
 github.com/urfave/cli v1.20.0/go.mod h1:70zkFmudgCuE/ngEzBv17Jvp/497gISqfk5gWijbERA=
 
 github.com/urfave/cli v1.22.1/go.mod h1:Gos4lmkARVdJ6EkW0WaNv/tZAAMe9V7XWyB60NtXRu0=
 
 github.com/urfave/cli v1.22.2/go.mod h1:Gos4lmkARVdJ6EkW0WaNv/tZAAMe9V7XWyB60NtXRu0=
 
@@ -531,18 +698,29 @@ github.com/vbatts/tar-split v0.11.2 h1:Via6XqJr0hceW4wff3QRzD5gAk/tatMw/4ZA7cTlI
 
 github.com/vbatts/tar-split v0.11.2/go.mod h1:vV3ZuO2yWSVsz+pfFzDG/upWH1JhjOiEaWq6kXyQ3VI=
 
 github.com/vishvananda/netlink v1.1.0 h1:1iyaYNBLmP6L0220aDnYQpo1QEV4t4hJ+xEEhhJH8j0=
 
 github.com/vishvananda/netlink v1.1.0/go.mod h1:cTgwzPIzzgDAYoQrMm0EdrjRUBkTqKYppBueQtXaqoE=
 
+github.com/vishvananda/netns v0.0.0-20180720170159-13995c7128cc/go.mod h1:ZjcWmFBXmLKZu9Nxj3WKYEafiSqer2rnvPr0en9UNpI=
 
 github.com/vishvananda/netns v0.0.0-20191106174202-0a2b9b5464df/go.mod h1:JP3t17pCcGlemwknint6hfoeCVQrEMVwxRLRjXpq+BU=
 
 github.com/vishvananda/netns v0.0.0-20200728191858-db3c7e526aae h1:4hwBBUfQCFe3Cym0ZtKyq7L16eZUtYKs+BaHDN6mAns=
 
 github.com/vishvananda/netns v0.0.0-20200728191858-db3c7e526aae/go.mod h1:DD4vA1DwXk04H54A1oHXtwZmA0grkVMdPxx/VGLCah0=
 
 github.com/vmihailenco/msgpack v4.0.4+incompatible h1:dSLoQfGFAo3F6OoNhwUmLwVgaUXK79GlxNBwueZn0xI=
 
 github.com/vmihailenco/msgpack v4.0.4+incompatible/go.mod h1:fy3FlTQTDXWkZ7Bh6AcGMlsjHatGryHQYUTf1ShIgkk=
 
+github.com/willf/bitset v1.1.11-0.20200630133818-d5bec3311243/go.mod h1:RjeCKbqT1RxIR/KWY6phxZiaY1IyutSBfGjNPySAYV4=
 
 github.com/willf/bitset v1.1.11/go.mod h1:83CECat5yLh5zVOf4P1ErAgKA5UDvKtgyUABdr3+MjI=
 
+github.com/xeipuuv/gojsonpointer v0.0.0-20180127040702-4e3ac2762d5f/go.mod h1:N2zxlSyiKSe5eX1tZViRH5QA0qijqEDrYZiPEAiq3wU=
 
+github.com/xeipuuv/gojsonreference v0.0.0-20180127040603-bd5ef7bd5415/go.mod h1:GwrjFmJcFw6At/Gs6z4yjiIwzuJ1/+UwLxMQDVQXShQ=
 
+github.com/xeipuuv/gojsonschema v0.0.0-20180618132009-1d523034197f/go.mod h1:5yf86TLmAcydyeJq5YvxkGPE2fm/u4myDekKRoLuqhs=
 
 github.com/xiang90/probing v0.0.0-20190116061207-43a291ad63a2/go.mod h1:UETIi67q53MR2AWcXfiuqkDkRtnGDLqkBTpCHuJHxtU=
 
 github.com/xordataexchange/crypt v0.0.3-0.20170626215501-b2862e3d0a77/go.mod h1:aYKd//L2LvnjZzWKhF00oedf4jCCReLcmhLdhm1A27Q=
 
 github.com/yuin/goldmark v1.1.27/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74=
 
 github.com/yuin/goldmark v1.2.1/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74=
 
-go.etcd.io/bbolt v1.3.5 h1:XAzx9gjCb0Rxj7EoqcClPD1d5ZBxZJk0jbuoPHenBt0=
 
+github.com/yvasiyarov/go-metrics v0.0.0-20140926110328-57bccd1ccd43/go.mod h1:aX5oPXxHm3bOH+xeAttToC8pqch2ScQN/JoXYupl6xs=
 
+github.com/yvasiyarov/gorelic v0.0.0-20141212073537-a9bba5b9ab50/go.mod h1:NUSPSUX/bi6SeDMUh6brw0nXpxHnc96TguQh0+r/ssA=
 
+github.com/yvasiyarov/newrelic_platform_go v0.0.0-20140908184405-b21fdbd4370f/go.mod h1:GlGEuHIJweS1mbCqG+7vt2nvWLzLLnRHbXz5JKd/Qbg=
 
+go.etcd.io/bbolt v1.3.2/go.mod h1:IbVyRI1SCnLcuJnV2u8VeU0CEYM7e686BmAb1XKL+uU=
 
+go.etcd.io/bbolt v1.3.3/go.mod h1:IbVyRI1SCnLcuJnV2u8VeU0CEYM7e686BmAb1XKL+uU=
 
 go.etcd.io/bbolt v1.3.5/go.mod h1:G5EMThwa9y8QZGBClrRx5EY+Yw9kAhnjy3bSjsnlVTQ=
 
+go.etcd.io/bbolt v1.3.6 h1:/ecaJf0sk1l4l6V4awd65v2C3ILy7MSj+s/x1ADCIMU=
 
+go.etcd.io/bbolt v1.3.6/go.mod h1:qXsaaIqmgQH0T+OPdb99Bf+PKfBBQVAdyD6TY9G8XM4=
 
 go.etcd.io/etcd v0.5.0-alpha.5.0.20200910180754-dd1b699fc489/go.mod h1:yVHk9ub3CSBatqGNg7GRmsnfLWtoW60w4eDYfh7vHDg=
 
 go.mozilla.org/pkcs7 v0.0.0-20200128120323-432b2356ecb1/go.mod h1:SNgMg+EgDFwmvSmLRTNKC5fegJjB7v23qTQ0XLGUNHk=
 
 go.opencensus.io v0.22.3 h1:8sGtKOrtQqkN1bp2AtX+misvLIlOmsEsNd+9NIcPEm8=
 
@@ -551,13 +729,17 @@ go.uber.org/atomic v1.3.2/go.mod h1:gD2HeocX3+yG+ygLZcrzQJaqmWj9AIm7n08wl/qW/PE=
 
 go.uber.org/atomic v1.4.0/go.mod h1:gD2HeocX3+yG+ygLZcrzQJaqmWj9AIm7n08wl/qW/PE=
 
 go.uber.org/multierr v1.1.0/go.mod h1:wR5kodmAFQ0UK8QlbwjlSNy0Z68gJhDJUG5sjR94q/0=
 
 go.uber.org/zap v1.10.0/go.mod h1:vwi/ZaCAaUcBkycHslxD9B2zi4UTXhF60s6SWpuDF0Q=
 
+golang.org/x/crypto v0.0.0-20171113213409-9f005a07e0d3/go.mod h1:6SG95UA2DQfeDnfUPMdvaQW0Q7yPrPDi9nlGo2tz2b4=
 
+golang.org/x/crypto v0.0.0-20181009213950-7c1a557ab941/go.mod h1:6SG95UA2DQfeDnfUPMdvaQW0Q7yPrPDi9nlGo2tz2b4=
 
 golang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=
 
 golang.org/x/crypto v0.0.0-20190510104115-cbcb75029529/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=
 
 golang.org/x/crypto v0.0.0-20190605123033-f99c8df09eb5/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=
 
 golang.org/x/crypto v0.0.0-20190611184440-5c40567a22f8/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=
 
+golang.org/x/crypto v0.0.0-20190701094942-4def268fd1a4/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=
 
 golang.org/x/crypto v0.0.0-20190923035154-9ee001bba392/go.mod h1:/lpIB1dKB+9EgE3H3cr1v9wB50oz8l4C4h62xy7jSTY=
 
 golang.org/x/crypto v0.0.0-20191011191535-87dc89f01550/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=
 
 golang.org/x/crypto v0.0.0-20200622213623-75b288015ac9/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto=
 
+golang.org/x/crypto v0.0.0-20200728195943-123391ffb6de/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto=
 
 golang.org/x/crypto v0.0.0-20201002170205-7f63de1d35b0/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto=
 
 golang.org/x/crypto v0.0.0-20210322153248-0c34fe9e7dc2/go.mod h1:T9bdIzuCu7OtxOm1hfPfRQxPLYneinmdGuTeoZ9dtd4=
 
 golang.org/x/crypto v0.0.0-20211202192323-5770296d904e h1:MUP6MR3rJ7Gk9LEia0LP2ytiH6MuCfs7qYz+47jGdD8=
 
@@ -581,21 +763,52 @@ golang.org/x/mod v0.2.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA=
 
 golang.org/x/mod v0.3.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA=
 
 golang.org/x/mod v0.4.1 h1:Kvvh58BN8Y9/lBi7hTekvtMpm07eUZ0ck5pRHpsMWrY=
 
 golang.org/x/mod v0.4.1/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA=
 
-golang.org/x/net v0.0.0-20210226172049-e18ecbb05110 h1:qWPm9rbaAMKs8Bq/9LRpbMqxWRVUAQwMI9fVrssnTfw=
 
+golang.org/x/net v0.0.0-20180724234803-3673e40ba225/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
 
+golang.org/x/net v0.0.0-20180906233101-161cd47e91fd/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
 
+golang.org/x/net v0.0.0-20181011144130-49bb7cea24b1/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
 
+golang.org/x/net v0.0.0-20181220203305-927f97764cc3/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
 
+golang.org/x/net v0.0.0-20190108225652-1e06a53dbb7e/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
 
+golang.org/x/net v0.0.0-20190311183353-d8887717615a/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=
 
+golang.org/x/net v0.0.0-20190404232315-eb5bcb51f2a3/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=
 
+golang.org/x/net v0.0.0-20190503192946-f4e77d36d62c/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=
 
+golang.org/x/net v0.0.0-20190522155817-f3200d17e092/go.mod h1:HSz+uSET+XFnRR8LxR5pz3Of3rY3CfYBVs4xY44aLks=
 
+golang.org/x/net v0.0.0-20190603091049-60506f45cf65/go.mod h1:HSz+uSET+XFnRR8LxR5pz3Of3rY3CfYBVs4xY44aLks=
 
+golang.org/x/net v0.0.0-20190613194153-d28f0bde5980/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20190619014844-b5b0513f8c1b/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20190813141303-74dc4d7220e7/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20190827160401-ba9fcec4b297/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20190923162816-aa69164e4478/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20191004110552-13f9640d40b9/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20200202094626-16171245cfb2/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20200226121028-0de0cce0169b/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=
 
+golang.org/x/net v0.0.0-20200324143707-d3edc9973b7e/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A=
 
+golang.org/x/net v0.0.0-20200506145744-7e3656a0809f/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A=
 
+golang.org/x/net v0.0.0-20200520182314-0ba52f642ac2/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A=
 
+golang.org/x/net v0.0.0-20200707034311-ab3426394381/go.mod h1:/O7V0waA8r7cgGh81Ro3o1hOxt32SMVPicZroKQ2sZA=
 
+golang.org/x/net v0.0.0-20201006153459-a7d1128ccaa0/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=
 
+golang.org/x/net v0.0.0-20201021035429-f5854403a974/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=
 
+golang.org/x/net v0.0.0-20201110031124-69a78807bb2b/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=
 
+golang.org/x/net v0.0.0-20201224014010-6772e930b67b/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg=
 
 golang.org/x/net v0.0.0-20210226172049-e18ecbb05110/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg=
 
+golang.org/x/net v0.0.0-20211112202133-69e39bad7dc2 h1:CIJ76btIcR3eFI5EgSo6k1qKw9KJexJuRLI9G7Hp5wE=
 
+golang.org/x/net v0.0.0-20211112202133-69e39bad7dc2/go.mod h1:9nx3DQGgdP8bBQD5qxJ1jj9UTztislL4KSBs9R2vV5Y=
 
 golang.org/x/oauth2 v0.0.0-20200107190931-bf48bf16ab8d h1:TzXSXBo42m9gQenoE3b9BGiEpg5IG2JkU5FkPIawgtw=
 
 golang.org/x/oauth2 v0.0.0-20200107190931-bf48bf16ab8d/go.mod h1:gOpvHmFTYa4IltrdGE7lF6nIHvwfUNPOp7c8zoXwtLw=
 
 golang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20181108010431-42b317875d0f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20181221193216-37e7f081c4d4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
+golang.org/x/sync v0.0.0-20190227155943-e225da77a7e6/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20190911185100-cd5d95a43a6e/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
+golang.org/x/sync v0.0.0-20200625203802-6e8e738ad208/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20201020160332-67f06af15bc9/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20201207232520-09787c993a3a/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sync v0.0.0-20210220032951-036812b2e83c h1:5KslGYwFpkhGh+Q16bwMP3cOontH8FOep7tGV86Y7SQ=
 
 golang.org/x/sync v0.0.0-20210220032951-036812b2e83c/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
 
 golang.org/x/sys v0.0.0-20180823144017-11551d06cbcc/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
 
 golang.org/x/sys v0.0.0-20180830151530-49385e6e1522/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
 
+golang.org/x/sys v0.0.0-20180905080454-ebe1bf3edb33/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
 
 golang.org/x/sys v0.0.0-20180909124046-d0be0721c37e/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
 
 golang.org/x/sys v0.0.0-20181107165924-66b7b1311ac8/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
 
 golang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
 
@@ -604,15 +817,24 @@ golang.org/x/sys v0.0.0-20190412213103-97732733099d/go.mod h1:h1NjWce9XRLGQEsW7w
 
 golang.org/x/sys v0.0.0-20190422165155-953cdadca894/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190502145724-3ef323f4f1fd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190507160741-ecd444e8653b/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20190514135907-3a4b5fb9f71f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20190522044717-8097e1b27ff5/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20190602015325-4c4f7f33c9ed/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190606203320-7fc4e5ec1444/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190616124812-15dcb6c0061f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20190812073006-9eafafc0a87e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190826190057-c7b8b68b1456/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20190904154756-749cb33beabd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20190916202348-b4ddaad3f8a3/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190922100055-0a153f010e69/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20190924154521-2837fb4f24fe/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20191022100944-742c48ecaeb7/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20191026070338-33540a1f6037/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20191115151921-52ab43148777/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20191120155948-bd437916bb0e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20191204072324-ce4227a45e2e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20191210023423-ac6580df4449/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200106162015-b016eb3dc98e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200120151820-655fe14d7479/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200124204421-9fbb57f87de9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
@@ -620,17 +842,24 @@ golang.org/x/sys v0.0.0-20200202164722-d101bd2416d5/go.mod h1:h1NjWce9XRLGQEsW7w
 
 golang.org/x/sys v0.0.0-20200212091648-12a6c2dcc1e4/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200217220822-9197077df867/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200302150141-5c8b2ff67527/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20200323222414-85ca7c5b95cd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200420163511-1957bb5e6d1f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200511232937-7e40ca221e25/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200523222454-059865788121/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20200622214017-ed371f2e16b4/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20200728102440-3e129f6d46b1/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20200817155316-9781c653f443/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200831180312-196b9ba8737a/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200909081042-eff7692f9009/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200916030750-2334cc1a136f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20200922070232-aee5d888a860/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20200923182605-d9f96fdee20d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20200930185726-fdedc70b468f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20201112073958-5cba982894dd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20201117170446-d9b008d0a637/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20201119102817-f84b799fce68/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20201201145000-ef89a241ccb3/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
+golang.org/x/sys v0.0.0-20201202213521-69691e467435/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20210119212857-b64e53b001e4/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20210124154548-22da62e12c0c/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
 golang.org/x/sys v0.0.0-20210313202042-bd2e13477e9c/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
 
@@ -645,10 +874,19 @@ golang.org/x/sys v0.0.0-20220114195835-da31bd327af9 h1:XfKQ4OlFl8okEOr5UvAqFRVj8
 
 golang.org/x/sys v0.0.0-20220114195835-da31bd327af9/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg=
 
 golang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1 h1:v+OssWQX+hTHEmOBgwxdZxK4zHq3yOs8F9J7mk0PY8E=
 
 golang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1/go.mod h1:bj7SfCRtBDWHUb9snDiAeCFNEtKQo2Wmx5Cou7ajbmo=
 
-golang.org/x/text v0.3.3 h1:cokOdA+Jmi5PJGXLlLllQSgYigAEfHXJAERHVMaCc2k=
 
+golang.org/x/text v0.0.0-20170915032832-14c0d48ead0c/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=
 
+golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=
 
+golang.org/x/text v0.3.2/go.mod h1:bEr9sfX3Q8Zfm5fL9x+3itogRgK3+ptLWKqgva+5dAk=
 
 golang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=
 
-golang.org/x/time v0.0.0-20200630173020-3af7569d3a1e h1:EHBhcS0mlXEAVwNyO2dLfjToGsyY4j24pTs2ScHnX7s=
 
+golang.org/x/text v0.3.4/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=
 
+golang.org/x/text v0.3.6 h1:aRYxNxv6iGQlyVaZmk6ZgYEDa+Jg18DxebPSrd6bg1M=
 
+golang.org/x/text v0.3.6/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=
 
+golang.org/x/time v0.0.0-20180412165947-fbb02b2291d2/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ=
 
+golang.org/x/time v0.0.0-20190308202827-9d24e82272b4/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ=
 
+golang.org/x/time v0.0.0-20191024005414-555d28b269f0/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ=
 
 golang.org/x/time v0.0.0-20200630173020-3af7569d3a1e/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ=
 
+golang.org/x/time v0.0.0-20211116232009-f0f3c7e86c11 h1:GZokNIeuVkl3aZHJchRrr13WCsols02MLUcz1U9is6M=
 
+golang.org/x/time v0.0.0-20211116232009-f0f3c7e86c11/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ=
 
 golang.org/x/tools v0.0.0-20180221164845-07fd8470d635/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=
 
 golang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=
 
 golang.org/x/tools v0.0.0-20181030221726-6c7e314b6563/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=
 
@@ -686,6 +924,7 @@ google.golang.org/appengine v1.4.0/go.mod h1:xpcJRLb0r/rnEns0DIKYYv+WjYCduHsrkT7
 
 google.golang.org/appengine v1.5.0/go.mod h1:xpcJRLb0r/rnEns0DIKYYv+WjYCduHsrkT7/EB5XEv4=
 
 google.golang.org/appengine v1.6.7 h1:FZR1q0exgwxzPzp/aF+VccGrSfxfPpkBqjIIEq3ru6c=
 
 google.golang.org/appengine v1.6.7/go.mod h1:8WjMMxjGQR8xUklV/ARdw2HLXBOI7O7uCIDZVag1xfc=
 
+google.golang.org/cloud v0.0.0-20151119220103-975617b05ea8/go.mod h1:0H1ncTHf11KCFhTc/+EFRbzSCOZx+VUbRMk55Yv5MYk=
 
 google.golang.org/genproto v0.0.0-20200227132054-3f1135a288c9 h1:Koy0f8zyrEVfIHetH7wjP5mQLUXiqDpubSg8V1fAxqc=
 
 google.golang.org/genproto v0.0.0-20200227132054-3f1135a288c9/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c=
 
 google.golang.org/grpc v1.27.1 h1:zvIju4sqAGvwKspUQOhwnpcqSbzi7/H6QomNNjTL4sk=
 
@@ -697,11 +936,11 @@ google.golang.org/protobuf v1.27.1/go.mod h1:9q0QmTI4eRPtz6boOQmLYwt+qCgq0jsYwAQ
 
 gopkg.in/airbrake/gobrake.v2 v2.0.9/go.mod h1:/h5ZAUhDkGaJfjzjKLSjv6zCL6O0LLBxU4K+aSYdM/U=
 
 gopkg.in/alecthomas/kingpin.v2 v2.2.6/go.mod h1:FMv+mEhP44yOT+4EoQTLFTRgOQ1FBLkstjWtayDeSgw=
 
 gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 
+gopkg.in/check.v1 v1.0.0-20141024133853-64131543e789/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 
 gopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 
 gopkg.in/check.v1 v1.0.0-20190902080502-41f04d3bba15 h1:YR8cESwS4TdDjEe65xsg0ogRM/Nc3DYOhEAlW+xobZo=
 
 gopkg.in/check.v1 v1.0.0-20190902080502-41f04d3bba15/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 
 gopkg.in/cheggaaa/pb.v1 v1.0.25/go.mod h1:V/YB90LKu/1FcN3WVnfiiE5oMCibMjukxqG/qStrOgw=
 
-gopkg.in/fsnotify.v1 v1.4.7 h1:xOHLXZwVvI9hhs+cLKq5+I5onOuwQLhQwiu63xxlHs4=
 
 gopkg.in/fsnotify.v1 v1.4.7/go.mod h1:Tz8NjZHkW78fSQdbUxIjBTcgA1z1m8ZHf0WmKUhAMys=
 
 gopkg.in/gemnasium/logrus-airbrake-hook.v2 v2.1.2/go.mod h1:Xk6kEKp8OKb+X14hQBKWaSkCsqBpgog8nAV2xsGOxlo=
 
 gopkg.in/inf.v0 v0.9.1/go.mod h1:cWUDdTG/fYaXco+Dcufb5Vnc6Gp2YChqWtbxRZE0mXw=
 
@@ -709,6 +948,7 @@ gopkg.in/ini.v1 v1.51.0/go.mod h1:pNLf8WUiyNEtQjuu5G5vTm06TEv9tsIgeAvK8hOrP4k=
 
 gopkg.in/natefinch/lumberjack.v2 v2.0.0/go.mod h1:l0ndWWf7gzL7RNwBG7wST/UCcT4T24xpD6X8LsfU/+k=
 
 gopkg.in/resty.v1 v1.12.0/go.mod h1:mDo4pnntr5jdWRML875a/NmxYqAlA73dVijT2AXvQQo=
 
 gopkg.in/square/go-jose.v2 v2.2.2/go.mod h1:M9dMgbHiYLoDGQrXy7OpJDJWiKiU//h+vD76mk0e1AI=
 
+gopkg.in/square/go-jose.v2 v2.3.1/go.mod h1:M9dMgbHiYLoDGQrXy7OpJDJWiKiU//h+vD76mk0e1AI=
 
 gopkg.in/square/go-jose.v2 v2.5.1/go.mod h1:M9dMgbHiYLoDGQrXy7OpJDJWiKiU//h+vD76mk0e1AI=
 
 gopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7 h1:uRGJdciOHaEIrze2W8Q3AKkepLTh2hOroT7a+7czfdQ=
 
 gopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7/go.mod h1:dt/ZhP58zS4L8KSrWDmTeBkI65Dw0HsyUHuEVlX15mw=
 
@@ -721,27 +961,44 @@ gopkg.in/yaml.v2 v2.2.8/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=
 
 gopkg.in/yaml.v2 v2.3.0/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=
 
 gopkg.in/yaml.v2 v2.4.0 h1:D8xgwECY7CYvx+Y2n4sBz93Jn9JRvxdiyyo8CTfuKaY=
 
 gopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=
 
+gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c h1:dUUwHk2QECo/6vqA44rthZ8ie2QXMNeKRTHCNY2nXvo=
 
+gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
 
 gotest.tools v2.2.0+incompatible/go.mod h1:DsYFclhRJ6vuDpmuTbkuFWG+y2sxOXAzmJt81HFBacw=
 
 gotest.tools/v3 v3.0.2/go.mod h1:3SzNCllyD9/Y+b5r9JIKQ474KzkZyqLqEfYqMsX94Bk=
 
 gotest.tools/v3 v3.0.3 h1:4AuOwCGf4lLR9u3YOe2awrHygurzhO/HeQ6laiA6Sx0=
 
 gotest.tools/v3 v3.0.3/go.mod h1:Z7Lb0S5l+klDB31fvDQX8ss/FlKDxtlFlw3Oa8Ymbl8=
 
 honnef.co/go/tools v0.0.0-20190418001031-e561f6794a2a/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4=
 
 honnef.co/go/tools v0.0.0-20190523083050-ea95bdfd59fc/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4=
 
+k8s.io/api v0.20.1/go.mod h1:KqwcCVogGxQY3nBlRpwt+wpAMF/KjaCc7RpywacvqUo=
 
+k8s.io/api v0.20.4/go.mod h1:++lNL1AJMkDymriNniQsWRkMDzRaX2Y/POTUi8yvqYQ=
 
 k8s.io/api v0.20.6/go.mod h1:X9e8Qag6JV/bL5G6bU8sdVRltWKmdHsFUGS3eVndqE8=
 
+k8s.io/apimachinery v0.20.1/go.mod h1:WlLqWAHZGg07AeltaI0MV5uk1Omp8xaN0JGLY6gkRpU=
 
+k8s.io/apimachinery v0.20.4/go.mod h1:WlLqWAHZGg07AeltaI0MV5uk1Omp8xaN0JGLY6gkRpU=
 
 k8s.io/apimachinery v0.20.6/go.mod h1:ejZXtW1Ra6V1O5H8xPBGz+T3+4gfkTCeExAHKU57MAc=
 
+k8s.io/apiserver v0.20.1/go.mod h1:ro5QHeQkgMS7ZGpvf4tSMx6bBOgPfE+f52KwvXfScaU=
 
+k8s.io/apiserver v0.20.4/go.mod h1:Mc80thBKOyy7tbvFtB4kJv1kbdD0eIH8k8vianJcbFM=
 
 k8s.io/apiserver v0.20.6/go.mod h1:QIJXNt6i6JB+0YQRNcS0hdRHJlMhflFmsBDeSgT1r8Q=
 
+k8s.io/client-go v0.20.1/go.mod h1:/zcHdt1TeWSd5HoUe6elJmHSQ6uLLgp4bIJHVEuy+/Y=
 
+k8s.io/client-go v0.20.4/go.mod h1:LiMv25ND1gLUdBeYxBIwKpkSC5IsozMMmOOeSJboP+k=
 
 k8s.io/client-go v0.20.6/go.mod h1:nNQMnOvEUEsOzRRFIIkdmYOjAZrC8bgq0ExboWSU1I0=
 
+k8s.io/component-base v0.20.1/go.mod h1:guxkoJnNoh8LNrbtiQOlyp2Y2XFCZQmrcg2n/DeYNLk=
 
+k8s.io/component-base v0.20.4/go.mod h1:t4p9EdiagbVCJKrQ1RsA5/V4rFQNDfRlevJajlGwgjI=
 
 k8s.io/component-base v0.20.6/go.mod h1:6f1MPBAeI+mvuts3sIdtpjljHWBQ2cIy38oBIWMYnrM=
 
+k8s.io/cri-api v0.17.3/go.mod h1:X1sbHmuXhwaHs9xxYffLqJogVsnI+f6cPRcgPel7ywM=
 
+k8s.io/cri-api v0.20.1/go.mod h1:2JRbKt+BFLTjtrILYVqQK5jqhI+XNdF6UiGMgczeBCI=
 
+k8s.io/cri-api v0.20.4/go.mod h1:2JRbKt+BFLTjtrILYVqQK5jqhI+XNdF6UiGMgczeBCI=
 
 k8s.io/cri-api v0.20.6/go.mod h1:ew44AjNXwyn1s0U4xCKGodU7J1HzBeZ1MpGrpa5r8Yc=
 
 k8s.io/gengo v0.0.0-20200413195148-3a45101e95ac/go.mod h1:ezvh/TsK7cY6rbqRK0oQQ8IAqLxYwwyPxAX1Pzy0ii0=
 
 k8s.io/klog/v2 v2.0.0/go.mod h1:PBfzABfn139FHAV07az/IF9Wp1bkk3vpT2XSJ76fSDE=
 
 k8s.io/klog/v2 v2.4.0/go.mod h1:Od+F08eJP+W3HUb4pSrPpgp9DGU4GzlpG/TmITuYh/Y=
 
 k8s.io/kube-openapi v0.0.0-20201113171705-d219536bb9fd/go.mod h1:WOJ3KddDSol4tAGcJo0Tvi+dK12EcqSLqcWsryKMpfM=
 
+k8s.io/kubernetes v1.13.0/go.mod h1:ocZa8+6APFNC2tX1DZASIbocyYT5jHzqFVsY5aoB7Jk=
 
 k8s.io/utils v0.0.0-20201110183641-67b214c5f920/go.mod h1:jPW/WVKK9YHAvNhRxK0md/EJ228hCsBRufyofKtW8HA=
 
 labix.org/v2/mgo v0.0.0-20140701140051-000000000287 h1:L0cnkNl4TfAXzvdrqsYEmxOHOCv2p5I3taaReO8BWFs=
 
 labix.org/v2/mgo v0.0.0-20140701140051-000000000287/go.mod h1:Lg7AYkt1uXJoR9oeSZ3W/8IXLdvOfIITgZnommstyz4=
 
 rsc.io/quote/v3 v3.1.0/go.mod h1:yEA65RcK8LyAZtP9Kv3t0HmxON59tX3rD+tICJqUlj0=
 
 rsc.io/sampler v1.3.0/go.mod h1:T1hPZKmBbMNahiBKFy5HrXp6adAjACjK9JXDnKaTXpA=
 
+sigs.k8s.io/apiserver-network-proxy/konnectivity-client v0.0.14/go.mod h1:LEScyzhFmoF5pso/YSeBstl57mOzx9xlU9n85RGrDQg=
 
 sigs.k8s.io/apiserver-network-proxy/konnectivity-client v0.0.15/go.mod h1:LEScyzhFmoF5pso/YSeBstl57mOzx9xlU9n85RGrDQg=
 
 sigs.k8s.io/structured-merge-diff/v4 v4.0.2/go.mod h1:bJZC9H9iH24zzfZ/41RGcq60oK1F7G282QMXDPYydCw=
 
 sigs.k8s.io/structured-merge-diff/v4 v4.0.3/go.mod h1:bJZC9H9iH24zzfZ/41RGcq60oK1F7G282QMXDPYydCw=

+ 0 - 0
vendor/github.com/klauspost/compress/snappy/.gitignore → vendor/github.com/golang/snappy/.gitignore
Vedi File


+ 2 - 0
vendor/github.com/klauspost/compress/snappy/AUTHORS → vendor/github.com/golang/snappy/AUTHORS
Vedi File 

@@ -8,8 +8,10 @@
 
 
 # Please keep the list sorted.
 
 
+Amazon.com, Inc
 
 Damian Gryski <dgryski@gmail.com>
 
 Google Inc.
 
 Jan Mercl <0xjnml@gmail.com>
 
+Klaus Post <klauspost@gmail.com>
 
 Rodolfo Carvalho <rhcarvalho@gmail.com>
 
 Sebastien Binet <seb.binet@gmail.com>

+ 2 - 0
vendor/github.com/klauspost/compress/snappy/CONTRIBUTORS → vendor/github.com/golang/snappy/CONTRIBUTORS
Vedi File 

@@ -28,7 +28,9 @@
 
 
 Damian Gryski <dgryski@gmail.com>
 
 Jan Mercl <0xjnml@gmail.com>
 
+Jonathan Swinney <jswinney@amazon.com>
 
 Kai Backman <kaib@golang.org>
 
+Klaus Post <klauspost@gmail.com>
 
 Marc-Antoine Ruel <maruel@chromium.org>
 
 Nigel Tao <nigeltao@golang.org>
 
 Rob Pike <r@golang.org>

+ 0 - 0
vendor/github.com/klauspost/compress/snappy/LICENSE → vendor/github.com/golang/snappy/LICENSE
Vedi File


+ 0 - 0
vendor/github.com/klauspost/compress/snappy/README → vendor/github.com/golang/snappy/README
Vedi File


+ 4 - 0
vendor/github.com/klauspost/compress/snappy/decode.go → vendor/github.com/golang/snappy/decode.go
Vedi File 

@@ -52,6 +52,8 @@ const (
 
 // Otherwise, a newly allocated slice will be returned.
 
 //
 
 // The dst and src must not overlap. It is valid to pass a nil dst.
 
+//
 
+// Decode handles the Snappy block format, not the Snappy stream format.
 
 func Decode(dst, src []byte) ([]byte, error) {
 
 	dLen, s, err := decodedLen(src)
 
 	if err != nil {
 
@@ -83,6 +85,8 @@ func NewReader(r io.Reader) *Reader {
 
 }
 
 
 // Reader is an io.Reader that can read Snappy-compressed bytes.
 
+//
 
+// Reader handles the Snappy stream format, not the Snappy block format.
 
 type Reader struct {
 
 	r       io.Reader
 
 	err     error

+ 12 - 4
vendor/github.com/klauspost/compress/snappy/decode_amd64.s → vendor/github.com/golang/snappy/decode_amd64.s
Vedi File 

@@ -184,7 +184,9 @@ tagLit60Plus:
 
 	// checks. In the asm version, we code it once instead of once per switch case.
 
 	ADDQ CX, SI
 
 	SUBQ $58, SI
 
-	CMPQ SI, R13
 
+	MOVQ SI, BX
 
+	SUBQ R11, BX
 
+	CMPQ BX, R12
 
 	JA   errCorrupt
 
 
 	// case x == 60:
 
@@ -230,7 +232,9 @@ tagCopy4:
 
 	ADDQ $5, SI
 
 
 	// if uint(s) > uint(len(src)) { etc }
 
-	CMPQ SI, R13
 
+	MOVQ SI, BX
 
+	SUBQ R11, BX
 
+	CMPQ BX, R12
 
 	JA   errCorrupt
 
 
 	// length = 1 + int(src[s-5])>>2
 
@@ -247,7 +251,9 @@ tagCopy2:
 
 	ADDQ $3, SI
 
 
 	// if uint(s) > uint(len(src)) { etc }
 
-	CMPQ SI, R13
 
+	MOVQ SI, BX
 
+	SUBQ R11, BX
 
+	CMPQ BX, R12
 
 	JA   errCorrupt
 
 
 	// length = 1 + int(src[s-3])>>2
 
@@ -271,7 +277,9 @@ tagCopy:
 
 	ADDQ $2, SI
 
 
 	// if uint(s) > uint(len(src)) { etc }
 
-	CMPQ SI, R13
 
+	MOVQ SI, BX
 
+	SUBQ R11, BX
 
+	CMPQ BX, R12
 
 	JA   errCorrupt
 
 
 	// offset = int(uint32(src[s-2])&0xe0<<3 | uint32(src[s-1]))

+ 494 - 0
vendor/github.com/golang/snappy/decode_arm64.s
Vedi File 

@@ -0,0 +1,494 @@
 
+// Copyright 2020 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+// +build !appengine
 
+// +build gc
 
+// +build !noasm
 
+
 
+#include "textflag.h"
 
+
 
+// The asm code generally follows the pure Go code in decode_other.go, except
 
+// where marked with a "!!!".
 
+
 
+// func decode(dst, src []byte) int
 
+//
 
+// All local variables fit into registers. The non-zero stack size is only to
 
+// spill registers and push args when issuing a CALL. The register allocation:
 
+//	- R2	scratch
 
+//	- R3	scratch
 
+//	- R4	length or x
 
+//	- R5	offset
 
+//	- R6	&src[s]
 
+//	- R7	&dst[d]
 
+//	+ R8	dst_base
 
+//	+ R9	dst_len
 
+//	+ R10	dst_base + dst_len
 
+//	+ R11	src_base
 
+//	+ R12	src_len
 
+//	+ R13	src_base + src_len
 
+//	- R14	used by doCopy
 
+//	- R15	used by doCopy
 
+//
 
+// The registers R8-R13 (marked with a "+") are set at the start of the
 
+// function, and after a CALL returns, and are not otherwise modified.
 
+//
 
+// The d variable is implicitly R7 - R8,  and len(dst)-d is R10 - R7.
 
+// The s variable is implicitly R6 - R11, and len(src)-s is R13 - R6.
 
+TEXT ·decode(SB), NOSPLIT, $56-56
 
+	// Initialize R6, R7 and R8-R13.
 
+	MOVD dst_base+0(FP), R8
 
+	MOVD dst_len+8(FP), R9
 
+	MOVD R8, R7
 
+	MOVD R8, R10
 
+	ADD  R9, R10, R10
 
+	MOVD src_base+24(FP), R11
 
+	MOVD src_len+32(FP), R12
 
+	MOVD R11, R6
 
+	MOVD R11, R13
 
+	ADD  R12, R13, R13
 
+
 
+loop:
 
+	// for s < len(src)
 
+	CMP R13, R6
 
+	BEQ end
 
+
 
+	// R4 = uint32(src[s])
 
+	//
 
+	// switch src[s] & 0x03
 
+	MOVBU (R6), R4
 
+	MOVW  R4, R3
 
+	ANDW  $3, R3
 
+	MOVW  $1, R1
 
+	CMPW  R1, R3
 
+	BGE   tagCopy
 
+
 
+	// ----------------------------------------
 
+	// The code below handles literal tags.
 
+
 
+	// case tagLiteral:
 
+	// x := uint32(src[s] >> 2)
 
+	// switch
 
+	MOVW $60, R1
 
+	LSRW $2, R4, R4
 
+	CMPW R4, R1
 
+	BLS  tagLit60Plus
 
+
 
+	// case x < 60:
 
+	// s++
 
+	ADD $1, R6, R6
 
+
 
+doLit:
 
+	// This is the end of the inner "switch", when we have a literal tag.
 
+	//
 
+	// We assume that R4 == x and x fits in a uint32, where x is the variable
 
+	// used in the pure Go decode_other.go code.
 
+
 
+	// length = int(x) + 1
 
+	//
 
+	// Unlike the pure Go code, we don't need to check if length <= 0 because
 
+	// R4 can hold 64 bits, so the increment cannot overflow.
 
+	ADD $1, R4, R4
 
+
 
+	// Prepare to check if copying length bytes will run past the end of dst or
 
+	// src.
 
+	//
 
+	// R2 = len(dst) - d
 
+	// R3 = len(src) - s
 
+	MOVD R10, R2
 
+	SUB  R7, R2, R2
 
+	MOVD R13, R3
 
+	SUB  R6, R3, R3
 
+
 
+	// !!! Try a faster technique for short (16 or fewer bytes) copies.
 
+	//
 
+	// if length > 16 || len(dst)-d < 16 || len(src)-s < 16 {
 
+	//   goto callMemmove // Fall back on calling runtime·memmove.
 
+	// }
 
+	//
 
+	// The C++ snappy code calls this TryFastAppend. It also checks len(src)-s
 
+	// against 21 instead of 16, because it cannot assume that all of its input
 
+	// is contiguous in memory and so it needs to leave enough source bytes to
 
+	// read the next tag without refilling buffers, but Go's Decode assumes
 
+	// contiguousness (the src argument is a []byte).
 
+	CMP $16, R4
 
+	BGT callMemmove
 
+	CMP $16, R2
 
+	BLT callMemmove
 
+	CMP $16, R3
 
+	BLT callMemmove
 
+
 
+	// !!! Implement the copy from src to dst as a 16-byte load and store.
 
+	// (Decode's documentation says that dst and src must not overlap.)
 
+	//
 
+	// This always copies 16 bytes, instead of only length bytes, but that's
 
+	// OK. If the input is a valid Snappy encoding then subsequent iterations
 
+	// will fix up the overrun. Otherwise, Decode returns a nil []byte (and a
 
+	// non-nil error), so the overrun will be ignored.
 
+	//
 
+	// Note that on arm64, it is legal and cheap to issue unaligned 8-byte or
 
+	// 16-byte loads and stores. This technique probably wouldn't be as
 
+	// effective on architectures that are fussier about alignment.
 
+	LDP 0(R6), (R14, R15)
 
+	STP (R14, R15), 0(R7)
 
+
 
+	// d += length
 
+	// s += length
 
+	ADD R4, R7, R7
 
+	ADD R4, R6, R6
 
+	B   loop
 
+
 
+callMemmove:
 
+	// if length > len(dst)-d || length > len(src)-s { etc }
 
+	CMP R2, R4
 
+	BGT errCorrupt
 
+	CMP R3, R4
 
+	BGT errCorrupt
 
+
 
+	// copy(dst[d:], src[s:s+length])
 
+	//
 
+	// This means calling runtime·memmove(&dst[d], &src[s], length), so we push
 
+	// R7, R6 and R4 as arguments. Coincidentally, we also need to spill those
 
+	// three registers to the stack, to save local variables across the CALL.
 
+	MOVD R7, 8(RSP)
 
+	MOVD R6, 16(RSP)
 
+	MOVD R4, 24(RSP)
 
+	MOVD R7, 32(RSP)
 
+	MOVD R6, 40(RSP)
 
+	MOVD R4, 48(RSP)
 
+	CALL runtime·memmove(SB)
 
+
 
+	// Restore local variables: unspill registers from the stack and
 
+	// re-calculate R8-R13.
 
+	MOVD 32(RSP), R7
 
+	MOVD 40(RSP), R6
 
+	MOVD 48(RSP), R4
 
+	MOVD dst_base+0(FP), R8
 
+	MOVD dst_len+8(FP), R9
 
+	MOVD R8, R10
 
+	ADD  R9, R10, R10
 
+	MOVD src_base+24(FP), R11
 
+	MOVD src_len+32(FP), R12
 
+	MOVD R11, R13
 
+	ADD  R12, R13, R13
 
+
 
+	// d += length
 
+	// s += length
 
+	ADD R4, R7, R7
 
+	ADD R4, R6, R6
 
+	B   loop
 
+
 
+tagLit60Plus:
 
+	// !!! This fragment does the
 
+	//
 
+	// s += x - 58; if uint(s) > uint(len(src)) { etc }
 
+	//
 
+	// checks. In the asm version, we code it once instead of once per switch case.
 
+	ADD  R4, R6, R6
 
+	SUB  $58, R6, R6
 
+	MOVD R6, R3
 
+	SUB  R11, R3, R3
 
+	CMP  R12, R3
 
+	BGT  errCorrupt
 
+
 
+	// case x == 60:
 
+	MOVW $61, R1
 
+	CMPW R1, R4
 
+	BEQ  tagLit61
 
+	BGT  tagLit62Plus
 
+
 
+	// x = uint32(src[s-1])
 
+	MOVBU -1(R6), R4
 
+	B     doLit
 
+
 
+tagLit61:
 
+	// case x == 61:
 
+	// x = uint32(src[s-2]) | uint32(src[s-1])<<8
 
+	MOVHU -2(R6), R4
 
+	B     doLit
 
+
 
+tagLit62Plus:
 
+	CMPW $62, R4
 
+	BHI  tagLit63
 
+
 
+	// case x == 62:
 
+	// x = uint32(src[s-3]) | uint32(src[s-2])<<8 | uint32(src[s-1])<<16
 
+	MOVHU -3(R6), R4
 
+	MOVBU -1(R6), R3
 
+	ORR   R3<<16, R4
 
+	B     doLit
 
+
 
+tagLit63:
 
+	// case x == 63:
 
+	// x = uint32(src[s-4]) | uint32(src[s-3])<<8 | uint32(src[s-2])<<16 | uint32(src[s-1])<<24
 
+	MOVWU -4(R6), R4
 
+	B     doLit
 
+
 
+	// The code above handles literal tags.
 
+	// ----------------------------------------
 
+	// The code below handles copy tags.
 
+
 
+tagCopy4:
 
+	// case tagCopy4:
 
+	// s += 5
 
+	ADD $5, R6, R6
 
+
 
+	// if uint(s) > uint(len(src)) { etc }
 
+	MOVD R6, R3
 
+	SUB  R11, R3, R3
 
+	CMP  R12, R3
 
+	BGT  errCorrupt
 
+
 
+	// length = 1 + int(src[s-5])>>2
 
+	MOVD $1, R1
 
+	ADD  R4>>2, R1, R4
 
+
 
+	// offset = int(uint32(src[s-4]) | uint32(src[s-3])<<8 | uint32(src[s-2])<<16 | uint32(src[s-1])<<24)
 
+	MOVWU -4(R6), R5
 
+	B     doCopy
 
+
 
+tagCopy2:
 
+	// case tagCopy2:
 
+	// s += 3
 
+	ADD $3, R6, R6
 
+
 
+	// if uint(s) > uint(len(src)) { etc }
 
+	MOVD R6, R3
 
+	SUB  R11, R3, R3
 
+	CMP  R12, R3
 
+	BGT  errCorrupt
 
+
 
+	// length = 1 + int(src[s-3])>>2
 
+	MOVD $1, R1
 
+	ADD  R4>>2, R1, R4
 
+
 
+	// offset = int(uint32(src[s-2]) | uint32(src[s-1])<<8)
 
+	MOVHU -2(R6), R5
 
+	B     doCopy
 
+
 
+tagCopy:
 
+	// We have a copy tag. We assume that:
 
+	//	- R3 == src[s] & 0x03
 
+	//	- R4 == src[s]
 
+	CMP $2, R3
 
+	BEQ tagCopy2
 
+	BGT tagCopy4
 
+
 
+	// case tagCopy1:
 
+	// s += 2
 
+	ADD $2, R6, R6
 
+
 
+	// if uint(s) > uint(len(src)) { etc }
 
+	MOVD R6, R3
 
+	SUB  R11, R3, R3
 
+	CMP  R12, R3
 
+	BGT  errCorrupt
 
+
 
+	// offset = int(uint32(src[s-2])&0xe0<<3 | uint32(src[s-1]))
 
+	MOVD  R4, R5
 
+	AND   $0xe0, R5
 
+	MOVBU -1(R6), R3
 
+	ORR   R5<<3, R3, R5
 
+
 
+	// length = 4 + int(src[s-2])>>2&0x7
 
+	MOVD $7, R1
 
+	AND  R4>>2, R1, R4
 
+	ADD  $4, R4, R4
 
+
 
+doCopy:
 
+	// This is the end of the outer "switch", when we have a copy tag.
 
+	//
 
+	// We assume that:
 
+	//	- R4 == length && R4 > 0
 
+	//	- R5 == offset
 
+
 
+	// if offset <= 0 { etc }
 
+	MOVD $0, R1
 
+	CMP  R1, R5
 
+	BLE  errCorrupt
 
+
 
+	// if d < offset { etc }
 
+	MOVD R7, R3
 
+	SUB  R8, R3, R3
 
+	CMP  R5, R3
 
+	BLT  errCorrupt
 
+
 
+	// if length > len(dst)-d { etc }
 
+	MOVD R10, R3
 
+	SUB  R7, R3, R3
 
+	CMP  R3, R4
 
+	BGT  errCorrupt
 
+
 
+	// forwardCopy(dst[d:d+length], dst[d-offset:]); d += length
 
+	//
 
+	// Set:
 
+	//	- R14 = len(dst)-d
 
+	//	- R15 = &dst[d-offset]
 
+	MOVD R10, R14
 
+	SUB  R7, R14, R14
 
+	MOVD R7, R15
 
+	SUB  R5, R15, R15
 
+
 
+	// !!! Try a faster technique for short (16 or fewer bytes) forward copies.
 
+	//
 
+	// First, try using two 8-byte load/stores, similar to the doLit technique
 
+	// above. Even if dst[d:d+length] and dst[d-offset:] can overlap, this is
 
+	// still OK if offset >= 8. Note that this has to be two 8-byte load/stores
 
+	// and not one 16-byte load/store, and the first store has to be before the
 
+	// second load, due to the overlap if offset is in the range [8, 16).
 
+	//
 
+	// if length > 16 || offset < 8 || len(dst)-d < 16 {
 
+	//   goto slowForwardCopy
 
+	// }
 
+	// copy 16 bytes
 
+	// d += length
 
+	CMP  $16, R4
 
+	BGT  slowForwardCopy
 
+	CMP  $8, R5
 
+	BLT  slowForwardCopy
 
+	CMP  $16, R14
 
+	BLT  slowForwardCopy
 
+	MOVD 0(R15), R2
 
+	MOVD R2, 0(R7)
 
+	MOVD 8(R15), R3
 
+	MOVD R3, 8(R7)
 
+	ADD  R4, R7, R7
 
+	B    loop
 
+
 
+slowForwardCopy:
 
+	// !!! If the forward copy is longer than 16 bytes, or if offset < 8, we
 
+	// can still try 8-byte load stores, provided we can overrun up to 10 extra
 
+	// bytes. As above, the overrun will be fixed up by subsequent iterations
 
+	// of the outermost loop.
 
+	//
 
+	// The C++ snappy code calls this technique IncrementalCopyFastPath. Its
 
+	// commentary says:
 
+	//
 
+	// ----
 
+	//
 
+	// The main part of this loop is a simple copy of eight bytes at a time
 
+	// until we've copied (at least) the requested amount of bytes.  However,
 
+	// if d and d-offset are less than eight bytes apart (indicating a
 
+	// repeating pattern of length < 8), we first need to expand the pattern in
 
+	// order to get the correct results. For instance, if the buffer looks like
 
+	// this, with the eight-byte <d-offset> and <d> patterns marked as
 
+	// intervals:
 
+	//
 
+	//    abxxxxxxxxxxxx
 
+	//    [------]           d-offset
 
+	//      [------]         d
 
+	//
 
+	// a single eight-byte copy from <d-offset> to <d> will repeat the pattern
 
+	// once, after which we can move <d> two bytes without moving <d-offset>:
 
+	//
 
+	//    ababxxxxxxxxxx
 
+	//    [------]           d-offset
 
+	//        [------]       d
 
+	//
 
+	// and repeat the exercise until the two no longer overlap.
 
+	//
 
+	// This allows us to do very well in the special case of one single byte
 
+	// repeated many times, without taking a big hit for more general cases.
 
+	//
 
+	// The worst case of extra writing past the end of the match occurs when
 
+	// offset == 1 and length == 1; the last copy will read from byte positions
 
+	// [0..7] and write to [4..11], whereas it was only supposed to write to
 
+	// position 1. Thus, ten excess bytes.
 
+	//
 
+	// ----
 
+	//
 
+	// That "10 byte overrun" worst case is confirmed by Go's
 
+	// TestSlowForwardCopyOverrun, which also tests the fixUpSlowForwardCopy
 
+	// and finishSlowForwardCopy algorithm.
 
+	//
 
+	// if length > len(dst)-d-10 {
 
+	//   goto verySlowForwardCopy
 
+	// }
 
+	SUB $10, R14, R14
 
+	CMP R14, R4
 
+	BGT verySlowForwardCopy
 
+
 
+makeOffsetAtLeast8:
 
+	// !!! As above, expand the pattern so that offset >= 8 and we can use
 
+	// 8-byte load/stores.
 
+	//
 
+	// for offset < 8 {
 
+	//   copy 8 bytes from dst[d-offset:] to dst[d:]
 
+	//   length -= offset
 
+	//   d      += offset
 
+	//   offset += offset
 
+	//   // The two previous lines together means that d-offset, and therefore
 
+	//   // R15, is unchanged.
 
+	// }
 
+	CMP  $8, R5
 
+	BGE  fixUpSlowForwardCopy
 
+	MOVD (R15), R3
 
+	MOVD R3, (R7)
 
+	SUB  R5, R4, R4
 
+	ADD  R5, R7, R7
 
+	ADD  R5, R5, R5
 
+	B    makeOffsetAtLeast8
 
+
 
+fixUpSlowForwardCopy:
 
+	// !!! Add length (which might be negative now) to d (implied by R7 being
 
+	// &dst[d]) so that d ends up at the right place when we jump back to the
 
+	// top of the loop. Before we do that, though, we save R7 to R2 so that, if
 
+	// length is positive, copying the remaining length bytes will write to the
 
+	// right place.
 
+	MOVD R7, R2
 
+	ADD  R4, R7, R7
 
+
 
+finishSlowForwardCopy:
 
+	// !!! Repeat 8-byte load/stores until length <= 0. Ending with a negative
 
+	// length means that we overrun, but as above, that will be fixed up by
 
+	// subsequent iterations of the outermost loop.
 
+	MOVD $0, R1
 
+	CMP  R1, R4
 
+	BLE  loop
 
+	MOVD (R15), R3
 
+	MOVD R3, (R2)
 
+	ADD  $8, R15, R15
 
+	ADD  $8, R2, R2
 
+	SUB  $8, R4, R4
 
+	B    finishSlowForwardCopy
 
+
 
+verySlowForwardCopy:
 
+	// verySlowForwardCopy is a simple implementation of forward copy. In C
 
+	// parlance, this is a do/while loop instead of a while loop, since we know
 
+	// that length > 0. In Go syntax:
 
+	//
 
+	// for {
 
+	//   dst[d] = dst[d - offset]
 
+	//   d++
 
+	//   length--
 
+	//   if length == 0 {
 
+	//     break
 
+	//   }
 
+	// }
 
+	MOVB (R15), R3
 
+	MOVB R3, (R7)
 
+	ADD  $1, R15, R15
 
+	ADD  $1, R7, R7
 
+	SUB  $1, R4, R4
 
+	CBNZ R4, verySlowForwardCopy
 
+	B    loop
 
+
 
+	// The code above handles copy tags.
 
+	// ----------------------------------------
 
+
 
+end:
 
+	// This is the end of the "for s < len(src)".
 
+	//
 
+	// if d != len(dst) { etc }
 
+	CMP R10, R7
 
+	BNE errCorrupt
 
+
 
+	// return 0
 
+	MOVD $0, ret+48(FP)
 
+	RET
 
+
 
+errCorrupt:
 
+	// return decodeErrCodeCorrupt
 
+	MOVD $1, R2
 
+	MOVD R2, ret+48(FP)
 
+	RET

+ 1 - 0
vendor/github.com/klauspost/compress/snappy/decode_amd64.go → vendor/github.com/golang/snappy/decode_asm.go
Vedi File 

@@ -5,6 +5,7 @@
 
 // +build !appengine
 
 // +build gc
 
 // +build !noasm
 
+// +build amd64 arm64
 
 
 package snappy

+ 2 - 2
vendor/github.com/klauspost/compress/snappy/decode_other.go → vendor/github.com/golang/snappy/decode_other.go
Vedi File 

@@ -2,7 +2,7 @@
 
 // Use of this source code is governed by a BSD-style
 
 // license that can be found in the LICENSE file.
 
 
-// +build !amd64 appengine !gc noasm
 
+// +build !amd64,!arm64 appengine !gc noasm
 
 
 package snappy
 
 
@@ -87,7 +87,7 @@ func decode(dst, src []byte) int {
 
 		}
 
 		// Copy from an earlier sub-slice of dst to a later sub-slice.
 
 		// If no overlap, use the built-in copy:
 
-		if offset > length {
 
+		if offset >= length {
 
 			copy(dst[d:d+length], dst[d-offset:])
 
 			d += length
 
 			continue

+ 4 - 0
vendor/github.com/klauspost/compress/snappy/encode.go → vendor/github.com/golang/snappy/encode.go
Vedi File 

@@ -15,6 +15,8 @@ import (
 
 // Otherwise, a newly allocated slice will be returned.
 
 //
 
 // The dst and src must not overlap. It is valid to pass a nil dst.
 
+//
 
+// Encode handles the Snappy block format, not the Snappy stream format.
 
 func Encode(dst, src []byte) []byte {
 
 	if n := MaxEncodedLen(len(src)); n < 0 {
 
 		panic(ErrTooLarge)
 
@@ -139,6 +141,8 @@ func NewBufferedWriter(w io.Writer) *Writer {
 
 }
 
 
 // Writer is an io.Writer that can write Snappy-compressed bytes.
 
+//
 
+// Writer handles the Snappy stream format, not the Snappy block format.
 
 type Writer struct {
 
 	w   io.Writer
 
 	err error

+ 0 - 0
vendor/github.com/klauspost/compress/snappy/encode_amd64.s → vendor/github.com/golang/snappy/encode_amd64.s
Vedi File


+ 722 - 0
vendor/github.com/golang/snappy/encode_arm64.s
Vedi File 

@@ -0,0 +1,722 @@
 
+// Copyright 2020 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+// +build !appengine
 
+// +build gc
 
+// +build !noasm
 
+
 
+#include "textflag.h"
 
+
 
+// The asm code generally follows the pure Go code in encode_other.go, except
 
+// where marked with a "!!!".
 
+
 
+// ----------------------------------------------------------------------------
 
+
 
+// func emitLiteral(dst, lit []byte) int
 
+//
 
+// All local variables fit into registers. The register allocation:
 
+//	- R3	len(lit)
 
+//	- R4	n
 
+//	- R6	return value
 
+//	- R8	&dst[i]
 
+//	- R10	&lit[0]
 
+//
 
+// The 32 bytes of stack space is to call runtime·memmove.
 
+//
 
+// The unusual register allocation of local variables, such as R10 for the
 
+// source pointer, matches the allocation used at the call site in encodeBlock,
 
+// which makes it easier to manually inline this function.
 
+TEXT ·emitLiteral(SB), NOSPLIT, $32-56
 
+	MOVD dst_base+0(FP), R8
 
+	MOVD lit_base+24(FP), R10
 
+	MOVD lit_len+32(FP), R3
 
+	MOVD R3, R6
 
+	MOVW R3, R4
 
+	SUBW $1, R4, R4
 
+
 
+	CMPW $60, R4
 
+	BLT  oneByte
 
+	CMPW $256, R4
 
+	BLT  twoBytes
 
+
 
+threeBytes:
 
+	MOVD $0xf4, R2
 
+	MOVB R2, 0(R8)
 
+	MOVW R4, 1(R8)
 
+	ADD  $3, R8, R8
 
+	ADD  $3, R6, R6
 
+	B    memmove
 
+
 
+twoBytes:
 
+	MOVD $0xf0, R2
 
+	MOVB R2, 0(R8)
 
+	MOVB R4, 1(R8)
 
+	ADD  $2, R8, R8
 
+	ADD  $2, R6, R6
 
+	B    memmove
 
+
 
+oneByte:
 
+	LSLW $2, R4, R4
 
+	MOVB R4, 0(R8)
 
+	ADD  $1, R8, R8
 
+	ADD  $1, R6, R6
 
+
 
+memmove:
 
+	MOVD R6, ret+48(FP)
 
+
 
+	// copy(dst[i:], lit)
 
+	//
 
+	// This means calling runtime·memmove(&dst[i], &lit[0], len(lit)), so we push
 
+	// R8, R10 and R3 as arguments.
 
+	MOVD R8, 8(RSP)
 
+	MOVD R10, 16(RSP)
 
+	MOVD R3, 24(RSP)
 
+	CALL runtime·memmove(SB)
 
+	RET
 
+
 
+// ----------------------------------------------------------------------------
 
+
 
+// func emitCopy(dst []byte, offset, length int) int
 
+//
 
+// All local variables fit into registers. The register allocation:
 
+//	- R3	length
 
+//	- R7	&dst[0]
 
+//	- R8	&dst[i]
 
+//	- R11	offset
 
+//
 
+// The unusual register allocation of local variables, such as R11 for the
 
+// offset, matches the allocation used at the call site in encodeBlock, which
 
+// makes it easier to manually inline this function.
 
+TEXT ·emitCopy(SB), NOSPLIT, $0-48
 
+	MOVD dst_base+0(FP), R8
 
+	MOVD R8, R7
 
+	MOVD offset+24(FP), R11
 
+	MOVD length+32(FP), R3
 
+
 
+loop0:
 
+	// for length >= 68 { etc }
 
+	CMPW $68, R3
 
+	BLT  step1
 
+
 
+	// Emit a length 64 copy, encoded as 3 bytes.
 
+	MOVD $0xfe, R2
 
+	MOVB R2, 0(R8)
 
+	MOVW R11, 1(R8)
 
+	ADD  $3, R8, R8
 
+	SUB  $64, R3, R3
 
+	B    loop0
 
+
 
+step1:
 
+	// if length > 64 { etc }
 
+	CMP $64, R3
 
+	BLE step2
 
+
 
+	// Emit a length 60 copy, encoded as 3 bytes.
 
+	MOVD $0xee, R2
 
+	MOVB R2, 0(R8)
 
+	MOVW R11, 1(R8)
 
+	ADD  $3, R8, R8
 
+	SUB  $60, R3, R3
 
+
 
+step2:
 
+	// if length >= 12 || offset >= 2048 { goto step3 }
 
+	CMP  $12, R3
 
+	BGE  step3
 
+	CMPW $2048, R11
 
+	BGE  step3
 
+
 
+	// Emit the remaining copy, encoded as 2 bytes.
 
+	MOVB R11, 1(R8)
 
+	LSRW $3, R11, R11
 
+	AND  $0xe0, R11, R11
 
+	SUB  $4, R3, R3
 
+	LSLW $2, R3
 
+	AND  $0xff, R3, R3
 
+	ORRW R3, R11, R11
 
+	ORRW $1, R11, R11
 
+	MOVB R11, 0(R8)
 
+	ADD  $2, R8, R8
 
+
 
+	// Return the number of bytes written.
 
+	SUB  R7, R8, R8
 
+	MOVD R8, ret+40(FP)
 
+	RET
 
+
 
+step3:
 
+	// Emit the remaining copy, encoded as 3 bytes.
 
+	SUB  $1, R3, R3
 
+	AND  $0xff, R3, R3
 
+	LSLW $2, R3, R3
 
+	ORRW $2, R3, R3
 
+	MOVB R3, 0(R8)
 
+	MOVW R11, 1(R8)
 
+	ADD  $3, R8, R8
 
+
 
+	// Return the number of bytes written.
 
+	SUB  R7, R8, R8
 
+	MOVD R8, ret+40(FP)
 
+	RET
 
+
 
+// ----------------------------------------------------------------------------
 
+
 
+// func extendMatch(src []byte, i, j int) int
 
+//
 
+// All local variables fit into registers. The register allocation:
 
+//	- R6	&src[0]
 
+//	- R7	&src[j]
 
+//	- R13	&src[len(src) - 8]
 
+//	- R14	&src[len(src)]
 
+//	- R15	&src[i]
 
+//
 
+// The unusual register allocation of local variables, such as R15 for a source
 
+// pointer, matches the allocation used at the call site in encodeBlock, which
 
+// makes it easier to manually inline this function.
 
+TEXT ·extendMatch(SB), NOSPLIT, $0-48
 
+	MOVD src_base+0(FP), R6
 
+	MOVD src_len+8(FP), R14
 
+	MOVD i+24(FP), R15
 
+	MOVD j+32(FP), R7
 
+	ADD  R6, R14, R14
 
+	ADD  R6, R15, R15
 
+	ADD  R6, R7, R7
 
+	MOVD R14, R13
 
+	SUB  $8, R13, R13
 
+
 
+cmp8:
 
+	// As long as we are 8 or more bytes before the end of src, we can load and
 
+	// compare 8 bytes at a time. If those 8 bytes are equal, repeat.
 
+	CMP  R13, R7
 
+	BHI  cmp1
 
+	MOVD (R15), R3
 
+	MOVD (R7), R4
 
+	CMP  R4, R3
 
+	BNE  bsf
 
+	ADD  $8, R15, R15
 
+	ADD  $8, R7, R7
 
+	B    cmp8
 
+
 
+bsf:
 
+	// If those 8 bytes were not equal, XOR the two 8 byte values, and return
 
+	// the index of the first byte that differs.
 
+	// RBIT reverses the bit order, then CLZ counts the leading zeros, the
 
+	// combination of which finds the least significant bit which is set.
 
+	// The arm64 architecture is little-endian, and the shift by 3 converts
 
+	// a bit index to a byte index.
 
+	EOR  R3, R4, R4
 
+	RBIT R4, R4
 
+	CLZ  R4, R4
 
+	ADD  R4>>3, R7, R7
 
+
 
+	// Convert from &src[ret] to ret.
 
+	SUB  R6, R7, R7
 
+	MOVD R7, ret+40(FP)
 
+	RET
 
+
 
+cmp1:
 
+	// In src's tail, compare 1 byte at a time.
 
+	CMP  R7, R14
 
+	BLS  extendMatchEnd
 
+	MOVB (R15), R3
 
+	MOVB (R7), R4
 
+	CMP  R4, R3
 
+	BNE  extendMatchEnd
 
+	ADD  $1, R15, R15
 
+	ADD  $1, R7, R7
 
+	B    cmp1
 
+
 
+extendMatchEnd:
 
+	// Convert from &src[ret] to ret.
 
+	SUB  R6, R7, R7
 
+	MOVD R7, ret+40(FP)
 
+	RET
 
+
 
+// ----------------------------------------------------------------------------
 
+
 
+// func encodeBlock(dst, src []byte) (d int)
 
+//
 
+// All local variables fit into registers, other than "var table". The register
 
+// allocation:
 
+//	- R3	.	.
 
+//	- R4	.	.
 
+//	- R5	64	shift
 
+//	- R6	72	&src[0], tableSize
 
+//	- R7	80	&src[s]
 
+//	- R8	88	&dst[d]
 
+//	- R9	96	sLimit
 
+//	- R10	.	&src[nextEmit]
 
+//	- R11	104	prevHash, currHash, nextHash, offset
 
+//	- R12	112	&src[base], skip
 
+//	- R13	.	&src[nextS], &src[len(src) - 8]
 
+//	- R14	.	len(src), bytesBetweenHashLookups, &src[len(src)], x
 
+//	- R15	120	candidate
 
+//	- R16	.	hash constant, 0x1e35a7bd
 
+//	- R17	.	&table
 
+//	- .  	128	table
 
+//
 
+// The second column (64, 72, etc) is the stack offset to spill the registers
 
+// when calling other functions. We could pack this slightly tighter, but it's
 
+// simpler to have a dedicated spill map independent of the function called.
 
+//
 
+// "var table [maxTableSize]uint16" takes up 32768 bytes of stack space. An
 
+// extra 64 bytes, to call other functions, and an extra 64 bytes, to spill
 
+// local variables (registers) during calls gives 32768 + 64 + 64 = 32896.
 
+TEXT ·encodeBlock(SB), 0, $32896-56
 
+	MOVD dst_base+0(FP), R8
 
+	MOVD src_base+24(FP), R7
 
+	MOVD src_len+32(FP), R14
 
+
 
+	// shift, tableSize := uint32(32-8), 1<<8
 
+	MOVD  $24, R5
 
+	MOVD  $256, R6
 
+	MOVW  $0xa7bd, R16
 
+	MOVKW $(0x1e35<<16), R16
 
+
 
+calcShift:
 
+	// for ; tableSize < maxTableSize && tableSize < len(src); tableSize *= 2 {
 
+	//	shift--
 
+	// }
 
+	MOVD $16384, R2
 
+	CMP  R2, R6
 
+	BGE  varTable
 
+	CMP  R14, R6
 
+	BGE  varTable
 
+	SUB  $1, R5, R5
 
+	LSL  $1, R6, R6
 
+	B    calcShift
 
+
 
+varTable:
 
+	// var table [maxTableSize]uint16
 
+	//
 
+	// In the asm code, unlike the Go code, we can zero-initialize only the
 
+	// first tableSize elements. Each uint16 element is 2 bytes and each
 
+	// iterations writes 64 bytes, so we can do only tableSize/32 writes
 
+	// instead of the 2048 writes that would zero-initialize all of table's
 
+	// 32768 bytes. This clear could overrun the first tableSize elements, but
 
+	// it won't overrun the allocated stack size.
 
+	ADD  $128, RSP, R17
 
+	MOVD R17, R4
 
+
 
+	// !!! R6 = &src[tableSize]
 
+	ADD R6<<1, R17, R6
 
+
 
+memclr:
 
+	STP.P (ZR, ZR), 64(R4)
 
+	STP   (ZR, ZR), -48(R4)
 
+	STP   (ZR, ZR), -32(R4)
 
+	STP   (ZR, ZR), -16(R4)
 
+	CMP   R4, R6
 
+	BHI   memclr
 
+
 
+	// !!! R6 = &src[0]
 
+	MOVD R7, R6
 
+
 
+	// sLimit := len(src) - inputMargin
 
+	MOVD R14, R9
 
+	SUB  $15, R9, R9
 
+
 
+	// !!! Pre-emptively spill R5, R6 and R9 to the stack. Their values don't
 
+	// change for the rest of the function.
 
+	MOVD R5, 64(RSP)
 
+	MOVD R6, 72(RSP)
 
+	MOVD R9, 96(RSP)
 
+
 
+	// nextEmit := 0
 
+	MOVD R6, R10
 
+
 
+	// s := 1
 
+	ADD $1, R7, R7
 
+
 
+	// nextHash := hash(load32(src, s), shift)
 
+	MOVW 0(R7), R11
 
+	MULW R16, R11, R11
 
+	LSRW R5, R11, R11
 
+
 
+outer:
 
+	// for { etc }
 
+
 
+	// skip := 32
 
+	MOVD $32, R12
 
+
 
+	// nextS := s
 
+	MOVD R7, R13
 
+
 
+	// candidate := 0
 
+	MOVD $0, R15
 
+
 
+inner0:
 
+	// for { etc }
 
+
 
+	// s := nextS
 
+	MOVD R13, R7
 
+
 
+	// bytesBetweenHashLookups := skip >> 5
 
+	MOVD R12, R14
 
+	LSR  $5, R14, R14
 
+
 
+	// nextS = s + bytesBetweenHashLookups
 
+	ADD R14, R13, R13
 
+
 
+	// skip += bytesBetweenHashLookups
 
+	ADD R14, R12, R12
 
+
 
+	// if nextS > sLimit { goto emitRemainder }
 
+	MOVD R13, R3
 
+	SUB  R6, R3, R3
 
+	CMP  R9, R3
 
+	BHI  emitRemainder
 
+
 
+	// candidate = int(table[nextHash])
 
+	MOVHU 0(R17)(R11<<1), R15
 
+
 
+	// table[nextHash] = uint16(s)
 
+	MOVD R7, R3
 
+	SUB  R6, R3, R3
 
+
 
+	MOVH R3, 0(R17)(R11<<1)
 
+
 
+	// nextHash = hash(load32(src, nextS), shift)
 
+	MOVW 0(R13), R11
 
+	MULW R16, R11
 
+	LSRW R5, R11, R11
 
+
 
+	// if load32(src, s) != load32(src, candidate) { continue } break
 
+	MOVW 0(R7), R3
 
+	MOVW (R6)(R15*1), R4
 
+	CMPW R4, R3
 
+	BNE  inner0
 
+
 
+fourByteMatch:
 
+	// As per the encode_other.go code:
 
+	//
 
+	// A 4-byte match has been found. We'll later see etc.
 
+
 
+	// !!! Jump to a fast path for short (<= 16 byte) literals. See the comment
 
+	// on inputMargin in encode.go.
 
+	MOVD R7, R3
 
+	SUB  R10, R3, R3
 
+	CMP  $16, R3
 
+	BLE  emitLiteralFastPath
 
+
 
+	// ----------------------------------------
 
+	// Begin inline of the emitLiteral call.
 
+	//
 
+	// d += emitLiteral(dst[d:], src[nextEmit:s])
 
+
 
+	MOVW R3, R4
 
+	SUBW $1, R4, R4
 
+
 
+	MOVW $60, R2
 
+	CMPW R2, R4
 
+	BLT  inlineEmitLiteralOneByte
 
+	MOVW $256, R2
 
+	CMPW R2, R4
 
+	BLT  inlineEmitLiteralTwoBytes
 
+
 
+inlineEmitLiteralThreeBytes:
 
+	MOVD $0xf4, R1
 
+	MOVB R1, 0(R8)
 
+	MOVW R4, 1(R8)
 
+	ADD  $3, R8, R8
 
+	B    inlineEmitLiteralMemmove
 
+
 
+inlineEmitLiteralTwoBytes:
 
+	MOVD $0xf0, R1
 
+	MOVB R1, 0(R8)
 
+	MOVB R4, 1(R8)
 
+	ADD  $2, R8, R8
 
+	B    inlineEmitLiteralMemmove
 
+
 
+inlineEmitLiteralOneByte:
 
+	LSLW $2, R4, R4
 
+	MOVB R4, 0(R8)
 
+	ADD  $1, R8, R8
 
+
 
+inlineEmitLiteralMemmove:
 
+	// Spill local variables (registers) onto the stack; call; unspill.
 
+	//
 
+	// copy(dst[i:], lit)
 
+	//
 
+	// This means calling runtime·memmove(&dst[i], &lit[0], len(lit)), so we push
 
+	// R8, R10 and R3 as arguments.
 
+	MOVD R8, 8(RSP)
 
+	MOVD R10, 16(RSP)
 
+	MOVD R3, 24(RSP)
 
+
 
+	// Finish the "d +=" part of "d += emitLiteral(etc)".
 
+	ADD   R3, R8, R8
 
+	MOVD  R7, 80(RSP)
 
+	MOVD  R8, 88(RSP)
 
+	MOVD  R15, 120(RSP)
 
+	CALL  runtime·memmove(SB)
 
+	MOVD  64(RSP), R5
 
+	MOVD  72(RSP), R6
 
+	MOVD  80(RSP), R7
 
+	MOVD  88(RSP), R8
 
+	MOVD  96(RSP), R9
 
+	MOVD  120(RSP), R15
 
+	ADD   $128, RSP, R17
 
+	MOVW  $0xa7bd, R16
 
+	MOVKW $(0x1e35<<16), R16
 
+	B     inner1
 
+
 
+inlineEmitLiteralEnd:
 
+	// End inline of the emitLiteral call.
 
+	// ----------------------------------------
 
+
 
+emitLiteralFastPath:
 
+	// !!! Emit the 1-byte encoding "uint8(len(lit)-1)<<2".
 
+	MOVB R3, R4
 
+	SUBW $1, R4, R4
 
+	AND  $0xff, R4, R4
 
+	LSLW $2, R4, R4
 
+	MOVB R4, (R8)
 
+	ADD  $1, R8, R8
 
+
 
+	// !!! Implement the copy from lit to dst as a 16-byte load and store.
 
+	// (Encode's documentation says that dst and src must not overlap.)
 
+	//
 
+	// This always copies 16 bytes, instead of only len(lit) bytes, but that's
 
+	// OK. Subsequent iterations will fix up the overrun.
 
+	//
 
+	// Note that on arm64, it is legal and cheap to issue unaligned 8-byte or
 
+	// 16-byte loads and stores. This technique probably wouldn't be as
 
+	// effective on architectures that are fussier about alignment.
 
+	LDP 0(R10), (R0, R1)
 
+	STP (R0, R1), 0(R8)
 
+	ADD R3, R8, R8
 
+
 
+inner1:
 
+	// for { etc }
 
+
 
+	// base := s
 
+	MOVD R7, R12
 
+
 
+	// !!! offset := base - candidate
 
+	MOVD R12, R11
 
+	SUB  R15, R11, R11
 
+	SUB  R6, R11, R11
 
+
 
+	// ----------------------------------------
 
+	// Begin inline of the extendMatch call.
 
+	//
 
+	// s = extendMatch(src, candidate+4, s+4)
 
+
 
+	// !!! R14 = &src[len(src)]
 
+	MOVD src_len+32(FP), R14
 
+	ADD  R6, R14, R14
 
+
 
+	// !!! R13 = &src[len(src) - 8]
 
+	MOVD R14, R13
 
+	SUB  $8, R13, R13
 
+
 
+	// !!! R15 = &src[candidate + 4]
 
+	ADD $4, R15, R15
 
+	ADD R6, R15, R15
 
+
 
+	// !!! s += 4
 
+	ADD $4, R7, R7
 
+
 
+inlineExtendMatchCmp8:
 
+	// As long as we are 8 or more bytes before the end of src, we can load and
 
+	// compare 8 bytes at a time. If those 8 bytes are equal, repeat.
 
+	CMP  R13, R7
 
+	BHI  inlineExtendMatchCmp1
 
+	MOVD (R15), R3
 
+	MOVD (R7), R4
 
+	CMP  R4, R3
 
+	BNE  inlineExtendMatchBSF
 
+	ADD  $8, R15, R15
 
+	ADD  $8, R7, R7
 
+	B    inlineExtendMatchCmp8
 
+
 
+inlineExtendMatchBSF:
 
+	// If those 8 bytes were not equal, XOR the two 8 byte values, and return
 
+	// the index of the first byte that differs.
 
+	// RBIT reverses the bit order, then CLZ counts the leading zeros, the
 
+	// combination of which finds the least significant bit which is set.
 
+	// The arm64 architecture is little-endian, and the shift by 3 converts
 
+	// a bit index to a byte index.
 
+	EOR  R3, R4, R4
 
+	RBIT R4, R4
 
+	CLZ  R4, R4
 
+	ADD  R4>>3, R7, R7
 
+	B    inlineExtendMatchEnd
 
+
 
+inlineExtendMatchCmp1:
 
+	// In src's tail, compare 1 byte at a time.
 
+	CMP  R7, R14
 
+	BLS  inlineExtendMatchEnd
 
+	MOVB (R15), R3
 
+	MOVB (R7), R4
 
+	CMP  R4, R3
 
+	BNE  inlineExtendMatchEnd
 
+	ADD  $1, R15, R15
 
+	ADD  $1, R7, R7
 
+	B    inlineExtendMatchCmp1
 
+
 
+inlineExtendMatchEnd:
 
+	// End inline of the extendMatch call.
 
+	// ----------------------------------------
 
+
 
+	// ----------------------------------------
 
+	// Begin inline of the emitCopy call.
 
+	//
 
+	// d += emitCopy(dst[d:], base-candidate, s-base)
 
+
 
+	// !!! length := s - base
 
+	MOVD R7, R3
 
+	SUB  R12, R3, R3
 
+
 
+inlineEmitCopyLoop0:
 
+	// for length >= 68 { etc }
 
+	MOVW $68, R2
 
+	CMPW R2, R3
 
+	BLT  inlineEmitCopyStep1
 
+
 
+	// Emit a length 64 copy, encoded as 3 bytes.
 
+	MOVD $0xfe, R1
 
+	MOVB R1, 0(R8)
 
+	MOVW R11, 1(R8)
 
+	ADD  $3, R8, R8
 
+	SUBW $64, R3, R3
 
+	B    inlineEmitCopyLoop0
 
+
 
+inlineEmitCopyStep1:
 
+	// if length > 64 { etc }
 
+	MOVW $64, R2
 
+	CMPW R2, R3
 
+	BLE  inlineEmitCopyStep2
 
+
 
+	// Emit a length 60 copy, encoded as 3 bytes.
 
+	MOVD $0xee, R1
 
+	MOVB R1, 0(R8)
 
+	MOVW R11, 1(R8)
 
+	ADD  $3, R8, R8
 
+	SUBW $60, R3, R3
 
+
 
+inlineEmitCopyStep2:
 
+	// if length >= 12 || offset >= 2048 { goto inlineEmitCopyStep3 }
 
+	MOVW $12, R2
 
+	CMPW R2, R3
 
+	BGE  inlineEmitCopyStep3
 
+	MOVW $2048, R2
 
+	CMPW R2, R11
 
+	BGE  inlineEmitCopyStep3
 
+
 
+	// Emit the remaining copy, encoded as 2 bytes.
 
+	MOVB R11, 1(R8)
 
+	LSRW $8, R11, R11
 
+	LSLW $5, R11, R11
 
+	SUBW $4, R3, R3
 
+	AND  $0xff, R3, R3
 
+	LSLW $2, R3, R3
 
+	ORRW R3, R11, R11
 
+	ORRW $1, R11, R11
 
+	MOVB R11, 0(R8)
 
+	ADD  $2, R8, R8
 
+	B    inlineEmitCopyEnd
 
+
 
+inlineEmitCopyStep3:
 
+	// Emit the remaining copy, encoded as 3 bytes.
 
+	SUBW $1, R3, R3
 
+	LSLW $2, R3, R3
 
+	ORRW $2, R3, R3
 
+	MOVB R3, 0(R8)
 
+	MOVW R11, 1(R8)
 
+	ADD  $3, R8, R8
 
+
 
+inlineEmitCopyEnd:
 
+	// End inline of the emitCopy call.
 
+	// ----------------------------------------
 
+
 
+	// nextEmit = s
 
+	MOVD R7, R10
 
+
 
+	// if s >= sLimit { goto emitRemainder }
 
+	MOVD R7, R3
 
+	SUB  R6, R3, R3
 
+	CMP  R3, R9
 
+	BLS  emitRemainder
 
+
 
+	// As per the encode_other.go code:
 
+	//
 
+	// We could immediately etc.
 
+
 
+	// x := load64(src, s-1)
 
+	MOVD -1(R7), R14
 
+
 
+	// prevHash := hash(uint32(x>>0), shift)
 
+	MOVW R14, R11
 
+	MULW R16, R11, R11
 
+	LSRW R5, R11, R11
 
+
 
+	// table[prevHash] = uint16(s-1)
 
+	MOVD R7, R3
 
+	SUB  R6, R3, R3
 
+	SUB  $1, R3, R3
 
+
 
+	MOVHU R3, 0(R17)(R11<<1)
 
+
 
+	// currHash := hash(uint32(x>>8), shift)
 
+	LSR  $8, R14, R14
 
+	MOVW R14, R11
 
+	MULW R16, R11, R11
 
+	LSRW R5, R11, R11
 
+
 
+	// candidate = int(table[currHash])
 
+	MOVHU 0(R17)(R11<<1), R15
 
+
 
+	// table[currHash] = uint16(s)
 
+	ADD   $1, R3, R3
 
+	MOVHU R3, 0(R17)(R11<<1)
 
+
 
+	// if uint32(x>>8) == load32(src, candidate) { continue }
 
+	MOVW (R6)(R15*1), R4
 
+	CMPW R4, R14
 
+	BEQ  inner1
 
+
 
+	// nextHash = hash(uint32(x>>16), shift)
 
+	LSR  $8, R14, R14
 
+	MOVW R14, R11
 
+	MULW R16, R11, R11
 
+	LSRW R5, R11, R11
 
+
 
+	// s++
 
+	ADD $1, R7, R7
 
+
 
+	// break out of the inner1 for loop, i.e. continue the outer loop.
 
+	B outer
 
+
 
+emitRemainder:
 
+	// if nextEmit < len(src) { etc }
 
+	MOVD src_len+32(FP), R3
 
+	ADD  R6, R3, R3
 
+	CMP  R3, R10
 
+	BEQ  encodeBlockEnd
 
+
 
+	// d += emitLiteral(dst[d:], src[nextEmit:])
 
+	//
 
+	// Push args.
 
+	MOVD R8, 8(RSP)
 
+	MOVD $0, 16(RSP)  // Unnecessary, as the callee ignores it, but conservative.
 
+	MOVD $0, 24(RSP)  // Unnecessary, as the callee ignores it, but conservative.
 
+	MOVD R10, 32(RSP)
 
+	SUB  R10, R3, R3
 
+	MOVD R3, 40(RSP)
 
+	MOVD R3, 48(RSP)  // Unnecessary, as the callee ignores it, but conservative.
 
+
 
+	// Spill local variables (registers) onto the stack; call; unspill.
 
+	MOVD R8, 88(RSP)
 
+	CALL ·emitLiteral(SB)
 
+	MOVD 88(RSP), R8
 
+
 
+	// Finish the "d +=" part of "d += emitLiteral(etc)".
 
+	MOVD 56(RSP), R1
 
+	ADD  R1, R8, R8
 
+
 
+encodeBlockEnd:
 
+	MOVD dst_base+0(FP), R3
 
+	SUB  R3, R8, R8
 
+	MOVD R8, d+48(FP)
 
+	RET

+ 1 - 0
vendor/github.com/klauspost/compress/snappy/encode_amd64.go → vendor/github.com/golang/snappy/encode_asm.go
Vedi File 

@@ -5,6 +5,7 @@
 
 // +build !appengine
 
 // +build gc
 
 // +build !noasm
 
+// +build amd64 arm64
 
 
 package snappy

+ 1 - 1
vendor/github.com/klauspost/compress/snappy/encode_other.go → vendor/github.com/golang/snappy/encode_other.go
Vedi File 

@@ -2,7 +2,7 @@
 
 // Use of this source code is governed by a BSD-style
 
 // license that can be found in the LICENSE file.
 
 
-// +build !amd64 appengine !gc noasm
 
+// +build !amd64,!arm64 appengine !gc noasm
 
 
 package snappy

+ 2 - 2
vendor/github.com/klauspost/compress/snappy/snappy.go → vendor/github.com/golang/snappy/snappy.go
Vedi File 

@@ -17,7 +17,7 @@
 
 //
 
 // The canonical, C++ implementation is at https://github.com/google/snappy and
 
 // it only implements the block format.
 
-package snappy
 
+package snappy // import "github.com/golang/snappy"
 
 
 import (
 
 	"hash/crc32"
 
@@ -94,5 +94,5 @@ var crcTable = crc32.MakeTable(crc32.Castagnoli)
 
 // https://github.com/google/snappy/blob/master/framing_format.txt
 
 func crc(b []byte) uint32 {
 
 	c := crc32.Update(0, crcTable, b)
 
-	return c>>15 | c<<17 + 0xa282ead8
 
+	return uint32(c>>15|c<<17) + 0xa282ead8
 
 }

+ 1 - 1
vendor/github.com/google/uuid/README.md
Vedi File 

@@ -16,4 +16,4 @@ change is the ability to represent an invalid UUID (vs a NIL UUID).
 
 
 Full `go doc` style documentation for the package can be viewed online without
 
 installing this package by using the GoDoc site here: 
-http://godoc.org/github.com/google/uuid
 
+http://pkg.go.dev/github.com/google/uuid

+ 2 - 2
vendor/github.com/google/uuid/hash.go
Vedi File 

@@ -26,8 +26,8 @@ var (
 
 // NewMD5 and NewSHA1.
 
 func NewHash(h hash.Hash, space UUID, data []byte, version int) UUID {
 
 	h.Reset()
 
-	h.Write(space[:])
 
-	h.Write(data)
 
+	h.Write(space[:]) //nolint:errcheck
 
+	h.Write(data)     //nolint:errcheck
 
 	s := h.Sum(nil)
 
 	var uuid UUID
 
 	copy(uuid[:], s)

+ 4 - 3
vendor/github.com/google/uuid/marshal.go
Vedi File 

@@ -16,10 +16,11 @@ func (uuid UUID) MarshalText() ([]byte, error) {
 
 // UnmarshalText implements encoding.TextUnmarshaler.
 
 func (uuid *UUID) UnmarshalText(data []byte) error {
 
 	id, err := ParseBytes(data)
 
-	if err == nil {
 
-		*uuid = id
 
+	if err != nil {
 
+		return err
 
 	}
 
-	return err
 
+	*uuid = id
 
+	return nil
 
 }
 
 
 // MarshalBinary implements encoding.BinaryMarshaler.

+ 118 - 0
vendor/github.com/google/uuid/null.go
Vedi File 

@@ -0,0 +1,118 @@
 
+// Copyright 2021 Google Inc.  All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+package uuid
 
+
 
+import (
 
+	"bytes"
 
+	"database/sql/driver"
 
+	"encoding/json"
 
+	"fmt"
 
+)
 
+
 
+var jsonNull = []byte("null")
 
+
 
+// NullUUID represents a UUID that may be null.
 
+// NullUUID implements the SQL driver.Scanner interface so
 
+// it can be used as a scan destination:
 
+//
 
+//  var u uuid.NullUUID
 
+//  err := db.QueryRow("SELECT name FROM foo WHERE id=?", id).Scan(&u)
 
+//  ...
 
+//  if u.Valid {
 
+//     // use u.UUID
 
+//  } else {
 
+//     // NULL value
 
+//  }
 
+//
 
+type NullUUID struct {
 
+	UUID  UUID
 
+	Valid bool // Valid is true if UUID is not NULL
 
+}
 
+
 
+// Scan implements the SQL driver.Scanner interface.
 
+func (nu *NullUUID) Scan(value interface{}) error {
 
+	if value == nil {
 
+		nu.UUID, nu.Valid = Nil, false
 
+		return nil
 
+	}
 
+
 
+	err := nu.UUID.Scan(value)
 
+	if err != nil {
 
+		nu.Valid = false
 
+		return err
 
+	}
 
+
 
+	nu.Valid = true
 
+	return nil
 
+}
 
+
 
+// Value implements the driver Valuer interface.
 
+func (nu NullUUID) Value() (driver.Value, error) {
 
+	if !nu.Valid {
 
+		return nil, nil
 
+	}
 
+	// Delegate to UUID Value function
 
+	return nu.UUID.Value()
 
+}
 
+
 
+// MarshalBinary implements encoding.BinaryMarshaler.
 
+func (nu NullUUID) MarshalBinary() ([]byte, error) {
 
+	if nu.Valid {
 
+		return nu.UUID[:], nil
 
+	}
 
+
 
+	return []byte(nil), nil
 
+}
 
+
 
+// UnmarshalBinary implements encoding.BinaryUnmarshaler.
 
+func (nu *NullUUID) UnmarshalBinary(data []byte) error {
 
+	if len(data) != 16 {
 
+		return fmt.Errorf("invalid UUID (got %d bytes)", len(data))
 
+	}
 
+	copy(nu.UUID[:], data)
 
+	nu.Valid = true
 
+	return nil
 
+}
 
+
 
+// MarshalText implements encoding.TextMarshaler.
 
+func (nu NullUUID) MarshalText() ([]byte, error) {
 
+	if nu.Valid {
 
+		return nu.UUID.MarshalText()
 
+	}
 
+
 
+	return jsonNull, nil
 
+}
 
+
 
+// UnmarshalText implements encoding.TextUnmarshaler.
 
+func (nu *NullUUID) UnmarshalText(data []byte) error {
 
+	id, err := ParseBytes(data)
 
+	if err != nil {
 
+		nu.Valid = false
 
+		return err
 
+	}
 
+	nu.UUID = id
 
+	nu.Valid = true
 
+	return nil
 
+}
 
+
 
+// MarshalJSON implements json.Marshaler.
 
+func (nu NullUUID) MarshalJSON() ([]byte, error) {
 
+	if nu.Valid {
 
+		return json.Marshal(nu.UUID)
 
+	}
 
+
 
+	return jsonNull, nil
 
+}
 
+
 
+// UnmarshalJSON implements json.Unmarshaler.
 
+func (nu *NullUUID) UnmarshalJSON(data []byte) error {
 
+	if bytes.Equal(data, jsonNull) {
 
+		*nu = NullUUID{}
 
+		return nil // valid null UUID
 
+	}
 
+	err := json.Unmarshal(data, &nu.UUID)
 
+	nu.Valid = err == nil
 
+	return err
 
+}

+ 1 - 1
vendor/github.com/google/uuid/sql.go
Vedi File 

@@ -9,7 +9,7 @@ import (
 
 	"fmt"
 
 )
 
 
-// Scan implements sql.Scanner so UUIDs can be read from databases transparently
 
+// Scan implements sql.Scanner so UUIDs can be read from databases transparently.
 
 // Currently, database types that map to string and []byte are supported. Please
 
 // consult database-specific driver documentation for matching types.
 
 func (uuid *UUID) Scan(src interface{}) error {

+ 52 - 3
vendor/github.com/google/uuid/uuid.go
Vedi File 

@@ -12,6 +12,7 @@ import (
 
 	"fmt"
 
 	"io"
 
 	"strings"
 
+	"sync"
 
 )
 
 
 // A UUID is a 128 bit (16 byte) Universal Unique IDentifier as defined in RFC
 
@@ -33,7 +34,27 @@ const (
 
 	Future                    // Reserved for future definition.
 
 )
 
 
-var rander = rand.Reader // random function
 
+const randPoolSize = 16 * 16
 
+
 
+var (
 
+	rander      = rand.Reader // random function
 
+	poolEnabled = false
 
+	poolMu      sync.Mutex
 
+	poolPos     = randPoolSize     // protected with poolMu
 
+	pool        [randPoolSize]byte // protected with poolMu
 
+)
 
+
 
+type invalidLengthError struct{ len int }
 
+
 
+func (err invalidLengthError) Error() string {
 
+	return fmt.Sprintf("invalid UUID length: %d", err.len)
 
+}
 
+
 
+// IsInvalidLengthError is matcher function for custom error invalidLengthError
 
+func IsInvalidLengthError(err error) bool {
 
+	_, ok := err.(invalidLengthError)
 
+	return ok
 
+}
 
 
 // Parse decodes s into a UUID or returns an error.  Both the standard UUID
 
 // forms of xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx and
 
@@ -68,7 +89,7 @@ func Parse(s string) (UUID, error) {
 
 		}
 
 		return uuid, nil
 
 	default:
 
-		return uuid, fmt.Errorf("invalid UUID length: %d", len(s))
 
+		return uuid, invalidLengthError{len(s)}
 
 	}
 
 	// s is now at least 36 bytes long
 
 	// it must be of the form  xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx
 
@@ -112,7 +133,7 @@ func ParseBytes(b []byte) (UUID, error) {
 
 		}
 
 		return uuid, nil
 
 	default:
 
-		return uuid, fmt.Errorf("invalid UUID length: %d", len(b))
 
+		return uuid, invalidLengthError{len(b)}
 
 	}
 
 	// s is now at least 36 bytes long
 
 	// it must be of the form  xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx
 
@@ -243,3 +264,31 @@ func SetRand(r io.Reader) {
 
 	}
 
 	rander = r
 
 }
 
+
 
+// EnableRandPool enables internal randomness pool used for Random
 
+// (Version 4) UUID generation. The pool contains random bytes read from
 
+// the random number generator on demand in batches. Enabling the pool
 
+// may improve the UUID generation throughput significantly.
 
+//
 
+// Since the pool is stored on the Go heap, this feature may be a bad fit
 
+// for security sensitive applications.
 
+//
 
+// Both EnableRandPool and DisableRandPool are not thread-safe and should
 
+// only be called when there is no possibility that New or any other
 
+// UUID Version 4 generation function will be called concurrently.
 
+func EnableRandPool() {
 
+	poolEnabled = true
 
+}
 
+
 
+// DisableRandPool disables the randomness pool if it was previously
 
+// enabled with EnableRandPool.
 
+//
 
+// Both EnableRandPool and DisableRandPool are not thread-safe and should
 
+// only be called when there is no possibility that New or any other
 
+// UUID Version 4 generation function will be called concurrently.
 
+func DisableRandPool() {
 
+	poolEnabled = false
 
+	defer poolMu.Unlock()
 
+	poolMu.Lock()
 
+	poolPos = randPoolSize
 
+}

+ 6 - 6
vendor/github.com/google/uuid/version1.go
Vedi File 

@@ -17,12 +17,6 @@ import (
 
 //
 
 // In most cases, New should be used.
 
 func NewUUID() (UUID, error) {
 
-	nodeMu.Lock()
 
-	if nodeID == zeroID {
 
-		setNodeInterface("")
 
-	}
 
-	nodeMu.Unlock()
 
-
 
 	var uuid UUID
 
 	now, seq, err := GetTime()
 
 	if err != nil {
 
@@ -38,7 +32,13 @@ func NewUUID() (UUID, error) {
 
 	binary.BigEndian.PutUint16(uuid[4:], timeMid)
 
 	binary.BigEndian.PutUint16(uuid[6:], timeHi)
 
 	binary.BigEndian.PutUint16(uuid[8:], seq)
 
+
 
+	nodeMu.Lock()
 
+	if nodeID == zeroID {
 
+		setNodeInterface("")
 
+	}
 
 	copy(uuid[10:], nodeID[:])
 
+	nodeMu.Unlock()
 
 
 	return uuid, nil
 
 }

+ 39 - 1
vendor/github.com/google/uuid/version4.go
Vedi File 

@@ -14,11 +14,21 @@ func New() UUID {
 
 	return Must(NewRandom())
 
 }
 
 
+// NewString creates a new random UUID and returns it as a string or panics.
 
+// NewString is equivalent to the expression
 
+//
 
+//    uuid.New().String()
 
+func NewString() string {
 
+	return Must(NewRandom()).String()
 
+}
 
+
 
 // NewRandom returns a Random (Version 4) UUID.
 
 //
 
 // The strength of the UUIDs is based on the strength of the crypto/rand
 
 // package.
 
 //
 
+// Uses the randomness pool if it was enabled with EnableRandPool.
 
+//
 
 // A note about uniqueness derived from the UUID Wikipedia entry:
 
 //
 
 //  Randomly generated UUIDs have 122 random bits.  One's annual risk of being
 
@@ -27,8 +37,16 @@ func New() UUID {
 
 //  equivalent to the odds of creating a few tens of trillions of UUIDs in a
 
 //  year and having one duplicate.
 
 func NewRandom() (UUID, error) {
 
+	if !poolEnabled {
 
+		return NewRandomFromReader(rander)
 
+	}
 
+	return newRandomFromPool()
 
+}
 
+
 
+// NewRandomFromReader returns a UUID based on bytes read from a given io.Reader.
 
+func NewRandomFromReader(r io.Reader) (UUID, error) {
 
 	var uuid UUID
 
-	_, err := io.ReadFull(rander, uuid[:])
 
+	_, err := io.ReadFull(r, uuid[:])
 
 	if err != nil {
 
 		return Nil, err
 
 	}
 
@@ -36,3 +54,23 @@ func NewRandom() (UUID, error) {
 
 	uuid[8] = (uuid[8] & 0x3f) | 0x80 // Variant is 10
 
 	return uuid, nil
 
 }
 
+
 
+func newRandomFromPool() (UUID, error) {
 
+	var uuid UUID
 
+	poolMu.Lock()
 
+	if poolPos == randPoolSize {
 
+		_, err := io.ReadFull(rander, pool[:])
 
+		if err != nil {
 
+			poolMu.Unlock()
 
+			return Nil, err
 
+		}
 
+		poolPos = 0
 
+	}
 
+	copy(uuid[:], pool[poolPos:(poolPos+16)])
 
+	poolPos += 16
 
+	poolMu.Unlock()
 
+
 
+	uuid[6] = (uuid[6] & 0x0f) | 0x40 // Version 4
 
+	uuid[8] = (uuid[8] & 0x3f) | 0x80 // Variant is 10
 
+	return uuid, nil
 
+}

+ 4 - 3
vendor/github.com/grpc-ecosystem/go-grpc-middleware/.travis.yml
Vedi File 

@@ -1,8 +1,9 @@
 
 sudo: false
 
 language: go
 
 go:
 
-  - 1.11.x
 
-  - 1.12.x
 
+  - 1.13.x
 
+  - 1.14.x
 
+  - 1.15.x
 
 
 env:
 
   global:
 
@@ -10,6 +11,6 @@ env:
 
 
 script:
 
  - make test
 
- 
+
 
 after_success:
 
   - bash <(curl -s https://codecov.io/bash)

+ 4 - 3
vendor/github.com/grpc-ecosystem/go-grpc-middleware/README.md
Vedi File 

@@ -15,7 +15,7 @@
 
 
 [gRPC Go](https://github.com/grpc/grpc-go) recently acquired support for
 
 Interceptors, i.e. [middleware](https://medium.com/@matryer/writing-middleware-in-golang-and-how-go-makes-it-so-much-fun-4375c1246e81#.gv7tdlghs) 
-that is executed either on the gRPC Server before the request is passed onto the user's application logic, or on the gRPC client either around the user call. It is a perfect way to implement
 
+that is executed either on the gRPC Server before the request is passed onto the user's application logic, or on the gRPC client around the user call. It is a perfect way to implement
 
 common patterns: auth, logging, message, validation, retries or monitoring.
 
 
 These are generic building blocks that make it easy to build multiple microservices easily.
 
@@ -29,20 +29,20 @@ import "github.com/grpc-ecosystem/go-grpc-middleware"
 
 
 myServer := grpc.NewServer(
 
     grpc.StreamInterceptor(grpc_middleware.ChainStreamServer(
 
+        grpc_recovery.StreamServerInterceptor(),
 
         grpc_ctxtags.StreamServerInterceptor(),
 
         grpc_opentracing.StreamServerInterceptor(),
 
         grpc_prometheus.StreamServerInterceptor,
 
         grpc_zap.StreamServerInterceptor(zapLogger),
 
         grpc_auth.StreamServerInterceptor(myAuthFunction),
 
-        grpc_recovery.StreamServerInterceptor(),
 
     )),
 
     grpc.UnaryInterceptor(grpc_middleware.ChainUnaryServer(
 
+        grpc_recovery.UnaryServerInterceptor(),
 
         grpc_ctxtags.UnaryServerInterceptor(),
 
         grpc_opentracing.UnaryServerInterceptor(),
 
         grpc_prometheus.UnaryServerInterceptor,
 
         grpc_zap.UnaryServerInterceptor(zapLogger),
 
         grpc_auth.UnaryServerInterceptor(myAuthFunction),
 
-        grpc_recovery.UnaryServerInterceptor(),
 
     )),
 
 )
 
 ```
 
@@ -59,6 +59,7 @@ myServer := grpc.NewServer(
 
    * [`grpc_zap`](logging/zap/) - integration of [zap](https://github.com/uber-go/zap) logging library into gRPC handlers.
 
    * [`grpc_logrus`](logging/logrus/) - integration of [logrus](https://github.com/sirupsen/logrus) logging library into gRPC handlers.
 
    * [`grpc_kit`](logging/kit/) - integration of [go-kit](https://github.com/go-kit/kit/tree/master/log) logging library into gRPC handlers.
 
+   * [`grpc_grpc_logsettable`](logging/settable/) - a wrapper around `grpclog.LoggerV2` that allows to replace loggers in runtime (thread-safe).
 
 
 #### Monitoring
 
    * [`grpc_prometheus`⚡](https://github.com/grpc-ecosystem/go-grpc-prometheus) - Prometheus client-side and server-side monitoring middleware

+ 2 - 2
vendor/github.com/grpc-ecosystem/go-grpc-middleware/doc.go
Vedi File 

@@ -23,7 +23,7 @@ server chaining:
 
 
 	myServer := grpc.NewServer(
 
 	    grpc.StreamInterceptor(grpc_middleware.ChainStreamServer(loggingStream, monitoringStream, authStream)),
 
-	    grpc.UnaryInterceptor(grpc_middleware.ChainUnaryServer(loggingUnary, monitoringUnary, authUnary),
 
+	    grpc.UnaryInterceptor(grpc_middleware.ChainUnaryServer(loggingUnary, monitoringUnary, authUnary)),
 
 	)
 
 
 These interceptors will be executed from left to right: logging, monitoring and auth.
 
@@ -63,7 +63,7 @@ needed. For example:
 
 	func FakeAuthStreamingInterceptor(srv interface{}, stream grpc.ServerStream, info *grpc.StreamServerInfo, handler grpc.StreamHandler) error {
 
 	   newStream := grpc_middleware.WrapServerStream(stream)
 
 	   newStream.WrappedContext = context.WithValue(ctx, "user_id", "john@example.com")
 
-	   return handler(srv, stream)
 
+	   return handler(srv, newStream)
 
 	}
 
 */
 
 package grpc_middleware

+ 0 - 1
vendor/github.com/klauspost/compress/fse/compress.go
Vedi File 

@@ -92,7 +92,6 @@ func (c *cState) init(bw *bitWriter, ct *cTable, tableLog uint8, first symbolTra
 
 	im := int32((nbBitsOut << 16) - first.deltaNbBits)
 
 	lu := (im >> nbBitsOut) + first.deltaFindState
 
 	c.state = c.stateTable[lu]
 
-	return
 
 }
 
 
 // encode the output symbol provided and write it to the bitstream.

+ 0 - 1
vendor/github.com/klauspost/compress/huff0/compress.go
Vedi File 

@@ -536,7 +536,6 @@ func (s *Scratch) huffSort() {
 
 		}
 
 		nodes[pos&huffNodesMask] = nodeElt{count: c, symbol: byte(n)}
 
 	}
 
-	return
 
 }
 
 
 func (s *Scratch) setMaxHeight(lastNonNull int) uint8 {

+ 0 - 2
vendor/github.com/klauspost/compress/snappy/runbench.cmd
Vedi File 

@@ -1,2 +0,0 @@
 
-del old.txt
 
-go test -bench=. >>old.txt && go test -bench=. >>old.txt && go test -bench=. >>old.txt && benchstat -delta-test=ttest old.txt new.txt

+ 30 - 16
vendor/github.com/klauspost/compress/zstd/README.md
Vedi File 

@@ -16,8 +16,7 @@ Currently the package is heavily optimized for 64 bit processors and will be sig
 
 
 Install using `go get -u github.com/klauspost/compress`. The package is located in `github.com/klauspost/compress/zstd`.
 
 
-Godoc Documentation: https://godoc.org/github.com/klauspost/compress/zstd
 
-
 
+[![Go Reference](https://pkg.go.dev/badge/github.com/klauspost/compress/zstd.svg)](https://pkg.go.dev/github.com/klauspost/compress/zstd)
 
 
 ## Compressor
 
 
@@ -152,8 +151,8 @@ This package:
 
 file    out     level   insize      outsize     millis  mb/s
 
 silesia.tar zskp    1   211947520   73101992    643     313.87
 
 silesia.tar zskp    2   211947520   67504318    969     208.38
 
-silesia.tar zskp    3   211947520   65177448    1899    106.44
 
-silesia.tar zskp    4   211947520   61381950    8115    24.91
 
+silesia.tar zskp    3   211947520   64595893    2007    100.68
 
+silesia.tar zskp    4   211947520   60995370    7691    26.28
 
 
 cgo zstd:
 
 silesia.tar zstd    1   211947520   73605392    543     371.56
 
@@ -171,8 +170,8 @@ https://files.klauspost.com/compress/gob-stream.7z
 
 file        out     level   insize  outsize     millis  mb/s
 
 gob-stream  zskp    1   1911399616  235022249   3088    590.30
 
 gob-stream  zskp    2   1911399616  205669791   3786    481.34
 
-gob-stream  zskp    3   1911399616  185792019   9324    195.48
 
-gob-stream  zskp    4   1911399616  171537212   32113   56.76
 
+gob-stream  zskp    3   1911399616  175034659   9636    189.17
 
+gob-stream  zskp    4   1911399616  167273881   29337   62.13
 
 gob-stream  zstd    1   1911399616  249810424   2637    691.26
 
 gob-stream  zstd    3   1911399616  208192146   3490    522.31
 
 gob-stream  zstd    6   1911399616  193632038   6687    272.56
 
@@ -187,8 +186,8 @@ http://mattmahoney.net/dc/textdata.html
 
 file    out level   insize      outsize     millis  mb/s
 
 enwik9  zskp    1   1000000000  343848582   3609    264.18
 
 enwik9  zskp    2   1000000000  317276632   5746    165.97
 
-enwik9  zskp    3   1000000000  294540704   11725   81.34
 
-enwik9  zskp    4   1000000000  276609671   44029   21.66
 
+enwik9  zskp    3   1000000000  292243069   12162   78.41
 
+enwik9  zskp    4   1000000000  275241169   36430   26.18
 
 enwik9  zstd    1   1000000000  358072021   3110    306.65
 
 enwik9  zstd    3   1000000000  313734672   4784    199.35
 
 enwik9  zstd    6   1000000000  295138875   10290   92.68
 
@@ -202,8 +201,8 @@ https://files.klauspost.com/compress/github-june-2days-2019.json.zst
 
 file                        out level   insize      outsize     millis  mb/s
 
 github-june-2days-2019.json zskp    1   6273951764  699045015   10620   563.40
 
 github-june-2days-2019.json zskp    2   6273951764  617881763   11687   511.96
 
-github-june-2days-2019.json zskp    3   6273951764  537511906   29252   204.54
 
-github-june-2days-2019.json zskp    4   6273951764  512796117   97791   61.18
 
+github-june-2days-2019.json zskp    3   6273951764  524340691   34043   175.75
 
+github-june-2days-2019.json zskp    4   6273951764  503314661   93811   63.78
 
 github-june-2days-2019.json zstd    1   6273951764  766284037   8450    708.00
 
 github-june-2days-2019.json zstd    3   6273951764  661889476   10927   547.57
 
 github-june-2days-2019.json zstd    6   6273951764  642756859   22996   260.18
 
@@ -217,8 +216,8 @@ https://files.klauspost.com/compress/rawstudio-mint14.7z
 
 file                    out level   insize      outsize     millis  mb/s
 
 rawstudio-mint14.tar    zskp    1   8558382592  3667489370  20210   403.84
 
 rawstudio-mint14.tar    zskp    2   8558382592  3364592300  31873   256.07
 
-rawstudio-mint14.tar    zskp    3   8558382592  3224594213  71751   113.75
 
-rawstudio-mint14.tar    zskp    4   8558382592  3027332295  486243  16.79
 
+rawstudio-mint14.tar    zskp    3   8558382592  3158085214  77675   105.08
 
+rawstudio-mint14.tar    zskp    4   8558382592  3020370044  404956  20.16
 
 rawstudio-mint14.tar    zstd    1   8558382592  3609250104  17136   476.27
 
 rawstudio-mint14.tar    zstd    3   8558382592  3341679997  29262   278.92
 
 rawstudio-mint14.tar    zstd    6   8558382592  3235846406  77904   104.77
 
@@ -232,8 +231,8 @@ https://files.klauspost.com/compress/nyc-taxi-data-10M.csv.zst
 
 file                    out level   insize      outsize     millis  mb/s
 
 nyc-taxi-data-10M.csv   zskp    1   3325605752  641339945   8925    355.35
 
 nyc-taxi-data-10M.csv   zskp    2   3325605752  591748091   11268   281.44
 
-nyc-taxi-data-10M.csv   zskp    3   3325605752  538490114   19880   159.53
 
-nyc-taxi-data-10M.csv   zskp    4   3325605752  495986829   89368   35.49
 
+nyc-taxi-data-10M.csv   zskp    3   3325605752  530289687   25239   125.66
 
+nyc-taxi-data-10M.csv   zskp    4   3325605752  490907191   65939   48.10
 
 nyc-taxi-data-10M.csv   zstd    1   3325605752  687399637   8233    385.18
 
 nyc-taxi-data-10M.csv   zstd    3   3325605752  598514411   10065   315.07
 
 nyc-taxi-data-10M.csv   zstd    6   3325605752  570522953   20038   158.27
 
@@ -405,13 +404,28 @@ BenchmarkDecoder_DecodeAllParallelCgo/comp-data.bin.zst-16        749938
 
 
 This reflects the performance around May 2020, but this may be out of date.
 
 
+## Zstd inside ZIP files
 
+
 
+It is possible to use zstandard to compress individual files inside zip archives.
 
+While this isn't widely supported it can be useful for internal files.
 
+
 
+To support the compression and decompression of these files you must register a compressor and decompressor.
 
+
 
+It is highly recommended registering the (de)compressors on individual zip Reader/Writer and NOT
 
+use the global registration functions. The main reason for this is that 2 registrations from 
+different packages will result in a panic.
 
+
 
+It is a good idea to only have a single compressor and decompressor, since they can be used for multiple zip
 
+files concurrently, and using a single instance will allow reusing some resources.
 
+
 
+See [this example](https://pkg.go.dev/github.com/klauspost/compress/zstd#example-ZipCompressor) for 
+how to compress and decompress files inside zip archives.
 
+
 
 # Contributions
 
 
 Contributions are always welcome. 
 For new features/fixes, remember to add tests and for performance enhancements include benchmarks.
 
 
-For sending files for reproducing errors use a service like [goobox](https://goobox.io/#/upload) or similar to share your files.
 
-
 
 For general feedback and experience reports, feel free to open an issue or write me on [Twitter](https://twitter.com/sh0dan).
 
 
 This package includes the excellent [`github.com/cespare/xxhash`](https://github.com/cespare/xxhash) package Copyright (c) 2016 Caleb Spare.

+ 4 - 7
vendor/github.com/klauspost/compress/zstd/blockdec.go
Vedi File 

@@ -123,12 +123,10 @@ func newBlockDec(lowMem bool) *blockDec {
 
 // Input must be a start of a block and will be at the end of the block when returned.
 
 func (b *blockDec) reset(br byteBuffer, windowSize uint64) error {
 
 	b.WindowSize = windowSize
 
-	tmp := br.readSmall(3)
 
-	if tmp == nil {
 
-		if debug {
 
-			println("Reading block header:", io.ErrUnexpectedEOF)
 
-		}
 
-		return io.ErrUnexpectedEOF
 
+	tmp, err := br.readSmall(3)
 
+	if err != nil {
 
+		println("Reading block header:", err)
 
+		return err
 
 	}
 
 	bh := uint32(tmp[0]) | (uint32(tmp[1]) << 8) | (uint32(tmp[2]) << 16)
 
 	b.Last = bh&1 != 0
 
@@ -179,7 +177,6 @@ func (b *blockDec) reset(br byteBuffer, windowSize uint64) error {
 
 	if cap(b.dst) <= maxSize {
 
 		b.dst = make([]byte, 0, maxSize+1)
 
 	}
 
-	var err error
 
 	b.data, err = br.readBig(cSize, b.dataStorage)
 
 	if err != nil {
 
 		if debug {

+ 6 - 6
vendor/github.com/klauspost/compress/zstd/blockenc.go
Vedi File 

@@ -386,9 +386,9 @@ func (b *blockEnc) encodeLits(lits []byte, raw bool) error {
 
 		b.output = bh.appendTo(b.output)
 
 		b.output = append(b.output, lits[0])
 
 		return nil
 
+	case nil:
 
 	default:
 
 		return err
 
-	case nil:
 
 	}
 
 	// Compressed...
 
 	// Now, allow reuse
 
@@ -528,11 +528,6 @@ func (b *blockEnc) encode(org []byte, raw, rawAllLits bool) error {
 
 		if debug {
 
 			println("Adding literals RLE")
 
 		}
 
-	default:
 
-		if debug {
 
-			println("Adding literals ERROR:", err)
 
-		}
 
-		return err
 
 	case nil:
 
 		// Compressed litLen...
 
 		if reUsed {
 
@@ -563,6 +558,11 @@ func (b *blockEnc) encode(org []byte, raw, rawAllLits bool) error {
 
 		if debug {
 
 			println("Adding literals compressed")
 
 		}
 
+	default:
 
+		if debug {
 
+			println("Adding literals ERROR:", err)
 
+		}
 
+		return err
 
 	}
 
 	// Sequence compression

+ 12 - 9
vendor/github.com/klauspost/compress/zstd/bytebuf.go
Vedi File 

@@ -12,8 +12,8 @@ import (
 
 
 type byteBuffer interface {
 
 	// Read up to 8 bytes.
 
-	// Returns nil if no more input is available.
 
-	readSmall(n int) []byte
 
+	// Returns io.ErrUnexpectedEOF if this cannot be satisfied.
 
+	readSmall(n int) ([]byte, error)
 
 
 	// Read >8 bytes.
 
 	// MAY use the destination slice.
 
@@ -29,17 +29,17 @@ type byteBuffer interface {
 
 // in-memory buffer
 
 type byteBuf []byte
 
 
-func (b *byteBuf) readSmall(n int) []byte {
 
+func (b *byteBuf) readSmall(n int) ([]byte, error) {
 
 	if debugAsserts && n > 8 {
 
 		panic(fmt.Errorf("small read > 8 (%d). use readBig", n))
 
 	}
 
 	bb := *b
 
 	if len(bb) < n {
 
-		return nil
 
+		return nil, io.ErrUnexpectedEOF
 
 	}
 
 	r := bb[:n]
 
 	*b = bb[n:]
 
-	return r
 
+	return r, nil
 
 }
 
 
 func (b *byteBuf) readBig(n int, dst []byte) ([]byte, error) {
 
@@ -81,19 +81,22 @@ type readerWrapper struct {
 
 	tmp [8]byte
 
 }
 
 
-func (r *readerWrapper) readSmall(n int) []byte {
 
+func (r *readerWrapper) readSmall(n int) ([]byte, error) {
 
 	if debugAsserts && n > 8 {
 
 		panic(fmt.Errorf("small read > 8 (%d). use readBig", n))
 
 	}
 
 	n2, err := io.ReadFull(r.r, r.tmp[:n])
 
 	// We only really care about the actual bytes read.
 
-	if n2 != n {
 
+	if err != nil {
 
+		if err == io.EOF {
 
+			return nil, io.ErrUnexpectedEOF
 
+		}
 
 		if debug {
 
 			println("readSmall: got", n2, "want", n, "err", err)
 
 		}
 
-		return nil
 
+		return nil, err
 
 	}
 
-	return r.tmp[:n]
 
+	return r.tmp[:n], nil
 
 }
 
 
 func (r *readerWrapper) readBig(n int, dst []byte) ([]byte, error) {

+ 2 - 2
vendor/github.com/klauspost/compress/zstd/decodeheader.go
Vedi File 

@@ -93,7 +93,7 @@ func (h *Header) Decode(in []byte) error {
 
 	h.HasCheckSum = fhd&(1<<2) != 0
 
 
 	if fhd&(1<<3) != 0 {
 
-		return errors.New("Reserved bit set on frame header")
 
+		return errors.New("reserved bit set on frame header")
 
 	}
 
 
 	// Read Window_Descriptor
 
@@ -174,7 +174,7 @@ func (h *Header) Decode(in []byte) error {
 
 	if len(in) < 3 {
 
 		return nil
 
 	}
 
-	tmp, in := in[:3], in[3:]
 
+	tmp := in[:3]
 
 	bh := uint32(tmp[0]) | (uint32(tmp[1]) << 8) | (uint32(tmp[2]) << 16)
 
 	h.FirstBlock.Last = bh&1 != 0
 
 	blockType := blockType((bh >> 1) & 3)

+ 11 - 15
vendor/github.com/klauspost/compress/zstd/decoder.go
Vedi File 

@@ -179,8 +179,7 @@ func (d *Decoder) Reset(r io.Reader) error {
 
 
 	// If bytes buffer and < 1MB, do sync decoding anyway.
 
 	if bb, ok := r.(byter); ok && bb.Len() < 1<<20 {
 
-		var bb2 byter
 
-		bb2 = bb
 
+		bb2 := bb
 
 		if debug {
 
 			println("*bytes.Buffer detected, doing sync decode, len:", bb.Len())
 
 		}
 
@@ -237,20 +236,17 @@ func (d *Decoder) drainOutput() {
 
 		println("current already flushed")
 
 		return
 
 	}
 
-	for {
 
-		select {
 
-		case v := <-d.current.output:
 
-			if v.d != nil {
 
-				if debug {
 
-					printf("re-adding decoder %p", v.d)
 
-				}
 
-				d.decoders <- v.d
 
-			}
 
-			if v.err == errEndOfStream {
 
-				println("current flushed")
 
-				d.current.flushed = true
 
-				return
 
+	for v := range d.current.output {
 
+		if v.d != nil {
 
+			if debug {
 
+				printf("re-adding decoder %p", v.d)
 
 			}
 
+			d.decoders <- v.d
 
+		}
 
+		if v.err == errEndOfStream {
 
+			println("current flushed")
 
+			d.current.flushed = true
 
+			return
 
 		}
 
 	}
 
 }

+ 2 - 3
vendor/github.com/klauspost/compress/zstd/decoder_options.go
Vedi File 

@@ -6,7 +6,6 @@ package zstd
 
 
 import (
 
 	"errors"
 
-	"fmt"
 
 	"runtime"
 
 )
 
 
@@ -43,7 +42,7 @@ func WithDecoderLowmem(b bool) DOption {
 
 func WithDecoderConcurrency(n int) DOption {
 
 	return func(o *decoderOptions) error {
 
 		if n <= 0 {
 
-			return fmt.Errorf("Concurrency must be at least 1")
 
+			return errors.New("concurrency must be at least 1")
 
 		}
 
 		o.concurrent = n
 
 		return nil
 
@@ -61,7 +60,7 @@ func WithDecoderMaxMemory(n uint64) DOption {
 
 			return errors.New("WithDecoderMaxMemory must be at least 1")
 
 		}
 
 		if n > 1<<63 {
 
-			return fmt.Errorf("WithDecoderMaxmemory must be less than 1 << 63")
 
+			return errors.New("WithDecoderMaxmemory must be less than 1 << 63")
 
 		}
 
 		o.maxDecodedSize = n
 
 		return nil

+ 7 - 6
vendor/github.com/klauspost/compress/zstd/enc_base.go
Vedi File 

@@ -150,14 +150,15 @@ func (e *fastBase) resetBase(d *dict, singleBlock bool) {
 
 	} else {
 
 		e.crc.Reset()
 
 	}
 
-	if (!singleBlock || d.DictContentSize() > 0) && cap(e.hist) < int(e.maxMatchOff*2)+d.DictContentSize() {
 
-		l := e.maxMatchOff*2 + int32(d.DictContentSize())
 
-		// Make it at least 1MB.
 
-		if l < 1<<20 {
 
-			l = 1 << 20
 
+	if d != nil {
 
+		low := e.lowMem
 
+		if singleBlock {
 
+			e.lowMem = true
 
 		}
 
-		e.hist = make([]byte, 0, l)
 
+		e.ensureHist(d.DictContentSize() + maxCompressedBlockSize)
 
+		e.lowMem = low
 
 	}
 
+
 
 	// We offset current position so everything will be out of reach.
 
 	// If above reset line, history will be purged.
 
 	if e.cur < bufferReset {

+ 14 - 0
vendor/github.com/klauspost/compress/zstd/enc_best.go
Vedi File 

@@ -220,6 +220,20 @@ encodeLoop:
 
 			best = bestOf(best, matchAt(candidateL.prev-e.cur, s, uint32(cv), -1))
 
 			best = bestOf(best, matchAt(candidateL2.offset-e.cur, s+1, uint32(cv2), -1))
 
 			best = bestOf(best, matchAt(candidateL2.prev-e.cur, s+1, uint32(cv2), -1))
 
+
 
+			// See if we can find a better match by checking where the current best ends.
 
+			// Use that offset to see if we can find a better full match.
 
+			if sAt := best.s + best.length; sAt < sLimit {
 
+				nextHashL := hash8(load6432(src, sAt), bestLongTableBits)
 
+				candidateEnd := e.longTable[nextHashL]
 
+				if pos := candidateEnd.offset - e.cur - best.length; pos >= 0 {
 
+					bestEnd := bestOf(best, matchAt(pos, best.s, load3232(src, best.s), -1))
 
+					if pos := candidateEnd.prev - e.cur - best.length; pos >= 0 {
 
+						bestEnd = bestOf(bestEnd, matchAt(pos, best.s, load3232(src, best.s), -1))
 
+					}
 
+					best = bestEnd
 
+				}
 
+			}
 
 		}
 
 
 		// We have a match, we can store the forward value

+ 69 - 4
vendor/github.com/klauspost/compress/zstd/enc_better.go
Vedi File 

@@ -412,8 +412,41 @@ encodeLoop:
 
 			cv = load6432(src, s)
 
 		}
 
 
-		// A 4-byte match has been found. Update recent offsets.
 
-		// We'll later see if more than 4 bytes.
 
+		// Try to find a better match by searching for a long match at the end of the current best match
 
+		if true && s+matched < sLimit {
 
+			nextHashL := hash8(load6432(src, s+matched), betterLongTableBits)
 
+			cv := load3232(src, s)
 
+			candidateL := e.longTable[nextHashL]
 
+			coffsetL := candidateL.offset - e.cur - matched
 
+			if coffsetL >= 0 && coffsetL < s && s-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
 
+				// Found a long match, at least 4 bytes.
 
+				matchedNext := e.matchlen(s+4, coffsetL+4, src) + 4
 
+				if matchedNext > matched {
 
+					t = coffsetL
 
+					matched = matchedNext
 
+					if debugMatches {
 
+						println("long match at end-of-match")
 
+					}
 
+				}
 
+			}
 
+
 
+			// Check prev long...
 
+			if true {
 
+				coffsetL = candidateL.prev - e.cur - matched
 
+				if coffsetL >= 0 && coffsetL < s && s-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
 
+					// Found a long match, at least 4 bytes.
 
+					matchedNext := e.matchlen(s+4, coffsetL+4, src) + 4
 
+					if matchedNext > matched {
 
+						t = coffsetL
 
+						matched = matchedNext
 
+						if debugMatches {
 
+							println("prev long match at end-of-match")
 
+						}
 
+					}
 
+				}
 
+			}
 
+		}
 
+		// A match has been found. Update recent offsets.
 
 		offset2 = offset1
 
 		offset1 = s - t
 
 
@@ -905,9 +938,41 @@ encodeLoop:
 
 			}
 
 			cv = load6432(src, s)
 
 		}
 
+		// Try to find a better match by searching for a long match at the end of the current best match
 
+		if s+matched < sLimit {
 
+			nextHashL := hash8(load6432(src, s+matched), betterLongTableBits)
 
+			cv := load3232(src, s)
 
+			candidateL := e.longTable[nextHashL]
 
+			coffsetL := candidateL.offset - e.cur - matched
 
+			if coffsetL >= 0 && coffsetL < s && s-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
 
+				// Found a long match, at least 4 bytes.
 
+				matchedNext := e.matchlen(s+4, coffsetL+4, src) + 4
 
+				if matchedNext > matched {
 
+					t = coffsetL
 
+					matched = matchedNext
 
+					if debugMatches {
 
+						println("long match at end-of-match")
 
+					}
 
+				}
 
+			}
 
 
-		// A 4-byte match has been found. Update recent offsets.
 
-		// We'll later see if more than 4 bytes.
 
+			// Check prev long...
 
+			if true {
 
+				coffsetL = candidateL.prev - e.cur - matched
 
+				if coffsetL >= 0 && coffsetL < s && s-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
 
+					// Found a long match, at least 4 bytes.
 
+					matchedNext := e.matchlen(s+4, coffsetL+4, src) + 4
 
+					if matchedNext > matched {
 
+						t = coffsetL
 
+						matched = matchedNext
 
+						if debugMatches {
 
+							println("prev long match at end-of-match")
 
+						}
 
+					}
 
+				}
 
+			}
 
+		}
 
+		// A match has been found. Update recent offsets.
 
 		offset2 = offset1
 
 		offset1 = s - t

+ 1 - 1
vendor/github.com/klauspost/compress/zstd/encoder.go
Vedi File 

@@ -340,13 +340,13 @@ func (e *Encoder) ReadFrom(r io.Reader) (n int64, err error) {
 
 				println("ReadFrom: got EOF final block:", len(e.state.filling))
 
 			}
 
 			return n, nil
 
+		case nil:
 
 		default:
 
 			if debug {
 
 				println("ReadFrom: got error:", err)
 
 			}
 
 			e.state.err = err
 
 			return n, err
 
-		case nil:
 
 		}
 
 		if len(src) > 0 {
 
 			if debug {

+ 1 - 1
vendor/github.com/klauspost/compress/zstd/encoder_options.go
Vedi File 

@@ -73,7 +73,7 @@ func WithEncoderCRC(b bool) EOption {
 
 }
 
 
 // WithEncoderConcurrency will set the concurrency,
 
-// meaning the maximum number of decoders to run concurrently.
 
+// meaning the maximum number of encoders to run concurrently.
 
 // The value supplied must be at least 1.
 
 // By default this will be set to GOMAXPROCS.
 
 func WithEncoderConcurrency(n int) EOption {

+ 26 - 22
vendor/github.com/klauspost/compress/zstd/framedec.go
Vedi File 

@@ -80,9 +80,14 @@ func (d *frameDec) reset(br byteBuffer) error {
 
 	d.WindowSize = 0
 
 	var b []byte
 
 	for {
 
-		b = br.readSmall(4)
 
-		if b == nil {
 
+		var err error
 
+		b, err = br.readSmall(4)
 
+		switch err {
 
+		case io.EOF, io.ErrUnexpectedEOF:
 
 			return io.EOF
 
+		default:
 
+			return err
 
+		case nil:
 
 		}
 
 		if !bytes.Equal(b[1:4], skippableFrameMagic) || b[0]&0xf0 != 0x50 {
 
 			if debug {
 
@@ -92,14 +97,14 @@ func (d *frameDec) reset(br byteBuffer) error {
 
 			break
 
 		}
 
 		// Read size to skip
 
-		b = br.readSmall(4)
 
-		if b == nil {
 
-			println("Reading Frame Size EOF")
 
-			return io.ErrUnexpectedEOF
 
+		b, err = br.readSmall(4)
 
+		if err != nil {
 
+			println("Reading Frame Size", err)
 
+			return err
 
 		}
 
 		n := uint32(b[0]) | (uint32(b[1]) << 8) | (uint32(b[2]) << 16) | (uint32(b[3]) << 24)
 
 		println("Skipping frame with", n, "bytes.")
 
-		err := br.skipN(int(n))
 
+		err = br.skipN(int(n))
 
 		if err != nil {
 
 			if debug {
 
 				println("Reading discarded frame", err)
 
@@ -121,7 +126,7 @@ func (d *frameDec) reset(br byteBuffer) error {
 
 	d.SingleSegment = fhd&(1<<5) != 0
 
 
 	if fhd&(1<<3) != 0 {
 
-		return errors.New("Reserved bit set on frame header")
 
+		return errors.New("reserved bit set on frame header")
 
 	}
 
 
 	// Read Window_Descriptor
 
@@ -147,12 +152,11 @@ func (d *frameDec) reset(br byteBuffer) error {
 
 		if size == 3 {
 
 			size = 4
 
 		}
 
-		b = br.readSmall(int(size))
 
-		if b == nil {
 
-			if debug {
 
-				println("Reading Dictionary_ID", io.ErrUnexpectedEOF)
 
-			}
 
-			return io.ErrUnexpectedEOF
 
+
 
+		b, err = br.readSmall(int(size))
 
+		if err != nil {
 
+			println("Reading Dictionary_ID", err)
 
+			return err
 
 		}
 
 		var id uint32
 
 		switch size {
 
@@ -187,10 +191,10 @@ func (d *frameDec) reset(br byteBuffer) error {
 
 	}
 
 	d.FrameContentSize = 0
 
 	if fcsSize > 0 {
 
-		b := br.readSmall(fcsSize)
 
-		if b == nil {
 
-			println("Reading Frame content", io.ErrUnexpectedEOF)
 
-			return io.ErrUnexpectedEOF
 
+		b, err = br.readSmall(fcsSize)
 
+		if err != nil {
 
+			println("Reading Frame content", err)
 
+			return err
 
 		}
 
 		switch fcsSize {
 
 		case 1:
 
@@ -307,10 +311,10 @@ func (d *frameDec) checkCRC() error {
 
 	tmp[3] = byte(got >> 24)
 
 
 	// We can overwrite upper tmp now
 
-	want := d.rawInput.readSmall(4)
 
-	if want == nil {
 
-		println("CRC missing?")
 
-		return io.ErrUnexpectedEOF
 
+	want, err := d.rawInput.readSmall(4)
 
+	if err != nil {
 
+		println("CRC missing?", err)
 
+		return err
 
 	}
 
 
 	if !bytes.Equal(tmp[:], want) {

+ 0 - 1
vendor/github.com/klauspost/compress/zstd/fse_encoder.go
Vedi File 

@@ -708,7 +708,6 @@ func (c *cState) init(bw *bitWriter, ct *cTable, first symbolTransform) {
 
 	im := int32((nbBitsOut << 16) - first.deltaNbBits)
 
 	lu := (im >> nbBitsOut) + int32(first.deltaFindState)
 
 	c.state = c.stateTable[lu]
 
-	return
 
 }
 
 
 // encode the output symbol provided and write it to the bitstream.

+ 1 - 1
vendor/github.com/klauspost/compress/zstd/fse_predefined.go
Vedi File 

@@ -59,7 +59,7 @@ func fillBase(dst []baseOffset, base uint32, bits ...uint8) {
 
 	}
 
 	for i, bit := range bits {
 
 		if base > math.MaxInt32 {
 
-			panic(fmt.Sprintf("invalid decoding table, base overflows int32"))
 
+			panic("invalid decoding table, base overflows int32")
 
 		}
 
 
 		dst[i] = baseOffset{

+ 0 - 1
vendor/github.com/klauspost/compress/zstd/seqenc.go
Vedi File 

@@ -35,7 +35,6 @@ func (s *seqCoders) setPrev(ll, ml, of *fseEncoder) {
 
 		// Ensure we cannot reuse by accident
 
 		prevEnc := *prev
 
 		prevEnc.symbolLen = 0
 
-		return
 
 	}
 
 	compareSwap(ll, &s.llEnc, &s.llPrev)
 
 	compareSwap(ml, &s.mlEnc, &s.mlPrev)

+ 1 - 2
vendor/github.com/klauspost/compress/zstd/snappy.go
Vedi File 

@@ -10,8 +10,8 @@ import (
 
 	"hash/crc32"
 
 	"io"
 
 
+	"github.com/golang/snappy"
 
 	"github.com/klauspost/compress/huff0"
 
-	"github.com/klauspost/compress/snappy"
 
 )
 
 
 const (
 
@@ -185,7 +185,6 @@ func (r *SnappyConverter) Convert(in io.Reader, w io.Writer) (int64, error) {
 
 				r.block.reset(nil)
 
 				r.block.literals, err = snappy.Decode(r.block.literals[:n], r.buf[snappyChecksumSize:chunkLen])
 
 				if err != nil {
 
-					println("snappy.Decode:", err)
 
 					return written, err
 
 				}
 
 				err = r.block.encodeLits(r.block.literals, false)

+ 121 - 0
vendor/github.com/klauspost/compress/zstd/zip.go
Vedi File 

@@ -0,0 +1,121 @@
 
+// Copyright 2019+ Klaus Post. All rights reserved.
 
+// License information can be found in the LICENSE file.
 
+
 
+package zstd
 
+
 
+import (
 
+	"errors"
 
+	"io"
 
+	"sync"
 
+)
 
+
 
+// ZipMethodWinZip is the method for Zstandard compressed data inside Zip files for WinZip.
 
+// See https://www.winzip.com/win/en/comp_info.html
 
+const ZipMethodWinZip = 93
 
+
 
+// ZipMethodPKWare is the original method number used by PKWARE to indicate Zstandard compression.
 
+// Deprecated: This has been deprecated by PKWARE, use ZipMethodWinZip instead for compression.
 
+// See https://pkware.cachefly.net/webdocs/APPNOTE/APPNOTE-6.3.9.TXT
 
+const ZipMethodPKWare = 20
 
+
 
+var zipReaderPool sync.Pool
 
+
 
+// newZipReader cannot be used since we would leak goroutines...
 
+func newZipReader(r io.Reader) io.ReadCloser {
 
+	dec, ok := zipReaderPool.Get().(*Decoder)
 
+	if ok {
 
+		dec.Reset(r)
 
+	} else {
 
+		d, err := NewReader(r, WithDecoderConcurrency(1), WithDecoderLowmem(true))
 
+		if err != nil {
 
+			panic(err)
 
+		}
 
+		dec = d
 
+	}
 
+	return &pooledZipReader{dec: dec}
 
+}
 
+
 
+type pooledZipReader struct {
 
+	mu  sync.Mutex // guards Close and Read
 
+	dec *Decoder
 
+}
 
+
 
+func (r *pooledZipReader) Read(p []byte) (n int, err error) {
 
+	r.mu.Lock()
 
+	defer r.mu.Unlock()
 
+	if r.dec == nil {
 
+		return 0, errors.New("Read after Close")
 
+	}
 
+	dec, err := r.dec.Read(p)
 
+
 
+	return dec, err
 
+}
 
+
 
+func (r *pooledZipReader) Close() error {
 
+	r.mu.Lock()
 
+	defer r.mu.Unlock()
 
+	var err error
 
+	if r.dec != nil {
 
+		err = r.dec.Reset(nil)
 
+		zipReaderPool.Put(r.dec)
 
+		r.dec = nil
 
+	}
 
+	return err
 
+}
 
+
 
+type pooledZipWriter struct {
 
+	mu  sync.Mutex // guards Close and Read
 
+	enc *Encoder
 
+}
 
+
 
+func (w *pooledZipWriter) Write(p []byte) (n int, err error) {
 
+	w.mu.Lock()
 
+	defer w.mu.Unlock()
 
+	if w.enc == nil {
 
+		return 0, errors.New("Write after Close")
 
+	}
 
+	return w.enc.Write(p)
 
+}
 
+
 
+func (w *pooledZipWriter) Close() error {
 
+	w.mu.Lock()
 
+	defer w.mu.Unlock()
 
+	var err error
 
+	if w.enc != nil {
 
+		err = w.enc.Close()
 
+		zipReaderPool.Put(w.enc)
 
+		w.enc = nil
 
+	}
 
+	return err
 
+}
 
+
 
+// ZipCompressor returns a compressor that can be registered with zip libraries.
 
+// The provided encoder options will be used on all encodes.
 
+func ZipCompressor(opts ...EOption) func(w io.Writer) (io.WriteCloser, error) {
 
+	var pool sync.Pool
 
+	return func(w io.Writer) (io.WriteCloser, error) {
 
+		enc, ok := pool.Get().(*Encoder)
 
+		if ok {
 
+			enc.Reset(w)
 
+		} else {
 
+			var err error
 
+			enc, err = NewWriter(w, opts...)
 
+			if err != nil {
 
+				return nil, err
 
+			}
 
+		}
 
+		return &pooledZipWriter{enc: enc}, nil
 
+	}
 
+}
 
+
 
+// ZipDecompressor returns a decompressor that can be registered with zip libraries.
 
+// See ZipCompressor for example.
 
+func ZipDecompressor() func(r io.Reader) io.ReadCloser {
 
+	return func(r io.Reader) io.ReadCloser {
 
+		d, err := NewReader(r, WithDecoderConcurrency(1), WithDecoderLowmem(true))
 
+		if err != nil {
 
+			panic(err)
 
+		}
 
+		return d.IOReadCloser()
 
+	}
 
+}

+ 4 - 14
vendor/github.com/klauspost/compress/zstd/zstd.go
Vedi File 

@@ -5,6 +5,7 @@ package zstd
 
 
 import (
 
 	"bytes"
 
+	"encoding/binary"
 
 	"errors"
 
 	"log"
 
 	"math"
 
@@ -126,26 +127,15 @@ func matchLen(a, b []byte) int {
 
 }
 
 
 func load3232(b []byte, i int32) uint32 {
 
-	// Help the compiler eliminate bounds checks on the read so it can be done in a single read.
 
-	b = b[i:]
 
-	b = b[:4]
 
-	return uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24
 
+	return binary.LittleEndian.Uint32(b[i:])
 
 }
 
 
 func load6432(b []byte, i int32) uint64 {
 
-	// Help the compiler eliminate bounds checks on the read so it can be done in a single read.
 
-	b = b[i:]
 
-	b = b[:8]
 
-	return uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 |
 
-		uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56
 
+	return binary.LittleEndian.Uint64(b[i:])
 
 }
 
 
 func load64(b []byte, i int) uint64 {
 
-	// Help the compiler eliminate bounds checks on the read so it can be done in a single read.
 
-	b = b[i:]
 
-	b = b[:8]
 
-	return uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 |
 
-		uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56
 
+	return binary.LittleEndian.Uint64(b[i:])
 
 }
 
 
 type byter interface {

+ 2 - 2
vendor/github.com/pelletier/go-toml/CONTRIBUTING.md
Vedi File 

@@ -28,7 +28,7 @@ improve the documentation. Fix a typo, clarify an interface, add an
 
 example, anything goes!
 
 
 The documentation is present in the [README][readme] and thorough the
 
-source code. On release, it gets updated on [GoDoc][godoc]. To make a
 
+source code. On release, it gets updated on [pkg.go.dev][pkg.go.dev]. To make a
 
 change to the documentation, create a pull request with your proposed
 
 changes. For simple changes like that, the easiest way to go is probably
 
 the "Fork this project and edit the file" button on Github, displayed at
 
@@ -123,7 +123,7 @@ Checklist:
 
 
 [issues-tracker]: https://github.com/pelletier/go-toml/issues
 
 [bug-report]: https://github.com/pelletier/go-toml/issues/new?template=bug_report.md
 
-[godoc]: https://godoc.org/github.com/pelletier/go-toml
 
+[pkg.go.dev]: https://pkg.go.dev/github.com/pelletier/go-toml
 
 [readme]: ./README.md
 
 [fork]: https://help.github.com/articles/fork-a-repo
 
 [pull-request]: https://help.github.com/en/articles/creating-a-pull-request

+ 1 - 1
vendor/github.com/pelletier/go-toml/LICENSE
Vedi File 

@@ -1,6 +1,6 @@
 
 The MIT License (MIT)
 
 
-Copyright (c) 2013 - 2017 Thomas Pelletier, Eric Anderton
 
+Copyright (c) 2013 - 2021 Thomas Pelletier, Eric Anderton
 
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 
 of this software and associated documentation files (the "Software"), to deal

+ 6 - 6
vendor/github.com/pelletier/go-toml/README.md
Vedi File 

@@ -1,11 +1,11 @@
 
 # go-toml
 
 
-Go library for the [TOML](https://github.com/mojombo/toml) format.
 
+Go library for the [TOML](https://toml.io/) format.
 
 
 This library supports TOML version
 
-[v1.0.0-rc.1](https://github.com/toml-lang/toml/blob/master/versions/en/toml-v1.0.0-rc.1.md)
 
+[v1.0.0-rc.3](https://toml.io/en/v1.0.0-rc.3)
 
 
-[![GoDoc](https://godoc.org/github.com/pelletier/go-toml?status.svg)](http://godoc.org/github.com/pelletier/go-toml)
 
+[![Go Reference](https://pkg.go.dev/badge/github.com/pelletier/go-toml.svg)](https://pkg.go.dev/github.com/pelletier/go-toml)
 
 [![license](https://img.shields.io/github/license/pelletier/go-toml.svg)](https://github.com/pelletier/go-toml/blob/master/LICENSE)
 
 [![Build Status](https://dev.azure.com/pelletierthomas/go-toml-ci/_apis/build/status/pelletier.go-toml?branchName=master)](https://dev.azure.com/pelletierthomas/go-toml-ci/_build/latest?definitionId=1&branchName=master)
 
 [![codecov](https://codecov.io/gh/pelletier/go-toml/branch/master/graph/badge.svg)](https://codecov.io/gh/pelletier/go-toml)
 
@@ -81,11 +81,11 @@ for ii, item := range results.Values() {
 
 ## Documentation
 
 
 The documentation and additional examples are available at
 
-[godoc.org](http://godoc.org/github.com/pelletier/go-toml).
 
+[pkg.go.dev](https://pkg.go.dev/github.com/pelletier/go-toml).
 
 
 ## Tools
 
 
-Go-toml provides two handy command line tools:
 
+Go-toml provides three handy command line tools:
 
 
 * `tomll`: Reads TOML files and lints them.
 
 
@@ -109,7 +109,7 @@ Go-toml provides two handy command line tools:
 
 
 ### Docker image
 
 
-Those tools are also availble as a Docker image from
 
+Those tools are also available as a Docker image from
 
 [dockerhub](https://hub.docker.com/r/pelletier/go-toml). For example, to
 
 use `tomljson`:

+ 16 - 58
vendor/github.com/pelletier/go-toml/azure-pipelines.yml
Vedi File 

@@ -2,30 +2,6 @@ trigger:
 
 - master
 
 
 stages:
 
-- stage: fuzzit
 
-  displayName: "Run Fuzzit"
 
-  dependsOn: []
 
-  condition: and(succeeded(), eq(variables['Build.SourceBranchName'], 'master'))
 
-  jobs:
 
-  - job: submit
 
-    displayName: "Submit"
 
-    pool:
 
-      vmImage: ubuntu-latest
 
-    steps:
 
-    - task: GoTool@0
 
-      displayName: "Install Go 1.15"
 
-      inputs:
 
-        version: "1.15"
 
-    - script: echo "##vso[task.setvariable variable=PATH]${PATH}:/home/vsts/go/bin/"
 
-    - script: mkdir -p ${HOME}/go/src/github.com/pelletier/go-toml
 
-    - script: cp -R . ${HOME}/go/src/github.com/pelletier/go-toml
 
-    - task: Bash@3
 
-      inputs:
 
-        filePath: './fuzzit.sh'
 
-      env:
 
-        TYPE: fuzzing
 
-        FUZZIT_API_KEY: $(FUZZIT_API_KEY)
 
-
 
 - stage: run_checks
 
   displayName: "Check"
 
   dependsOn: []
 
@@ -36,9 +12,9 @@ stages:
 
       vmImage: ubuntu-latest
 
     steps:
 
     - task: GoTool@0
 
-      displayName: "Install Go 1.15"
 
+      displayName: "Install Go 1.16"
 
       inputs:
 
-        version: "1.15"
 
+        version: "1.16"
 
     - task: Go@0
 
       displayName: "go fmt ./..."
 
       inputs:
 
@@ -51,9 +27,9 @@ stages:
 
       vmImage: ubuntu-latest
 
     steps:
 
     - task: GoTool@0
 
-      displayName: "Install Go 1.15"
 
+      displayName: "Install Go 1.16"
 
       inputs:
 
-        version: "1.15"
 
+        version: "1.16"
 
     - task: Go@0
 
       displayName: "Generate coverage"
 
       inputs:
 
@@ -71,37 +47,28 @@ stages:
 
       vmImage: ubuntu-latest
 
     steps:
 
     - task: GoTool@0
 
-      displayName: "Install Go 1.15"
 
+      displayName: "Install Go 1.16"
 
       inputs:
 
-        version: "1.15"
 
+        version: "1.16"
 
     - script: echo "##vso[task.setvariable variable=PATH]${PATH}:/home/vsts/go/bin/"
 
     - task: Bash@3
 
       inputs:
 
         filePath: './benchmark.sh'
 
         arguments: "master $(Build.Repository.Uri)"
 
 
-  - job: fuzzing
 
-    displayName: "fuzzing"
 
-    pool:
 
-      vmImage: ubuntu-latest
 
-    steps:
 
-    - task: GoTool@0
 
-      displayName: "Install Go 1.15"
 
-      inputs:
 
-        version: "1.15"
 
-    - script: echo "##vso[task.setvariable variable=PATH]${PATH}:/home/vsts/go/bin/"
 
-    - script: mkdir -p ${HOME}/go/src/github.com/pelletier/go-toml
 
-    - script: cp -R . ${HOME}/go/src/github.com/pelletier/go-toml
 
-    - task: Bash@3
 
-      inputs:
 
-        filePath: './fuzzit.sh'
 
-      env:
 
-        TYPE: local-regression
 
-
 
   - job: go_unit_tests
 
     displayName: "unit tests"
 
     strategy:
 
       matrix:
 
+        linux 1.16:
 
+          goVersion: '1.16'
 
+          imageName: 'ubuntu-latest'
 
+        mac 1.16:
 
+          goVersion: '1.16'
 
+          imageName: 'macOS-latest'
 
+        windows 1.16:
 
+          goVersion: '1.16'
 
+          imageName: 'windows-latest'
 
         linux 1.15:
 
           goVersion: '1.15'
 
           imageName: 'ubuntu-latest'
 
@@ -111,15 +78,6 @@ stages:
 
         windows 1.15:
 
           goVersion: '1.15'
 
           imageName: 'windows-latest'
 
-        linux 1.14:
 
-          goVersion: '1.14'
 
-          imageName: 'ubuntu-latest'
 
-        mac 1.14:
 
-          goVersion: '1.14'
 
-          imageName: 'macOS-latest'
 
-        windows 1.14:
 
-          goVersion: '1.14'
 
-          imageName: 'windows-latest'
 
     pool:
 
       vmImage: $(imageName)
 
     steps:
 
@@ -155,7 +113,7 @@ stages:
 
     - task: GoTool@0
 
       displayName: "Install Go"
 
       inputs:
 
-        version: 1.15
 
+        version: 1.16
 
     - task: Bash@3
 
       inputs:
 
         targetType: inline

+ 0 - 26
vendor/github.com/pelletier/go-toml/fuzzit.sh
Vedi File 

@@ -1,26 +0,0 @@
 
-#!/bin/bash
 
-set -xe
 
-
 
-# go-fuzz doesn't support modules yet, so ensure we do everything
 
-# in the old style GOPATH way
 
-export GO111MODULE="off"
 
-
 
-# install go-fuzz
 
-go get -u github.com/dvyukov/go-fuzz/go-fuzz github.com/dvyukov/go-fuzz/go-fuzz-build
 
-
 
-# target name can only contain lower-case letters (a-z), digits (0-9) and a dash (-)
 
-# to add another target, make sure to create it with `fuzzit create target`
 
-# before using `fuzzit create job`
 
-TARGET=toml-fuzzer
 
-
 
-go-fuzz-build -libfuzzer -o ${TARGET}.a github.com/pelletier/go-toml
 
-clang -fsanitize=fuzzer ${TARGET}.a -o ${TARGET}
 
-
 
-# install fuzzit for talking to fuzzit.dev service
 
-# or latest version:
 
-# https://github.com/fuzzitdev/fuzzit/releases/latest/download/fuzzit_Linux_x86_64
 
-wget -q -O fuzzit https://github.com/fuzzitdev/fuzzit/releases/download/v2.4.52/fuzzit_Linux_x86_64
 
-chmod a+x fuzzit
 
-
 
-# TODO: change kkowalczyk to go-toml and create toml-fuzzer target there
 
-./fuzzit create job --type $TYPE go-toml/${TARGET} ${TARGET}

+ 265 - 41
vendor/github.com/pelletier/go-toml/lexer.go
Vedi File 

@@ -9,13 +9,10 @@ import (
 
 	"bytes"
 
 	"errors"
 
 	"fmt"
 
-	"regexp"
 
 	"strconv"
 
 	"strings"
 
 )
 
 
-var dateRegexp *regexp.Regexp
 
-
 
 // Define state functions
 
 type tomlLexStateFn func() tomlLexStateFn
 
 
@@ -216,18 +213,12 @@ func (l *tomlLexer) lexRvalue() tomlLexStateFn {
 
 			break
 
 		}
 
 
-		possibleDate := l.peekString(35)
 
-		dateSubmatches := dateRegexp.FindStringSubmatch(possibleDate)
 
-		if dateSubmatches != nil && dateSubmatches[0] != "" {
 
-			l.fastForward(len(dateSubmatches[0]))
 
-			if dateSubmatches[2] == "" { // no timezone information => local date
 
-				return l.lexLocalDate
 
-			}
 
-			return l.lexDate
 
+		if next == '+' || next == '-' {
 
+			return l.lexNumber
 
 		}
 
 
-		if next == '+' || next == '-' || isDigit(next) {
 
-			return l.lexNumber
 
+		if isDigit(next) {
 
+			return l.lexDateTimeOrNumber
 
 		}
 
 
 		return l.errorf("no value can start with %c", next)
 
@@ -237,6 +228,32 @@ func (l *tomlLexer) lexRvalue() tomlLexStateFn {
 
 	return nil
 
 }
 
 
+func (l *tomlLexer) lexDateTimeOrNumber() tomlLexStateFn {
 
+	// Could be either a date/time, or a digit.
 
+	// The options for date/times are:
 
+	//   YYYY-... => date or date-time
 
+	//   HH:... => time
 
+	// Anything else should be a number.
 
+
 
+	lookAhead := l.peekString(5)
 
+	if len(lookAhead) < 3 {
 
+		return l.lexNumber()
 
+	}
 
+
 
+	for idx, r := range lookAhead {
 
+		if !isDigit(r) {
 
+			if idx == 2 && r == ':' {
 
+				return l.lexDateTimeOrTime()
 
+			}
 
+			if idx == 4 && r == '-' {
 
+				return l.lexDateTimeOrTime()
 
+			}
 
+			return l.lexNumber()
 
+		}
 
+	}
 
+	return l.lexNumber()
 
+}
 
+
 
 func (l *tomlLexer) lexLeftCurlyBrace() tomlLexStateFn {
 
 	l.next()
 
 	l.emit(tokenLeftCurlyBrace)
 
@@ -254,14 +271,245 @@ func (l *tomlLexer) lexRightCurlyBrace() tomlLexStateFn {
 
 	return l.lexRvalue
 
 }
 
 
-func (l *tomlLexer) lexDate() tomlLexStateFn {
 
-	l.emit(tokenDate)
 
-	return l.lexRvalue
 
+func (l *tomlLexer) lexDateTimeOrTime() tomlLexStateFn {
 
+	// Example matches:
 
+	// 1979-05-27T07:32:00Z
 
+	// 1979-05-27T00:32:00-07:00
 
+	// 1979-05-27T00:32:00.999999-07:00
 
+	// 1979-05-27 07:32:00Z
 
+	// 1979-05-27 00:32:00-07:00
 
+	// 1979-05-27 00:32:00.999999-07:00
 
+	// 1979-05-27T07:32:00
 
+	// 1979-05-27T00:32:00.999999
 
+	// 1979-05-27 07:32:00
 
+	// 1979-05-27 00:32:00.999999
 
+	// 1979-05-27
 
+	// 07:32:00
 
+	// 00:32:00.999999
 
+
 
+	// we already know those two are digits
 
+	l.next()
 
+	l.next()
 
+
 
+	// Got 2 digits. At that point it could be either a time or a date(-time).
 
+
 
+	r := l.next()
 
+	if r == ':' {
 
+		return l.lexTime()
 
+	}
 
+
 
+	return l.lexDateTime()
 
 }
 
 
-func (l *tomlLexer) lexLocalDate() tomlLexStateFn {
 
+func (l *tomlLexer) lexDateTime() tomlLexStateFn {
 
+	// This state accepts an offset date-time, a local date-time, or a local date.
 
+	//
 
+	//   v--- cursor
 
+	// 1979-05-27T07:32:00Z
 
+	// 1979-05-27T00:32:00-07:00
 
+	// 1979-05-27T00:32:00.999999-07:00
 
+	// 1979-05-27 07:32:00Z
 
+	// 1979-05-27 00:32:00-07:00
 
+	// 1979-05-27 00:32:00.999999-07:00
 
+	// 1979-05-27T07:32:00
 
+	// 1979-05-27T00:32:00.999999
 
+	// 1979-05-27 07:32:00
 
+	// 1979-05-27 00:32:00.999999
 
+	// 1979-05-27
 
+
 
+	// date
 
+
 
+	// already checked by lexRvalue
 
+	l.next() // digit
 
+	l.next() // -
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid month digit in date: %c", r)
 
+		}
 
+	}
 
+
 
+	r := l.next()
 
+	if r != '-' {
 
+		return l.errorf("expected - to separate month of a date, not %c", r)
 
+	}
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid day digit in date: %c", r)
 
+		}
 
+	}
 
+
 
 	l.emit(tokenLocalDate)
 
+
 
+	r = l.peek()
 
+
 
+	if r == eof {
 
+
 
+		return l.lexRvalue
 
+	}
 
+
 
+	if r != ' ' && r != 'T' {
 
+		return l.errorf("incorrect date/time separation character: %c", r)
 
+	}
 
+
 
+	if r == ' ' {
 
+		lookAhead := l.peekString(3)[1:]
 
+		if len(lookAhead) < 2 {
 
+			return l.lexRvalue
 
+		}
 
+		for _, r := range lookAhead {
 
+			if !isDigit(r) {
 
+				return l.lexRvalue
 
+			}
 
+		}
 
+	}
 
+
 
+	l.skip() // skip the T or ' '
 
+
 
+	// time
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid hour digit in time: %c", r)
 
+		}
 
+	}
 
+
 
+	r = l.next()
 
+	if r != ':' {
 
+		return l.errorf("time hour/minute separator should be :, not %c", r)
 
+	}
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid minute digit in time: %c", r)
 
+		}
 
+	}
 
+
 
+	r = l.next()
 
+	if r != ':' {
 
+		return l.errorf("time minute/second separator should be :, not %c", r)
 
+	}
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid second digit in time: %c", r)
 
+		}
 
+	}
 
+
 
+	r = l.peek()
 
+	if r == '.' {
 
+		l.next()
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("expected at least one digit in time's fraction, not %c", r)
 
+		}
 
+
 
+		for {
 
+			r := l.peek()
 
+			if !isDigit(r) {
 
+				break
 
+			}
 
+			l.next()
 
+		}
 
+	}
 
+
 
+	l.emit(tokenLocalTime)
 
+
 
+	return l.lexTimeOffset
 
+
 
+}
 
+
 
+func (l *tomlLexer) lexTimeOffset() tomlLexStateFn {
 
+	// potential offset
 
+
 
+	// Z
 
+	// -07:00
 
+	// +07:00
 
+	// nothing
 
+
 
+	r := l.peek()
 
+
 
+	if r == 'Z' {
 
+		l.next()
 
+		l.emit(tokenTimeOffset)
 
+	} else if r == '+' || r == '-' {
 
+		l.next()
 
+
 
+		for i := 0; i < 2; i++ {
 
+			r := l.next()
 
+			if !isDigit(r) {
 
+				return l.errorf("invalid hour digit in time offset: %c", r)
 
+			}
 
+		}
 
+
 
+		r = l.next()
 
+		if r != ':' {
 
+			return l.errorf("time offset hour/minute separator should be :, not %c", r)
 
+		}
 
+
 
+		for i := 0; i < 2; i++ {
 
+			r := l.next()
 
+			if !isDigit(r) {
 
+				return l.errorf("invalid minute digit in time offset: %c", r)
 
+			}
 
+		}
 
+
 
+		l.emit(tokenTimeOffset)
 
+	}
 
+
 
+	return l.lexRvalue
 
+}
 
+
 
+func (l *tomlLexer) lexTime() tomlLexStateFn {
 
+	//   v--- cursor
 
+	// 07:32:00
 
+	// 00:32:00.999999
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid minute digit in time: %c", r)
 
+		}
 
+	}
 
+
 
+	r := l.next()
 
+	if r != ':' {
 
+		return l.errorf("time minute/second separator should be :, not %c", r)
 
+	}
 
+
 
+	for i := 0; i < 2; i++ {
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("invalid second digit in time: %c", r)
 
+		}
 
+	}
 
+
 
+	r = l.peek()
 
+	if r == '.' {
 
+		l.next()
 
+		r := l.next()
 
+		if !isDigit(r) {
 
+			return l.errorf("expected at least one digit in time's fraction, not %c", r)
 
+		}
 
+
 
+		for {
 
+			r := l.peek()
 
+			if !isDigit(r) {
 
+				break
 
+			}
 
+			l.next()
 
+		}
 
+	}
 
+
 
+	l.emit(tokenLocalTime)
 
 	return l.lexRvalue
 
+
 
 }
 
 
 func (l *tomlLexer) lexTrue() tomlLexStateFn {
 
@@ -767,30 +1015,6 @@ func (l *tomlLexer) run() {
 
 	}
 
 }
 
 
-func init() {
 
-	// Regexp for all date/time formats supported by TOML.
 
-	// Group 1: nano precision
 
-	// Group 2: timezone
 
-	//
 
-	// /!\ also matches the empty string
 
-	//
 
-	// Example matches:
 
-	// 1979-05-27T07:32:00Z
 
-	// 1979-05-27T00:32:00-07:00
 
-	// 1979-05-27T00:32:00.999999-07:00
 
-	// 1979-05-27 07:32:00Z
 
-	// 1979-05-27 00:32:00-07:00
 
-	// 1979-05-27 00:32:00.999999-07:00
 
-	// 1979-05-27T07:32:00
 
-	// 1979-05-27T00:32:00.999999
 
-	// 1979-05-27 07:32:00
 
-	// 1979-05-27 00:32:00.999999
 
-	// 1979-05-27
 
-	// 07:32:00
 
-	// 00:32:00.999999
 
-	dateRegexp = regexp.MustCompile(`^(?:\d{1,4}-\d{2}-\d{2})?(?:[T ]?\d{2}:\d{2}:\d{2}(\.\d{1,9})?(Z|[+-]\d{2}:\d{2})?)?`)
 
-}
 
-
 
 // Entry point
 
 func lexToml(inputBytes []byte) []token {
 
 	runes := bytes.Runes(inputBytes)

+ 38 - 6
vendor/github.com/pelletier/go-toml/marshal.go
Vedi File 

@@ -18,6 +18,7 @@ const (
 
 	tagFieldComment = "comment"
 
 	tagCommented    = "commented"
 
 	tagMultiline    = "multiline"
 
+	tagLiteral      = "literal"
 
 	tagDefault      = "default"
 
 )
 
 
@@ -27,6 +28,7 @@ type tomlOpts struct {
 
 	comment      string
 
 	commented    bool
 
 	multiline    bool
 
+	literal      bool
 
 	include      bool
 
 	omitempty    bool
 
 	defaultValue string
 
@@ -46,6 +48,7 @@ type annotation struct {
 
 	comment      string
 
 	commented    string
 
 	multiline    string
 
+	literal      string
 
 	defaultValue string
 
 }
 
 
@@ -54,15 +57,16 @@ var annotationDefault = annotation{
 
 	comment:      tagFieldComment,
 
 	commented:    tagCommented,
 
 	multiline:    tagMultiline,
 
+	literal:      tagLiteral,
 
 	defaultValue: tagDefault,
 
 }
 
 
-type marshalOrder int
 
+type MarshalOrder int
 
 
 // Orders the Encoder can write the fields to the output stream.
 
 const (
 
 	// Sort fields alphabetically.
 
-	OrderAlphabetical marshalOrder = iota + 1
 
+	OrderAlphabetical MarshalOrder = iota + 1
 
 	// Preserve the order the fields are encountered. For example, the order of fields in
 
 	// a struct.
 
 	OrderPreserve
 
@@ -256,7 +260,7 @@ type Encoder struct {
 
 	annotation
 
 	line        int
 
 	col         int
 
-	order       marshalOrder
 
+	order       MarshalOrder
 
 	promoteAnon bool
 
 	indentation string
 
 }
 
@@ -317,7 +321,7 @@ func (e *Encoder) ArraysWithOneElementPerLine(v bool) *Encoder {
 
 }
 
 
 // Order allows to change in which order fields will be written to the output stream.
 
-func (e *Encoder) Order(ord marshalOrder) *Encoder {
 
+func (e *Encoder) Order(ord MarshalOrder) *Encoder {
 
 	e.order = ord
 
 	return e
 
 }
 
@@ -442,6 +446,7 @@ func (e *Encoder) valueToTree(mtype reflect.Type, mval reflect.Value) (*Tree, er
 
 							Comment:   opts.comment,
 
 							Commented: opts.commented,
 
 							Multiline: opts.multiline,
 
+							Literal:   opts.literal,
 
 						}, val)
 
 					}
 
 				}
 
@@ -586,6 +591,7 @@ func (e *Encoder) wrapTomlValue(val interface{}, parent *Tree) interface{} {
 
 	_, isTree := val.(*Tree)
 
 	_, isTreeS := val.([]*Tree)
 
 	if isTree || isTreeS {
 
+		e.line++
 
 		return val
 
 	}
 
 
@@ -830,7 +836,21 @@ func (d *Decoder) valueFromTree(mtype reflect.Type, tval *Tree, mval1 *reflect.V
 
 					case reflect.Int32:
 
 						val, err = strconv.ParseInt(opts.defaultValue, 10, 32)
 
 					case reflect.Int64:
 
-						val, err = strconv.ParseInt(opts.defaultValue, 10, 64)
 
+						// Check if the provided number has a non-numeric extension.
 
+						var hasExtension bool
 
+						if len(opts.defaultValue) > 0 {
 
+							lastChar := opts.defaultValue[len(opts.defaultValue)-1]
 
+							if lastChar < '0' || lastChar > '9' {
 
+								hasExtension = true
 
+							}
 
+						}
 
+						// If the value is a time.Duration with extension, parse as duration.
 
+						// If the value is an int64 or a time.Duration without extension, parse as number.
 
+						if hasExtension && mvalf.Type().String() == "time.Duration" {
 
+							val, err = time.ParseDuration(opts.defaultValue)
 
+						} else {
 
+							val, err = strconv.ParseInt(opts.defaultValue, 10, 64)
 
+						}
 
 					case reflect.Float32:
 
 						val, err = strconv.ParseFloat(opts.defaultValue, 32)
 
 					case reflect.Float64:
 
@@ -1004,8 +1024,18 @@ func (d *Decoder) valueFromToml(mtype reflect.Type, tval interface{}, mval1 *ref
 
 		return reflect.ValueOf(nil), fmt.Errorf("Can't convert %v(%T) to a slice", tval, tval)
 
 	default:
 
 		d.visitor.visit()
 
+		mvalPtr := reflect.New(mtype)
 
+
 
+		// Check if pointer to value implements the Unmarshaler interface.
 
+		if isCustomUnmarshaler(mvalPtr.Type()) {
 
+			if err := callCustomUnmarshaler(mvalPtr, tval); err != nil {
 
+				return reflect.ValueOf(nil), fmt.Errorf("unmarshal toml: %v", err)
 
+			}
 
+			return mvalPtr.Elem(), nil
 
+		}
 
+
 
 		// Check if pointer to value implements the encoding.TextUnmarshaler.
 
-		if mvalPtr := reflect.New(mtype); isTextUnmarshaler(mvalPtr.Type()) && !isTimeType(mtype) {
 
+		if isTextUnmarshaler(mvalPtr.Type()) && !isTimeType(mtype) {
 
 			if err := d.unmarshalText(tval, mvalPtr); err != nil {
 
 				return reflect.ValueOf(nil), fmt.Errorf("unmarshal text: %v", err)
 
 			}
 
@@ -1144,6 +1174,7 @@ func tomlOptions(vf reflect.StructField, an annotation) tomlOpts {
 
 	}
 
 	commented, _ := strconv.ParseBool(vf.Tag.Get(an.commented))
 
 	multiline, _ := strconv.ParseBool(vf.Tag.Get(an.multiline))
 
+	literal, _ := strconv.ParseBool(vf.Tag.Get(an.literal))
 
 	defaultValue := vf.Tag.Get(tagDefault)
 
 	result := tomlOpts{
 
 		name:         vf.Name,
 
@@ -1151,6 +1182,7 @@ func tomlOptions(vf reflect.StructField, an annotation) tomlOpts {
 
 		comment:      comment,
 
 		commented:    commented,
 
 		multiline:    multiline,
 
+		literal:      literal,
 
 		include:      true,
 
 		omitempty:    false,
 
 		defaultValue: defaultValue,

+ 54 - 39
vendor/github.com/pelletier/go-toml/parser.go
Vedi File 

@@ -7,7 +7,6 @@ import (
 
 	"fmt"
 
 	"math"
 
 	"reflect"
 
-	"regexp"
 
 	"strconv"
 
 	"strings"
 
 	"time"
 
@@ -231,19 +230,38 @@ func (p *tomlParser) parseAssign() tomlParserStateFn {
 
 	return p.parseStart
 
 }
 
 
-var numberUnderscoreInvalidRegexp *regexp.Regexp
 
-var hexNumberUnderscoreInvalidRegexp *regexp.Regexp
 
+var errInvalidUnderscore = errors.New("invalid use of _ in number")
 
 
 func numberContainsInvalidUnderscore(value string) error {
 
-	if numberUnderscoreInvalidRegexp.MatchString(value) {
 
-		return errors.New("invalid use of _ in number")
 
+	// For large numbers, you may use underscores between digits to enhance
 
+	// readability. Each underscore must be surrounded by at least one digit on
 
+	// each side.
 
+
 
+	hasBefore := false
 
+	for idx, r := range value {
 
+		if r == '_' {
 
+			if !hasBefore || idx+1 >= len(value) {
 
+				// can't end with an underscore
 
+				return errInvalidUnderscore
 
+			}
 
+		}
 
+		hasBefore = isDigit(r)
 
 	}
 
 	return nil
 
 }
 
 
+var errInvalidUnderscoreHex = errors.New("invalid use of _ in hex number")
 
+
 
 func hexNumberContainsInvalidUnderscore(value string) error {
 
-	if hexNumberUnderscoreInvalidRegexp.MatchString(value) {
 
-		return errors.New("invalid use of _ in hex number")
 
+	hasBefore := false
 
+	for idx, r := range value {
 
+		if r == '_' {
 
+			if !hasBefore || idx+1 >= len(value) {
 
+				// can't end with an underscore
 
+				return errInvalidUnderscoreHex
 
+			}
 
+		}
 
+		hasBefore = isHexDigit(r)
 
 	}
 
 	return nil
 
 }
 
@@ -322,42 +340,44 @@ func (p *tomlParser) parseRvalue() interface{} {
 
 			p.raiseError(tok, "%s", err)
 
 		}
 
 		return val
 
-	case tokenDate:
 
-		layout := time.RFC3339Nano
 
-		if !strings.Contains(tok.val, "T") {
 
-			layout = strings.Replace(layout, "T", " ", 1)
 
-		}
 
-		val, err := time.ParseInLocation(layout, tok.val, time.UTC)
 
+	case tokenLocalTime:
 
+		val, err := ParseLocalTime(tok.val)
 
 		if err != nil {
 
 			p.raiseError(tok, "%s", err)
 
 		}
 
 		return val
 
 	case tokenLocalDate:
 
-		v := strings.Replace(tok.val, " ", "T", -1)
 
-		isDateTime := false
 
-		isTime := false
 
-		for _, c := range v {
 
-			if c == 'T' || c == 't' {
 
-				isDateTime = true
 
-				break
 
-			}
 
-			if c == ':' {
 
-				isTime = true
 
-				break
 
+		// a local date may be followed by:
 
+		// * nothing: this is a local date
 
+		// * a local time: this is a local date-time
 
+
 
+		next := p.peek()
 
+		if next == nil || next.typ != tokenLocalTime {
 
+			val, err := ParseLocalDate(tok.val)
 
+			if err != nil {
 
+				p.raiseError(tok, "%s", err)
 
 			}
 
+			return val
 
 		}
 
 
-		var val interface{}
 
-		var err error
 
+		localDate := tok
 
+		localTime := p.getToken()
 
 
-		if isDateTime {
 
-			val, err = ParseLocalDateTime(v)
 
-		} else if isTime {
 
-			val, err = ParseLocalTime(v)
 
-		} else {
 
-			val, err = ParseLocalDate(v)
 
+		next = p.peek()
 
+		if next == nil || next.typ != tokenTimeOffset {
 
+			v := localDate.val + "T" + localTime.val
 
+			val, err := ParseLocalDateTime(v)
 
+			if err != nil {
 
+				p.raiseError(tok, "%s", err)
 
+			}
 
+			return val
 
 		}
 
 
+		offset := p.getToken()
 
+
 
+		layout := time.RFC3339Nano
 
+		v := localDate.val + "T" + localTime.val + offset.val
 
+		val, err := time.ParseInLocation(layout, v, time.UTC)
 
 		if err != nil {
 
 			p.raiseError(tok, "%s", err)
 
 		}
 
@@ -370,10 +390,10 @@ func (p *tomlParser) parseRvalue() interface{} {
 
 		p.raiseError(tok, "cannot have multiple equals for the same key")
 
 	case tokenError:
 
 		p.raiseError(tok, "%s", tok)
 
+	default:
 
+		panic(fmt.Errorf("unhandled token: %v", tok))
 
 	}
 
 
-	p.raiseError(tok, "never reached")
 
-
 
 	return nil
 
 }
 
 
@@ -486,8 +506,3 @@ func parseToml(flow []token) *Tree {
 
 	parser.run()
 
 	return result
 
 }
 
-
 
-func init() {
 
-	numberUnderscoreInvalidRegexp = regexp.MustCompile(`([^\d]_|_[^\d])|_$|^_`)
 
-	hexNumberUnderscoreInvalidRegexp = regexp.MustCompile(`(^0x_)|([^\da-f]_|_[^\da-f])|_$|^_`)
 
-}

+ 4 - 2
vendor/github.com/pelletier/go-toml/token.go
Vedi File 

@@ -30,8 +30,9 @@ const (
 
 	tokenRightParen
 
 	tokenDoubleLeftBracket
 
 	tokenDoubleRightBracket
 
-	tokenDate
 
 	tokenLocalDate
 
+	tokenLocalTime
 
+	tokenTimeOffset
 
 	tokenKeyGroup
 
 	tokenKeyGroupArray
 
 	tokenComma
 
@@ -66,7 +67,8 @@ var tokenTypeNames = []string{
 
 	"]]",
 
 	"[[",
 
 	"LocalDate",
 
-	"LocalDate",
 
+	"LocalTime",
 
+	"TimeOffset",
 
 	"KeyGroup",
 
 	"KeyGroupArray",
 
 	",",

+ 4 - 0
vendor/github.com/pelletier/go-toml/toml.go
Vedi File 

@@ -15,6 +15,7 @@ type tomlValue struct {
 
 	comment   string
 
 	commented bool
 
 	multiline bool
 
+	literal   bool
 
 	position  Position
 
 }
 
 
@@ -314,6 +315,7 @@ type SetOptions struct {
 
 	Comment   string
 
 	Commented bool
 
 	Multiline bool
 
+	Literal   bool
 
 }
 
 
 // SetWithOptions is the same as Set, but allows you to provide formatting
 
@@ -362,12 +364,14 @@ func (t *Tree) SetPathWithOptions(keys []string, opts SetOptions, value interfac
 
 		v.comment = opts.Comment
 
 		v.commented = opts.Commented
 
 		v.multiline = opts.Multiline
 
+		v.literal = opts.Literal
 
 		toInsert = v
 
 	default:
 
 		toInsert = &tomlValue{value: value,
 
 			comment:   opts.Comment,
 
 			commented: opts.Commented,
 
 			multiline: opts.Multiline,
 
+			literal:   opts.Literal,
 
 			position:  Position{Line: subtree.position.Line + len(subtree.values) + 1, Col: subtree.position.Col}}
 
 	}

+ 71 - 0
vendor/github.com/pelletier/go-toml/tomlpub.go
Vedi File 

@@ -0,0 +1,71 @@
 
+package toml
 
+
 
+// PubTOMLValue wrapping tomlValue in order to access all properties from outside.
 
+type PubTOMLValue = tomlValue
 
+
 
+func (ptv *PubTOMLValue) Value() interface{} {
 
+	return ptv.value
 
+}
 
+func (ptv *PubTOMLValue) Comment() string {
 
+	return ptv.comment
 
+}
 
+func (ptv *PubTOMLValue) Commented() bool {
 
+	return ptv.commented
 
+}
 
+func (ptv *PubTOMLValue) Multiline() bool {
 
+	return ptv.multiline
 
+}
 
+func (ptv *PubTOMLValue) Position() Position {
 
+	return ptv.position
 
+}
 
+
 
+func (ptv *PubTOMLValue) SetValue(v interface{}) {
 
+	ptv.value = v
 
+}
 
+func (ptv *PubTOMLValue) SetComment(s string) {
 
+	ptv.comment = s
 
+}
 
+func (ptv *PubTOMLValue) SetCommented(c bool) {
 
+	ptv.commented = c
 
+}
 
+func (ptv *PubTOMLValue) SetMultiline(m bool) {
 
+	ptv.multiline = m
 
+}
 
+func (ptv *PubTOMLValue) SetPosition(p Position) {
 
+	ptv.position = p
 
+}
 
+
 
+// PubTree wrapping Tree in order to access all properties from outside.
 
+type PubTree = Tree
 
+
 
+func (pt *PubTree) Values() map[string]interface{} {
 
+	return pt.values
 
+}
 
+
 
+func (pt *PubTree) Comment() string {
 
+	return pt.comment
 
+}
 
+
 
+func (pt *PubTree) Commented() bool {
 
+	return pt.commented
 
+}
 
+
 
+func (pt *PubTree) Inline() bool {
 
+	return pt.inline
 
+}
 
+
 
+func (pt *PubTree) SetValues(v map[string]interface{}) {
 
+	pt.values = v
 
+}
 
+
 
+func (pt *PubTree) SetComment(c string) {
 
+	pt.comment = c
 
+}
 
+
 
+func (pt *PubTree) SetCommented(c bool) {
 
+	pt.commented = c
 
+}
 
+
 
+func (pt *PubTree) SetInline(i bool) {
 
+	pt.inline = i
 
+}

+ 34 - 6
vendor/github.com/pelletier/go-toml/tomltree_write.go
Vedi File 

@@ -103,7 +103,7 @@ func encodeTomlString(value string) string {
 
 	return b.String()
 
 }
 
 
-func tomlTreeStringRepresentation(t *Tree, ord marshalOrder) (string, error) {
 
+func tomlTreeStringRepresentation(t *Tree, ord MarshalOrder) (string, error) {
 
 	var orderedVals []sortNode
 
 	switch ord {
 
 	case OrderPreserve:
 
@@ -126,7 +126,7 @@ func tomlTreeStringRepresentation(t *Tree, ord marshalOrder) (string, error) {
 
 	return "{ " + strings.Join(values, ", ") + " }", nil
 
 }
 
 
-func tomlValueStringRepresentation(v interface{}, commented string, indent string, ord marshalOrder, arraysOneElementPerLine bool) (string, error) {
 
+func tomlValueStringRepresentation(v interface{}, commented string, indent string, ord MarshalOrder, arraysOneElementPerLine bool) (string, error) {
 
 	// this interface check is added to dereference the change made in the writeTo function.
 
 	// That change was made to allow this function to see formatting options.
 
 	tv, ok := v.(*tomlValue)
 
@@ -158,7 +158,15 @@ func tomlValueStringRepresentation(v interface{}, commented string, indent strin
 
 		return strings.ToLower(strconv.FormatFloat(value, 'f', -1, bits)), nil
 
 	case string:
 
 		if tv.multiline {
 
-			return "\"\"\"\n" + encodeMultilineTomlString(value, commented) + "\"\"\"", nil
 
+			if tv.literal {
 
+				b := strings.Builder{}
 
+				b.WriteString("'''\n")
 
+				b.Write([]byte(value))
 
+				b.WriteString("\n'''")
 
+				return b.String(), nil
 
+			} else {
 
+				return "\"\"\"\n" + encodeMultilineTomlString(value, commented) + "\"\"\"", nil
 
+			}
 
 		}
 
 		return "\"" + encodeTomlString(value) + "\"", nil
 
 	case []byte:
 
@@ -218,7 +226,9 @@ func tomlValueStringRepresentation(v interface{}, commented string, indent strin
 
 }
 
 
 func getTreeArrayLine(trees []*Tree) (line int) {
 
-	// get lowest line number that is not 0
 
+	// Prevent returning 0 for empty trees
 
+	line = int(^uint(0) >> 1)
 
+	// get lowest line number >= 0
 
 	for _, tv := range trees {
 
 		if tv.position.Line < line || line == 0 {
 
 			line = tv.position.Line
 
@@ -310,7 +320,7 @@ func (t *Tree) writeTo(w io.Writer, indent, keyspace string, bytesCount int64, a
 
 	return t.writeToOrdered(w, indent, keyspace, bytesCount, arraysOneElementPerLine, OrderAlphabetical, "  ", false)
 
 }
 
 
-func (t *Tree) writeToOrdered(w io.Writer, indent, keyspace string, bytesCount int64, arraysOneElementPerLine bool, ord marshalOrder, indentString string, parentCommented bool) (int64, error) {
 
+func (t *Tree) writeToOrdered(w io.Writer, indent, keyspace string, bytesCount int64, arraysOneElementPerLine bool, ord MarshalOrder, indentString string, parentCommented bool) (int64, error) {
 
 	var orderedVals []sortNode
 
 
 	switch ord {
 
@@ -510,8 +520,26 @@ func (t *Tree) ToMap() map[string]interface{} {
 
 		case *Tree:
 
 			result[k] = node.ToMap()
 
 		case *tomlValue:
 
-			result[k] = node.value
 
+			result[k] = tomlValueToGo(node.value)
 
 		}
 
 	}
 
 	return result
 
 }
 
+
 
+func tomlValueToGo(v interface{}) interface{} {
 
+	if tree, ok := v.(*Tree); ok {
 
+		return tree.ToMap()
 
+	}
 
+
 
+	rv := reflect.ValueOf(v)
 
+
 
+	if rv.Kind() != reflect.Slice {
 
+		return v
 
+	}
 
+	values := make([]interface{}, rv.Len())
 
+	for i := 0; i < rv.Len(); i++ {
 
+		item := rv.Index(i).Interface()
 
+		values[i] = tomlValueToGo(item)
 
+	}
 
+	return values
 
+}

+ 6 - 0
vendor/github.com/pelletier/go-toml/tomltree_writepub.go
Vedi File 

@@ -0,0 +1,6 @@
 
+package toml
 
+
 
+// ValueStringRepresentation transforms an interface{} value into its toml string representation.
 
+func ValueStringRepresentation(v interface{}, commented string, indent string, ord MarshalOrder, arraysOneElementPerLine bool) (string, error) {
 
+	return tomlValueStringRepresentation(v, commented, indent, ord, arraysOneElementPerLine)
 
+}

+ 4 - 0
vendor/github.com/prometheus/common/model/time.go
Vedi File 

@@ -186,6 +186,10 @@ var durationRE = regexp.MustCompile("^([0-9]+)(y|w|d|h|m|s|ms)$")
 
 // ParseDuration parses a string into a time.Duration, assuming that a year
 
 // always has 365d, a week always has 7d, and a day always has 24h.
 
 func ParseDuration(durationStr string) (Duration, error) {
 
+	// Allow 0 without a unit.
 
+	if durationStr == "0" {
 
+		return 0, nil
 
+	}
 
 	matches := durationRE.FindStringSubmatch(durationStr)
 
 	if len(matches) != 3 {
 
 		return 0, fmt.Errorf("not a valid duration string: %q", durationStr)

+ 2 - 0
vendor/go.etcd.io/bbolt/.gitignore
Vedi File 

@@ -3,3 +3,5 @@
 
 *.swp
 
 /bin/
 
 cover.out
 
+/.idea
 
+*.iml

+ 2 - 1
vendor/go.etcd.io/bbolt/.travis.yml
Vedi File 

@@ -4,9 +4,10 @@ go_import_path: go.etcd.io/bbolt
 
 sudo: false
 
 
 go:
 
-- 1.12
 
+- 1.15
 
 
 before_install:
 
+- go get -v golang.org/x/sys/unix
 
 - go get -v honnef.co/go/tools/...
 
 - go get -v github.com/kisielk/errcheck

+ 0 - 2
vendor/go.etcd.io/bbolt/Makefile
Vedi File 

@@ -2,8 +2,6 @@ BRANCH=`git rev-parse --abbrev-ref HEAD`
 
 COMMIT=`git rev-parse --short HEAD`
 
 GOLDFLAGS="-X main.branch $(BRANCH) -X main.commit $(COMMIT)"
 
 
-default: build
 
-
 
 race:
 
 	@TEST_FREELIST_TYPE=hashmap go test -v -race -test.run="TestSimulate_(100op|1000op)"
 
 	@echo "array freelist test"

+ 3 - 2
vendor/go.etcd.io/bbolt/README.md
Vedi File 

@@ -908,12 +908,14 @@ Below is a list of public, open source projects that use Bolt:
 
 * [BoltStore](https://github.com/yosssi/boltstore) - Session store using Bolt.
 
 * [Boltdb Boilerplate](https://github.com/bobintornado/boltdb-boilerplate) - Boilerplate wrapper around bolt aiming to make simple calls one-liners.
 
 * [BoltDbWeb](https://github.com/evnix/boltdbweb) - A web based GUI for BoltDB files.
 
+* [BoltDB Viewer](https://github.com/zc310/rich_boltdb) - A BoltDB Viewer Can run on Windows、Linux、Android system.
 
 * [bleve](http://www.blevesearch.com/) - A pure Go search engine similar to ElasticSearch that uses Bolt as the default storage backend.
 
 * [btcwallet](https://github.com/btcsuite/btcwallet) - A bitcoin wallet.
 
 * [buckets](https://github.com/joyrexus/buckets) - a bolt wrapper streamlining
 
   simple tx and key scans.
 
 * [cayley](https://github.com/google/cayley) - Cayley is an open-source graph database using Bolt as optional backend.
 
 * [ChainStore](https://github.com/pressly/chainstore) - Simple key-value interface to a variety of storage engines organized as a chain of operations.
 
+* [🌰 Chestnut](https://github.com/jrapoport/chestnut) - Chestnut is encrypted storage for Go.
 
 * [Consul](https://github.com/hashicorp/consul) - Consul is service discovery and configuration made easy. Distributed, highly available, and datacenter-aware.
 
 * [DVID](https://github.com/janelia-flyem/dvid) - Added Bolt as optional storage engine and testing it against Basho-tuned leveldb.
 
 * [dcrwallet](https://github.com/decred/dcrwallet) - A wallet for the Decred cryptocurrency.
 
@@ -938,9 +940,8 @@ Below is a list of public, open source projects that use Bolt:
 
 * [MetricBase](https://github.com/msiebuhr/MetricBase) - Single-binary version of Graphite.
 
 * [MuLiFS](https://github.com/dankomiocevic/mulifs) - Music Library Filesystem creates a filesystem to organise your music files.
 
 * [NATS](https://github.com/nats-io/nats-streaming-server) - NATS Streaming uses bbolt for message and metadata storage.
 
-* [Operation Go: A Routine Mission](http://gocode.io) - An online programming game for Golang using Bolt for user accounts and a leaderboard.
 
-* [photosite/session](https://godoc.org/bitbucket.org/kardianos/photosite/session) - Sessions for a photo viewing site.
 
 * [Prometheus Annotation Server](https://github.com/oliver006/prom_annotation_server) - Annotation server for PromDash & Prometheus service monitoring system.
 
+* [Rain](https://github.com/cenkalti/rain) - BitTorrent client and library.
 
 * [reef-pi](https://github.com/reef-pi/reef-pi) - reef-pi is an award winning, modular, DIY reef tank controller using easy to learn electronics based on a Raspberry Pi.
 
 * [Request Baskets](https://github.com/darklynx/request-baskets) - A web service to collect arbitrary HTTP requests and inspect them via REST API or simple web UI, similar to [RequestBin](http://requestb.in/) service
 
 * [Seaweed File System](https://github.com/chrislusf/seaweedfs) - Highly scalable distributed key~file system with O(1) disk read.

+ 5 - 12
vendor/go.etcd.io/bbolt/bolt_unix.go
Vedi File 

@@ -7,6 +7,8 @@ import (
 
 	"syscall"
 
 	"time"
 
 	"unsafe"
 
+
 
+	"golang.org/x/sys/unix"
 
 )
 
 
 // flock acquires an advisory lock on a file descriptor.
 
@@ -49,13 +51,13 @@ func funlock(db *DB) error {
 
 // mmap memory maps a DB's data file.
 
 func mmap(db *DB, sz int) error {
 
 	// Map the data file to memory.
 
-	b, err := syscall.Mmap(int(db.file.Fd()), 0, sz, syscall.PROT_READ, syscall.MAP_SHARED|db.MmapFlags)
 
+	b, err := unix.Mmap(int(db.file.Fd()), 0, sz, syscall.PROT_READ, syscall.MAP_SHARED|db.MmapFlags)
 
 	if err != nil {
 
 		return err
 
 	}
 
 
 	// Advise the kernel that the mmap is accessed randomly.
 
-	err = madvise(b, syscall.MADV_RANDOM)
 
+	err = unix.Madvise(b, syscall.MADV_RANDOM)
 
 	if err != nil && err != syscall.ENOSYS {
 
 		// Ignore not implemented error in kernel because it still works.
 
 		return fmt.Errorf("madvise: %s", err)
 
@@ -76,18 +78,9 @@ func munmap(db *DB) error {
 
 	}
 
 
 	// Unmap using the original byte slice.
 
-	err := syscall.Munmap(db.dataref)
 
+	err := unix.Munmap(db.dataref)
 
 	db.dataref = nil
 
 	db.data = nil
 
 	db.datasz = 0
 
 	return err
 
 }
 
-
 
-// NOTE: This function is copied from stdlib because it is not available on darwin.
 
-func madvise(b []byte, advice int) (err error) {
 
-	_, _, e1 := syscall.Syscall(syscall.SYS_MADVISE, uintptr(unsafe.Pointer(&b[0])), uintptr(len(b)), uintptr(advice))
 
-	if e1 != 0 {
 
-		err = e1
 
-	}
 
-	return
 
-}

+ 114 - 0
vendor/go.etcd.io/bbolt/compact.go
Vedi File 

@@ -0,0 +1,114 @@
 
+package bbolt
 
+
 
+// Compact will create a copy of the source DB and in the destination DB. This may
 
+// reclaim space that the source database no longer has use for. txMaxSize can be
 
+// used to limit the transactions size of this process and may trigger intermittent
 
+// commits. A value of zero will ignore transaction sizes.
 
+// TODO: merge with: https://github.com/etcd-io/etcd/blob/b7f0f52a16dbf83f18ca1d803f7892d750366a94/mvcc/backend/backend.go#L349
 
+func Compact(dst, src *DB, txMaxSize int64) error {
 
+	// commit regularly, or we'll run out of memory for large datasets if using one transaction.
 
+	var size int64
 
+	tx, err := dst.Begin(true)
 
+	if err != nil {
 
+		return err
 
+	}
 
+	defer tx.Rollback()
 
+
 
+	if err := walk(src, func(keys [][]byte, k, v []byte, seq uint64) error {
 
+		// On each key/value, check if we have exceeded tx size.
 
+		sz := int64(len(k) + len(v))
 
+		if size+sz > txMaxSize && txMaxSize != 0 {
 
+			// Commit previous transaction.
 
+			if err := tx.Commit(); err != nil {
 
+				return err
 
+			}
 
+
 
+			// Start new transaction.
 
+			tx, err = dst.Begin(true)
 
+			if err != nil {
 
+				return err
 
+			}
 
+			size = 0
 
+		}
 
+		size += sz
 
+
 
+		// Create bucket on the root transaction if this is the first level.
 
+		nk := len(keys)
 
+		if nk == 0 {
 
+			bkt, err := tx.CreateBucket(k)
 
+			if err != nil {
 
+				return err
 
+			}
 
+			if err := bkt.SetSequence(seq); err != nil {
 
+				return err
 
+			}
 
+			return nil
 
+		}
 
+
 
+		// Create buckets on subsequent levels, if necessary.
 
+		b := tx.Bucket(keys[0])
 
+		if nk > 1 {
 
+			for _, k := range keys[1:] {
 
+				b = b.Bucket(k)
 
+			}
 
+		}
 
+
 
+		// Fill the entire page for best compaction.
 
+		b.FillPercent = 1.0
 
+
 
+		// If there is no value then this is a bucket call.
 
+		if v == nil {
 
+			bkt, err := b.CreateBucket(k)
 
+			if err != nil {
 
+				return err
 
+			}
 
+			if err := bkt.SetSequence(seq); err != nil {
 
+				return err
 
+			}
 
+			return nil
 
+		}
 
+
 
+		// Otherwise treat it as a key/value pair.
 
+		return b.Put(k, v)
 
+	}); err != nil {
 
+		return err
 
+	}
 
+
 
+	return tx.Commit()
 
+}
 
+
 
+// walkFunc is the type of the function called for keys (buckets and "normal"
 
+// values) discovered by Walk. keys is the list of keys to descend to the bucket
 
+// owning the discovered key/value pair k/v.
 
+type walkFunc func(keys [][]byte, k, v []byte, seq uint64) error
 
+
 
+// walk walks recursively the bolt database db, calling walkFn for each key it finds.
 
+func walk(db *DB, walkFn walkFunc) error {
 
+	return db.View(func(tx *Tx) error {
 
+		return tx.ForEach(func(name []byte, b *Bucket) error {
 
+			return walkBucket(b, nil, name, nil, b.Sequence(), walkFn)
 
+		})
 
+	})
 
+}
 
+
 
+func walkBucket(b *Bucket, keypath [][]byte, k, v []byte, seq uint64, fn walkFunc) error {
 
+	// Execute callback.
 
+	if err := fn(keypath, k, v, seq); err != nil {
 
+		return err
 
+	}
 
+
 
+	// If this is not a bucket then stop.
 
+	if v != nil {
 
+		return nil
 
+	}
 
+
 
+	// Iterate over each child key/value.
 
+	keypath = append(keypath, k)
 
+	return b.ForEach(func(k, v []byte) error {
 
+		if v == nil {
 
+			bkt := b.Bucket(k)
 
+			return walkBucket(bkt, keypath, k, nil, bkt.Sequence(), fn)
 
+		}
 
+		return walkBucket(b, keypath, k, v, b.Sequence(), fn)
 
+	})
 
+}

+ 62 - 4
vendor/go.etcd.io/bbolt/db.go
Vedi File 

@@ -120,6 +120,12 @@ type DB struct {
 
 	// of truncate() and fsync() when growing the data file.
 
 	AllocSize int
 
 
+	// Mlock locks database file in memory when set to true.
 
+	// It prevents major page faults, however used memory can't be reclaimed.
 
+	//
 
+	// Supported only on Unix via mlock/munlock syscalls.
 
+	Mlock bool
 
+
 
 	path     string
 
 	openFile func(string, int, os.FileMode) (*os.File, error)
 
 	file     *os.File
 
@@ -188,6 +194,7 @@ func Open(path string, mode os.FileMode, options *Options) (*DB, error) {
 
 	db.MmapFlags = options.MmapFlags
 
 	db.NoFreelistSync = options.NoFreelistSync
 
 	db.FreelistType = options.FreelistType
 
+	db.Mlock = options.Mlock
 
 
 	// Set default values for later DB operations.
 
 	db.MaxBatchSize = DefaultMaxBatchSize
 
@@ -337,7 +344,8 @@ func (db *DB) mmap(minsz int) error {
 
 	}
 
 
 	// Ensure the size is at least the minimum size.
 
-	var size = int(info.Size())
 
+	fileSize := int(info.Size())
 
+	var size = fileSize
 
 	if size < minsz {
 
 		size = minsz
 
 	}
 
@@ -346,6 +354,13 @@ func (db *DB) mmap(minsz int) error {
 
 		return err
 
 	}
 
 
+	if db.Mlock {
 
+		// Unlock db memory
 
+		if err := db.munlock(fileSize); err != nil {
 
+			return err
 
+		}
 
+	}
 
+
 
 	// Dereference all mmap references before unmapping.
 
 	if db.rwtx != nil {
 
 		db.rwtx.root.dereference()
 
@@ -361,6 +376,13 @@ func (db *DB) mmap(minsz int) error {
 
 		return err
 
 	}
 
 
+	if db.Mlock {
 
+		// Don't allow swapping of data file
 
+		if err := db.mlock(fileSize); err != nil {
 
+			return err
 
+		}
 
+	}
 
+
 
 	// Save references to the meta pages.
 
 	db.meta0 = db.page(0).meta()
 
 	db.meta1 = db.page(1).meta()
 
@@ -422,12 +444,36 @@ func (db *DB) mmapSize(size int) (int, error) {
 
 	return int(sz), nil
 
 }
 
 
+func (db *DB) munlock(fileSize int) error {
 
+	if err := munlock(db, fileSize); err != nil {
 
+		return fmt.Errorf("munlock error: " + err.Error())
 
+	}
 
+	return nil
 
+}
 
+
 
+func (db *DB) mlock(fileSize int) error {
 
+	if err := mlock(db, fileSize); err != nil {
 
+		return fmt.Errorf("mlock error: " + err.Error())
 
+	}
 
+	return nil
 
+}
 
+
 
+func (db *DB) mrelock(fileSizeFrom, fileSizeTo int) error {
 
+	if err := db.munlock(fileSizeFrom); err != nil {
 
+		return err
 
+	}
 
+	if err := db.mlock(fileSizeTo); err != nil {
 
+		return err
 
+	}
 
+	return nil
 
+}
 
+
 
 // init creates a new database file and initializes its meta pages.
 
 func (db *DB) init() error {
 
 	// Create two meta pages on a buffer.
 
 	buf := make([]byte, db.pageSize*4)
 
 	for i := 0; i < 2; i++ {
 
-		p := db.pageInBuffer(buf[:], pgid(i))
 
+		p := db.pageInBuffer(buf, pgid(i))
 
 		p.id = pgid(i)
 
 		p.flags = metaPageFlag
 
 
@@ -444,13 +490,13 @@ func (db *DB) init() error {
 
 	}
 
 
 	// Write an empty freelist at page 3.
 
-	p := db.pageInBuffer(buf[:], pgid(2))
 
+	p := db.pageInBuffer(buf, pgid(2))
 
 	p.id = pgid(2)
 
 	p.flags = freelistPageFlag
 
 	p.count = 0
 
 
 	// Write an empty leaf page at page 4.
 
-	p = db.pageInBuffer(buf[:], pgid(3))
 
+	p = db.pageInBuffer(buf, pgid(3))
 
 	p.id = pgid(3)
 
 	p.flags = leafPageFlag
 
 	p.count = 0
 
@@ -462,6 +508,7 @@ func (db *DB) init() error {
 
 	if err := fdatasync(db); err != nil {
 
 		return err
 
 	}
 
+	db.filesz = len(buf)
 
 
 	return nil
 
 }
 
@@ -973,6 +1020,12 @@ func (db *DB) grow(sz int) error {
 
 		if err := db.file.Sync(); err != nil {
 
 			return fmt.Errorf("file sync error: %s", err)
 
 		}
 
+		if db.Mlock {
 
+			// unlock old file and lock new one
 
+			if err := db.mrelock(db.filesz, sz); err != nil {
 
+				return fmt.Errorf("mlock/munlock error: %s", err)
 
+			}
 
+		}
 
 	}
 
 
 	db.filesz = sz
 
@@ -1064,6 +1117,11 @@ type Options struct {
 
 	// OpenFile is used to open files. It defaults to os.OpenFile. This option
 
 	// is useful for writing hermetic tests.
 
 	OpenFile func(string, int, os.FileMode) (*os.File, error)
 
+
 
+	// Mlock locks database file in memory when set to true.
 
+	// It prevents potential page faults, however
 
+	// used memory can't be reclaimed. (UNIX only)
 
+	Mlock bool
 
 }
 
 
 // DefaultOptions represent the options used if nil options are passed into Open().

+ 3 - 3
vendor/go.etcd.io/bbolt/freelist_hmap.go
Vedi File 

@@ -4,7 +4,7 @@ import "sort"
 
 
 // hashmapFreeCount returns count of free pages(hashmap version)
 
 func (f *freelist) hashmapFreeCount() int {
 
-	// use the forwardmap to get the total count
 
+	// use the forwardMap to get the total count
 
 	count := 0
 
 	for _, size := range f.forwardMap {
 
 		count += int(size)
 
@@ -41,7 +41,7 @@ func (f *freelist) hashmapAllocate(txid txid, n int) pgid {
 
 
 		for pid := range bm {
 
 			// remove the initial
 
-			f.delSpan(pid, uint64(size))
 
+			f.delSpan(pid, size)
 
 
 			f.allocs[pid] = txid
 
 
@@ -51,7 +51,7 @@ func (f *freelist) hashmapAllocate(txid txid, n int) pgid {
 
 			f.addSpan(pid+pgid(n), remain)
 
 
 			for i := pgid(0); i < pgid(n); i++ {
 
-				delete(f.cache, pid+pgid(i))
 
+				delete(f.cache, pid+i)
 
 			}
 
 			return pid
 
 		}

+ 36 - 0
vendor/go.etcd.io/bbolt/mlock_unix.go
Vedi File 

@@ -0,0 +1,36 @@
 
+// +build !windows
 
+
 
+package bbolt
 
+
 
+import "golang.org/x/sys/unix"
 
+
 
+// mlock locks memory of db file
 
+func mlock(db *DB, fileSize int) error {
 
+	sizeToLock := fileSize
 
+	if sizeToLock > db.datasz {
 
+		// Can't lock more than mmaped slice
 
+		sizeToLock = db.datasz
 
+	}
 
+	if err := unix.Mlock(db.dataref[:sizeToLock]); err != nil {
 
+		return err
 
+	}
 
+	return nil
 
+}
 
+
 
+//munlock unlocks memory of db file
 
+func munlock(db *DB, fileSize int) error {
 
+	if db.dataref == nil {
 
+		return nil
 
+	}
 
+
 
+	sizeToUnlock := fileSize
 
+	if sizeToUnlock > db.datasz {
 
+		// Can't unlock more than mmaped slice
 
+		sizeToUnlock = db.datasz
 
+	}
 
+
 
+	if err := unix.Munlock(db.dataref[:sizeToUnlock]); err != nil {
 
+		return err
 
+	}
 
+	return nil
 
+}

+ 11 - 0
vendor/go.etcd.io/bbolt/mlock_windows.go
Vedi File 

@@ -0,0 +1,11 @@
 
+package bbolt
 
+
 
+// mlock locks memory of db file
 
+func mlock(_ *DB, _ int) error {
 
+	panic("mlock is supported only on UNIX systems")
 
+}
 
+
 
+//munlock unlocks memory of db file
 
+func munlock(_ *DB, _ int) error {
 
+	panic("munlock is supported only on UNIX systems")
 
+}

+ 1 - 2
vendor/go.etcd.io/bbolt/tx.go
Vedi File 

@@ -188,7 +188,6 @@ func (tx *Tx) Commit() error {
 
 	}
 
 
 	// If strict mode is enabled then perform a consistency check.
 
-	// Only the first consistency error is reported in the panic.
 
 	if tx.db.StrictMode {
 
 		ch := tx.Check()
 
 		var errs []string
 
@@ -393,7 +392,7 @@ func (tx *Tx) CopyFile(path string, mode os.FileMode) error {
 
 		return err
 
 	}
 
 
-	err = tx.Copy(f)
 
+	_, err = tx.WriteTo(f)
 
 	if err != nil {
 
 		_ = f.Close()
 
 		return err

+ 6 - 4
vendor/golang.org/x/net/http/httpguts/httplex.go
Vedi File 

@@ -137,11 +137,13 @@ func trimOWS(x string) string {
 
 // contains token amongst its comma-separated tokens, ASCII
 
 // case-insensitively.
 
 func headerValueContainsToken(v string, token string) bool {
 
-	v = trimOWS(v)
 
-	if comma := strings.IndexByte(v, ','); comma != -1 {
 
-		return tokenEqual(trimOWS(v[:comma]), token) || headerValueContainsToken(v[comma+1:], token)
 
+	for comma := strings.IndexByte(v, ','); comma != -1; comma = strings.IndexByte(v, ',') {
 
+		if tokenEqual(trimOWS(v[:comma]), token) {
 
+			return true
 
+		}
 
+		v = v[comma+1:]
 
 	}
 
-	return tokenEqual(v, token)
 
+	return tokenEqual(trimOWS(v), token)
 
 }
 
 
 // lowerASCII returns the ASCII lowercase version of b.

+ 1 - 1
vendor/golang.org/x/net/http2/Dockerfile
Vedi File 

@@ -38,7 +38,7 @@ RUN make
 
 RUN make install
 
 
 WORKDIR /root
 
-RUN wget http://curl.haxx.se/download/curl-7.45.0.tar.gz
 
+RUN wget https://curl.se/download/curl-7.45.0.tar.gz
 
 RUN tar -zxvf curl-7.45.0.tar.gz
 
 WORKDIR /root/curl-7.45.0
 
 RUN ./configure --with-ssl --with-nghttp2=/usr/local

+ 0 - 20
vendor/golang.org/x/net/http2/README
Vedi File 

@@ -1,20 +0,0 @@
 
-This is a work-in-progress HTTP/2 implementation for Go.
 
-
 
-It will eventually live in the Go standard library and won't require
 
-any changes to your code to use.  It will just be automatic.
 
-
 
-Status:
 
-
 
-* The server support is pretty good. A few things are missing
 
-  but are being worked on.
 
-* The client work has just started but shares a lot of code
 
-  is coming along much quicker.
 
-
 
-Docs are at https://godoc.org/golang.org/x/net/http2
 
-
 
-Demo test server at https://http2.golang.org/
 
-
 
-Help & bug reports welcome!
 
-
 
-Contributing: https://golang.org/doc/contribute.html
 
-Bugs:         https://golang.org/issue/new?title=x/net/http2:+

+ 53 - 0
vendor/golang.org/x/net/http2/ascii.go
Vedi File 

@@ -0,0 +1,53 @@
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+package http2
 
+
 
+import "strings"
 
+
 
+// The HTTP protocols are defined in terms of ASCII, not Unicode. This file
 
+// contains helper functions which may use Unicode-aware functions which would
 
+// otherwise be unsafe and could introduce vulnerabilities if used improperly.
 
+
 
+// asciiEqualFold is strings.EqualFold, ASCII only. It reports whether s and t
 
+// are equal, ASCII-case-insensitively.
 
+func asciiEqualFold(s, t string) bool {
 
+	if len(s) != len(t) {
 
+		return false
 
+	}
 
+	for i := 0; i < len(s); i++ {
 
+		if lower(s[i]) != lower(t[i]) {
 
+			return false
 
+		}
 
+	}
 
+	return true
 
+}
 
+
 
+// lower returns the ASCII lowercase version of b.
 
+func lower(b byte) byte {
 
+	if 'A' <= b && b <= 'Z' {
 
+		return b + ('a' - 'A')
 
+	}
 
+	return b
 
+}
 
+
 
+// isASCIIPrint returns whether s is ASCII and printable according to
 
+// https://tools.ietf.org/html/rfc20#section-4.2.
 
+func isASCIIPrint(s string) bool {
 
+	for i := 0; i < len(s); i++ {
 
+		if s[i] < ' ' || s[i] > '~' {
 
+			return false
 
+		}
 
+	}
 
+	return true
 
+}
 
+
 
+// asciiToLower returns the lowercase version of s if s is ASCII and printable,
 
+// and whether or not it was.
 
+func asciiToLower(s string) (lower string, ok bool) {
 
+	if !isASCIIPrint(s) {
 
+		return "", false
 
+	}
 
+	return strings.ToLower(s), true
 
+}

+ 76 - 44
vendor/golang.org/x/net/http2/client_conn_pool.go
Vedi File 

@@ -7,13 +7,21 @@
 
 package http2
 
 
 import (
 
+	"context"
 
 	"crypto/tls"
 
+	"errors"
 
 	"net/http"
 
 	"sync"
 
 )
 
 
 // ClientConnPool manages a pool of HTTP/2 client connections.
 
 type ClientConnPool interface {
 
+	// GetClientConn returns a specific HTTP/2 connection (usually
 
+	// a TLS-TCP connection) to an HTTP/2 server. On success, the
 
+	// returned ClientConn accounts for the upcoming RoundTrip
 
+	// call, so the caller should not omit it. If the caller needs
 
+	// to, ClientConn.RoundTrip can be called with a bogus
 
+	// new(http.Request) to release the stream reservation.
 
 	GetClientConn(req *http.Request, addr string) (*ClientConn, error)
 
 	MarkDead(*ClientConn)
 
 }
 
@@ -40,7 +48,7 @@ type clientConnPool struct {
 
 	conns        map[string][]*ClientConn // key is host:port
 
 	dialing      map[string]*dialCall     // currently in-flight dials
 
 	keys         map[*ClientConn][]string
 
-	addConnCalls map[string]*addConnCall // in-flight addConnIfNeede calls
 
+	addConnCalls map[string]*addConnCall // in-flight addConnIfNeeded calls
 
 }
 
 
 func (p *clientConnPool) GetClientConn(req *http.Request, addr string) (*ClientConn, error) {
 
@@ -52,87 +60,85 @@ const (
 
 	noDialOnMiss = false
 
 )
 
 
-// shouldTraceGetConn reports whether getClientConn should call any
 
-// ClientTrace.GetConn hook associated with the http.Request.
 
-//
 
-// This complexity is needed to avoid double calls of the GetConn hook
 
-// during the back-and-forth between net/http and x/net/http2 (when the
 
-// net/http.Transport is upgraded to also speak http2), as well as support
 
-// the case where x/net/http2 is being used directly.
 
-func (p *clientConnPool) shouldTraceGetConn(st clientConnIdleState) bool {
 
-	// If our Transport wasn't made via ConfigureTransport, always
 
-	// trace the GetConn hook if provided, because that means the
 
-	// http2 package is being used directly and it's the one
 
-	// dialing, as opposed to net/http.
 
-	if _, ok := p.t.ConnPool.(noDialClientConnPool); !ok {
 
-		return true
 
-	}
 
-	// Otherwise, only use the GetConn hook if this connection has
 
-	// been used previously for other requests. For fresh
 
-	// connections, the net/http package does the dialing.
 
-	return !st.freshConn
 
-}
 
-
 
 func (p *clientConnPool) getClientConn(req *http.Request, addr string, dialOnMiss bool) (*ClientConn, error) {
 
+	// TODO(dneil): Dial a new connection when t.DisableKeepAlives is set?
 
 	if isConnectionCloseRequest(req) && dialOnMiss {
 
 		// It gets its own connection.
 
 		traceGetConn(req, addr)
 
 		const singleUse = true
 
-		cc, err := p.t.dialClientConn(addr, singleUse)
 
+		cc, err := p.t.dialClientConn(req.Context(), addr, singleUse)
 
 		if err != nil {
 
 			return nil, err
 
 		}
 
 		return cc, nil
 
 	}
 
-	p.mu.Lock()
 
-	for _, cc := range p.conns[addr] {
 
-		if st := cc.idleState(); st.canTakeNewRequest {
 
-			if p.shouldTraceGetConn(st) {
 
-				traceGetConn(req, addr)
 
+	for {
 
+		p.mu.Lock()
 
+		for _, cc := range p.conns[addr] {
 
+			if cc.ReserveNewRequest() {
 
+				// When a connection is presented to us by the net/http package,
 
+				// the GetConn hook has already been called.
 
+				// Don't call it a second time here.
 
+				if !cc.getConnCalled {
 
+					traceGetConn(req, addr)
 
+				}
 
+				cc.getConnCalled = false
 
+				p.mu.Unlock()
 
+				return cc, nil
 
 			}
 
+		}
 
+		if !dialOnMiss {
 
 			p.mu.Unlock()
 
-			return cc, nil
 
+			return nil, ErrNoCachedConn
 
 		}
 
-	}
 
-	if !dialOnMiss {
 
+		traceGetConn(req, addr)
 
+		call := p.getStartDialLocked(req.Context(), addr)
 
 		p.mu.Unlock()
 
-		return nil, ErrNoCachedConn
 
+		<-call.done
 
+		if shouldRetryDial(call, req) {
 
+			continue
 
+		}
 
+		cc, err := call.res, call.err
 
+		if err != nil {
 
+			return nil, err
 
+		}
 
+		if cc.ReserveNewRequest() {
 
+			return cc, nil
 
+		}
 
 	}
 
-	traceGetConn(req, addr)
 
-	call := p.getStartDialLocked(addr)
 
-	p.mu.Unlock()
 
-	<-call.done
 
-	return call.res, call.err
 
 }
 
 
 // dialCall is an in-flight Transport dial call to a host.
 
 type dialCall struct {
 
-	_    incomparable
 
-	p    *clientConnPool
 
+	_ incomparable
 
+	p *clientConnPool
 
+	// the context associated with the request
 
+	// that created this dialCall
 
+	ctx  context.Context
 
 	done chan struct{} // closed when done
 
 	res  *ClientConn   // valid after done is closed
 
 	err  error         // valid after done is closed
 
 }
 
 
 // requires p.mu is held.
 
-func (p *clientConnPool) getStartDialLocked(addr string) *dialCall {
 
+func (p *clientConnPool) getStartDialLocked(ctx context.Context, addr string) *dialCall {
 
 	if call, ok := p.dialing[addr]; ok {
 
 		// A dial is already in-flight. Don't start another.
 
 		return call
 
 	}
 
-	call := &dialCall{p: p, done: make(chan struct{})}
 
+	call := &dialCall{p: p, done: make(chan struct{}), ctx: ctx}
 
 	if p.dialing == nil {
 
 		p.dialing = make(map[string]*dialCall)
 
 	}
 
 	p.dialing[addr] = call
 
-	go call.dial(addr)
 
+	go call.dial(call.ctx, addr)
 
 	return call
 
 }
 
 
 // run in its own goroutine.
 
-func (c *dialCall) dial(addr string) {
 
+func (c *dialCall) dial(ctx context.Context, addr string) {
 
 	const singleUse = false // shared conn
 
-	c.res, c.err = c.p.t.dialClientConn(addr, singleUse)
 
+	c.res, c.err = c.p.t.dialClientConn(ctx, addr, singleUse)
 
 	close(c.done)
 
 
 	c.p.mu.Lock()
 
@@ -195,6 +201,7 @@ func (c *addConnCall) run(t *Transport, key string, tc *tls.Conn) {
 
 	if err != nil {
 
 		c.err = err
 
 	} else {
 
+		cc.getConnCalled = true // already called by the net/http package
 
 		p.addConnLocked(key, cc)
 
 	}
 
 	delete(p.addConnCalls, key)
 
@@ -276,3 +283,28 @@ type noDialClientConnPool struct{ *clientConnPool }
 
 func (p noDialClientConnPool) GetClientConn(req *http.Request, addr string) (*ClientConn, error) {
 
 	return p.getClientConn(req, addr, noDialOnMiss)
 
 }
 
+
 
+// shouldRetryDial reports whether the current request should
 
+// retry dialing after the call finished unsuccessfully, for example
 
+// if the dial was canceled because of a context cancellation or
 
+// deadline expiry.
 
+func shouldRetryDial(call *dialCall, req *http.Request) bool {
 
+	if call.err == nil {
 
+		// No error, no need to retry
 
+		return false
 
+	}
 
+	if call.ctx == req.Context() {
 
+		// If the call has the same context as the request, the dial
 
+		// should not be retried, since any cancellation will have come
 
+		// from this request.
 
+		return false
 
+	}
 
+	if !errors.Is(call.err, context.Canceled) && !errors.Is(call.err, context.DeadlineExceeded) {
 
+		// If the call error is not because of a context cancellation or a deadline expiry,
 
+		// the dial should not be retried.
 
+		return false
 
+	}
 
+	// Only retry if the error is a context cancellation error or deadline expiry
 
+	// and the context associated with the call was canceled or expired.
 
+	return call.ctx.Err() != nil
 
+}

+ 12 - 0
vendor/golang.org/x/net/http2/errors.go
Vedi File 

@@ -53,6 +53,13 @@ func (e ErrCode) String() string {
 
 	return fmt.Sprintf("unknown error code 0x%x", uint32(e))
 
 }
 
 
+func (e ErrCode) stringToken() string {
 
+	if s, ok := errCodeName[e]; ok {
 
+		return s
 
+	}
 
+	return fmt.Sprintf("ERR_UNKNOWN_%d", uint32(e))
 
+}
 
+
 
 // ConnectionError is an error that results in the termination of the
 
 // entire connection.
 
 type ConnectionError ErrCode
 
@@ -67,6 +74,11 @@ type StreamError struct {
 
 	Cause    error // optional additional detail
 
 }
 
 
+// errFromPeer is a sentinel error value for StreamError.Cause to
 
+// indicate that the StreamError was sent from the peer over the wire
 
+// and wasn't locally generated in the Transport.
 
+var errFromPeer = errors.New("received from peer")
 
+
 
 func streamError(id uint32, code ErrCode) StreamError {
 
 	return StreamError{StreamID: id, Code: code}
 
 }

+ 48 - 14
vendor/golang.org/x/net/http2/frame.go
Vedi File 

@@ -122,7 +122,7 @@ var flagName = map[FrameType]map[Flags]string{
 
 // a frameParser parses a frame given its FrameHeader and payload
 
 // bytes. The length of payload will always equal fh.Length (which
 
 // might be 0).
 
-type frameParser func(fc *frameCache, fh FrameHeader, payload []byte) (Frame, error)
 
+type frameParser func(fc *frameCache, fh FrameHeader, countError func(string), payload []byte) (Frame, error)
 
 
 var frameParsers = map[FrameType]frameParser{
 
 	FrameData:         parseDataFrame,
 
@@ -267,6 +267,11 @@ type Framer struct {
 
 	lastFrame Frame
 
 	errDetail error
 
 
+	// countError is a non-nil func that's called on a frame parse
 
+	// error with some unique error path token. It's initialized
 
+	// from Transport.CountError or Server.CountError.
 
+	countError func(errToken string)
 
+
 
 	// lastHeaderStream is non-zero if the last frame was an
 
 	// unfinished HEADERS/CONTINUATION.
 
 	lastHeaderStream uint32
 
@@ -426,6 +431,7 @@ func NewFramer(w io.Writer, r io.Reader) *Framer {
 
 	fr := &Framer{
 
 		w:                 w,
 
 		r:                 r,
 
+		countError:        func(string) {},
 
 		logReads:          logFrameReads,
 
 		logWrites:         logFrameWrites,
 
 		debugReadLoggerf:  log.Printf,
 
@@ -500,7 +506,7 @@ func (fr *Framer) ReadFrame() (Frame, error) {
 
 	if _, err := io.ReadFull(fr.r, payload); err != nil {
 
 		return nil, err
 
 	}
 
-	f, err := typeFrameParser(fh.Type)(fr.frameCache, fh, payload)
 
+	f, err := typeFrameParser(fh.Type)(fr.frameCache, fh, fr.countError, payload)
 
 	if err != nil {
 
 		if ce, ok := err.(connError); ok {
 
 			return nil, fr.connError(ce.Code, ce.Reason)
 
@@ -588,13 +594,14 @@ func (f *DataFrame) Data() []byte {
 
 	return f.data
 
 }
 
 
-func parseDataFrame(fc *frameCache, fh FrameHeader, payload []byte) (Frame, error) {
 
+func parseDataFrame(fc *frameCache, fh FrameHeader, countError func(string), payload []byte) (Frame, error) {
 
 	if fh.StreamID == 0 {
 
 		// DATA frames MUST be associated with a stream. If a
 
 		// DATA frame is received whose stream identifier
 
 		// field is 0x0, the recipient MUST respond with a
 
 		// connection error (Section 5.4.1) of type
 
 		// PROTOCOL_ERROR.
 
+		countError("frame_data_stream_0")
 
 		return nil, connError{ErrCodeProtocol, "DATA frame with stream ID 0"}
 
 	}
 
 	f := fc.getDataFrame()
 
@@ -605,6 +612,7 @@ func parseDataFrame(fc *frameCache, fh FrameHeader, payload []byte) (Frame, erro
 
 		var err error
 
 		payload, padSize, err = readByte(payload)
 
 		if err != nil {
 
+			countError("frame_data_pad_byte_short")
 
 			return nil, err
 
 		}
 
 	}
 
@@ -613,6 +621,7 @@ func parseDataFrame(fc *frameCache, fh FrameHeader, payload []byte) (Frame, erro
 
 		// length of the frame payload, the recipient MUST
 
 		// treat this as a connection error.
 
 		// Filed: https://github.com/http2/http2-spec/issues/610
 
+		countError("frame_data_pad_too_big")
 
 		return nil, connError{ErrCodeProtocol, "pad size larger than data payload"}
 
 	}
 
 	f.data = payload[:len(payload)-int(padSize)]
 
@@ -695,7 +704,7 @@ type SettingsFrame struct {
 
 	p []byte
 
 }
 
 
-func parseSettingsFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error) {
 
+func parseSettingsFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (Frame, error) {
 
 	if fh.Flags.Has(FlagSettingsAck) && fh.Length > 0 {
 
 		// When this (ACK 0x1) bit is set, the payload of the
 
 		// SETTINGS frame MUST be empty. Receipt of a
 
@@ -703,6 +712,7 @@ func parseSettingsFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error)
 
 		// field value other than 0 MUST be treated as a
 
 		// connection error (Section 5.4.1) of type
 
 		// FRAME_SIZE_ERROR.
 
+		countError("frame_settings_ack_with_length")
 
 		return nil, ConnectionError(ErrCodeFrameSize)
 
 	}
 
 	if fh.StreamID != 0 {
 
@@ -713,14 +723,17 @@ func parseSettingsFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error)
 
 		// field is anything other than 0x0, the endpoint MUST
 
 		// respond with a connection error (Section 5.4.1) of
 
 		// type PROTOCOL_ERROR.
 
+		countError("frame_settings_has_stream")
 
 		return nil, ConnectionError(ErrCodeProtocol)
 
 	}
 
 	if len(p)%6 != 0 {
 
+		countError("frame_settings_mod_6")
 
 		// Expecting even number of 6 byte settings.
 
 		return nil, ConnectionError(ErrCodeFrameSize)
 
 	}
 
 	f := &SettingsFrame{FrameHeader: fh, p: p}
 
 	if v, ok := f.Value(SettingInitialWindowSize); ok && v > (1<<31)-1 {
 
+		countError("frame_settings_window_size_too_big")
 
 		// Values above the maximum flow control window size of 2^31 - 1 MUST
 
 		// be treated as a connection error (Section 5.4.1) of type
 
 		// FLOW_CONTROL_ERROR.
 
@@ -832,11 +845,13 @@ type PingFrame struct {
 
 
 func (f *PingFrame) IsAck() bool { return f.Flags.Has(FlagPingAck) }
 
 
-func parsePingFrame(_ *frameCache, fh FrameHeader, payload []byte) (Frame, error) {
 
+func parsePingFrame(_ *frameCache, fh FrameHeader, countError func(string), payload []byte) (Frame, error) {
 
 	if len(payload) != 8 {
 
+		countError("frame_ping_length")
 
 		return nil, ConnectionError(ErrCodeFrameSize)
 
 	}
 
 	if fh.StreamID != 0 {
 
+		countError("frame_ping_has_stream")
 
 		return nil, ConnectionError(ErrCodeProtocol)
 
 	}
 
 	f := &PingFrame{FrameHeader: fh}
 
@@ -872,11 +887,13 @@ func (f *GoAwayFrame) DebugData() []byte {
 
 	return f.debugData
 
 }
 
 
-func parseGoAwayFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error) {
 
+func parseGoAwayFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (Frame, error) {
 
 	if fh.StreamID != 0 {
 
+		countError("frame_goaway_has_stream")
 
 		return nil, ConnectionError(ErrCodeProtocol)
 
 	}
 
 	if len(p) < 8 {
 
+		countError("frame_goaway_short")
 
 		return nil, ConnectionError(ErrCodeFrameSize)
 
 	}
 
 	return &GoAwayFrame{
 
@@ -912,7 +929,7 @@ func (f *UnknownFrame) Payload() []byte {
 
 	return f.p
 
 }
 
 
-func parseUnknownFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error) {
 
+func parseUnknownFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (Frame, error) {
 
 	return &UnknownFrame{fh, p}, nil
 
 }
 
 
@@ -923,8 +940,9 @@ type WindowUpdateFrame struct {
 
 	Increment uint32 // never read with high bit set
 
 }
 
 
-func parseWindowUpdateFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error) {
 
+func parseWindowUpdateFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (Frame, error) {
 
 	if len(p) != 4 {
 
+		countError("frame_windowupdate_bad_len")
 
 		return nil, ConnectionError(ErrCodeFrameSize)
 
 	}
 
 	inc := binary.BigEndian.Uint32(p[:4]) & 0x7fffffff // mask off high reserved bit
 
@@ -936,8 +954,10 @@ func parseWindowUpdateFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, err
 
 		// control window MUST be treated as a connection
 
 		// error (Section 5.4.1).
 
 		if fh.StreamID == 0 {
 
+			countError("frame_windowupdate_zero_inc_conn")
 
 			return nil, ConnectionError(ErrCodeProtocol)
 
 		}
 
+		countError("frame_windowupdate_zero_inc_stream")
 
 		return nil, streamError(fh.StreamID, ErrCodeProtocol)
 
 	}
 
 	return &WindowUpdateFrame{
 
@@ -988,7 +1008,7 @@ func (f *HeadersFrame) HasPriority() bool {
 
 	return f.FrameHeader.Flags.Has(FlagHeadersPriority)
 
 }
 
 
-func parseHeadersFrame(_ *frameCache, fh FrameHeader, p []byte) (_ Frame, err error) {
 
+func parseHeadersFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (_ Frame, err error) {
 
 	hf := &HeadersFrame{
 
 		FrameHeader: fh,
 
 	}
 
@@ -997,11 +1017,13 @@ func parseHeadersFrame(_ *frameCache, fh FrameHeader, p []byte) (_ Frame, err er
 
 		// is received whose stream identifier field is 0x0, the recipient MUST
 
 		// respond with a connection error (Section 5.4.1) of type
 
 		// PROTOCOL_ERROR.
 
+		countError("frame_headers_zero_stream")
 
 		return nil, connError{ErrCodeProtocol, "HEADERS frame with stream ID 0"}
 
 	}
 
 	var padLength uint8
 
 	if fh.Flags.Has(FlagHeadersPadded) {
 
 		if p, padLength, err = readByte(p); err != nil {
 
+			countError("frame_headers_pad_short")
 
 			return
 
 		}
 
 	}
 
@@ -1009,16 +1031,19 @@ func parseHeadersFrame(_ *frameCache, fh FrameHeader, p []byte) (_ Frame, err er
 
 		var v uint32
 
 		p, v, err = readUint32(p)
 
 		if err != nil {
 
+			countError("frame_headers_prio_short")
 
 			return nil, err
 
 		}
 
 		hf.Priority.StreamDep = v & 0x7fffffff
 
 		hf.Priority.Exclusive = (v != hf.Priority.StreamDep) // high bit was set
 
 		p, hf.Priority.Weight, err = readByte(p)
 
 		if err != nil {
 
+			countError("frame_headers_prio_weight_short")
 
 			return nil, err
 
 		}
 
 	}
 
-	if len(p)-int(padLength) <= 0 {
 
+	if len(p)-int(padLength) < 0 {
 
+		countError("frame_headers_pad_too_big")
 
 		return nil, streamError(fh.StreamID, ErrCodeProtocol)
 
 	}
 
 	hf.headerFragBuf = p[:len(p)-int(padLength)]
 
@@ -1125,11 +1150,13 @@ func (p PriorityParam) IsZero() bool {
 
 	return p == PriorityParam{}
 
 }
 
 
-func parsePriorityFrame(_ *frameCache, fh FrameHeader, payload []byte) (Frame, error) {
 
+func parsePriorityFrame(_ *frameCache, fh FrameHeader, countError func(string), payload []byte) (Frame, error) {
 
 	if fh.StreamID == 0 {
 
+		countError("frame_priority_zero_stream")
 
 		return nil, connError{ErrCodeProtocol, "PRIORITY frame with stream ID 0"}
 
 	}
 
 	if len(payload) != 5 {
 
+		countError("frame_priority_bad_length")
 
 		return nil, connError{ErrCodeFrameSize, fmt.Sprintf("PRIORITY frame payload size was %d; want 5", len(payload))}
 
 	}
 
 	v := binary.BigEndian.Uint32(payload[:4])
 
@@ -1172,11 +1199,13 @@ type RSTStreamFrame struct {
 
 	ErrCode ErrCode
 
 }
 
 
-func parseRSTStreamFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error) {
 
+func parseRSTStreamFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (Frame, error) {
 
 	if len(p) != 4 {
 
+		countError("frame_rststream_bad_len")
 
 		return nil, ConnectionError(ErrCodeFrameSize)
 
 	}
 
 	if fh.StreamID == 0 {
 
+		countError("frame_rststream_zero_stream")
 
 		return nil, ConnectionError(ErrCodeProtocol)
 
 	}
 
 	return &RSTStreamFrame{fh, ErrCode(binary.BigEndian.Uint32(p[:4]))}, nil
 
@@ -1202,8 +1231,9 @@ type ContinuationFrame struct {
 
 	headerFragBuf []byte
 
 }
 
 
-func parseContinuationFrame(_ *frameCache, fh FrameHeader, p []byte) (Frame, error) {
 
+func parseContinuationFrame(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (Frame, error) {
 
 	if fh.StreamID == 0 {
 
+		countError("frame_continuation_zero_stream")
 
 		return nil, connError{ErrCodeProtocol, "CONTINUATION frame with stream ID 0"}
 
 	}
 
 	return &ContinuationFrame{fh, p}, nil
 
@@ -1252,7 +1282,7 @@ func (f *PushPromiseFrame) HeadersEnded() bool {
 
 	return f.FrameHeader.Flags.Has(FlagPushPromiseEndHeaders)
 
 }
 
 
-func parsePushPromise(_ *frameCache, fh FrameHeader, p []byte) (_ Frame, err error) {
 
+func parsePushPromise(_ *frameCache, fh FrameHeader, countError func(string), p []byte) (_ Frame, err error) {
 
 	pp := &PushPromiseFrame{
 
 		FrameHeader: fh,
 
 	}
 
@@ -1263,6 +1293,7 @@ func parsePushPromise(_ *frameCache, fh FrameHeader, p []byte) (_ Frame, err err
 
 		// with. If the stream identifier field specifies the value
 
 		// 0x0, a recipient MUST respond with a connection error
 
 		// (Section 5.4.1) of type PROTOCOL_ERROR.
 
+		countError("frame_pushpromise_zero_stream")
 
 		return nil, ConnectionError(ErrCodeProtocol)
 
 	}
 
 	// The PUSH_PROMISE frame includes optional padding.
 
@@ -1270,18 +1301,21 @@ func parsePushPromise(_ *frameCache, fh FrameHeader, p []byte) (_ Frame, err err
 
 	var padLength uint8
 
 	if fh.Flags.Has(FlagPushPromisePadded) {
 
 		if p, padLength, err = readByte(p); err != nil {
 
+			countError("frame_pushpromise_pad_short")
 
 			return
 
 		}
 
 	}
 
 
 	p, pp.PromiseID, err = readUint32(p)
 
 	if err != nil {
 
+		countError("frame_pushpromise_promiseid_short")
 
 		return
 
 	}
 
 	pp.PromiseID = pp.PromiseID & (1<<31 - 1)
 
 
 	if int(padLength) > len(p) {
 
 		// like the DATA frame, error out if padding is longer than the body.
 
+		countError("frame_pushpromise_pad_too_big")
 
 		return nil, ConnectionError(ErrCodeProtocol)
 
 	}
 
 	pp.headerFragBuf = p[:len(p)-int(padLength)]

+ 27 - 0
vendor/golang.org/x/net/http2/go115.go
Vedi File 

@@ -0,0 +1,27 @@
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+//go:build go1.15
 
+// +build go1.15
 
+
 
+package http2
 
+
 
+import (
 
+	"context"
 
+	"crypto/tls"
 
+)
 
+
 
+// dialTLSWithContext uses tls.Dialer, added in Go 1.15, to open a TLS
 
+// connection.
 
+func (t *Transport) dialTLSWithContext(ctx context.Context, network, addr string, cfg *tls.Config) (*tls.Conn, error) {
 
+	dialer := &tls.Dialer{
 
+		Config: cfg,
 
+	}
 
+	cn, err := dialer.DialContext(ctx, network, addr)
 
+	if err != nil {
 
+		return nil, err
 
+	}
 
+	tlsCn := cn.(*tls.Conn) // DialContext comment promises this will always succeed
 
+	return tlsCn, nil
 
+}

+ 3 - 4
vendor/golang.org/x/net/http2/headermap.go
Vedi File 

@@ -6,7 +6,6 @@ package http2
 
 
 import (
 
 	"net/http"
 
-	"strings"
 
 	"sync"
 
 )
 
 
@@ -79,10 +78,10 @@ func buildCommonHeaderMaps() {
 
 	}
 
 }
 
 
-func lowerHeader(v string) string {
 
+func lowerHeader(v string) (lower string, ascii bool) {
 
 	buildCommonHeaderMapsOnce()
 
 	if s, ok := commonLowerHeader[v]; ok {
 
-		return s
 
+		return s, true
 
 	}
 
-	return strings.ToLower(v)
 
+	return asciiToLower(v)
 
 }

+ 21 - 17
vendor/golang.org/x/net/http2/hpack/huffman.go
Vedi File 

@@ -140,25 +140,29 @@ func buildRootHuffmanNode() {
 
 		panic("unexpected size")
 
 	}
 
 	lazyRootHuffmanNode = newInternalNode()
 
-	for i, code := range huffmanCodes {
 
-		addDecoderNode(byte(i), code, huffmanCodeLen[i])
 
-	}
 
-}
 
+	// allocate a leaf node for each of the 256 symbols
 
+	leaves := new([256]node)
 
+
 
+	for sym, code := range huffmanCodes {
 
+		codeLen := huffmanCodeLen[sym]
 
+
 
+		cur := lazyRootHuffmanNode
 
+		for codeLen > 8 {
 
+			codeLen -= 8
 
+			i := uint8(code >> codeLen)
 
+			if cur.children[i] == nil {
 
+				cur.children[i] = newInternalNode()
 
+			}
 
+			cur = cur.children[i]
 
+		}
 
+		shift := 8 - codeLen
 
+		start, end := int(uint8(code<<shift)), int(1<<shift)
 
 
-func addDecoderNode(sym byte, code uint32, codeLen uint8) {
 
-	cur := lazyRootHuffmanNode
 
-	for codeLen > 8 {
 
-		codeLen -= 8
 
-		i := uint8(code >> codeLen)
 
-		if cur.children[i] == nil {
 
-			cur.children[i] = newInternalNode()
 
+		leaves[sym].sym = byte(sym)
 
+		leaves[sym].codeLen = codeLen
 
+		for i := start; i < start+end; i++ {
 
+			cur.children[i] = &leaves[sym]
 
 		}
 
-		cur = cur.children[i]
 
-	}
 
-	shift := 8 - codeLen
 
-	start, end := int(uint8(code<<shift)), int(1<<shift)
 
-	for i := start; i < start+end; i++ {
 
-		cur.children[i] = &node{sym: sym, codeLen: codeLen}
 
 	}
 
 }

+ 31 - 0
vendor/golang.org/x/net/http2/not_go115.go
Vedi File 

@@ -0,0 +1,31 @@
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+//go:build !go1.15
 
+// +build !go1.15
 
+
 
+package http2
 
+
 
+import (
 
+	"context"
 
+	"crypto/tls"
 
+)
 
+
 
+// dialTLSWithContext opens a TLS connection.
 
+func (t *Transport) dialTLSWithContext(ctx context.Context, network, addr string, cfg *tls.Config) (*tls.Conn, error) {
 
+	cn, err := tls.Dial(network, addr, cfg)
 
+	if err != nil {
 
+		return nil, err
 
+	}
 
+	if err := cn.Handshake(); err != nil {
 
+		return nil, err
 
+	}
 
+	if cfg.InsecureSkipVerify {
 
+		return cn, nil
 
+	}
 
+	if err := cn.VerifyHostname(cfg.ServerName); err != nil {
 
+		return nil, err
 
+	}
 
+	return cn, nil
 
+}

+ 11 - 0
vendor/golang.org/x/net/http2/pipe.go
Vedi File 

@@ -30,6 +30,17 @@ type pipeBuffer interface {
 
 	io.Reader
 
 }
 
 
+// setBuffer initializes the pipe buffer.
 
+// It has no effect if the pipe is already closed.
 
+func (p *pipe) setBuffer(b pipeBuffer) {
 
+	p.mu.Lock()
 
+	defer p.mu.Unlock()
 
+	if p.err != nil || p.breakErr != nil {
 
+		return
 
+	}
 
+	p.b = b
 
+}
 
+
 
 func (p *pipe) Len() int {
 
 	p.mu.Lock()
 
 	defer p.mu.Unlock()

+ 95 - 55
vendor/golang.org/x/net/http2/server.go
Vedi File 

@@ -130,6 +130,12 @@ type Server struct {
 
 	// If nil, a default scheduler is chosen.
 
 	NewWriteScheduler func() WriteScheduler
 
 
+	// CountError, if non-nil, is called on HTTP/2 server errors.
 
+	// It's intended to increment a metric for monitoring, such
 
+	// as an expvar or Prometheus metric.
 
+	// The errType consists of only ASCII word characters.
 
+	CountError func(errType string)
 
+
 
 	// Internal state. This is a pointer (rather than embedded directly)
 
 	// so that we don't embed a Mutex in this struct, which will make the
 
 	// struct non-copyable, which might break some callers.
 
@@ -231,13 +237,12 @@ func ConfigureServer(s *http.Server, conf *Server) error {
 
 
 	if s.TLSConfig == nil {
 
 		s.TLSConfig = new(tls.Config)
 
-	} else if s.TLSConfig.CipherSuites != nil {
 
-		// If they already provided a CipherSuite list, return
 
-		// an error if it has a bad order or is missing
 
-		// ECDHE_RSA_WITH_AES_128_GCM_SHA256 or ECDHE_ECDSA_WITH_AES_128_GCM_SHA256.
 
+	} else if s.TLSConfig.CipherSuites != nil && s.TLSConfig.MinVersion < tls.VersionTLS13 {
 
+		// If they already provided a TLS 1.0–1.2 CipherSuite list, return an
 
+		// error if it is missing ECDHE_RSA_WITH_AES_128_GCM_SHA256 or
 
+		// ECDHE_ECDSA_WITH_AES_128_GCM_SHA256.
 
 		haveRequired := false
 
-		sawBad := false
 
-		for i, cs := range s.TLSConfig.CipherSuites {
 
+		for _, cs := range s.TLSConfig.CipherSuites {
 
 			switch cs {
 
 			case tls.TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256,
 
 				// Alternative MTI cipher to not discourage ECDSA-only servers.
 
@@ -245,14 +250,9 @@ func ConfigureServer(s *http.Server, conf *Server) error {
 
 				tls.TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256:
 
 				haveRequired = true
 
 			}
 
-			if isBadCipher(cs) {
 
-				sawBad = true
 
-			} else if sawBad {
 
-				return fmt.Errorf("http2: TLSConfig.CipherSuites index %d contains an HTTP/2-approved cipher suite (%#04x), but it comes after unapproved cipher suites. With this configuration, clients that don't support previous, approved cipher suites may be given an unapproved one and reject the connection.", i, cs)
 
-			}
 
 		}
 
 		if !haveRequired {
 
-			return fmt.Errorf("http2: TLSConfig.CipherSuites is missing an HTTP/2-required AES_128_GCM_SHA256 cipher (need at least one of TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 or TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256).")
 
+			return fmt.Errorf("http2: TLSConfig.CipherSuites is missing an HTTP/2-required AES_128_GCM_SHA256 cipher (need at least one of TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 or TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256)")
 
 		}
 
 	}
 
 
@@ -265,16 +265,12 @@ func ConfigureServer(s *http.Server, conf *Server) error {
 
 
 	s.TLSConfig.PreferServerCipherSuites = true
 
 
-	haveNPN := false
 
-	for _, p := range s.TLSConfig.NextProtos {
 
-		if p == NextProtoTLS {
 
-			haveNPN = true
 
-			break
 
-		}
 
-	}
 
-	if !haveNPN {
 
+	if !strSliceContains(s.TLSConfig.NextProtos, NextProtoTLS) {
 
 		s.TLSConfig.NextProtos = append(s.TLSConfig.NextProtos, NextProtoTLS)
 
 	}
 
+	if !strSliceContains(s.TLSConfig.NextProtos, "http/1.1") {
 
+		s.TLSConfig.NextProtos = append(s.TLSConfig.NextProtos, "http/1.1")
 
+	}
 
 
 	if s.TLSNextProto == nil {
 
 		s.TLSNextProto = map[string]func(*http.Server, *tls.Conn, http.Handler){}
 
@@ -415,6 +411,9 @@ func (s *Server) ServeConn(c net.Conn, opts *ServeConnOpts) {
 
 	sc.hpackEncoder = hpack.NewEncoder(&sc.headerWriteBuf)
 
 
 	fr := NewFramer(sc.bw, c)
 
+	if s.CountError != nil {
 
+		fr.countError = s.CountError
 
+	}
 
 	fr.ReadMetaHeaders = hpack.NewDecoder(initialHeaderTableSize, nil)
 
 	fr.MaxHeaderListSize = sc.maxHeaderListSize()
 
 	fr.SetMaxReadFrameSize(s.maxReadFrameSize())
 
@@ -826,7 +825,7 @@ func (sc *serverConn) serve() {
 
 	})
 
 	sc.unackedSettings++
 
 
-	// Each connection starts with intialWindowSize inflow tokens.
 
+	// Each connection starts with initialWindowSize inflow tokens.
 
 	// If a higher value is configured, we add more tokens.
 
 	if diff := sc.srv.initialConnRecvWindowSize() - initialWindowSize; diff > 0 {
 
 		sc.sendWindowUpdate(nil, int(diff))
 
@@ -866,6 +865,15 @@ func (sc *serverConn) serve() {
 
 		case res := <-sc.wroteFrameCh:
 
 			sc.wroteFrame(res)
 
 		case res := <-sc.readFrameCh:
 
+			// Process any written frames before reading new frames from the client since a
 
+			// written frame could have triggered a new stream to be started.
 
+			if sc.writingFrameAsync {
 
+				select {
 
+				case wroteRes := <-sc.wroteFrameCh:
 
+					sc.wroteFrame(wroteRes)
 
+				default:
 
+				}
 
+			}
 
 			if !sc.processFrameFromReader(res) {
 
 				return
 
 			}
 
@@ -1400,7 +1408,7 @@ func (sc *serverConn) processFrame(f Frame) error {
 
 	// First frame received must be SETTINGS.
 
 	if !sc.sawFirstSettings {
 
 		if _, ok := f.(*SettingsFrame); !ok {
 
-			return ConnectionError(ErrCodeProtocol)
 
+			return sc.countError("first_settings", ConnectionError(ErrCodeProtocol))
 
 		}
 
 		sc.sawFirstSettings = true
 
 	}
 
@@ -1425,7 +1433,7 @@ func (sc *serverConn) processFrame(f Frame) error {
 
 	case *PushPromiseFrame:
 
 		// A client cannot push. Thus, servers MUST treat the receipt of a PUSH_PROMISE
 
 		// frame as a connection error (Section 5.4.1) of type PROTOCOL_ERROR.
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("push_promise", ConnectionError(ErrCodeProtocol))
 
 	default:
 
 		sc.vlogf("http2: server ignoring frame: %v", f.Header())
 
 		return nil
 
@@ -1445,7 +1453,7 @@ func (sc *serverConn) processPing(f *PingFrame) error {
 
 		// identifier field value other than 0x0, the recipient MUST
 
 		// respond with a connection error (Section 5.4.1) of type
 
 		// PROTOCOL_ERROR."
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("ping_on_stream", ConnectionError(ErrCodeProtocol))
 
 	}
 
 	if sc.inGoAway && sc.goAwayCode != ErrCodeNo {
 
 		return nil
 
@@ -1464,7 +1472,7 @@ func (sc *serverConn) processWindowUpdate(f *WindowUpdateFrame) error {
 
 			// or PRIORITY on a stream in this state MUST be
 
 			// treated as a connection error (Section 5.4.1) of
 
 			// type PROTOCOL_ERROR."
 
-			return ConnectionError(ErrCodeProtocol)
 
+			return sc.countError("stream_idle", ConnectionError(ErrCodeProtocol))
 
 		}
 
 		if st == nil {
 
 			// "WINDOW_UPDATE can be sent by a peer that has sent a
 
@@ -1475,7 +1483,7 @@ func (sc *serverConn) processWindowUpdate(f *WindowUpdateFrame) error {
 
 			return nil
 
 		}
 
 		if !st.flow.add(int32(f.Increment)) {
 
-			return streamError(f.StreamID, ErrCodeFlowControl)
 
+			return sc.countError("bad_flow", streamError(f.StreamID, ErrCodeFlowControl))
 
 		}
 
 	default: // connection-level flow control
 
 		if !sc.flow.add(int32(f.Increment)) {
 
@@ -1496,7 +1504,7 @@ func (sc *serverConn) processResetStream(f *RSTStreamFrame) error {
 
 		// identifying an idle stream is received, the
 
 		// recipient MUST treat this as a connection error
 
 		// (Section 5.4.1) of type PROTOCOL_ERROR.
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("reset_idle_stream", ConnectionError(ErrCodeProtocol))
 
 	}
 
 	if st != nil {
 
 		st.cancelCtx()
 
@@ -1548,7 +1556,7 @@ func (sc *serverConn) processSettings(f *SettingsFrame) error {
 
 			// Why is the peer ACKing settings we never sent?
 
 			// The spec doesn't mention this case, but
 
 			// hang up on them anyway.
 
-			return ConnectionError(ErrCodeProtocol)
 
+			return sc.countError("ack_mystery", ConnectionError(ErrCodeProtocol))
 
 		}
 
 		return nil
 
 	}
 
@@ -1556,7 +1564,7 @@ func (sc *serverConn) processSettings(f *SettingsFrame) error {
 
 		// This isn't actually in the spec, but hang up on
 
 		// suspiciously large settings frames or those with
 
 		// duplicate entries.
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("settings_big_or_dups", ConnectionError(ErrCodeProtocol))
 
 	}
 
 	if err := f.ForeachSetting(sc.processSetting); err != nil {
 
 		return err
 
@@ -1623,7 +1631,7 @@ func (sc *serverConn) processSettingInitialWindowSize(val uint32) error {
 
 			// control window to exceed the maximum size as a
 
 			// connection error (Section 5.4.1) of type
 
 			// FLOW_CONTROL_ERROR."
 
-			return ConnectionError(ErrCodeFlowControl)
 
+			return sc.countError("setting_win_size", ConnectionError(ErrCodeFlowControl))
 
 		}
 
 	}
 
 	return nil
 
@@ -1656,7 +1664,7 @@ func (sc *serverConn) processData(f *DataFrame) error {
 
 		// or PRIORITY on a stream in this state MUST be
 
 		// treated as a connection error (Section 5.4.1) of
 
 		// type PROTOCOL_ERROR."
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("data_on_idle", ConnectionError(ErrCodeProtocol))
 
 	}
 
 
 	// "If a DATA frame is received whose stream is not in "open"
 
@@ -1673,7 +1681,7 @@ func (sc *serverConn) processData(f *DataFrame) error {
 
 		// and return any flow control bytes since we're not going
 
 		// to consume them.
 
 		if sc.inflow.available() < int32(f.Length) {
 
-			return streamError(id, ErrCodeFlowControl)
 
+			return sc.countError("data_flow", streamError(id, ErrCodeFlowControl))
 
 		}
 
 		// Deduct the flow control from inflow, since we're
 
 		// going to immediately add it back in
 
@@ -1686,7 +1694,7 @@ func (sc *serverConn) processData(f *DataFrame) error {
 
 			// Already have a stream error in flight. Don't send another.
 
 			return nil
 
 		}
 
-		return streamError(id, ErrCodeStreamClosed)
 
+		return sc.countError("closed", streamError(id, ErrCodeStreamClosed))
 
 	}
 
 	if st.body == nil {
 
 		panic("internal error: should have a body in this state")
 
@@ -1698,12 +1706,12 @@ func (sc *serverConn) processData(f *DataFrame) error {
 
 		// RFC 7540, sec 8.1.2.6: A request or response is also malformed if the
 
 		// value of a content-length header field does not equal the sum of the
 
 		// DATA frame payload lengths that form the body.
 
-		return streamError(id, ErrCodeProtocol)
 
+		return sc.countError("send_too_much", streamError(id, ErrCodeProtocol))
 
 	}
 
 	if f.Length > 0 {
 
 		// Check whether the client has flow control quota.
 
 		if st.inflow.available() < int32(f.Length) {
 
-			return streamError(id, ErrCodeFlowControl)
 
+			return sc.countError("flow_on_data_length", streamError(id, ErrCodeFlowControl))
 
 		}
 
 		st.inflow.take(int32(f.Length))
 
 
@@ -1711,7 +1719,7 @@ func (sc *serverConn) processData(f *DataFrame) error {
 
 			wrote, err := st.body.Write(data)
 
 			if err != nil {
 
 				sc.sendWindowUpdate(nil, int(f.Length)-wrote)
 
-				return streamError(id, ErrCodeStreamClosed)
 
+				return sc.countError("body_write_err", streamError(id, ErrCodeStreamClosed))
 
 			}
 
 			if wrote != len(data) {
 
 				panic("internal error: bad Writer")
 
@@ -1797,7 +1805,7 @@ func (sc *serverConn) processHeaders(f *MetaHeadersFrame) error {
 
 	// stream identifier MUST respond with a connection error
 
 	// (Section 5.4.1) of type PROTOCOL_ERROR.
 
 	if id%2 != 1 {
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("headers_even", ConnectionError(ErrCodeProtocol))
 
 	}
 
 	// A HEADERS frame can be used to create a new stream or
 
 	// send a trailer for an open one. If we already have a stream
 
@@ -1814,7 +1822,7 @@ func (sc *serverConn) processHeaders(f *MetaHeadersFrame) error {
 
 		// this state, it MUST respond with a stream error (Section 5.4.2) of
 
 		// type STREAM_CLOSED.
 
 		if st.state == stateHalfClosedRemote {
 
-			return streamError(id, ErrCodeStreamClosed)
 
+			return sc.countError("headers_half_closed", streamError(id, ErrCodeStreamClosed))
 
 		}
 
 		return st.processTrailerHeaders(f)
 
 	}
 
@@ -1825,7 +1833,7 @@ func (sc *serverConn) processHeaders(f *MetaHeadersFrame) error {
 
 	// receives an unexpected stream identifier MUST respond with
 
 	// a connection error (Section 5.4.1) of type PROTOCOL_ERROR.
 
 	if id <= sc.maxClientStreamID {
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("stream_went_down", ConnectionError(ErrCodeProtocol))
 
 	}
 
 	sc.maxClientStreamID = id
 
 
@@ -1842,14 +1850,14 @@ func (sc *serverConn) processHeaders(f *MetaHeadersFrame) error {
 
 	if sc.curClientStreams+1 > sc.advMaxStreams {
 
 		if sc.unackedSettings == 0 {
 
 			// They should know better.
 
-			return streamError(id, ErrCodeProtocol)
 
+			return sc.countError("over_max_streams", streamError(id, ErrCodeProtocol))
 
 		}
 
 		// Assume it's a network race, where they just haven't
 
 		// received our last SETTINGS update. But actually
 
 		// this can't happen yet, because we don't yet provide
 
 		// a way for users to adjust server parameters at
 
 		// runtime.
 
-		return streamError(id, ErrCodeRefusedStream)
 
+		return sc.countError("over_max_streams_race", streamError(id, ErrCodeRefusedStream))
 
 	}
 
 
 	initialState := stateOpen
 
@@ -1859,7 +1867,7 @@ func (sc *serverConn) processHeaders(f *MetaHeadersFrame) error {
 
 	st := sc.newStream(id, 0, initialState)
 
 
 	if f.HasPriority() {
 
-		if err := checkPriority(f.StreamID, f.Priority); err != nil {
 
+		if err := sc.checkPriority(f.StreamID, f.Priority); err != nil {
 
 			return err
 
 		}
 
 		sc.writeSched.AdjustStream(st.id, f.Priority)
 
@@ -1903,15 +1911,15 @@ func (st *stream) processTrailerHeaders(f *MetaHeadersFrame) error {
 
 	sc := st.sc
 
 	sc.serveG.check()
 
 	if st.gotTrailerHeader {
 
-		return ConnectionError(ErrCodeProtocol)
 
+		return sc.countError("dup_trailers", ConnectionError(ErrCodeProtocol))
 
 	}
 
 	st.gotTrailerHeader = true
 
 	if !f.StreamEnded() {
 
-		return streamError(st.id, ErrCodeProtocol)
 
+		return sc.countError("trailers_not_ended", streamError(st.id, ErrCodeProtocol))
 
 	}
 
 
 	if len(f.PseudoFields()) > 0 {
 
-		return streamError(st.id, ErrCodeProtocol)
 
+		return sc.countError("trailers_pseudo", streamError(st.id, ErrCodeProtocol))
 
 	}
 
 	if st.trailer != nil {
 
 		for _, hf := range f.RegularFields() {
 
@@ -1920,7 +1928,7 @@ func (st *stream) processTrailerHeaders(f *MetaHeadersFrame) error {
 
 				// TODO: send more details to the peer somehow. But http2 has
 
 				// no way to send debug data at a stream level. Discuss with
 
 				// HTTP folk.
 
-				return streamError(st.id, ErrCodeProtocol)
 
+				return sc.countError("trailers_bogus", streamError(st.id, ErrCodeProtocol))
 
 			}
 
 			st.trailer[key] = append(st.trailer[key], hf.Value)
 
 		}
 
@@ -1929,13 +1937,13 @@ func (st *stream) processTrailerHeaders(f *MetaHeadersFrame) error {
 
 	return nil
 
 }
 
 
-func checkPriority(streamID uint32, p PriorityParam) error {
 
+func (sc *serverConn) checkPriority(streamID uint32, p PriorityParam) error {
 
 	if streamID == p.StreamDep {
 
 		// Section 5.3.1: "A stream cannot depend on itself. An endpoint MUST treat
 
 		// this as a stream error (Section 5.4.2) of type PROTOCOL_ERROR."
 
 		// Section 5.3.3 says that a stream can depend on one of its dependencies,
 
 		// so it's only self-dependencies that are forbidden.
 
-		return streamError(streamID, ErrCodeProtocol)
 
+		return sc.countError("priority", streamError(streamID, ErrCodeProtocol))
 
 	}
 
 	return nil
 
 }
 
@@ -1944,7 +1952,7 @@ func (sc *serverConn) processPriority(f *PriorityFrame) error {
 
 	if sc.inGoAway {
 
 		return nil
 
 	}
 
-	if err := checkPriority(f.StreamID, f.PriorityParam); err != nil {
 
+	if err := sc.checkPriority(f.StreamID, f.PriorityParam); err != nil {
 
 		return err
 
 	}
 
 	sc.writeSched.AdjustStream(f.StreamID, f.PriorityParam)
 
@@ -2001,7 +2009,7 @@ func (sc *serverConn) newWriterAndRequest(st *stream, f *MetaHeadersFrame) (*res
 
 	isConnect := rp.method == "CONNECT"
 
 	if isConnect {
 
 		if rp.path != "" || rp.scheme != "" || rp.authority == "" {
 
-			return nil, nil, streamError(f.StreamID, ErrCodeProtocol)
 
+			return nil, nil, sc.countError("bad_connect", streamError(f.StreamID, ErrCodeProtocol))
 
 		}
 
 	} else if rp.method == "" || rp.path == "" || (rp.scheme != "https" && rp.scheme != "http") {
 
 		// See 8.1.2.6 Malformed Requests and Responses:
 
@@ -2014,13 +2022,13 @@ func (sc *serverConn) newWriterAndRequest(st *stream, f *MetaHeadersFrame) (*res
 
 		// "All HTTP/2 requests MUST include exactly one valid
 
 		// value for the :method, :scheme, and :path
 
 		// pseudo-header fields"
 
-		return nil, nil, streamError(f.StreamID, ErrCodeProtocol)
 
+		return nil, nil, sc.countError("bad_path_method", streamError(f.StreamID, ErrCodeProtocol))
 
 	}
 
 
 	bodyOpen := !f.StreamEnded()
 
 	if rp.method == "HEAD" && bodyOpen {
 
 		// HEAD requests can't have bodies
 
-		return nil, nil, streamError(f.StreamID, ErrCodeProtocol)
 
+		return nil, nil, sc.countError("head_body", streamError(f.StreamID, ErrCodeProtocol))
 
 	}
 
 
 	rp.header = make(http.Header)
 
@@ -2103,7 +2111,7 @@ func (sc *serverConn) newWriterAndRequestNoBody(st *stream, rp requestParam) (*r
 
 		var err error
 
 		url_, err = url.ParseRequestURI(rp.path)
 
 		if err != nil {
 
-			return nil, nil, streamError(st.id, ErrCodeProtocol)
 
+			return nil, nil, sc.countError("bad_path", streamError(st.id, ErrCodeProtocol))
 
 		}
 
 		requestURI = rp.path
 
 	}
 
@@ -2789,8 +2797,12 @@ func (w *responseWriter) Push(target string, opts *http.PushOptions) error {
 
 		// but PUSH_PROMISE requests cannot have a body.
 
 		// http://tools.ietf.org/html/rfc7540#section-8.2
 
 		// Also disallow Host, since the promised URL must be absolute.
 
-		switch strings.ToLower(k) {
 
-		case "content-length", "content-encoding", "trailer", "te", "expect", "host":
 
+		if asciiEqualFold(k, "content-length") ||
 
+			asciiEqualFold(k, "content-encoding") ||
 
+			asciiEqualFold(k, "trailer") ||
 
+			asciiEqualFold(k, "te") ||
 
+			asciiEqualFold(k, "expect") ||
 
+			asciiEqualFold(k, "host") {
 
 			return fmt.Errorf("promised request headers cannot include %q", k)
 
 		}
 
 	}
 
@@ -2982,3 +2994,31 @@ func h1ServerKeepAlivesDisabled(hs *http.Server) bool {
 
 	}
 
 	return false
 
 }
 
+
 
+func (sc *serverConn) countError(name string, err error) error {
 
+	if sc == nil || sc.srv == nil {
 
+		return err
 
+	}
 
+	f := sc.srv.CountError
 
+	if f == nil {
 
+		return err
 
+	}
 
+	var typ string
 
+	var code ErrCode
 
+	switch e := err.(type) {
 
+	case ConnectionError:
 
+		typ = "conn"
 
+		code = ErrCode(e)
 
+	case StreamError:
 
+		typ = "stream"
 
+		code = ErrCode(e.Code)
 
+	default:
 
+		return err
 
+	}
 
+	codeStr := errCodeName[code]
 
+	if codeStr == "" {
 
+		codeStr = strconv.Itoa(int(code))
 
+	}
 
+	f(fmt.Sprintf("%s_%s_%s", typ, codeStr, name))
 
+	return err
 
+}

File diff suppressed because it is too large
+ 556 - 364
vendor/golang.org/x/net/http2/transport.go


+ 6 - 1
vendor/golang.org/x/net/http2/write.go
Vedi File 

@@ -341,7 +341,12 @@ func encodeHeaders(enc *hpack.Encoder, h http.Header, keys []string) {
 
 	}
 
 	for _, k := range keys {
 
 		vv := h[k]
 
-		k = lowerHeader(k)
 
+		k, ascii := lowerHeader(k)
 
+		if !ascii {
 
+			// Skip writing invalid headers. Per RFC 7540, Section 8.1.2, header
 
+			// field names have to be ASCII characters (just as in HTTP/1.x).
 
+			continue
 
+		}
 
 		if !validWireHeaderFieldName(k) {
 
 			// Skip it as backup paranoia. Per
 
 			// golang.org/issue/14048, these should

+ 14 - 0
vendor/golang.org/x/net/idna/go118.go
Vedi File 

@@ -0,0 +1,14 @@
 
+// Code generated by running "go generate" in golang.org/x/text. DO NOT EDIT.
 
+
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+//go:build go1.18
 
+// +build go1.18
 
+
 
+package idna
 
+
 
+// Transitional processing is disabled by default in Go 1.18.
 
+// https://golang.org/issue/47510
 
+const transitionalLookup = false

+ 76 - 41
vendor/golang.org/x/net/idna/idna10.0.0.go
Vedi File 

@@ -59,23 +59,22 @@ type Option func(*options)
 
 // Transitional sets a Profile to use the Transitional mapping as defined in UTS
 
 // #46. This will cause, for example, "ß" to be mapped to "ss". Using the
 
 // transitional mapping provides a compromise between IDNA2003 and IDNA2008
 
-// compatibility. It is used by most browsers when resolving domain names. This
 
+// compatibility. It is used by some browsers when resolving domain names. This
 
 // option is only meaningful if combined with MapForLookup.
 
 func Transitional(transitional bool) Option {
 
-	return func(o *options) { o.transitional = true }
 
+	return func(o *options) { o.transitional = transitional }
 
 }
 
 
 // VerifyDNSLength sets whether a Profile should fail if any of the IDN parts
 
 // are longer than allowed by the RFC.
 
+//
 
+// This option corresponds to the VerifyDnsLength flag in UTS #46.
 
 func VerifyDNSLength(verify bool) Option {
 
 	return func(o *options) { o.verifyDNSLength = verify }
 
 }
 
 
 // RemoveLeadingDots removes leading label separators. Leading runes that map to
 
 // dots, such as U+3002 IDEOGRAPHIC FULL STOP, are removed as well.
 
-//
 
-// This is the behavior suggested by the UTS #46 and is adopted by some
 
-// browsers.
 
 func RemoveLeadingDots(remove bool) Option {
 
 	return func(o *options) { o.removeLeadingDots = remove }
 
 }
 
@@ -83,6 +82,8 @@ func RemoveLeadingDots(remove bool) Option {
 
 // ValidateLabels sets whether to check the mandatory label validation criteria
 
 // as defined in Section 5.4 of RFC 5891. This includes testing for correct use
 
 // of hyphens ('-'), normalization, validity of runes, and the context rules.
 
+// In particular, ValidateLabels also sets the CheckHyphens and CheckJoiners flags
 
+// in UTS #46.
 
 func ValidateLabels(enable bool) Option {
 
 	return func(o *options) {
 
 		// Don't override existing mappings, but set one that at least checks
 
@@ -91,25 +92,48 @@ func ValidateLabels(enable bool) Option {
 
 			o.mapping = normalize
 
 		}
 
 		o.trie = trie
 
-		o.validateLabels = enable
 
-		o.fromPuny = validateFromPunycode
 
+		o.checkJoiners = enable
 
+		o.checkHyphens = enable
 
+		if enable {
 
+			o.fromPuny = validateFromPunycode
 
+		} else {
 
+			o.fromPuny = nil
 
+		}
 
+	}
 
+}
 
+
 
+// CheckHyphens sets whether to check for correct use of hyphens ('-') in
 
+// labels. Most web browsers do not have this option set, since labels such as
 
+// "r3---sn-apo3qvuoxuxbt-j5pe" are in common use.
 
+//
 
+// This option corresponds to the CheckHyphens flag in UTS #46.
 
+func CheckHyphens(enable bool) Option {
 
+	return func(o *options) { o.checkHyphens = enable }
 
+}
 
+
 
+// CheckJoiners sets whether to check the ContextJ rules as defined in Appendix
 
+// A of RFC 5892, concerning the use of joiner runes.
 
+//
 
+// This option corresponds to the CheckJoiners flag in UTS #46.
 
+func CheckJoiners(enable bool) Option {
 
+	return func(o *options) {
 
+		o.trie = trie
 
+		o.checkJoiners = enable
 
 	}
 
 }
 
 
 // StrictDomainName limits the set of permissible ASCII characters to those
 
 // allowed in domain names as defined in RFC 1034 (A-Z, a-z, 0-9 and the
 
-// hyphen). This is set by default for MapForLookup and ValidateForRegistration.
 
+// hyphen). This is set by default for MapForLookup and ValidateForRegistration,
 
+// but is only useful if ValidateLabels is set.
 
 //
 
 // This option is useful, for instance, for browsers that allow characters
 
 // outside this range, for example a '_' (U+005F LOW LINE). See
 
-// http://www.rfc-editor.org/std/std3.txt for more details This option
 
-// corresponds to the UseSTD3ASCIIRules option in UTS #46.
 
+// http://www.rfc-editor.org/std/std3.txt for more details.
 
+//
 
+// This option corresponds to the UseSTD3ASCIIRules flag in UTS #46.
 
 func StrictDomainName(use bool) Option {
 
-	return func(o *options) {
 
-		o.trie = trie
 
-		o.useSTD3Rules = use
 
-		o.fromPuny = validateFromPunycode
 
-	}
 
+	return func(o *options) { o.useSTD3Rules = use }
 
 }
 
 
 // NOTE: the following options pull in tables. The tables should not be linked
 
@@ -117,6 +141,8 @@ func StrictDomainName(use bool) Option {
 
 
 // BidiRule enables the Bidi rule as defined in RFC 5893. Any application
 
 // that relies on proper validation of labels should include this rule.
 
+//
 
+// This option corresponds to the CheckBidi flag in UTS #46.
 
 func BidiRule() Option {
 
 	return func(o *options) { o.bidirule = bidirule.ValidString }
 
 }
 
@@ -152,7 +178,8 @@ func MapForLookup() Option {
 
 type options struct {
 
 	transitional      bool
 
 	useSTD3Rules      bool
 
-	validateLabels    bool
 
+	checkHyphens      bool
 
+	checkJoiners      bool
 
 	verifyDNSLength   bool
 
 	removeLeadingDots bool
 
 
@@ -225,8 +252,11 @@ func (p *Profile) String() string {
 
 	if p.useSTD3Rules {
 
 		s += ":UseSTD3Rules"
 
 	}
 
-	if p.validateLabels {
 
-		s += ":ValidateLabels"
 
+	if p.checkHyphens {
 
+		s += ":CheckHyphens"
 
+	}
 
+	if p.checkJoiners {
 
+		s += ":CheckJoiners"
 
 	}
 
 	if p.verifyDNSLength {
 
 		s += ":VerifyDNSLength"
 
@@ -254,26 +284,29 @@ var (
 
 
 	punycode = &Profile{}
 
 	lookup   = &Profile{options{
 
-		transitional:   true,
 
-		useSTD3Rules:   true,
 
-		validateLabels: true,
 
-		trie:           trie,
 
-		fromPuny:       validateFromPunycode,
 
-		mapping:        validateAndMap,
 
-		bidirule:       bidirule.ValidString,
 
+		transitional: transitionalLookup,
 
+		useSTD3Rules: true,
 
+		checkHyphens: true,
 
+		checkJoiners: true,
 
+		trie:         trie,
 
+		fromPuny:     validateFromPunycode,
 
+		mapping:      validateAndMap,
 
+		bidirule:     bidirule.ValidString,
 
 	}}
 
 	display = &Profile{options{
 
-		useSTD3Rules:   true,
 
-		validateLabels: true,
 
-		trie:           trie,
 
-		fromPuny:       validateFromPunycode,
 
-		mapping:        validateAndMap,
 
-		bidirule:       bidirule.ValidString,
 
+		useSTD3Rules: true,
 
+		checkHyphens: true,
 
+		checkJoiners: true,
 
+		trie:         trie,
 
+		fromPuny:     validateFromPunycode,
 
+		mapping:      validateAndMap,
 
+		bidirule:     bidirule.ValidString,
 
 	}}
 
 	registration = &Profile{options{
 
 		useSTD3Rules:    true,
 
-		validateLabels:  true,
 
 		verifyDNSLength: true,
 
+		checkHyphens:    true,
 
+		checkJoiners:    true,
 
 		trie:            trie,
 
 		fromPuny:        validateFromPunycode,
 
 		mapping:         validateRegistration,
 
@@ -340,7 +373,7 @@ func (p *Profile) process(s string, toASCII bool) (string, error) {
 
 			}
 
 			isBidi = isBidi || bidirule.DirectionString(u) != bidi.LeftToRight
 
 			labels.set(u)
 
-			if err == nil && p.validateLabels {
 
+			if err == nil && p.fromPuny != nil {
 
 				err = p.fromPuny(p, u)
 
 			}
 
 			if err == nil {
 
@@ -681,16 +714,18 @@ func (p *Profile) validateLabel(s string) (err error) {
 
 		}
 
 		return nil
 
 	}
 
-	if !p.validateLabels {
 
-		return nil
 
-	}
 
-	trie := p.trie // p.validateLabels is only set if trie is set.
 
-	if len(s) > 4 && s[2] == '-' && s[3] == '-' {
 
-		return &labelError{s, "V2"}
 
+	if p.checkHyphens {
 
+		if len(s) > 4 && s[2] == '-' && s[3] == '-' {
 
+			return &labelError{s, "V2"}
 
+		}
 
+		if s[0] == '-' || s[len(s)-1] == '-' {
 
+			return &labelError{s, "V3"}
 
+		}
 
 	}
 
-	if s[0] == '-' || s[len(s)-1] == '-' {
 
-		return &labelError{s, "V3"}
 
+	if !p.checkJoiners {
 
+		return nil
 
 	}
 
+	trie := p.trie // p.checkJoiners is only set if trie is set.
 
 	// TODO: merge the use of this in the trie.
 
 	v, sz := trie.lookupString(s)
 
 	x := info(v)

+ 66 - 31
vendor/golang.org/x/net/idna/idna9.0.0.go
Vedi File 

@@ -58,23 +58,22 @@ type Option func(*options)
 
 // Transitional sets a Profile to use the Transitional mapping as defined in UTS
 
 // #46. This will cause, for example, "ß" to be mapped to "ss". Using the
 
 // transitional mapping provides a compromise between IDNA2003 and IDNA2008
 
-// compatibility. It is used by most browsers when resolving domain names. This
 
+// compatibility. It is used by some browsers when resolving domain names. This
 
 // option is only meaningful if combined with MapForLookup.
 
 func Transitional(transitional bool) Option {
 
-	return func(o *options) { o.transitional = true }
 
+	return func(o *options) { o.transitional = transitional }
 
 }
 
 
 // VerifyDNSLength sets whether a Profile should fail if any of the IDN parts
 
 // are longer than allowed by the RFC.
 
+//
 
+// This option corresponds to the VerifyDnsLength flag in UTS #46.
 
 func VerifyDNSLength(verify bool) Option {
 
 	return func(o *options) { o.verifyDNSLength = verify }
 
 }
 
 
 // RemoveLeadingDots removes leading label separators. Leading runes that map to
 
 // dots, such as U+3002 IDEOGRAPHIC FULL STOP, are removed as well.
 
-//
 
-// This is the behavior suggested by the UTS #46 and is adopted by some
 
-// browsers.
 
 func RemoveLeadingDots(remove bool) Option {
 
 	return func(o *options) { o.removeLeadingDots = remove }
 
 }
 
@@ -82,6 +81,8 @@ func RemoveLeadingDots(remove bool) Option {
 
 // ValidateLabels sets whether to check the mandatory label validation criteria
 
 // as defined in Section 5.4 of RFC 5891. This includes testing for correct use
 
 // of hyphens ('-'), normalization, validity of runes, and the context rules.
 
+// In particular, ValidateLabels also sets the CheckHyphens and CheckJoiners flags
 
+// in UTS #46.
 
 func ValidateLabels(enable bool) Option {
 
 	return func(o *options) {
 
 		// Don't override existing mappings, but set one that at least checks
 
@@ -90,25 +91,48 @@ func ValidateLabels(enable bool) Option {
 
 			o.mapping = normalize
 
 		}
 
 		o.trie = trie
 
-		o.validateLabels = enable
 
-		o.fromPuny = validateFromPunycode
 
+		o.checkJoiners = enable
 
+		o.checkHyphens = enable
 
+		if enable {
 
+			o.fromPuny = validateFromPunycode
 
+		} else {
 
+			o.fromPuny = nil
 
+		}
 
+	}
 
+}
 
+
 
+// CheckHyphens sets whether to check for correct use of hyphens ('-') in
 
+// labels. Most web browsers do not have this option set, since labels such as
 
+// "r3---sn-apo3qvuoxuxbt-j5pe" are in common use.
 
+//
 
+// This option corresponds to the CheckHyphens flag in UTS #46.
 
+func CheckHyphens(enable bool) Option {
 
+	return func(o *options) { o.checkHyphens = enable }
 
+}
 
+
 
+// CheckJoiners sets whether to check the ContextJ rules as defined in Appendix
 
+// A of RFC 5892, concerning the use of joiner runes.
 
+//
 
+// This option corresponds to the CheckJoiners flag in UTS #46.
 
+func CheckJoiners(enable bool) Option {
 
+	return func(o *options) {
 
+		o.trie = trie
 
+		o.checkJoiners = enable
 
 	}
 
 }
 
 
 // StrictDomainName limits the set of permissable ASCII characters to those
 
 // allowed in domain names as defined in RFC 1034 (A-Z, a-z, 0-9 and the
 
-// hyphen). This is set by default for MapForLookup and ValidateForRegistration.
 
+// hyphen). This is set by default for MapForLookup and ValidateForRegistration,
 
+// but is only useful if ValidateLabels is set.
 
 //
 
 // This option is useful, for instance, for browsers that allow characters
 
 // outside this range, for example a '_' (U+005F LOW LINE). See
 
-// http://www.rfc-editor.org/std/std3.txt for more details This option
 
-// corresponds to the UseSTD3ASCIIRules option in UTS #46.
 
+// http://www.rfc-editor.org/std/std3.txt for more details.
 
+//
 
+// This option corresponds to the UseSTD3ASCIIRules flag in UTS #46.
 
 func StrictDomainName(use bool) Option {
 
-	return func(o *options) {
 
-		o.trie = trie
 
-		o.useSTD3Rules = use
 
-		o.fromPuny = validateFromPunycode
 
-	}
 
+	return func(o *options) { o.useSTD3Rules = use }
 
 }
 
 
 // NOTE: the following options pull in tables. The tables should not be linked
 
@@ -116,6 +140,8 @@ func StrictDomainName(use bool) Option {
 
 
 // BidiRule enables the Bidi rule as defined in RFC 5893. Any application
 
 // that relies on proper validation of labels should include this rule.
 
+//
 
+// This option corresponds to the CheckBidi flag in UTS #46.
 
 func BidiRule() Option {
 
 	return func(o *options) { o.bidirule = bidirule.ValidString }
 
 }
 
@@ -152,7 +178,8 @@ func MapForLookup() Option {
 
 type options struct {
 
 	transitional      bool
 
 	useSTD3Rules      bool
 
-	validateLabels    bool
 
+	checkHyphens      bool
 
+	checkJoiners      bool
 
 	verifyDNSLength   bool
 
 	removeLeadingDots bool
 
 
@@ -225,8 +252,11 @@ func (p *Profile) String() string {
 
 	if p.useSTD3Rules {
 
 		s += ":UseSTD3Rules"
 
 	}
 
-	if p.validateLabels {
 
-		s += ":ValidateLabels"
 
+	if p.checkHyphens {
 
+		s += ":CheckHyphens"
 
+	}
 
+	if p.checkJoiners {
 
+		s += ":CheckJoiners"
 
 	}
 
 	if p.verifyDNSLength {
 
 		s += ":VerifyDNSLength"
 
@@ -255,9 +285,10 @@ var (
 
 	punycode = &Profile{}
 
 	lookup   = &Profile{options{
 
 		transitional:      true,
 
-		useSTD3Rules:      true,
 
-		validateLabels:    true,
 
 		removeLeadingDots: true,
 
+		useSTD3Rules:      true,
 
+		checkHyphens:      true,
 
+		checkJoiners:      true,
 
 		trie:              trie,
 
 		fromPuny:          validateFromPunycode,
 
 		mapping:           validateAndMap,
 
@@ -265,8 +296,9 @@ var (
 
 	}}
 
 	display = &Profile{options{
 
 		useSTD3Rules:      true,
 
-		validateLabels:    true,
 
 		removeLeadingDots: true,
 
+		checkHyphens:      true,
 
+		checkJoiners:      true,
 
 		trie:              trie,
 
 		fromPuny:          validateFromPunycode,
 
 		mapping:           validateAndMap,
 
@@ -274,8 +306,9 @@ var (
 
 	}}
 
 	registration = &Profile{options{
 
 		useSTD3Rules:    true,
 
-		validateLabels:  true,
 
 		verifyDNSLength: true,
 
+		checkHyphens:    true,
 
+		checkJoiners:    true,
 
 		trie:            trie,
 
 		fromPuny:        validateFromPunycode,
 
 		mapping:         validateRegistration,
 
@@ -339,7 +372,7 @@ func (p *Profile) process(s string, toASCII bool) (string, error) {
 
 				continue
 
 			}
 
 			labels.set(u)
 
-			if err == nil && p.validateLabels {
 
+			if err == nil && p.fromPuny != nil {
 
 				err = p.fromPuny(p, u)
 
 			}
 
 			if err == nil {
 
@@ -629,16 +662,18 @@ func (p *Profile) validateLabel(s string) error {
 
 	if p.bidirule != nil && !p.bidirule(s) {
 
 		return &labelError{s, "B"}
 
 	}
 
-	if !p.validateLabels {
 
-		return nil
 
-	}
 
-	trie := p.trie // p.validateLabels is only set if trie is set.
 
-	if len(s) > 4 && s[2] == '-' && s[3] == '-' {
 
-		return &labelError{s, "V2"}
 
+	if p.checkHyphens {
 
+		if len(s) > 4 && s[2] == '-' && s[3] == '-' {
 
+			return &labelError{s, "V2"}
 
+		}
 
+		if s[0] == '-' || s[len(s)-1] == '-' {
 
+			return &labelError{s, "V3"}
 
+		}
 
 	}
 
-	if s[0] == '-' || s[len(s)-1] == '-' {
 
-		return &labelError{s, "V3"}
 
+	if !p.checkJoiners {
 
+		return nil
 
 	}
 
+	trie := p.trie // p.checkJoiners is only set if trie is set.
 
 	// TODO: merge the use of this in the trie.
 
 	v, sz := trie.lookupString(s)
 
 	x := info(v)

+ 12 - 0
vendor/golang.org/x/net/idna/pre_go118.go
Vedi File 

@@ -0,0 +1,12 @@
 
+// Code generated by running "go generate" in golang.org/x/text. DO NOT EDIT.
 
+
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+//go:build !go1.18
 
+// +build !go1.18
 
+
 
+package idna
 
+
 
+const transitionalLookup = true

+ 25 - 11
vendor/golang.org/x/net/idna/punycode.go
Vedi File 

@@ -49,6 +49,7 @@ func decode(encoded string) (string, error) {
 
 		}
 
 	}
 
 	i, n, bias := int32(0), initialN, initialBias
 
+	overflow := false
 
 	for pos < len(encoded) {
 
 		oldI, w := i, int32(1)
 
 		for k := base; ; k += base {
 
@@ -60,29 +61,32 @@ func decode(encoded string) (string, error) {
 
 				return "", punyError(encoded)
 
 			}
 
 			pos++
 
-			i += digit * w
 
-			if i < 0 {
 
+			i, overflow = madd(i, digit, w)
 
+			if overflow {
 
 				return "", punyError(encoded)
 
 			}
 
 			t := k - bias
 
-			if t < tmin {
 
+			if k <= bias {
 
 				t = tmin
 
-			} else if t > tmax {
 
+			} else if k >= bias+tmax {
 
 				t = tmax
 
 			}
 
 			if digit < t {
 
 				break
 
 			}
 
-			w *= base - t
 
-			if w >= math.MaxInt32/base {
 
+			w, overflow = madd(0, w, base-t)
 
+			if overflow {
 
 				return "", punyError(encoded)
 
 			}
 
 		}
 
+		if len(output) >= 1024 {
 
+			return "", punyError(encoded)
 
+		}
 
 		x := int32(len(output) + 1)
 
 		bias = adapt(i-oldI, x, oldI == 0)
 
 		n += i / x
 
 		i %= x
 
-		if n > utf8.MaxRune || len(output) >= 1024 {
 
+		if n < 0 || n > utf8.MaxRune {
 
 			return "", punyError(encoded)
 
 		}
 
 		output = append(output, 0)
 
@@ -115,6 +119,7 @@ func encode(prefix, s string) (string, error) {
 
 	if b > 0 {
 
 		output = append(output, '-')
 
 	}
 
+	overflow := false
 
 	for remaining != 0 {
 
 		m := int32(0x7fffffff)
 
 		for _, r := range s {
 
@@ -122,8 +127,8 @@ func encode(prefix, s string) (string, error) {
 
 				m = r
 
 			}
 
 		}
 
-		delta += (m - n) * (h + 1)
 
-		if delta < 0 {
 
+		delta, overflow = madd(delta, m-n, h+1)
 
+		if overflow {
 
 			return "", punyError(s)
 
 		}
 
 		n = m
 
@@ -141,9 +146,9 @@ func encode(prefix, s string) (string, error) {
 
 			q := delta
 
 			for k := base; ; k += base {
 
 				t := k - bias
 
-				if t < tmin {
 
+				if k <= bias {
 
 					t = tmin
 
-				} else if t > tmax {
 
+				} else if k >= bias+tmax {
 
 					t = tmax
 
 				}
 
 				if q < t {
 
@@ -164,6 +169,15 @@ func encode(prefix, s string) (string, error) {
 
 	return string(output), nil
 
 }
 
 
+// madd computes a + (b * c), detecting overflow.
 
+func madd(a, b, c int32) (next int32, overflow bool) {
 
+	p := int64(b) * int64(c)
 
+	if p > math.MaxInt32-int64(a) {
 
+		return 0, true
 
+	}
 
+	return a + int32(p), false
 
+}
 
+
 
 func decodeDigit(x byte) (digit int32, ok bool) {
 
 	switch {
 
 	case '0' <= x && x <= '9':

+ 2 - 2
vendor/golang.org/x/net/internal/socket/cmsghdr_linux_32bit.go
Vedi File 

@@ -2,8 +2,8 @@
 
 // Use of this source code is governed by a BSD-style
 
 // license that can be found in the LICENSE file.
 
 
-//go:build (arm || mips || mipsle || 386) && linux
 
-// +build arm mips mipsle 386
 
+//go:build (arm || mips || mipsle || 386 || ppc) && linux
 
+// +build arm mips mipsle 386 ppc
 
 // +build linux
 
 
 package socket

+ 26 - 0
vendor/golang.org/x/net/internal/socket/complete_dontwait.go
Vedi File 

@@ -0,0 +1,26 @@
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+//go:build darwin || dragonfly || freebsd || linux || netbsd || openbsd || solaris
 
+// +build darwin dragonfly freebsd linux netbsd openbsd solaris
 
+
 
+package socket
 
+
 
+import (
 
+	"syscall"
 
+)
 
+
 
+// ioComplete checks the flags and result of a syscall, to be used as return
 
+// value in a syscall.RawConn.Read or Write callback.
 
+func ioComplete(flags int, operr error) bool {
 
+	if flags&syscall.MSG_DONTWAIT != 0 {
 
+		// Caller explicitly said don't wait, so always return immediately.
 
+		return true
 
+	}
 
+	if operr == syscall.EAGAIN || operr == syscall.EWOULDBLOCK {
 
+		// No data available, block for I/O and try again.
 
+		return false
 
+	}
 
+	return true
 
+}

+ 22 - 0
vendor/golang.org/x/net/internal/socket/complete_nodontwait.go
Vedi File 

@@ -0,0 +1,22 @@
 
+// Copyright 2021 The Go Authors. All rights reserved.
 
+// Use of this source code is governed by a BSD-style
 
+// license that can be found in the LICENSE file.
 
+
 
+//go:build aix || windows || zos
 
+// +build aix windows zos
 
+
 
+package socket
 
+
 
+import (
 
+	"syscall"
 
+)
 
+
 
+// ioComplete checks the flags and result of a syscall, to be used as return
 
+// value in a syscall.RawConn.Read or Write callback.
 
+func ioComplete(flags int, operr error) bool {
 
+	if operr == syscall.EAGAIN || operr == syscall.EWOULDBLOCK {
 
+		// No data available, block for I/O and try again.
 
+		return false
 
+	}
 
+	return true
 
+}

+ 1 - 0
vendor/golang.org/x/net/internal/socket/empty.s
Vedi File 

@@ -2,6 +2,7 @@
 
 // Use of this source code is governed by a BSD-style
 
 // license that can be found in the LICENSE file.
 
 
+//go:build darwin && go1.12
 
 // +build darwin,go1.12
 
 
 // This exists solely so we can linkname in symbols from syscall.

Some files were not shown because too many files changed in this diff

Contact | Legal | Takedown | Status
Self-hosted public services - About
NibbleSpot by 0ct0pu5