Protect MEDCouplingUMesh::IntersectMeshes against agressive users.

diff --git a/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DQuadraticPolygon.cxx b/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DQuadraticPolygon.cxx
index 9721d1fc9c0c831865715324c4570c504fd6f5c5..a1df7ca5ce84c0c769c30c0d021e9af99b39c813 100644 (file)
--- a/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DQuadraticPolygon.cxx
+++ b/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DQuadraticPolygon.cxx
@@ -1120,6 +1120,7 @@ std::list<QuadraticPolygon *>::iterator QuadraticPolygon::fillAsMuchAsPossibleWi
   if(!direction)
     it.previousLoop();
   Node *nodeToTest;
+  int szMax(pol1Splitted.size()+1),ii(0);// here a protection against agressive users of IntersectMeshes of invalid input meshes
   std::list<QuadraticPolygon *>::iterator ret;
   do
     {
@@ -1133,8 +1134,11 @@ std::list<QuadraticPolygon *>::iterator QuadraticPolygon::fillAsMuchAsPossibleWi
       ret=CheckInList(nodeToTest,iStart,iEnd);
       if(completed())
         return iEnd;
+      ii++;
     }
-  while(ret==iEnd);
+  while(ret==iEnd && ii<szMax);
+  if(ii==szMax)// here a protection against agressive users of IntersectMeshes of invalid input meshes
+    throw INTERP_KERNEL::Exception("QuadraticPolygon::fillAsMuchAsPossibleWith : Something is invalid with input polygons !");
   return ret;
 }