forked from forgejo/forgejo
Dump: add output format tar and output to stdout (#10376)
* Dump: Use mholt/archive/v3 to support tar including many compressions Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * Dump: Allow dump output to stdout Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * Dump: Fixed bug present since #6677 where SessionConfig.Provider is never "file" Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * Dump: never pack RepoRootPath, LFS.ContentPath and LogRootPath when they are below AppDataPath Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * Dump: also dump LFS (fixes #10058) Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * Dump: never dump CustomPath if CustomPath is a subdir of or equal to AppDataPath (fixes #10365) Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * Use log.Info instead of fmt.Fprintf Signed-off-by: Philipp Homann <homann.philipp@googlemail.com> * import ordering * make fmt Co-authored-by: zeripath <art27@cantab.net> Co-authored-by: techknowlogick <techknowlogick@gitea.io> Co-authored-by: Matti R <matti@mdranta.net>
This commit is contained in:
parent
209b17c4e2
commit
684b7a999f
303 changed files with 301317 additions and 1183 deletions
115
vendor/github.com/klauspost/compress/zstd/seqenc.go
generated
vendored
Normal file
115
vendor/github.com/klauspost/compress/zstd/seqenc.go
generated
vendored
Normal file
|
@ -0,0 +1,115 @@
|
|||
// Copyright 2019+ Klaus Post. All rights reserved.
|
||||
// License information can be found in the LICENSE file.
|
||||
// Based on work by Yann Collet, released under BSD License.
|
||||
|
||||
package zstd
|
||||
|
||||
import "math/bits"
|
||||
|
||||
type seqCoders struct {
|
||||
llEnc, ofEnc, mlEnc *fseEncoder
|
||||
llPrev, ofPrev, mlPrev *fseEncoder
|
||||
}
|
||||
|
||||
// swap coders with another (block).
|
||||
func (s *seqCoders) swap(other *seqCoders) {
|
||||
*s, *other = *other, *s
|
||||
}
|
||||
|
||||
// setPrev will update the previous encoders to the actually used ones
|
||||
// and make sure a fresh one is in the main slot.
|
||||
func (s *seqCoders) setPrev(ll, ml, of *fseEncoder) {
|
||||
compareSwap := func(used *fseEncoder, current, prev **fseEncoder) {
|
||||
// We used the new one, more current to history and reuse the previous history
|
||||
if *current == used {
|
||||
*prev, *current = *current, *prev
|
||||
c := *current
|
||||
p := *prev
|
||||
c.reUsed = false
|
||||
p.reUsed = true
|
||||
return
|
||||
}
|
||||
if used == *prev {
|
||||
return
|
||||
}
|
||||
// Ensure we cannot reuse by accident
|
||||
prevEnc := *prev
|
||||
prevEnc.symbolLen = 0
|
||||
return
|
||||
}
|
||||
compareSwap(ll, &s.llEnc, &s.llPrev)
|
||||
compareSwap(ml, &s.mlEnc, &s.mlPrev)
|
||||
compareSwap(of, &s.ofEnc, &s.ofPrev)
|
||||
}
|
||||
|
||||
func highBit(val uint32) (n uint32) {
|
||||
return uint32(bits.Len32(val) - 1)
|
||||
}
|
||||
|
||||
var llCodeTable = [64]byte{0, 1, 2, 3, 4, 5, 6, 7,
|
||||
8, 9, 10, 11, 12, 13, 14, 15,
|
||||
16, 16, 17, 17, 18, 18, 19, 19,
|
||||
20, 20, 20, 20, 21, 21, 21, 21,
|
||||
22, 22, 22, 22, 22, 22, 22, 22,
|
||||
23, 23, 23, 23, 23, 23, 23, 23,
|
||||
24, 24, 24, 24, 24, 24, 24, 24,
|
||||
24, 24, 24, 24, 24, 24, 24, 24}
|
||||
|
||||
// Up to 6 bits
|
||||
const maxLLCode = 35
|
||||
|
||||
// llBitsTable translates from ll code to number of bits.
|
||||
var llBitsTable = [maxLLCode + 1]byte{
|
||||
0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 2, 2, 3, 3,
|
||||
4, 6, 7, 8, 9, 10, 11, 12,
|
||||
13, 14, 15, 16}
|
||||
|
||||
// llCode returns the code that represents the literal length requested.
|
||||
func llCode(litLength uint32) uint8 {
|
||||
const llDeltaCode = 19
|
||||
if litLength <= 63 {
|
||||
// Compiler insists on bounds check (Go 1.12)
|
||||
return llCodeTable[litLength&63]
|
||||
}
|
||||
return uint8(highBit(litLength)) + llDeltaCode
|
||||
}
|
||||
|
||||
var mlCodeTable = [128]byte{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
|
||||
16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
|
||||
32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37,
|
||||
38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39,
|
||||
40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
|
||||
41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
|
||||
42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
|
||||
42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42}
|
||||
|
||||
// Up to 6 bits
|
||||
const maxMLCode = 52
|
||||
|
||||
// mlBitsTable translates from ml code to number of bits.
|
||||
var mlBitsTable = [maxMLCode + 1]byte{
|
||||
0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 2, 2, 3, 3,
|
||||
4, 4, 5, 7, 8, 9, 10, 11,
|
||||
12, 13, 14, 15, 16}
|
||||
|
||||
// note : mlBase = matchLength - MINMATCH;
|
||||
// because it's the format it's stored in seqStore->sequences
|
||||
func mlCode(mlBase uint32) uint8 {
|
||||
const mlDeltaCode = 36
|
||||
if mlBase <= 127 {
|
||||
// Compiler insists on bounds check (Go 1.12)
|
||||
return mlCodeTable[mlBase&127]
|
||||
}
|
||||
return uint8(highBit(mlBase)) + mlDeltaCode
|
||||
}
|
||||
|
||||
func ofCode(offset uint32) uint8 {
|
||||
// A valid offset will always be > 0.
|
||||
return uint8(bits.Len32(offset) - 1)
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue