- Implemented BaseHashTable.copy and used it in InstExtends.fixClassdef, instead

  of the previous slow way of building a new hashtable element by element.
  fixLocalIdents went from 40s to 15s for BatchPlant_StandardWater for me.


git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@21270 f25d12d1-65f4-0310-ae8a-bbce733d8d8e

Author: perost

Compiler/FrontEnd/InstExtends.mo

@@ -1121,7 +1121,7 @@ algorithm
 
     case (cache,env,SCode.PARTS(elts,ne,ie,na,ia,nc,clats,ed),htParent)
       equation
-        ht = List.fold(BaseHashTable.hashTableList(htParent), BaseHashTable.add, HashTableStringToPath.emptyHashTable());
+        ht = BaseHashTable.copy(htParent);
         ht = getLocalIdentList(elts,ht,getLocalIdentElement);
         (cache,elts) = fixList(cache,env,elts,ht,fixElement);
         (cache,ne) = fixList(cache,env,ne,ht,fixEquation);
@@ -1133,7 +1133,7 @@ algorithm
 
     case (cache,env,SCode.CLASS_EXTENDS(name,mod,SCode.PARTS(elts,ne,ie,na,ia,nc,clats,ed)),htParent)
       equation
-        ht = List.fold(BaseHashTable.hashTableList(htParent), BaseHashTable.add, HashTableStringToPath.emptyHashTable());
+        ht = BaseHashTable.copy(htParent);
         (cache,mod) = fixModifications(cache,env,mod,ht);
         (cache,elts) = fixList(cache,env,elts,ht,fixElement);
         (cache,ne) = fixList(cache,env,ne,ht,fixEquation);

Compiler/Util/BaseHashTable.mo

@@ -636,4 +636,20 @@ algorithm
   end match;
 end valueArrayNth;
 
+public function copy
+  "Makes a copy of a hashtable."
+  input HashTable inHashTable;
+  output HashTable outCopy;
+protected
+  HashVector hv;
+  Integer bs, sz, vs, ve;
+  FuncsTuple ft;
+  array<Option<HashEntry>> vae;
+algorithm
+  (hv, (vs, ve, vae), bs, sz, ft) := inHashTable;
+  hv := arrayCopy(hv);
+  vae := arrayCopy(vae);
+  outCopy := (hv, (vs, ve, vae), bs, sz, ft);
+end copy;
+
 end BaseHashTable;