easy_profiler/reader/main.cpp

#include "profiler/profiler.h"
#include "profiler/reader.h"
#include <fstream>
#include <list>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <iterator>
#include <algorithm> 
#include <ctime>
#include <chrono>
#include <iostream>
#include <string>


class TreePrinter
{
	struct Info{
		std::string name;
		std::string info;
	};
	std::vector<Info> m_rows;

public:
	TreePrinter(){

	}
	void addNewRow(int level)
	{

	}

	void printTree()
	{
		for (auto& row : m_rows){
			std::cout << row.name << " " << row.info << std::endl;
		}
	}
};


void printTree(TreePrinter& printer, const BlocksTree& tree, int level = 0, int parent_dur = 0, profiler::timestamp_t root_dur = 0)
{
	
	if (tree.node){
		auto duration = tree.node->block()->duration();
		float duration_ms = duration / 1e6f;
		float percent = parent_dur ? float(duration) / float(parent_dur)*100.0f : 100.0f;
		float rpercent = root_dur ? float(duration) / float(root_dur)*100.0f : 100.0f;
		std::cout << std::string(level, '\t') << tree.node->getBlockName() 
			<< std::string(5 - level, '\t') 
			/*<< std::string(level, ' ')*/ << percent << "%| " 
			<< rpercent << "%| "
			<< duration_ms << " ms"
			<< std::endl;
		if (root_dur == 0){
			root_dur = tree.node->block()->duration();
		}
	}
	else{
		root_dur = 0;
	}
	

	for (const auto& i : tree.children){

		printTree(printer, i, level + 1, tree.node ? tree.node->block()->duration() : 0, root_dur);
	}
}

int main()
{
	thread_blocks_tree_t threaded_trees;

	auto start = std::chrono::system_clock::now();

	int blocks_counter = fillTreesFromFile("test.prof", threaded_trees);

	auto end = std::chrono::system_clock::now();

	std::cout << "Blocks count: " << blocks_counter << std::endl;
	std::cout << "dT =  " << std::chrono::duration_cast<std::chrono::microseconds>(end - start).count() << " usec" << std::endl;
	for (const auto & i : threaded_trees){
		TreePrinter p;
		std::cout << std::string(20, '=') << " thread "<< i.first << " "<< std::string(20, '=') << std::endl;
		printTree(p, i.second,-1);
	}
	return 0;
}