variable table init in mxomni, some reshuffling

LEGO1/mxhashtable.h

@@ -29,30 +29,154 @@ class MxHashTableNode
   MxHashTableNode *m_next;
 };
 
+// See MxOmni::Create
+// VTABLE 0x100dc1b0
 template <class T>
-class MxHashTable : public MxCore
+class HashTableParent : public MxCore
+{
+public:
+  HashTableParent() {
+    m_numKeys = 0;
+    m_customDestructor = Destroy;
+  }
+
+  // OFFSET: LEGO1 0x100afd30
+  static void Destroy(T*) {};
+
+  // OFFSET: LEGO1 0x100afcd0
+  virtual MxS8 Compare(T*, T*) = 0;
+
+protected:
+  MxU32 m_numKeys; // +0x8
+  void (*m_customDestructor)(T*); // +0xc
+};
+
+// VTABLE 0x100dc1e8
+template <class T>
+class MxHashTable : protected HashTableParent<T>
 {
 public:
   MxHashTable()
   {
     m_numSlots = HASH_TABLE_INIT_SIZE;
     m_slots = new MxHashTableNode<T>*[HASH_TABLE_INIT_SIZE];
+    memset(m_slots, 0, sizeof(MxHashTableNode<T> *) * m_numSlots);
     m_resizeOption = HASH_TABLE_OPT_NO_EXPAND;
   }
 
-  ~MxHashTable()
+  virtual ~MxHashTable();
+
+  void Resize();
+  void MxHashTable::Add(T* );
+
+  virtual MxS8 Compare(T*, T*) = 0;
+
+  // OFFSET: LEGO1 0x100afdc0
+  virtual MxU32 Hash(T*) = 0;
+
+  // FIXME: use of friend here?
+  friend class MxHashTableCursor<T>;
+
+protected:
+  void _NodeInsert(MxHashTableNode<T> *);
+
+  MxHashTableNode<T> **m_slots; // +0x10
+  MxU32 m_numSlots; // +0x14
+  MxU32 m_autoResizeRatio;
+  int m_resizeOption; // +0x1c
+  // FIXME: or FIXME? This qword is used as an integer or double depending
+  // on the value of m_resizeOption. Hard to say whether this is how the devs
+  // did it, but a simple cast in either direction doesn't match.
+  union {
+    MxU32 m_increaseAmount;
+    double m_increaseFactor;
+  };
+};
+
+template <class T>
+class MxHashTableCursor : public MxCore
 {
-    // TODO: Walk table to delete nodes?
+public:
+  MxHashTableCursor(MxHashTable<T> *p_hashTable)
+  {
+    m_table = p_hashTable;
+    m_match = NULL;
+  }
+
+  MxBool Find(T *p_obj)
+  {
+    MxU32 hash = m_table->Hash(p_obj);
+    int bucket = hash % m_table->m_numSlots;
+
+    MxHashTableNode<T> *t = m_table->m_slots[bucket];
+
+    while (t) {
+      if (t->m_hash == hash && !m_table->Compare(t->m_obj, p_obj))
+        m_match = t;
+      t = t->m_next;
+    }
+
+    return m_match != NULL;
+  }
+
+  void GetMatch(T*& p_obj)
+  {
+    if (m_match) {
+      p_obj = m_match->m_obj;
+    }
+  }
+
+  void DeleteMatch()
+  {
+    // Cut the matching node out of the linked list
+    // by updating pointer references.
+
+    if (m_match->m_prev) {
+      m_match->m_prev->m_next = m_match->m_next;
+    } else {
+      // No "prev" node, so move "next" to the head of the list.
+      int bucket = m_match->m_hash % m_table->m_numSlots;
+      m_table->m_slots[bucket] = m_match->m_next;
+    }
+
+    if (m_match->m_next)
+      m_match->m_next->m_prev = m_match->m_prev;
+
+    m_table->m_customDestructor(m_match->m_obj);
+    delete m_match;
+    m_table->m_numKeys--;
+  }
+
+private:
+  MxHashTable<T> *m_table;
+  MxHashTableNode<T> *m_match;
+};
+
+
+template <class T>
+// OFFSET: LEGO1 0x100b0bd0
+MxHashTable<T>::~MxHashTable()
+{
+  for (int i = 0; i < m_numSlots; i++) {
+    MxHashTableNode<T> *t = m_slots[i];
+    
+    while (t) {
+      MxHashTableNode<T> *next = t->m_next;
+      m_customDestructor(t->m_obj);
+      delete t;
+      t = next;
+    }
+  }
+
+  m_numKeys = 0;
+  memset(m_slots, 0, sizeof(MxHashTableNode<T> *) * m_numSlots);
+
   delete[] m_slots;
 }
 
-  // for convenience
+template <class T>
-  inline int GetBucket(int hash) {
-    return hash % m_numSlots;
-  }
-
 // OFFSET: LEGO1 0x100b7ab0
-  void MxHashTable::Resize()
+inline void MxHashTable<T>::Resize()
 {
   // Save a reference to the current table
   // so we can walk nodes and re-insert
@@ -87,9 +211,11 @@ class MxHashTable : public MxCore
   delete[] old_table;
 }
 
+template <class T>
 // OFFSET: LEGO1 0x100b7b80
-  void MxHashTable::_NodeInsert(MxHashTableNode<T> *p_node) {
+inline void MxHashTable<T>::_NodeInsert(MxHashTableNode<T> *p_node)
-    int bucket = GetBucket(p_node->m_hash);
+{
+  int bucket = p_node->m_hash % m_numSlots;
   
   p_node->m_next = m_slots[bucket];
   
@@ -100,7 +226,8 @@ class MxHashTable : public MxCore
   m_numKeys++;
 }
 
-  void MxHashTable::Add(T* p_newobj)
+template <class T>
+inline void MxHashTable<T>::Add(T* p_newobj)
 {
   if (m_resizeOption && ((m_numKeys + 1) / m_numSlots) > m_autoResizeRatio)
     MxHashTable<T>::Resize();
@@ -111,82 +238,4 @@ class MxHashTable : public MxCore
   MxHashTable<T>::_NodeInsert(node);
 }
 
-  virtual MxS8 Compare(T*, T*);
-  virtual MxU32 Hash(T*);
-
-//private:
-  MxU32 m_numKeys; // +0x8
-  void (*m_customDestructor)(T*); // +0xc
-  MxHashTableNode<T> **m_slots; // +0x10
-  MxU32 m_numSlots; // +0x14
-  MxU32 m_autoResizeRatio;
-  int m_resizeOption; // +0x1c
-  // FIXME: or FIXME? This qword is used as an integer or double depending
-  // on the value of m_resizeOption. Hard to say whether this is how the devs
-  // did it, but a simple cast in either direction doesn't match.
-  union {
-    MxS64 m_increaseAmount;
-    double m_increaseFactor;
-  };
-};
-
-template <class T>
-class MxHashTableCursor : public MxCore
-{
-public:
-  MxHashTableCursor(MxHashTable<T> *p_hashTable)
-  {
-    m_table = p_hashTable;
-    m_match = NULL;
-  }
-
-  MxBool Find(T *p_obj)
-  {
-    MxU32 hash = m_table->Hash(p_obj);
-    int bucket = m_table->GetBucket(hash);
-
-    MxHashTableNode<T> *t = m_table->m_slots[bucket];
-
-    while (t) {
-      if (t->m_hash == hash && !m_table->Compare(t->m_obj, p_obj))
-        m_match = t;
-      t = t->m_next;
-    }
-
-    return m_match != NULL;
-  }
-
-  void GetMatch(T*& p_obj)
-  {
-    if (m_match) {
-      p_obj = m_match->m_obj;
-    }
-  }
-
-  void DeleteMatch()
-  {
-    // Cut the matching node out of the linked list
-    // by updating pointer references.
-
-    if (m_match->m_prev) {
-      m_match->m_prev->m_next = m_match->m_next;
-    } else {
-      // No "prev" node, so move "next" to the head of the list.
-      int bucket = m_table->GetBucket(m_match->m_hash);
-      m_table->m_slots[bucket] = m_match->m_next;
-    }
-
-    if (m_match->m_next)
-      m_match->m_next->m_prev = m_match->m_prev;
-
-    m_table->m_customDestructor(m_match->m_obj);
-    delete m_match;
-    m_table->m_numKeys--;
-  }
-
-private:
-  MxHashTable<T> *m_table;
-  MxHashTableNode<T> *m_match;
-};
-
 #endif // MXHASHTABLE_H

LEGO1/mxomni.cpp

@@ -104,6 +104,15 @@ void MxOmni::SetInstance(MxOmni *instance)
 // OFFSET: LEGO1 0x100af0c0
 MxResult MxOmni::Create(MxOmniCreateParam &p)
 {
+  if (p.CreateFlags().CreateVariableTable())
+  {
+    MxVariableTable *variableTable = new MxVariableTable();
+    this->m_variableTable = variableTable;
+
+    if (variableTable == NULL)
+      return FAILURE;
+  }
+
   if (p.CreateFlags().CreateTimer())
   {
     MxTimer *timer = new MxTimer();

LEGO1/mxvariabletable.cpp

@@ -33,11 +33,6 @@ void MxVariableTable::SetVariable(const char *p_key, const char *p_value)
   } else {
     MxHashTable<MxVariable>::Add(var);
   }
-
-  // create new var object here?
-
-  // Resize inlined
-  // Add not
 }
 
 // OFFSET: LEGO1 0x100b7740
@@ -50,11 +45,6 @@ void MxVariableTable::SetVariable(MxVariable *var)
     cursor.DeleteMatch();
 
   MxHashTable<MxVariable>::Add(var);
-
-  // we already have the new variable to add.
-
-  // Resize not
-  // Add inlined
 }
 
 // OFFSET: LEGO1 0x100b78f0

LEGO1/mxvariabletable.h

@@ -8,13 +8,19 @@
 
 // VTABLE 0x100dc1c8
 // SIZE 0x28
-class MxVariableTable : protected MxHashTable<MxVariable>
+class MxVariableTable : public MxHashTable<MxVariable>
 {
 public:
+  MxVariableTable() {
+    m_customDestructor = Destroy;
+  }
   __declspec(dllexport) void SetVariable(const char *key, const char *value);
   __declspec(dllexport) void SetVariable(MxVariable *var);
   __declspec(dllexport) const char * GetVariable(const char *key);
 
+  // OFFSET: LEGO1 0x100afdb0
+  static void Destroy(MxVariable *p_obj) { p_obj->Destroy(); }
+
   virtual MxS8 Compare(MxVariable *, MxVariable *); // +0x14
   virtual MxU32 Hash(MxVariable *); // +0x18
 };