CartDecomposition.hpp 45 KB
Newer Older
incardon's avatar
incardon committed
1
2
3
4
5
6
7
8
9
10
11
12
/*
 * CartDecomposition.hpp
 *
 *  Created on: Aug 15, 2014
 *      Author: Pietro Incardona
 */

#ifndef CARTDECOMPOSITION_HPP
#define CARTDECOMPOSITION_HPP

#include "config.h"
#include "Decomposition.hpp"
incardon's avatar
incardon committed
13
#include "Vector/map_vector.hpp"
incardon's avatar
incardon committed
14
15
16
17
18
19
20
#include <vector>
#include "global_const.hpp"
#include <initializer_list>
#include "SubdomainGraphNodes.hpp"
#include "metis_util.hpp"
#include "dec_optimizer.hpp"
#include "Space/Shape/Box.hpp"
incardon's avatar
incardon committed
21
#include "Space/Shape/Point.hpp"
incardon's avatar
incardon committed
22
#include "NN/CellList/CellDecomposer.hpp"
incardon's avatar
incardon committed
23
24
#include <unordered_map>
#include "NN/CellList/CellList.hpp"
incardon's avatar
incardon committed
25
#include "Space/Ghost.hpp"
incardon's avatar
incardon committed
26
27
#include "common.hpp"
#include "ie_loc_ghost.hpp"
incardon's avatar
incardon committed
28
29
30
31
32
33
34
35
36
37

/**
 * \brief This class decompose a space into subspaces
 *
 * \tparam dim is the dimensionality of the physical domain we are going to decompose.
 * \tparam T type of the space we decompose, Real, Integer, Complex ...
 * \tparam layout to use
 * \tparam Memory Memory factory used to allocate memory
 * \tparam Domain Structure that contain the information of your physical domain
 *
38
39
 * Given an N-dimensional space, this class decompose the space into a Cartesian grid of small
 * sub-sub-domain. At each sub-sub-domain is assigned  an id that identify which processor is
incardon's avatar
incardon committed
40
 * going to take care of that part of space (in general the space assigned to a processor is
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
 * simply connected), a second step merge several sub-sub-domain with same id into bigger region
 *  sub-domain with the id. Each sub-domain has an extended space called ghost part
 *
 * Assuming that VCluster.getProcessUnitID(), equivalent to the MPI processor rank, return the processor local
 * processor id, we define
 *
 * * local sub-domain: all the sub-domain with id == local processor
 * * external ghost box: (or ghost box) are the boxes that compose the ghost space of the processor, or the
 *   boxes produced expanding every local sub-domain by the ghost extension and intersecting with the sub-domain
 *   of the other processors
 * * Near processors are the processors adjacent to the local processor, where with adjacent we mean all the processor
 *   that has a non-zero intersection with the ghost part of the local processor, or all the processors that
 *   produce non-zero external boxes with the local processor, or all the processor that should communicate
 *   in case of ghost data synchronization
 * * internal ghost box: is the part of ghost of the near processor that intersect the space of the
 *       processor, or the boxes produced expanding the sub-domain of the near processors with the local sub-domain
 * * Near processor sub-domain: is a sub-domain that live in the a near (or contiguous) processor
 * * Near processor list: the list of all the near processor of the local processor (each processor has a list
 *                        of the near processor)
incardon's avatar
incardon committed
60
 * * Local ghosts interal or external are all the ghosts that does not involve inter-processor communications
61
62
 *
 * \see calculateGhostBoxes() for a visualization of internal and external ghost boxes
incardon's avatar
incardon committed
63
 *
incardon's avatar
incardon committed
64
65
 */

incardon's avatar
incardon committed
66
template<unsigned int dim, typename T, template<typename> class device_l=openfpm::device_cpu, typename Memory=HeapMemory, template<unsigned int, typename> class Domain=Box>
incardon's avatar
incardon committed
67
class CartDecomposition : public ie_loc_ghost<dim,T>
incardon's avatar
incardon committed
68
{
incardon's avatar
incardon committed
69
70
	struct N_box
	{
71
		// id of the processor in the nn_processor list (local processor id)
incardon's avatar
incardon committed
72
73
74
75
76
77
		size_t id;

		// Near processor sub-domains
		typename openfpm::vector<::Box<dim,T>> bx;
	};

incardon's avatar
incardon committed
78
79
80
	struct Box_proc
	{
		// Intersection between the local sub-domain enlarged by the ghost and the contiguous processor
incardon's avatar
incardon committed
81
		// sub-domains (External ghost)
incardon's avatar
incardon committed
82
83
84
		openfpm::vector<::Box<dim,T>> bx;

		// Intersection between the contiguous processor sub-domain enlarged by the ghost with the
incardon's avatar
incardon committed
85
		// local sub-domain (Internal ghost)
incardon's avatar
incardon committed
86
87
88
89
90
91
92
		openfpm::vector<::Box<dim,T>> nbx;


		// processor
		size_t proc;
	};

93
94
95
96
	struct Box_dom
	{
		// Intersection between the local sub-domain enlarged by the ghost and the contiguous processor
		// sub-domains (External ghost)
incardon's avatar
incardon committed
97
		openfpm::vector_std< Box_sub<dim,T> > ebx;
98
99
100

		// Intersection between the contiguous processor sub-domain enlarged by the ghost with the
		// local sub-domain (Internal ghost)
incardon's avatar
incardon committed
101
		openfpm::vector_std< Box_sub<dim,T> > ibx;
102
103
	};

incardon's avatar
incardon committed
104
105


incardon's avatar
incardon committed
106
public:
incardon's avatar
incardon committed
107

incardon's avatar
incardon committed
108
109
110
111
112
113
114
115
	//! Type of the domain we are going to decompose
	typedef T domain_type;

	//! It simplify to access the SpaceBox element
	typedef SpaceBox<dim,T> Box;

private:

incardon's avatar
incardon committed
116
	//! This is the key type to access  data_s, for example in the case of vector
incardon's avatar
incardon committed
117
	//! acc_key is size_t
incardon's avatar
incardon committed
118
	typedef typename openfpm::vector<SpaceBox<dim,T>,device_l<SpaceBox<dim,T>>,Memory,openfpm::vector_grow_policy_default,openfpm::vect_isel<SpaceBox<dim,T>>::value >::access_key acc_key;
incardon's avatar
incardon committed
119
120

	//! the set of all local sub-domain as vector
incardon's avatar
incardon committed
121
	openfpm::vector<SpaceBox<dim,T>> sub_domains;
incardon's avatar
incardon committed
122

incardon's avatar
incardon committed
123
124
125
	//! List of near processors
	openfpm::vector<size_t> nn_processors;

126
	//! for each sub-domain (first vector), contain the list (nested vector) of the neighborhood processors
incardon's avatar
incardon committed
127
	//! and for each processor contain the boxes calculated from the intersection
128
129
	//! of the sub-domains + ghost with the near-by processor sub-domain () and the other way around
	//! \see calculateGhostBoxes
incardon's avatar
incardon committed
130
131
	openfpm::vector< openfpm::vector< Box_proc > > box_nn_processor_int;

132
133
134
	//! It store the same information of box_nn_processor_int organized by processor id
	openfpm::vector< Box_dom > proc_int_box;

incardon's avatar
incardon committed
135
	//! for each sub-domain, contain the list of the neighborhood processors
incardon's avatar
incardon committed
136
137
138
	openfpm::vector<openfpm::vector<long unsigned int> > box_nn_processor;

	// for each near-processor store the sub-domain of the near processor
incardon's avatar
incardon committed
139
	std::unordered_map<size_t, N_box> nn_processor_subdomains;
incardon's avatar
incardon committed
140

141
142
143
	// for each processor store the set of the sub-domains sent to the adjacent processors
	openfpm::vector<openfpm::vector<size_t>> proc_adj_box;

incardon's avatar
incardon committed
144
	//! Structure that contain for each sub-sub-domain box the processor id
incardon's avatar
Add ORB    
incardon committed
145
	//! exist for efficient global communication
incardon's avatar
incardon committed
146
147
	openfpm::vector<size_t> fine_s;

incardon's avatar
incardon committed
148
149
	//! Structure that store the cartesian grid information
	grid_sm<dim,void> gr;
incardon's avatar
incardon committed
150

incardon's avatar
incardon committed
151
152
153
	//! Structure that decompose your structure into cell without creating them
	//! useful to convert positions to CellId or sub-domain id in this case
	CellDecomposer_sm<dim,T> cd;
incardon's avatar
incardon committed
154
155
156
157
158
159
160
161
162
163

	//! rectangular domain to decompose
	Domain<dim,T> domain;

	//! Box Spacing
	T spacing[dim];

	//! Runtime virtual cluster machine
	Vcluster & v_cl;

incardon's avatar
incardon committed
164
	//! Cell-list that store the geometrical information of the internal ghost boxes
incardon's avatar
incardon committed
165
166
	CellList<dim,T,FAST> geo_cell;

incardon's avatar
incardon committed
167
168
169
	//! Cell-list that store the geometrical information of the local internal ghost boxes
	CellList<dim,T,FAST> lgeo_cell;

incardon's avatar
incardon committed
170

incardon's avatar
incardon committed
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
	/*! \brief Create internally the decomposition
	 *
     * \param v_cl Virtual cluster, used internally to handle or pipeline communication
	 *
	 */
	void CreateDecomposition(Vcluster & v_cl)
	{
		// Calculate the total number of box and and the spacing
		// on each direction
		// Get the box containing the domain
		SpaceBox<dim,T> bs = domain.getBox();

		for (unsigned int i = 0; i < dim ; i++)
		{
			// Calculate the spacing
incardon's avatar
incardon committed
186
			spacing[i] = (bs.getHigh(i) - bs.getLow(i)) / gr.size(i);
incardon's avatar
incardon committed
187
188
189
190
		}

		// Here we use METIS
		// Create a cartesian grid graph
incardon's avatar
incardon committed
191
		CartesianGraphFactory<dim,Graph_CSR<nm_part_v,nm_part_e>> g_factory_part;
incardon's avatar
incardon committed
192
193

		// Processor graph
incardon's avatar
incardon committed
194
		Graph_CSR<nm_part_v,nm_part_e> gp = g_factory_part.template construct<NO_EDGE,T,dim-1>(gr.getSize(),domain);
incardon's avatar
incardon committed
195
196
197
198
199
200
201
202

		// Get the number of processing units
		size_t Np = v_cl.getProcessingUnits();

		// Get the processor id
		long int p_id = v_cl.getProcessUnitID();

		// Convert the graph to metis
incardon's avatar
incardon committed
203
		Metis<Graph_CSR<nm_part_v,nm_part_e>> met(gp,Np);
incardon's avatar
incardon committed
204
205

		// decompose
incardon's avatar
incardon committed
206
		met.decompose<nm_part_v::id>();
incardon's avatar
incardon committed
207

incardon's avatar
Add ORB    
incardon committed
208
		// fill the structure that store the processor id for each sub-domain
incardon's avatar
incardon committed
209
		fine_s.resize(gr.size());
incardon's avatar
Add ORB    
incardon committed
210

incardon's avatar
incardon committed
211
212
		// Optimize the decomposition creating bigger spaces
		// And reducing Ghost over-stress
incardon's avatar
incardon committed
213
		dec_optimizer<dim,Graph_CSR<nm_part_v,nm_part_e>> d_o(gp,gr.getSize());
incardon's avatar
incardon committed
214
215
216
217

		// set of Boxes produced by the decomposition optimizer
		openfpm::vector<::Box<dim,size_t>> loc_box;

incardon's avatar
incardon committed
218
		// optimize the decomposition
incardon's avatar
incardon committed
219
220
		d_o.template optimize<nm_part_v::sub_id,nm_part_v::id>(gp,p_id,loc_box,box_nn_processor);

incardon's avatar
incardon committed
221
222
		// produce the list of the contiguous processor (nn_processors) and link nn_processor_subdomains to the
		// processor list
incardon's avatar
incardon committed
223
224
225
226
227
228
229
230
231
232
233
234
		for (size_t i = 0 ;  i < box_nn_processor.size() ; i++)
		{
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				nn_processors.add(box_nn_processor.get(i).get(j));
			}
		}

		// make the list sorted and unique
	    std::sort(nn_processors.begin(), nn_processors.end());
	    auto last = std::unique(nn_processors.begin(), nn_processors.end());
	    nn_processors.erase(last, nn_processors.end());
incardon's avatar
incardon committed
235

incardon's avatar
incardon committed
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
		// produce the list of the contiguous processor (nn_processors) and link nn_processor_subdomains to the
		// processor list
		for (size_t i = 0 ;  i < box_nn_processor.size() ; i++)
		{
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				// processor id near to this sub-domain
				size_t proc_id = box_nn_processor.get(i).get(j);

				size_t k = 0;
				// search inside near processor list
				for (k = 0 ; k < nn_processors.size() ; k++)
					if (nn_processors.get(k) == proc_id)	break;

				nn_processor_subdomains[proc_id].id = k;
			}
		}

		// Initialize ss_box and bbox
		if (loc_box.size() >= 0)
		{
257
258
			SpaceBox<dim,size_t> sub_dc = loc_box.get(0);
			SpaceBox<dim,T> sub_d(sub_dc);
incardon's avatar
incardon committed
259
260
261
			sub_d.mul(spacing);
			sub_d.expand(spacing);

262
263
264
265
266
267
268
269
270
271
272
273
274
			// Fixing sub-domains to cover all the domain

			// Fixing sub_d
			// if (loc_box) is a the boundary we have to ensure that the box span the full
			// domain (avoiding rounding off error)
			for (size_t i = 0 ; i < dim ; i++)
			{
				if (sub_dc.getHigh(i) == cd.getGrid().size(i) - 1)
				{
					sub_d.setHigh(i,domain.getHigh(i));
				}
			}

incardon's avatar
incardon committed
275
276
277
278
			// add the sub-domain
			sub_domains.add(sub_d);

			ss_box = sub_d;
incardon's avatar
incardon committed
279
			ss_box -= ss_box.getP1();
incardon's avatar
incardon committed
280
281
282
			bbox = sub_d;
		}

incardon's avatar
incardon committed
283
		// convert into sub-domain
incardon's avatar
incardon committed
284
		for (size_t s = 1 ; s < loc_box.size() ; s++)
incardon's avatar
incardon committed
285
		{
286
287
			SpaceBox<dim,size_t> sub_dc = loc_box.get(s);
			SpaceBox<dim,T> sub_d(sub_dc);
incardon's avatar
incardon committed
288

incardon's avatar
incardon committed
289
290
291
			// re-scale and add spacing (the end is the starting point of the next domain + spacing)
			sub_d.mul(spacing);
			sub_d.expand(spacing);
incardon's avatar
incardon committed
292

293
294
295
296
297
298
299
300
301
302
303
304
305
			// Fixing sub-domains to cover all the domain

			// Fixing sub_d
			// if (loc_box) is a the boundary we have to ensure that the box span the full
			// domain (avoiding rounding off error)
			for (size_t i = 0 ; i < dim ; i++)
			{
				if (sub_dc.getHigh(i) == cd.getGrid().size(i) - 1)
				{
					sub_d.setHigh(i,domain.getHigh(i));
				}
			}

incardon's avatar
incardon committed
306
307
			// add the sub-domain
			sub_domains.add(sub_d);
incardon's avatar
incardon committed
308
309
310
311
312
313

			// Calculate the bound box
			bbox.enclose(sub_d);

			// Create the smallest box contained in all sub-domain
			ss_box.contained(sub_d);
incardon's avatar
incardon committed
314
		}
incardon's avatar
incardon committed
315
316

		// fill fine_s structure
incardon's avatar
incardon committed
317
318
319
		// fine_s structure contain the processor id for each sub-sub-domain
		// with sub-sub-domain we mean the sub-domain decomposition before
		// running dec_optimizer (before merging sub-domains)
incardon's avatar
incardon committed
320
321
322
323
324
325
326
327
328
329
330
		auto it = gp.getVertexIterator();

		while (it.isNext())
		{
			size_t key = it.get();

			// fill with the fine decomposition
			fine_s.get(key) = gp.template vertex_p<nm_part_v::id>(key);

			++it;
		}
331
332
333
334
335
336

		// Get the smallest sub-division on each direction
		::Box<dim,T> unit = getSmallestSubdivision();
		// Get the processor bounding Box
		::Box<dim,T> bound = getProcessorBounds();

incardon's avatar
incardon committed
337
		// calculate the sub-divisions
338
339
		size_t div[dim];
		for (size_t i = 0 ; i < dim ; i++)
incardon's avatar
incardon committed
340
			div[i] = (size_t)((bound.getHigh(i) - bound.getLow(i)) / unit.getHigh(i));
341
342
343
344
345
346
347
348
349
350

		// Create shift
		Point<dim,T> orig;

		// p1 point of the Processor bound box is the shift
		for (size_t i = 0 ; i < dim ; i++)
			orig.get(i) = bound.getLow(i);

		// Initialize the geo_cell structure
		geo_cell.Initialize(domain,div,orig);
incardon's avatar
incardon committed
351
		lgeo_cell.Initialize(domain,div,orig);
incardon's avatar
incardon committed
352
353
	}

incardon's avatar
incardon committed
354
355
356
	// Save the ghost boundaries
	Ghost<dim,T> ghost;

incardon's avatar
incardon committed
357

incardon's avatar
incardon committed
358
359
360
361
362
363
364
365
366
	/*! \brief Create the subspaces that decompose your domain
	 *
	 * Create the subspaces that decompose your domain
	 *
	 */

	void CreateSubspaces()
	{
		// Create a grid where each point is a space
367
		grid_sm<dim,void> g(div);
incardon's avatar
incardon committed
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395

		// create a grid_key_dx iterator
		grid_key_dx_iterator<dim> gk_it(g);

		// Divide the space into subspaces
		while (gk_it.isNext())
		{
			//! iterate through all subspaces
			grid_key_dx<dim> key = gk_it.get();

			//! Create a new subspace
			SpaceBox<dim,T> tmp;

			//! fill with the Margin of the box
			for (int i = 0 ; i < dim ; i++)
			{
				tmp.setHigh(i,(key.get(i)+1)*spacing[i]);
				tmp.setLow(i,key.get(i)*spacing[i]);
			}

			//! add the space box
			sub_domains.add(tmp);

			// add the iterator
			++gk_it;
		}
	}

396
397
398
399
400
401
402
403
404
405
406
407
408
409
	/*! \brief Create the box_nn_processor_int (bx part)  structure
	 *
	 * This structure store for each sub-domain of this processors enlarged by the ghost size the boxes that
	 *  come from the intersection with the near processors sub-domains (External ghost box)
	 *
	 * \param ghost margins
	 *
	 * \note Are the G8_0 G9_0 G9_1 G5_0 boxes in calculateGhostBoxes
	 * \see calculateGhostBoxes
	 *
	 */
	void create_box_nn_processor_ext(Ghost<dim,T> & ghost)
	{
		box_nn_processor_int.resize(sub_domains.size());
410
		proc_int_box.resize(getNNProcessors());
411
412
413
414
415
416
417
418
419

		// For each sub-domain
		for (size_t i = 0 ; i < sub_domains.size() ; i++)
		{
			SpaceBox<dim,T> sub_with_ghost = sub_domains.get(i);

			// enlarge the sub-domain with the ghost
			sub_with_ghost.enlarge(ghost);

incardon's avatar
incardon committed
420
			// resize based on the number of adjacent processors
421
422
			box_nn_processor_int.get(i).resize(box_nn_processor.get(i).size());

incardon's avatar
incardon committed
423
			// For each processor adjacent to this sub-domain
424
425
426
427
428
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				// Contiguous processor
				size_t p_id = box_nn_processor.get(i).get(j);

429
430
431
				// store the box in proc_int_box storing from which sub-domain they come from
				Box_dom & proc_int_box_g = proc_int_box.get(ProctoID(p_id));

incardon's avatar
incardon committed
432
				// get the set of sub-domains of the adjacent processor p_id
433
				openfpm::vector< ::Box<dim,T> > & nn_processor_subdomains_g = nn_processor_subdomains[p_id].bx;
434
435

				// near processor sub-domain intersections
436
				openfpm::vector< ::Box<dim,T> > & box_nn_processor_int_gg = box_nn_processor_int.get(i).get(j).bx;
437
438

				// for each near processor sub-domain intersect with the enlarged local sub-domain and store it
439
				for (size_t b = 0 ; b < nn_processor_subdomains_g.size() ; b++)
440
441
442
				{
					::Box<dim,T> bi;

443
					bool intersect = sub_with_ghost.Intersect(::Box<dim,T>(nn_processor_subdomains_g.get(b)),bi);
444
445
446
447
448
449
450
451
452

					if (intersect == true)
					{
						struct p_box pb;

						pb.box = bi;
						pb.proc = p_id;
						pb.lc_proc = ProctoID(p_id);

453
454
455
456
457
458
459
460
461
462
						//
						// Updating
						//
						// vb_ext
						// box_nn_processor_int
						// proc_int_box
						//
						// They all store the same information but organized in different ways
						// read the description of each for more information
						//
463
						vb_ext.add(pb);
464
465
						box_nn_processor_int_gg.add(bi);
						proc_int_box_g.ebx.add();
incardon's avatar
incardon committed
466
467
						proc_int_box_g.ebx.last() = bi;
						proc_int_box_g.ebx.last().sub = i;
468
469
470
471
472
473
474
475
476
477
478
479
480

						// Search for the correct id
						size_t k = 0;
						size_t p_idp = ProctoID(p_id);
						for (k = 0 ; k < proc_adj_box.get(p_idp).size() ; k++)
						{
							if (proc_adj_box.get(p_idp).get(k) == i)
								break;
						}
						if (k == proc_adj_box.get(p_idp).size())
							std::cerr << "Error: " << __FILE__ << ":" << __LINE__ << " sub-domain not found\n";

						proc_int_box_g.ebx.last().id = (k * nn_processor_subdomains_g.size() + b) * v_cl.getProcessingUnits() + p_id;
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
					}
				}
			}
		}
	}

	/*! \brief Create the box_nn_processor_int (nbx part) structure, the geo_cell list and proc_int_box
	 *
	 * This structure store for each sub-domain of this processors the boxes that come from the intersection
	 * of the near processors sub-domains enlarged by the ghost size (Internal ghost box). These boxes
	 * fill a geometrical cell list. The proc_int_box store the same information ordered by near processors
	 *
	 * \param ghost margins
	 *
	 * \note Are the B8_0 B9_0 B9_1 B5_0 boxes in calculateGhostBoxes
	 * \see calculateGhostBoxes
	 *
	 */
	void create_box_nn_processor_int(Ghost<dim,T> & ghost)
	{
		box_nn_processor_int.resize(sub_domains.size());
		proc_int_box.resize(getNNProcessors());

		// For each sub-domain
		for (size_t i = 0 ; i < sub_domains.size() ; i++)
		{
			// For each processor contiguous to this sub-domain
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				// Contiguous processor
				size_t p_id = box_nn_processor.get(i).get(j);

				// get the set of sub-domains of the contiguous processor p_id
				openfpm::vector< ::Box<dim,T> > & nn_p_box = nn_processor_subdomains[p_id].bx;

				// get the local processor id
				size_t lc_proc = nn_processor_subdomains[p_id].id;

				// For each near processor sub-domains enlarge and intersect with the local sub-domain and store the result
				for (size_t k = 0 ; k < nn_p_box.size() ; k++)
				{

					// enlarge the near-processor sub-domain
					::Box<dim,T> n_sub = nn_p_box.get(k);

					// local sub-domain
					::SpaceBox<dim,T> l_sub = sub_domains.get(i);

					// Create a margin of ghost size around the near processor sub-domain
					n_sub.enlarge(ghost);

					// Intersect with the local sub-domain
					p_box b_int;
					bool intersect = n_sub.Intersect(l_sub,b_int.box);

					// store if it intersect
					if (intersect == true)
					{
539
						// the box fill with the processor id
540
541
542
543
544
						b_int.proc = p_id;

						// fill the local processor id
						b_int.lc_proc = lc_proc;

545
546
547
548
549
550
551
552
553
554
555
556
						//
						// Updating
						//
						// vb_int
						// box_nn_processor_int
						// proc_int_box
						//
						// They all store the same information but organized in different ways
						// read the description of each for more information
						//

						// add the box to the near processor sub-domain intersections
557
558
559
560
						openfpm::vector< ::Box<dim,T> > & p_box_int = box_nn_processor_int.get(i).get(j).nbx;
						p_box_int.add(b_int.box);
						vb_int.add(b_int);

561
						// store the box in proc_int_box storing from which sub-domain they come from
562
						Box_dom & pr_box_int = proc_int_box.get(ProctoID(p_id));
incardon's avatar
incardon committed
563
						Box_sub<dim,T> sb;
incardon's avatar
incardon committed
564
						sb = b_int.box;
565
						sb.sub = i;
incardon's avatar
incardon committed
566

567
568
569
570
571
572
573
574
575
576
577
578
579
						// Search for the correct id
						size_t s = 0;
						size_t p_idp = ProctoID(p_id);
						for (s = 0 ; s < proc_adj_box.get(p_idp).size() ; s++)
						{
							if (proc_adj_box.get(p_idp).get(s) == i)
								break;
						}
						if (s == proc_adj_box.get(p_idp).size())
							std::cerr << "Error: " << __FILE__ << ":" << __LINE__ << " sub-domain not found\n";

						sb.id = (k * proc_adj_box.get(p_idp).size() + s) * v_cl.getProcessingUnits() + v_cl.getProcessUnitID();

580
						pr_box_int.ibx.add(sb);
581
582
583

						// update the geo_cell list

incardon's avatar
incardon committed
584
						// get the cells this box span
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
						const grid_key_dx<dim> p1 = geo_cell.getCellGrid(b_int.box.getP1());
						const grid_key_dx<dim> p2 = geo_cell.getCellGrid(b_int.box.getP2());

						// Get the grid and the sub-iterator
						auto & gi = geo_cell.getGrid();
						grid_key_dx_iterator_sub<dim> g_sub(gi,p1,p2);

						// add the box-id to the cell list
						while (g_sub.isNext())
						{
							auto key = g_sub.get();
							geo_cell.addCell(gi.LinId(key),vb_int.size()-1);
							++g_sub;
						}
					}
				}
			}
		}
	}

incardon's avatar
incardon committed
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
	// Heap memory receiver
	HeapMemory hp_recv;

	// vector v_proc
	openfpm::vector<size_t> v_proc;

	// Receive counter
	size_t recv_cnt;

	/*! \brief Message allocation
	 *
	 * \param message size required to receive from i
	 * \param total message size to receive from all the processors
	 * \param the total number of processor want to communicate with you
	 * \param i processor id
incardon's avatar
incardon committed
620
621
	 * \param ri request id (it is an id that goes from 0 to total_p, and is unique
	 *           every time message_alloc is called)
incardon's avatar
incardon committed
622
623
624
625
626
	 * \param ptr a pointer to the vector_dist structure
	 *
	 * \return the pointer where to store the message
	 *
	 */
incardon's avatar
incardon committed
627
	static void * message_alloc(size_t msg_i ,size_t total_msg, size_t total_p, size_t i, size_t ri, void * ptr)
incardon's avatar
incardon committed
628
629
	{
		// cast the pointer
incardon's avatar
incardon committed
630
		CartDecomposition<dim,T,device_l,Memory,Domain> * cd = static_cast< CartDecomposition<dim,T,device_l,Memory,Domain> *>(ptr);
incardon's avatar
incardon committed
631
632

		// Resize the memory
633
		cd->nn_processor_subdomains[i].bx.resize(msg_i / sizeof(::Box<dim,T>) );
incardon's avatar
incardon committed
634
635

		// Return the receive pointer
incardon's avatar
incardon committed
636
		return cd->nn_processor_subdomains[i].bx.getPointer();
incardon's avatar
incardon committed
637
638
	}

incardon's avatar
incardon committed
639
640
641
642
643
644
645
public:

	/*! \brief Cartesian decomposition copy constructor
	 *
     * \param v_cl Virtual cluster, used internally to handle or pipeline communication
	 *
	 */
incardon's avatar
incardon committed
646
	CartDecomposition(CartDecomposition<dim,T,device_l,Memory,Domain> && cd)
incardon's avatar
incardon committed
647
	:gr(cd.gr),cd(cd.cd),domain(cd.domain),v_cl(cd.v_cl)
incardon's avatar
incardon committed
648
	{
incardon's avatar
incardon committed
649
650
651
		// Reset the box to zero
		bbox.zero();

incardon's avatar
incardon committed
652
653
654
		//! the set of all local sub-domain as vector
		sub_domains.swap(cd.sub_domains);

655
		for (size_t i = 0 ; i < dim ; i++)
incardon's avatar
incardon committed
656
657
658
659
660
661
662
663
664
665
666
667
		{
			//! Box Spacing
			this->spacing[i] = spacing[i];
		}
	}

	/*! \brief Cartesian decomposition constructor
	 *
     * \param v_cl Virtual cluster, used internally to handle or pipeline communication
	 *
	 */
	CartDecomposition(Vcluster & v_cl)
incardon's avatar
incardon committed
668
	:v_cl(v_cl)
incardon's avatar
incardon committed
669
670
671
672
	{
		// Reset the box to zero
		bbox.zero();
	}
incardon's avatar
incardon committed
673
674
675
676
677

	//! Cartesian decomposition destructor
	~CartDecomposition()
	{}

678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
	// It store all the boxes of the near processors in a linear array
	struct p_box
	{
		//! Box that identify the intersection of the ghost of the near processor with the
		//! processor sub-domain
		::Box<dim,T> box;
		//! local processor id
		size_t lc_proc;
		//! processor id
		size_t proc;

		/*! \brief Check if two p_box are the same
		 *
		 * \param pb box to check
		 *
		 */
		bool operator==(const p_box & pb)
		{
			return pb.lc_proc == lc_proc;
		}
	};

incardon's avatar
incardon committed
700
701
	openfpm::vector<size_t> ids;

702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
	/*! \brief class to select the returned id by ghost_processorID
	 *
	 */
	class box_id
	{
	public:
		/*! \brief Return the box id
		 *
		 * \param p structure containing the id informations
		 * \param b_id box_id
		 *
		 * \return box id
		 *
		 */
		inline static size_t id(p_box & p, size_t b_id)
		{
			return b_id;
		}
	};

	/*! \brief class to select the returned id by ghost_processorID
	 *
	 */
	class processor_id
	{
	public:
		/*! \brief Return the processor id
		 *
		 * \param p structure containing the id informations
		 * \param b_id box_id
		 *
		 * \return processor id
		 *
		 */
		inline static size_t id(p_box & p, size_t b_id)
		{
			return p.proc;
		}
	};

	/*! \brief class to select the returned id by ghost_processorID
	 *
	 */
	class lc_processor_id
	{
	public:
		/*! \brief Return the near processor id
		 *
		 * \param p structure containing the id informations
		 * \param b_id box_id
		 *
		 * \return local processor id
		 *
		 */
		inline static size_t id(p_box & p, size_t b_id)
		{
			return p.lc_proc;
		}
	};

762
763
764
765
766
767
768
769
770
771
772
	/*! /brief Given a point it return the set of boxes in which the point fall
	 *
	 * \param p Point to check
	 * \return An iterator with the id's of the internal boxes in which the point fall
	 *
	 */
	auto getInternalIDBoxes(Point<dim,T> & p) -> decltype(geo_cell.getIterator(geo_cell.getCell(p)))
	{
		return geo_cell.getIterator(geo_cell.getCell(p));
	}

773
774
775
776

#define UNIQUE 1
#define MULTIPLE 2

incardon's avatar
incardon committed
777
	/*! \brief Given a position it return if the position belong to any neighborhood processor ghost
incardon's avatar
incardon committed
778
	 * (Internal ghost)
incardon's avatar
incardon committed
779
	 *
780
	 * \tparam id type of if to get box_id processor_id lc_processor_id
incardon's avatar
incardon committed
781
	 * \param p Particle position
782
783
784
	 * \param opt intersection boxes of the same processor can overlap, so in general the function
	 *        can produce more entry with the same processor, the UNIQUE option eliminate double entries
	 *        (UNIQUE) is for particle data (MULTIPLE) is for grid data [default MULTIPLE]
incardon's avatar
incardon committed
785
786
787
788
	 *
	 * \param return the processor ids
	 *
	 */
789
	template <typename id> inline const openfpm::vector<size_t> ghost_processorID(Point<dim,T> & p, const int opt = MULTIPLE)
incardon's avatar
incardon committed
790
791
792
	{
		ids.clear();

793
		// Check with geo-cell if a particle is inside one Cell containing boxes
incardon's avatar
incardon committed
794

795
		auto cell_it = geo_cell.getIterator(geo_cell.getCell(p));
incardon's avatar
incardon committed
796
797

		// For each element in the cell, check if the point is inside the box
798
		// if it is, store the processor id
incardon's avatar
incardon committed
799
800
801
802
803
804
		while (cell_it.isNext())
		{
			size_t bid = cell_it.get();

			if (vb_int.get(bid).box.isInside(p) == true)
			{
805
				ids.add(id::id(vb_int.get(bid),bid));
incardon's avatar
incardon committed
806
			}
807
808

			++cell_it;
incardon's avatar
incardon committed
809
810
		}

811
812
813
814
		// Make the id unique
		if (opt == UNIQUE)
			ids.unique();

incardon's avatar
incardon committed
815
816
817
818
		return ids;
	}

	/*! \brief Given a position it return if the position belong to any neighborhood processor ghost
incardon's avatar
incardon committed
819
	 * (Internal ghost)
incardon's avatar
incardon committed
820
	 *
821
	 * \tparam id type of if to get box_id processor_id lc_processor_id
incardon's avatar
incardon committed
822
823
824
825
826
	 * \param p Particle position
	 *
	 * \param return the processor ids
	 *
	 */
827
	template<typename id, typename Mem> inline const openfpm::vector<size_t> ghost_processorID(const encapc<1,Point<dim,T>,Mem> & p, const int opt = MULTIPLE)
incardon's avatar
incardon committed
828
829
830
831
832
	{
		ids.clear();

		// Check with geo-cell if a particle is inside one Cell containing boxes

incardon's avatar
incardon committed
833
		auto cell_it = geo_cell.getIterator(geo_cell.getCell(p));
incardon's avatar
incardon committed
834
835
836
837
838
839
840
841
842

		// For each element in the cell, check if the point is inside the box
		// if it is, store the processor id
		while (cell_it.isNext())
		{
			size_t bid = cell_it.get();

			if (vb_int.get(bid).box.isInside(p) == true)
			{
843
				ids.add(id::id(vb_int.get(bid),bid));
incardon's avatar
incardon committed
844
			}
845
846

			++cell_it;
incardon's avatar
incardon committed
847
848
		}

849
850
851
852
		// Make the id unique
		if (opt == UNIQUE)
			ids.unique();

incardon's avatar
incardon committed
853
854
855
		return ids;
	}

856
857
	// External ghost boxes for this processor, indicated with G8_0 G9_0 ...
	openfpm::vector<p_box> vb_ext;
incardon's avatar
incardon committed
858

859
	// Internal ghost boxes for this processor domain, indicated with B8_0 B9_0 ..... in the figure
incardon's avatar
incardon committed
860
	// below as a linear vector
incardon's avatar
incardon committed
861
	openfpm::vector<p_box> vb_int;
incardon's avatar
incardon committed
862

incardon's avatar
incardon committed
863
	/*! It calculate the internal ghost boxes
incardon's avatar
incardon committed
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
	 *
	 * Example: Processor 10 calculate
	 * B8_0 B9_0 B9_1 and B5_0
	 *
	 *
+----------------------------------------------------+
|                                                    |
|                 Processor 8                        |
|                 Sub-domain 0                       +-----------------------------------+
|                                                    |                                   |
|                                                    |                                   |
++--------------+---+---------------------------+----+        Processor 9                |
 |              |   |     B8_0                  |    |        Subdomain 0                |
 |              +------------------------------------+                                   |
 |              |   |                           |    |                                   |
 |              |   |  XXXXXXXXXXXXX XX         |B9_0|                                   |
 |              | B |  X Processor 10 X         |    |                                   |
 | Processor 5  | 5 |  X Sub-domain 0 X         |    |                                   |
 | Subdomain 0  | _ |  X              X         +----------------------------------------+
 |              | 0 |  XXXXXXXXXXXXXXXX         |    |                                   |
 |              |   |                           |    |                                   |
 |              |   |                           |    |        Processor 9                |
 |              |   |                           |B9_1|        Subdomain 1                |
 |              |   |                           |    |                                   |
 |              |   |                           |    |                                   |
 |              |   |                           |    |                                   |
 +--------------+---+---------------------------+----+                                   |
                                                     |                                   |
                                                     +-----------------------------------+

       and also
incardon's avatar
incardon committed
895
       G8_0 G9_0 G9_1 G5_0 (External ghost boxes)
incardon's avatar
incardon committed
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943

+----------------------------------------------------+
|                                                    |
|                 Processor 8                        |
|                 Sub-domain 0                       +-----------------------------------+
|           +---------------------------------------------+                              |
|           |         G8_0                           |    |                              |
++--------------+------------------------------------+    |   Processor 9                |
 |          |   |                                    |    |   Subdomain 0                |
 |          |   |                                    |G9_0|                              |
 |          |   |                                    |    |                              |
 |          |   |      XXXXXXXXXXXXX XX              |    |                              |
 |          |   |      X Processor 10 X              |    |                              |
 | Processor|5  |      X Sub-domain 0 X              |    |                              |
 | Subdomain|0  |      X              X              +-----------------------------------+
 |          |   |      XXXXXXXXXXXXXXXX              |    |                              |
 |          | G |                                    |    |                              |
 |          | 5 |                                    |    |   Processor 9                |
 |          | | |                                    |    |   Subdomain 1                |
 |          | 0 |                                    |G9_1|                              |
 |          |   |                                    |    |                              |
 |          |   |                                    |    |                              |
 +--------------+------------------------------------+    |                              |
            |                                        |    |                              |
            +----------------------------------------+----+------------------------------+


	 *
	 *
	 *
	 * \param ghost margins for each dimensions (p1 negative part) (p2 positive part)
	 *
                ^ p2[1]
                |
                |
           +----+----+
           |         |
           |         |
p1[0]<-----+         +----> p2[0]
           |         |
           |         |
           +----+----+
                |
                v  p1[1]

	 *
	 *
	 */
incardon's avatar
incardon committed
944
	void calculateGhostBoxes()
incardon's avatar
incardon committed
945
946
947
948
949
950
951
	{
#ifdef DEBUG
		// the ghost margins are assumed to be smaller
		// than one sub-domain

		for (size_t i = 0 ; i < dim ; i++)
		{
incardon's avatar
incardon committed
952
			if (ghost.template getLow(i) >= domain.template getHigh(i) / gr.size(i) || ghost.template getHigh(i)  >= domain.template getHigh(i) / gr.size(i))
incardon's avatar
incardon committed
953
			{
954
				std::cerr << "Error " << __FILE__ << ":" << __LINE__  << " : Ghost are bigger than one domain" << "\n";
incardon's avatar
incardon committed
955
956
957
958
			}
		}
#endif

incardon's avatar
incardon committed
959
960
		// create a buffer with the sub-domains of this processor, the informations ( the boxes )
		// of the sub-domains contiguous to the processor A are sent to the processor A and
incardon's avatar
incardon committed
961
962
		// the information of the contiguous sub-domains in the near processors are received
		//
963
		proc_adj_box.resize(getNNProcessors());
incardon's avatar
incardon committed
964
		openfpm::vector< openfpm::vector< ::SpaceBox<dim,T>> > boxes(nn_processors.size());
incardon's avatar
incardon committed
965
966
967
968
969
970
971

		for (size_t b = 0 ; b < box_nn_processor.size() ; b++)
		{
			for (size_t p = 0 ; p < box_nn_processor.get(b).size() ; p++)
			{
				size_t prc = box_nn_processor.get(b).get(p);

incardon's avatar
incardon committed
972
973
974
975
976
				// id of the processor in the processor list
				// [value between 0 and the number of the near processors]
				size_t id = nn_processor_subdomains[prc].id;

				boxes.get(id).add(sub_domains.get(b));
977
				proc_adj_box.get(id).add(b);
incardon's avatar
incardon committed
978
979
980
981
982
983
			}
		}

		// Intersect all the local sub-domains with the sub-domains of the contiguous processors

		// Get the sub-domains of the near processors
incardon's avatar
incardon committed
984
		v_cl.sendrecvMultipleMessagesNBX(nn_processors,boxes,CartDecomposition<dim,T,device_l,Memory,Domain>::message_alloc, this ,NEED_ALL_SIZE);
incardon's avatar
incardon committed
985

incardon's avatar
incardon committed
986
		// create the internal structures that store ghost information
987
988
		create_box_nn_processor_ext(ghost);
		create_box_nn_processor_int(ghost);
incardon's avatar
incardon committed
989

incardon's avatar
incardon committed
990
		// ebox must come after ibox (in this case)
incardon's avatar
incardon committed
991
992
993

		ie_loc_ghost<dim,T>::create_loc_ghost_ibox(ghost,sub_domains);
		ie_loc_ghost<dim,T>::create_loc_ghost_ebox(ghost,sub_domains);
incardon's avatar
incardon committed
994
995
996
997
998
999
1000
1001
1002

		// get the smallest sub-domain dimension on each direction
		for (size_t i = 0 ; i < dim ; i++)
		{
			if (ghost.template getLow(i) >= ss_box.getHigh(i) || ghost.template getHigh(i)  >= domain.template getHigh(i) / gr.size(i))
			{
				std::cerr << "Error " << __FILE__ << ":" << __LINE__  << " : Ghost are bigger than one domain" << "\n";
			}
		}
incardon's avatar
incardon committed
1003
1004
	}

incardon's avatar
incardon committed
1005
1006
1007
1008
1009
1010
	/*! \brief processorID return in which processor the particle should go
	 *
	 * \return processorID
	 *
	 */

incardon's avatar
incardon committed
1011
	template<typename Mem> size_t inline processorID(encapc<1, Point<dim,T>, Mem> p)
incardon's avatar
incardon committed
1012
	{
incardon's avatar
incardon committed
1013
		return fine_s.get(cd.getCell(p));
incardon's avatar
incardon committed
1014
1015
	}

incardon's avatar
incardon committed
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
	// Smallest subdivision on each direction
	::Box<dim,T> ss_box;

	/*! \brief Get the smallest subdivision of the domain on each direction
	 *
	 * \return a box p1 is set to zero
	 *
	 */
	const ::Box<dim,T> & getSmallestSubdivision()
	{
		return ss_box;
	}

incardon's avatar
incardon committed
1029
1030
1031
1032
1033
1034
	/*! \brief processorID return in which processor the particle should go
	 *
	 * \return processorID
	 *
	 */

1035
	size_t inline processorID(const T (&p)[dim]) const
incardon's avatar
incardon committed
1036
	{
incardon's avatar
incardon committed
1037
		return fine_s.get(cd.getCell(p));
incardon's avatar
incardon committed
1038
1039
	}

incardon's avatar
incardon committed
1040
1041
	/*! \brief Set the parameter of the decomposition
	 *
incardon's avatar
incardon committed
1042
     * \param div_ storing into how many domain to decompose on each dimension
incardon's avatar
incardon committed
1043
1044
1045
     * \param domain_ domain to decompose
	 *
	 */
incardon's avatar
incardon committed
1046
	void setParameters(const size_t (& div_)[dim], Domain<dim,T> domain_, Ghost<dim,T> ghost = Ghost<dim,T>())
incardon's avatar
incardon committed
1047
	{
incardon's avatar
incardon committed
1048
1049
		// set the ghost
		this->ghost = ghost;
incardon's avatar
incardon committed
1050
1051
		// Set the decomposition parameters

incardon's avatar
incardon committed
1052
		gr.setDimensions(div_);
incardon's avatar
incardon committed
1053
		domain = domain_;
incardon's avatar
incardon committed
1054
		cd.setDimensions(domain,div_,0);
incardon's avatar
incardon committed
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100

		//! Create the decomposition

		CreateDecomposition(v_cl);
	}

	/*! \brief Get the number of local local hyper-cubes or sub-domains
	 *
	 * \return the number of sub-domains
	 *
	 */
	size_t getNLocalHyperCube()
	{
		return sub_domains.size();
	}

	/*! \brief Get the number of one set of hyper-cube enclosing one particular
	 *         subspace, the hyper-cube enclose your space, even if one box is enough
	 *         can be more that one to increase occupancy
	 *
     * In case of Cartesian decomposition it just return 1, each subspace
	 * has one hyper-cube, and occupancy 1
	 *
	 * \param id of the subspace
	 * \return the number of hyper-cube enclosing your space
	 *
	 */
	size_t getNHyperCube(size_t id)
	{
		return 1;
	}

	/*! \brief Get the hyper-cube margins id_c has to be 0
	 *
	 * Get the hyper-cube margins id_c has to be 0, each subspace
	 * has one hyper-cube
	 *
	 * \param id of the subspace
	 * \param id_c
	 * \return The specified hyper-cube space
	 *
	 */
	SpaceBox<dim,T> & getHyperCubeMargins(size_t id, size_t id_c)
	{
#ifdef DEBUG
		// Check if this subspace exist
incardon's avatar
incardon committed
1101
		if (id >= gr.size())
incardon's avatar
incardon committed
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
		{
			std::cerr << "Error CartDecomposition: id > N_tot";
		}
		else if (id_c > 0)
		{
			// Each subspace is an hyper-cube so return error if id_c > 0
			std::cerr << "Error CartDecomposition: id_c > 0";
		}
#endif

		return sub_domains.get<Object>(id);
	}

incardon's avatar
incardon committed
1115
	/*! \brief Get the total number of sub-domain for the local processor
incardon's avatar
incardon committed
1116
	 *
incardon's avatar
incardon committed
1117
	 * \return The total number of sub-domains
incardon's avatar
incardon committed
1118
1119
1120
1121
1122
	 *
	 */

	size_t getNHyperCube()
	{
incardon's avatar
incardon committed
1123
		return gr.size();
incardon's avatar
incardon committed
1124
1125
	}

incardon's avatar
incardon committed
1126
	/*! \brief Get the local sub-domain
incardon's avatar
incardon committed
1127
	 *
incardon's avatar
incardon committed
1128
1129
	 * \param i (each local processor can have more than one sub-domain)
	 * \return the sub-domain
incardon's avatar
incardon committed
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
	 *
	 */
	SpaceBox<dim,T> getLocalHyperCube(size_t lc)
	{
		// Create a space box
		SpaceBox<dim,T> sp;

		// fill the space box

		for (size_t k = 0 ; k < dim ; k++)
		{
			// create the SpaceBox Low and High
			sp.setLow(k,sub_domains.template get<Box::p1>(lc)[k]);
			sp.setHigh(k,sub_domains.template get<Box::p2>(lc)[k]);
		}

		return sp;
	}

incardon's avatar
incardon committed
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
	/*! \brief Get the local sub-domain with ghost extension
	 *
	 * \param i (each local processor can have more than one sub-domain)
	 * \return the sub-domain
	 *
	 */

	SpaceBox<dim,T> getSubDomainWithGhost(size_t lc)
	{
		// Create a space box
		SpaceBox<dim,T> sp = sub_domains.get(lc);

		// enlarge with ghost
		sp.enlarge(ghost);

		return sp;
	}

incardon's avatar
incardon committed
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
	/*! \brief Return the structure that store the physical domain
	 *
	 * Return the structure that store the physical domain
	 *
	 * \return The physical domain
	 *
	 */

	Domain<dim,T> & getDomain()
	{
		return domain;
	}

incardon's avatar
incardon committed
1180
1181
1182
	/*! \brief Check if the particle is local
	 *
	 * \param p object position
incardon's avatar
incardon committed
1183
	 *
incardon's avatar
incardon committed
1184
	 * \return true if it is local
incardon's avatar
incardon committed
1185
1186
	 *
	 */
1187
	template<typename Mem> bool isLocal(const encapc<1, Point<dim,T>, Mem> p) const
incardon's avatar
incardon committed
1188
	{
1189
		return processorID<Mem>(p) == v_cl.getProcessUnitID();
incardon's avatar
incardon committed
1190
	}
incardon's avatar
incardon committed
1191

incardon's avatar
incardon committed
1192
	/*! \brief Check if the particle is local
incardon's avatar
incardon committed
1193
	 *
incardon's avatar
incardon committed
1194
	 * \param p object position
incardon's avatar
incardon committed
1195
	 *
incardon's avatar
incardon committed
1196
	 * \return true if it is local
incardon's avatar
incardon committed
1197
1198
	 *
	 */
1199
	bool isLocal(const T (&pos)[dim]) const
incardon's avatar
incardon committed
1200
	{
incardon's avatar
incardon committed
1201
1202
		return processorID(pos) == v_cl.getProcessUnitID();
	}
incardon's avatar
incardon committed
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214

	::Box<dim,T> bbox;

	/*! \brief Return the bounding box containing the processor box + smallest subdomain spacing
	 *
	 * \return The bounding box
	 *
	 */
	::Box<dim,T> & getProcessorBounds()
	{
		return bbox;
	}
incardon's avatar
incardon committed
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227

	/*! \brief if the point fall into the ghost of some near processor it return the processors id's in which
	 *  it fall
	 *
	 * \param p Point
	 * \return iterator of the processors id's
	 *
	 */
	inline auto labelPoint(Point<dim,T> & p) -> decltype(geo_cell.getIterator(geo_cell.getCell(p)))
	{
		return geo_cell.getIterator(geo_cell.getCell(p));
	}

1228

1229
1230
1231
	////////////// Functions to get decomposition information ///////////////


1232
	/*! \brief Get the number of Internal ghost boxes for one processor
1233
	 *
1234
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
1235
1236
1237
1238
1239
1240
1241
1242
	 * \return the number of internal ghost
	 *
	 */
	inline size_t getProcessorNIGhost(size_t id) const
	{
		return proc_int_box.get(id).ibx.size();
	}

1243
	/*! \brief Get the number of External ghost boxes for one processor id
1244
	 *
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
	 * \return the number of external ghost
	 *
	 */
	inline size_t getProcessorNEGhost(size_t id) const
	{
		return proc_int_box.get(id).ebx.size();
	}

	/*! \brief Get the j Internal ghost box for one processor
	 *
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
	 * \param j box (each near processor can produce more than one internal ghost box)
1258
1259
1260
1261
1262
	 * \return the box
	 *
	 */
	inline const ::Box<dim,T> & getProcessorIGhostBox(size_t id, size_t j) const
	{
incardon's avatar
incardon committed
1263
		return proc_int_box.get(id).ibx.get(j);
1264
1265
	}

1266
	/*! \brief Get the j External ghost box
1267
1268
1269
1270
1271
1272
1273
1274
	 *
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
	 * \param j box (each near processor can produce more than one external ghost box)
	 * \return the box
	 *
	 */
	inline const ::Box<dim,T> & getProcessorEGhostBox(size_t id, size_t j) const
	{
incardon's avatar
incardon committed
1275
1276
1277
		return proc_int_box.get(id).ebx.get(j);
	}

1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
	/*! \brief Get the j Internal ghost box id
	 *
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
	 * \param j box (each near processor can produce more than one internal ghost box)
	 * \return the box
	 *
	 */
	inline size_t getProcessorIGhostId(size_t id, size_t j) const
	{
		return proc_int_box.get(id).ibx.get(j).id;
	}

	/*! \brief Get the j External ghost box id
	 *
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
	 * \param j box (each near processor can produce more than one external ghost box)
	 * \return the box
	 *
	 */
	inline size_t getProcessorEGhostId(size_t id, size_t j) const
	{
		return proc_int_box.get(id).ebx.get(j).id;
	}

1302
1303
1304

	/*! \brief Get the local sub-domain at witch belong the internal ghost box
	 *
incardon's avatar
incardon committed
1305
	 * \param id adjacent processor list id (the id go from 0 to getNNProcessor())
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
	 * \param j box (each near processor can produce more than one internal ghost box)
	 * \return sub-domain at which belong the internal ghost box
	 *
	 */
	inline const size_t getProcessorIGhostSub(size_t id, size_t j) const
	{
		return proc_int_box.get(id).ibx.get(j).sub;
	}

	/*! \brief Get the local sub-domain at witch belong the external ghost box
	 *
	 * \param id near processor list id (the id go from 0 to getNNProcessor())
	 * \param j box (each near processor can produce more than one external ghost box)
	 * \return sub-domain at which belong the external ghost box
	 *
	 */
	inline const size_t getProcessorEGhostSub(size_t id, size_t j) const
	{
		return proc_int_box.get(id).ebx.get(j).sub;
1325
1326
	}

1327
	/*! \brief Get the number of Near processors
1328
1329
1330
1331
	 *
	 * \return the number of near processors
	 *
	 */
1332
1333
1334
1335
1336
	inline size_t getNNProcessors() const
	{
		return nn_processors.size();
	}

1337
	/*! \brief Return the total number of the calculated internal ghost boxes
incardon's avatar
incardon committed
1338
	 *
1339
1340
1341
1342
1343
1344
1345
1346
	 * \return the number of internal ghost boxes
	 *
	 */
	inline size_t getNIGhostBox() const
	{
		return vb_int.size();
	}

1347
	/*! \brief Given the internal ghost box id, it return the internal ghost box
1348
	 *
1349
	 * \return the internal ghost box
incardon's avatar
incardon committed
1350
1351
	 *
	 */
1352
	inline ::Box<dim,T> getIGhostBox(size_t b_id) const
incardon's avatar
incardon committed
1353
	{
1354
1355
		return vb_int.get(b_id).box;
	}
incardon's avatar
incardon committed
1356

1357
1358
	/*! \brief Given the internal ghost box id, it return the near processor at witch belong
	 *         or the near processor that produced this internal ghost box
incardon's avatar
incardon committed
1359
	 *
1360
	 * \return the processor id of the ghost box
incardon's avatar
incardon committed
1361
	 *
1362
1363
1364
1365
1366
1367
	 */
	inline size_t getIGhostBoxProcessor(size_t b_id) const
	{
		return vb_int.get(b_id).proc;
	}

1368
	/*! \brief Get the number of the calculated external ghost boxes
1369
	 *
1370
	 * \return the number of external ghost boxes
incardon's avatar
incardon committed
1371
1372
	 *
	 */
1373
	inline size_t getNEGhostBox() const
incardon's avatar
incardon committed
1374
	{
1375
1376
		return vb_ext.size();
	}
incardon's avatar
incardon committed
1377

1378
	/*! \brief Given the external ghost box id, it return the external ghost box
incardon's avatar
incardon committed
1379
	 *
1380
	 * \return the external ghost box
incardon's avatar
incardon committed
1381
1382
	 *
	 */
1383
	inline ::Box<dim,T> getEGhostBox(size_t b_id) const
incardon's avatar
incardon committed
1384
	{
1385
		return vb_ext.get(b_id).box;
incardon's avatar
incardon committed
1386
	}
incardon's avatar