void IRInstruction::become(IRUnit& unit, IRInstruction* other) {
assert(other->isTransient() || m_numDsts == other->m_numDsts);
auto& arena = unit.arena();
// Copy all but m_id, m_edges[].from, m_listNode, m_marker, and don't clone
// dests---the whole point of become() is things still point to us.
if (hasEdges() && !other->hasEdges()) {
clearEdges();
} else if (!hasEdges() && other->hasEdges()) {
m_edges = new (arena) Edge[2];
setNext(other->next());
setTaken(other->taken());
}
m_op = other->m_op;
m_typeParam = other->m_typeParam;
m_numSrcs = other->m_numSrcs;
m_extra = other->m_extra ? cloneExtra(m_op, other->m_extra, arena) : nullptr;
m_srcs = new (arena) SSATmp*[m_numSrcs];
std::copy(other->m_srcs, other->m_srcs + m_numSrcs, m_srcs);
}
void TriangleSetTopologyContainer::createEdgeSetArray()
{
if(!hasTriangles()) // this method should only be called when triangles exist
{
#ifndef NDEBUG
sout << "Warning. [TriangleSetTopologyContainer::createEdgeSetArray] triangle array is empty." << sendl;
#endif
createTriangleSetArray();
}
if(hasEdges())
{
#ifndef NDEBUG
sout << "Warning. [TriangleSetTopologyContainer::createEdgeSetArray] edge array is not empty." << sendl;
#endif
// clear edges and all shells that depend on edges
EdgeSetTopologyContainer::clear();
if(hasEdgesInTriangle())
clearEdgesInTriangle();
if(hasTrianglesAroundEdge())
clearTrianglesAroundEdge();
}
// create a temporary map to find redundant edges
std::map<Edge, unsigned int> edgeMap;
helper::WriteAccessor< Data< sofa::helper::vector<Edge> > > m_edge = d_edge;
helper::ReadAccessor< Data< sofa::helper::vector<Triangle> > > m_triangle = d_triangle;
for (unsigned int i=0; i<m_triangle.size(); ++i)
{
const Triangle &t = m_triangle[i];
for(unsigned int j=0; j<3; ++j)
{
const unsigned int v1 = t[(j+1)%3];
const unsigned int v2 = t[(j+2)%3];
// sort vertices in lexicographic order
const Edge e = ((v1<v2) ? Edge(v1,v2) : Edge(v2,v1));
if(edgeMap.find(e) == edgeMap.end())
{
// edge not in edgeMap so create a new one
const unsigned int edgeIndex = (unsigned int)edgeMap.size();
edgeMap[e] = edgeIndex;
// m_edge.push_back(e); Changed to have oriented edges on the border of the triangulation
m_edge.push_back(Edge(v1,v2));
}
}
}
}
void IRInstruction::convertToNop() {
if (hasEdges()) clearEdges();
IRInstruction nop(Nop, marker());
// copy all but m_id, m_edges, m_listNode
m_op = nop.m_op;
m_typeParam = nop.m_typeParam;
m_numSrcs = nop.m_numSrcs;
m_srcs = nop.m_srcs;
m_numDsts = nop.m_numDsts;
m_dst = nop.m_dst;
m_extra = nullptr;
}
void TriangleSetTopologyContainer::createTrianglesAroundEdgeArray ()
{
if(!hasTriangles()) // this method should only be called when triangles exist
{
#ifndef NDEBUG
sout << "Warning. [TriangleSetTopologyContainer::createTrianglesAroundEdgeArray] triangle array is empty." << sendl;
#endif
createTriangleSetArray();
}
if(!hasEdges()) // this method should only be called when edges exist
{
#ifndef NDEBUG
sout << "Warning. [TriangleSetTopologyContainer::createTrianglesAroundEdgeArray] edge array is empty." << sendl;
#endif
createEdgeSetArray();
}
if(!hasEdgesInTriangle())
createEdgesInTriangleArray();
const unsigned int numTriangles = getNumberOfTriangles();
const unsigned int numEdges = getNumberOfEdges();
if(hasTrianglesAroundEdge())
{
clearTrianglesAroundEdge();
}
m_trianglesAroundEdge.resize( numEdges );
for (unsigned int i = 0; i < numTriangles; ++i)
{
// adding triangle i in the triangle shell of all edges
for (unsigned int j=0; j<3; ++j)
{
m_trianglesAroundEdge[ m_edgesInTriangle[i][j] ].push_back( i );
}
}
}
Block* findDefiningBlock(const SSATmp* t, const IdomVector& idoms) {
assertx(!t->inst()->is(DefConst));
auto const srcInst = t->inst();
if (srcInst->hasEdges()) {
auto const next = srcInst->next();
UNUSED auto const taken = srcInst->taken();
always_assert_flog(
next && taken,
"hasEdges instruction defining a dst had no edges:\n {}\n",
srcInst->toString()
);
for (const auto& arc : next->preds()) {
auto pred = arc.from();
if (pred != srcInst->block() && !dominates(next, pred, idoms)) {
return nullptr;
}
}
return next;
}
return srcInst->block();
}
void TriangleSetTopologyContainer::createEdgesInTriangleArray()
{
if(!hasTriangles()) // this method should only be called when triangles exist
{
#ifndef NDEBUG
sout << "Warning. [TriangleSetTopologyContainer::createEdgesInTriangleArray] triangle array is empty." << sendl;
#endif
createTriangleSetArray();
}
// this should never be called : remove existing triangle edges
if(hasEdgesInTriangle())
clearEdgesInTriangle();
helper::ReadAccessor< Data< sofa::helper::vector<Triangle> > > m_triangle = d_triangle;
if(!hasEdges()) // To optimize, this method should be called without creating edgesArray before.
{
#ifndef NDEBUG
sout << "Warning. [TriangleSetTopologyContainer::createEdgesInTriangleArray] edge array is empty." << sendl;
#endif
/// create edge array and triangle edge array at the same time
const unsigned int numTriangles = getNumberOfTriangles();
m_edgesInTriangle.resize(numTriangles);
// create a temporary map to find redundant edges
std::map<Edge, unsigned int> edgeMap;
helper::WriteAccessor< Data< sofa::helper::vector<Edge> > > m_edge = d_edge;
for (unsigned int i=0; i<m_triangle.size(); ++i)
{
const Triangle &t = m_triangle[i];
for(unsigned int j=0; j<3; ++j)
{
const unsigned int v1 = t[(j+1)%3];
const unsigned int v2 = t[(j+2)%3];
// sort vertices in lexicographic order
const Edge e = ((v1<v2) ? Edge(v1,v2) : Edge(v2,v1));
if(edgeMap.find(e) == edgeMap.end())
{
// edge not in edgeMap so create a new one
const unsigned int edgeIndex = (unsigned int)edgeMap.size();
/// add new edge
edgeMap[e] = edgeIndex;
// m_edge.push_back(e);
m_edge.push_back(Edge(v1,v2));
}
m_edgesInTriangle[i][j] = edgeMap[e];
}
}
}
else
{
/// there are already existing edges : must use an inefficient method. Parse all triangles and find the edge that match each triangle edge
helper::ReadAccessor< Data< sofa::helper::vector<Edge> > > m_edge = d_edge;
const unsigned int numTriangles = getNumberOfTriangles();
const unsigned int numEdges = getNumberOfEdges();
m_edgesInTriangle.resize(numTriangles);
/// create a multi map where the key is a vertex index and the content is the indices of edges adjacent to that vertex.
std::multimap<PointID, EdgeID> edgesAroundVertexMap;
std::multimap<PointID, EdgeID>::iterator it;
bool foundEdge;
for (unsigned int edge=0; edge<numEdges; ++edge) //Todo: check if not better using multimap <PointID ,TriangleID> and for each edge, push each triangle present in both shell
{
edgesAroundVertexMap.insert(std::pair<PointID, EdgeID> (m_edge[edge][0],edge));
edgesAroundVertexMap.insert(std::pair<PointID, EdgeID> (m_edge[edge][1],edge));
}
for(unsigned int i=0; i<numTriangles; ++i)
{
const Triangle &t = m_triangle[i];
// adding edge i in the edge shell of both points
for(unsigned int j=0; j<3; ++j)
{
//finding edge i in edge array
std::pair<std::multimap<PointID, EdgeID>::iterator, std::multimap<PointID, EdgeID>::iterator > itPair=edgesAroundVertexMap.equal_range(t[(j+1)%3]);
foundEdge=false;
for(it=itPair.first; (it!=itPair.second) && (foundEdge==false); ++it)
{
unsigned int edge = (*it).second;
if ( (m_edge[edge][0] == t[(j+1)%3] && m_edge[edge][1] == t[(j+2)%3]) || (m_edge[edge][0] == t[(j+2)%3] && m_edge[edge][1] == t[(j+1)%3]))
{
m_edgesInTriangle[i][j] = edge;
foundEdge=true;
}
}
#ifndef NDEBUG
if (foundEdge==false)
sout << "[TriangleSetTopologyContainer::getTriangleArray] cannot find edge for triangle " << i << "and edge "<< j << sendl;
#endif
}
}
}
}
/*
* For all guard instructions in trace, check to see if we can relax the
* destination type to something less specific. The GuardConstraints map
* contains information about what properties of the guarded type matter for
* each instruction. If simple is true, guards will not be relaxed past
* DataTypeSpecific except guards which are relaxed all the way to
* DataTypeGeneric. Returns true iff any changes were made to the trace.
*/
bool relaxGuards(IRUnit& unit, const GuardConstraints& guards, bool simple) {
auto blocks = rpoSortCfg(unit);
auto changed = false;
for (auto* block : blocks) {
for (auto& inst : *block) {
if (!isGuardOp(inst.op())) continue;
auto it = guards.find(&inst);
auto constraint = it == guards.end() ? TypeConstraint() : it->second;
if (simple && constraint.category > DataTypeGeneric &&
constraint.category < DataTypeSpecific) {
constraint.category = DataTypeSpecific;
}
// TODO(t2598894): Support relaxing inner types
auto const oldType = inst.typeParam();
auto newType = relaxType(oldType, constraint.category);
if (constraint.knownType <= newType) {
// If the known type is at least as good as the relaxed type, we can
// replace the guard with an assert.
auto newOp = guardToAssert(inst.op());
auto newType = std::min(constraint.knownType, previousGuardType(&inst));
FTRACE(1, "relaxGuards changing {}'s type to {}, op to {}\n",
inst, newType, newOp);
assert(!hasEdges(newOp));
if (inst.hasEdges()) {
block->push_back(unit.gen(Jmp, inst.marker(), inst.next()));
}
inst.setTypeParam(newType);
inst.setOpcode(newOp);
changed = true;
} else if (!oldType.equals(newType)) {
FTRACE(1, "relaxGuards changing {}'s type to {}\n", inst, newType);
inst.setTypeParam(newType);
changed = true;
}
}
}
if (!changed) return false;
// Make a second pass to reflow types, with some special logic for loads.
FrameState state(unit);
for (auto* block : blocks) {
state.startBlock(block);
for (auto& inst : *block) {
state.setMarker(inst.marker());
visitLoad(&inst, state);
retypeDests(&inst);
state.update(&inst);
}
state.finishBlock(block);
}
return true;
}
void ManifoldTriangleSetTopologyContainer::createTrianglesAroundEdgeArray()
{
if(!hasTriangles()) // this method should only be called when triangles exist
{
#ifndef NDEBUG
std::cout << "Warning. [ManifoldTriangleSetTopologyContainer::createTrianglesAroundEdgeArray] Triangle array is empty." << std::endl;
#endif
createTriangleSetArray();
}
if(!hasEdges()) // this method should only be called when edges exist
{
#ifndef NDEBUG
std::cout << "Warning. [ManifoldTriangleSetTopologyContainer::createTrianglesAroundEdgeArray] Edge array is empty." << std::endl;
#endif
createEdgeSetArray();
}
if(!hasEdgesInTriangle())
createEdgesInTriangleArray();
if(hasTrianglesAroundEdge())
clearTrianglesAroundEdge();
//Number of different elements needed for this function
const unsigned int nbrEdges = getNumberOfEdges();
const unsigned int nbrTriangles = getNumberOfTriangles();
//Temporary objects
Triangle vertexTriangle;
int cpt;
int firstVertex;
int vertexInTriangle;
//Temporary containers
std::multimap<unsigned int, unsigned int> map_edgesInTriangle;
std::multimap<unsigned int, unsigned int>::iterator it;
std::pair< std::multimap <unsigned int, unsigned int>::iterator, std::multimap <unsigned int, unsigned int>::iterator> pair_equal_range;
helper::ReadAccessor< Data< sofa::helper::vector<Edge> > > m_edge = d_edge;
helper::ReadAccessor< Data< sofa::helper::vector<Triangle> > > m_triangle = d_triangle;
m_trianglesAroundEdge.resize(nbrEdges);
for (unsigned int triangleIndex = 0; triangleIndex < nbrTriangles; ++triangleIndex)
{
// adding triangle i in the triangle shell of all edges
for (unsigned int indexEdge = 0; indexEdge<3 ; ++indexEdge)
{
map_edgesInTriangle.insert(std::pair < unsigned int, unsigned int> (m_edgesInTriangle[triangleIndex][indexEdge], triangleIndex));
}
}
for (unsigned int indexEdge = 0; indexEdge < nbrEdges; indexEdge++)
{
cpt = map_edgesInTriangle.count(indexEdge);
if (cpt > 2)
{
#ifndef NDEBUG
std::cout << "Error. [ManifoldTriangleSetTopologyContainer::createTrianglesAroundEdgeArray] The mapping is not manifold.";
std::cout << "There are more than 2 triangles adjacents to the Edge: " << indexEdge << std::endl;
#endif
//Even if this structure is not Manifold, we chosed to fill the shell with all the triangles:
pair_equal_range = map_edgesInTriangle.equal_range(indexEdge);
for (it = pair_equal_range.first; it != pair_equal_range.second; ++it)
m_trianglesAroundEdge[indexEdge].push_back((*it).second);
}
else if (cpt == 1)
{
it = map_edgesInTriangle.find(indexEdge);
m_trianglesAroundEdge[indexEdge].push_back((*it).second);
}
else if (cpt == 2)
{
pair_equal_range = map_edgesInTriangle.equal_range(indexEdge);
it = pair_equal_range.first;
firstVertex = m_edge[indexEdge][0];
vertexTriangle = m_triangle[(*it).second];
vertexInTriangle = getVertexIndexInTriangle (vertexTriangle, firstVertex);
if ((unsigned int)m_edge[indexEdge][1] == (unsigned int)vertexTriangle[(vertexInTriangle+1)%3])
{
m_trianglesAroundEdge[indexEdge].push_back((*it).second);
it++;
m_trianglesAroundEdge[indexEdge].push_back((*it).second);
}
else
{
it++;
m_trianglesAroundEdge[indexEdge].push_back((*it).second);
it--;
m_trianglesAroundEdge[indexEdge].push_back((*it).second);
}
}
}
}
void ManifoldTriangleSetTopologyContainer::createEdgesAroundVertexArray()
{
if(!hasEdges()) // this method should only be called when edges exist
{
#ifndef NDEBUG
std::cout << "Warning. [ManifoldTriangleSetTopologyContainer::createEdgesAroundVertexArray] edge array is empty." << std::endl;
#endif
createEdgeSetArray();
}
if(hasEdgesAroundVertex())
{
clearEdgesAroundVertex();
}
//Number of different elements needed for this function
const unsigned int nbrVertices = getNbPoints();
const unsigned int nbrEdges = getNumberOfEdges();
const unsigned int nbrTriangles = getNumberOfTriangles();
//Temporary objects
Triangle vertexTriangle;
EdgesInTriangle edgeTriangle;
int cpt;
int firstVertex;
int nextVertex;
//Temporary containers
sofa::helper::vector< std::multimap<unsigned int, unsigned int> > map_Adjacents;
sofa::helper::vector< std::map<unsigned int, unsigned int> > map_NextEdgeVertex;
sofa::helper::vector< std::map<unsigned int, unsigned int> > map_OppositeEdgeVertex;
std::multimap<unsigned int, unsigned int>::iterator it_multimap;
std::map<unsigned int, unsigned int>::iterator it_map;
helper::ReadAccessor< Data< sofa::helper::vector<Edge> > > m_edge = d_edge;
m_edgesAroundVertex.resize(nbrVertices);
map_Adjacents.resize(nbrVertices);
map_NextEdgeVertex.resize(nbrVertices);
map_OppositeEdgeVertex.resize(nbrVertices);
/* Creation of the differents maps: For each vertex i of each triangles:
- map_NextEdgeVertex: key = vertex i+1, value = Edge i+2
- map_OppositeEdgeVertex: key = vertex i+1, value = vertex i+2
- map_Adjacents: key = vertex i+1 et i+2, value = Edge i */
for (unsigned int triangleIndex = 0; triangleIndex < nbrTriangles; triangleIndex++)
{
vertexTriangle = getTriangleArray()[triangleIndex];
edgeTriangle = getEdgesInTriangle(triangleIndex);
for (unsigned int i=0; i<3; ++i)
{
map_NextEdgeVertex[vertexTriangle[i]].insert(std::pair<unsigned int,unsigned int> (vertexTriangle[(i+1)%3], edgeTriangle[(i+2)%3]));
map_OppositeEdgeVertex[vertexTriangle[i]].insert(std::pair<unsigned int,unsigned int> (vertexTriangle[(i+1)%3], vertexTriangle[(i+2)%3]));
map_Adjacents[vertexTriangle[i]].insert(std::pair<unsigned int,unsigned int> (vertexTriangle[(i+1)%3], edgeTriangle[i]));
map_Adjacents[vertexTriangle[i]].insert(std::pair<unsigned int,unsigned int> (vertexTriangle[(i+2)%3], edgeTriangle[i]));
}
}
for (unsigned int vertexIndex = 0; vertexIndex < nbrVertices; vertexIndex++)
{
it_map = map_OppositeEdgeVertex[vertexIndex].begin();
firstVertex = (*it_map).first;
for (it_multimap = map_Adjacents[vertexIndex].begin(); it_multimap != map_Adjacents[vertexIndex].end(); it_multimap++)
{
cpt = (int)map_Adjacents[vertexIndex].count((*it_multimap).first);
if( cpt > 2)
{
//#ifndef NDEBUG
std::cout << "Error. [ManifoldTriangleSetTopologyContainer::createEdgesAroundVertexArray] The mapping is not manifold. ";
std::cout << "In the neighborhood of the vertex: " << vertexIndex;
std::cout << ". There are " << cpt << " edges connected to the vertex: " << (*it_multimap).first << std::endl;
//#endif
}
else if ( cpt == 1)
{
it_map = map_OppositeEdgeVertex[vertexIndex].find( (*it_multimap).first );
if(it_map != map_OppositeEdgeVertex[vertexIndex].end())
{
firstVertex = (*it_map).first;
}
}
}
m_edgesAroundVertex[vertexIndex].push_back(map_NextEdgeVertex[vertexIndex][firstVertex]);
nextVertex = (*(it_map = map_OppositeEdgeVertex[vertexIndex].find(firstVertex))).second;
for (unsigned int indexEdge = 1; indexEdge < map_OppositeEdgeVertex[vertexIndex].size(); indexEdge++)
{
m_edgesAroundVertex[vertexIndex].push_back(map_NextEdgeVertex[vertexIndex][nextVertex]);
nextVertex = (*(it_map = map_OppositeEdgeVertex[vertexIndex].find(nextVertex))).second;
//std::cout << "nextVertex: " << nextVertex << std::endl;
//si different de fin
}
if (nextVertex != firstVertex)
{
const Edge lastEdge = Edge(nextVertex,vertexIndex);
for ( unsigned int i = 0; i < nbrEdges; ++i)
{
if( m_edge[i][0] == lastEdge[0] && m_edge[i][1] == lastEdge[1])
{
m_edgesAroundVertex[vertexIndex].push_back(i);
break;
}
}
}
}
map_Adjacents.clear();
map_NextEdgeVertex.clear();
map_OppositeEdgeVertex.clear();
}
