Skip to content

I
INMOST
Unverified Commit e953e5eb authored by Kirill Terekhov's avatar Kirill Terekhov Committed by GitHub
1 Browse files
Options

Merge pull request #30 from INMOST-DEV/andre_branch 

Add ExchangeData for REFERENSES. Add ResolveSets. Add transfer to oth…
parents d9a63eb6 a3c82add
Hide whitespace changes
Inline Side-by-side
Showing with 755 additions and 31 deletions
Source/Headers/inmost_mesh.h
View file @ e953e5eb
......@@ -12,6 +12,7 @@
namespace INMOST
{
std::string ro();
class Mesh;
class Storage;
......@@ -38,6 +39,7 @@ namespace INMOST
static const SyncBitOp SYNC_BIT_XOR = 2;
static const SyncBitOp SYNC_BIT_AND = 3;
///Definition for data type of topology error or event. This type may be extended later to 64 bits
/// to accomodate more topological errors or events.
......@@ -1286,12 +1288,11 @@ namespace INMOST
//INMOST_MPI_Group group;
Tag tag_shared;
Tag tag_owner;
Tag tag_processors;
Tag tag_layers;
Tag tag_sendto;
Tag tag_bridge;
Tag tag_redistribute;
private:
double dist(Cell a, Cell b);
void AllocatePrivateMarkers();
void DeallocatePrivateMarkers();
__INLINE static sparse_rec mkrec (const Tag & t) {sparse_rec ret; ret.tag = t.mem; ret.rec = NULL; return ret;}
......@@ -1310,6 +1311,9 @@ namespace INMOST
void AllocateSparseData (void * & q, const Tag & t);
void Init (std::string name);
public:
Tag tag_sendto;
TagInteger tag_an_id;
Tag tag_processors;
/// Go through all elements and detect presence of prescribed element in
/// any reference data tag.
void ReportConnection(HandleType h);
......@@ -2222,10 +2226,10 @@ namespace INMOST
class elements_by_type
{
private:
element_set container[4];
element_set container[5];
public:
elements_by_type() {}
elements_by_type(const elements_by_type & other) {for(int i = 0; i < 4; i++) container[i] = other.container[i];}
elements_by_type(const elements_by_type & other) {for(int i = 0; i < 5; i++) container[i] = other.container[i];}
~elements_by_type(){}
element_set & operator [](int i){ return container[i]; }
const element_set & operator [](int i) const { return container[i]; }
......@@ -2251,7 +2255,7 @@ namespace INMOST
private:
void ComputeSharedProcs ();
proc_elements ComputeSharedSkinSet(ElementType bridge);
void PackTagData (const Tag & tag, const elements_by_type & elements, ElementType mask, MarkerType select, buffer_type & buffer);
void PackTagData (const Tag & tag, const elements_by_type & elements, int destination, ElementType mask, MarkerType select, buffer_type & buffer);
void UnpackTagData (const Tag & tag, const elements_by_type & elements, ElementType mask, MarkerType select, buffer_type & buffer, int & position, ReduceOperation op);
void PackElementsData (element_set & input, buffer_type & buffer, int destination, const std::vector<std::string> & tag_list);
void UnpackElementsData (element_set & output, buffer_type & buffer, int source, std::vector<std::string> & tag_list);
......@@ -2263,6 +2267,7 @@ namespace INMOST
void SortParallelStorage(parallel_storage & ghost, parallel_storage & shared,ElementType mask);
void GatherParallelStorage(parallel_storage & ghost, parallel_storage & shared, ElementType mask);
public:
bool FindSharedGhost(int global_id, INMOST_DATA_INTEGER_TYPE el_type_num, HandleType& res);
#if defined(USE_PARALLEL_WRITE_TIME)
//this part is needed to test parallel performance
void Enter ();
......@@ -2417,7 +2422,9 @@ namespace INMOST
/// Set MPI communicator
void SetCommunicator (INMOST_MPI_Comm _comm);
/// Find elements that are common between processors.
void ResolveShared ();
void ResolveShared (bool only_new = false);
/// Find sets that are common between processors.
void ResolveSets ();
/// Delete all the ghost cells.
void RemoveGhost ();
/// Delete some ghost cells provided in array.
......@@ -3223,6 +3230,20 @@ namespace INMOST
bool operator() (HandleType a, integer gid) const {if( a == InvalidHandle() ) return false; return m->GlobalID(a) < gid;}
};
class SetNameComparator
{
Mesh * m;
public:
SetNameComparator(Mesh * m) :m(m) {}
bool operator()(HandleType a, HandleType b) const
{
if( a == InvalidHandle() || b == InvalidHandle() ) return a > b;
return ElementSet(m,a).GetName() < ElementSet(m,b).GetName();
}
};
class HierarchyComparator
{
Mesh * m;
......
Source/Mesh/modify.cpp
View file @ e953e5eb
......@@ -6,6 +6,8 @@
// incident_matrix class should measure for minimal volume,
// possibly check and update from projects/OctreeCutcell/octgrid.cpp
using namespace std;
namespace INMOST
{
......@@ -1591,9 +1593,80 @@ namespace INMOST
//Destroy(erase);//old approach
}
double Mesh::dist(Cell a, Cell b)
{
double xyza[3];
double xyzb[3];
a.Centroid(xyza);
b.Centroid(xyzb);
double dx = xyza[0] - xyzb[0];
double dy = xyza[1] - xyzb[1];
double dz = xyza[2] - xyzb[2];
return sqrt(dx*dx + dy*dy + dz*dz);
}
void OperationMinDistance(const Tag & tag, const Element & element, const INMOST_DATA_BULK_TYPE * data, INMOST_DATA_ENUM_TYPE size)
{
int owner = *((double*)data);
double dist = *((double*)(data+sizeof(double)));
TagReal r_tag = tag;
if (dist < element->RealArray(tag)[1])
{
element->RealArray(tag)[0] = owner;
element->RealArray(tag)[1] = dist;
}
}
void Mesh::ResolveModification()
{
throw NotImplemented;
int rank = GetProcessorRank(),mpisize = GetProcessorsNumber();
Tag tag = CreateTag("TEMP_DISTANSE",DATA_REAL,CELL,CELL,2);
for(Mesh::iteratorCell it = BeginCell(); it != EndCell(); it++) if (GetMarker(*it,NewMarker()))
{
double min = 0;
int first = 0;
Cell near_cell;
for(Mesh::iteratorCell jt = BeginCell(); jt != EndCell(); jt++) if (GetMarker(*jt,NewMarker()) == false)
{
double d = dist(it->getAsCell(), jt->getAsCell());
if (first++ == 0 || min > d)
{
min = d;
near_cell = jt->getAsCell();
}
}
int owner1 = it->IntegerDF(tag_owner);
int owner2 = near_cell.IntegerDF(tag_owner);
it->RealArray(tag)[0] = owner2;
it->RealArray(tag)[1] = min;
}
ReduceData(tag, CELL, 0, OperationMinDistance);
ExchangeData(tag, CELL, 0);
for(Mesh::iteratorCell it = BeginCell(); it != EndCell(); it++) if (GetMarker(*it,NewMarker()))
{
int new_owner = it->RealArray(tag)[0];
it->IntegerDF(tag_owner) = new_owner;
if (rank == new_owner)
{
it->SetStatus(Element::Shared);
}
else
{
it->SetStatus(Element::Ghost);
}
}
}
void Mesh::EndModification()
......
Source/Mesh/parallel.cpp
View file @ e953e5eb
......@@ -9,7 +9,9 @@
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
using namespace std;
#if defined(USE_MPI)
static INMOST_DATA_BIG_ENUM_TYPE pmid = 0;
......@@ -33,6 +35,18 @@ static INMOST_DATA_BIG_ENUM_TYPE pmid = 0;
namespace INMOST
{
static int flag = 0;
std::string ro()
{
int rank = 0;
MPI_Comm_rank(MPI_COMM_WORLD,&rank);
std::stringstream ss;
for (int i = 0; i < rank; i++)
ss << " ";
return ss.str();
}
//////////////////////////////
/// REDUCTION FUNCTIONS ///
//////////////////////////////
......@@ -643,12 +657,13 @@ namespace INMOST
void Mesh::SetCommunicator(INMOST_MPI_Comm _comm)
{
ENTER_FUNC();
tag_shared = CreateTag("PROTECTED_STATUS",DATA_BULK,CELL | FACE | EDGE | NODE,NONE,1);
tag_owner = CreateTag("OWNER_PROCESSOR",DATA_INTEGER, CELL | FACE | EDGE | NODE,NONE,1);
tag_processors = CreateTag("PROCESSORS_LIST",DATA_INTEGER, MESH | NODE | EDGE | FACE | CELL,NONE);
tag_shared = CreateTag("PROTECTED_STATUS",DATA_BULK, ESET |CELL | FACE | EDGE | NODE,NONE,1);
tag_owner = CreateTag("OWNER_PROCESSOR",DATA_INTEGER, ESET | CELL | FACE | EDGE | NODE,NONE,1);
tag_processors = CreateTag("PROCESSORS_LIST",DATA_INTEGER, ESET| MESH | NODE | EDGE | FACE | CELL,NONE);
tag_layers = CreateTag("LAYERS",DATA_INTEGER,MESH,NONE,1);
tag_bridge = CreateTag("BRIDGE",DATA_INTEGER,MESH,NONE,1);
tag_sendto = CreateTag("PROTECTED_SENDTO",DATA_INTEGER, CELL | FACE | EDGE | NODE, CELL | FACE | EDGE | NODE);
tag_sendto = CreateTag("PROTECTED_SENDTO",DATA_INTEGER, ESET | CELL | FACE | EDGE | NODE, ESET | CELL | FACE | EDGE | NODE);
tag_an_id = CreateTag("PROTECTED_ID",DATA_INTEGER, CELL | FACE | EDGE | NODE, CELL | FACE | EDGE | NODE);
#if defined(USE_MPI)
randomizer = Random();
......@@ -872,8 +887,10 @@ namespace INMOST
{
public: bool operator () (const std::pair<int,int> & a, const std::pair<int,int> & b) {return a.first < b.first;}
};
void Mesh::ResolveShared()
void Mesh::ResolveShared(bool only_new)
{
ENTER_FUNC();
......@@ -883,6 +900,7 @@ namespace INMOST
integer dim = GetDimensions();
int sendsize;
int mpirank = GetProcessorRank(),mpisize = GetProcessorsNumber();
int rank = mpirank;
#if defined(USE_PARALLEL_STORAGE)
shared_elements.clear();
ghost_elements.clear();
......@@ -990,6 +1008,8 @@ namespace INMOST
for(integer eit = 0; eit < LastLocalID(etype); ++eit) if( isValidElement(etype,eit) )
{
Element it = ElementByLocalID(etype,eit);
if (only_new && GetMarker(it->GetHandle(),NewMarker()) == false) continue;
integer_array arr = it->IntegerArrayDV(tag_processors);
arr.resize(mpisize);
for(int k = 0; k < mpisize; k++)
......@@ -1023,6 +1043,19 @@ namespace INMOST
}
else
{
if (only_new)
{
for(Mesh::iteratorCell it = BeginCell(); it != EndCell(); it++) if (GetMarker(*it,NewMarker()))
{
ElementArray<Node> nodes = it->getNodes();
for (int i = 0; i < nodes.size(); i++)
{
nodes[i].SetMarker(NewMarker());
}
}
}
double time = Timer();
Storage::real epsilon = GetEpsilon();
......@@ -1228,6 +1261,7 @@ namespace INMOST
Element::Status estat;
for(Mesh::iteratorElement it = BeginElement(NODE); it != EndElement(); it++)
{
if (only_new && GetMarker(*it,NewMarker()) == false) continue;
int owner;
Storage::integer_array v = it->IntegerArrayDV(tag_processors);
std::sort(v.begin(),v.end());
......@@ -1306,6 +1340,8 @@ namespace INMOST
if( isValidElement(current_mask,eit) )
{
Element it = ElementByLocalID(current_mask,eit);
if (only_new && GetMarker(it.GetHandle(),NewMarker()) == false) continue;
determine_my_procs_low(this,it->GetHandle(), result, intersection);
Storage::integer_array p = it->IntegerArrayDV(tag_processors);
if( result.empty() )
......@@ -1374,6 +1410,7 @@ namespace INMOST
message_send.push_back(0);
for(Mesh::iteratorElement it = BeginElement(current_mask); it != EndElement(); it++)
{
if (only_new && GetMarker(*it,NewMarker()) == false) continue;
Storage::integer_array pr = it->IntegerArrayDV(tag_processors);
if( std::binary_search(pr.begin(),pr.end(),*p) )
{
......@@ -1527,6 +1564,8 @@ namespace INMOST
//Now mark all the processors status
for(Mesh::iteratorElement it = BeginElement(current_mask); it != EndElement(); it++)
{
if (only_new && (GetMarker(*it,NewMarker()) == false)) continue;
Storage::integer_array pr = it->IntegerArrayDV(tag_processors);
if( pr.empty() )
{
......@@ -2243,9 +2282,10 @@ namespace INMOST
}
void Mesh::PackTagData(const Tag & tag, const elements_by_type & elements, ElementType mask, MarkerType select, buffer_type & buffer)
void Mesh::PackTagData(const Tag & tag, const elements_by_type & elements, int destination, ElementType mask, MarkerType select, buffer_type & buffer)
{
if( tag.GetDataType() == DATA_REFERENCE || tag.GetDataType() == DATA_REMOTE_REFERENCE ) return; //NOT IMPLEMENTED TODO 14
int rank = GetProcessorRank();
if( tag.GetDataType() == DATA_REMOTE_REFERENCE ) return; //NOT IMPLEMENTED TODO 14
ENTER_FUNC();
#if defined(USE_MPI)
REPORT_VAL("Buffer size before pack",buffer.size());
......@@ -2256,7 +2296,7 @@ namespace INMOST
array_data_send.reserve(4096);
array_size_send.reserve(4096);
unsigned int size = tag.GetSize();
for(int i = ElementNum(NODE); i <= ElementNum(CELL); i++) if( (mask & ElementTypeFromDim(i)) && tag.isDefinedByDim(i) )
for(int i = ElementNum(NODE); i <= ElementNum(ESET); i++) if( (mask & ElementTypeFromDim(i)) && tag.isDefinedByDim(i) )
{
pack_types[0] |= ElementTypeFromDim(i);
REPORT_VAL("select marker",select);
......@@ -2315,7 +2355,21 @@ namespace INMOST
REPORT_VAL("size: ", s);
}
array_data_send.resize(had_s+GetDataCapacity(*eit,tag));
GetData(*eit,tag,0,s,&array_data_send[had_s]);
if (tag.GetDataType() == DATA_REFERENCE)
{
reference_array refs = ReferenceArray(*eit, tag);
int bytes = tag.GetBytesSize();
for(Storage::reference_array::size_type i = 0; i < refs.size(); ++i)
{
if (refs[i] == InvalidElement()) continue;
HandleType data = ComposeHandle(refs[i]->GetElementType(), refs[i]->GlobalID());
memcpy(&array_data_send[had_s+i*bytes],&data,sizeof(HandleType));
}
}
else
{
GetData(*eit,tag,0,s,&array_data_send[had_s]);
}
}
if( size == ENUMUNDEF ) array_size_send.push_back(s);
++total_packed;
......@@ -2351,10 +2405,43 @@ namespace INMOST
EXIT_FUNC();
}
bool Mesh::FindSharedGhost(int global_id, INMOST_DATA_INTEGER_TYPE el_type_num, HandleType& res)
{
int rank = GetProcessorRank();
int dim = el_type_num;
for (parallel_storage::iterator it = shared_elements.begin(); it != shared_elements.end(); it++)
{
for(element_set::iterator p = it->second[dim].begin(); p != it->second[dim].end(); p++)
{
if (GlobalID(*p) == global_id)
{
res = *p;
return true;
}
}
}
for (parallel_storage::iterator it = ghost_elements.begin(); it != ghost_elements.end(); it++)
{
for(element_set::iterator p = it->second[dim].begin(); p != it->second[dim].end(); p++)
{
if (GlobalID(*p) == global_id)
{
res = *p;
return true;
}
}
}
return false;
}
void Mesh::UnpackTagData(const Tag & tag, const elements_by_type & elements, ElementType mask, MarkerType select, buffer_type & buffer, int & position, ReduceOperation op)
{
int rank = GetProcessorRank();
(void) mask;
if( tag.GetDataType() == DATA_REFERENCE || tag.GetDataType() == DATA_REMOTE_REFERENCE) return; //NOT IMPLEMENTED TODO 14
if( tag.GetDataType() == DATA_REMOTE_REFERENCE) return; //NOT IMPLEMENTED TODO 14
ENTER_FUNC();
REPORT_VAL("TagName",tag.GetTagName());
REPORT_VAL("select marker",select);
......@@ -2378,7 +2465,7 @@ namespace INMOST
array_size_recv.resize(size_recv);
array_data_recv.resize(data_recv);
if( !array_size_recv.empty() ) MPI_Unpack(&buffer[0],static_cast<INMOST_MPI_SIZE>(buffer.size()),&position,&array_size_recv[0],static_cast<INMOST_MPI_SIZE>(array_size_recv.size()),INMOST_MPI_DATA_ENUM_TYPE,comm);
if( !array_data_recv.empty() )
if( !array_data_recv.empty() )
{
int bytes = tag.GetPackedBytesSize();
REPORT_VAL("occupied by type",bytes);
......@@ -2390,7 +2477,7 @@ namespace INMOST
REPORT_VAL("calculated size of data",array_data_recv.size()/sizeof(Sparse::Row::entry));
MPI_Unpack(&buffer[0],static_cast<INMOST_MPI_SIZE>(buffer.size()),&position,&array_data_recv[0],static_cast<INMOST_MPI_SIZE>(array_data_recv.size()/bytes),tag.GetBulkDataType(),comm);
}
for(int i = ElementNum(NODE); i <= ElementNum(CELL); i++) if( (recv_mask[0] & ElementTypeFromDim(i)) )
for(int i = ElementNum(NODE); i <= ElementNum(ESET); i++) if( (recv_mask[0] & ElementTypeFromDim(i)) )
{
REPORT_VAL("unpack for type",ElementTypeName(ElementTypeFromDim(i)));
REPORT_VAL("number of elements",elements[i].size());
......@@ -2448,7 +2535,29 @@ namespace INMOST
{
if( !select || GetMarker(*eit,select) )
{
op(tag,Element(this,*eit),&array_data_recv[pos],array_size_recv[k]);
if (tag.GetDataType() == DATA_REFERENCE)
{
int bytes = tag.GetBytesSize();
for (int i = 0; i < array_size_recv[k]; i++)
{
int global_id;
HandleType data;
memcpy(&data,&array_data_recv[pos + i*bytes],sizeof(HandleType));
global_id = GetHandleID(data);
int type = GetHandleElementNum(data);
HandleType target;
if (FindSharedGhost(global_id,GetHandleElementNum(data),target))
{
TagReferenceArray ref_tag = tag;
ref_tag[*eit].push_back(target);
}
}
}
else
{
op(tag,Element(this,*eit),&array_data_recv[pos],array_size_recv[k]);
}
pos += GetDataCapacity(&array_data_recv[pos],array_size_recv[k],tag);
//pos += array_size_recv[k]*tag.GetBytesSize();
++k;
......@@ -2523,6 +2632,7 @@ namespace INMOST
#endif
) unknown_size = true;
int rank = GetProcessorRank();
//precompute sizes
for(p = procs.begin(); p != procs.end(); p++ )
{
......@@ -2545,16 +2655,62 @@ namespace INMOST
{
find = from.find(*p);
if( find != from.end() )
for(int i = 0; i < 4; i++) if( mask & ElementTypeFromDim(i) )
{
for(int i = 0; i < 5; i++) if( mask & ElementTypeFromDim(i) )
send_size[pos] += static_cast<INMOST_DATA_ENUM_TYPE>(find->second[i].size());
}
find = to.find(*p);
if( find != to.end() )
for(int i = 0; i < 4; i++) if( mask & ElementTypeFromDim(i) )
for(int i = 0; i < 5; i++) if( mask & ElementTypeFromDim(i) )
recv_size[pos] += static_cast<INMOST_DATA_ENUM_TYPE>(find->second[i].size());
}
}
int num_send = 0, num_recv = 0;
///////////
if (flag == 0)
{
for(unsigned int k = 0; k < tags.size(); k++)
{
if(tags[k].GetDataType() == DATA_REFERENCE)
{
for(p = procs.begin(); p != procs.end(); p++ )
{
const elements_by_type& elements = from.find(*p)->second;
for(int i = ElementNum(NODE); i <= ElementNum(ESET); i++) if( (mask & ElementTypeFromDim(i)) && tags[k].isDefinedByDim(i) )
{
for (int j = 0; j < elements[i].size(); j++)
{
if (!isValidHandleRange(elements[i][j])) continue;
reference_array refs = ReferenceArray(elements[i][j], tags[k]);
if (refs.size() == 0) continue;
if (tags[k] == HighConnTag())
{
assert(i == ElementNum(ESET));
ElementSet set(this,elements[i][j]);
for(ElementSet child = set.GetChild(); child.isValid(); child = child.GetSibling())
{
child.IntegerArray(tag_sendto).push_back(*p);
}
}
else
{
for(Storage::reference_array::size_type i = 0; i < refs.size(); ++i)
{
if (refs[i] == InvalidElement()) continue;
refs[i].IntegerArray(tag_sendto).push_back(*p);
}
}
}
}
}
}
}
flag = 1;
ExchangeMarked();
flag = 0;
}
///////////
for(p = procs.begin(); p != procs.end(); p++ )
{
REPORT_VAL("for processor",p-procs.begin());
......@@ -2562,8 +2718,8 @@ namespace INMOST
REPORT_VAL("recv size",recv_size[p-procs.begin()]);
if( send_size[p-procs.begin()] )
{
for(unsigned int k = 0; k < tags.size(); k++)
PackTagData(tags[k],from.find(*p)->second,mask,select,storage.send_buffers[num_send].second);
for(unsigned int k = 0; k < tags.size(); k++)
PackTagData(tags[k],from.find(*p)->second,*p,mask,select,storage.send_buffers[num_send].second);
storage.send_buffers[num_send].first = *p;
num_send++;
}
......@@ -2824,14 +2980,17 @@ namespace INMOST
void Mesh::PackElementsData(element_set & all, buffer_type & buffer, int destination, const std::vector<std::string> & tag_list)
{
int rank = GetProcessorRank();
//std::cout << ro() << rank << " In pack elements data " << all.size() << std::endl;
//std::cout << rank << " In pack elements Data" << std::endl;
ENTER_FUNC();
REPORT_VAL("dest",destination);
#if defined(USE_MPI)
INMOST_DATA_ENUM_TYPE num;
//assume hex mesh for forward allocation
//8 nodes per cell, 2 nodes per edge, 4 edges per face, 6 faces per cell
const INMOST_DATA_ENUM_TYPE size_hint[4] = {8,2,4,6};
INMOST_DATA_ENUM_TYPE prealloc[4] = {0,0,0,0};
const INMOST_DATA_ENUM_TYPE size_hint[5] = {8,2,4,6,1};
INMOST_DATA_ENUM_TYPE prealloc[5] = {0,0,0,0,0};
int position,new_size,k, mpirank = GetProcessorRank();
int temp;
elements_by_type selems;
......@@ -2839,7 +2998,9 @@ namespace INMOST
//elements_by_type pack_tags
{
for(element_set::iterator it = all.begin(); it != all.end(); it++)
{
selems[GetHandleElementNum(*it)].push_back(*it);
}
all.clear();
}
REPORT_STR("initial number of elements");
......@@ -2847,9 +3008,63 @@ namespace INMOST
REPORT_VAL("EDGE",selems[1].size());
REPORT_VAL("FACE",selems[2].size());
REPORT_VAL("CELL",selems[3].size());
Tag arr_position = CreateTag("TEMP_ARRAY_POSITION",DATA_INTEGER,FACE|EDGE|NODE,NONE,1);
Tag arr_position = CreateTag("TEMP_ARRAY_POSITION",DATA_INTEGER,ESET|CELL|FACE|EDGE|NODE,NONE,1);
//ElementArray<Element> adj(this);
MarkerType busy = CreateMarker();
// Recursevely looking for all high connections for ESETs
for(element_set::iterator it = selems[4].begin(); it != selems[4].end(); ++it) SetMarker(*it,busy);
int ind = 0;
while (ind < selems[4].size())
{
ElementSet set(this,selems[4][ind]);
// looking to child, sibling and parent
for (int i = 0; i <= 2; i++)
{
ElementSet _set;
switch (i)
{
case 0: _set = set.GetChild(); break;
case 1: _set = set.GetSibling(); break;
case 2: _set = set.GetParent(); break;
}
if (_set.GetHandle() == InvalidHandle()) continue;
if (!GetMarker(_set.GetHandle(),busy))
{
selems[4].push_back(_set.GetHandle());
SetMarker(_set.GetHandle(),busy);
}
}
ind++;
}
// Add low conns elements to selems array. Low conns for ESET can contain any element
// Low conns for ESETs
{
// Mark all elems as busy
for(int etypenum = ElementNum(CELL); etypenum > ElementNum(NODE); --etypenum)
for(element_set::iterator it = selems[etypenum-1].begin(); it != selems[etypenum-1].end(); ++it) SetMarker(*it,busy);
for(element_set::iterator it = selems[4].begin(); it != selems[4].end(); it++)
{
// GetHandleElementNum(*it) - 4:ESET, 3:CELL, ... , 0:NODE
Element::adj_type const & adj = LowConn(*it);
for(Element::adj_type::const_iterator jt = adj.begin(); jt != adj.end(); jt++)
{
if( !GetMarker(*jt,busy) )
{
prealloc[GetHandleElementNum(*jt)] += 1;
selems[GetHandleElementNum(*jt)].push_back(*jt);
SetMarker(*jt,busy);
}
}
}
for(int etypenum = ElementNum(CELL); etypenum >= ElementNum(NODE); --etypenum)
for(element_set::iterator it = selems[etypenum].begin(); it != selems[etypenum].end(); ++it) RemMarker(*it,busy);
}
// Low conns for CELLs, FACEs, EDGEs
for(int etypenum = ElementNum(CELL); etypenum > ElementNum(NODE); --etypenum)
{
selems[etypenum-1].reserve(size_hint[etypenum]*selems[etypenum].size());
......@@ -2874,7 +3089,7 @@ namespace INMOST
for(element_set::iterator it = selems[3].begin(); it != selems[3].end(); it++)
prealloc[0] += static_cast<INMOST_DATA_ENUM_TYPE>(HighConn(*it).size());
for(int etypenum = ElementNum(NODE); etypenum < ElementNum(CELL); ++etypenum)
for(int etypenum = ElementNum(NODE); etypenum <= ElementNum(ESET); ++etypenum)
{
int q = 0;
for(element_set::iterator it = selems[etypenum].begin(); it != selems[etypenum].end(); it++)
......@@ -2885,6 +3100,21 @@ namespace INMOST
//TODO: 44 old
//std::sort(selems[etypenum].begin(),selems[etypenum].end());
}
stringstream ss;
ss << ro() << rank << ": to send: ";
ss << "nodes: " << selems[0].size() << " | ";
ss << "edge: " << selems[1].size() << " | ";
ss << "faces: " << selems[2].size() << " | ";
ss << "cells: " << selems[3].size() << " | ";
ss << "esets: " << selems[4].size() << endl;
ss << "esets: ";
for(element_set::iterator it = selems[4].begin(); it != selems[4].end(); it++)
{
ss << ElementSet(this,*it).GetName() << " ";
}
//cout << ss.str() << endl;
REPORT_STR("final number of elements");
REPORT_VAL("NODE",selems[0].size());
REPORT_VAL("EDGE",selems[1].size());
......@@ -3162,6 +3392,104 @@ namespace INMOST
if( !high_conn_nums.empty() ) MPI_Pack(&high_conn_nums[0],static_cast<INMOST_MPI_SIZE>(num_high) ,INMOST_MPI_DATA_INTEGER_TYPE,&buffer[0],static_cast<INMOST_MPI_SIZE>(buffer.size()),&position,comm);
buffer.resize(position);
}
/////////////////////////////////////////
// pack esets
{
std::vector<INMOST_DATA_ENUM_TYPE> low_conn_size(selems[4].size());
std::vector<INMOST_DATA_ENUM_TYPE> high_conn_size(selems[4].size()); // TODO - 3
std::vector<Storage::integer> low_conn_nums; // array composed elements : ElementType and position in array
int* high_conn_nums = new int[selems[4].size() * 3]; // array of indexes of children, sibling, parent. -1 if has't
INMOST_DATA_ENUM_TYPE num_high = 0;
position = static_cast<int>(buffer.size());
new_size = 0;
num = 0; k = 0;
int marked_for_data = 0, marked_shared = 0;
int names_buff_size = 0;
// Pack sequence:
// 1) all names of sets
// 2) low conn for sets (arr_pos + element_type)
// 3) high conn for sets (3 arr_pos: child, sibling, parent. -1 if has't)
// Compute names_buff_size
for(element_set::iterator it = selems[4].begin(); it != selems[4].end(); it++) names_buff_size += ElementSet(this,*it).GetName().size() + 1;
//cout << ro() << rank << ": Names buff size = " << names_buff_size << endl;
char* names_buff;
if (names_buff_size > 0) names_buff = new char[names_buff_size];
int names_buff_pos = 0;