490 lines
12 KiB
C++
Executable File
490 lines
12 KiB
C++
Executable File
/***********************************************************************************[SolverTypes.h]
|
|
MiniSat -- Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson
|
|
CryptoMiniSat -- Copyright (c) 2009 Mate Soos
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
|
|
associated documentation files (the "Software"), to deal in the Software without restriction,
|
|
including without limitation the rights to use, copy, modify, merge, publish, distribute,
|
|
sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in all copies or
|
|
substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
|
|
NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT
|
|
OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
**************************************************************************************************/
|
|
|
|
#ifndef CLAUSE_H
|
|
#define CLAUSE_H
|
|
|
|
#ifdef _MSC_VER
|
|
#include <msvc/stdint.h>
|
|
#else
|
|
#include <stdint.h>
|
|
#endif //_MSC_VER
|
|
#include <cstdio>
|
|
#include <vector>
|
|
#include <sys/types.h>
|
|
#include "Vec.h"
|
|
#include "SolverTypes.h"
|
|
#include "PackedRow.h"
|
|
#include "constants.h"
|
|
#include "SmallPtr.h"
|
|
#ifdef USE_POOLS
|
|
#include <boost/pool/pool.hpp>
|
|
#endif //USE_POOLS
|
|
#ifndef uint
|
|
#define uint unsigned int
|
|
#endif
|
|
|
|
//#define USE_4POOLS
|
|
|
|
using std::vector;
|
|
|
|
//=================================================================================================
|
|
// Clause -- a simple class for representing a clause:
|
|
|
|
class MatrixFinder;
|
|
|
|
class Clause
|
|
{
|
|
protected:
|
|
|
|
#ifdef STATS_NEEDED
|
|
uint group;
|
|
#endif
|
|
|
|
uint32_t isLearnt:1;
|
|
uint32_t strenghtened:1;
|
|
uint32_t varChanged:1;
|
|
uint32_t sorted:1;
|
|
uint32_t invertedXor:1;
|
|
uint32_t isXorClause:1;
|
|
uint32_t subsume0Done:1;
|
|
uint32_t isRemoved:1;
|
|
#ifdef USE_POOLS
|
|
uint32_t wasTriOriginallyInt:1;
|
|
uint32_t wasBinOriginallyInt:1;
|
|
#ifdef USE_4POOLS
|
|
uint32_t wasQuadOriginallyInt:1;
|
|
#endif //USE_4POOLS
|
|
#endif //USE_POOLS
|
|
uint32_t mySize:20;
|
|
|
|
union {uint32_t act; uint32_t abst;} extra;
|
|
float oldActivityInter;
|
|
#ifdef _MSC_VER
|
|
Lit data[1];
|
|
#else
|
|
Lit data[0];
|
|
#endif //_MSC_VER
|
|
|
|
#ifdef _MSC_VER
|
|
public:
|
|
#endif //_MSC_VER
|
|
template<class V>
|
|
Clause(const V& ps, const uint _group, const bool learnt)
|
|
{
|
|
isXorClause = false;
|
|
strenghtened = false;
|
|
sorted = false;
|
|
varChanged = true;
|
|
subsume0Done = false;
|
|
mySize = ps.size();
|
|
isLearnt = learnt;
|
|
isRemoved = false;
|
|
setGroup(_group);
|
|
#ifdef USE_POOLS
|
|
setAllocSize();
|
|
#endif //USE_POOLS
|
|
|
|
for (uint i = 0; i < ps.size(); i++) data[i] = ps[i];
|
|
if (learnt) {
|
|
extra.act = 0;
|
|
oldActivityInter = 0;
|
|
} else
|
|
calcAbstraction();
|
|
}
|
|
|
|
public:
|
|
#ifndef _MSC_VER
|
|
// -- use this function instead:
|
|
template<class T>
|
|
friend Clause* Clause_new(const T& ps, const uint group, const bool learnt);
|
|
friend Clause* Clause_new(Clause& c);
|
|
#endif //_MSC_VER
|
|
|
|
const uint size () const {
|
|
return mySize;
|
|
}
|
|
void resize (const uint size) {
|
|
mySize = size;
|
|
}
|
|
void shrink (const uint i) {
|
|
assert(i <= size());
|
|
mySize -= i;
|
|
}
|
|
void pop () {
|
|
shrink(1);
|
|
}
|
|
const bool isXor () {
|
|
return isXorClause;
|
|
}
|
|
const bool learnt () const {
|
|
return isLearnt;
|
|
}
|
|
float& oldActivity () {
|
|
return oldActivityInter;
|
|
}
|
|
|
|
const float& oldActivity () const {
|
|
return oldActivityInter;
|
|
}
|
|
|
|
|
|
const bool getStrenghtened() const {
|
|
return strenghtened;
|
|
}
|
|
void setStrenghtened() {
|
|
strenghtened = true;
|
|
sorted = false;
|
|
subsume0Done = false;
|
|
}
|
|
void unsetStrenghtened() {
|
|
strenghtened = false;
|
|
}
|
|
const bool getVarChanged() const {
|
|
return varChanged;
|
|
}
|
|
void setVarChanged() {
|
|
varChanged = true;
|
|
sorted = false;
|
|
subsume0Done = false;
|
|
}
|
|
void unsetVarChanged() {
|
|
varChanged = false;
|
|
}
|
|
const bool getSorted() const {
|
|
return sorted;
|
|
}
|
|
void setSorted() {
|
|
sorted = true;
|
|
}
|
|
void setUnsorted() {
|
|
sorted = false;
|
|
}
|
|
void subsume0Finished() {
|
|
subsume0Done = 1;
|
|
}
|
|
const bool subsume0IsFinished() {
|
|
return subsume0Done;
|
|
}
|
|
|
|
Lit& operator [] (uint32_t i) {
|
|
return data[i];
|
|
}
|
|
const Lit& operator [] (uint32_t i) const {
|
|
return data[i];
|
|
}
|
|
|
|
void setActivity(uint32_t i) {
|
|
extra.act = i;
|
|
}
|
|
|
|
const uint32_t& activity () const {
|
|
return extra.act;
|
|
}
|
|
|
|
void makeNonLearnt() {
|
|
assert(isLearnt);
|
|
isLearnt = false;
|
|
calcAbstraction();
|
|
}
|
|
|
|
void makeLearnt(const uint32_t newActivity) {
|
|
extra.act = newActivity;
|
|
oldActivityInter = 0;
|
|
isLearnt = true;
|
|
}
|
|
|
|
inline void strengthen(const Lit p)
|
|
{
|
|
remove(*this, p);
|
|
sorted = false;
|
|
calcAbstraction();
|
|
}
|
|
|
|
void calcAbstraction() {
|
|
assert(!learnt());
|
|
extra.abst = 0;
|
|
for (uint32_t i = 0; i != size(); i++)
|
|
extra.abst |= 1 << (data[i].toInt() & 31);
|
|
}
|
|
|
|
uint32_t getAbst()
|
|
{
|
|
return extra.abst;
|
|
}
|
|
|
|
const Lit* getData () const {
|
|
return data;
|
|
}
|
|
Lit* getData () {
|
|
return data;
|
|
}
|
|
const Lit* getDataEnd () const {
|
|
return data+size();
|
|
}
|
|
Lit* getDataEnd () {
|
|
return data+size();
|
|
}
|
|
void print(FILE* to = stdout) {
|
|
plainPrint(to);
|
|
fprintf(to, "c clause learnt %s group %d act %d oldAct %f\n", (learnt() ? "yes" : "no"), getGroup(), activity(), oldActivity());
|
|
}
|
|
void plainPrint(FILE* to = stdout) const {
|
|
for (uint i = 0; i < size(); i++) {
|
|
if (data[i].sign()) fprintf(to, "-");
|
|
fprintf(to, "%d ", data[i].var() + 1);
|
|
}
|
|
fprintf(to, "0\n");
|
|
}
|
|
#ifdef STATS_NEEDED
|
|
const uint32_t getGroup() const
|
|
{
|
|
return group;
|
|
}
|
|
void setGroup(const uint32_t _group)
|
|
{
|
|
group = _group;
|
|
}
|
|
#else
|
|
const uint getGroup() const
|
|
{
|
|
return 0;
|
|
}
|
|
void setGroup(const uint32_t _group)
|
|
{
|
|
return;
|
|
}
|
|
#endif //STATS_NEEDED
|
|
void setRemoved() {
|
|
isRemoved = true;
|
|
}
|
|
|
|
const bool removed() const {
|
|
return isRemoved;
|
|
}
|
|
#ifdef USE_POOLS
|
|
const bool wasTriOriginally() const
|
|
{
|
|
return wasTriOriginallyInt;
|
|
}
|
|
const bool wasBinOriginally() const
|
|
{
|
|
return wasBinOriginallyInt;
|
|
}
|
|
#ifdef USE_4POOLS
|
|
const bool wasQuadOriginally() const
|
|
{
|
|
return wasQuadOriginallyInt;
|
|
}
|
|
#endif //USE_4POOLS
|
|
void setAllocSize()
|
|
{
|
|
wasTriOriginallyInt = false;
|
|
wasBinOriginallyInt = false;
|
|
#ifdef USE_4POOLS
|
|
wasQuadOriginallyInt = false;
|
|
#endif //USE_4POOLS
|
|
switch(size()) {
|
|
case 2:
|
|
wasBinOriginallyInt = true;
|
|
break;
|
|
case 3:
|
|
wasTriOriginallyInt = true;
|
|
break;
|
|
#ifdef USE_4POOLS
|
|
case 4:
|
|
wasQuadOriginallyInt = true;
|
|
break;
|
|
case 5:
|
|
wasQuadOriginallyInt = true;
|
|
break;
|
|
#endif //USE_4POOLS
|
|
}
|
|
}
|
|
#endif //USE_POOLS
|
|
};
|
|
|
|
class XorClause : public Clause
|
|
{
|
|
|
|
#ifdef _MSC_VER
|
|
public:
|
|
#else //_MSC_VER
|
|
protected:
|
|
#endif //_MSC_VER
|
|
|
|
// NOTE: This constructor cannot be used directly (doesn't allocate enough memory).
|
|
template<class V>
|
|
XorClause(const V& ps, const bool inverted, const uint _group) :
|
|
Clause(ps, _group, false)
|
|
{
|
|
invertedXor = inverted;
|
|
isXorClause = true;
|
|
calcXorAbstraction();
|
|
}
|
|
|
|
public:
|
|
#ifndef _MSC_VER
|
|
// -- use this function instead:
|
|
template<class V>
|
|
friend XorClause* XorClause_new(const V& ps, const bool inverted, const uint group);
|
|
#endif //_MSC_VER
|
|
|
|
inline bool xor_clause_inverted() const
|
|
{
|
|
return invertedXor;
|
|
}
|
|
inline void invert(bool b)
|
|
{
|
|
invertedXor ^= b;
|
|
}
|
|
void calcXorAbstraction() {
|
|
extra.abst = 0;
|
|
for (uint32_t i = 0; i != size(); i++)
|
|
extra.abst |= 1 << (data[i].var() & 31);
|
|
}
|
|
|
|
void print() {
|
|
printf("XOR Clause group: %d, size: %d, learnt:%d, lits:\"", getGroup(), size(), learnt());
|
|
plainPrint();
|
|
}
|
|
|
|
void plainPrint(FILE* to = stdout) const {
|
|
fprintf(to, "x");
|
|
if (xor_clause_inverted())
|
|
printf("-");
|
|
for (uint i = 0; i < size(); i++) {
|
|
fprintf(to, "%d ", data[i].var() + 1);
|
|
}
|
|
fprintf(to, "0\n");
|
|
}
|
|
|
|
friend class MatrixFinder;
|
|
};
|
|
|
|
#ifdef USE_POOLS
|
|
extern boost::pool<> clausePoolTri;
|
|
extern boost::pool<> clausePoolBin;
|
|
#ifdef USE_4POOLS
|
|
extern boost::pool<> clausePoolQuad;
|
|
#endif //USE_4POOLS
|
|
#endif //USE_POOLS
|
|
|
|
template<class T>
|
|
inline void* allocEnough(const T& ps)
|
|
{
|
|
void* mem;
|
|
switch(ps.size()) {
|
|
#ifdef USE_POOLS
|
|
case 2:
|
|
mem = clausePoolBin.malloc();
|
|
break;
|
|
case 3:
|
|
mem = clausePoolTri.malloc();
|
|
break;
|
|
#ifdef USE_4POOLS
|
|
case 4:
|
|
mem = clausePoolQuad.malloc();
|
|
break;
|
|
case 5:
|
|
mem = clausePoolQuad.malloc();
|
|
break;
|
|
#endif //USE_4POOLS
|
|
#endif //USE_POOLS
|
|
default:
|
|
mem = malloc(sizeof(Clause) + sizeof(Lit)*(ps.size()));
|
|
break;
|
|
}
|
|
|
|
return mem;
|
|
}
|
|
|
|
template<class T>
|
|
Clause* Clause_new(const T& ps, const uint group, const bool learnt = false)
|
|
{
|
|
void* mem = allocEnough(ps);
|
|
Clause* real= new (mem) Clause(ps, group, learnt);
|
|
return real;
|
|
}
|
|
|
|
template<class T>
|
|
XorClause* XorClause_new(const T& ps, const bool inverted, const uint group)
|
|
{
|
|
void* mem = allocEnough(ps);
|
|
XorClause* real= new (mem) XorClause(ps, inverted, group);
|
|
return real;
|
|
}
|
|
|
|
inline Clause* Clause_new(Clause& c)
|
|
{
|
|
void* mem = allocEnough(c);
|
|
//Clause* real= new (mem) Clause(ps, group, learnt);
|
|
memcpy(mem, &c, sizeof(Clause)+sizeof(Lit)*c.size());
|
|
Clause& c2 = *(Clause*)mem;
|
|
#ifdef USE_POOLS
|
|
c2.setAllocSize();
|
|
#endif //USE_POOLS
|
|
|
|
return &c2;
|
|
}
|
|
|
|
inline void clauseFree(Clause* c)
|
|
{
|
|
#ifdef USE_POOLS
|
|
if (c->wasTriOriginally())
|
|
clausePoolTri.free(c);
|
|
else if (c->wasBinOriginally())
|
|
clausePoolBin.free(c);
|
|
#ifdef USE_4POOLS
|
|
else if (c->wasQuadOriginally())
|
|
clausePoolQuad.free(c);
|
|
#endif //USE_4POOLS
|
|
else
|
|
#endif //USE_POOLS
|
|
free(c);
|
|
}
|
|
|
|
#ifdef _MSC_VER
|
|
typedef Clause* ClausePtr;
|
|
typedef XorClause* XorClausePtr;
|
|
#else
|
|
typedef sptr<Clause> ClausePtr;
|
|
typedef sptr<XorClause> XorClausePtr;
|
|
#endif //_MSC_VER
|
|
|
|
#pragma pack(push)
|
|
#pragma pack(1)
|
|
class WatchedBin {
|
|
public:
|
|
WatchedBin(Clause *_clause, Lit _impliedLit) : clause(_clause), impliedLit(_impliedLit) {};
|
|
ClausePtr clause;
|
|
Lit impliedLit;
|
|
};
|
|
|
|
class Watched {
|
|
public:
|
|
Watched(Clause *_clause, Lit _blockedLit) : clause(_clause), blockedLit(_blockedLit) {};
|
|
ClausePtr clause;
|
|
Lit blockedLit;
|
|
};
|
|
#pragma pack(pop)
|
|
|
|
#endif //CLAUSE_H
|