Clang format the domain files.

Author: martin

src/analyses/ai_domain.cpp

@@ -13,24 +13,21 @@ Author: Daniel Kroening, [email protected]
 
 #include <util/simplify_expr.h>
 
-jsont ai_domain_baset::output_json(
-  const ai_baset &ai,
-  const namespacet &ns) const
+jsont ai_domain_baset::output_json(const ai_baset &ai, const namespacet &ns)
+  const
 {
   std::ostringstream out;
   output(out, ai, ns);
   json_stringt json(out.str());
   return json;
 }
 
-xmlt ai_domain_baset::output_xml(
-  const ai_baset &ai,
-  const namespacet &ns) const
+xmlt ai_domain_baset::output_xml(const ai_baset &ai, const namespacet &ns) const
 {
   std::ostringstream out;
   output(out, ai, ns);
   xmlt xml("abstract_state");
-  xml.data=out.str();
+  xml.data = out.str();
   return xml;
 }
 
@@ -42,38 +39,38 @@ xmlt ai_domain_baset::output_xml(
 /// \param ns: the namespace
 /// \return True if condition did not change. False otherwise. condition will be
 ///   updated with the simplified condition if it has worked
-bool ai_domain_baset::ai_simplify_lhs(
-  exprt &condition, const namespacet &ns) const
+bool ai_domain_baset::ai_simplify_lhs(exprt &condition, const namespacet &ns)
+  const
 {
   // Care must be taken here to give something that is still writable
-  if(condition.id()==ID_index)
+  if(condition.id() == ID_index)
   {
-    index_exprt ie=to_index_expr(condition);
-    bool no_simplification=ai_simplify(ie.index(), ns);
+    index_exprt ie = to_index_expr(condition);
+    bool no_simplification = ai_simplify(ie.index(), ns);
     if(!no_simplification)
-      condition=simplify_expr(ie, ns);
+      condition = simplify_expr(ie, ns);
 
     return no_simplification;
   }
-  else if(condition.id()==ID_dereference)
+  else if(condition.id() == ID_dereference)
   {
-    dereference_exprt de=to_dereference_expr(condition);
-    bool no_simplification=ai_simplify(de.pointer(), ns);
+    dereference_exprt de = to_dereference_expr(condition);
+    bool no_simplification = ai_simplify(de.pointer(), ns);
     if(!no_simplification)
-      condition=simplify_expr(de, ns);  // So *(&x) -> x
+      condition = simplify_expr(de, ns); // So *(&x) -> x
 
     return no_simplification;
   }
-  else if(condition.id()==ID_member)
+  else if(condition.id() == ID_member)
   {
-    member_exprt me=to_member_expr(condition);
+    member_exprt me = to_member_expr(condition);
     // Since simplify_ai_lhs is required to return an addressable object
     // (so remains a valid left hand side), to simplify
     // `(something_simplifiable).b` we require that `something_simplifiable`
     // must also be addressable
-    bool no_simplification=ai_simplify_lhs(me.compound(), ns);
+    bool no_simplification = ai_simplify_lhs(me.compound(), ns);
     if(!no_simplification)
-      condition=simplify_expr(me, ns);
+      condition = simplify_expr(me, ns);
 
     return no_simplification;
   }

src/analyses/ai_domain.h

@@ -12,10 +12,10 @@ Author: Daniel Kroening, [email protected]
 #ifndef CPROVER_ANALYSES_AI_DOMAIN_H
 #define CPROVER_ANALYSES_AI_DOMAIN_H
 
-#include <util/json.h>
-#include <util/xml.h>
 #include <util/expr.h>
+#include <util/json.h>
 #include <util/make_unique.h>
+#include <util/xml.h>
 
 #include <goto-programs/goto_model.h>
 
@@ -61,34 +61,28 @@ class ai_domain_baset
     ai_baset &ai,
     const namespacet &ns) = 0;
 
-  virtual void output(
-    std::ostream &out,
-    const ai_baset &ai,
-    const namespacet &ns) const
+  virtual void
+  output(std::ostream &out, const ai_baset &ai, const namespacet &ns) const
   {
   }
 
-  virtual jsont output_json(
-    const ai_baset &ai,
-    const namespacet &ns) const;
+  virtual jsont output_json(const ai_baset &ai, const namespacet &ns) const;
 
-  virtual xmlt output_xml(
-    const ai_baset &ai,
-    const namespacet &ns) const;
+  virtual xmlt output_xml(const ai_baset &ai, const namespacet &ns) const;
 
   // no states
-  virtual void make_bottom()=0;
+  virtual void make_bottom() = 0;
 
   // all states -- the analysis doesn't use this,
   // and domains may refuse to implement it.
-  virtual void make_top()=0;
+  virtual void make_top() = 0;
 
   // a reasonable entry-point state
-  virtual void make_entry()=0;
+  virtual void make_entry() = 0;
 
-  virtual bool is_bottom() const=0;
+  virtual bool is_bottom() const = 0;
 
-  virtual bool is_top() const=0;
+  virtual bool is_top() const = 0;
 
   // also add
   //
@@ -102,23 +96,18 @@ class ai_domain_baset
   // PRECONDITION(from.is_dereferenceable(), "Must not be _::end()")
   // PRECONDITION(to.is_dereferenceable(), "Must not be _::end()")
 
-
   // This method allows an expression to be simplified / evaluated using the
   // current state.  It is used to evaluate assertions and in program
   // simplification
 
   // return true if unchanged
-  virtual bool ai_simplify(
-    exprt &condition,
-    const namespacet &ns) const
+  virtual bool ai_simplify(exprt &condition, const namespacet &ns) const
   {
     return true;
   }
 
   // Simplifies the expression but keeps it as an l-value
-  virtual bool ai_simplify_lhs(
-    exprt &condition,
-    const namespacet &ns) const;
+  virtual bool ai_simplify_lhs(exprt &condition, const namespacet &ns) const;
 
   // Gives a Boolean condition that is true for all values represented by the
   // domain.  This allows domains to be converted into program invariants.