Renamed macros to all uppercase

Author: danpoe

src/util/sharing_map.h

@@ -12,9 +12,9 @@ Author: Daniel Poetzl
 #ifndef CPROVER_UTIL_SHARING_MAP_H
 #define CPROVER_UTIL_SHARING_MAP_H
 
-//#define DEBUG
+//#define SM_DEBUG
 
-#ifdef DEBUG
+#ifdef SM_DEBUG
 #include <iostream>
 #endif
 
@@ -31,14 +31,14 @@ Author: Daniel Poetzl
 #include "sharing_node.h"
 #include "threeval.h"
 
-//#define SHARING_MAP_INTERNAL_CHECKS
+//#define SM_INTERNAL_CHECKS
 
-#ifdef SHARING_MAP_INTERNAL_CHECKS
-#define _sm_assert(b) INVARIANT(b, "Sharing map internal invariant")
-#define _sm_assert_use(v, b) _sm_assert(b)
+#ifdef SM_INTERNAL_CHECKS
+#define SM_ASSERT(b) INVARIANT(b, "Sharing map internal invariant")
+#define SM_ASSERT_USE(v, b) SM_ASSERT(b)
 #else
-#define _sm_assert(b)
-#define _sm_assert_use(v, b) v = v;
+#define SM_ASSERT(b)
+#define SM_ASSERT_USE(v, b) v = v;
 #endif
 
 #define SHARING_MAPT(R)                                                        \
@@ -355,7 +355,7 @@ ::iterate(
     {
       const innert *ip = static_cast<const innert *>(bp);
       const to_mapt &m = ip->get_to_map();
-      _sm_assert(!m.empty());
+      SM_ASSERT(!m.empty());
 
       for(const auto &item : m)
       {
@@ -365,11 +365,11 @@ ::iterate(
     }
     else // container
     {
-      _sm_assert(depth == steps);
+      SM_ASSERT(depth == steps);
 
       const innert *cp = static_cast<const innert *>(bp);
       const leaf_listt &ll = cp->get_container();
-      _sm_assert(!ll.empty());
+      SM_ASSERT(!ll.empty());
 
       for(const auto &l : ll)
       {
@@ -391,7 +391,7 @@ ::iterate(
 /// \param[out] view: Empty view
 SHARING_MAPT(void)::get_view(viewt &view) const
 {
-  _sm_assert(view.empty());
+  SM_ASSERT(view.empty());
 
   if(empty())
     return;
@@ -452,7 +452,7 @@ ::get_delta_view(
   delta_viewt &delta_view,
   const bool only_common) const
 {
-  _sm_assert(delta_view.empty());
+  SM_ASSERT(delta_view.empty());
 
   if(empty())
     return;
@@ -509,7 +509,7 @@ ::get_delta_view(
     }
     else // container
     {
-      _sm_assert(depth == steps);
+      SM_ASSERT(depth == steps);
 
       const innert *cp1 = static_cast<const innert *>(bp1);
       const innert *cp2 = static_cast<const innert *>(bp2);
@@ -606,8 +606,8 @@ SHARING_MAPT2(const, leaft *)::get_leaf_node(const key_type &k) const
 ///   (possible values `unknown` or` true`)
 SHARING_MAPT2(, size_type)::erase(const key_type &k, const tvt &key_exists)
 {
-  _sm_assert(!key_exists.is_false());
-  _sm_assert(!key_exists.is_true() || has_key(k));
+  SM_ASSERT(!key_exists.is_false());
+  SM_ASSERT(!key_exists.is_true() || has_key(k));
 
   // check if key exists
   if(key_exists.is_unknown() && !has_key(k))
@@ -651,15 +651,15 @@ SHARING_MAPT2(, size_type)::erase(const key_type &k, const tvt &key_exists)
     }
     else
     {
-      _sm_assert(del_level == steps - 1);
+      SM_ASSERT(del_level == steps - 1);
       del->remove_child(del_bit);
     }
 
     num--;
     return 1;
   }
 
-  _sm_assert(!ll.empty());
+  SM_ASSERT(!ll.empty());
 
   ip->remove_leaf(k);
   num--;
@@ -706,8 +706,8 @@ ::erase_all(const keyst &ks, const tvt &key_exists)
 SHARING_MAPT2(const, const_find_type)
 ::insert(const key_type &k, const mapped_type &m, const tvt &key_exists)
 {
-  _sm_assert(!key_exists.is_true());
-  _sm_assert(!key_exists.is_false() || !has_key(k));
+  SM_ASSERT(!key_exists.is_true());
+  SM_ASSERT(!key_exists.is_false() || !has_key(k));
 
   if(key_exists.is_unknown())
   {
@@ -717,7 +717,7 @@ ::insert(const key_type &k, const mapped_type &m, const tvt &key_exists)
   }
 
   innert *cp = get_container_node(k);
-  _sm_assert(cp != nullptr);
+  SM_ASSERT(cp != nullptr);
 
   const leaft *lp = cp->place_leaf(k, m);
   num++;
@@ -745,7 +745,7 @@ ::insert(const value_type &p, const tvt &key_exists)
 SHARING_MAPT2(const, find_type)::place(const key_type &k, const mapped_type &m)
 {
   innert *cp = get_container_node(k);
-  _sm_assert(cp != nullptr);
+  SM_ASSERT(cp != nullptr);
 
   leaft *lp = cp->find_leaf(k);
 
@@ -777,17 +777,17 @@ SHARING_MAPT2(const, find_type)::place(const value_type &p)
 ///   boolean indicating if element was found.
 SHARING_MAPT2(const, find_type)::find(const key_type &k, const tvt &key_exists)
 {
-  _sm_assert(!key_exists.is_false());
-  _sm_assert(!key_exists.is_true() || has_key(k));
+  SM_ASSERT(!key_exists.is_false());
+  SM_ASSERT(!key_exists.is_true() || has_key(k));
 
   if(key_exists.is_unknown() && !has_key(k))
     return find_type(dummy, false);
 
   innert *cp = get_container_node(k);
-  _sm_assert(cp != nullptr);
+  SM_ASSERT(cp != nullptr);
 
   leaft *lp = cp->find_leaf(k);
-  _sm_assert(lp != nullptr);
+  SM_ASSERT(lp != nullptr);
 
   return find_type(lp->get_value(), true);
 }