mirror of
				https://github.com/go-gitea/gitea.git
				synced 2025-10-31 21:28:11 +09:00 
			
		
		
		
	Vendor Update Go Libs (#13166)
* update github.com/alecthomas/chroma v0.8.0 -> v0.8.1 * github.com/blevesearch/bleve v1.0.10 -> v1.0.12 * editorconfig-core-go v2.1.1 -> v2.3.7 * github.com/gliderlabs/ssh v0.2.2 -> v0.3.1 * migrate editorconfig.ParseBytes to Parse * github.com/shurcooL/vfsgen to 0d455de96546 * github.com/go-git/go-git/v5 v5.1.0 -> v5.2.0 * github.com/google/uuid v1.1.1 -> v1.1.2 * github.com/huandu/xstrings v1.3.0 -> v1.3.2 * github.com/klauspost/compress v1.10.11 -> v1.11.1 * github.com/markbates/goth v1.61.2 -> v1.65.0 * github.com/mattn/go-sqlite3 v1.14.0 -> v1.14.4 * github.com/mholt/archiver v3.3.0 -> v3.3.2 * github.com/microcosm-cc/bluemonday 4f7140c49acb -> v1.0.4 * github.com/minio/minio-go v7.0.4 -> v7.0.5 * github.com/olivere/elastic v7.0.9 -> v7.0.20 * github.com/urfave/cli v1.20.0 -> v1.22.4 * github.com/prometheus/client_golang v1.1.0 -> v1.8.0 * github.com/xanzy/go-gitlab v0.37.0 -> v0.38.1 * mvdan.cc/xurls v2.1.0 -> v2.2.0 Co-authored-by: Lauris BH <lauris@nix.lv>
This commit is contained in:
		
							
								
								
									
										72
									
								
								vendor/github.com/mailru/easyjson/buffer/pool.go
									
									
									
										generated
									
									
										vendored
									
									
								
							
							
						
						
									
										72
									
								
								vendor/github.com/mailru/easyjson/buffer/pool.go
									
									
									
										generated
									
									
										vendored
									
									
								
							| @@ -4,6 +4,7 @@ package buffer | ||||
|  | ||||
| import ( | ||||
| 	"io" | ||||
| 	"net" | ||||
| 	"sync" | ||||
| ) | ||||
|  | ||||
| @@ -52,14 +53,12 @@ func putBuf(buf []byte) { | ||||
|  | ||||
| // getBuf gets a chunk from reuse pool or creates a new one if reuse failed. | ||||
| func getBuf(size int) []byte { | ||||
| 	if size < config.PooledSize { | ||||
| 		return make([]byte, 0, size) | ||||
| 	} | ||||
|  | ||||
| 	if c := buffers[size]; c != nil { | ||||
| 		v := c.Get() | ||||
| 		if v != nil { | ||||
| 			return v.([]byte) | ||||
| 	if size >= config.PooledSize { | ||||
| 		if c := buffers[size]; c != nil { | ||||
| 			v := c.Get() | ||||
| 			if v != nil { | ||||
| 				return v.([]byte) | ||||
| 			} | ||||
| 		} | ||||
| 	} | ||||
| 	return make([]byte, 0, size) | ||||
| @@ -78,9 +77,12 @@ type Buffer struct { | ||||
| // EnsureSpace makes sure that the current chunk contains at least s free bytes, | ||||
| // possibly creating a new chunk. | ||||
| func (b *Buffer) EnsureSpace(s int) { | ||||
| 	if cap(b.Buf)-len(b.Buf) >= s { | ||||
| 		return | ||||
| 	if cap(b.Buf)-len(b.Buf) < s { | ||||
| 		b.ensureSpaceSlow(s) | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func (b *Buffer) ensureSpaceSlow(s int) { | ||||
| 	l := len(b.Buf) | ||||
| 	if l > 0 { | ||||
| 		if cap(b.toPool) != cap(b.Buf) { | ||||
| @@ -105,18 +107,22 @@ func (b *Buffer) EnsureSpace(s int) { | ||||
|  | ||||
| // AppendByte appends a single byte to buffer. | ||||
| func (b *Buffer) AppendByte(data byte) { | ||||
| 	if cap(b.Buf) == len(b.Buf) { // EnsureSpace won't be inlined. | ||||
| 		b.EnsureSpace(1) | ||||
| 	} | ||||
| 	b.EnsureSpace(1) | ||||
| 	b.Buf = append(b.Buf, data) | ||||
| } | ||||
|  | ||||
| // AppendBytes appends a byte slice to buffer. | ||||
| func (b *Buffer) AppendBytes(data []byte) { | ||||
| 	if len(data) <= cap(b.Buf)-len(b.Buf) { | ||||
| 		b.Buf = append(b.Buf, data...) // fast path | ||||
| 	} else { | ||||
| 		b.appendBytesSlow(data) | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func (b *Buffer) appendBytesSlow(data []byte) { | ||||
| 	for len(data) > 0 { | ||||
| 		if cap(b.Buf) == len(b.Buf) { // EnsureSpace won't be inlined. | ||||
| 			b.EnsureSpace(1) | ||||
| 		} | ||||
| 		b.EnsureSpace(1) | ||||
|  | ||||
| 		sz := cap(b.Buf) - len(b.Buf) | ||||
| 		if sz > len(data) { | ||||
| @@ -128,12 +134,18 @@ func (b *Buffer) AppendBytes(data []byte) { | ||||
| 	} | ||||
| } | ||||
|  | ||||
| // AppendBytes appends a string to buffer. | ||||
| // AppendString appends a string to buffer. | ||||
| func (b *Buffer) AppendString(data string) { | ||||
| 	if len(data) <= cap(b.Buf)-len(b.Buf) { | ||||
| 		b.Buf = append(b.Buf, data...) // fast path | ||||
| 	} else { | ||||
| 		b.appendStringSlow(data) | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func (b *Buffer) appendStringSlow(data string) { | ||||
| 	for len(data) > 0 { | ||||
| 		if cap(b.Buf) == len(b.Buf) { // EnsureSpace won't be inlined. | ||||
| 			b.EnsureSpace(1) | ||||
| 		} | ||||
| 		b.EnsureSpace(1) | ||||
|  | ||||
| 		sz := cap(b.Buf) - len(b.Buf) | ||||
| 		if sz > len(data) { | ||||
| @@ -156,18 +168,14 @@ func (b *Buffer) Size() int { | ||||
|  | ||||
| // DumpTo outputs the contents of a buffer to a writer and resets the buffer. | ||||
| func (b *Buffer) DumpTo(w io.Writer) (written int, err error) { | ||||
| 	var n int | ||||
| 	for _, buf := range b.bufs { | ||||
| 		if err == nil { | ||||
| 			n, err = w.Write(buf) | ||||
| 			written += n | ||||
| 		} | ||||
| 		putBuf(buf) | ||||
| 	bufs := net.Buffers(b.bufs) | ||||
| 	if len(b.Buf) > 0 { | ||||
| 		bufs = append(bufs, b.Buf) | ||||
| 	} | ||||
| 	n, err := bufs.WriteTo(w) | ||||
|  | ||||
| 	if err == nil { | ||||
| 		n, err = w.Write(b.Buf) | ||||
| 		written += n | ||||
| 	for _, buf := range b.bufs { | ||||
| 		putBuf(buf) | ||||
| 	} | ||||
| 	putBuf(b.toPool) | ||||
|  | ||||
| @@ -175,7 +183,7 @@ func (b *Buffer) DumpTo(w io.Writer) (written int, err error) { | ||||
| 	b.Buf = nil | ||||
| 	b.toPool = nil | ||||
|  | ||||
| 	return | ||||
| 	return int(n), err | ||||
| } | ||||
|  | ||||
| // BuildBytes creates a single byte slice with all the contents of the buffer. Data is | ||||
| @@ -192,7 +200,7 @@ func (b *Buffer) BuildBytes(reuse ...[]byte) []byte { | ||||
| 	var ret []byte | ||||
| 	size := b.Size() | ||||
|  | ||||
| 	// If we got a buffer as argument and it is big enought, reuse it. | ||||
| 	// If we got a buffer as argument and it is big enough, reuse it. | ||||
| 	if len(reuse) == 1 && cap(reuse[0]) >= size { | ||||
| 		ret = reuse[0][:0] | ||||
| 	} else { | ||||
|   | ||||
		Reference in New Issue
	
	Block a user