123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250 |
- package storage
- import (
- "context"
- "fmt"
- "io"
- "os"
- "google.golang.org/grpc"
- "github.com/chrislusf/seaweedfs/weed/operation"
- "github.com/chrislusf/seaweedfs/weed/pb/volume_server_pb"
- "github.com/chrislusf/seaweedfs/weed/storage/idx"
- "github.com/chrislusf/seaweedfs/weed/storage/needle"
- "github.com/chrislusf/seaweedfs/weed/storage/super_block"
- . "github.com/chrislusf/seaweedfs/weed/storage/types"
- )
- func (v *Volume) GetVolumeSyncStatus() *volume_server_pb.VolumeSyncStatusResponse {
- v.dataFileAccessLock.RLock()
- defer v.dataFileAccessLock.RUnlock()
- var syncStatus = &volume_server_pb.VolumeSyncStatusResponse{}
- if datSize, _, err := v.DataBackend.GetStat(); err == nil {
- syncStatus.TailOffset = uint64(datSize)
- }
- syncStatus.Collection = v.Collection
- syncStatus.IdxFileSize = v.nm.IndexFileSize()
- syncStatus.CompactRevision = uint32(v.SuperBlock.CompactionRevision)
- syncStatus.Ttl = v.SuperBlock.Ttl.String()
- syncStatus.Replication = v.SuperBlock.ReplicaPlacement.String()
- return syncStatus
- }
- // The volume sync with a master volume via 2 steps:
- // 1. The slave checks master side to find subscription checkpoint
- // to setup the replication.
- // 2. The slave receives the updates from master
- /*
- Assume the slave volume needs to follow the master volume.
- The master volume could be compacted, and could be many files ahead of
- slave volume.
- Step 0: // implemented in command/backup.go, to avoid dat file size overflow.
- 0.1 If slave compact version is less than the master, do a local compaction, and set
- local compact version the same as the master.
- 0.2 If the slave size is still bigger than the master, discard local copy and do a full copy.
- Step 1:
- The slave volume ask the master by the last modification time t.
- The master do a binary search in volume (use .idx as an array, and check the appendAtNs in .dat file),
- to find the first entry with appendAtNs > t.
- Step 2:
- The master send content bytes to the slave. The bytes are not chunked by needle.
- Step 3:
- The slave generate the needle map for the new bytes. (This may be optimized to incrementally
- update needle map when receiving new .dat bytes. But seems not necessary now.)
- */
- func (v *Volume) IncrementalBackup(volumeServer string, grpcDialOption grpc.DialOption) error {
- startFromOffset, _, _ := v.FileStat()
- appendAtNs, err := v.findLastAppendAtNs()
- if err != nil {
- return err
- }
- writeOffset := int64(startFromOffset)
- err = operation.WithVolumeServerClient(volumeServer, grpcDialOption, func(client volume_server_pb.VolumeServerClient) error {
- stream, err := client.VolumeIncrementalCopy(context.Background(), &volume_server_pb.VolumeIncrementalCopyRequest{
- VolumeId: uint32(v.Id),
- SinceNs: appendAtNs,
- })
- if err != nil {
- return err
- }
- for {
- resp, recvErr := stream.Recv()
- if recvErr != nil {
- if recvErr == io.EOF {
- break
- } else {
- return recvErr
- }
- }
- n, writeErr := v.DataBackend.WriteAt(resp.FileContent, writeOffset)
- if writeErr != nil {
- return writeErr
- }
- writeOffset += int64(n)
- }
- return nil
- })
- if err != nil {
- return err
- }
- // add to needle map
- return ScanVolumeFileFrom(v.Version(), v.DataBackend, int64(startFromOffset), &VolumeFileScanner4GenIdx{v: v})
- }
- func (v *Volume) findLastAppendAtNs() (uint64, error) {
- offset, err := v.locateLastAppendEntry()
- if err != nil {
- return 0, err
- }
- if offset.IsZero() {
- return 0, nil
- }
- return v.readAppendAtNs(offset)
- }
- func (v *Volume) locateLastAppendEntry() (Offset, error) {
- indexFile, e := os.OpenFile(v.FileName(".idx"), os.O_RDONLY, 0644)
- if e != nil {
- return Offset{}, fmt.Errorf("cannot read %s: %v", v.FileName(".idx"), e)
- }
- defer indexFile.Close()
- fi, err := indexFile.Stat()
- if err != nil {
- return Offset{}, fmt.Errorf("file %s stat error: %v", indexFile.Name(), err)
- }
- fileSize := fi.Size()
- if fileSize%NeedleMapEntrySize != 0 {
- return Offset{}, fmt.Errorf("unexpected file %s size: %d", indexFile.Name(), fileSize)
- }
- if fileSize == 0 {
- return Offset{}, nil
- }
- bytes := make([]byte, NeedleMapEntrySize)
- n, e := indexFile.ReadAt(bytes, fileSize-NeedleMapEntrySize)
- if n != NeedleMapEntrySize {
- return Offset{}, fmt.Errorf("file %s read error: %v", indexFile.Name(), e)
- }
- _, offset, _ := idx.IdxFileEntry(bytes)
- return offset, nil
- }
- func (v *Volume) readAppendAtNs(offset Offset) (uint64, error) {
- n, _, bodyLength, err := needle.ReadNeedleHeader(v.DataBackend, v.SuperBlock.Version, offset.ToActualOffset())
- if err != nil {
- return 0, fmt.Errorf("ReadNeedleHeader %s [%d,%d): %v", v.DataBackend.Name(), offset.ToActualOffset(), offset.ToActualOffset()+NeedleHeaderSize, err)
- }
- _, err = n.ReadNeedleBody(v.DataBackend, v.SuperBlock.Version, offset.ToActualOffset()+NeedleHeaderSize, bodyLength)
- if err != nil {
- return 0, fmt.Errorf("ReadNeedleBody offset %d, bodyLength %d: %v", offset.ToActualOffset(), bodyLength, err)
- }
- return n.AppendAtNs, nil
- }
- // on server side
- func (v *Volume) BinarySearchByAppendAtNs(sinceNs uint64) (offset Offset, isLast bool, err error) {
- fileSize := int64(v.IndexFileSize())
- if fileSize%NeedleMapEntrySize != 0 {
- err = fmt.Errorf("unexpected file %s.idx size: %d", v.IndexFileName(), fileSize)
- return
- }
- entryCount := fileSize / NeedleMapEntrySize
- l := int64(0)
- h := entryCount
- for l < h {
- m := (l + h) / 2
- if m == entryCount {
- return Offset{}, true, nil
- }
- // read the appendAtNs for entry m
- offset, err = v.readOffsetFromIndex(m)
- if err != nil {
- return
- }
- mNs, nsReadErr := v.readAppendAtNs(offset)
- if nsReadErr != nil {
- err = nsReadErr
- return
- }
- // move the boundary
- if mNs <= sinceNs {
- l = m + 1
- } else {
- h = m
- }
- }
- if l == entryCount {
- return Offset{}, true, nil
- }
- offset, err = v.readOffsetFromIndex(l)
- return offset, false, err
- }
- // bytes is of size NeedleMapEntrySize
- func (v *Volume) readOffsetFromIndex(m int64) (Offset, error) {
- v.dataFileAccessLock.RLock()
- defer v.dataFileAccessLock.RUnlock()
- if v.nm == nil {
- return Offset{}, io.EOF
- }
- _, offset, _, err := v.nm.ReadIndexEntry(m)
- return offset, err
- }
- // generate the volume idx
- type VolumeFileScanner4GenIdx struct {
- v *Volume
- }
- func (scanner *VolumeFileScanner4GenIdx) VisitSuperBlock(superBlock super_block.SuperBlock) error {
- return nil
- }
- func (scanner *VolumeFileScanner4GenIdx) ReadNeedleBody() bool {
- return false
- }
- func (scanner *VolumeFileScanner4GenIdx) VisitNeedle(n *needle.Needle, offset int64, needleHeader, needleBody []byte) error {
- if n.Size > 0 && n.Size.IsValid() {
- return scanner.v.nm.Put(n.Id, ToOffset(offset), n.Size)
- }
- return scanner.v.nm.Delete(n.Id, ToOffset(offset))
- }
|