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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkDistributedGraphHelper.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*
* Copyright (C) 2008 The Trustees of Indiana University.
* Use, modification and distribution is subject to the Boost Software
* License, Version 1.0. (See http://www.boost.org/LICENSE_1_0.txt)
*/
// .NAME vtkDistributedGraphHelper.cxx - distributed graph helper for vtkGraph
//
// .SECTION Description
// Attach a subclass of this helper to a vtkGraph to turn it into a distributed graph
#include "vtkDistributedGraphHelper.h"
#include "vtkGraph.h"
#include "vtkInformation.h"
#include "vtkInformationIntegerKey.h"
#include "vtkStdString.h"
#include "vtkVariant.h"
#include <climits> // CHAR_BIT
#include <cassert> // assert()
vtkInformationKeyMacro(vtkDistributedGraphHelper, DISTRIBUTEDVERTEXIDS, Integer);
vtkInformationKeyMacro(vtkDistributedGraphHelper, DISTRIBUTEDEDGEIDS, Integer);
//----------------------------------------------------------------------------
// class vtkDistributedGraphHelper
//----------------------------------------------------------------------------
//----------------------------------------------------------------------------
void vtkDistributedGraphHelper::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
int numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
int myRank
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_PIECE_NUMBER());
os << indent << "Processor: " << myRank << " of " << numProcs << endl;
}
//----------------------------------------------------------------------------
vtkDistributedGraphHelper::vtkDistributedGraphHelper()
{
this->Graph = 0;
this->VertexDistribution = 0;
}
//----------------------------------------------------------------------------
vtkDistributedGraphHelper::~vtkDistributedGraphHelper()
{
}
//----------------------------------------------------------------------------
vtkIdType vtkDistributedGraphHelper::GetVertexOwner(vtkIdType v) const
{
vtkIdType owner = v;
int numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
if (numProcs > 1)
{
// An alternative to this obfuscated code is to provide
// an 'unsigned' equivalent to vtkIdType. Could then safely
// do a logical right-shift of bits, e.g.:
// owner = (vtkIdTypeUnsigned) v >> this->indexBits;
if (v & this->signBitMask)
{
owner ^= this->signBitMask; // remove sign bit
vtkIdType tmp = owner >> this->indexBits; // so can right-shift
owner = tmp | this->highBitShiftMask; // and append sign bit back
}
else
{
owner = v >> this->indexBits;
}
}
else // numProcs = 1
{
owner = 0;
}
return owner;
}
//----------------------------------------------------------------------------
vtkIdType vtkDistributedGraphHelper::GetVertexIndex(vtkIdType v) const
{
vtkIdType index = v;
int numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
if (numProcs > 1)
{
// Shift off the Owner bits. (Would a mask be faster?)
index = (v << this->procBits) >> this->procBits;
}
return index;
}
//----------------------------------------------------------------------------
vtkIdType vtkDistributedGraphHelper::GetEdgeOwner(vtkIdType e_id) const
{
vtkIdType owner = e_id;
int numProcs =
this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
if (numProcs > 1)
{
if (e_id & this->signBitMask)
{
owner ^= this->signBitMask; // remove sign bit
vtkIdType tmp = owner >> this->indexBits; // so can right-shift
owner = tmp | this->highBitShiftMask; // and append sign bit back
}
else
{
owner = e_id >> this->indexBits;
}
}
else // numProcs = 1
{
owner = 0;
}
return owner;
}
//----------------------------------------------------------------------------
vtkIdType vtkDistributedGraphHelper::GetEdgeIndex(vtkIdType e_id) const
{
vtkIdType index = e_id;
int numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
if (numProcs > 1)
{
// Shift off the Owner bits. (Would a mask be faster?)
index = (e_id << this->procBits) >> this->procBits;
}
return index;
}
//----------------------------------------------------------------------------
vtkIdType vtkDistributedGraphHelper::MakeDistributedId(int owner, vtkIdType local)
{
int numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
if (numProcs > 1)
{
assert(owner >= 0 && owner < numProcs);
return (static_cast<vtkIdType>(owner) << this->indexBits) | local;
}
return local;
}
//----------------------------------------------------------------------------
void vtkDistributedGraphHelper::AttachToGraph(vtkGraph *graph)
{
this->Graph = graph;
// Some factors and masks to help speed up encoding/decoding {owner,index}
int numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
int tmp = numProcs - 1;
// The following is integer arith equiv of ceil(log2(numProcs)):
int numProcBits = 0;
while( tmp != 0 )
{
tmp >>= 1;
numProcBits++;
}
if (numProcs == 1) numProcBits = 1;
this->signBitMask = VTK_ID_MIN;
this->highBitShiftMask = static_cast<vtkIdType>(1) << numProcBits;
this->procBits = numProcBits + 1;
this->indexBits = (sizeof(vtkIdType) * CHAR_BIT) - (numProcBits + 1);
}
//----------------------------------------------------------------------------
void
vtkDistributedGraphHelper::
SetVertexPedigreeIdDistribution(vtkVertexPedigreeIdDistribution Func,
void *userData)
{
this->VertexDistribution = Func;
this->VertexDistributionUserData = userData;
}
//----------------------------------------------------------------------------
vtkIdType
vtkDistributedGraphHelper::
GetVertexOwnerByPedigreeId(const vtkVariant& pedigreeId)
{
vtkIdType numProcs
= this->Graph->GetInformation()->Get(vtkDataObject::DATA_NUMBER_OF_PIECES());
if (this->VertexDistribution)
{
return (this->VertexDistribution(pedigreeId,
this->VertexDistributionUserData)
% numProcs);
}
// Hash the variant in a very lame way.
double numericValue;
vtkStdString stringValue;
const unsigned char *charsStart, *charsEnd;
if (pedigreeId.IsNumeric())
{
// Convert every numeric value into a double.
numericValue = pedigreeId.ToDouble();
// Hash the characters in the double.
charsStart = reinterpret_cast<const unsigned char*>(&numericValue);
charsEnd = charsStart + sizeof(double);
}
else if (pedigreeId.GetType() == VTK_STRING)
{
stringValue = pedigreeId.ToString();
charsStart = reinterpret_cast<const unsigned char*>(stringValue.c_str());
charsEnd = charsStart + stringValue.size();
}
else
{
vtkErrorMacro("Cannot hash vertex pedigree ID of type "
<< pedigreeId.GetType());
return 0;
}
unsigned long hash = 5381;
for (; charsStart != charsEnd; ++charsStart)
{
hash = ((hash << 5) + hash) ^ *charsStart;
}
return hash % numProcs;
}
|