Skip to content
Find file Normal view History Permalink
BarnesHutTreeThreaded.hpp 1.21 KiB
Newer Older
Paul Heinzlreiter's avatar
* added pthread code
Paul Heinzlreiter committed
1 2 3 4 5 6 7 8 9 10 11 
#ifndef BARNES_HUT_TREE_THREADED_HPP
#define BARNES_HUT_TREE_THREADED_HPP

#include <vector>
#include "BarnesHutTree.hpp"

namespace nbody {
	using namespace std;

	class BarnesHutTreeThreaded;
Paul Heinzlreiter's avatar
* some c++ improvements  
Paul Heinzlreiter committed
12 
	typedef struct NodesToProcessStruct {
Paul Heinzlreiter's avatar
* added pthread code
Paul Heinzlreiter committed
13 14 15 16 17 18 
		pthread_mutex_t mutex;
		vector<Node*> toProcess;
		vector<pthread_t> processing;
		BarnesHutTreeThreaded* tree;
		pthread_barrier_t* barrier;
		int iterations;
Paul Heinzlreiter's avatar
* fixed threading  
Paul Heinzlreiter committed
19 
		vector<Body>* bodies;
Paul Heinzlreiter's avatar
* fixed output of current thread  
Paul Heinzlreiter committed
20 
		vector<pthread_t>* threads;
Paul Heinzlreiter's avatar
* added pthread code
Paul Heinzlreiter committed
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 
	} NodesToProcess;

	class BarnesHutTreeThreaded : public BarnesHutTree {
		friend class PthreadSimulation;
	protected:
		NodesToProcess nodesToProcess;

		static void splitSubtree(Node* root);
		static void* build(void* data);
		static void* computeMove(void* data);
		static void updateNode(Node* current);
		static void addNodeToProcess(Node* node, NodesToProcess* store);
		static Node* getNodeToProcess(NodesToProcess* store);
		static void checkNodeProcessingFinished(NodesToProcess* store);
		static bool hasNodeProcessingFinished(NodesToProcess* store);
		virtual void clearNodesToProcess();
	public:
		BarnesHutTreeThreaded(int parallelId);
		virtual ~BarnesHutTreeThreaded();
		virtual void build(vector<Body> bodies, Box domain);
		virtual void computeMove();
	};
}

#endif