private int getArrayIndexOfDirectory(File searchDir) { for(DirectoryHolder holder : directories) { if(holder.getDir().equals(searchDir)) { return holder.getArrayIndex(); } } return 0; }
private int getArrayIndexOfDirectory(File searchDir) { for(DirectoryHolder holder : directories) { if(holder.getDir().equals(searchDir)) { return holder.getArrayIndex(); } } return 0; }
private void setFirstChild(TreeSet<Oplog> oplogSet, boolean force) { if (parent.isOffline() && !parent.isOfflineCompacting()) return; if (!oplogSet.isEmpty()) { Oplog first = oplogSet.first(); DirectoryHolder dh = first.getDirectoryHolder(); dirCounter = dh.getArrayIndex(); dirCounter = (++dirCounter) % parent.dirLength; // we want the first child to go in the directory after the directory // used by the existing oplog with the max id. // This fixes bug 41822. } if (force || maxRecoveredOplogId > 0) { setChild(new Oplog(maxRecoveredOplogId + 1, this, getNextDir())); } }
private void setFirstChild(TreeSet<Oplog> oplogSet, boolean force) { if (parent.isOffline() && !parent.isOfflineCompacting() && !parent.isOfflineModify()) return; if (!oplogSet.isEmpty()) { Oplog first = oplogSet.first(); DirectoryHolder dh = first.getDirectoryHolder(); dirCounter = dh.getArrayIndex(); dirCounter = (++dirCounter) % parent.dirLength; // we want the first child to go in the directory after the directory // used by the existing oplog with the max id. // This fixes bug 41822. } if (force || maxRecoveredOplogId > 0) { setChild(new Oplog(maxRecoveredOplogId + 1, this, getNextDir())); } }
Set<File> filesToBackup = entry.getValue(); int index = oplog.getDirectoryHolder().getArrayIndex(); File backupDir = getBackupDir(this.diskStoreBackup.getTargetDir(), index);
int index = oplog.getDirectoryHolder().getArrayIndex(); File backupDir = getBackupDir(this.diskStoreBackup.getTargetDir(), index);