/usr/lib/petscdir/3.4.2/include/sieve/Numbering.hh is in libpetsc3.4.2-dev 3.4.2.dfsg1-8.1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 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 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 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 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 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 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 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 762 763 764 765 766 767 768 769 770 771 772 | #ifndef included_ALE_Numbering_hh
#define included_ALE_Numbering_hh
#ifndef included_ALE_ParallelMapping_hh
#include <sieve/ParallelMapping.hh>
#endif
namespace ALE {
// We have a dichotomy between \emph{types}, describing the structure of objects,
// and \emph{concepts}, describing the role these objects play in the algorithm.
// Below we identify concepts with potential implementing types.
//
// Concept Type
// ------- ----
// Overlap Sifter
// Atlas ConstantSection, UniformSection
// Numbering UniformSection
// GlobalOrder UniformSection
//
// We will use factory types to create objects which satisfy a given concept.
template<typename Point_, typename Value_ = int, typename Alloc_ = malloc_allocator<Point_> >
class Numbering : public UniformSection<Point_, Value_, 1, Alloc_> {
public:
typedef UniformSection<Point_, Value_, 1, Alloc_> base_type;
typedef typename base_type::point_type point_type;
typedef typename base_type::value_type value_type;
typedef typename base_type::atlas_type atlas_type;
protected:
int _localSize;
int *_offsets;
std::map<int, point_type> _invOrder;
public:
Numbering(MPI_Comm comm, const int debug = 0) : UniformSection<Point_, Value_, 1, Alloc_>(comm, debug), _localSize(0) {
this->_offsets = new int[this->commSize()+1];
this->_offsets[0] = 0;
};
virtual ~Numbering() {
delete [] this->_offsets;
};
public: // Sizes
int getLocalSize() const {return this->_localSize;};
void setLocalSize(const int size) {this->_localSize = size;};
int getGlobalSize() const {return this->_offsets[this->commSize()];};
int getGlobalOffset(const int p) const {return this->_offsets[p];};
const int *getGlobalOffsets() const {return this->_offsets;};
void setGlobalOffsets(const int offsets[]) {
for(int p = 0; p <= this->commSize(); ++p) {
this->_offsets[p] = offsets[p];
}
};
public: // Indices
virtual int getIndex(const point_type& point) {
const value_type& idx = this->restrictPoint(point)[0];
if (idx >= 0) {
return idx;
}
return -(idx+1);
};
virtual void setIndex(const point_type& point, const int index) {this->updatePoint(point, &index);};
virtual bool isLocal(const point_type& point) {return this->restrictPoint(point)[0] >= 0;};
virtual bool isRemote(const point_type& point) {return this->restrictPoint(point)[0] < 0;};
point_type getPoint(const int& index) {return this->_invOrder[index];};
void setPoint(const int& index, const point_type& point) {this->_invOrder[index] = point;};
};
template<typename Point_, typename Value_ = ALE::Point>
class GlobalOrder : public UniformSection<Point_, Value_> {
public:
typedef UniformSection<Point_, Value_> base_type;
typedef typename base_type::point_type point_type;
typedef typename base_type::value_type value_type;
typedef typename base_type::atlas_type atlas_type;
protected:
int _localSize;
int *_offsets;
public:
GlobalOrder(MPI_Comm comm, const int debug = 0) : UniformSection<Point_, Value_>(comm, debug), _localSize(0) {
this->_offsets = new int[this->commSize()+1];
this->_offsets[0] = 0;
};
~GlobalOrder() {
delete [] this->_offsets;
};
public: // Sizes
int getLocalSize() const {return this->_localSize;};
void setLocalSize(const int size) {this->_localSize = size;};
int getGlobalSize() const {return this->_offsets[this->commSize()];};
int getGlobalOffset(const int p) const {return this->_offsets[p];};
const int *getGlobalOffsets() const {return this->_offsets;};
void setGlobalOffsets(const int offsets[]) {
for(int p = 0; p <= this->commSize(); ++p) {
this->_offsets[p] = offsets[p];
}
};
public: // Indices
virtual int getIndex(const point_type& p) {
const int idx = this->restrictPoint(p)[0].prefix;
if (idx >= 0) {
return idx;
}
return -(idx+1);
};
virtual void setIndex(const point_type& p, const int index) {
const value_type idx(index, this->restrictPoint(p)[0].index);
this->updatePoint(p, &idx);
};
virtual bool isLocal(const point_type& p) {return this->restrictPoint(p)[0].prefix >= 0;};
virtual bool isRemote(const point_type& p) {return this->restrictPoint(p)[0].prefix < 0;};
};
template<typename Bundle_, typename Value_ = int, typename Alloc_ = typename Bundle_::alloc_type>
class NumberingFactory : public ALE::ParallelObject {
public:
typedef Bundle_ bundle_type;
typedef Alloc_ alloc_type;
typedef Value_ value_type;
typedef typename bundle_type::sieve_type sieve_type;
typedef typename bundle_type::label_type label_type;
typedef typename bundle_type::point_type point_type;
typedef typename bundle_type::rank_type rank_type;
typedef typename bundle_type::send_overlap_type send_overlap_type;
typedef typename bundle_type::recv_overlap_type recv_overlap_type;
typedef Numbering<point_type, value_type, alloc_type> numbering_type;
typedef typename alloc_type::template rebind<value_type>::other value_alloc_type;
typedef std::map<bundle_type*, std::map<std::string, std::map<int, Obj<numbering_type> > > > numberings_type;
typedef GlobalOrder<point_type> order_type;
typedef typename order_type::value_type oValue_type;
typedef typename alloc_type::template rebind<oValue_type>::other oValue_alloc_type;
typedef std::map<bundle_type*, std::map<std::string, Obj<order_type> > > orders_type;
protected:
numberings_type _localNumberings;
numberings_type _numberings;
orders_type _localOrders;
orders_type _orders;
orders_type _ordersBC;
const value_type _unknownNumber;
const oValue_type _unknownOrder;
protected:
NumberingFactory(MPI_Comm comm, const int debug = 0) : ALE::ParallelObject(comm, debug), _unknownNumber(-1), _unknownOrder(-1, 0) {};
public:
~NumberingFactory() {};
public:
static const Obj<NumberingFactory>& singleton(MPI_Comm comm, const int debug, bool cleanup = false) {
static Obj<NumberingFactory> *_singleton = NULL;
if (cleanup) {
if (debug) {std::cout << "Destroying NumberingFactory" << std::endl;}
if (_singleton) {delete _singleton;}
_singleton = NULL;
} else if (_singleton == NULL) {
if (debug) {std::cout << "Creating new NumberingFactory" << std::endl;}
_singleton = new Obj<NumberingFactory>();
*_singleton = new NumberingFactory(comm, debug);
}
return *_singleton;
};
void clear() {
this->_localNumberings.clear();
this->_numberings.clear();
this->_localOrders.clear();
this->_orders.clear();
this->_ordersBC.clear();
};
public: // Dof ordering
template<typename Section_>
void orderPointNew(const Obj<Section_>& section, const Obj<sieve_type>& sieve, const typename Section_::point_type& point, value_type& offset, value_type& bcOffset, const Obj<send_overlap_type>& sendOverlap = NULL) {
const typename Section_::chart_type& chart = section->getChart();
int& idx = section->getIndex(point);
// If the point does not exist in the chart, throw an error
if (chart.count(point) == 0) {
throw ALE::Exception("Unknown point in ordering");
}
// If the point has not been ordered
if (idx == -1) {
// Recurse to its cover
const Obj<typename sieve_type::coneSequence>& cone = sieve->cone(point);
typename sieve_type::coneSequence::iterator end = cone->end();
for(typename sieve_type::coneSequence::iterator c_iter = cone->begin(); c_iter != end; ++c_iter) {
if (this->_debug > 1) {std::cout << " Recursing to " << *c_iter << std::endl;}
this->orderPoint(section, sieve, *c_iter, offset, bcOffset, sendOverlap);
}
const int dim = section->getFiberDimension(point);
const int cDim = section->getConstraintDimension(point);
const int fDim = dim - cDim;
// If the point has constrained variables
if (cDim) {
if (this->_debug > 1) {std::cout << " Ordering boundary point " << point << " at " << bcOffset << std::endl;}
section->setIndexBC(point, bcOffset);
bcOffset += cDim;
}
// If the point has free variables
if (fDim) {
bool number = true;
// Maybe use template specialization here
if (!sendOverlap.isNull() && sendOverlap->capContains(point)) {
const Obj<typename send_overlap_type::supportSequence>& ranks = sendOverlap->support(point);
for(typename send_overlap_type::supportSequence::iterator r_iter = ranks->begin(); r_iter != ranks->end(); ++r_iter) {
if (this->commRank() > *r_iter) {
number = false;
break;
}
}
}
if (number) {
if (this->_debug > 1) {std::cout << " Ordering point " << point << " at " << offset << std::endl;}
section->setIndex(point, offset);
offset += dim;
} else {
if (this->_debug > 1) {std::cout << " Ignoring ghost point " << point << std::endl;}
}
}
}
}
template<typename Section_>
void orderPoint(const Obj<Section_>& section, const Obj<sieve_type>& sieve, const typename Section_::point_type& point, value_type& offset, value_type& bcOffset, const Obj<send_overlap_type>& sendOverlap = NULL) {
const Obj<typename Section_::atlas_type>& atlas = section->getAtlas();
const Obj<typename sieve_type::coneSequence>& cone = sieve->cone(point);
typename sieve_type::coneSequence::iterator end = cone->end();
typename Section_::index_type idx = section->getAtlas()->restrictPoint(point)[0];
const value_type& dim = idx.prefix;
const typename Section_::index_type defaultIdx(0, -1);
if (atlas->getChart().count(point) == 0) {
idx = defaultIdx;
}
if (idx.index == -1) {
for(typename sieve_type::coneSequence::iterator c_iter = cone->begin(); c_iter != end; ++c_iter) {
if (this->_debug > 1) {std::cout << " Recursing to " << *c_iter << std::endl;}
this->orderPoint(section, sieve, *c_iter, offset, bcOffset, sendOverlap);
}
if (dim > 0) {
bool number = true;
// Maybe use template specialization here
if (!sendOverlap.isNull() && sendOverlap->capContains(point)) {
const Obj<typename send_overlap_type::supportSequence>& ranks = sendOverlap->support(point);
for(typename send_overlap_type::supportSequence::iterator r_iter = ranks->begin(); r_iter != ranks->end(); ++r_iter) {
if (this->commRank() > *r_iter) {
number = false;
break;
}
}
}
if (number) {
if (this->_debug > 1) {std::cout << " Ordering point " << point << " at " << offset << std::endl;}
idx.index = offset;
atlas->updatePoint(point, &idx);
offset += dim;
} else {
if (this->_debug > 1) {std::cout << " Ignoring ghost point " << point << std::endl;}
}
} else if (dim < 0) {
if (this->_debug > 1) {std::cout << " Ordering boundary point " << point << " at " << bcOffset << std::endl;}
idx.index = bcOffset;
atlas->updatePoint(point, &idx);
bcOffset += dim;
}
}
}
template<typename Section_>
void orderPatch(const Obj<Section_>& section, const Obj<sieve_type>& sieve, const Obj<send_overlap_type>& sendOverlap = NULL, const value_type offset = 0, const value_type bcOffset = -2) {
const typename Section_::chart_type& chart = section->getChart();
int off = offset;
int bcOff = bcOffset;
if (this->_debug > 1) {std::cout << "Ordering patch" << std::endl;}
for(typename Section_::chart_type::const_iterator p_iter = chart.begin(); p_iter != chart.end(); ++p_iter) {
if (this->_debug > 1) {std::cout << "Ordering closure of point " << *p_iter << std::endl;}
this->orderPoint(section, sieve, *p_iter, off, bcOff, sendOverlap);
}
for(typename Section_::chart_type::const_iterator p_iter = chart.begin(); p_iter != chart.end(); ++p_iter) {
const int& idx = section->getIndex(*p_iter);
if (idx < 0) {
if (this->_debug > 1) {std::cout << "Correcting boundary offset of point " << *p_iter << std::endl;}
section->setIndex(*p_iter, off - (idx + 2));
}
}
}
public: // Numbering
// Number all local points
// points in the overlap are only numbered by the owner with the lowest rank
template<typename Iterator_>
void constructLocalNumbering(const Obj<numbering_type>& numbering, const Obj<send_overlap_type>& sendOverlap, const Iterator_& pointsBegin, const Iterator_& pointsEnd) {
const int debug = sendOverlap->debug();
int localSize = 0;
if (debug) {std::cout << "["<<numbering->commRank()<<"] Constructing local numbering" << std::endl;}
for(Iterator_ l_iter = pointsBegin; l_iter != pointsEnd; ++l_iter) {
numbering->setFiberDimension(*l_iter, 1);
}
for(Iterator_ l_iter = pointsBegin; l_iter != pointsEnd; ++l_iter) {
value_type val;
if (debug) {std::cout << "["<<numbering->commRank()<<"] Checking point " << *l_iter << std::endl;}
if (sendOverlap->capContains(*l_iter)) {
const Obj<typename send_overlap_type::supportSequence>& sendRanks = sendOverlap->support(*l_iter);
int minRank = sendOverlap->commSize();
for(typename send_overlap_type::supportSequence::iterator p_iter = sendRanks->begin(); p_iter != sendRanks->end(); ++p_iter) {
if (*p_iter < minRank) minRank = *p_iter;
}
if (minRank < sendOverlap->commRank()) {
if (debug) {std::cout << "["<<numbering->commRank()<<"] remote point, on proc " << minRank << std::endl;}
val = this->_unknownNumber;
} else {
if (debug) {std::cout << "["<<numbering->commRank()<<"] local point" << std::endl;}
val = localSize++;
}
} else {
if (debug) {std::cout << "["<<numbering->commRank()<<"] local point" << std::endl;}
val = localSize++;
}
if (debug) {std::cout << "["<<numbering->commRank()<<"] has number " << val << std::endl;}
numbering->updatePoint(*l_iter, &val);
}
if (debug) {std::cout << "["<<numbering->commRank()<<"] local points" << std::endl;}
numbering->setLocalSize(localSize);
}
// Order all local points
// points in the overlap are only ordered by the owner with the lowest rank
template<typename Iterator_, typename Section_>
void constructLocalOrder(const Obj<order_type>& order, const Obj<send_overlap_type>& sendOverlap, const Iterator_& pointsBegin, const Iterator_& pointsEnd, const Obj<Section_>& section, const int space = -1, const bool withBC = false, const Obj<label_type>& label = NULL) {
const int debug = sendOverlap->debug();
int localSize = 0;
if (debug) {std::cout << "["<<order->commRank()<<"] Constructing local ordering" << std::endl;}
for(Iterator_ l_iter = pointsBegin; l_iter != pointsEnd; ++l_iter) {
order->setFiberDimension(*l_iter, 1);
}
for(Iterator_ l_iter = pointsBegin; l_iter != pointsEnd; ++l_iter) {
oValue_type val;
if (debug) {std::cout << "["<<order->commRank()<<"] Checking point " << *l_iter << std::endl;}
if (sendOverlap->capContains(*l_iter)) {
const Obj<typename send_overlap_type::supportSequence>& sendPatches = sendOverlap->support(*l_iter);
int minRank = sendOverlap->commSize();
for(typename send_overlap_type::supportSequence::iterator p_iter = sendPatches->begin(); p_iter != sendPatches->end(); ++p_iter) {
if (*p_iter < minRank) minRank = *p_iter;
}
bool remotePoint = (minRank < sendOverlap->commRank()) || (!label.isNull() && (label->cone(*l_iter)->size() > 0));
if (remotePoint) {
if (debug) {std::cout << "["<<order->commRank()<<"] remote point, on proc " << minRank << std::endl;}
val = this->_unknownOrder;
} else {
if (debug) {std::cout << "["<<order->commRank()<<"] local point" << std::endl;}
val.prefix = localSize;
if (withBC) {
val.index = space < 0 ? section->getFiberDimension(*l_iter) : section->getFiberDimension(*l_iter, space);
} else {
val.index = space < 0 ? section->getConstrainedFiberDimension(*l_iter) : section->getConstrainedFiberDimension(*l_iter, space);
}
}
} else {
if (debug) {std::cout << "["<<order->commRank()<<"] local point" << std::endl;}
val.prefix = localSize;
if (withBC) {
val.index = space < 0 ? section->getFiberDimension(*l_iter) : section->getFiberDimension(*l_iter, space);
} else {
val.index = space < 0 ? section->getConstrainedFiberDimension(*l_iter) : section->getConstrainedFiberDimension(*l_iter, space);
}
}
if (debug) {std::cout << "["<<order->commRank()<<"] has offset " << val.prefix << " and size " << val.index << std::endl;}
localSize += val.index;
order->updatePoint(*l_iter, &val);
}
if (debug) {std::cout << "["<<order->commRank()<<"] local size" << localSize << std::endl;}
order->setLocalSize(localSize);
}
// Calculate process offsets
template<typename Numbering>
void calculateOffsets(const Obj<Numbering>& numbering) {
int localSize = numbering->getLocalSize();
int *offsets = new int[numbering->commSize()+1];
offsets[0] = 0;
MPI_Allgather(&localSize, 1, MPI_INT, &(offsets[1]), 1, MPI_INT, numbering->comm());
for(int p = 2; p <= numbering->commSize(); p++) {
offsets[p] += offsets[p-1];
}
numbering->setGlobalOffsets(offsets);
delete [] offsets;
}
// Update local offsets based upon process offsets
template<typename Numbering, typename Iterator>
void updateOrder(const Obj<Numbering>& numbering, const Iterator& pointsBegin, const Iterator& pointsEnd) {
const typename Numbering::value_type val = numbering->getGlobalOffset(numbering->commRank());
for(Iterator l_iter = pointsBegin; l_iter != pointsEnd; ++l_iter) {
if (numbering->isLocal(*l_iter)) {
numbering->updateAddPoint(*l_iter, &val);
}
}
}
// Communicate numbers in the overlap
void completeNumbering(const Obj<numbering_type>& numbering, const Obj<send_overlap_type>& sendOverlap, const Obj<recv_overlap_type>& recvOverlap, bool allowDuplicates = false) {
#if 1
typedef ALE::UniformSection<ALE::Pair<int, typename send_overlap_type::source_type>, typename numbering_type::value_type> OverlapSection;
typedef typename OverlapSection::point_type overlap_point_type;
Obj<OverlapSection> overlapSection = new OverlapSection(numbering->comm(), numbering->debug());
const int debug = sendOverlap->debug();
if (debug) {std::cout << "["<<numbering->commRank()<<"] Completing numbering" << std::endl;}
ALE::Pullback::SimpleCopy::copy(sendOverlap, recvOverlap, numbering, overlapSection);
if (debug) {overlapSection->view("Overlap Section");}
const typename recv_overlap_type::capSequence::iterator rBegin = recvOverlap->capBegin();
const typename recv_overlap_type::capSequence::iterator rEnd = recvOverlap->capEnd();
for(typename recv_overlap_type::capSequence::iterator r_iter = rBegin; r_iter != rEnd; ++r_iter) {
const int rank = *r_iter;
const typename recv_overlap_type::supportSequence::iterator pBegin = recvOverlap->supportBegin(*r_iter);
const typename recv_overlap_type::supportSequence::iterator pEnd = recvOverlap->supportEnd(*r_iter);
for(typename recv_overlap_type::supportSequence::iterator p_iter = pBegin; p_iter != pEnd; ++p_iter) {
const point_type& localPoint = *p_iter;
const point_type& remotePoint = p_iter.color();
const overlap_point_type oPoint = overlap_point_type(rank, remotePoint);
const int fDim = overlapSection->getFiberDimension(oPoint);
const typename numbering_type::value_type *values = overlapSection->restrictPoint(oPoint);
for(int i = 0; i < fDim; ++i) {
if (debug) {std::cout << "["<<numbering->commRank()<<"] local point " << localPoint << " remote point " << remotePoint << " number " << values[i] << std::endl;}
if (values[i] >= 0) {
if (numbering->isLocal(localPoint) && !allowDuplicates) {
ostringstream msg;
msg << "["<<numbering->commRank()<<"]Multiple indices for local point " << localPoint << " remote point " << remotePoint << " from " << rank << " with index " << values[i];
throw ALE::Exception(msg.str().c_str());
}
if (!numbering->hasPoint(localPoint)) {
ostringstream msg;
msg << "["<<numbering->commRank()<<"]Unexpected local point " << localPoint << " remote point " << remotePoint << " from " << rank << " with index " << values[i];
throw ALE::Exception(msg.str().c_str());
}
int val = -(values[i]+1);
numbering->updatePoint(localPoint, &val);
}
}
}
}
#else
typedef Field<send_overlap_type, int, Section<point_type, value_type, value_alloc_type> > send_section_type;
typedef Field<recv_overlap_type, int, Section<point_type, value_type, value_alloc_type> > recv_section_type;
typedef typename ALE::DiscreteSieve<point_type, alloc_type> dsieve_type;
typedef typename ALE::Topology<int, dsieve_type, alloc_type> dtopology_type;
typedef typename ALE::New::SectionCompletion<dtopology_type, int, alloc_type> completion;
const Obj<send_section_type> sendSection = new send_section_type(numbering->comm(), this->debug());
const Obj<recv_section_type> recvSection = new recv_section_type(numbering->comm(), sendSection->getTag(), this->debug());
const int debug = sendOverlap->debug();
if (debug) {std::cout << "["<<numbering->commRank()<<"] Completing numbering" << std::endl;}
completion::completeSection(sendOverlap, recvOverlap, numbering->getAtlas(), numbering, sendSection, recvSection);
const Obj<typename recv_overlap_type::baseSequence> rPoints = recvOverlap->base();
for(typename recv_overlap_type::baseSequence::iterator p_iter = rPoints->begin(); p_iter != rPoints->end(); ++p_iter) {
const Obj<typename recv_overlap_type::coneSequence>& ranks = recvOverlap->cone(*p_iter);
const typename recv_overlap_type::target_type& localPoint = *p_iter;
for(typename recv_overlap_type::coneSequence::iterator r_iter = ranks->begin(); r_iter != ranks->end(); ++r_iter) {
const typename recv_overlap_type::target_type& remotePoint = r_iter.color();
const int rank = *r_iter;
const Obj<typename recv_section_type::section_type>& section = recvSection->getSection(rank);
const typename recv_section_type::value_type *values = section->restrictPoint(remotePoint);
if (section->getFiberDimension(remotePoint) == 0) continue;
if (debug) {std::cout << "["<<numbering->commRank()<<"] local point " << localPoint << " remote point " << remotePoint << " number " << values[0] << std::endl;}
if (values[0] >= 0) {
if (debug) {std::cout << "["<<numbering->commRank()<<"] local point " << localPoint << " dim " << numbering->getAtlas()->getFiberDimension(localPoint) << std::endl;}
if (numbering->isLocal(localPoint) && !allowDuplicates) {
ostringstream msg;
msg << "["<<numbering->commRank()<<"]Multiple indices for local point " << localPoint << " remote point " << remotePoint << " from " << rank << " with index " << values[0];
throw ALE::Exception(msg.str().c_str());
}
if (numbering->getAtlas()->getFiberDimension(localPoint) == 0) {
ostringstream msg;
msg << "["<<numbering->commRank()<<"]Unexpected local point " << localPoint << " remote point " << remotePoint << " from " << rank << " with index " << values[0];
throw ALE::Exception(msg.str().c_str());
}
int val = -(values[0]+1);
numbering->updatePoint(localPoint, &val);
}
}
}
#endif
}
// Communicate (size,offset)s in the overlap
void completeOrder(const Obj<order_type>& order, const Obj<send_overlap_type>& sendOverlap, const Obj<recv_overlap_type>& recvOverlap, bool allowDuplicates = false) {
#if 1
typedef ALE::UniformSection<ALE::Pair<int, typename send_overlap_type::source_type>, typename order_type::value_type> OverlapSection;
typedef typename OverlapSection::point_type overlap_point_type;
Obj<OverlapSection> overlapSection = new OverlapSection(order->comm(), order->debug());
const int debug = sendOverlap->debug();
if (debug) {std::cout << "["<<order->commRank()<<"] Completing ordering" << std::endl;}
ALE::Pullback::SimpleCopy::copy(sendOverlap, recvOverlap, order, overlapSection);
if (debug) {overlapSection->view("Overlap Section");}
const typename recv_overlap_type::capSequence::iterator rBegin = recvOverlap->capBegin();
const typename recv_overlap_type::capSequence::iterator rEnd = recvOverlap->capEnd();
for(typename recv_overlap_type::capSequence::iterator r_iter = rBegin; r_iter != rEnd; ++r_iter) {
const int rank = *r_iter;
const typename recv_overlap_type::supportSequence::iterator pBegin = recvOverlap->supportBegin(*r_iter);
const typename recv_overlap_type::supportSequence::iterator pEnd = recvOverlap->supportEnd(*r_iter);
for(typename recv_overlap_type::supportSequence::iterator p_iter = pBegin; p_iter != pEnd; ++p_iter) {
const point_type& localPoint = *p_iter;
const point_type& remotePoint = p_iter.color();
const overlap_point_type oPoint = overlap_point_type(rank, remotePoint);
const int fDim = overlapSection->getFiberDimension(oPoint);
const typename order_type::value_type *values = overlapSection->restrictPoint(oPoint);
for(int i = 0; i < fDim; ++i) {
if (debug) {std::cout << "["<<order->commRank()<<"] local point " << localPoint << " remote point " << remotePoint<<"("<<rank<<")" << " offset " << values[i].prefix << " and size " << values[i].index << std::endl;}
if (values[i].index == 0) continue;
if (values[i].prefix >= 0) {
if (order->isLocal(localPoint)) {
if (!allowDuplicates) {
ostringstream msg;
msg << "["<<order->commRank()<<"]Multiple indices for local point " << localPoint << " remote point " << remotePoint << " from " << rank << " with index " << values[i];
throw ALE::Exception(msg.str().c_str());
}
continue;
}
const oValue_type val(-(values[i].prefix+1), values[i].index);
order->updatePoint(localPoint, &val);
} else {
if (order->isLocal(localPoint)) continue;
order->updatePoint(localPoint, &values[i]);
}
}
}
}
#else
typedef Field<send_overlap_type, int, Section<point_type, oValue_type, oValue_alloc_type> > send_section_type;
typedef Field<recv_overlap_type, int, Section<point_type, oValue_type, oValue_alloc_type> > recv_section_type;
typedef ConstantSection<point_type, int, alloc_type> constant_sizer;
typedef typename ALE::DiscreteSieve<point_type, alloc_type> dsieve_type;
typedef typename ALE::Topology<int, dsieve_type, alloc_type> dtopology_type;
typedef typename ALE::New::SectionCompletion<dtopology_type, int, alloc_type> completion;
const Obj<send_section_type> sendSection = new send_section_type(order->comm(), this->debug());
const Obj<recv_section_type> recvSection = new recv_section_type(order->comm(), sendSection->getTag(), this->debug());
const int debug = sendOverlap->debug();
if (debug) {std::cout << "["<<order->commRank()<<"] Completing ordering" << std::endl;}
completion::completeSection(sendOverlap, recvOverlap, order->getAtlas(), order, sendSection, recvSection);
Obj<typename recv_overlap_type::baseSequence> recvPoints = recvOverlap->base();
for(typename recv_overlap_type::baseSequence::iterator p_iter = recvPoints->begin(); p_iter != recvPoints->end(); ++p_iter) {
if (!order->hasPoint(*p_iter)) {
order->setFiberDimension(*p_iter, 1);
order->updatePoint(*p_iter, &this->_unknownOrder);
}
}
for(typename recv_overlap_type::baseSequence::iterator p_iter = recvPoints->begin(); p_iter != recvPoints->end(); ++p_iter) {
const Obj<typename recv_overlap_type::coneSequence>& ranks = recvOverlap->cone(*p_iter);
const typename recv_overlap_type::target_type& localPoint = *p_iter;
for(typename recv_overlap_type::coneSequence::iterator r_iter = ranks->begin(); r_iter != ranks->end(); ++r_iter) {
const typename recv_overlap_type::target_type& remotePoint = r_iter.color();
const int rank = *r_iter;
const Obj<typename recv_section_type::section_type>& section = recvSection->getSection(rank);
const typename recv_section_type::value_type *values = section->restrictPoint(remotePoint);
if (section->getFiberDimension(remotePoint) == 0) continue;
if (debug) {std::cout << "["<<order->commRank()<<"] local point " << localPoint << " remote point " << remotePoint<<"("<<rank<<")" << " offset " << values[0].prefix << " and size " << values[0].index << std::endl;}
if (values[0].index == 0) continue;
if (values[0].prefix >= 0) {
if (order->isLocal(localPoint)) {
if (!allowDuplicates) {
ostringstream msg;
msg << "["<<order->commRank()<<"]Multiple indices for local point " << localPoint << " remote point " << remotePoint << " from " << rank << " with index " << values[0];
throw ALE::Exception(msg.str().c_str());
}
continue;
}
const oValue_type val(-(values[0].prefix+1), values[0].index);
order->updatePoint(localPoint, &val);
} else {
if (order->isLocal(localPoint)) continue;
order->updatePoint(localPoint, values);
}
}
}
#endif
}
// Construct a full global numbering
template<typename Iterator>
void constructNumbering(const Obj<numbering_type>& numbering, const Obj<send_overlap_type>& sendOverlap, const Obj<recv_overlap_type>& recvOverlap, const Iterator& pointsBegin, const Iterator& pointsEnd) {
this->constructLocalNumbering(numbering, sendOverlap, pointsBegin, pointsEnd);
this->calculateOffsets(numbering);
this->updateOrder(numbering, pointsBegin, pointsEnd);
this->completeNumbering(numbering, sendOverlap, recvOverlap);
}
// Construct a full global order
template<typename Iterator, typename Section>
void constructOrder(const Obj<order_type>& order, const Obj<send_overlap_type>& sendOverlap, const Obj<recv_overlap_type>& recvOverlap, const Iterator& pointsBegin, const Iterator& pointsEnd, const Obj<Section>& section, const int space = -1, const Obj<label_type>& label = NULL) {
this->constructLocalOrder(order, sendOverlap, pointsBegin, pointsEnd, section, space, false, label);
this->calculateOffsets(order);
this->updateOrder(order, pointsBegin, pointsEnd);
this->completeOrder(order, sendOverlap, recvOverlap);
}
template<typename Iterator, typename Section>
void constructOrderBC(const Obj<order_type>& order, const Obj<send_overlap_type>& sendOverlap, const Obj<recv_overlap_type>& recvOverlap, const Iterator& pointsBegin, const Iterator& pointsEnd, const Obj<Section>& section, const int space = -1, const Obj<label_type>& label = NULL) {
this->constructLocalOrder(order, sendOverlap, pointsBegin, pointsEnd, section, space, true, label);
this->calculateOffsets(order);
this->updateOrder(order, pointsBegin, pointsEnd);
this->completeOrder(order, sendOverlap, recvOverlap);
}
public:
// Construct the inverse map from numbers to points
// If we really need this, then we should consider using a label
void constructInverseOrder(const Obj<numbering_type>& numbering) {
const typename numbering_type::chart_type& chart = numbering->getChart();
for(typename numbering_type::chart_type::iterator p_iter = chart.begin(); p_iter != chart.end(); ++p_iter) {
numbering->setPoint(numbering->getIndex(*p_iter), *p_iter);
}
}
public: // Real interface
template<typename ABundle_>
const Obj<numbering_type>& getLocalNumbering(const Obj<ABundle_>& bundle, const int depth) {
if ((this->_localNumberings.find(bundle.ptr()) == this->_localNumberings.end()) ||
(this->_localNumberings[bundle.ptr()].find("depth") == this->_localNumberings[bundle.ptr()].end()) ||
(this->_localNumberings[bundle.ptr()]["depth"].find(depth) == this->_localNumberings[bundle.ptr()]["depth"].end())) {
Obj<numbering_type> numbering = new numbering_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = new send_overlap_type(bundle->comm(), bundle->debug());
this->constructLocalNumbering(numbering, sendOverlap, bundle->depthStratum(depth)->begin(), bundle->depthStratum(depth)->end());
if (this->_debug) {std::cout << "Creating new local numbering: ptr " << bundle.ptr() << " depth " << depth << std::endl;}
this->_localNumberings[bundle.ptr()]["depth"][depth] = numbering;
} else {
if (this->_debug) {std::cout << "Using old local numbering: ptr " << bundle.ptr() << " depth " << depth << std::endl;}
}
return this->_localNumberings[bundle.ptr()]["depth"][depth];
}
template<typename ABundle_>
const Obj<numbering_type>& getNumbering(const Obj<ABundle_>& bundle, const int depth) {
if ((this->_numberings.find(bundle.ptr()) == this->_numberings.end()) ||
(this->_numberings[bundle.ptr()].find("depth") == this->_numberings[bundle.ptr()].end()) ||
(this->_numberings[bundle.ptr()]["depth"].find(depth) == this->_numberings[bundle.ptr()]["depth"].end())) {
bundle->constructOverlap();
Obj<numbering_type> numbering = new numbering_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new numbering: fixed depth value " << depth << std::endl;}
if (depth == -1) {
this->constructNumbering(numbering, sendOverlap, recvOverlap, bundle->getSieve()->getChart().begin(), bundle->getSieve()->getChart().end());
} else {
this->constructNumbering(numbering, sendOverlap, recvOverlap, bundle->depthStratum(depth)->begin(), bundle->depthStratum(depth)->end());
}
this->_numberings[bundle.ptr()]["depth"][depth] = numbering;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old numbering: fixed depth value " << depth << std::endl;}
}
return this->_numberings[bundle.ptr()]["depth"][depth];
}
template<typename ABundle_>
const Obj<numbering_type>& getNumbering(const Obj<ABundle_>& bundle, const std::string& labelname, const int value) {
if ((this->_numberings.find(bundle.ptr()) == this->_numberings.end()) ||
(this->_numberings[bundle.ptr()].find(labelname) == this->_numberings[bundle.ptr()].end()) ||
(this->_numberings[bundle.ptr()][labelname].find(value) == this->_numberings[bundle.ptr()][labelname].end())) {
bundle->constructOverlap();
Obj<numbering_type> numbering = new numbering_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new numbering: " << labelname << " value " << value << std::endl;}
this->constructNumbering(numbering, sendOverlap, recvOverlap, bundle->getLabelStratum(labelname, value)->begin(), bundle->getLabelStratum(labelname, value)->end());
this->_numberings[bundle.ptr()][labelname][value] = numbering;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old numbering: " << labelname << " value " << value << std::endl;}
}
return this->_numberings[bundle.ptr()][labelname][value];
}
template<typename ABundle_, typename Section_>
const Obj<order_type>& getLocalOrder(const Obj<ABundle_>& bundle, const std::string& name, const Obj<Section_>& section, const int space = -1, const Obj<label_type>& label = NULL) {
if ((this->_localOrders.find(bundle.ptr()) == this->_localOrders.end()) ||
(this->_localOrders[bundle.ptr()].find(name) == this->_localOrders[bundle.ptr()].end())) {
Obj<order_type> order = new order_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new local order: " << name << std::endl;}
this->constructLocalOrder(order, sendOverlap, section->getChart().begin(), section->getChart().end(), section, space, false, label);
this->_localOrders[bundle.ptr()][name] = order;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old local order: " << name << std::endl;}
}
return this->_localOrders[bundle.ptr()][name];
}
template<typename ABundle_, typename Section_>
const Obj<order_type>& getGlobalOrder(const Obj<ABundle_>& bundle, const std::string& name, const Obj<Section_>& section, const int space = -1, const Obj<label_type>& label = NULL) {
if ((this->_orders.find(bundle.ptr()) == this->_orders.end()) ||
(this->_orders[bundle.ptr()].find(name) == this->_orders[bundle.ptr()].end())) {
bundle->constructOverlap();
Obj<order_type> order = new order_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new global order: " << name << std::endl;}
this->constructOrder(order, sendOverlap, recvOverlap, section->getChart().begin(), section->getChart().end(), section, space, label);
this->_orders[bundle.ptr()][name] = order;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old global order: " << name << std::endl;}
}
return this->_orders[bundle.ptr()][name];
}
template<typename ABundle_, typename Iterator_, typename Section_>
const Obj<order_type>& getGlobalOrder(const Obj<ABundle_>& bundle, const std::string& name, const Iterator_& pointsBegin, const Iterator_& pointsEnd, const Obj<Section_>& section, const int space = -1, const Obj<label_type>& label = NULL) {
if ((this->_orders.find(bundle.ptr()) == this->_orders.end()) ||
(this->_orders[bundle.ptr()].find(name) == this->_orders[bundle.ptr()].end())) {
bundle->constructOverlap();
Obj<order_type> order = new order_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new global order: " << name << std::endl;}
this->constructOrder(order, sendOverlap, recvOverlap, pointsBegin, pointsEnd, section, space, label);
this->_orders[bundle.ptr()][name] = order;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old global order: " << name << std::endl;}
}
return this->_orders[bundle.ptr()][name];
}
template<typename ABundle_, typename Section_>
const Obj<order_type>& getGlobalOrderWithBC(const Obj<ABundle_>& bundle, const std::string& name, const Obj<Section_>& section, const int space = -1, const Obj<label_type>& label = NULL) {
if ((this->_orders.find(bundle.ptr()) == this->_orders.end()) ||
(this->_orders[bundle.ptr()].find(name) == this->_orders[bundle.ptr()].end())) {
bundle->constructOverlap();
Obj<order_type> order = new order_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new global order: " << name << std::endl;}
this->constructOrderBC(order, sendOverlap, recvOverlap, section->getChart().begin(), section->getChart().end(), section, space, label);
this->_orders[bundle.ptr()][name] = order;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old global order: " << name << std::endl;}
}
return this->_orders[bundle.ptr()][name];
}
template<typename ABundle_, typename Iterator_, typename Section_>
const Obj<order_type>& getGlobalOrderWithBC(const Obj<ABundle_>& bundle, const std::string& name, const Iterator_& pointsBegin, const Iterator_& pointsEnd, const Obj<Section_>& section, const int space = -1, const Obj<label_type>& label = NULL) {
if ((this->_ordersBC.find(bundle.ptr()) == this->_ordersBC.end()) ||
(this->_ordersBC[bundle.ptr()].find(name) == this->_ordersBC[bundle.ptr()].end())) {
bundle->constructOverlap();
Obj<order_type> order = new order_type(bundle->comm(), bundle->debug());
Obj<send_overlap_type> sendOverlap = bundle->getSendOverlap();
Obj<recv_overlap_type> recvOverlap = bundle->getRecvOverlap();
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Creating new global order: " << name << std::endl;}
this->constructOrderBC(order, sendOverlap, recvOverlap, pointsBegin, pointsEnd, section, space, label);
this->_orders[bundle.ptr()][name] = order;
} else {
if (this->_debug) {std::cout << "["<<bundle->commRank()<<"]Using old global order: " << name << std::endl;}
}
return this->_orders[bundle.ptr()][name];
}
template<typename ABundle_>
void setGlobalOrder(const Obj<ABundle_>& bundle, const std::string& name, const Obj<order_type>& order) {
this->_orders[bundle.ptr()][name] = order;
}
};
}
#endif
|