Improved GlobalLookup allocation and deallocation.

[[Imported from SVN: r4048]]

istl/paamg/hierarchy.hh

@@ -466,9 +466,13 @@ namespace Dune
 
       int procs = infoLevel->communicator().size();
       int level = 0;
+      int rank = 0;
+
+      infoLevel->buildGlobalLookup(mlevel->getmat().N());
 
       for(; level < criterion.maxLevel(); ++level, ++mlevel) {
 
+        rank = infoLevel->communicator().rank();
         dinfo<<infoLevel->communicator().rank()<<": Level "<<level<<" has "<<mlevel->getmat().N()<<" unknows!"<<std::endl;
 
 
@@ -549,6 +553,8 @@ namespace Dune
                                             aggregates,
                                             OverlapFlags());
 
+        fineInfo->freeGlobalLookup();
+
         delete Element<0>::get(graphs);
         productBuilder.calculate(mlevel->getmat(), *aggregatesMap, *coarseMatrix, *infoLevel, OverlapFlags());
 
@@ -558,6 +564,9 @@ namespace Dune
 
         matrices_.addCoarser(args);
       }
+
+      infoLevel->freeGlobalLookup();
+
       built_=true;
       AggregatesMap* aggregatesMap=new AggregatesMap(0);
       aggregatesMaps_.push_back(aggregatesMap);

istl/paamg/indicescoarsener.hh

@@ -177,7 +177,7 @@ namespace Dune
                                    ParallelInformation& coarseInfo)
     {
       ParallelAggregateRenumberer<Graph> renumberer(aggregates);
-      fineInfo.buildGlobalLookup(aggregates.noVertices());
+      //fineInfo.buildGlobalLookup(aggregates.noVertices());
       buildCoarseIndexSet(fineInfo, fineGraph, visitedMap, aggregates,
                           coarseInfo.indexSet(), renumberer);
       buildCoarseRemoteIndices(fineInfo.remoteIndices(), aggregates, coarseInfo.indexSet(),