2014-11-16 20:13:20 +00:00
|
|
|
// Copyright (C) 2014 The Syncthing Authors.
|
2014-09-29 19:43:32 +00:00
|
|
|
//
|
2015-03-07 20:36:35 +00:00
|
|
|
// This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
// License, v. 2.0. If a copy of the MPL was not distributed with this file,
|
2017-02-09 06:52:18 +00:00
|
|
|
// You can obtain one at https://mozilla.org/MPL/2.0/.
|
2014-06-01 20:50:14 +00:00
|
|
|
|
2014-03-08 22:02:01 +00:00
|
|
|
package scanner
|
2014-03-02 22:58:14 +00:00
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
2017-04-26 00:15:23 +00:00
|
|
|
"context"
|
2014-09-27 12:44:15 +00:00
|
|
|
"fmt"
|
2017-01-23 13:50:32 +00:00
|
|
|
"hash"
|
2014-03-02 22:58:14 +00:00
|
|
|
"io"
|
2014-07-12 21:06:48 +00:00
|
|
|
|
2017-01-18 10:57:01 +00:00
|
|
|
"github.com/chmduquesne/rollinghash/adler32"
|
2015-09-22 17:38:46 +00:00
|
|
|
"github.com/syncthing/syncthing/lib/protocol"
|
2016-09-23 19:33:54 +00:00
|
|
|
"github.com/syncthing/syncthing/lib/sha256"
|
2014-03-02 22:58:14 +00:00
|
|
|
)
|
|
|
|
|
2014-10-24 22:20:08 +00:00
|
|
|
var SHA256OfNothing = []uint8{0xe3, 0xb0, 0xc4, 0x42, 0x98, 0xfc, 0x1c, 0x14, 0x9a, 0xfb, 0xf4, 0xc8, 0x99, 0x6f, 0xb9, 0x24, 0x27, 0xae, 0x41, 0xe4, 0x64, 0x9b, 0x93, 0x4c, 0xa4, 0x95, 0x99, 0x1b, 0x78, 0x52, 0xb8, 0x55}
|
2014-07-26 19:28:32 +00:00
|
|
|
|
2015-11-17 20:08:36 +00:00
|
|
|
type Counter interface {
|
|
|
|
Update(bytes int64)
|
|
|
|
}
|
|
|
|
|
2014-03-02 22:58:14 +00:00
|
|
|
// Blocks returns the blockwise hash of the reader.
|
2017-04-26 00:15:23 +00:00
|
|
|
func Blocks(ctx context.Context, r io.Reader, blocksize int, sizehint int64, counter Counter, useWeakHashes bool) ([]protocol.BlockInfo, error) {
|
2015-10-27 08:31:28 +00:00
|
|
|
hf := sha256.New()
|
|
|
|
hashLength := hf.Size()
|
2017-01-23 13:50:32 +00:00
|
|
|
|
|
|
|
var mhf io.Writer
|
|
|
|
var whf hash.Hash32
|
|
|
|
|
|
|
|
if useWeakHashes {
|
|
|
|
whf = adler32.New()
|
|
|
|
mhf = io.MultiWriter(hf, whf)
|
|
|
|
} else {
|
|
|
|
whf = noopHash{}
|
|
|
|
mhf = hf
|
|
|
|
}
|
2015-10-27 08:31:28 +00:00
|
|
|
|
2014-07-12 21:06:48 +00:00
|
|
|
var blocks []protocol.BlockInfo
|
2015-10-27 08:31:28 +00:00
|
|
|
var hashes, thisHash []byte
|
|
|
|
|
2016-07-26 08:51:39 +00:00
|
|
|
if sizehint >= 0 {
|
2015-10-27 08:31:28 +00:00
|
|
|
// Allocate contiguous blocks for the BlockInfo structures and their
|
2016-07-25 19:16:49 +00:00
|
|
|
// hashes once and for all, and stick to the specified size.
|
|
|
|
r = io.LimitReader(r, sizehint)
|
2015-10-27 08:31:28 +00:00
|
|
|
numBlocks := int(sizehint / int64(blocksize))
|
|
|
|
blocks = make([]protocol.BlockInfo, 0, numBlocks)
|
|
|
|
hashes = make([]byte, 0, hashLength*numBlocks)
|
2014-08-12 11:52:36 +00:00
|
|
|
}
|
2015-10-27 08:31:28 +00:00
|
|
|
|
|
|
|
// A 32k buffer is used for copying into the hash function.
|
|
|
|
buf := make([]byte, 32<<10)
|
|
|
|
|
2014-03-02 22:58:14 +00:00
|
|
|
var offset int64
|
2017-01-18 17:43:00 +00:00
|
|
|
lr := io.LimitReader(r, int64(blocksize)).(*io.LimitedReader)
|
2014-03-02 22:58:14 +00:00
|
|
|
for {
|
2017-04-26 00:15:23 +00:00
|
|
|
select {
|
|
|
|
case <-ctx.Done():
|
|
|
|
return nil, ctx.Err()
|
|
|
|
default:
|
|
|
|
}
|
|
|
|
|
2017-01-18 17:43:00 +00:00
|
|
|
lr.N = int64(blocksize)
|
2017-01-04 21:04:13 +00:00
|
|
|
n, err := io.CopyBuffer(mhf, lr, buf)
|
2014-03-02 22:58:14 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
if n == 0 {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
2015-08-26 22:49:06 +00:00
|
|
|
if counter != nil {
|
2016-12-17 14:37:11 +00:00
|
|
|
counter.Update(n)
|
2015-08-26 22:49:06 +00:00
|
|
|
}
|
|
|
|
|
2015-10-27 08:31:28 +00:00
|
|
|
// Carve out a hash-sized chunk of "hashes" to store the hash for this
|
|
|
|
// block.
|
|
|
|
hashes = hf.Sum(hashes)
|
|
|
|
thisHash, hashes = hashes[:hashLength], hashes[hashLength:]
|
|
|
|
|
2014-07-12 21:06:48 +00:00
|
|
|
b := protocol.BlockInfo{
|
2016-12-14 23:30:29 +00:00
|
|
|
Size: int32(n),
|
|
|
|
Offset: offset,
|
|
|
|
Hash: thisHash,
|
|
|
|
WeakHash: whf.Sum32(),
|
2014-03-02 22:58:14 +00:00
|
|
|
}
|
2015-10-27 08:31:28 +00:00
|
|
|
|
2014-03-02 22:58:14 +00:00
|
|
|
blocks = append(blocks, b)
|
2016-12-17 14:37:11 +00:00
|
|
|
offset += n
|
2014-08-12 11:52:36 +00:00
|
|
|
|
|
|
|
hf.Reset()
|
2016-12-14 23:30:29 +00:00
|
|
|
whf.Reset()
|
2014-03-02 22:58:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if len(blocks) == 0 {
|
|
|
|
// Empty file
|
2014-07-12 21:06:48 +00:00
|
|
|
blocks = append(blocks, protocol.BlockInfo{
|
2014-03-02 22:58:14 +00:00
|
|
|
Offset: 0,
|
|
|
|
Size: 0,
|
2014-10-24 22:20:08 +00:00
|
|
|
Hash: SHA256OfNothing,
|
2014-03-02 22:58:14 +00:00
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
return blocks, nil
|
|
|
|
}
|
|
|
|
|
2015-04-28 20:32:10 +00:00
|
|
|
// PopulateOffsets sets the Offset field on each block
|
2014-10-17 22:16:29 +00:00
|
|
|
func PopulateOffsets(blocks []protocol.BlockInfo) {
|
|
|
|
var offset int64
|
|
|
|
for i := range blocks {
|
|
|
|
blocks[i].Offset = offset
|
|
|
|
offset += int64(blocks[i].Size)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-03-02 22:58:14 +00:00
|
|
|
// BlockDiff returns lists of common and missing (to transform src into tgt)
|
|
|
|
// blocks. Both block lists must have been created with the same block size.
|
2014-07-12 21:06:48 +00:00
|
|
|
func BlockDiff(src, tgt []protocol.BlockInfo) (have, need []protocol.BlockInfo) {
|
2014-03-02 22:58:14 +00:00
|
|
|
if len(tgt) == 0 && len(src) != 0 {
|
|
|
|
return nil, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(tgt) != 0 && len(src) == 0 {
|
|
|
|
// Copy the entire file
|
|
|
|
return nil, tgt
|
|
|
|
}
|
|
|
|
|
|
|
|
for i := range tgt {
|
2016-03-31 15:12:46 +00:00
|
|
|
if i >= len(src) || !bytes.Equal(tgt[i].Hash, src[i].Hash) {
|
2014-03-02 22:58:14 +00:00
|
|
|
// Copy differing block
|
|
|
|
need = append(need, tgt[i])
|
|
|
|
} else {
|
|
|
|
have = append(have, tgt[i])
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return have, need
|
|
|
|
}
|
2014-09-27 12:44:15 +00:00
|
|
|
|
|
|
|
// Verify returns nil or an error describing the mismatch between the block
|
|
|
|
// list and actual reader contents
|
|
|
|
func Verify(r io.Reader, blocksize int, blocks []protocol.BlockInfo) error {
|
|
|
|
hf := sha256.New()
|
2016-12-14 23:30:29 +00:00
|
|
|
// A 32k buffer is used for copying into the hash function.
|
|
|
|
buf := make([]byte, 32<<10)
|
|
|
|
|
2014-09-27 12:44:15 +00:00
|
|
|
for i, block := range blocks {
|
|
|
|
lr := &io.LimitedReader{R: r, N: int64(blocksize)}
|
2016-12-14 23:30:29 +00:00
|
|
|
_, err := io.CopyBuffer(hf, lr, buf)
|
2014-09-27 12:44:15 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
hash := hf.Sum(nil)
|
|
|
|
hf.Reset()
|
|
|
|
|
2016-03-31 15:12:46 +00:00
|
|
|
if !bytes.Equal(hash, block.Hash) {
|
2014-09-27 12:44:15 +00:00
|
|
|
return fmt.Errorf("hash mismatch %x != %x for block %d", hash, block.Hash, i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// We should have reached the end now
|
|
|
|
bs := make([]byte, 1)
|
|
|
|
n, err := r.Read(bs)
|
|
|
|
if n != 0 || err != io.EOF {
|
|
|
|
return fmt.Errorf("file continues past end of blocks")
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
2014-11-09 04:26:52 +00:00
|
|
|
|
2014-12-28 23:11:32 +00:00
|
|
|
func VerifyBuffer(buf []byte, block protocol.BlockInfo) ([]byte, error) {
|
|
|
|
if len(buf) != int(block.Size) {
|
|
|
|
return nil, fmt.Errorf("length mismatch %d != %d", len(buf), block.Size)
|
|
|
|
}
|
|
|
|
hf := sha256.New()
|
|
|
|
_, err := hf.Write(buf)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
hash := hf.Sum(nil)
|
|
|
|
|
|
|
|
if !bytes.Equal(hash, block.Hash) {
|
|
|
|
return hash, fmt.Errorf("hash mismatch %x != %x", hash, block.Hash)
|
|
|
|
}
|
|
|
|
|
|
|
|
return hash, nil
|
|
|
|
}
|
|
|
|
|
2015-04-28 20:32:10 +00:00
|
|
|
// BlocksEqual returns whether two slices of blocks are exactly the same hash
|
2014-11-09 04:26:52 +00:00
|
|
|
// and index pair wise.
|
|
|
|
func BlocksEqual(src, tgt []protocol.BlockInfo) bool {
|
|
|
|
if len(tgt) != len(src) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
for i, sblk := range src {
|
|
|
|
if !bytes.Equal(sblk.Hash, tgt[i].Hash) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
2017-01-23 13:50:32 +00:00
|
|
|
|
|
|
|
type noopHash struct{}
|
|
|
|
|
|
|
|
func (noopHash) Sum32() uint32 { return 0 }
|
|
|
|
func (noopHash) BlockSize() int { return 0 }
|
|
|
|
func (noopHash) Size() int { return 0 }
|
|
|
|
func (noopHash) Reset() {}
|
|
|
|
func (noopHash) Sum([]byte) []byte { return nil }
|
|
|
|
func (noopHash) Write([]byte) (int, error) { return 0, nil }
|