347 lines
8.6 KiB
JavaScript
347 lines
8.6 KiB
JavaScript
'use strict';
|
|
var index = require('../../');
|
|
var bitcore = require('bitcore-lib');
|
|
var BufferUtil = bitcore.util.buffer;
|
|
var log = index.log;
|
|
var async = require('async');
|
|
|
|
function Reorg(node, db) {
|
|
this.node = node;
|
|
this.db = db;
|
|
}
|
|
|
|
Reorg.prototype.handleReorg = function(block, callback) {
|
|
var self = this;
|
|
|
|
self.handleConcurrentReorg(function(err) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
self.findCommonAncestorAndNewHashes(self.db.tip, block, function(err, commonAncestor, newHashes) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
self.rewindBothTips(commonAncestor, function(err) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
self.fastForwardBothTips(newHashes, callback);
|
|
});
|
|
});
|
|
});
|
|
};
|
|
|
|
Reorg.prototype.handleConcurrentReorg = function(callback) {
|
|
var self = this;
|
|
|
|
if(self.db.concurrentTip.hash === self.db.tip.hash) {
|
|
return callback();
|
|
}
|
|
|
|
self.findCommonAncestorAndNewHashes(self.db.concurrentTip, self.db.tip, function(err, commonAncestor, newHashes) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
self.rewindConcurrentTip(commonAncestor, function(err) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
self.fastForwardConcurrentTip(newHashes, callback);
|
|
});
|
|
});
|
|
};
|
|
|
|
Reorg.prototype.rewindConcurrentTip = function(commonAncestor, callback) {
|
|
var self = this;
|
|
|
|
async.whilst(
|
|
function() {
|
|
return self.db.concurrentTip.hash !== commonAncestor;
|
|
},
|
|
function(next) {
|
|
self.db.getConcurrentBlockOperations(self.db.concurrentTip, false, function(err, operations) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
operations.push(self.db.getConcurrentTipOperation(self.db.concurrentTip, false));
|
|
self.db.store.batch(operations, function(err) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
var prevHash = BufferUtil.reverse(self.db.concurrentTip.header.prevHash).toString('hex');
|
|
|
|
self.node.services.bitcoind.getBlock(prevHash, function(err, block) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
self.db.concurrentTip = block;
|
|
next();
|
|
});
|
|
});
|
|
});
|
|
|
|
|
|
},
|
|
callback
|
|
);
|
|
};
|
|
|
|
Reorg.prototype.fastForwardConcurrentTip = function(newHashes, callback) {
|
|
var self = this;
|
|
|
|
async.eachSeries(newHashes, function(hash, next) {
|
|
self.node.services.bitcoind.getBlock(hash, function(err, block) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
self.db.getConcurrentBlockOperations(block, true, function(err, operations) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
operations.push(self.db.getConcurrentTipOperation(block, true));
|
|
self.db.store.batch(operations, function(err) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
self.db.concurrentTip = block;
|
|
next();
|
|
});
|
|
});
|
|
});
|
|
}, callback);
|
|
};
|
|
|
|
Reorg.prototype.rewindBothTips = function(commonAncestor, callback) {
|
|
var self = this;
|
|
|
|
async.whilst(
|
|
function() {
|
|
return self.db.tip.hash !== commonAncestor;
|
|
},
|
|
function(next) {
|
|
async.parallel(
|
|
[
|
|
function(next) {
|
|
self.db.getConcurrentBlockOperations(self.db.concurrentTip, false, function(err, operations) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
operations.push(self.db.getConcurrentTipOperation(self.db.concurrentTip, false));
|
|
next(null, operations);
|
|
});
|
|
},
|
|
function(next) {
|
|
self.db.getSerialBlockOperations(self.db.tip, false, function(err, operations) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
operations.push(self.db.getTipOperation(self.db.concurrentTip, false));
|
|
next(null, operations);
|
|
});
|
|
}
|
|
],
|
|
function(err, results) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
var operations = results[0].concat(results[1]);
|
|
self.db.store.batch(operations, function(err) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
var prevHash = BufferUtil.reverse(self.db.tip.header.prevHash).toString('hex');
|
|
|
|
self.node.services.bitcoind.getBlock(prevHash, function(err, block) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
self.db.concurrentTip = block;
|
|
self.db.tip = block;
|
|
next();
|
|
});
|
|
});
|
|
}
|
|
);
|
|
},
|
|
callback
|
|
);
|
|
};
|
|
|
|
Reorg.prototype.fastForwardBothTips = function(newHashes, callback) {
|
|
var self = this;
|
|
|
|
async.eachSeries(newHashes, function(hash, next) {
|
|
self.node.services.bitcoind.getBlock(hash, function(err, block) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
async.parallel(
|
|
[
|
|
function(next) {
|
|
self.db.getConcurrentBlockOperations(block, true, function(err, operations) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
operations.push(self.db.getConcurrentTipOperation(block, true));
|
|
next(null, operations);
|
|
});
|
|
},
|
|
function(next) {
|
|
self.db.getSerialBlockOperations(block, true, function(err, operations) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
operations.push(self.db.getTipOperation(block, true));
|
|
next(null, operations);
|
|
});
|
|
}
|
|
],
|
|
function(err, results) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
var operations = results[0].concat(results[1]);
|
|
|
|
self.db.store.batch(operations, function(err) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
self.db.concurrentTip = block;
|
|
self.db.tip = block;
|
|
next();
|
|
});
|
|
}
|
|
);
|
|
});
|
|
}, callback);
|
|
};
|
|
|
|
Reorg.prototype.findCommonAncestorAndNewHashes = function(oldTip, newTip, callback) {
|
|
var self = this;
|
|
|
|
var mainPosition = oldTip.hash;
|
|
var forkPosition = newTip.hash;
|
|
|
|
var mainHashesMap = {};
|
|
var forkHashesMap = {};
|
|
|
|
mainHashesMap[mainPosition] = true;
|
|
forkHashesMap[forkPosition] = true;
|
|
|
|
var commonAncestor = null;
|
|
var newHashes = [forkPosition];
|
|
|
|
async.whilst(
|
|
function() {
|
|
return !commonAncestor;
|
|
},
|
|
function(next) {
|
|
async.parallel(
|
|
[
|
|
function(next) {
|
|
if(!mainPosition) {
|
|
return next();
|
|
}
|
|
|
|
self.node.services.bitcoind.getBlockHeader(mainPosition, function(err, mainBlockHeader) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
if(mainBlockHeader && mainBlockHeader.prevHash) {
|
|
mainHashesMap[mainBlockHeader.prevHash] = true;
|
|
mainPosition = mainBlockHeader.prevHash;
|
|
} else {
|
|
mainPosition = null;
|
|
}
|
|
|
|
next();
|
|
});
|
|
},
|
|
function(next) {
|
|
if(!forkPosition) {
|
|
return next();
|
|
}
|
|
|
|
self.node.services.bitcoind.getBlockHeader(forkPosition, function(err, forkBlockHeader) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
if(forkBlockHeader && forkBlockHeader.prevHash) {
|
|
forkHashesMap[forkBlockHeader.prevHash] = true;
|
|
forkPosition = forkBlockHeader.prevHash;
|
|
newHashes.unshift(forkPosition);
|
|
} else {
|
|
forkPosition = null;
|
|
}
|
|
|
|
next();
|
|
});
|
|
}
|
|
],
|
|
function(err) {
|
|
if(err) {
|
|
return next(err);
|
|
}
|
|
|
|
if(forkPosition && mainHashesMap[forkPosition]) {
|
|
commonAncestor = forkPosition;
|
|
}
|
|
|
|
if(mainPosition && forkHashesMap[mainPosition]) {
|
|
commonAncestor = mainPosition;
|
|
}
|
|
|
|
if(!mainPosition && !forkPosition) {
|
|
return next(new Error('Unknown common ancestor'));
|
|
}
|
|
|
|
next();
|
|
}
|
|
)
|
|
},
|
|
function(err) {
|
|
if(err) {
|
|
return callback(err);
|
|
}
|
|
|
|
// New hashes are those that are > common ancestor
|
|
var commonAncestorFound = false;
|
|
for(var i = newHashes.length - 1; i >= 0; i--) {
|
|
if(newHashes[i] === commonAncestor) {
|
|
commonAncestorFound = true;
|
|
}
|
|
|
|
if(commonAncestorFound) {
|
|
newHashes.shift();
|
|
}
|
|
}
|
|
|
|
callback(null, commonAncestor, newHashes);
|
|
}
|
|
);
|
|
};
|
|
|
|
module.exports = Reorg; |