Function PrintBlockTree

src/main.cpp:2431–2487

}

void PrintBlockTree() {
    AssertLockHeld(cs_main);
    // pre-compute tree structure
    map<CBlockIndex *, vector<CBlockIndex *> > mapNext;
    for (map<uint256, CBlockIndex *>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi) {
        CBlockIndex *pIndex = (*mi).second;
        mapNext[pIndex->pprev].push_back(pIndex);
    }

    vector<pair<int32_t, CBlockIndex *> > vStack;
    vStack.push_back(make_pair(0, chainActive.Genesis()));

    int32_t nPrevCol = 0;
    while (!vStack.empty()) {
        int32_t nCol            = vStack.back().first;
        CBlockIndex *pIndex = vStack.back().second;
        vStack.pop_back();

        // print split or gap
        if (nCol > nPrevCol) {
            for (int32_t i = 0; i < nCol - 1; i++)
                LogPrint(BCLog::INFO, "| ");
            LogPrint(BCLog::INFO, "|\\\n");
        } else if (nCol < nPrevCol) {
            for (int32_t i = 0; i < nCol; i++)
                LogPrint(BCLog::INFO, "| ");
            LogPrint(BCLog::INFO, "|\n");
        }
        nPrevCol = nCol;

        // print columns
        for (int32_t i = 0; i < nCol; i++)
            LogPrint(BCLog::INFO, "| ");

        // print item
        CBlock block;
        ReadBlockFromDisk(pIndex, block);
        LogPrint(BCLog::INFO, "%d (blk%05u.dat:0x%x)  %s  tx %u\n",
                 pIndex->height,
                 pIndex->GetBlockPos().nFile, pIndex->GetBlockPos().nPos,
                 DateTimeStrFormat("%Y-%m-%d %H:%M:%S", block.GetBlockTime()),
                 block.vptx.size());

        // put the main time-chain first
        vector<CBlockIndex *> &vNext = mapNext[pIndex];
        for (uint32_t i = 0; i < vNext.size(); i++) {
            if (chainActive.Next(vNext[i])) {
                swap(vNext[0], vNext[i]);
                break;
            }
        }

        // iterate children
        for (uint32_t i = 0; i < vNext.size(); i++)
            vStack.push_back(make_pair(nCol + i, vNext[i]));
    }
}