You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
115 lines
4.0 KiB
115 lines
4.0 KiB
/*
|
|
* Copyright 2011-2016 Formal Methods and Tools, University of Twente
|
|
* Copyright 2016 Tom van Dijk, Johannes Kepler University Linz
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
/**
|
|
* Internals of Sylvan
|
|
*/
|
|
|
|
#include <sylvan.h>
|
|
|
|
#include <sylvan_cache.h>
|
|
#include <sylvan_table.h>
|
|
#include <sylvan_stats.h>
|
|
|
|
#ifndef SYLVAN_INT_H
|
|
#define SYLVAN_INT_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif /* __cplusplus */
|
|
|
|
/**
|
|
* Nodes table.
|
|
*/
|
|
extern llmsset_t nodes;
|
|
|
|
/**
|
|
* Macros for all operation identifiers for the operation cache
|
|
*/
|
|
|
|
// BDD operations
|
|
#define CACHE_BDD_ITE (0LL<<40)
|
|
#define CACHE_BDD_AND (1LL<<40)
|
|
#define CACHE_BDD_XOR (2LL<<40)
|
|
#define CACHE_BDD_EXISTS (3LL<<40)
|
|
#define CACHE_BDD_PROJECT (4LL<<40)
|
|
#define CACHE_BDD_AND_EXISTS (5LL<<40)
|
|
#define CACHE_BDD_AND_PROJECT (6LL<<40)
|
|
#define CACHE_BDD_RELNEXT (7LL<<40)
|
|
#define CACHE_BDD_RELPREV (8LL<<40)
|
|
#define CACHE_BDD_SATCOUNT (9LL<<40)
|
|
#define CACHE_BDD_COMPOSE (10LL<<40)
|
|
#define CACHE_BDD_RESTRICT (11LL<<40)
|
|
#define CACHE_BDD_CONSTRAIN (12LL<<40)
|
|
#define CACHE_BDD_CLOSURE (13LL<<40)
|
|
#define CACHE_BDD_ISBDD (14LL<<40)
|
|
#define CACHE_BDD_SUPPORT (15LL<<40)
|
|
#define CACHE_BDD_PATHCOUNT (16LL<<40)
|
|
|
|
// MDD operations
|
|
#define CACHE_MDD_RELPROD (20LL<<40)
|
|
#define CACHE_MDD_MINUS (21LL<<40)
|
|
#define CACHE_MDD_UNION (22LL<<40)
|
|
#define CACHE_MDD_INTERSECT (23LL<<40)
|
|
#define CACHE_MDD_PROJECT (24LL<<40)
|
|
#define CACHE_MDD_JOIN (25LL<<40)
|
|
#define CACHE_MDD_MATCH (26LL<<40)
|
|
#define CACHE_MDD_RELPREV (27LL<<40)
|
|
#define CACHE_MDD_SATCOUNT (28LL<<40)
|
|
#define CACHE_MDD_SATCOUNTL1 (29LL<<40)
|
|
#define CACHE_MDD_SATCOUNTL2 (30LL<<40)
|
|
|
|
// MTBDD operations
|
|
#define CACHE_MTBDD_APPLY (40LL<<40)
|
|
#define CACHE_MTBDD_UAPPLY (41LL<<40)
|
|
#define CACHE_MTBDD_ABSTRACT (42LL<<40)
|
|
#define CACHE_MTBDD_ITE (43LL<<40)
|
|
#define CACHE_MTBDD_AND_ABSTRACT_PLUS (44LL<<40)
|
|
#define CACHE_MTBDD_AND_ABSTRACT_MAX (45LL<<40)
|
|
#define CACHE_MTBDD_SUPPORT (46LL<<40)
|
|
#define CACHE_MTBDD_COMPOSE (47LL<<40)
|
|
#define CACHE_MTBDD_EQUAL_NORM (48LL<<40)
|
|
#define CACHE_MTBDD_EQUAL_NORM_REL (49LL<<40)
|
|
#define CACHE_MTBDD_MINIMUM (50LL<<40)
|
|
#define CACHE_MTBDD_MAXIMUM (51LL<<40)
|
|
#define CACHE_MTBDD_LEQ (52LL<<40)
|
|
#define CACHE_MTBDD_LESS (53LL<<40)
|
|
#define CACHE_MTBDD_GEQ (54LL<<40)
|
|
#define CACHE_MTBDD_GREATER (55LL<<40)
|
|
#define CACHE_MTBDD_EVAL_COMPOSE (56LL<<40)
|
|
#define CACHE_MTBDD_NONZERO_COUNT (57LL<<40)
|
|
#define CACHE_MTBDD_AND_EXISTS_RN (58LL<<40)
|
|
#define CACHE_MTBDD_MINIMUM_RN (59LL<<40)
|
|
#define CACHE_MTBDD_MAXIMUM_RN (60LL<<40)
|
|
#define CACHE_MTBDD_EQUAL_NORM_RN (61LL<<40)
|
|
#define CACHE_MTBDD_EQUAL_NORM_REL_RN (62LL<<40)
|
|
#define CACHE_MTBDD_AND_EXISTS_RF (63LL<<40)
|
|
#define CACHE_MTBDD_MINIMUM_RF (64LL<<40)
|
|
#define CACHE_MTBDD_MAXIMUM_RF (65LL<<40)
|
|
#define CACHE_MTBDD_EQUAL_NORM_RF (66LL<<40)
|
|
#define CACHE_MTBDD_EQUAL_NORM_REL_RF (67LL<<40)
|
|
|
|
#define CACHE_MTBDD_ABSTRACT_REPRESENTATIVE (68LL<<40)
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif /* __cplusplus */
|
|
|
|
#include <sylvan_mtbdd_int.h>
|
|
#include <sylvan_ldd_int.h>
|
|
|
|
#endif
|