source: src/ResolvExpr/Candidate.hpp @ 4e13e2a

ADTarm-ehast-experimentalenumforall-pointer-decayjacob/cs343-translationnew-astnew-ast-unique-exprpthread-emulationqualifiedEnum
Last change on this file since 4e13e2a was 4e13e2a, checked in by Thierry Delisle <tdelisle@…>, 5 years ago

Added setting of result in Comma expression.
Added asserts in candidate finder to catch null pointers earlier.
ForAll? substituter now properly uses ShallowCopy?.
Added missing makefile.in

  • Property mode set to 100644
File size: 3.3 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// Candidate.hpp --
8//
9// Author           : Aaron B. Moss
10// Created On       : Wed Jun 5 14:30:00 2019
11// Last Modified By : Andrew Beach
12// Last Modified On : Wed Jun 12 14:15:00 2019
13// Update Count     : 2
14//
15
16#pragma once
17
18#include <iosfwd>
19#include <memory>        // for shared_ptr
20#include <vector>
21
22#include "Cost.h"
23#include "AST/Node.hpp"
24#include "AST/TypeEnvironment.hpp"
25#include "Common/Indenter.h"
26
27namespace ast {
28        class Expr;
29
30        /// A list of unresolved assertions
31        using AssertionList = std::vector<AssertionSet::value_type>;
32
33        /// Convenience to merge AssertionList into AssertionSet
34        static inline void mergeAssertionSet( AssertionSet & dst, const AssertionList & src ) {
35                for ( const auto & s : src ) { dst.emplace( s ); }
36        }
37}
38
39namespace ResolvExpr {
40
41/// One option for resolution of an expression
42struct Candidate {
43        ast::ptr<ast::Expr> expr;  ///< Satisfying expression
44        Cost cost;                 ///< Cost of the whole expression
45        Cost cvtCost;              ///< Cost of conversions to satisfying expression
46        ast::TypeEnvironment env;  ///< Containing type environment
47        ast::OpenVarSet open;      ///< Open variables for environment
48        ast::AssertionList need;   ///< Assertions which need to be resolved
49
50        Candidate() : expr(), cost( Cost::zero ), cvtCost( Cost::zero ), env(), open(), need() {}
51
52        Candidate( const ast::Expr * x, const ast::TypeEnvironment & e )
53        : expr( x ), cost( Cost::zero ), cvtCost( Cost::zero ), env( e ), open(), need() {
54                assert(x->result);
55        }
56
57        Candidate( const Candidate & o, const ast::Expr * x, const Cost & addedCost = Cost::zero )
58        : expr( x ), cost( o.cost + addedCost ), cvtCost( Cost::zero ), env( o.env ), open( o.open ),
59          need( o.need ) {
60                assert(x->result);
61        }
62
63        Candidate(
64                const ast::Expr * x, const ast::TypeEnvironment & e, const ast::OpenVarSet & o,
65                const ast::AssertionSet & n, const Cost & c, const Cost & cvt = Cost::zero )
66        : expr( x ), cost( c ), cvtCost( cvt ), env( e ), open( o ), need( n.begin(), n.end() ) {
67                assert(x->result);
68        }
69
70        Candidate(
71                const ast::Expr * x, ast::TypeEnvironment && e, ast::OpenVarSet && o,
72                ast::AssertionSet && n, const Cost & c, const Cost & cvt = Cost::zero )
73        : expr( x ), cost( c ), cvtCost( cvt ), env( std::move( e ) ), open( std::move( o ) ),
74          need( n.begin(), n.end() ) {
75                assert(x->result);
76        }
77};
78
79/// Shared reference to a candidate
80using CandidateRef = std::shared_ptr< Candidate >;
81
82/// List of candidates
83using CandidateList = std::vector< CandidateRef >;
84
85/// Sum the cost of a list of candidates
86static inline Cost sumCost( const CandidateList & candidates ) {
87        Cost total = Cost::zero;
88        for ( const CandidateRef & r : candidates ) { total += r->cost; }
89        return total;
90}
91
92/// Holdover behaviour from old `findMinCost` -- xxx -- can maybe be eliminated?
93static inline void promoteCvtCost( CandidateList & candidates ) {
94        for ( CandidateRef & r : candidates ) {
95                r->cost = r->cvtCost;
96        }
97}
98
99void print( std::ostream & os, const Candidate & cand, Indenter indent = {} );
100
101void print( std::ostream & os, const CandidateList & cands, Indenter indent = {} );
102
103} // namespace ResolvExpr
104
105// Local Variables: //
106// tab-width: 4 //
107// mode: c++ //
108// compile-command: "make install" //
109// End: //
Note: See TracBrowser for help on using the repository browser.