mirror of
https://github.com/yse/easy_profiler.git
synced 2024-12-26 16:11:02 +08:00
277 lines
6.8 KiB
C++
277 lines
6.8 KiB
C++
//#define FULL_DISABLE_PROFILER
|
|
#include <chrono>
|
|
#include <thread>
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <condition_variable>
|
|
#include <cstdlib>
|
|
#include <math.h>
|
|
|
|
#include <easy/profiler.h>
|
|
#include <easy/reader.h>
|
|
|
|
std::condition_variable cv;
|
|
std::mutex cv_m;
|
|
int g_i = 0;
|
|
|
|
int OBJECTS = 500;
|
|
int MODELLING_STEPS = 1500;
|
|
int RENDER_STEPS = 1500;
|
|
int RESOURCE_LOADING_COUNT = 50;
|
|
|
|
#define SAMPLE_NETWORK_TEST
|
|
|
|
void localSleep(int magic=200000)
|
|
{
|
|
//PROFILER_BEGIN_FUNCTION_BLOCK_GROUPED(profiler::colors::Blue);
|
|
volatile int i = 0;
|
|
for (; i < magic; ++i);
|
|
}
|
|
|
|
void loadingResources(){
|
|
EASY_FUNCTION(profiler::colors::DarkCyan);
|
|
localSleep();
|
|
// std::this_thread::sleep_for(std::chrono::milliseconds(50));
|
|
}
|
|
|
|
void prepareMath(){
|
|
EASY_FUNCTION(profiler::colors::Green);
|
|
int* intarray = new int[OBJECTS];
|
|
for (int i = 0; i < OBJECTS; ++i)
|
|
intarray[i] = i * i;
|
|
delete[] intarray;
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(3));
|
|
}
|
|
|
|
void calcIntersect(){
|
|
EASY_FUNCTION(profiler::colors::Gold);
|
|
//int* intarray = new int[OBJECTS * OBJECTS];
|
|
int* intarray = new int[OBJECTS];
|
|
for (int i = 0; i < OBJECTS; ++i)
|
|
{
|
|
for (int j = i; j < OBJECTS; ++j)
|
|
//intarray[i * OBJECTS + j] = i * j - i / 2 + (OBJECTS - j) * 5;
|
|
intarray[j] = i * j - i / 2 + (OBJECTS - j) * 5;
|
|
}
|
|
delete[] intarray;
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(4));
|
|
}
|
|
|
|
double multModel(double i)
|
|
{
|
|
EASY_FUNCTION(profiler::colors::PaleGold);
|
|
return i * sin(i) * cos(i);
|
|
}
|
|
|
|
void calcPhys(){
|
|
EASY_FUNCTION(profiler::colors::Amber);
|
|
double* intarray = new double[OBJECTS];
|
|
for (int i = 0; i < OBJECTS; ++i)
|
|
intarray[i] = multModel(double(i)) + double(i / 3) - double((OBJECTS - i) / 2);
|
|
calcIntersect();
|
|
delete[] intarray;
|
|
}
|
|
|
|
double calcSubbrain(int i)
|
|
{
|
|
EASY_FUNCTION(profiler::colors::Navy);
|
|
return i * i * i - i / 10 + (OBJECTS - i) * 7 ;
|
|
}
|
|
|
|
void calcBrain(){
|
|
EASY_FUNCTION(profiler::colors::LightBlue);
|
|
double* intarray = new double[OBJECTS];
|
|
for (int i = 0; i < OBJECTS; ++i)
|
|
intarray[i] = calcSubbrain(i) + double(i * 180 / 3);
|
|
delete[] intarray;
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(3));
|
|
}
|
|
|
|
void calculateBehavior(){
|
|
EASY_FUNCTION(profiler::colors::Blue);
|
|
calcPhys();
|
|
calcBrain();
|
|
}
|
|
|
|
void modellingStep(){
|
|
EASY_FUNCTION();
|
|
prepareMath();
|
|
calculateBehavior();
|
|
}
|
|
|
|
void prepareRender(){
|
|
EASY_FUNCTION(profiler::colors::Brick);
|
|
localSleep();
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(8));
|
|
|
|
}
|
|
|
|
int multPhys(int i)
|
|
{
|
|
EASY_FUNCTION(profiler::colors::Red700, profiler::ON);
|
|
return i * i * i * i / 100;
|
|
}
|
|
|
|
int calcPhysicForObject(int i)
|
|
{
|
|
EASY_FUNCTION(profiler::colors::Red);
|
|
return multPhys(i) + i / 3 - (OBJECTS - i) * 15;
|
|
}
|
|
|
|
void calculatePhysics(){
|
|
EASY_FUNCTION(profiler::colors::Red);
|
|
unsigned int* intarray = new unsigned int[OBJECTS];
|
|
for (int i = 0; i < OBJECTS; ++i)
|
|
intarray[i] = calcPhysicForObject(i);
|
|
delete[] intarray;
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(8));
|
|
}
|
|
|
|
void frame(){
|
|
EASY_FUNCTION(profiler::colors::Magenta);
|
|
prepareRender();
|
|
calculatePhysics();
|
|
}
|
|
|
|
void loadingResourcesThread(){
|
|
//std::unique_lock<std::mutex> lk(cv_m);
|
|
//cv.wait(lk, []{return g_i == 1; });
|
|
EASY_THREAD("Resource loading");
|
|
#ifdef SAMPLE_NETWORK_TEST
|
|
while (true) {
|
|
#else
|
|
for(int i = 0; i < RESOURCE_LOADING_COUNT; i++){
|
|
#endif
|
|
loadingResources();
|
|
EASY_EVENT("Resources Loading!", profiler::colors::Cyan);
|
|
localSleep(1200000);
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(20));
|
|
}
|
|
}
|
|
|
|
#ifdef EASY_CHRONO_CLOCK
|
|
const int64_t cpu_freq = EASY_CHRONO_CLOCK::period::den / EASY_CHRONO_CLOCK::period::num;
|
|
#endif
|
|
|
|
void modellingThread(){
|
|
//std::unique_lock<std::mutex> lk(cv_m);
|
|
//cv.wait(lk, []{return g_i == 1; });
|
|
EASY_THREAD("Modelling");
|
|
|
|
static const int N = OBJECTS;
|
|
|
|
volatile double *pos[N];
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
pos[i] = new volatile double[3];
|
|
}
|
|
|
|
#ifdef SAMPLE_NETWORK_TEST
|
|
//while (true)
|
|
{
|
|
#else
|
|
for (int i = 0; i < MODELLING_STEPS; i++){
|
|
#endif
|
|
//EASY_END_BLOCK;
|
|
//EASY_NONSCOPED_BLOCK("Frame");
|
|
//modellingStep();
|
|
|
|
//localSleep(1200000);
|
|
std::this_thread::sleep_for(std::chrono::milliseconds(16));
|
|
|
|
EASY_BLOCK("Collisions");
|
|
#ifdef EASY_CHRONO_CLOCK
|
|
const auto t1 = EASY_CHRONO_CLOCK::now().time_since_epoch().count();
|
|
#endif
|
|
volatile int i, j;
|
|
volatile double dist;
|
|
for (i = 0; i < N; ++i)
|
|
{
|
|
for (j = i + 1; j < N; ++j)
|
|
{
|
|
EASY_BLOCK("Check");
|
|
volatile double v[3];
|
|
v[0] = pos[i][0] - pos[j][0];
|
|
v[1] = pos[i][1] - pos[j][1];
|
|
v[2] = pos[i][2] - pos[j][2];
|
|
dist = v[0] * v[0] + v[1] * v[1] + v[2] * v[2];
|
|
if (dist < 10000)
|
|
{
|
|
dist *= dist;
|
|
}
|
|
}
|
|
}
|
|
#ifdef EASY_CHRONO_CLOCK
|
|
const auto t2 = EASY_CHRONO_CLOCK::now().time_since_epoch().count();
|
|
EASY_END_BLOCK;
|
|
|
|
const auto t = (t2 - t1) * 1000000LL / cpu_freq;
|
|
printf("passed %lldus == %0.4lfms\n", t, ((double)t) * 1e-3);
|
|
#endif
|
|
}
|
|
//EASY_END_BLOCK;
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
delete [] pos[i];
|
|
}
|
|
}
|
|
|
|
void renderThread(){
|
|
//std::unique_lock<std::mutex> lk(cv_m);
|
|
//cv.wait(lk, []{return g_i == 1; });
|
|
EASY_THREAD("Render");
|
|
#ifdef SAMPLE_NETWORK_TEST
|
|
while (true) {
|
|
#else
|
|
for (int i = 0; i < RENDER_STEPS; i++){
|
|
#endif
|
|
frame();
|
|
localSleep(1200000);
|
|
//std::this_thread::sleep_for(std::chrono::milliseconds(20));
|
|
}
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
|
|
int main(int argc, char* argv[])
|
|
{
|
|
if (argc > 1 && argv[1]){
|
|
OBJECTS = std::atoi(argv[1]);
|
|
}
|
|
if (argc > 2 && argv[2]){
|
|
MODELLING_STEPS = std::atoi(argv[2]);
|
|
}
|
|
if (argc > 3 && argv[3]){
|
|
RENDER_STEPS = std::atoi(argv[3]);
|
|
}
|
|
if (argc > 4 && argv[4]){
|
|
RESOURCE_LOADING_COUNT = std::atoi(argv[4]);
|
|
}
|
|
|
|
std::cout << "Objects count: " << OBJECTS << std::endl;
|
|
|
|
auto start = std::chrono::system_clock::now();
|
|
|
|
#ifndef SAMPLE_NETWORK_TEST
|
|
EASY_PROFILER_ENABLE;
|
|
#endif
|
|
EASY_PROFILER_ENABLE;
|
|
EASY_MAIN_THREAD;
|
|
|
|
|
|
modellingThread();
|
|
|
|
auto end = std::chrono::system_clock::now();
|
|
auto elapsed =
|
|
std::chrono::duration_cast<std::chrono::microseconds>(end - start);
|
|
|
|
std::cout << "Elapsed time: " << elapsed.count() << " usec" << std::endl;
|
|
|
|
auto blocks_count = profiler::dumpBlocksToFile("test.prof");
|
|
|
|
std::cout << "Blocks count: " << blocks_count << std::endl;
|
|
|
|
return 0;
|
|
}
|