Remove 1 exit time destructor from our local changes to hunspell.

src/hunspell/hashmgr.cxx

 #include "license.hunspell"
 #include "license.myspell"
 
 #include <stdlib.h> 
 #include <string.h>
 #include <stdio.h> 
 #include <ctype.h>
 
 #include "hashmgr.hxx"
 #include "csutil.hxx"
@@ skipping 398 matching lines @@
 struct hentry * HashMgr::walk_hashtable(int &col, struct hentry * hp) const
 {  
 #ifdef HUNSPELL_CHROME_CLIENT
   // Return NULL if dictionary is not valid.
   if (!bdict_reader->IsValid())
     return NULL;
 
   // This function is only ever called by one place and not nested. We can
   // therefore keep static state between calls and use |col| as a "reset" flag
   // to avoid changing the API. It is set to -1 for the first call.
-  static hunspell::WordIterator word_iterator =
-      bdict_reader->GetAllWordIterator();
+  // Allocate the iterator on the heap to prevent an exit time destructor.
+  static hunspell::WordIterator& word_iterator =
+      *new hunspell::WordIterator(bdict_reader->GetAllWordIterator());
   if (col < 0) {
     col = 1;
     word_iterator = bdict_reader->GetAllWordIterator();
   }
 
   int affix_ids[hunspell::BDict::MAX_AFFIXES_PER_WORD];
   static const int kMaxWordLen = 128;
   static char word[kMaxWordLen];
   int affix_count = word_iterator.Advance(word, kMaxWordLen, affix_ids);
   if (affix_count == 0)
@@ skipping 721 matching lines @@
 
 int HashMgr::is_aliasm() {
     return (aliasm != NULL);
 }
 
 char * HashMgr::get_aliasm(int index) {
     if ((index > 0) && (index <= numaliasm)) return aliasm[index - 1];
     HUNSPELL_WARNING(stderr, "error: bad morph. alias index: %d\n", index);
     return NULL;
 }