Home
last modified time | relevance | path

Searched refs:d_nv (Results 1 – 13 of 13) sorted by relevance

/dports/math/cvc4/CVC4-1.7/src/expr/
H A Dnode_builder.h238 d_nv = NULL; in setUsed()
343 d_nv = newBlock; in crop()
665 d_nv->d_children[d_nv->d_nchildren++] = nv; in append()
678 d_nv->d_children[d_nv->d_nchildren++] = nv; in append()
795 d_nv = newBlock; in realloc()
807 d_nv = newBlock; in realloc()
809 d_nv->d_rc = 0; in realloc()
834 free(d_nv); in dealloc()
1273 d_nv->d_children + d_nv->d_nchildren, in constructNV()
1306 Assert(nb.d_nv->nv_end() >= nb.d_nv->nv_begin()); in internalCopy()
[all …]
H A Dtype_node.h162 return d_nv == typeNode.d_nv;
183 return d_nv->d_id < typeNode.d_nv->d_id;
194 return d_nv->d_id <= typeNode.d_nv->d_id;
205 return d_nv->d_id > typeNode.d_nv->d_id;
216 return d_nv->d_id >= typeNode.d_nv->d_id;
783 d_nv->inc(); in TypeNode()
788 d_nv = typeNode.d_nv; in TypeNode()
789 d_nv->inc(); in TypeNode()
794 d_nv->dec(); in ~TypeNode()
798 d_nv = ev; in assignNodeValue()
[all …]
H A Dnode.h340 return d_nv == node.d_nv;
352 return d_nv != node.d_nv;
365 return d_nv->d_id < node.d_nv->d_id;
378 return d_nv->d_id > node.d_nv->d_id;
391 return d_nv->d_id <= node.d_nv->d_id;
404 return d_nv->d_id >= node.d_nv->d_id;
1100 d_nv = e.d_nv; in NodeTemplate()
1113 d_nv = e.d_nv; in NodeTemplate()
1127 d_nv = e.d_node->d_nv; in NodeTemplate()
1167 d_nv = e.d_nv;
[all …]
H A Dattribute.h530 return d_attrManager->getAttribute(n.d_nv, AttrKind());
536 return d_attrManager->hasAttribute(n.d_nv, AttrKind());
543 return d_attrManager->getAttribute(n.d_nv, AttrKind(), ret);
550 d_attrManager->setAttribute(n.d_nv, AttrKind(), value);
556 return d_attrManager->getAttribute(n.d_nv, AttrKind());
562 return d_attrManager->hasAttribute(n.d_nv, AttrKind());
569 return d_attrManager->getAttribute(n.d_nv, AttrKind(), ret);
576 d_attrManager->setAttribute(n.d_nv, AttrKind(), value);
H A Dnode_value.h303 NodeValue* d_nv; variable
307 d_nv(const_cast<NodeValue*>(nv)) { in RefCountGuard()
308 d_increased = (d_nv->d_rc == 0); in RefCountGuard()
310 d_nv->d_rc = 1; in RefCountGuard()
320 --d_nv->d_rc; in ~RefCountGuard()
H A Dnode_manager.cpp334 n.d_nv = nv; in reclaimZombies()
635 Assert( hasAttribute(constructor.d_nv, expr::SortArityAttr()) && in mkSort()
636 hasAttribute(constructor.d_nv, expr::VarNameAttr()), in mkSort()
638 std::string name = getAttribute(constructor.d_nv, expr::VarNameAttr()); in mkSort()
639 Assert(getAttribute(constructor.d_nv, expr::SortArityAttr()) == children.size(), in mkSort()
642 Node sortTag = Node(constructor.d_nv->d_children[0]); in mkSort()
H A Dmetakind_template.cpp116 toStream(out, n.d_nv); in toStream()
H A Dtype_node.cpp46 nb << TypeNode(d_nv->d_children[0]); in substitute()
514 d_nv->toStream(ss, -1, false, 0, outlang); in toString()
H A Dexpr_template.cpp254 uint64_t to_int = (uint64_t)(to_e.getNode().d_nv); in exportInternal()
255 uint64_t from_int = (uint64_t)(from_e.getNode().d_nv); in exportInternal()
H A Dpickler.cpp187 const NodeValue* nv = n.d_nv; in toCaseVariable()
H A Dnode_manager.h1249 return kind::operatorToKind(n.d_nv); in operatorToKind()
/dports/math/cvc4/CVC4-1.7/test/unit/expr/
H A Dnode_manager_white.h83 std::vector<NodeValue*> roots = {n1.d_nv}; in testTopologicalSort()
88 std::vector<NodeValue*> roots = {n2.d_nv, n1.d_nv}; in testTopologicalSort()
89 std::vector<NodeValue*> result = {n1.d_nv, n2.d_nv}; in testTopologicalSort()
H A Dnode_white.h60 TS_ASSERT(b.d_nv->getId() == 0); in testBuilder()
61 TS_ASSERT(b.d_nv->getKind() == UNDEFINED_KIND); in testBuilder()
62 TS_ASSERT_EQUALS(b.d_nv->d_nchildren, 0u); in testBuilder()