-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
BackupCopyService.java
164 lines (148 loc) · 5.96 KB
/
BackupCopyService.java
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/*
* Copyright (c) 2002-2018 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.com]
*
* This file is part of Neo4j Enterprise Edition. The included source
* code can be redistributed and/or modified under the terms of the
* GNU AFFERO GENERAL PUBLIC LICENSE Version 3
* (http://www.fsf.org/licensing/licenses/agpl-3.0.html) with the
* Commons Clause, as found in the associated LICENSE.txt file.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* Neo4j object code can be licensed independently from the source
* under separate terms from the AGPL. Inquiries can be directed to:
* licensing@neo4j.com
*
* More information is also available at:
* https://neo4j.com/licensing/
*/
package org.neo4j.backup.impl;
import java.io.File;
import java.io.IOException;
import java.nio.file.Path;
import java.util.Arrays;
import java.util.Iterator;
import java.util.concurrent.atomic.AtomicLong;
import java.util.function.Consumer;
import java.util.function.Supplier;
import java.util.stream.IntStream;
import java.util.stream.Stream;
import org.neo4j.com.storecopy.FileMoveAction;
import org.neo4j.com.storecopy.FileMoveProvider;
import org.neo4j.helpers.Exceptions;
import org.neo4j.io.fs.FileSystemAbstraction;
import org.neo4j.io.pagecache.PageCache;
import org.neo4j.kernel.impl.store.MetaDataStore;
import org.neo4j.kernel.impl.store.id.IdGeneratorImpl;
import static java.lang.String.format;
class BackupCopyService
{
private static final int MAX_OLD_BACKUPS = 1000;
private final FileSystemAbstraction fs;
private final FileMoveProvider fileMoveProvider;
BackupCopyService( FileSystemAbstraction fs, FileMoveProvider fileMoveProvider )
{
this.fs = fs;
this.fileMoveProvider = fileMoveProvider;
}
void moveBackupLocation( Path oldLocation, Path newLocation ) throws IOException
{
try
{
File source = oldLocation.toFile();
File target = newLocation.toFile();
Iterator<FileMoveAction> moves = fileMoveProvider.traverseForMoving( source ).iterator();
while ( moves.hasNext() )
{
moves.next().move( target );
}
}
catch ( IOException e )
{
throw new IOException( "Failed to rename backup directory from " + oldLocation + " to " + newLocation, e );
}
}
void clearIdFiles( Path backupLocation ) throws IOException
{
IOException exception = null;
File targetDirectory = backupLocation.toFile();
File[] files = fs.listFiles( targetDirectory );
for ( File file : files )
{
if ( !fs.isDirectory( file ) && file.getName().endsWith( ".id" ) )
{
try
{
long highId = IdGeneratorImpl.readHighId( fs, file );
fs.deleteFile( file );
IdGeneratorImpl.createGenerator( fs, file, highId, true );
}
catch ( IOException e )
{
exception = Exceptions.chain( exception, e );
}
}
}
if ( exception != null )
{
throw exception;
}
}
boolean backupExists( Path destination )
{
File[] files = fs.listFiles( destination.toFile() );
return files != null && Arrays.stream( files ).anyMatch(
f -> f.isFile() && f.getName().endsWith( MetaDataStore.DEFAULT_NAME ) );
}
Path findNewBackupLocationForBrokenExisting( Path existingBackup )
{
return findAnAvailableBackupLocation( existingBackup, "%s.err.%d" );
}
Path findAnAvailableLocationForNewFullBackup( Path desiredBackupLocation )
{
return findAnAvailableBackupLocation( desiredBackupLocation, "%s.temp.%d" );
}
/**
* Given a desired file name, find an available name that is similar to the given one that doesn't conflict with already existing backups
*
* @param file desired ideal file name
* @param pattern pattern to follow if desired name is taken (requires %s for original name, and %d for iteration)
* @return the resolved file name which can be the original desired, or a variation that matches the pattern
*/
private Path findAnAvailableBackupLocation( Path file, String pattern )
{
if ( backupExists( file ) )
{
// find alternative name
final AtomicLong counter = new AtomicLong( 0 );
Consumer<Path> countNumberOfFilesProcessedForPotentialErrorMessage =
generatedBackupFile -> counter.getAndIncrement();
return availableAlternativeNames( file, pattern )
.peek( countNumberOfFilesProcessedForPotentialErrorMessage )
.filter( f -> !backupExists( f ) )
.findFirst()
.orElseThrow( noFreeBackupLocation( file, counter ) );
}
return file;
}
private static Supplier<RuntimeException> noFreeBackupLocation( Path file, AtomicLong counter )
{
return () -> new RuntimeException( String.format(
"Unable to find a free backup location for the provided %s. %d possible locations were already taken.",
file, counter.get() ) );
}
private static Stream<Path> availableAlternativeNames( Path originalBackupDirectory, String pattern )
{
return IntStream.range( 0, MAX_OLD_BACKUPS )
.mapToObj( iteration -> alteredBackupDirectoryName( pattern, originalBackupDirectory, iteration ) );
}
private static Path alteredBackupDirectoryName( String pattern, Path directory, int iteration )
{
Path directoryName = directory.getName( directory.getNameCount() - 1 );
return directory.resolveSibling( format( pattern, directoryName, iteration ) );
}
}