Method findMissingBlocks

src/blockheaderprocessor.cpp:90–127

}

std::vector<CBlockIndex*> DefaultHeaderProcessor::findMissingBlocks(CBlockIndex* last) {
    assert(last);

    std::deque<CBlockIndex*> toFetch;
    CBlockIndex* walk = last;

    const int WALK_LIMIT = 144; // one day
    int walked = 0;

    // Calculate all the blocks we'd need to switch to last, up to a limit.
    do {

        if (++walked > WALK_LIMIT) {
            // We're far behind. No gain in direct fetch.
            return std::vector<CBlockIndex*>();
        }

        if (chainActive.Contains(walk))
            break;

        if (walk->nStatus & BLOCK_HAVE_DATA)
            continue;

        if (blocksInFlight.isInFlight(walk->GetBlockHash()))
            continue;

        // We don't have this block, and it's not yet in flight.
        toFetch.push_back(walk);

        // Avoid out of order fetching, trim off the newest block. Out of order
        // fetching is conceptually fine, but confuses rpc tests that use comptool.
        if (toFetch.size() > MAX_BLOCKS_IN_TRANSIT_PER_PEER)
            toFetch.pop_front();

    } while ((walk = walk->pprev));

    return std::vector<CBlockIndex*>(begin(toFetch), end(toFetch));
}

bool DefaultHeaderProcessor::hasEqualOrMoreWork(CBlockIndex* last) {
    return last->IsValid(BLOCK_VALID_TREE)