1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123
|
/********************* */
/*! \file type_node.h
** \verbatim
** Top contributors (to current version):
** Morgan Deters, Dejan Jovanovic, Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Reference-counted encapsulation of a pointer to node information.
**
** Reference-counted encapsulation of a pointer to node information.
**/
#include "cvc4_private.h"
// circular dependency
#include "expr/node_value.h"
#ifndef CVC4__TYPE_NODE_H
#define CVC4__TYPE_NODE_H
#include <stdint.h>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#include "base/check.h"
#include "expr/kind.h"
#include "expr/metakind.h"
#include "util/cardinality.h"
namespace CVC4 {
class NodeManager;
class DType;
namespace expr {
class NodeValue;
}/* CVC4::expr namespace */
/**
* Encapsulation of an NodeValue pointer for Types. The reference count is
* maintained in the NodeValue.
*/
class TypeNode {
public:
// for hash_maps, hash_sets..
struct HashFunction {
size_t operator()(TypeNode node) const {
return (size_t) node.getId();
}
};/* struct HashFunction */
private:
/**
* The NodeValue has access to the private constructors, so that the
* iterators can can create new types.
*/
friend class expr::NodeValue;
/** A convenient null-valued encapsulated pointer */
static TypeNode s_null;
/** The referenced NodeValue */
expr::NodeValue* d_nv;
/**
* This constructor is reserved for use by the TypeNode package.
*/
explicit TypeNode(const expr::NodeValue*);
friend class NodeManager;
template <unsigned nchild_thresh>
friend class NodeBuilder;
/**
* Assigns the expression value and does reference counting. No
* assumptions are made on the expression, and should only be used
* if we know what we are doing.
*
* @param ev the expression value to assign
*/
void assignNodeValue(expr::NodeValue* ev);
/**
* Cache-aware, recursive version of substitute() used by the public
* member function with a similar signature.
*/
TypeNode substitute(const TypeNode& type, const TypeNode& replacement,
std::unordered_map<TypeNode, TypeNode, HashFunction>& cache) const;
/**
* Cache-aware, recursive version of substitute() used by the public
* member function with a similar signature.
*/
template <class Iterator1, class Iterator2>
TypeNode substitute(Iterator1 typesBegin, Iterator1 typesEnd,
Iterator2 replacementsBegin, Iterator2 replacementsEnd,
std::unordered_map<TypeNode, TypeNode, HashFunction>& cache) const;
public:
/** Default constructor, makes a null expression. */
TypeNode() : d_nv(&expr::NodeValue::null()) { }
/** Copy constructor */
TypeNode(const TypeNode& node);
/**
* Destructor. If ref_count is true it will decrement the reference count
* and, if zero, collect the NodeValue.
*/
~TypeNode();
/**
* Assignment operator for nodes, copies the relevant information from node
* to this node.
*
* @param typeNode the node to copy
* @return reference to this node
*/
TypeNode& operator=(const TypeNode& typeNode);
/**
* Return the null node.
*
* @return the null node
*/
static TypeNode null() {
return s_null;
}
/**
* Substitution of TypeNodes.
*/
inline TypeNode
substitute(const TypeNode& type, const TypeNode& replacement) const;
/**
* Simultaneous substitution of TypeNodes.
*/
template <class Iterator1, class Iterator2>
inline TypeNode
substitute(Iterator1 typesBegin, Iterator1 typesEnd,
Iterator2 replacementsBegin, Iterator2 replacementsEnd) const;
/**
* Structural comparison operator for expressions.
*
* @param typeNode the type node to compare to
* @return true if expressions are equal, false otherwise
*/
bool operator==(const TypeNode& typeNode) const {
return d_nv == typeNode.d_nv;
}
/**
* Structural comparison operator for expressions.
*
* @param typeNode the type node to compare to
* @return true if expressions are equal, false otherwise
*/
bool operator!=(const TypeNode& typeNode) const {
return !(*this == typeNode);
}
/**
* We compare by expression ids so, keeping things deterministic and having
* that subexpressions have to be smaller than the enclosing expressions.
*
* @param typeNode the node to compare to
* @return true if this expression is lesser
*/
inline bool operator<(const TypeNode& typeNode) const {
return d_nv->d_id < typeNode.d_nv->d_id;
}
/**
* We compare by expression ids so, keeping things deterministic and having
* that subexpressions have to be smaller than the enclosing expressions.
*
* @param typeNode the node to compare to
* @return true if this expression is lesser or equal
*/
inline bool operator<=(const TypeNode& typeNode) const {
return d_nv->d_id <= typeNode.d_nv->d_id;
}
/**
* We compare by expression ids so, keeping things deterministic and having
* that subexpressions have to be smaller than the enclosing expressions.
*
* @param typeNode the node to compare to
* @return true if this expression is greater
*/
inline bool operator>(const TypeNode& typeNode) const {
return d_nv->d_id > typeNode.d_nv->d_id;
}
/**
* We compare by expression ids so, keeping things deterministic and having
* that subexpressions have to be smaller than the enclosing expressions.
*
* @param typeNode the node to compare to
* @return true if this expression is greater or equal
*/
inline bool operator>=(const TypeNode& typeNode) const {
return d_nv->d_id >= typeNode.d_nv->d_id;
}
/**
* Returns the i-th child of this node.
*
* @param i the index of the child
* @return the node representing the i-th child
*/
inline TypeNode operator[](int i) const {
return TypeNode(d_nv->getChild(i));
}
/**
* PARAMETERIZED-metakinded types (the SORT_TYPE is one of these)
* have an operator. "Little-p parameterized" types (like Array),
* are OPERATORs, not PARAMETERIZEDs.
*/
inline Node getOperator() const {
Assert(getMetaKind() == kind::metakind::PARAMETERIZED);
return Node(d_nv->getOperator());
}
/**
* Returns the unique id of this node
*
* @return the id
*/
inline unsigned long getId() const {
return d_nv->getId();
}
/**
* Returns the kind of this type node.
*
* @return the kind
*/
inline Kind getKind() const {
return Kind(d_nv->d_kind);
}
/**
* Returns the metakind of this type node.
*
* @return the metakind
*/
inline kind::MetaKind getMetaKind() const {
return kind::metaKindOf(getKind());
}
/**
* Returns the number of children this node has.
*
* @return the number of children
*/
inline size_t getNumChildren() const;
/**
* If this is a CONST_* TypeNode, extract the constant from it.
*/
template <class T>
inline const T& getConst() const;
/**
* Returns the value of the given attribute that this has been attached.
*
* @param attKind the kind of the attribute
* @return the value of the attribute
*/
template <class AttrKind>
inline typename AttrKind::value_type
getAttribute(const AttrKind& attKind) const;
// Note that there are two, distinct hasAttribute() declarations for
// a reason (rather than using a pointer-valued argument with a
// default value): they permit more optimized code in the underlying
// hasAttribute() implementations.
/**
* Returns true if this node has been associated an attribute of
* given kind. Additionally, if a pointer to the value_kind is
* give, and the attribute value has been set for this node, it will
* be returned.
*
* @param attKind the kind of the attribute
* @return true if this node has the requested attribute
*/
template <class AttrKind>
inline bool hasAttribute(const AttrKind& attKind) const;
/**
* Returns true if this node has been associated an attribute of given kind.
* Additionaly, if a pointer to the value_kind is give, and the attribute
* value has been set for this node, it will be returned.
*
* @param attKind the kind of the attribute
* @param value where to store the value if it exists
* @return true if this node has the requested attribute
*/
template <class AttrKind>
inline bool getAttribute(const AttrKind& attKind,
typename AttrKind::value_type& value) const;
/**
* Sets the given attribute of this node to the given value.
*
* @param attKind the kind of the atribute
* @param value the value to set the attribute to
*/
template <class AttrKind>
inline void setAttribute(const AttrKind& attKind,
const typename AttrKind::value_type& value);
/** Iterator allowing for scanning through the children. */
typedef expr::NodeValue::iterator<TypeNode> iterator;
/** Constant iterator allowing for scanning through the children. */
typedef expr::NodeValue::iterator<TypeNode> const_iterator;
/**
* Returns the iterator pointing to the first child.
*
* @return the iterator
*/
inline iterator begin() {
return d_nv->begin<TypeNode>();
}
/**
* Returns the iterator pointing to the end of the children (one
* beyond the last one.
*
* @return the end of the children iterator.
*/
inline iterator end() {
return d_nv->end<TypeNode>();
}
/**
* Returns the const_iterator pointing to the first child.
*
* @return the const_iterator
*/
inline const_iterator begin() const {
return d_nv->begin<TypeNode>();
}
/**
* Returns the const_iterator pointing to the end of the children
* (one beyond the last one.
*
* @return the end of the children const_iterator.
*/
inline const_iterator end() const {
return d_nv->end<TypeNode>();
}
/**
* Converts this type into a string representation.
*
* @return the string representation of this type.
*/
std::string toString() const;
/**
* Converts this node into a string representation and sends it to the
* given stream
*
* @param out the stream to serialize this node to
* @param language the language in which to output
*/
inline void toStream(std::ostream& out, OutputLanguage language = language::output::LANG_AUTO) const {
d_nv->toStream(out, -1, false, 0, language);
}
/**
* Very basic pretty printer for Node.
*
* @param out output stream to print to.
* @param indent number of spaces to indent the formula by.
*/
void printAst(std::ostream& out, int indent = 0) const;
/**
* Returns true if this type is a null type.
*
* @return true if null
*/
bool isNull() const {
return d_nv == &expr::NodeValue::null();
}
/**
* Convert this TypeNode into a Type using the currently-in-scope
* manager.
*/
inline Type toType();
/**
* Convert a Type into a TypeNode.
*/
inline static TypeNode fromType(const Type& t);
/**
* Returns the cardinality of this type.
*
* @return a finite or infinite cardinality
*/
Cardinality getCardinality() const;
/**
* Is this type finite? This assumes uninterpreted sorts have infinite
* cardinality.
*/
bool isFinite();
/**
* Is this type interpreted as finite.
* If finite model finding is enabled, this assumes all uninterpreted sorts
* are interpreted as finite.
*/
bool isInterpretedFinite();
/** is closed enumerable type
*
* This returns true if this type has an enumerator that produces constants
* that are fully handled by CVC4's quantifier-free theory solvers. Examples
* of types that are not closed enumerable are:
* (1) uninterpreted sorts,
* (2) arrays,
* (3) codatatypes,
* (4) functions,
* (5) parametric sorts involving any of the above.
*/
bool isClosedEnumerable();
/**
* Is this a first-class type?
* First-class types are types for which:
* (1) we handle equalities between terms of that type, and
* (2) they are allowed to be parameters of parametric types (e.g. index or element types of arrays).
*
* Examples of types that are not first-class include constructor types,
* selector types, tester types, regular expressions and SExprs.
*/
bool isFirstClass() const;
/**
* Returns whether this type is well-founded.
*
* @return true iff the type is well-founded
*/
bool isWellFounded() const;
/**
* Construct and return a ground term of this type. If the type is
* not well founded, this function throws an exception.
*
* @return a ground term of the type
*/
Node mkGroundTerm() const;
/**
* Construct and return a ground value of this type. If the type is
* not well founded, this function throws an exception.
*
* @return a ground value of the type
*/
Node mkGroundValue() const;
/**
* Is this type a subtype of the given type?
*/
bool isSubtypeOf(TypeNode t) const;
/**
* Is this type comparable to the given type (i.e., do they share
* a common ancestor in the subtype tree)?
*/
bool isComparableTo(TypeNode t) const;
/** Is this the Boolean type? */
bool isBoolean() const;
/** Is this the Integer type? */
bool isInteger() const;
/** Is this the Real type? */
bool isReal() const;
/** Is this the String type? */
bool isString() const;
/** Is this a string-like type? (string or sequence) */
bool isStringLike() const;
/** Is this the Rounding Mode type? */
bool isRoundingMode() const;
/** Is this an array type? */
bool isArray() const;
/** Is this a Set type? */
bool isSet() const;
/** Is this a Sequence type? */
bool isSequence() const;
/** Get the index type (for array types) */
TypeNode getArrayIndexType() const;
/** Get the element type (for array types) */
TypeNode getArrayConstituentType() const;
/** Get the return type (for constructor types) */
TypeNode getConstructorRangeType() const;
/** Get the domain type (for selector types) */
TypeNode getSelectorDomainType() const;
/** Get the return type (for selector types) */
TypeNode getSelectorRangeType() const;
/** Get the element type (for set types) */
TypeNode getSetElementType() const;
/** Get the element type (for sequence types) */
TypeNode getSequenceElementType() const;
/**
* Is this a function type? Function-like things (e.g. datatype
* selectors) that aren't actually functions are NOT considered
* functions, here.
*/
bool isFunction() const;
/**
* Is this a function-LIKE type? Function-like things
* (e.g. datatype selectors) that aren't actually functions ARE
* considered functions, here. The main point is that this is used
* to avoid anything higher-order: anything function-like cannot be
* the argument or return value for anything else function-like.
*
* Arrays are explicitly *not* function-like for the purposes of
* this test. However, functions still cannot contain anything
* function-like.
*/
bool isFunctionLike() const;
/**
* Get the argument types of a function, datatype constructor,
* datatype selector, or datatype tester.
*/
std::vector<TypeNode> getArgTypes() const;
/**
* Get the paramater types of a parameterized datatype. Fails an
* assertion if this type is not a parametric datatype.
*/
std::vector<TypeNode> getParamTypes() const;
/**
* Get the range type (i.e., the type of the result) of a function,
* datatype constructor, datatype selector, or datatype tester.
*/
TypeNode getRangeType() const;
/**
* Is this a predicate type? NOTE: all predicate types are also
* function types (so datatype testers are NOT considered
* "predicates" for the purpose of this function).
*/
bool isPredicate() const;
/**
* Is this a predicate-LIKE type? Predicate-like things
* (e.g. datatype testers) that aren't actually predicates ARE
* considered predicates, here.
*
* Arrays are explicitly *not* predicate-like for the purposes of
* this test.
*/
bool isPredicateLike() const;
/** Is this a tuple type? */
bool isTuple() const;
/** Get the length of a tuple type */
size_t getTupleLength() const;
/** Get the constituent types of a tuple type */
std::vector<TypeNode> getTupleTypes() const;
/** Is this a symbolic expression type? */
bool isSExpr() const;
/** Get the constituent types of a symbolic expression type */
std::vector<TypeNode> getSExprTypes() const;
/** Is this a regexp type */
bool isRegExp() const;
/** Is this a floating-point type */
bool isFloatingPoint() const;
/** Is this a floating-point type of with <code>exp</code> exponent bits
and <code>sig</code> significand bits */
bool isFloatingPoint(unsigned exp, unsigned sig) const;
/** Is this a bit-vector type */
bool isBitVector() const;
/** Is this a bit-vector type of size <code>size</code> */
bool isBitVector(unsigned size) const;
/** Is this a datatype type */
bool isDatatype() const;
/** Is this a parameterized datatype type */
bool isParametricDatatype() const;
/** Is this a codatatype type */
bool isCodatatype() const;
/** Is this a fully instantiated datatype type */
bool isInstantiatedDatatype() const;
/**
* Get instantiated datatype type. The type on which this method is called
* should be a parametric datatype whose parameter list is the same size as
* argument params. This constructs the instantiated version of this
* parametric datatype, e.g. passing (par (A) (List A)), { Int } ) to this
* method returns (List Int).
*/
TypeNode instantiateParametricDatatype(
const std::vector<TypeNode>& params) const;
/** Is this an instantiated datatype parameter */
bool isParameterInstantiatedDatatype(unsigned n) const;
/** Is this a constructor type */
bool isConstructor() const;
/** Is this a selector type */
bool isSelector() const;
/** Is this a tester type */
bool isTester() const;
/** Get the internal Datatype specification from a datatype type */
const DType& getDType() const;
/** Get the exponent size of this floating-point type */
unsigned getFloatingPointExponentSize() const;
/** Get the significand size of this floating-point type */
unsigned getFloatingPointSignificandSize() const;
/** Get the size of this bit-vector type */
unsigned getBitVectorSize() const;
/** Is this a sort kind */
bool isSort() const;
/** Is this a sort constructor kind */
bool isSortConstructor() const;
/** Get sort constructor arity */
uint64_t getSortConstructorArity() const;
/**
* Instantiate a sort constructor type. The type on which this method is
* called should be a sort constructor type whose parameter list is the
* same size as argument params. This constructs the instantiated version of
* this sort constructor. For example, this is a sort constructor, e.g.
* declared via (declare-sort U 2), then calling this method with
* { Int, Int } will generate the instantiated sort (U Int Int).
*/
TypeNode instantiateSortConstructor(
const std::vector<TypeNode>& params) const;
/** Get the most general base type of the type */
TypeNode getBaseType() const;
/**
* Returns the leastUpperBound in the extended type lattice of the two types.
* If this is \top, i.e. there is no inhabited type that contains both,
* a TypeNode such that isNull() is true is returned.
*
* For more information see: http://cvc4.cs.nyu.edu/wiki/Cvc4_Type_Lattice
*/
static TypeNode leastCommonTypeNode(TypeNode t0, TypeNode t1);
static TypeNode mostCommonTypeNode(TypeNode t0, TypeNode t1);
/** get ensure type condition
* Return value is a condition that implies that n has type tn.
*/
static Node getEnsureTypeCondition( Node n, TypeNode tn );
private:
static TypeNode commonTypeNode(TypeNode t0, TypeNode t1, bool isLeast);
/**
* Is this type interpreted as finite.
* If the flag usortFinite is true, this assumes all uninterpreted sorts
* are interpreted as finite.
*/
bool isFiniteInternal(bool usortFinite);
/**
* Indents the given stream a given amount of spaces.
*
* @param out the stream to indent
* @param indent the number of spaces
*/
static void indent(std::ostream& out, int indent) {
for(int i = 0; i < indent; i++) {
out << ' ';
}
}
};/* class TypeNode */
/**
* Serializes a given node to the given stream.
*
* @param out the output stream to use
* @param n the node to output to the stream
* @return the stream
*/
inline std::ostream& operator<<(std::ostream& out, const TypeNode& n) {
n.toStream(out, Node::setlanguage::getLanguage(out));
return out;
}
typedef TypeNode::HashFunction TypeNodeHashFunction;
}/* CVC4 namespace */
#include "expr/node_manager.h"
namespace CVC4 {
inline Type TypeNode::toType() {
return NodeManager::currentNM()->toType(*this);
}
inline TypeNode TypeNode::fromType(const Type& t) {
return NodeManager::fromType(t);
}
inline TypeNode
TypeNode::substitute(const TypeNode& type,
const TypeNode& replacement) const {
std::unordered_map<TypeNode, TypeNode, HashFunction> cache;
return substitute(type, replacement, cache);
}
template <class Iterator1, class Iterator2>
inline TypeNode
TypeNode::substitute(Iterator1 typesBegin,
Iterator1 typesEnd,
Iterator2 replacementsBegin,
Iterator2 replacementsEnd) const {
std::unordered_map<TypeNode, TypeNode, HashFunction> cache;
return substitute(typesBegin, typesEnd,
replacementsBegin, replacementsEnd, cache);
}
template <class Iterator1, class Iterator2>
TypeNode TypeNode::substitute(Iterator1 typesBegin,
Iterator1 typesEnd,
Iterator2 replacementsBegin,
Iterator2 replacementsEnd,
std::unordered_map<TypeNode, TypeNode, HashFunction>& cache) const {
// in cache?
std::unordered_map<TypeNode, TypeNode, HashFunction>::const_iterator i = cache.find(*this);
if(i != cache.end()) {
return (*i).second;
}
// otherwise compute
Assert(typesEnd - typesBegin == replacementsEnd - replacementsBegin)
<< "Substitution iterator ranges must be equal size";
Iterator1 j = find(typesBegin, typesEnd, *this);
if(j != typesEnd) {
TypeNode tn = *(replacementsBegin + (j - typesBegin));
cache[*this] = tn;
return tn;
} else if(getNumChildren() == 0) {
cache[*this] = *this;
return *this;
} else {
NodeBuilder<> nb(getKind());
if(getMetaKind() == kind::metakind::PARAMETERIZED) {
// push the operator
nb << TypeNode(d_nv->d_children[0]);
}
for (const TypeNode& tn : *this)
{
nb << tn.substitute(
typesBegin, typesEnd, replacementsBegin, replacementsEnd, cache);
}
TypeNode tn = nb.constructTypeNode();
cache[*this] = tn;
return tn;
}
}
inline size_t TypeNode::getNumChildren() const {
return d_nv->getNumChildren();
}
template <class T>
inline const T& TypeNode::getConst() const {
return d_nv->getConst<T>();
}
inline TypeNode::TypeNode(const expr::NodeValue* ev) :
d_nv(const_cast<expr::NodeValue*> (ev)) {
Assert(d_nv != NULL) << "Expecting a non-NULL expression value!";
d_nv->inc();
}
inline TypeNode::TypeNode(const TypeNode& typeNode) {
Assert(typeNode.d_nv != NULL) << "Expecting a non-NULL expression value!";
d_nv = typeNode.d_nv;
d_nv->inc();
}
inline TypeNode::~TypeNode() {
Assert(d_nv != NULL) << "Expecting a non-NULL expression value!";
d_nv->dec();
}
inline void TypeNode::assignNodeValue(expr::NodeValue* ev) {
d_nv = ev;
d_nv->inc();
}
inline TypeNode& TypeNode::operator=(const TypeNode& typeNode) {
Assert(d_nv != NULL) << "Expecting a non-NULL expression value!";
Assert(typeNode.d_nv != NULL)
<< "Expecting a non-NULL expression value on RHS!";
if(__builtin_expect( ( d_nv != typeNode.d_nv ), true )) {
d_nv->dec();
d_nv = typeNode.d_nv;
d_nv->inc();
}
return *this;
}
template <class AttrKind>
inline typename AttrKind::value_type TypeNode::
getAttribute(const AttrKind&) const {
Assert(NodeManager::currentNM() != NULL)
<< "There is no current CVC4::NodeManager associated to this thread.\n"
"Perhaps a public-facing function is missing a NodeManagerScope ?";
return NodeManager::currentNM()->getAttribute(d_nv, AttrKind());
}
template <class AttrKind>
inline bool TypeNode::
hasAttribute(const AttrKind&) const {
Assert(NodeManager::currentNM() != NULL)
<< "There is no current CVC4::NodeManager associated to this thread.\n"
"Perhaps a public-facing function is missing a NodeManagerScope ?";
return NodeManager::currentNM()->hasAttribute(d_nv, AttrKind());
}
template <class AttrKind>
inline bool TypeNode::getAttribute(const AttrKind&, typename AttrKind::value_type& ret) const {
Assert(NodeManager::currentNM() != NULL)
<< "There is no current CVC4::NodeManager associated to this thread.\n"
"Perhaps a public-facing function is missing a NodeManagerScope ?";
return NodeManager::currentNM()->getAttribute(d_nv, AttrKind(), ret);
}
template <class AttrKind>
inline void TypeNode::
setAttribute(const AttrKind&, const typename AttrKind::value_type& value) {
Assert(NodeManager::currentNM() != NULL)
<< "There is no current CVC4::NodeManager associated to this thread.\n"
"Perhaps a public-facing function is missing a NodeManagerScope ?";
NodeManager::currentNM()->setAttribute(d_nv, AttrKind(), value);
}
inline void TypeNode::printAst(std::ostream& out, int indent) const {
d_nv->printAst(out, indent);
}
inline bool TypeNode::isBoolean() const {
return
( getKind() == kind::TYPE_CONSTANT && getConst<TypeConstant>() == BOOLEAN_TYPE );
}
inline bool TypeNode::isInteger() const {
return
( getKind() == kind::TYPE_CONSTANT && getConst<TypeConstant>() == INTEGER_TYPE );
}
inline bool TypeNode::isReal() const {
return
( getKind() == kind::TYPE_CONSTANT && getConst<TypeConstant>() == REAL_TYPE ) ||
isInteger();
}
inline bool TypeNode::isString() const {
return getKind() == kind::TYPE_CONSTANT &&
getConst<TypeConstant>() == STRING_TYPE;
}
/** Is this a regexp type */
inline bool TypeNode::isRegExp() const {
return getKind() == kind::TYPE_CONSTANT &&
getConst<TypeConstant>() == REGEXP_TYPE;
}
inline bool TypeNode::isRoundingMode() const {
return getKind() == kind::TYPE_CONSTANT &&
getConst<TypeConstant>() == ROUNDINGMODE_TYPE;
}
inline bool TypeNode::isArray() const {
return getKind() == kind::ARRAY_TYPE;
}
inline TypeNode TypeNode::getArrayIndexType() const {
Assert(isArray());
return (*this)[0];
}
inline TypeNode TypeNode::getArrayConstituentType() const {
Assert(isArray());
return (*this)[1];
}
inline TypeNode TypeNode::getConstructorRangeType() const {
Assert(isConstructor());
return (*this)[getNumChildren()-1];
}
inline TypeNode TypeNode::getSelectorDomainType() const
{
Assert(isSelector());
return (*this)[0];
}
inline TypeNode TypeNode::getSelectorRangeType() const
{
Assert(isSelector());
return (*this)[1];
}
inline bool TypeNode::isSet() const {
return getKind() == kind::SET_TYPE;
}
inline bool TypeNode::isSequence() const
{
return getKind() == kind::SEQUENCE_TYPE;
}
inline TypeNode TypeNode::getSetElementType() const {
Assert(isSet());
return (*this)[0];
}
inline bool TypeNode::isFunction() const {
return getKind() == kind::FUNCTION_TYPE;
}
inline bool TypeNode::isFunctionLike() const {
return
getKind() == kind::FUNCTION_TYPE ||
getKind() == kind::CONSTRUCTOR_TYPE ||
getKind() == kind::SELECTOR_TYPE ||
getKind() == kind::TESTER_TYPE;
}
inline bool TypeNode::isPredicate() const {
return isFunction() && getRangeType().isBoolean();
}
inline bool TypeNode::isPredicateLike() const {
return isFunctionLike() && getRangeType().isBoolean();
}
inline TypeNode TypeNode::getRangeType() const {
if(isTester()) {
return NodeManager::currentNM()->booleanType();
}
Assert(isFunction() || isConstructor() || isSelector());
return (*this)[getNumChildren() - 1];
}
/** Is this a symbolic expression type? */
inline bool TypeNode::isSExpr() const {
return getKind() == kind::SEXPR_TYPE;
}
/** Is this a floating-point type */
inline bool TypeNode::isFloatingPoint() const {
return getKind() == kind::FLOATINGPOINT_TYPE;
}
/** Is this a bit-vector type */
inline bool TypeNode::isBitVector() const {
return getKind() == kind::BITVECTOR_TYPE;
}
/** Is this a datatype type */
inline bool TypeNode::isDatatype() const {
return getKind() == kind::DATATYPE_TYPE || getKind() == kind::PARAMETRIC_DATATYPE;
}
/** Is this a parametric datatype type */
inline bool TypeNode::isParametricDatatype() const {
return getKind() == kind::PARAMETRIC_DATATYPE;
}
/** Is this a constructor type */
inline bool TypeNode::isConstructor() const {
return getKind() == kind::CONSTRUCTOR_TYPE;
}
/** Is this a selector type */
inline bool TypeNode::isSelector() const {
return getKind() == kind::SELECTOR_TYPE;
}
/** Is this a tester type */
inline bool TypeNode::isTester() const {
return getKind() == kind::TESTER_TYPE;
}
/** Is this a floating-point type of with <code>exp</code> exponent bits
and <code>sig</code> significand bits */
inline bool TypeNode::isFloatingPoint(unsigned exp, unsigned sig) const {
return
( getKind() == kind::FLOATINGPOINT_TYPE &&
getConst<FloatingPointSize>().exponent() == exp &&
getConst<FloatingPointSize>().significand() == sig );
}
/** Is this a bit-vector type of size <code>size</code> */
inline bool TypeNode::isBitVector(unsigned size) const {
return
( getKind() == kind::BITVECTOR_TYPE && getConst<BitVectorSize>() == size );
}
/** Get the exponent size of this floating-point type */
inline unsigned TypeNode::getFloatingPointExponentSize() const {
Assert(isFloatingPoint());
return getConst<FloatingPointSize>().exponent();
}
/** Get the significand size of this floating-point type */
inline unsigned TypeNode::getFloatingPointSignificandSize() const {
Assert(isFloatingPoint());
return getConst<FloatingPointSize>().significand();
}
/** Get the size of this bit-vector type */
inline unsigned TypeNode::getBitVectorSize() const {
Assert(isBitVector());
return getConst<BitVectorSize>();
}
#ifdef CVC4_DEBUG
/**
* Pretty printer for use within gdb. This is not intended to be used
* outside of gdb. This writes to the Warning() stream and immediately
* flushes the stream.
*
* Note that this function cannot be a template, since the compiler
* won't instantiate it. Even if we explicitly instantiate. (Odd?)
* So we implement twice. We mark as __attribute__((used)) so that
* GCC emits code for it even though static analysis indicates it's
* never called.
*
* Tim's Note: I moved this into the node.h file because this allows gdb
* to find the symbol, and use it, which is the first standard this code needs
* to meet. A cleaner solution is welcomed.
*/
static void __attribute__((used)) debugPrintTypeNode(const TypeNode& n) {
Warning() << Node::setdepth(-1)
<< Node::printtypes(false)
<< Node::dag(true)
<< Node::setlanguage(language::output::LANG_AST)
<< n << std::endl;
Warning().flush();
}
static void __attribute__((used)) debugPrintTypeNodeNoDag(const TypeNode& n) {
Warning() << Node::setdepth(-1)
<< Node::printtypes(false)
<< Node::dag(false)
<< Node::setlanguage(language::output::LANG_AST)
<< n << std::endl;
Warning().flush();
}
static void __attribute__((used)) debugPrintRawTypeNode(const TypeNode& n) {
n.printAst(Warning(), 0);
Warning().flush();
}
#endif /* CVC4_DEBUG */
}/* CVC4 namespace */
#endif /* CVC4__NODE_H */
|