booyah

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>

src/tactic/bv/bit_blaster_model_converter.h

@@ -16,12 +16,10 @@ Author:
 Notes:
 
 --*/
-#ifndef BIT_BLASTER_MODEL_CONVERTER_H_
-#define BIT_BLASTER_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 
 model_converter * mk_bit_blaster_model_converter(ast_manager & m, obj_map<func_decl, expr*> const & const2bits, ptr_vector<func_decl> const& newbits);
 model_converter * mk_bv1_blaster_model_converter(ast_manager & m, obj_map<func_decl, expr*> const & const2bits, ptr_vector<func_decl> const& newbits);
 
-#endif

src/tactic/bv/bit_blaster_tactic.h

@@ -16,8 +16,7 @@ Copyright (c) 2011 Microsoft Corporation
  Notes:
  
  --*/
-#ifndef BIT_BLASTER_TACTIC_H_
-#define BIT_BLASTER_TACTIC_H_
+#pragma once
  
 #include "util/params.h"
 #include "ast/rewriter/bit_blaster/bit_blaster_rewriter.h"
@@ -29,5 +28,4 @@ tactic * mk_bit_blaster_tactic(ast_manager & m, bit_blaster_rewriter* rw, params
  /*
   ADD_TACTIC("bit-blast", "reduce bit-vector expressions into SAT.", "mk_bit_blaster_tactic(m, p)")
  */
- #endif
 

src/tactic/bv/bv1_blaster_tactic.h

@@ -22,8 +22,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV1_BLASTER_TACTIC_H_
-#define BV1_BLASTER_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -35,4 +34,3 @@ probe * mk_is_qfbv_eq_probe();
   ADD_TACTIC("bv1-blast", "reduce bit-vector expressions into bit-vectors of size 1 (notes: only equality, extract and concat are supported).", "mk_bv1_blaster_tactic(m, p)")
   ADD_PROBE("is-qfbv-eq", "true if the goal is in a fragment of QF_BV which uses only =, extract, concat.", "mk_is_qfbv_eq_probe()")
 */
-#endif

src/tactic/bv/bv_bound_chk_tactic.h

@@ -14,8 +14,7 @@
 
  Revision History:
  --*/
-#ifndef BV_BOUND_CHK_TACTIC_H_
-#define BV_BOUND_CHK_TACTIC_H_
+#pragma once
 
 #include "tactic/tactical.h"
 #include "util/params.h"
@@ -27,4 +26,3 @@ tactic* mk_bv_bound_chk_tactic(ast_manager & m, params_ref const & p = params_re
   ADD_TACTIC("bv_bound_chk", "attempts to detect inconsistencies of bounds on bv expressions.", "mk_bv_bound_chk_tactic(m, p)")
 */
 
-#endif /* BV_BOUND_CHK_TACTIC_H_*/

src/tactic/bv/bv_bounds_tactic.h

@@ -16,8 +16,7 @@ Author:
 
 
 --*/
-#ifndef BV_BOUNDS_TACTIC_H_
-#define BV_BOUNDS_TACTIC_H_
+#pragma once
 #include "tactic/tactic.h"
 
 tactic * mk_bv_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
@@ -33,4 +32,3 @@ tactic * mk_dom_bv_bounds_tactic(ast_manager & m, params_ref const & p = params_
 
 */
 
-#endif

src/tactic/bv/bvarray2uf_rewriter.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BVARRAY2UF_REWRITER_H_
-#define BVARRAY2UF_REWRITER_H_
+#pragma once
 
 #include "ast/rewriter/rewriter.h"
 #include "tactic/generic_model_converter.h"
@@ -80,5 +79,4 @@ struct bvarray2uf_rewriter : public rewriter_tpl<bvarray2uf_rewriter_cfg> {
     void set_mcs(generic_model_converter * fmc) { m_cfg.set_mcs(fmc); }
 };
 
-#endif
 

src/tactic/bv/bvarray2uf_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV_ARRAY2UF_TACTIC_H_
-#define BV_ARRAY2UF_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -30,4 +29,3 @@ tactic * mk_bvarray2uf_tactic(ast_manager & m, params_ref const & p = params_ref
 */
 
 
-#endif

src/tactic/bv/dt2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DT2BV_TACTIC_H_
-#define DT2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 #include "util/obj_hashtable.h"
@@ -30,4 +29,3 @@ tactic * mk_dt2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
     ADD_TACTIC("dt2bv", "eliminate finite domain data-types. Replace by bit-vectors.", "mk_dt2bv_tactic(m, p)")
 */
 
-#endif

src/tactic/bv/max_bv_sharing_tactic.h

@@ -19,8 +19,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef MAX_BV_SHARING_TACTIC_H_
-#define MAX_BV_SHARING_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,5 +30,4 @@ tactic * mk_max_bv_sharing_tactic(ast_manager & m, params_ref const & p = params
   ADD_TACTIC("max-bv-sharing", "use heuristics to maximize the sharing of bit-vector expressions such as adders and multipliers.", "mk_max_bv_sharing_tactic(m, p)")
 */
 
-#endif