aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
Diffstat
-rw-r--r--.gitlab-ci.yml58
-rwxr-xr-xconfigure2
-rw-r--r--doc/index-kvx.html14
-rw-r--r--kvx/Asm.v10
-rw-r--r--kvx/Asmblockdeps.v23
-rw-r--r--kvx/Asmgenproof.v7
-rw-r--r--kvx/Asmvliw.v218
-rw-r--r--kvx/PostpassScheduling.v19
-rw-r--r--kvx/PostpassSchedulingOracle.ml27
-rw-r--r--kvx/abstractbb/AbstractBasicBlocksDef.v44
-rw-r--r--kvx/abstractbb/ImpSimuTest.v30
-rw-r--r--kvx/abstractbb/Parallelizability.v25
-rw-r--r--kvx/abstractbb/SeqSimuTheory.v21
-rw-r--r--kvx/lib/Machblock.v15
-rw-r--r--kvx/lib/Machblockgen.v13
-rw-r--r--test/monniaux/picosat-965/onefile/picosat.c9788
-rwxr-xr-xtest/monniaux/picosat-965/onefile/testcmp.sh35
-rw-r--r--test/monniaux/rules.mk24
-rw-r--r--test/monniaux/scheduling/mal_schedule.c14
-rw-r--r--test/monniaux/yarpgen/Makefile3
20 files changed, 342 insertions, 10048 deletions
diff --git a/.gitlab-ci.yml b/.gitlab-ci.yml
index 0499abc2..3b1a86fd 100644
--- a/.gitlab-ci.yml
+++ b/.gitlab-ci.yml
@@ -3,9 +3,8 @@ stages:
check-admitted:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -13,7 +12,7 @@ check-admitted:
- ./config_x86_64.sh
- make check-admitted
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -23,9 +22,8 @@ check-admitted:
build_x86_64:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -35,7 +33,7 @@ build_x86_64:
- make -C test all test
- ulimit -s65536 && make -C test/monniaux/yarpgen
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -45,11 +43,10 @@ build_x86_64:
build_ia32:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-multilib
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -59,7 +56,7 @@ build_ia32:
- make -C test all test
- ulimit -s65536 && make -C test/monniaux/yarpgen BITS=32 TARGET_CC='gcc -m32'
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -69,11 +66,10 @@ build_ia32:
build_aarch64:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-aarch64-linux-gnu qemu-user
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -83,7 +79,7 @@ build_aarch64:
- make -C test CCOMPOPTS='-static' SIMU='qemu-aarch64' EXECUTE='qemu-aarch64' all test
- ulimit -s65536 && make -C test/monniaux/yarpgen TARGET_CC='aarch64-linux-gnu-gcc' EXECUTE='qemu-aarch64' CCOMPOPTS='-static' TARGET_CFLAGS='-static'
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -93,11 +89,10 @@ build_aarch64:
build_arm:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-arm-linux-gnueabi qemu-user
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -107,7 +102,7 @@ build_arm:
- make -C test CCOMPOPTS=-static SIMU='qemu-arm' EXECUTE='qemu-arm' all test
- ulimit -s65536 && make -C test/monniaux/yarpgen TARGET_CC='arm-linux-gnueabi-gcc' EXECUTE='qemu-arm' CCOMPOPTS='-static' TARGET_CFLAGS='-static' BITS=32
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -118,11 +113,10 @@ build_arm:
build_armhf:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-arm-linux-gnueabihf qemu-user
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -132,7 +126,7 @@ build_armhf:
- make -C test CCOMPOPTS=-static SIMU='qemu-arm' EXECUTE='qemu-arm' all test
- ulimit -s65536 && make -C test/monniaux/yarpgen TARGET_CC='arm-linux-gnueabihf-gcc' EXECUTE='qemu-arm' CCOMPOPTS='-static' TARGET_CFLAGS='-static' BITS=32
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -142,11 +136,10 @@ build_armhf:
build_ppc:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-powerpc-linux-gnu qemu-user
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -154,7 +147,7 @@ build_ppc:
- ./config_ppc.sh
- make -j "$NJOBS"
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -164,11 +157,10 @@ build_ppc:
build_ppc64:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-powerpc64-linux-gnu
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -176,7 +168,7 @@ build_ppc64:
- ./config_ppc64.sh
- make -j "$NJOBS"
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -186,11 +178,10 @@ build_ppc64:
build_rv64:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-riscv64-linux-gnu qemu-user
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -200,7 +191,7 @@ build_rv64:
- make -C test CCOMPOPTS=-static SIMU='qemu-riscv64' EXECUTE='qemu-riscv64' all test
- ulimit -s65536 && make -C test/monniaux/yarpgen TARGET_CC='riscv64-linux-gnu-gcc' EXECUTE='qemu-riscv64' CCOMPOPTS='-static' TARGET_CFLAGS='-static'
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -210,11 +201,10 @@ build_rv64:
build_rv32:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install gcc-riscv64-linux-gnu qemu-user
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -222,7 +212,7 @@ build_rv32:
- ./config_rv32.sh -no-runtime-lib
- make -j "$NJOBS"
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -232,7 +222,7 @@ build_rv32:
build_kvx:
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install sshpass openssh-client libzip4 lttng-tools liblttng-ctl-dev liblttng-ust-dev babeltrace
@@ -240,7 +230,6 @@ build_kvx:
- rm -f download/*dkms*.deb download/*eclipse*.deb download/*llvm*.deb download/*board-mgmt* download/*oce-host* download/*pocl*
- sudo dpkg -i download/*.deb
- rm -rf download
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
@@ -250,7 +239,7 @@ build_kvx:
- source /opt/kalray/accesscore/kalray.sh && make -C test CCOMPOPTS=-static SIMU='kvx-cluster -- ' EXECUTE='kvx-cluster -- ' all test
- source /opt/kalray/accesscore/kalray.sh && make -C test/monniaux/yarpgen TARGET_CC='kvx-cos-gcc' EXECUTE='kvx-cluster -- ' CCOMPOPTS='-static' TARGET_CFLAGS='-static'
rules:
- - if: '$CI_COMMIT_BRANCH == "mppa-work"'
+ - if: '$CI_COMMIT_BRANCH == "kvx-work"'
when: always
- if: '$CI_COMMIT_BRANCH == "mppa-kvx"'
when: always
@@ -260,7 +249,7 @@ build_kvx:
pages: # TODO: change to "deploy" when "build" succeeds (or integrate with "build_kvx" above ?)
stage: build
- image: "coqorg/coq"
+ image: coqorg/coq:8.11.2-ocaml-4.09.1-flambda
before_script:
- sudo apt-get -o Acquire::Check-Valid-Until=false -o Acquire::Check-Date=false update
- sudo apt-get -y install sshpass openssh-client libzip4 lttng-tools liblttng-ctl-dev liblttng-ust-dev babeltrace
@@ -268,7 +257,6 @@ pages: # TODO: change to "deploy" when "build" succeeds (or integrate with "buil
- rm -f download/*dkms*.deb download/*eclipse*.deb download/*llvm*.deb download/*board-mgmt* download/*oce-host* download/*pocl*
- sudo dpkg -i download/*.deb
- rm -rf download
- - opam switch 4.07.1+flambda
- eval `opam config env`
- opam update
- opam install -y menhir
diff --git a/configure b/configure
index 0379ed38..1eff6d1c 100755
--- a/configure
+++ b/configure
@@ -457,7 +457,7 @@ if test "$arch" = "kvx"; then
fi
osupper=`echo $os|tr a-z A-Z`
k1base="kvx-$os"
- casm="kvx-elf-as"
+ casm="$k1base-as"
casm_options="$model_options"
cc="$k1base-gcc $model_options"
clinker="$k1base-gcc"
diff --git a/doc/index-kvx.html b/doc/index-kvx.html
index 95fdb6de..97eefc24 100644
--- a/doc/index-kvx.html
+++ b/doc/index-kvx.html
@@ -60,11 +60,11 @@ inequations by fixpoint iteration.
<LI> <A HREF="html/compcert.lib.Postorder.html">Postorder</A>: postorder numbering of a directed graph.
</UL></font>
-<H4>The <tt>abstractbb</tt> library, introduced for MPPA-KVX</H4>
+<H4>The <tt>abstractbb</tt> library, introduced for KVX core</H4>
<UL>
<LI> <A HREF="html/compcert.kvx.abstractbb.AbstractBasicBlocksDef.html">AbstractBasicBlocksDef</A>: an IR for verifying some semantic properties on basic-blocks.
<LI> <A HREF="html/compcert.kvx.abstractbb.Parallelizability.html">Parallelizability</A>: verifying that sequential and parallel semantics are equivalent for a given abstract basic-block.
-<LI> <A HREF="html/compcert.kvx.abstractbb.ImpSimuTest.html">ImpSimuTest</A>: verifying that a given abstract basic-block is simulated by another one for sequential semantics. This module refines <A HREF="html/compcert.kvx.abstractbb.SeqSimuTheory.html">SeqSimuTheory</A> with hash-consing.
+<LI> <A HREF="html/compcert.kvx.abstractbb.ImpSimuTest.html">ImpSimuTest</A>: verifying that a given abstract basic-block is simulated by another one for sequential semantics. This module refines <A HREF="html/compcert.kvx.abstractbb.SeqSimuTheory.html">SeqSimuTheory</A> with hash-consing and uses <A HREF=https://github.com/boulme/ImpureDemo>the Impure library</A> to reason on physical equality and handling of imperative code in Coq.
</UL>
<font color=gray>
@@ -121,11 +121,11 @@ replaced by a linear list of instructions with explicit branches and labels.
view of the activation record.
</UL>
</font>
-<H4>Languages introduced for MPPA-KVX</H4>
+<H4>Languages introduced for KVX core</H4>
<UL>
<LI> <A HREF="html/compcert.kvx.lib.Machblock.html">Machblock</A>: a variant of Mach, with a syntax for basic-blocks, and a block-step semantics (execute one basic-block in one step).
-This IR is generic over the processor, even if currently, only used for MPPA_KVX.
-<LI> <A HREF="html/compcert.kvx.Asmvliw.html"><I>Asmvliw</I></A>: abstract syntax and semantics for Mppa_KVX VLIW assembly: atomic instructions are grouped by "bundles". These bundles are executed sequentially, but execution is parallel within bundles.
+This IR is generic over the processor, even if currently, only used for KVX.
+<LI> <A HREF="html/compcert.kvx.Asmvliw.html"><I>Asmvliw</I></A>: abstract syntax and semantics for KVX VLIW assembly: atomic instructions are grouped by "bundles". These bundles are executed sequentially, but execution is parallel within bundles.
<LI> <A HREF="html/compcert.kvx.Asmblock.html"><I>Asmblock</I></A>: a variant of Asmvliw, with a sequential semantics within bundles, which make them corresponds here to usual basic-blocks.
This IR is an intermediate step between Machblock and Asmvliw.
<LI> <A HREF="html/compcert.kvx.Asm.html"><I>Asm</I></A>: a variant of Asmvliw with a flat syntax for bundles, instead of a structured one (bundle termination is encoded as a pseudo-instruction). This IR is mainly a wrapper of <I>Asmvliw</I> for a smooth integration in CompCert (and an easier pretty-printing of the abstract syntax).
@@ -294,7 +294,7 @@ This IR is generic over the processor, even if currently, only used for MPPA_KVX
</TR>
</TABLE>
-<H4>Compilation passes introduced for MPPA-KVX</H4>
+<H4>Compilation passes introduced for KVX VLIW</H4>
<TABLE cellpadding="5%">
<TR valign="top">
<TD>Reconstruction of basic-blocks at Mach level</TD>
@@ -325,7 +325,7 @@ This IR is generic over the processor, even if currently, only used for MPPA_KVX
<TD>Flattening bundles (only a bureaucratic operation)</TD>
<TD>Asmvliw to Asm</TD>
<TD><A HREF="html/compcert.kvx.Asmgen.html"><I>Asmgen</I></A></TD>
- <TD><A HREF="html/compcert.kvx.Asmgenproof.html"><I>Asmgenproof</I></A></TD>
+ <TD><A HREF="html/compcert.kvx.Asmgenproof.html"><I>Asmgenproof</I></A> (whole simulation proof from <tt>Mach</tt> to <tt>Asm</tt>)</TD>
</TR>
</TABLE>
diff --git a/kvx/Asm.v b/kvx/Asm.v
index 69d0ecf6..30aafc55 100644
--- a/kvx/Asm.v
+++ b/kvx/Asm.v
@@ -13,7 +13,7 @@
(* *)
(* *************************************************************)
-(** * Abstract syntax for KVX textual assembly language.
+(** Abstract syntax for KVX textual assembly language.
Each emittable instruction is defined here. ';;' is also defined as an instruction.
The goal of this representation is to stay compatible with the rest of the generic backend of CompCert
@@ -49,7 +49,7 @@ Inductive addressing : Type :=
| ARegXS (ro: ireg)
.
-(** Syntax *)
+(** * Syntax *)
Inductive instruction : Type :=
(** pseudo instructions *)
| Pallocframe (sz: Z) (pos: ptrofs) (**r allocate new stack frame *)
@@ -104,7 +104,7 @@ Inductive instruction : Type :=
| Pclzll (rd rs: ireg)
| Pstsud (rd rs1 rs2: ireg)
- (** Loads **)
+ (** Loads *)
| Plb (trap: trapping_mode) (rd: ireg) (ra: ireg) (ofs: addressing) (**r load byte *)
| Plbu (trap: trapping_mode) (rd: ireg) (ra: ireg) (ofs: addressing) (**r load byte unsigned *)
| Plh (trap: trapping_mode) (rd: ireg) (ra: ireg) (ofs: addressing) (**r load half word *)
@@ -118,7 +118,7 @@ Inductive instruction : Type :=
| Plq (rs: gpreg_q) (ra: ireg) (ofs: addressing) (**r load 2*64-bit *)
| Plo (rs: gpreg_o) (ra: ireg) (ofs: addressing) (**r load 4*64-bit *)
- (** Stores **)
+ (** Stores *)
| Psb (rs: ireg) (ra: ireg) (ofs: addressing) (**r store byte *)
| Psh (rs: ireg) (ra: ireg) (ofs: addressing) (**r store half byte *)
| Psw (rs: ireg) (ra: ireg) (ofs: addressing) (**r store int32 *)
@@ -547,6 +547,8 @@ Definition basic_to_instruction (b: basic) :=
| PStoreORRO qrs ra ofs => Pso qrs ra (AOff ofs)
end.
+(** * Semantics (given through the existence of well-formed VLIW program) *)
+
Section RELSEM.
Definition code := list instruction.
diff --git a/kvx/Asmblockdeps.v b/kvx/Asmblockdeps.v
index 1881e7e9..3d981100 100644
--- a/kvx/Asmblockdeps.v
+++ b/kvx/Asmblockdeps.v
@@ -12,12 +12,14 @@
(* *)
(* *************************************************************)
-(** * Translation from Asmblock to AbstractBB
+(** * Translation from [Asmvliw] to [AbstractBB] *)
- We define a specific instance of AbstractBB, named L, translate bblocks from Asmblock into this instance
- AbstractBB will then define two semantics for L : a sequential, and a semantic one
- We prove a bisimulation between the parallel semantics of L and AsmVLIW
- From this, we also deduce a bisimulation between the sequential semantics of L and Asmblock *)
+(** We define a specific instance [L] of [AbstractBB] and translate [bblocks] from [Asmvliw] into [L].
+ [AbstractBB] will then define two semantics for [L]: a sequential and a parallel one.
+ We prove a bisimulation between the parallel semantics of [L] and [AsmVLIW].
+ We also prove a bisimulation between the sequential semantics of [L] and [Asmblock].
+ Then, the checkers on [Asmblock] and [Asmvliw] are deduced from those of [L].
+ *)
Require Import AST.
Require Import Asmblock.
@@ -40,7 +42,7 @@ Require Import Lia.
Open Scope impure.
-(** Definition of L *)
+(** Definition of [L] *)
Module P<: ImpParam.
Module R := Pos.
@@ -660,7 +662,7 @@ Module IST := ImpSimu L ImpPosDict.
Import L.
Import P.
-(** Compilation from Asmblock to L *)
+(** Compilation from [Asmvliw] to [L] *)
Local Open Scope positive_scope.
@@ -748,6 +750,8 @@ Definition inv_ppos (p: R.t) : option preg :=
Notation "a @ b" := (Econs a b) (at level 102, right associativity).
+(** Translations of instructions *)
+
Definition trans_control (ctl: control) : inst :=
match ctl with
| Pret => [(#PC, PReg(#RA))]
@@ -859,6 +863,8 @@ Proof.
intros. destruct bb as [hdr bdy ex COR]; unfold no_header; simpl. unfold trans_block. simpl. reflexivity.
Qed.
+(** Lemmas on the translation *)
+
Definition state := L.mem.
Definition exec := L.run.
@@ -1800,6 +1806,7 @@ Definition bblock_simu_test (verb: bool) (p1 p2: Asmvliw.bblock) : ?? bool :=
Local Hint Resolve IST.bblock_simu_test_correct bblock_simu_reduce IST.verb_bblock_simu_test_correct: wlp.
+(** Main simulation (Impure) theorem *)
Theorem bblock_simu_test_correct verb p1 p2 :
WHEN bblock_simu_test verb p1 p2 ~> b THEN b=true -> forall ge fn, Asmblockprops.bblock_simu ge fn p1 p2.
Proof.
@@ -1807,7 +1814,7 @@ Proof.
Qed.
Hint Resolve bblock_simu_test_correct: wlp.
-(* Coerce bblock_simu_test into a pure function (this is a little unsafe like all oracles in CompCert). *)
+(** ** Coerce bblock_simu_test into a pure function (this is a little unsafe like all oracles in CompCert). *)
Import UnsafeImpure.
diff --git a/kvx/Asmgenproof.v b/kvx/Asmgenproof.v
index f43acd37..9e35e268 100644
--- a/kvx/Asmgenproof.v
+++ b/kvx/Asmgenproof.v
@@ -13,7 +13,7 @@
(* *)
(* *************************************************************)
-(** Correctness proof for Asmgen *)
+(** Composing all passes from Mach to KVX Asm *)
Require Import Coqlib Errors.
Require Import Integers Floats AST Linking.
@@ -46,7 +46,7 @@ Proof.
exists tp; split. apply Asm.transf_program_match; auto. auto.
Qed.
-(** Return Address Offset *)
+(** Return Address Offset for Mach *)
Definition return_address_offset: Mach.function -> Mach.code -> ptrofs -> Prop :=
Mach_return_address_offset Asmblockgenproof.return_address_offset.
@@ -59,6 +59,7 @@ Proof.
intros; eapply Asmblockgenproof.return_address_exists; eauto.
Qed.
+(** Main preservation theorem: from Mach to KVX Asm *)
Section PRESERVATION.
@@ -86,7 +87,7 @@ End PRESERVATION.
Instance TransfAsm: TransfLink match_prog := pass_match_link (compose_passes block_passes).
(*******************************************)
-(* Stub actually needed by driver/Compiler *)
+(** Stub actually needed by driver/Compiler *)
Module Asmgenproof0.
diff --git a/kvx/Asmvliw.v b/kvx/Asmvliw.v
index 301ee69a..296963a7 100644
--- a/kvx/Asmvliw.v
+++ b/kvx/Asmvliw.v
@@ -41,7 +41,7 @@ Require Import Chunks.
this view induces our sequential semantics of bundles defined in [Asmblock].
*)
-(** General Purpose registers. *)
+(** ** General Purpose registers. *)
Inductive gpreg: Type :=
| GPR0: gpreg | GPR1: gpreg | GPR2: gpreg | GPR3: gpreg | GPR4: gpreg
@@ -165,7 +165,7 @@ End PregEq.
Module Pregmap := EMap(PregEq).
-(** Conventional names for stack pointer ([SP]), return address ([RA]), frame pointer ([FP]) and other temporaries used *)
+(** ** Conventional names for stack pointer ([SP]), return address ([RA]), frame pointer ([FP]) and other temporaries used *)
Notation "'SP'" := GPR12 (only parsing) : asm.
Notation "'FP'" := GPR17 (only parsing) : asm.
@@ -173,6 +173,8 @@ Notation "'MFP'" := R17 (only parsing) : asm.
Notation "'GPRA'" := GPR16 (only parsing) : asm.
Notation "'RTMP'" := GPR32 (only parsing) : asm.
+(** ** Names of tests in comparisons *)
+
Inductive btest: Type :=
| BTdnez (**r Double Not Equal to Zero *)
| BTdeqz (**r Double Equal to Zero *)
@@ -214,55 +216,47 @@ Inductive ftest: Type :=
| FTult (**r Unordered or Less Than *)
.
-(** Offsets for load and store instructions. An offset is either an
- immediate integer or the low part of a symbol. *)
+(** *** Offsets for load and store instructions. *)
Definition offset : Type := ptrofs.
-(** We model a subset of the KVX instruction set. In particular, we do not
- support floats yet.
+(** *** Labels for goto (in the current function) *)
- Although it is possible to use the 32-bits mode, for now we don't support it.
+Definition label := positive.
- We follow a design close to the one used for the Risc-V port: one set of
- pseudo-instructions for 32-bit integer arithmetic, with suffix W, another
- set for 64-bit integer arithmetic, with suffix L.
+(** ** Instructions *)
+
+(** We model a subset of the KVX instruction set.
- When mapping to actual instructions, the OCaml code in TargetPrinter.ml
+- Although it is possible to use the 32-bits mode, for now we don't support it. When mapping to actual instructions, the OCaml code in TargetPrinter.ml
throws an error if we are not in 64-bits mode.
-*)
-(** * Instructions *)
+- We follow a design close to the one used for the Risc-V port: one set of
+ pseudo-instructions for 32-bit integer arithmetic, with suffix W, another
+ set for 64-bit integer arithmetic, with suffix L.
-Definition label := positive.
+- With respect to other CompCert assemblies, we define a type hierarchy of instructions (instead of a flat type).
+ This helps us to factorize similar cases for the scheduling verifier.
+
+*)
-(** Instructions to be expanded in control-flow *)
+(** *** Instructions to be expanded in control-flow *)
Inductive ex_instruction : Type :=
(* Pseudo-instructions *)
| Pbuiltin: external_function -> list (builtin_arg preg)
-> builtin_res preg -> ex_instruction (**r built-in function (pseudo) *)
.
-(** FIXME: comment not up to date !
-
-
- The pseudo-instructions are the following:
+(** Similarly to other CompCert assembly languages, the pseudo-instructions are the following:
- [Ploadsymbol]: load the address of a symbol in an integer register.
- Expands to the [la] assembler pseudo-instruction, which does the right
- thing even if we are in PIC mode.
- [Pallocframe sz pos]: in the formal semantics, this
pseudo-instruction allocates a memory block with bounds [0] and
[sz], stores the value of the stack pointer at offset [pos] in this
block, and sets the stack pointer to the address of the bottom of
this block.
- In the printed ASM assembly code, this allocation is:
-<<
- mv x30, sp
- sub sp, sp, #sz
- sw x30, #pos(sp)
->>
+
This cannot be expressed in our memory model, which does not reflect
the fact that stack frames are adjacent and allocated/freed
following a stack discipline.
@@ -270,25 +264,13 @@ Inductive ex_instruction : Type :=
- [Pfreeframe sz pos]: in the formal semantics, this pseudo-instruction
reads the word at [pos] of the block pointed by the stack pointer,
frees this block, and sets the stack pointer to the value read.
- In the printed ASM assembly code, this freeing is just an increment of [sp]:
-<<
- add sp, sp, #sz
->>
Again, our memory model cannot comprehend that this operation
frees (logically) the current stack frame.
- [Pbtbl reg table]: this is a N-way branch, implemented via a jump table
- as follows:
-<<
- la x31, table
- add x31, x31, reg
- jr x31
-table: .long table[0], table[1], ...
->>
- Note that [reg] contains 4 times the index of the desired table entry.
*)
-(** Control Flow instructions *)
+(** *** Control Flow instructions *)
Inductive cf_instruction : Type :=
| Pret (**r return *)
| Pcall (l: label) (**r function call *)
@@ -305,7 +287,7 @@ Inductive cf_instruction : Type :=
| Pcbu (bt: btest) (r: ireg) (l: label) (**r branch based on btest with unsigned semantics *)
.
-(** Loads **)
+(** *** Loads *)
Definition concrete_default_notrap_load_value (chunk : memory_chunk) :=
match chunk with
| Mint8signed | Mint8unsigned | Mint16signed | Mint16unsigned
@@ -337,7 +319,7 @@ Inductive ld_instruction : Type :=
| PLoadORRO (rd: gpreg_o) (ra: ireg) (ofs: offset)
.
-(** Stores **)
+(** *** Stores *)
Inductive store_name : Type :=
| Psb (**r store byte *)
| Psh (**r store half byte *)
@@ -357,7 +339,7 @@ Inductive st_instruction : Type :=
| PStoreORRO (rs: gpreg_o) (ra: ireg) (ofs: offset)
.
-(** Arithmetic instructions **)
+(** *** Arithmetic instructions *)
Inductive arith_name_r : Type :=
| Ploadsymbol (id: ident) (ofs: ptrofs) (**r load the address of a symbol *)
.
@@ -571,6 +553,8 @@ Coercion PArithARRI64: arith_name_arri64 >-> Funclass.
End PArithCoercions.
+(** ** Basic instructions *)
+
Inductive basic : Type :=
| PArith (i: ar_instruction)
| PLoad (i: ld_instruction)
@@ -586,6 +570,7 @@ Coercion PLoad: ld_instruction >-> basic.
Coercion PStore: st_instruction >-> basic.
Coercion PArith: ar_instruction >-> basic.
+(** ** Control-flow instructions *)
Inductive control : Type :=
| PExpand (i: ex_instruction)
@@ -596,9 +581,9 @@ Coercion PExpand: ex_instruction >-> control.
Coercion PCtlFlow: cf_instruction >-> control.
-(** * Definition of a bblock (ie a bundle)
+(** * Definition of a bblock (ie a bundle) *)
-A bundle/bblock must contain at least one instruction.
+(** A bundle/bblock must contain at least one instruction.
This choice simplifies the definition of [find_bblock] below:
indeed, each address of a code block identifies at most one bundle
@@ -621,9 +606,8 @@ Definition non_empty_exit (exit: option control): bool :=
Definition non_empty_bblockb (body: list basic) (exit: option control): bool := non_empty_body body || non_empty_exit exit.
-(** TODO
- * For now, we consider a builtin is alone in a bundle (and a basic block).
- * Is there a way to avoid that ?
+(** For now, we consider a builtin is alone in a bundle (and a basic block).
+ Is there a way to avoid that ? (TODO)
*)
Definition builtin_aloneb (body: list basic) (exit: option control) :=
match exit with
@@ -655,12 +639,12 @@ Definition length_opt {A} (o: option A) : nat :=
| None => 0
end.
-(* WARNING: the notion of size is not the same than in Machblock !
- We ignore labels here...
+(** The notion of size induces the notion of "valid" code address given by [find_bblock]
+ The result is in Z to be compatible with operations on PC.
- This notion of size induces the notion of "valid" code address given by [find_bblock]
+ WARNING: this notion of size is not the same than in Machblock !
+ We ignore labels here...
- The result is in Z to be compatible with operations on PC.
*)
Definition size (b:bblock): Z := Z.of_nat (length (body b) + length_opt (exit b)).
@@ -678,7 +662,7 @@ Record function : Type := mkfunction { fn_sig: signature; fn_blocks: bblocks }.
Definition fundef := AST.fundef function.
Definition program := AST.program fundef unit.
-(** * Operational semantics *)
+(** * Parallel Semantics of bundles *)
(** The semantics operates over a single mapping from registers
(type [preg]) to values. We maintain
@@ -695,7 +679,7 @@ Notation "a # b <- c" := (Pregmap.set b c a) (at level 1, b at next level) : asm
Open Scope asm.
-(** Undefining some registers *)
+(** *** Undefining some registers *)
Fixpoint undef_regs (l: list preg) (rs: regset) : regset :=
match l with
@@ -704,7 +688,7 @@ Fixpoint undef_regs (l: list preg) (rs: regset) : regset :=
end.
-(** Assigning a register pair *)
+(** *** Assigning a register pair *)
Definition set_pair (p: rpair preg) (v: val) (rs: regset) : regset :=
match p with
| One r => rs#r <- v
@@ -712,7 +696,7 @@ Definition set_pair (p: rpair preg) (v: val) (rs: regset) : regset :=
end.
-(** Assigning the result of a builtin *)
+(** *** Assigning the result of a builtin *)
Fixpoint set_res (res: builtin_res preg) (v: val) (rs: regset) : regset :=
match res with
@@ -723,12 +707,8 @@ Fixpoint set_res (res: builtin_res preg) (v: val) (rs: regset) : regset :=
Local Open Scope asm.
-(** * Parallel Semantics of bundles *)
-
Section RELSEM.
-(** Execution of arith instructions *)
-
Variable ge: genv.
(** The parallel semantics on bundles is purely small-step and defined as a relation
@@ -753,7 +733,7 @@ Inductive outcome: Type :=
| Stuck
.
-(** ** Arithmetic Expressions (including comparisons) *)
+(** *** Arithmetic Expressions (including comparisons) *)
Inductive signedness: Type := Signed | Unsigned.
@@ -800,7 +780,7 @@ Definition notftest_for_cmp (c: comparison) :=
| Cge => Normal FTult
end.
-(* CoMPare Signed Words to Zero *)
+(* **** CoMPare Signed Words to Zero *)
Definition btest_for_cmpswz (c: comparison) :=
match c with
| Cne => BTwnez
@@ -811,7 +791,7 @@ Definition btest_for_cmpswz (c: comparison) :=
| Cgt => BTwgtz
end.
-(* CoMPare Signed Doubles to Zero *)
+(* **** CoMPare Signed Doubles to Zero *)
Definition btest_for_cmpsdz (c: comparison) :=
match c with
| Cne => BTdnez
@@ -849,7 +829,7 @@ Definition cmpu_for_btest (bt: btest) :=
end.
-(* a few lemma on comparisons of unsigned (e.g. pointers) *)
+(* **** a few lemma on comparisons of unsigned (e.g. pointers) *)
Definition Val_cmpu_bool cmp v1 v2: option bool :=
Val.cmpu_bool (fun _ _ => true) cmp v1 v2.
@@ -901,7 +881,7 @@ Qed.
-(** Comparing integers *)
+(** **** Comparing integers *)
Definition compare_int (t: itest) (v1 v2: val): val :=
match t with
| ITne => Val.cmp Cne v1 v2
@@ -961,6 +941,8 @@ Definition compare_float (t: ftest) (v1 v2: val): val :=
| FTult => Val.notbool (Val.cmpf Cge v1 v2)
end.
+(** **** Arithmetic evaluators *)
+
Definition arith_eval_r n :=
match n with
| Ploadsymbol s ofs => Genv.symbol_address ge s ofs
@@ -1212,7 +1194,7 @@ Definition parexec_arith_instr (ai: ar_instruction) (rsr rsw: regset): regset :=
Definition eval_offset (ofs: offset) : res ptrofs := OK ofs.
-(** * load/store *)
+(** *** load/store instructions *)
Definition parexec_incorrect_load trap chunk d rsw mw :=
match trap with
@@ -1361,7 +1343,7 @@ Definition store_chunk n :=
| Pfsd => Mfloat64
end.
-(** * basic instructions *)
+(** ** Basic (instruction) step *)
Definition bstep (bi: basic) (rsr rsw: regset) (mr mw: mem) :=
match bi with
@@ -1417,7 +1399,7 @@ Definition bstep (bi: basic) (rsr rsw: regset) (mr mw: mem) :=
| Pnop => Next rsw mw
end.
-(* parexec with writes-in-order *)
+(** *** parexec with writes-in-order *)
Fixpoint parexec_wio_body (body: list basic) (rsr rsw: regset) (mr mw: mem) :=
match body with
| nil => Next rsw mw
@@ -1428,7 +1410,7 @@ Fixpoint parexec_wio_body (body: list basic) (rsr rsw: regset) (mr mw: mem) :=
end
end.
-(** TODO: redundant w.r.t Machblock ?? *)
+(* TODO: redundant w.r.t Machblock ?? *)
Lemma in_dec (lbl: label) (l: list label): { List.In lbl l } + { ~(List.In lbl l) }.
Proof.
apply List.in_dec.
@@ -1437,7 +1419,7 @@ Qed.
-(** Note: copy-paste from Machblock *)
+(* Note: copy-paste from Machblock *)
Definition is_label (lbl: label) (bb: bblock) : bool :=
if in_dec lbl (header bb) then true else false.
@@ -1455,7 +1437,7 @@ Qed.
-(** convert a label into a position in the code *)
+(** **** convert a label into a position in the code *)
Fixpoint label_pos (lbl: label) (pos: Z) (lb: bblocks) {struct lb} : option Z :=
match lb with
| nil => None
@@ -1472,11 +1454,9 @@ Definition par_goto_label (f: function) (lbl: label) (rsr rsw: regset) (mw: mem)
end
end.
-(** Evaluating a branch
+(** **** Parallel Evaluation of a branch *)
-Warning: in m PC is assumed to be already pointing on the next instruction !
-
-*)
+(** Warning: PC is assumed to be already pointing on the next bundle ! *)
Definition par_eval_branch (f: function) (l: label) (rsr rsw: regset) (mw: mem) (res: option bool) :=
match res with
@@ -1486,72 +1466,54 @@ Definition par_eval_branch (f: function) (l: label) (rsr rsw: regset) (mw: mem)
end.
-(* FIXME: comment not up-to-date for parallel semantics *)
-
-(** Execution of a single control-flow instruction [i] in initial state [rs] and
- [m]. Return updated state.
-
- As above: PC is assumed to be incremented on the next block before the control-flow instruction
-
- For instructions that correspond tobuiltin
- actual RISC-V instructions, the cases are straightforward
- transliterations of the informal descriptions given in the RISC-V
- user-mode specification. For pseudo-instructions, refer to the
- informal descriptions given above.
+(** **** Parallel execution of a control-flow instruction *)
- Note that we set to [Vundef] the registers used as temporaries by
- the expansions of the pseudo-instructions, so that the RISC-V code
- we generate cannot use those registers to hold values that must
- survive the execution of the pseudo-instruction. *)
+(** As above: PC is assumed to be incremented on the next block before the control-flow instruction
+*)
Definition parexec_control (f: function) (oc: option control) (rsr rsw: regset) (mw: mem) :=
match oc with
- | Some ic =>
-(** Get/Set system registers *)
- match ic with
-
-
-(** Branch Control Unit instructions *)
- | Pret =>
+ | None => Next (rsw#PC <- (rsr#PC)) mw
+ | Some ic => (**r Branch Control Unit instructions *)
+ match ic with
+ | Pret =>
Next (rsw#PC <- (rsr#RA)) mw
- | Pcall s =>
+ | Pcall s =>
Next (rsw#RA <- (rsr#PC) #PC <- (Genv.symbol_address ge s Ptrofs.zero)) mw
- | Picall r =>
+ | Picall r =>
Next (rsw#RA <- (rsr#PC) #PC <- (rsr#r)) mw
- | Pjumptable r tbl =>
+ | Pjumptable r tbl =>
match rsr#r with
| Vint n =>
- match list_nth_z tbl (Int.unsigned n) with
- | None => Stuck
- | Some lbl => par_goto_label f lbl rsr (rsw #GPR62 <- Vundef #GPR63 <- Vundef) mw
- end
+ match list_nth_z tbl (Int.unsigned n) with
+ | None => Stuck
+ | Some lbl => par_goto_label f lbl rsr (rsw #GPR62 <- Vundef #GPR63 <- Vundef) mw
+ end
| _ => Stuck
end
- | Pgoto s =>
+ | Pgoto s =>
Next (rsw#PC <- (Genv.symbol_address ge s Ptrofs.zero)) mw
- | Pigoto r =>
+ | Pigoto r =>
Next (rsw#PC <- (rsr#r)) mw
- | Pj_l l =>
+ | Pj_l l =>
par_goto_label f l rsr rsw mw
- | Pcb bt r l =>
+ | Pcb bt r l =>
match cmp_for_btest bt with
| (Some c, Int) => par_eval_branch f l rsr rsw mw (Val.cmp_bool c rsr#r (Vint (Int.repr 0)))
| (Some c, Long) => par_eval_branch f l rsr rsw mw (Val.cmpl_bool c rsr#r (Vlong (Int64.repr 0)))
| (None, _) => Stuck
end
- | Pcbu bt r l =>
+ | Pcbu bt r l =>
match cmpu_for_btest bt with
| (Some c, Int) => par_eval_branch f l rsr rsw mw (Val_cmpu_bool c rsr#r (Vint (Int.repr 0)))
| (Some c, Long) => par_eval_branch f l rsr rsw mw (Val_cmplu_bool c rsr#r (Vlong (Int64.repr 0)))
| (None, _) => Stuck
end
-
-(** Pseudo-instructions *)
- | Pbuiltin ef args res =>
+ (**r Pseudo-instructions *)
+ | Pbuiltin ef args res =>
Stuck (**r treated specially below *)
- end
- | None => Next (rsw#PC <- (rsr#PC)) mw
-end.
+ end
+ end.
Definition incrPC size_b (rs: regset) :=
@@ -1567,7 +1529,7 @@ Definition parexec_wio f bdy ext size_b (rs: regset) (m: mem): outcome :=
| Stuck => Stuck
end.
-(** non-deterministic (out-of-order writes) parallel execution of bundles *)
+(** *** non-deterministic (out-of-order writes) parallel execution of bundles *)
Definition parexec_bblock (f: function) (bundle: bblock) (rs: regset) (m: mem) (o: outcome): Prop :=
exists bdy1 bdy2, Permutation (bdy1++bdy2) (body bundle) /\
o=match parexec_wio f bdy1 (exit bundle) (Ptrofs.repr (size bundle)) rs m with
@@ -1575,14 +1537,13 @@ Definition parexec_bblock (f: function) (bundle: bblock) (rs: regset) (m: mem) (
| Stuck => Stuck
end.
-(** deterministic parallel (out-of-order writes) execution of bundles *)
+(** *** deterministic parallel (out-of-order writes) execution of bundles *)
Definition det_parexec (f: function) (bundle: bblock) (rs: regset) (m: mem) rs' m': Prop :=
forall o, parexec_bblock f bundle rs m o -> o = Next rs' m'.
-(* FIXME: comment not up-to-date *)
-(** Translation of the LTL/Linear/Mach view of machine registers to
- the RISC-V view. Note that no LTL register maps to [X31]. This
+(** *** Translation of the LTL/Linear/Mach view of machine registers to
+ the assembly view. Note that no LTL register maps to [X31]. This
register is reserved as temporary, to be used by the generated RV32G
code. *)
@@ -1605,7 +1566,7 @@ Definition preg_of (r: mreg) : preg :=
| R60 => GPR60 | R61 => GPR61 | R62 => GPR62 | R63 => GPR63
end.
-(** Undefine all registers except SP and callee-save registers *)
+(** **** Undefine all registers except SP and callee-save registers *)
Definition undef_caller_save_regs (rs: regset) : regset :=
fun r =>
@@ -1614,10 +1575,9 @@ Definition undef_caller_save_regs (rs: regset) : regset :=
then rs r
else Vundef.
-(* FIXME: comment not up-to-date *)
-(** Extract the values of the arguments of an external call.
+(** **** Extract the values of the arguments of an external call.
We exploit the calling conventions from module [Conventions], except that
- we use RISC-V registers instead of locations. *)
+ we use assembly registers instead of locations. *)
Inductive extcall_arg (rs: regset) (m: mem): loc -> val -> Prop :=
| extcall_arg_reg: forall r,
@@ -1646,12 +1606,12 @@ Definition loc_external_result (sg: signature) : rpair preg :=
map_rpair preg_of (loc_result sg).
-(** Looking up bblocks in a code sequence by position. *)
+(** ** Looking up bblocks in a code sequence by position. *)
Fixpoint find_bblock (pos: Z) (lb: bblocks) {struct lb} : option bblock :=
match lb with
| nil => None
| b :: il =>
- if zlt pos 0 then None (* NOTE: It is impossible to branch inside a block *)
+ if zlt pos 0 then None (*r NOTE: It is impossible to branch inside a block *)
else if zeq pos 0 then Some b
else find_bblock (pos - (size b)) il
end.
@@ -1721,9 +1681,7 @@ Qed.
End RELSEM.
-(** Execution of whole programs. *)
-
-(** Execution of whole programs. *)
+(** ** Execution of whole programs. *)
Inductive initial_state (p: program): state -> Prop :=
| initial_state_intro: forall m0,
diff --git a/kvx/PostpassScheduling.v b/kvx/PostpassScheduling.v
index 7518866d..1f1f238a 100644
--- a/kvx/PostpassScheduling.v
+++ b/kvx/PostpassScheduling.v
@@ -12,6 +12,8 @@
(* *)
(* *************************************************************)
+(** Implementation (and basic properties) of the verified postpass scheduler *)
+
Require Import Coqlib Errors AST Integers.
Require Import Asmblock Axioms Memory Globalenvs.
Require Import Asmblockdeps Asmblockgenproof0 Asmblockprops.
@@ -19,20 +21,13 @@ Require Peephole.
Local Open Scope error_monad_scope.
-(** Oracle taking as input a basic block,
- returns a schedule expressed as a list of bundles *)
+(** * Oracle taking as input a basic block,
+ returns a scheduled list of bundles *)
Axiom schedule: bblock -> (list (list basic)) * option control.
Extract Constant schedule => "PostpassSchedulingOracle.schedule".
-Definition state' := L.mem.
-Definition outcome' := option state'.
-
-Definition bblock' := L.bblock.
-
-Definition exec' := L.run.
-
-Definition exec := exec_bblock.
+(** * Concat all bundles into one big basic block *)
(* Lemmas necessary for defining concat_all *)
Lemma app_nonil {A: Type} (l l': list A) : l <> nil -> l ++ l' <> nil.
@@ -49,8 +44,6 @@ Proof.
- intros. rewrite <- app_comm_cons. discriminate.
Qed.
-
-
Definition check_size bb :=
if zlt Ptrofs.max_unsigned (size bb)
then Error (msg "PostpassSchedulingproof.check_size")
@@ -213,6 +206,8 @@ Qed.
Inductive is_concat : bblock -> list bblock -> Prop :=
| mk_is_concat: forall tbb lbb, concat_all lbb = OK tbb -> is_concat tbb lbb.
+(** * Remainder of the verified scheduler *)
+
Definition verify_schedule (bb bb' : bblock) : res unit :=
match bblock_simub bb bb' with
| true => OK tt
diff --git a/kvx/PostpassSchedulingOracle.ml b/kvx/PostpassSchedulingOracle.ml
index 67e3f80f..330675b0 100644
--- a/kvx/PostpassSchedulingOracle.ml
+++ b/kvx/PostpassSchedulingOracle.ml
@@ -504,8 +504,7 @@ let alu_lite_y : int array = let resmap = fun r -> match r with
| Rissue -> 3 | Rtiny -> 1 | Rlite -> 1 | _ -> 0
in Array.of_list (List.map resmap resource_names)
-let alu_nop : int array = let resmap = fun r -> match r with
- | Rissue -> 1 | Rnop -> 1 | _ -> 0
+let alu_nop : int array = let resmap = fun r -> 0
in Array.of_list (List.map resmap resource_names)
let alu_tiny : int array = let resmap = fun r -> match r with
@@ -627,16 +626,16 @@ let rec_to_usage r =
| Some U27L5 | Some U27L10 -> alu_tiny_x
| Some E27U27L10 -> alu_tiny_y
| _ -> raise InvalidEncoding)
- | Maddw -> (match encoding with None -> mau_auxr
+ | Maddw | Msbfw -> (match encoding with None -> mau_auxr
| Some U6 | Some S10 | Some U27L5 -> mau_auxr_x
| _ -> raise InvalidEncoding)
- | Maddd -> (match encoding with None | Some U6 | Some S10 -> mau_auxr
+ | Maddd | Msbfd -> (match encoding with None | Some U6 | Some S10 -> mau_auxr
| Some U27L5 | Some U27L10 -> mau_auxr_x
| Some E27U27L10 -> mau_auxr_y)
- | Mulw| Msbfw -> (match encoding with None -> mau
+ | Mulw -> (match encoding with None -> mau
| Some U6 | Some S10 | Some U27L5 -> mau_x
| _ -> raise InvalidEncoding)
- | Muld | Msbfd -> (match encoding with None | Some U6 | Some S10 -> mau
+ | Muld -> (match encoding with None | Some U6 | Some S10 -> mau
| Some U27L5 | Some U27L10 -> mau_x
| Some E27U27L10 -> mau_y)
| Nop -> alu_nop
@@ -914,12 +913,20 @@ let print_bb oc bb =
let asm_instructions = Asm.unfold_bblock bb
in List.iter (print_inst oc) asm_instructions
+let print_schedule sched =
+ print_string "[ ";
+ Array.iter (fun x -> Printf.printf "%d; " x) sched;
+ print_endline "]";;
+
let do_schedule bb =
- let problem = build_problem bb
- in let solution = scheduler_by_name (!Clflags.option_fpostpass_sched) problem
+ let problem = build_problem bb in
+ (if debug then print_problem stdout problem);
+ let solution = scheduler_by_name !Clflags.option_fpostpass_sched problem
in match solution with
| None -> failwith "Could not find a valid schedule"
- | Some sol -> let bundles = bundlize_solution bb sol in
+ | Some sol ->
+ ((if debug then print_schedule sol);
+ let bundles = bundlize_solution bb sol in
(if debug then
begin
Printf.eprintf "Scheduling the following group of instructions:\n";
@@ -928,7 +935,7 @@ let do_schedule bb =
List.iter (print_bb stderr) bundles;
Printf.eprintf "--------------------------------\n"
end;
- bundles)
+ bundles))
(**
* Dumb schedule if the above doesn't work
diff --git a/kvx/abstractbb/AbstractBasicBlocksDef.v b/kvx/abstractbb/AbstractBasicBlocksDef.v
index 0b1c502d..948ed660 100644
--- a/kvx/abstractbb/AbstractBasicBlocksDef.v
+++ b/kvx/abstractbb/AbstractBasicBlocksDef.v
@@ -45,7 +45,7 @@ End LangParam.
-(** * Syntax and (sequential) semantics of "basic blocks" *)
+(** * Syntax and (sequential) semantics of "abstract basic blocks" *)
Module MkSeqLanguage(P: LangParam).
Export P.
@@ -62,12 +62,12 @@ Definition assign (m: mem) (x:R.t) (v: value): mem
:= fun y => if R.eq_dec x y then v else m y.
-(** expressions *)
+(** Expressions *)
Inductive exp :=
- | PReg (x:R.t)
- | Op (o:op) (le: list_exp)
- | Old (e: exp)
+ | PReg (x:R.t) (**r pseudo-register *)
+ | Op (o:op) (le: list_exp) (**r operation *)
+ | Old (e: exp) (**r evaluation of [e] in the initial state of the instruction (see [inst] below) *)
with list_exp :=
| Enil
| Econs (e:exp) (le:list_exp)
@@ -95,7 +95,8 @@ with list_exp_eval (le: list_exp) (m old: mem): option (list value) :=
| LOld le => list_exp_eval le old old
end.
-Definition inst := list (R.t * exp). (* = a sequence of assignments *)
+(** An instruction represents a sequence of assignments where [Old] refers to the initial state of the sequence. *)
+Definition inst := list (R.t * exp).
Fixpoint inst_run (i: inst) (m old: mem): option mem :=
match i with
@@ -107,6 +108,7 @@ Fixpoint inst_run (i: inst) (m old: mem): option mem :=
end
end.
+(** A basic block is a sequence of instructions. *)
Definition bblock := list inst.
Fixpoint run (p: bblock) (m: mem): option mem :=
@@ -250,12 +252,16 @@ Qed.
End SEQLANG.
-Module Terms.
-(** terms in the symbolic evaluation
-NB: such a term represents the successive computations in one given pseudo-register
+(** * Terms in the symbolic execution *)
+
+(** Such a term represents the successive computations in one given pseudo-register.
+The [hid] has no formal semantics: it is only used by the hash-consing oracle (itself dynamically checked to behave like an identity function).
+
*)
+Module Terms.
+
Inductive term :=
| Input (x:R.t) (hid:hashcode)
| App (o: op) (l: list_term) (hid:hashcode)
@@ -334,11 +340,21 @@ Proof.
- rewrite IHl; clear IHl. intuition (congruence || eauto).
Qed.
+(** * Rewriting rules in the symbolic execution *)
+
+(** The symbolic execution is parametrized by rewriting rules on pseudo-terms. *)
+
Record pseudo_term: Type := intro_fail {
mayfail: list term;
effect: term
}.
+(** Simulation relation between a term and a pseudo-term *)
+
+Definition match_pt (t: term) (pt: pseudo_term) :=
+ (forall ge m, term_eval ge t m <> None <-> allvalid ge pt.(mayfail) m)
+ /\ (forall ge m0 m1, term_eval ge t m0 = Some m1 -> term_eval ge pt.(effect) m0 = Some m1).
+
Lemma inf_option_equivalence (A:Type) (o1 o2: option A):
(o1 <> None -> o1 = o2) <-> (forall m1, o1 = Some m1 -> o2 = Some m1).
Proof.
@@ -346,10 +362,6 @@ Proof.
symmetry; eauto.
Qed.
-Definition match_pt (t: term) (pt: pseudo_term) :=
- (forall ge m, term_eval ge t m <> None <-> allvalid ge pt.(mayfail) m)
- /\ (forall ge m0 m1, term_eval ge t m0 = Some m1 -> term_eval ge pt.(effect) m0 = Some m1).
-
Lemma intro_fail_correct (l: list term) (t: term) :
(forall ge m, term_eval ge t m <> None <-> allvalid ge l m) -> match_pt t (intro_fail l t).
Proof.
@@ -357,6 +369,7 @@ Proof.
Qed.
Hint Resolve intro_fail_correct: wlp.
+(** The default reduction of a term to a pseudo-term *)
Definition identity_fail (t: term):= intro_fail [t] t.
Lemma identity_fail_correct (t: term): match_pt t (identity_fail t).
@@ -366,6 +379,7 @@ Qed.
Global Opaque identity_fail.
Hint Resolve identity_fail_correct: wlp.
+(** The reduction for constant term *)
Definition nofail (is_constant: op -> bool) (t: term):=
match t with
| Input x _ => intro_fail ([])%list t
@@ -385,6 +399,7 @@ Qed.
Global Opaque nofail.
Hint Resolve nofail_correct: wlp.
+(** Term equivalence preserve the simulation by pseudo-terms *)
Definition term_equiv t1 t2:= forall ge m, term_eval ge t1 m = term_eval ge t2 m.
Global Instance term_equiv_Equivalence : Equivalence term_equiv.
@@ -401,6 +416,7 @@ Proof.
Qed.
Hint Resolve match_pt_term_equiv: wlp.
+(** Other generic reductions *)
Definition app_fail (l: list term) (pt: pseudo_term): pseudo_term :=
{| mayfail := List.rev_append l pt.(mayfail); effect := pt.(effect) |}.
@@ -431,6 +447,8 @@ Extraction Inline app_fail.
Import ImpCore.Notations.
Local Open Scope impure_scope.
+(** Specification of rewriting functions in parameter of the symbolic execution: in the impure monad, because the rewriting functions produce hash-consed terms (wrapped in pseudo-terms).
+*)
Record reduction:= {
result:> term -> ?? pseudo_term;
result_correct: forall t, WHEN result t ~> pt THEN match_pt t pt;
diff --git a/kvx/abstractbb/ImpSimuTest.v b/kvx/abstractbb/ImpSimuTest.v
index c914eee1..89260ddb 100644
--- a/kvx/abstractbb/ImpSimuTest.v
+++ b/kvx/abstractbb/ImpSimuTest.v
@@ -10,13 +10,16 @@
(* *)
(* *************************************************************)
-(** Implementation of a symbolic execution of sequential semantics of Abstract Basic Blocks
+(** Implementation of a simulation test (ie a "scheduling verifier") for the sequential semantics of Abstract Basic Blocks.
+
+It is based on a symbolic execution procedure of Abstract Basic Blocks with imperative hash-consing and rewriting.
+
+It also provides debugging information when the test fails.
-with imperative hash-consing, and rewriting.
*)
-Require Export Impure.ImpHCons.
+Require Export Impure.ImpHCons. (**r Import the Impure library. See https://github.com/boulme/ImpureDemo *)
Export Notations.
Import HConsing.
@@ -32,6 +35,7 @@ Import ListNotations.
Local Open Scope list_scope.
+(** * Interface of (impure) equality tests for operators *)
Module Type ImpParam.
Include LangParam.
@@ -54,6 +58,8 @@ Include MkSeqLanguage LP.
End ISeqLanguage.
+(** * A generic dictinary on PseudoRegisters with an impure equality test *)
+
Module Type ImpDict.
Declare Module R: PseudoRegisters.
@@ -91,26 +97,27 @@ Parameter eq_test_correct: forall A (d1 d2: t A),
(* NB: we could also take an eq_test on R.t (but not really useful with "pure" dictionaries *)
-
-(* only for debugging *)
+(** only for debugging *)
Parameter not_eq_witness: forall {A}, t A -> t A -> ?? option R.t.
End ImpDict.
+(** * Specification of the provided tests *)
Module Type ImpSimuInterface.
Declare Module CoreL: ISeqLanguage.
Import CoreL.
Import Terms.
+(** the silent test (without debugging informations) *)
Parameter bblock_simu_test: reduction -> bblock -> bblock -> ?? bool.
Parameter bblock_simu_test_correct: forall reduce (p1 p2 : bblock),
WHEN bblock_simu_test reduce p1 p2 ~> b
THEN b = true -> forall ge : genv, bblock_simu ge p1 p2.
-
+(** the verbose test extended with debugging informations *)
Parameter verb_bblock_simu_test
: reduction ->
(R.t -> ?? pstring) ->
@@ -127,6 +134,7 @@ Parameter verb_bblock_simu_test_correct:
End ImpSimuInterface.
+(** * Implementation of the provided tests *)
Module ImpSimu (L: ISeqLanguage) (Dict: ImpDict with Module R:=L.LP.R): ImpSimuInterface with Module CoreL := L.
@@ -168,7 +176,7 @@ Section SimuWithReduce.
Variable reduce: reduction.
-Section CanonBuilding.
+Section CanonBuilding. (** Implementation of the symbolic execution (ie a "canonical form" representing the semantics of an abstract basic block) *)
Variable hC_term: hashinfo term -> ?? term.
Hypothesis hC_term_correct: forall t, WHEN hC_term t ~> t' THEN forall ge m, term_eval ge (hdata t) m = term_eval ge t' m.
@@ -1117,9 +1125,9 @@ Extraction Inline lift.
End ImpSimu.
-Require Import FMapPositive.
-
+(** * Implementation of the Dictionary (based on PositiveMap) *)
+Require Import FMapPositive.
Require Import PArith.
Require Import FMapPositive.
@@ -1206,7 +1214,7 @@ Proof.
Qed.
Global Opaque eq_test.
-(* ONLY FOR DEBUGGING INFO: get some key of a non-empty d *)
+(** ONLY FOR DEBUGGING INFO: get some key of a non-empty d *)
Fixpoint pick {A} (d: t A): ?? R.t :=
match d with
| Leaf _ => FAILWITH "unexpected empty dictionary"
@@ -1219,7 +1227,7 @@ Fixpoint pick {A} (d: t A): ?? R.t :=
RET (xO p)
end.
-(* ONLY FOR DEBUGGING INFO: find one variable on which d1 and d2 differs *)
+(** ONLY FOR DEBUGGING INFO: find one variable on which d1 and d2 differs *)
Fixpoint not_eq_witness {A} (d1 d2: t A): ?? option R.t :=
match d1, d2 with
| Leaf _, Leaf _ => RET None
diff --git a/kvx/abstractbb/Parallelizability.v b/kvx/abstractbb/Parallelizability.v
index feebeee5..79ec9038 100644
--- a/kvx/abstractbb/Parallelizability.v
+++ b/kvx/abstractbb/Parallelizability.v
@@ -26,7 +26,7 @@ Require Import Sorting.Permutation.
Require Import Bool.
Local Open Scope lazy_bool_scope.
-
+(** * Definition of the parallel semantics *)
Module ParallelSemantics (L: SeqLanguage).
Export L.
@@ -590,17 +590,17 @@ End PARALLELI.
End ParallelizablityChecking.
-Module Type PseudoRegSet.
-
-Declare Module R: PseudoRegisters.
-
-(** We assume a datatype [t] refining (list R.t)
+(** * We assume a datatype [PseudoRegSet.t] refining [list R.t] *)
+(**
This data-refinement is given by an abstract "invariant" match_frame below,
preserved by the following operations.
-
*)
+Module Type PseudoRegSet.
+
+Declare Module R: PseudoRegisters.
+
Parameter t: Type.
Parameter match_frame: t -> (list R.t) -> Prop.
@@ -716,6 +716,11 @@ End ParallelChecks.
+(** * Implementing the datatype [PosPseudoRegSet.t] refining [list R.t] *)
+
+(* This data-refinement is given by an abstract "invariant" match_frame below,
+preserved by the following operations.
+*)
Require Import PArith.
Require Import MSets.MSetPositive.
@@ -724,12 +729,6 @@ Module PosPseudoRegSet <: PseudoRegSet with Module R:=Pos.
Module R:=Pos.
-(** We assume a datatype [t] refining (list R.t)
-
-This data-refinement is given by an abstract "invariant" match_frame below,
-preserved by the following operations.
-
-*)
Definition t:=PositiveSet.t.
diff --git a/kvx/abstractbb/SeqSimuTheory.v b/kvx/abstractbb/SeqSimuTheory.v
index 61f8f2ec..a957c50a 100644
--- a/kvx/abstractbb/SeqSimuTheory.v
+++ b/kvx/abstractbb/SeqSimuTheory.v
@@ -55,13 +55,14 @@ with list_term_eval ge (l: list_term) (m: mem) {struct l}: option (list value) :
end
end.
-(* the symbolic memory:
- - pre: pre-condition expressing that the computation has not yet abort on a None.
- - post: the post-condition for each pseudo-register
-*)
-Record smem:= {pre: genv -> mem -> Prop; post:> R.t -> term}.
-
-(** initial symbolic memory *)
+(** The (abstract) symbolic memory state *)
+Record smem :=
+{
+ pre: genv -> mem -> Prop; (**r pre-condition expressing that the computation has not yet abort on a None. *)
+ post:> R.t -> term (**r the output term computed on each pseudo-register *)
+}.
+
+(** Initial symbolic memory state *)
Definition smem_empty := {| pre:=fun _ _ => True; post:=(fun x => Input x) |}.
Fixpoint exp_term (e: exp) (d old: smem) : term :=
@@ -78,11 +79,12 @@ with list_exp_term (le: list_exp) (d old: smem) : list_term :=
end.
-(** assignment of the symbolic memory *)
+(** assignment of the symbolic memory state *)
Definition smem_set (d:smem) x (t:term) :=
{| pre:=(fun ge m => (term_eval ge (d x) m) <> None /\ (d.(pre) ge m));
post:=fun y => if R.eq_dec x y then t else d y |}.
+(** Simulation theory: the theorem [bblock_smem_simu] ensures that the simulation between two abstract basic blocks is implied by the simulation between their symbolic execution. *)
Section SIMU_THEORY.
Variable ge: genv.
@@ -375,8 +377,7 @@ Qed.
End SIMU_THEORY.
-(** REMARKS: more abstract formulation of the proof...
- but relying on functional_extensionality.
+(** REMARK: this theorem reformulates the lemma above in a more abstract way (but relies on functional_extensionality axiom).
*)
Definition smem_correct ge (d: smem) (m: mem) (om: option mem): Prop:=
forall m', om=Some m' <-> (d.(pre) ge m /\ forall x, term_eval ge (d x) m = Some (m' x)).
diff --git a/kvx/lib/Machblock.v b/kvx/lib/Machblock.v
index 08e0eba2..edae0ed4 100644
--- a/kvx/lib/Machblock.v
+++ b/kvx/lib/Machblock.v
@@ -12,6 +12,8 @@
(* *)
(* *************************************************************)
+(** Abstract syntax and semantics of a Mach variant, structured with basic-blocks. *)
+
Require Import Coqlib.
Require Import Maps.
Require Import AST.
@@ -28,7 +30,9 @@ Require Stacklayout.
Require Import Mach.
Require Import Linking.
-(** basic instructions (ie no control-flow) *)
+(** * Abstract Syntax *)
+
+(** ** basic instructions (ie no control-flow) *)
Inductive basic_inst: Type :=
| MBgetstack: ptrofs -> typ -> mreg -> basic_inst
| MBsetstack: mreg -> ptrofs -> typ -> basic_inst
@@ -40,7 +44,7 @@ Inductive basic_inst: Type :=
Definition bblock_body := list basic_inst.
-(** control flow instructions *)
+(** ** control flow instructions *)
Inductive control_flow_inst: Type :=
| MBcall: signature -> mreg + ident -> control_flow_inst
| MBtailcall: signature -> mreg + ident -> control_flow_inst
@@ -51,6 +55,7 @@ Inductive control_flow_inst: Type :=
| MBreturn: control_flow_inst
.
+(** ** basic block *)
Record bblock := mk_bblock {
header: list label;
body: bblock_body;
@@ -91,6 +96,8 @@ Proof.
destruct e; try (simpl in He; discriminate); auto.
Qed.
+(** ** programs *)
+
Definition code := list bblock.
Record function: Type := mkfunction
@@ -106,7 +113,7 @@ Definition program := AST.program fundef unit.
Definition genv := Genv.t fundef unit.
-(*** sémantique ***)
+(** * Operational (blockstep) semantics ***)
Lemma in_dec (lbl: label) (l: list label): { List.In lbl l } + { ~(List.In lbl l) }.
Proof.
@@ -155,7 +162,7 @@ Definition find_function_ptr
Genv.find_symbol ge symb
end.
-(** Machblock execution states. *)
+(** ** Machblock execution states. *)
Inductive stackframe: Type :=
| Stackframe:
diff --git a/kvx/lib/Machblockgen.v b/kvx/lib/Machblockgen.v
index 287e4f7b..ab186083 100644
--- a/kvx/lib/Machblockgen.v
+++ b/kvx/lib/Machblockgen.v
@@ -29,6 +29,8 @@ Require Import Mach.
Require Import Linking.
Require Import Machblock.
+(** * Tail-recursive (greedy) translation from Mach code to Machblock code *)
+
Inductive Machblock_inst: Type :=
| MB_label (lbl: label)
| MB_basic (bi: basic_inst)
@@ -71,9 +73,12 @@ Definition add_to_new_bblock (i:Machblock_inst) : bblock :=
| MB_cfi i => cfi_bblock i
end.
-(** Adding an instruction to the beginning of a bblock list
- * Either adding the instruction to the head of the list,
- * or create a new bblock with the instruction *)
+(** Adding an instruction to the beginning of a bblock list by
+
+- either adding the instruction to the head of the list,
+
+- or creating a new bblock with the instruction
+*)
Definition add_to_code (i:Machblock_inst) (bl:code) : code :=
match bl with
| bh::bl0 => match i with
@@ -112,7 +117,7 @@ Definition transf_program (src: Mach.program) : program :=
transform_program transf_fundef src.
-(** Abstracting trans_code *)
+(** * Abstracting trans_code with a simpler inductive relation *)
Inductive is_end_block: Machblock_inst -> code -> Prop :=
| End_empty mbi: is_end_block mbi nil
diff --git a/test/monniaux/picosat-965/onefile/picosat.c b/test/monniaux/picosat-965/onefile/picosat.c
index 4f8ee768..e1c18438 100644
--- a/test/monniaux/picosat-965/onefile/picosat.c
+++ b/test/monniaux/picosat-965/onefile/picosat.c
@@ -1,9765 +1,25 @@
-#define NALARM 1
-#define NZIP 1
-#define NGETRUSAGE 1
-#define NDEBUG 1
-
-#include "picosat.h"
-
-#include <assert.h>
-#include <ctype.h>
-#include <signal.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-
-#define GUNZIP "gunzip -c %s"
-#define BUNZIP2 "bzcat %s"
-#define GZIP "gzip -c -f > %s"
-
-#ifndef NZIP
-FILE * popen (const char *, const char*);
-int pclose (FILE *);
-#endif
-
-static PicoSAT * picosat;
-
-static int lineno;
-static FILE *input;
-static int inputid;
-static FILE *output;
-static int verbose;
-static int sargc;
-static char ** sargv;
-static char buffer[100];
-static char *bhead = buffer;
-static const char *eob = buffer + 80;
-static FILE * incremental_rup_file;
-static signed char * sol;
-
-extern void picosat_enter (PicoSAT *);
-extern void picosat_leave (PicoSAT *);
-
-static int
-next (void)
-{
- int res = getc (input);
- if (res == '\n')
- lineno++;
-
- return res;
+typedef struct b b;
+b *a;
+struct b {
+ int c;
+ int d, **clshead;
+ int **ahead;
+ unsigned h;
+} i;
+b *j();
+int k();
+int main() {
+ a = j();
+ k(a);
+}
+#define e(f) f - g->c
+static void m(b *g, int *l) {
+ if (g)
+ *g->ahead = l;
+}
+b *j() { return &i; }
+int k(b *g) {
+ if (g->d)
+ m(g, e(g->clshead[-1]));
+ return g->h;
}
-
-static const char *
-parse (PicoSAT * picosat, int force)
-{
- int ch, sign, lit, vars, clauses;
-
- lineno = 1;
- /* DM inputid = fileno (input); */
-
-SKIP_COMMENTS:
- ch = next ();
- if (ch == 'c')
- {
- while ((ch = next ()) != EOF && ch != '\n')
- ;
- goto SKIP_COMMENTS;
- }
-
- if (isspace (ch))
- goto SKIP_COMMENTS;
-
- if (ch != 'p')
-INVALID_HEADER:
- return "missing or invalid 'p cnf <variables> <clauses>' header";
-
- if (!isspace (next ()))
- goto INVALID_HEADER;
-
- while (isspace (ch = next ()))
- ;
-
- if (ch != 'c' || next () != 'n' || next () != 'f' || !isspace (next ()))
- goto INVALID_HEADER;
-
- while (isspace (ch = next ()))
- ;
-
- if (!isdigit (ch))
- goto INVALID_HEADER;
-
- vars = ch - '0';
- while (isdigit (ch = next ()))
- vars = 10 * vars + (ch - '0');
-
- if (!isspace (ch))
- goto INVALID_HEADER;
-
- while (isspace (ch = next ()))
- ;
-
- if (!isdigit (ch))
- goto INVALID_HEADER;
-
- clauses = ch - '0';
- while (isdigit (ch = next ()))
- clauses = 10 * clauses + (ch - '0');
-
- if (!isspace (ch) && ch != '\n' )
- goto INVALID_HEADER;
-
- if (verbose)
- {
- fprintf (output, "c parsed header 'p cnf %d %d'\n", vars, clauses);
- fflush (output);
- }
-
- picosat_adjust (picosat, vars);
-
- if (incremental_rup_file)
- picosat_set_incremental_rup_file (picosat, incremental_rup_file, vars, clauses);
-
- lit = 0;
-READ_LITERAL:
- ch = next ();
-
- if (ch == 'c')
- {
- while ((ch = next ()) != EOF && ch != '\n')
- ;
- goto READ_LITERAL;
- }
-
- if (ch == EOF)
- {
- if (lit)
- return "trailing 0 missing";
-
- if (clauses && !force)
- return "clause missing";
-
- return 0;
- }
-
- if (isspace (ch))
- goto READ_LITERAL;
-
- sign = 1;
- if (ch == '-')
- {
- sign = -1;
- ch = next ();
- }
-
- if (!isdigit (ch))
- return "expected number";
-
- lit = ch - '0';
- while (isdigit (ch = next ()))
- lit = 10 * lit + (ch - '0');
-
- if (!clauses && !force)
- return "too many clauses";
-
- if (lit)
- {
- if (lit > vars && !force)
- return "maximal variable index exceeded";
-
- lit *= sign;
- }
- else
- clauses--;
-
- picosat_add (picosat, lit);
-
- goto READ_LITERAL;
-}
-
-static void
-bflush (void)
-{
- *bhead = 0;
- fputs (buffer, output);
- fputc ('\n', output);
- bhead = buffer;
-}
-
-static void
-printi (int i)
-{
- char *next;
- int l;
-
-REENTER:
- if (bhead == buffer)
- *bhead++ = 'v';
-
- l = sprintf (bhead, " %d", i);
- next = bhead + l;
-
- if (next >= eob)
- {
- bflush ();
- goto REENTER;
- }
- else
- bhead = next;
-}
-
-static void
-printa (PicoSAT * picosat, int partial)
-{
- int max_idx = picosat_variables (picosat), i, lit, val;
-
- assert (bhead == buffer);
-
- for (i = 1; i <= max_idx; i++)
- {
- if (partial)
- {
- val = picosat_deref_partial (picosat, i);
- if (!val)
- continue;
- }
- else
- val = picosat_deref (picosat, i);
- lit = (val > 0) ? i : -i;
- printi (lit);
- }
-
- printi (0);
- if (bhead > buffer)
- bflush ();
-}
-
-static void
-blocksol (PicoSAT * picosat)
-{
- int max_idx = picosat_variables (picosat), i;
-
- if (!sol)
- {
- sol = malloc (max_idx + 1);
- memset (sol, 0, max_idx + 1);
- }
-
- for (i = 1; i <= max_idx; i++)
- sol[i] = (picosat_deref (picosat, i) > 0) ? 1 : -1;
-
- for (i = 1; i <= max_idx; i++)
- picosat_add (picosat, (sol[i] < 0) ? i : -i);
-
- picosat_add (picosat, 0);
-}
-
-static int
-has_suffix (const char *str, const char *suffix)
-{
- const char *tmp = strstr (str, suffix);
- if (!tmp)
- return 0;
-
- return str + strlen (str) - strlen (suffix) == tmp;
-}
-
-static void
-write_core_variables (PicoSAT * picosat, FILE * file)
-{
- int i, max_idx = picosat_variables (picosat), count = 0;
- for (i = 1; i <= max_idx; i++)
- if (picosat_corelit (picosat, i))
- {
- fprintf (file, "%d\n", i);
- count++;
- }
-
- if (verbose)
- fprintf (output, "c found and wrote %d core variables\n", count);
-}
-
-static int
-next_assumption (int start)
-{
- char * arg, c;
- int res;
- res = start + 1;
- while (res < sargc)
- {
- arg = sargv[res++];
- if (!strcmp (arg, "-a"))
- {
- assert (res < sargc);
- break;
- }
-
- if (arg[0] == '-') {
- c = arg[1];
- if (c == 'l' || c == 'i' || c == 's' || c == 'o' || c == 't' ||
- c == 'T' || c == 'r' || c == 'R' || c == 'c' || c == 'V' ||
- c == 'U' || c == 'A') res++;
- }
- }
- if (res >= sargc) res = 0;
- return res;
-}
-
-static void
-write_failed_assumptions (PicoSAT * picosat, FILE * file)
-{
- int i, lit, count = 0;
-#ifndef NDEBUG
- int max_idx = picosat_variables (picosat);
-#endif
- i = 0;
- while ((i = next_assumption (i))) {
- lit = atoi (sargv[i]);
- if (!picosat_failed_assumption (picosat, lit)) continue;
- fprintf (file, "%d\n", lit);
- count++;
- }
- if (verbose)
- fprintf (output, "c found and wrote %d failed assumptions\n", count);
-#ifndef NDEBUG
- for (i = 1; i <= max_idx; i++)
- if (picosat_failed_assumption (picosat, i))
- count--;
-#endif
- assert (!count);
-}
-
-static void
-write_to_file (PicoSAT * picosat,
- const char *name,
- const char *type,
- void (*writer) (PicoSAT *, FILE *))
-{
- int pclose_file, zipped = has_suffix (name, ".gz");
- FILE *file;
- char *cmd;
-
- if (zipped)
- {
-#ifdef NZIP
- file = NULL;
-#else
- cmd = malloc (strlen (GZIP) + strlen (name));
- sprintf (cmd, GZIP, name);
- file = popen (cmd, "w");
- free (cmd);
- pclose_file = 1;
-#endif
- }
- else
- {
- file = fopen (name, "w");
- pclose_file = 0;
- }
-
- if (file)
- {
- if (verbose)
- fprintf (output,
- "c\nc writing %s%s to '%s'\n",
- zipped ? "gzipped " : "", type, name);
-
- writer (picosat, file);
-
-#ifndef NZIP
- if (pclose_file)
- pclose (file);
- else
-#endif
- fclose (file);
- }
- else
- fprintf (output, "*** picosat: can not write to '%s'\n", name);
-}
-
-static int catched;
-
-static void (*sig_int_handler);
-static void (*sig_segv_handler);
-static void (*sig_abrt_handler);
-static void (*sig_term_handler);
-#ifndef NALLSIGNALS
-static void (*sig_kill_handler);
-static void (*sig_xcpu_handler);
-static void (*sig_xfsz_handler);
-#endif
-
-static void
-resetsighandlers (void)
-{
- (void) signal (SIGINT, sig_int_handler);
- (void) signal (SIGSEGV, sig_segv_handler);
- (void) signal (SIGABRT, sig_abrt_handler);
- (void) signal (SIGTERM, sig_term_handler);
-#ifndef NALLSIGNALS
- (void) signal (SIGKILL, sig_kill_handler);
- (void) signal (SIGXCPU, sig_xcpu_handler);
- (void) signal (SIGXFSZ, sig_xfsz_handler);
-#endif
-}
-
-static int time_limit_in_seconds;
-static void (*sig_alarm_handler);
-static int ought_to_be_interrupted, interrupt_notified;
-
-static void
-alarm_triggered (int sig)
-{
- (void) sig;
- assert (sig == SIGALRM);
- assert (time_limit_in_seconds);
- assert (!ought_to_be_interrupted);
- ought_to_be_interrupted = 1;
- assert (!interrupt_notified);
-}
-
-static int
-interrupt_call_back (void * dummy)
-{
- (void) dummy;
- if (!ought_to_be_interrupted)
- return 0;
- if (!interrupt_notified)
- {
- if (verbose)
- {
- picosat_message (picosat, 1, "");
- picosat_message (picosat, 1,
- "*** TIME LIMIT OF %d SECONDS REACHED ***",
- time_limit_in_seconds);
- picosat_message (picosat, 1, "");
- }
- interrupt_notified = 1;
- }
- return 1;
-}
-
-static void
-setalarm ()
-{
-#ifndef NALARM
- assert (time_limit_in_seconds > 0);
- sig_alarm_handler = signal (SIGALRM, alarm_triggered);
- alarm (time_limit_in_seconds);
- assert (picosat);
- picosat_set_interrupt (picosat, 0, interrupt_call_back);
-#endif
-}
-
-static void
-resetalarm ()
-{
- assert (time_limit_in_seconds > 0);
- (void) signal (SIGALRM, sig_term_handler);
-}
-
-static void
-message (int sig)
-{
- picosat_message (picosat, 1, "");
- picosat_message (picosat, 1, "*** CAUGHT SIGNAL %d ***", sig);
- picosat_message (picosat, 1, "");
-}
-
-static void
-catch (int sig)
-{
- if (!catched)
- {
- message (sig);
- catched = 1;
- picosat_stats (picosat);
- message (sig);
- }
-
- resetsighandlers ();
- raise (sig);
-}
-
-static void
-setsighandlers (void)
-{
- sig_int_handler = signal (SIGINT, catch);
- sig_segv_handler = signal (SIGSEGV, catch);
- sig_abrt_handler = signal (SIGABRT, catch);
- sig_term_handler = signal (SIGTERM, catch);
-#ifndef NALLSIGNALS
- sig_kill_handler = signal (SIGKILL, catch);
- sig_xcpu_handler = signal (SIGXCPU, catch);
- sig_xfsz_handler = signal (SIGXFSZ, catch);
-#endif
-}
-
-#define USAGE \
-"usage: picosat [ <option> ... ] [ <input> ]\n" \
-"\n" \
-"where <option> is one of the following\n" \
-"\n" \
-" -h print this command line option summary and exit\n" \
-" --version print version and exit\n" \
-" --config print build configuration and exit\n" \
-"\n" \
-" -v enable verbose output\n" \
-" -f ignore invalid header\n" \
-" -n do not print satisfying assignment\n" \
-" -p print formula in DIMACS format and exit\n" \
-" --plain disable preprocessing (failed literal probing)\n" \
-" -a <lit> start with an assumption\n" \
-" -l <limit> set decision limit (no limit per default)\n" \
-" -L <limit> set time limit in seconds (no limit per default)\n" \
-" -P <limit> set propagation limit (no limit per default)\n" \
-" -i [0-3] [0-3]=[FALSE,TRUE,JWH,RAND] initial phase (default 2=JWH)\n" \
-" -s <seed> set random number generator seed (default 0)\n" \
-" -o <output> set output file (<stdout> per default)\n" \
-" -t <trace> generate compact proof trace file\n" \
-" -T <trace> generate extended proof trace file\n" \
-" -r <trace> generate reverse unit propagation proof file\n" \
-" -R <trace> generate reverse unit propagation proof file incrementally\n" \
-" -c <core> generate clausal core file in DIMACS format\n" \
-" -V <core> generate file listing core variables\n" \
-" -U <core> generate file listing used variables\n" \
-" -A <core> generate file listing failed assumptions\n" \
-"\n" \
-" --all enumerate all solutions\n" \
-" --partial generate and print only partial assignment\n" \
-"\n" \
-"and <input> is an optional input file in DIMACS format.\n"
-
-int
-picosat_main (int argc, char **argv)
-{
- int res, done, err, print_satisfying_assignment, force, print_formula;
- const char *compact_trace_name, *extended_trace_name, * rup_trace_name;
- int assumption, assumptions, defaultphase, allsat, partial, plain;
- const char * clausal_core_name, * variable_core_name;
- const char *input_name, *output_name;
- const char * failed_assumptions_name;
- int close_input, pclose_input;
- long long propagation_limit;
- int i, decision_limit;
- double start_time;
- long long sols;
- unsigned seed;
- FILE *file;
- int trace;
-
- start_time = picosat_time_stamp ();
-
- sargc = argc;
- sargv = argv;
-
- clausal_core_name = 0;
- variable_core_name = 0;
- failed_assumptions_name = 0;
- output_name = 0;
- compact_trace_name = 0;
- extended_trace_name = 0;
- rup_trace_name = 0;
- incremental_rup_file = 0;
- close_input = 0;
- pclose_input = 0;
- input_name = "<stdin>";
- input = stdin;
- output = stdout;
- verbose = 0;
- done = err = 0;
- decision_limit = -1;
- propagation_limit = -1;
- defaultphase = 2;
- assumptions = 0;
- force = 0;
- allsat = 0;
- partial = 0;
- trace = 0;
- plain = 0;
- seed = 0;
- sols= 0;
-
- picosat = 0;
-
- print_satisfying_assignment = 1;
- print_formula = 0;
-
- for (i = 1; !done && !err && i < argc; i++)
- {
- if (!strcmp (argv[i], "-h"))
- {
- fputs (USAGE, output);
- done = 1;
- }
- else if (!strcmp (argv[i], "--version"))
- {
- fprintf (output, "%s\n", picosat_version ());
- done = 1;
- }
- else if (!strcmp (argv[i], "--config"))
- {
- fprintf (output, "%s\n", picosat_config ());
- done = 1;
- }
- else if (!strcmp (argv[i], "-v"))
- {
- verbose++;
- }
- else if (!strcmp (argv[i], "--plain"))
- {
- plain = 1;
- }
- else if (!strcmp (argv[i], "-f"))
- {
- force = 1;
- }
- else if (!strcmp (argv[i], "-n"))
- {
- print_satisfying_assignment = 0;
- }
- else if (!strcmp (argv[i], "--partial"))
- {
- partial = 1;
- }
- else if (!strcmp (argv[i], "-p"))
- {
- print_formula = 1;
- }
- else if (!strcmp (argv[i], "-l"))
- {
- if (++i == argc)
- {
- fprintf (output, "*** picosat: argument to '-l' missing\n");
- err = 1;
- }
- else
- decision_limit = atoi (argv[i]);
- }
- else if (!strcmp (argv[i], "-L"))
- {
- if (++i == argc)
- {
- fprintf (output, "*** picosat: argument to '-L' missing\n");
- err = 1;
- }
- else
- {
- time_limit_in_seconds = atoi (argv[i]);
- if (time_limit_in_seconds <= 0)
- {
- fprintf (output, "*** picosat: invalid '-L' argument\n");
- err = 1;
- }
- }
- }
- else if (!strcmp (argv[i], "-P"))
- {
- if (++i == argc)
- {
- fprintf (output, "*** picosat: argument to '-P' missing\n");
- err = 1;
- }
- else
- propagation_limit = atol /* DM */ (argv[i]);
- }
- else if (!strcmp (argv[i], "-i"))
- {
- if (++i == argc)
- {
- fprintf (output, "*** picosat: argument to '-i' missing\n");
- err = 1;
- }
- else if (!argv[i][1] && ('0' <= argv[i][0] && argv[i][0] <= '3'))
- {
- defaultphase = argv[i][0] - '0';
- }
- else
- {
- fprintf (output, "*** picosat: invalid argument to '-i'\n");
- err = 1;
- }
- }
- else if (!strcmp (argv[i], "-a"))
- {
- if (++i == argc)
- {
- fprintf (output, "*** picosat: argument to '-a' missing\n");
- err = 1;
- }
- else if (!atoi (argv[i]))
- {
- fprintf (output, "*** picosat: argument to '-a' zero\n");
- err = 1;
- }
- else
- {
- /* Handle assumptions further down
- */
- assumptions++;
- }
- }
- else if (!strcmp (argv[i], "--all"))
- {
- allsat = 1;
- }
- else if (!strcmp (argv[i], "-s"))
- {
- if (++i == argc)
- {
- fprintf (output, "*** picosat: argument to '-s' missing\n");
- err = 1;
- }
- else
- seed = atoi (argv[i]);
- }
- else if (!strcmp (argv[i], "-o"))
- {
- if (output_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple output files '%s' and '%s'\n",
- output_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-o' missing\n");
- err = 1;
- }
- else if (!(file = fopen (argv[i], "w")))
- {
- fprintf (output,
- "*** picosat: "
- "can not write output file '%s'\n", argv[i]);
- err = 1;
- }
- else
- {
- output_name = argv[i];
- output = file;
- }
- }
- else if (!strcmp (argv[i], "-t"))
- {
- if (compact_trace_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple compact trace files '%s' and '%s'\n",
- compact_trace_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-t' missing\n");
- err = 1;
- }
- else
- {
- compact_trace_name = argv[i];
- trace = 1;
- }
- }
- else if (!strcmp (argv[i], "-T"))
- {
- if (extended_trace_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple extended trace files '%s' and '%s'\n",
- extended_trace_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-T' missing\n");
- err = 1;
- }
- else
- {
- extended_trace_name = argv[i];
- trace = 1;
- }
- }
- else if (!strcmp (argv[i], "-r"))
- {
- if (rup_trace_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple RUP trace files '%s' and '%s'\n",
- rup_trace_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-r' missing\n");
- err = 1;
- }
- else
- {
- rup_trace_name = argv[i];
- trace = 1;
- }
- }
- else if (!strcmp (argv[i], "-R"))
- {
- if (rup_trace_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple RUP trace files '%s' and '%s'\n",
- rup_trace_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-R' missing\n");
- err = 1;
- }
- else if (!(file = fopen (argv[i], "w")))
- {
- fprintf (output,
- "*** picosat: can not write to '%s'\n", argv[i]);
- err = 1;
- }
- else
- {
- rup_trace_name = argv[i];
- incremental_rup_file = file;
- }
- }
- else if (!strcmp (argv[i], "-c"))
- {
- if (clausal_core_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple clausal core files '%s' and '%s'\n",
- clausal_core_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-c' missing\n");
- err = 1;
- }
- else
- {
- clausal_core_name = argv[i];
- trace = 1;
- }
- }
- else if (!strcmp (argv[i], "-V"))
- {
- if (variable_core_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple variable core files '%s' and '%s'\n",
- variable_core_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-V' missing\n");
- err = 1;
- }
- else
- {
- variable_core_name = argv[i];
- trace = 1;
- }
- }
- else if (!strcmp (argv[i], "-A"))
- {
- if (failed_assumptions_name)
- {
- fprintf (output,
- "*** picosat: "
- "multiple failed assumptions files '%s' and '%s'\n",
- failed_assumptions_name, argv[i]);
- err = 1;
- }
- else if (++i == argc)
- {
- fprintf (output, "*** picosat: argument ot '-A' missing\n");
- err = 1;
- }
- else
- failed_assumptions_name = argv[i];
- }
- else if (argv[i][0] == '-')
- {
- fprintf (output,
- "*** picosat: "
- "unknown command line option '%s' (try '-h')\n", argv[i]);
- err = 1;
- }
- else if (close_input || pclose_input)
- {
- fprintf (output,
- "*** picosat: "
- "multiple input files '%s' and '%s'\n",
- input_name, argv[i]);
- err = 1;
- }
- else if (has_suffix (argv[i], ".gz"))
- {
-#ifdef NZIP
- file=NULL;
- err=1;
-#else
- char *cmd = malloc (strlen (GUNZIP) + strlen (argv[i]));
- sprintf (cmd, GUNZIP, argv[i]);
- if ((file = popen (cmd, "r")))
- {
- input_name = argv[i];
- pclose_input = 1;
- input = file;
- }
- else
- {
- fprintf (output,
- "*** picosat: "
- "can not read compressed input file '%s'\n", argv[i]);
- err = 1;
- }
- free (cmd);
-#endif
- }
- else if (has_suffix (argv[i], ".bz2"))
- {
-#ifdef NZIP
- file=NULL;
- err=1;
-#else
- char *cmd = malloc (strlen (BUNZIP2) + strlen (argv[i]));
- sprintf (cmd, BUNZIP2, argv[i]);
- if ((file = popen (cmd, "r")))
- {
- input_name = argv[i];
- pclose_input = 1;
- input = file;
- }
- else
- {
- fprintf (output,
- "*** picosat: "
- "can not read compressed input file '%s'\n", argv[i]);
- err = 1;
- }
- free (cmd);
-#endif
- }
- else if (!(file = fopen (argv[i], "r"))) /* TODO .gz ? */
- {
- fprintf (output,
- "*** picosat: can not read input file '%s'\n", argv[i]);
- err = 1;
- }
- else
- {
- input_name = argv[i];
- close_input = 1;
- input = file;
- }
- }
-
- if (allsat && partial)
- {
- fprintf (output,
- "*** picosat: can not combine '--all' and '--partial'");
- err = 1;
- }
-
- res = PICOSAT_UNKNOWN;
-
- if (!done && !err)
- {
- const char *err_msg;
-
- if (verbose)
- {
- fprintf (output,
- "c PicoSAT SAT Solver Version %s\n",
- picosat_version ());
-
- fprintf (output, "c %s\n", picosat_copyright ());
- fprintf (output, "c %s\n", picosat_config ());
- }
-
- picosat = picosat_init ();
-
- if (verbose)
- setsighandlers ();
-
- if (time_limit_in_seconds)
- setalarm ();
-
- picosat_enter (picosat);
-
- if (output_name)
- picosat_set_output (picosat, output);
-
- picosat_set_verbosity (picosat, verbose);
- picosat_set_plain (picosat, plain);
-
- if (verbose) fputs ("c\n", output);
-
- if (trace)
- {
- if (verbose)
- fprintf (output, "c tracing proof\n");
- picosat_enable_trace_generation (picosat);
- }
-
- if (defaultphase)
- {
- if (verbose)
- fprintf (output, "c using %d as default phase\n", defaultphase);
- picosat_set_global_default_phase (picosat, defaultphase);
- }
-
- if (propagation_limit >= 0)
- {
- if (verbose)
- fprintf (output, "c propagation limit of %lld propagations\n",
- propagation_limit);
- picosat_set_propagation_limit (picosat,
- (unsigned long long) propagation_limit);
- }
-
- if (partial)
- {
- if (verbose)
- fprintf (output,
- "c saving original clauses for partial assignment\n");
-
- picosat_save_original_clauses (picosat);
- }
-
- if (verbose)
- fprintf (output, "c\nc parsing %s\n", input_name);
-
- if (verbose)
- fflush (output);
-
- if ((err_msg = parse (picosat, force)))
- {
- fprintf (output, "%s:%d: %s\n", input_name, lineno, err_msg);
- err = 1;
- }
- else
- {
-NEXT_SOLUTION:
- if (assumptions)
- {
- i = 0;
- while ((i = next_assumption (i)))
- {
- assert (i < argc);
- assumption = atoi (argv[i]);
- assert (assumption);
-
- picosat_assume (picosat, assumption);
-
- if (verbose)
- fprintf (output, "c assumption %d\n", assumption);
- }
- }
-
- if (print_formula)
- {
- picosat_print (picosat, output);
- }
- else
- {
- if (verbose)
- fprintf (output,
- "c initialized %u variables\n"
- "c found %u non trivial clauses\n",
- picosat_variables (picosat),
- picosat_added_original_clauses (picosat));
-
- picosat_set_seed (picosat, seed);
- if (verbose)
- fprintf (output,
- "c\nc random number generator seed %u\n",
- seed);
-
- res = picosat_sat (picosat, decision_limit);
-
- if (res == PICOSAT_UNSATISFIABLE)
- {
-
- if (allsat)
- fprintf (output, "s SOLUTIONS %lld\n", sols);
- else
- fputs ("s UNSATISFIABLE\n", output);
-
- fflush (output);
-
- if (compact_trace_name)
- write_to_file (picosat,
- compact_trace_name,
- "compact trace",
- picosat_write_compact_trace);
-
- if (extended_trace_name)
- write_to_file (picosat,
- extended_trace_name,
- "extended trace",
- picosat_write_extended_trace);
-
- if (!incremental_rup_file && rup_trace_name)
- write_to_file (picosat,
- rup_trace_name,
- "rup trace",
- picosat_write_rup_trace);
-
- if (clausal_core_name)
- write_to_file (picosat,
- clausal_core_name,
- "clausal core",
- picosat_write_clausal_core);
-
- if (variable_core_name)
- write_to_file (picosat,
- variable_core_name,
- "variable core",
- write_core_variables);
-
- if (failed_assumptions_name)
- write_to_file (picosat,
- failed_assumptions_name,
- "failed assumptions",
- write_failed_assumptions);
- }
- else if (res == PICOSAT_SATISFIABLE)
- {
- if (allsat)
- {
- sols++;
- if (verbose)
- fprintf (output, "c\nc solution %lld\nc\n", sols);
- }
-
- if (!allsat || print_satisfying_assignment)
- fputs ("s SATISFIABLE\n", output);
-
- if (!allsat || verbose || print_satisfying_assignment)
- fflush (output);
-
- if (print_satisfying_assignment)
- printa (picosat, partial);
-
- if (allsat)
- {
- blocksol (picosat);
- goto NEXT_SOLUTION;
- }
- }
- else
- {
- fputs ("s UNKNOWN\n", output);
-
- if (allsat && verbose)
- fprintf (output,
- "c\nc limit reached after %lld solutions\n",
- sols);
- fflush (output);
- }
- }
- }
-
- if (!err && verbose)
- {
- fputs ("c\n", output);
- picosat_stats (picosat);
- fprintf (output,
- "c %.1f seconds total run time\n",
- picosat_time_stamp () - start_time);
- }
-
- if (sol)
- {
- free (sol);
- sol = 0;
- }
-
- picosat_leave (picosat);
-
- if (time_limit_in_seconds)
- resetalarm ();
-
- if (verbose)
- resetsighandlers ();
-
- picosat_reset (picosat);
- }
-
- if (incremental_rup_file)
- fclose (incremental_rup_file);
-
- if (close_input)
- fclose (input);
-
-#ifndef NZIP
- if (pclose_input)
- pclose (input);
-#endif
-
- if (output_name)
- fclose (output);
-
- return res;
-}
-#ifdef VERIMAG_MEASUREMENTS
-#include "../clock.h"
-#endif
-
-int picosat_main (int, char **);
-
-int
-main (int argc, char **argv)
-{
-
-#ifdef VERIMAG_MEASUREMENTS
- clock_prepare();
- clock_start();
-#endif
-
- int ret= picosat_main (argc, argv);
-
-#ifdef VERIMAG_MEASUREMENTS
- clock_stop();
- print_total_clock();
-#endif
-
- return ret;
-}
-/****************************************************************************
-Copyright (c) 2006 - 2015, Armin Biere, Johannes Kepler University.
-
-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.
-****************************************************************************/
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include <assert.h>
-#include <limits.h>
-#include <ctype.h>
-#include <stdarg.h>
-#include <stdint.h>
-
-#include "picosat.h"
-
-#define INLINE inline
-
-/* By default code for 'all different constraints' is disabled, since 'NADC'
- * is defined.
- */
-#define NADC
-
-/* By default we enable failed literals, since 'NFL' is undefined.
- *
-#define NFL
- */
-
-/* By default we 'detach satisfied (large) clauses', e.g. NDSC undefined.
- *
-#define NDSC
- */
-
-/* Do not use luby restart schedule instead of inner/outer.
- *
-#define NLUBY
- */
-
-/* Enabling this define, will use gnuplot to visualize how the scores evolve.
- *
-#define VISCORES
- */
-
-#ifdef VISCORES
-// #define WRITEGIF /* ... to generate a video */
-#endif
-
-#ifdef VISCORES
-#ifndef WRITEGIF
-#include <unistd.h> /* for 'usleep' */
-#endif
-#endif
-
-#ifdef RCODE
-#include <R.h>
-#endif
-
-#define MINRESTART 100 /* minimum restart interval */
-#define MAXRESTART 1000000 /* maximum restart interval */
-#define RDECIDE 1000 /* interval of random decisions */
-#define FRESTART 110 /* restart increase factor in percent */
-#define FREDUCE 110 /* reduce increase factor in percent */
-#define FREDADJ 121 /* reduce increase adjustment factor */
-#define MAXCILS 10 /* maximal number of unrecycled internals */
-#define FFLIPPED 10000 /* flipped reduce factor */
-#define FFLIPPEDPREC 10000000/* flipped reduce factor precision */
-#define INTERRUPTLIM 1024 /* check interrupt after that many decisions */
-
-#ifndef TRACE
-#define NO_BINARY_CLAUSES /* store binary clauses more compactly */
-#endif
-
-/* For debugging purposes you may want to define 'LOGGING', which actually
- * can be enforced by using './configure.sh --log'.
- */
-#ifdef LOGGING
-#define LOG(code) do { code; } while (0)
-#else
-#define LOG(code) do { } while (0)
-#endif
-#define NOLOG(code) do { } while (0) /* log exception */
-#define ONLYLOG(code) do { code; } while (0) /* force logging */
-
-#define FALSE ((Val)-1)
-#define UNDEF ((Val)0)
-#define TRUE ((Val)1)
-
-#define COMPACT_TRACECHECK_TRACE_FMT 0
-#define EXTENDED_TRACECHECK_TRACE_FMT 1
-#define RUP_TRACE_FMT 2
-
-#define NEWN(p,n) do { (p) = new (ps, sizeof (*(p)) * (n)); } while (0)
-#define CLRN(p,n) do { memset ((p), 0, sizeof (*(p)) * (n)); } while (0)
-#define CLR(p) CLRN(p,1)
-#define DELETEN(p,n) \
- do { delete (ps, p, sizeof (*(p)) * (n)); (p) = 0; } while (0)
-
-#define RESIZEN(p,old_num,new_num) \
- do { \
- size_t old_size = sizeof (*(p)) * (old_num); \
- size_t new_size = sizeof (*(p)) * (new_num); \
- (p) = resize (ps, (p), old_size, new_size) ; \
- } while (0)
-
-#define ENLARGE(start,head,end) \
- do { \
- unsigned old_num = (ptrdiff_t)((end) - (start)); \
- size_t new_num = old_num ? (2 * old_num) : 1; \
- unsigned count = (head) - (start); \
- assert ((start) <= (end)); \
- RESIZEN((start),old_num,new_num); \
- (head) = (start) + count; \
- (end) = (start) + new_num; \
- } while (0)
-
-#define NOTLIT(l) (ps->lits + (1 ^ ((l) - ps->lits)))
-
-#define LIT2IDX(l) ((ptrdiff_t)((l) - ps->lits) / 2)
-#define LIT2IMPLS(l) (ps->impls + (ptrdiff_t)((l) - ps->lits))
-#define LIT2INT(l) ((int)(LIT2SGN(l) * LIT2IDX(l)))
-#define LIT2SGN(l) (((ptrdiff_t)((l) - ps->lits) & 1) ? -1 : 1)
-#define LIT2VAR(l) (ps->vars + LIT2IDX(l))
-#define LIT2HTPS(l) (ps->htps + (ptrdiff_t)((l) - ps->lits))
-#define LIT2JWH(l) (ps->jwh + ((l) - ps->lits))
-
-#ifndef NDSC
-#define LIT2DHTPS(l) (ps->dhtps + (ptrdiff_t)((l) - ps->lits))
-#endif
-
-#ifdef NO_BINARY_CLAUSES
-typedef uintptr_t Wrd;
-#define ISLITREASON(C) (1&(Wrd)C)
-#define LIT2REASON(L) \
- (assert (L->val==TRUE), ((Cls*)(1 + (2*(L - ps->lits)))))
-#define REASON2LIT(C) ((Lit*)(ps->lits + ((Wrd)C)/2))
-#endif
-
-#define ENDOFCLS(c) ((void*)((Lit**)(c)->lits + (c)->size))
-
-#define SOC ((ps->oclauses == ps->ohead) ? ps->lclauses : ps->oclauses)
-#define EOC (ps->lhead)
-#define NXC(p) (((p) + 1 == ps->ohead) ? ps->lclauses : (p) + 1)
-
-#define OIDX2IDX(idx) (2 * ((idx) + 1))
-#define LIDX2IDX(idx) (2 * (idx) + 1)
-
-#define ISLIDX(idx) ((idx)&1)
-
-#define IDX2OIDX(idx) (assert(!ISLIDX(idx)), (idx)/2 - 1)
-#define IDX2LIDX(idx) (assert(ISLIDX(idx)), (idx)/2)
-
-#define EXPORTIDX(idx) \
- ((ISLIDX(idx) ? (IDX2LIDX (idx) + (ps->ohead - ps->oclauses)) : IDX2OIDX(idx)) + 1)
-
-#define IDX2CLS(i) \
- (assert(i), (ISLIDX(i) ? ps->lclauses : ps->oclauses)[(i)/2 - !ISLIDX(i)])
-
-#define IDX2ZHN(i) (assert(i), (ISLIDX(i) ? ps->zhains[(i)/2] : 0))
-
-#define CLS2TRD(c) (((Trd*)(c)) - 1)
-#define CLS2IDX(c) ((((Trd*)(c)) - 1)->idx)
-
-#define CLS2ACT(c) \
- ((Act*)((assert((c)->learned)),assert((c)->size>2),ENDOFCLS(c)))
-
-#define VAR2LIT(v) (ps->lits + 2 * ((v) - ps->vars))
-#define VAR2RNK(v) (ps->rnks + ((v) - ps->vars))
-
-#define RNK2LIT(r) (ps->lits + 2 * ((r) - ps->rnks))
-#define RNK2VAR(r) (ps->vars + ((r) - ps->rnks))
-
-#define BLK_FILL_BYTES 8
-#define SIZE_OF_BLK (sizeof (Blk) - BLK_FILL_BYTES)
-
-#define PTR2BLK(void_ptr) \
- ((void_ptr) ? (Blk*)(((char*)(void_ptr)) - SIZE_OF_BLK) : 0)
-
-#define AVERAGE(a,b) ((b) ? (((double)a) / (double)(b)) : 0.0)
-#define PERCENT(a,b) (100.0 * AVERAGE(a,b))
-
-#ifndef RCODE
-#define ABORT(msg) \
- do { \
- fputs ("*** picosat: " msg "\n", stderr); \
- abort (); \
- } while (0)
-#else
-#define ABORT(msg) \
- do { \
- Rf_error (msg); \
- } while (0)
-#endif
-
-#define ABORTIF(cond,msg) \
- do { \
- if (!(cond)) break; \
- ABORT (msg); \
- } while (0)
-
-#define ZEROFLT (0x00000000u)
-#define EPSFLT (0x00000001u)
-#define INFFLT (0xffffffffu)
-
-#define FLTCARRY (1u << 25)
-#define FLTMSB (1u << 24)
-#define FLTMAXMANTISSA (FLTMSB - 1)
-
-#define FLTMANTISSA(d) ((d) & FLTMAXMANTISSA)
-#define FLTEXPONENT(d) ((int)((d) >> 24) - 128)
-
-#define FLTMINEXPONENT (-128)
-#define FLTMAXEXPONENT (127)
-
-#define CMPSWAPFLT(a,b) \
- do { \
- Flt tmp; \
- if (((a) < (b))) \
- { \
- tmp = (a); \
- (a) = (b); \
- (b) = tmp; \
- } \
- } while (0)
-
-#define UNPACKFLT(u,m,e) \
- do { \
- (m) = FLTMANTISSA(u); \
- (e) = FLTEXPONENT(u); \
- (m) |= FLTMSB; \
- } while (0)
-
-#define INSERTION_SORT_LIMIT 10
-
-#define SORTING_SWAP(T,p,q) \
-do { \
- T tmp = *(q); \
- *(q) = *(p); \
- *(p) = tmp; \
-} while (0)
-
-#define SORTING_CMP_SWAP(T,cmp,p,q) \
-do { \
- if ((cmp) (ps, *(p), *(q)) > 0) \
- SORTING_SWAP (T, p, q); \
-} while(0)
-
-#define QUICKSORT_PARTITION(T,cmp,a,l,r) \
-do { \
- T pivot; \
- int j; \
- i = (l) - 1; /* result in 'i' */ \
- j = (r); \
- pivot = (a)[j]; \
- for (;;) \
- { \
- while ((cmp) (ps, (a)[++i], pivot) < 0) \
- ; \
- while ((cmp) (ps, pivot, (a)[--j]) < 0) \
- if (j == (l)) \
- break; \
- if (i >= j) \
- break; \
- SORTING_SWAP (T, (a) + i, (a) + j); \
- } \
- SORTING_SWAP (T, (a) + i, (a) + (r)); \
-} while(0)
-
-#define QUICKSORT(T,cmp,a,n) \
-do { \
- int l = 0, r = (n) - 1, m, ll, rr, i; \
- assert (ps->ihead == ps->indices); \
- if (r - l <= INSERTION_SORT_LIMIT) \
- break; \
- for (;;) \
- { \
- m = (l + r) / 2; \
- SORTING_SWAP (T, (a) + m, (a) + r - 1); \
- SORTING_CMP_SWAP (T, cmp, (a) + l, (a) + r - 1); \
- SORTING_CMP_SWAP (T, cmp, (a) + l, (a) + r); \
- SORTING_CMP_SWAP (T, cmp, (a) + r - 1, (a) + r); \
- QUICKSORT_PARTITION (T, cmp, (a), l + 1, r - 1); \
- if (i - l < r - i) \
- { \
- ll = i + 1; \
- rr = r; \
- r = i - 1; \
- } \
- else \
- { \
- ll = l; \
- rr = i - 1; \
- l = i + 1; \
- } \
- if (r - l > INSERTION_SORT_LIMIT) \
- { \
- assert (rr - ll > INSERTION_SORT_LIMIT); \
- if (ps->ihead == ps->eoi) \
- ENLARGE (ps->indices, ps->ihead, ps->eoi); \
- *ps->ihead++ = ll; \
- if (ps->ihead == ps->eoi) \
- ENLARGE (ps->indices, ps->ihead, ps->eoi); \
- *ps->ihead++ = rr; \
- } \
- else if (rr - ll > INSERTION_SORT_LIMIT) \
- { \
- l = ll; \
- r = rr; \
- } \
- else if (ps->ihead > ps->indices) \
- { \
- r = *--ps->ihead; \
- l = *--ps->ihead; \
- } \
- else \
- break; \
- } \
-} while (0)
-
-#define INSERTION_SORT(T,cmp,a,n) \
-do { \
- T pivot; \
- int l = 0, r = (n) - 1, i, j; \
- for (i = r; i > l; i--) \
- SORTING_CMP_SWAP (T, cmp, (a) + i - 1, (a) + i); \
- for (i = l + 2; i <= r; i++) \
- { \
- j = i; \
- pivot = (a)[i]; \
- while ((cmp) (ps, pivot, (a)[j - 1]) < 0) \
- { \
- (a)[j] = (a)[j - 1]; \
- j--; \
- } \
- (a)[j] = pivot; \
- } \
-} while (0)
-
-#ifdef NDEBUG
-#define CHECK_SORTED(cmp,a,n) do { } while(0)
-#else
-#define CHECK_SORTED(cmp,a,n) \
-do { \
- int i; \
- for (i = 0; i < (n) - 1; i++) \
- assert ((cmp) (ps, (a)[i], (a)[i + 1]) <= 0); \
-} while(0)
-#endif
-
-#define SORT(T,cmp,a,n) \
-do { \
- T * aa = (a); \
- int nn = (n); \
- QUICKSORT (T, cmp, aa, nn); \
- INSERTION_SORT (T, cmp, aa, nn); \
- assert (ps->ihead == ps->indices); \
- CHECK_SORTED (cmp, aa, nn); \
-} while (0)
-
-#define WRDSZ (sizeof (long) * 8)
-
-#ifdef RCODE
-#define fprintf(...) do { } while (0)
-#define vfprintf(...) do { } while (0)
-#define fputs(...) do { } while (0)
-#define fputc(...) do { } while (0)
-#endif
-
-typedef unsigned Flt; /* 32 bit deterministic soft float */
-typedef Flt Act; /* clause and variable activity */
-typedef struct Blk Blk; /* allocated memory block */
-typedef struct Cls Cls; /* clause */
-typedef struct Lit Lit; /* literal */
-typedef struct Rnk Rnk; /* variable to score mapping */
-typedef signed char Val; /* TRUE, UNDEF, FALSE */
-typedef struct Var Var; /* variable */
-#ifdef TRACE
-typedef struct Trd Trd; /* trace data for clauses */
-typedef struct Zhn Zhn; /* compressed chain (=zain) data */
-typedef unsigned char Znt; /* compressed antecedent data */
-#endif
-
-#ifdef NO_BINARY_CLAUSES
-typedef struct Ltk Ltk;
-
-struct Ltk
-{
- Lit ** start;
- unsigned count : WRDSZ == 32 ? 27 : 32;
- unsigned ldsize : WRDSZ == 32 ? 5 : 32;
-};
-#endif
-
-struct Lit
-{
- Val val;
-};
-
-struct Var
-{
- unsigned mark : 1; /*bit 1*/
- unsigned resolved : 1; /*bit 2*/
- unsigned phase : 1; /*bit 3*/
- unsigned assigned : 1; /*bit 4*/
- unsigned used : 1; /*bit 5*/
- unsigned failed : 1; /*bit 6*/
- unsigned internal : 1; /*bit 7*/
- unsigned usedefphase : 1; /*bit 8*/
- unsigned defphase : 1; /*bit 9*/
- unsigned msspos : 1; /*bit 10*/
- unsigned mssneg : 1; /*bit 11*/
- unsigned humuspos : 1; /*bit 12*/
- unsigned humusneg : 1; /*bit 13*/
- unsigned partial : 1; /*bit 14*/
-#ifdef TRACE
- unsigned core : 1; /*bit 15*/
-#endif
- unsigned level;
- Cls *reason;
-#ifndef NADC
- Lit ** inado;
- Lit ** ado;
- Lit *** adotabpos;
-#endif
-};
-
-struct Rnk
-{
- Act score;
- unsigned pos : 30; /* 0 iff not on heap */
- unsigned moreimportant : 1;
- unsigned lessimportant : 1;
-};
-
-struct Cls
-{
- unsigned size;
-
- unsigned collect:1; /* bit 1 */
- unsigned learned:1; /* bit 2 */
- unsigned locked:1; /* bit 3 */
- unsigned used:1; /* bit 4 */
-#ifndef NDEBUG
- unsigned connected:1; /* bit 5 */
-#endif
-#ifdef TRACE
- unsigned collected:1; /* bit 6 */
- unsigned core:1; /* bit 7 */
-#endif
-
-#define LDMAXGLUE 25 /* 32 - 7 */
-#define MAXGLUE ((1<<LDMAXGLUE)-1)
-
- unsigned glue:LDMAXGLUE;
-
- Cls *next[2];
- Lit *lits[2];
-};
-
-#ifdef TRACE
-struct Zhn
-{
- unsigned ref:31;
- unsigned core:1;
- Znt * liz;
- Znt znt[0];
-};
-
-struct Trd
-{
- unsigned idx;
- Cls cls[0];
-};
-#endif
-
-struct Blk
-{
-#ifndef NDEBUG
- union
- {
- size_t size; /* this is what we really use */
- void *as_two_ptrs[2]; /* 2 * sizeof (void*) alignment of data */
- }
- header;
-#endif
- char data[BLK_FILL_BYTES];
-};
-
-enum State
-{
- RESET = 0,
- READY = 1,
- SAT = 2,
- UNSAT = 3,
- UNKNOWN = 4,
-};
-
-enum Phase
-{
- POSPHASE,
- NEGPHASE,
- JWLPHASE,
- RNDPHASE,
-};
-
-struct PicoSAT
-{
- enum State state;
- enum Phase defaultphase;
- int last_sat_call_result;
-
- FILE *out;
- char * prefix;
- int verbosity;
- int plain;
- unsigned LEVEL;
- unsigned max_var;
- unsigned size_vars;
-
- Lit *lits;
- Var *vars;
- Rnk *rnks;
- Flt *jwh;
- Cls **htps;
-#ifndef NDSC
- Cls **dhtps;
-#endif
-#ifdef NO_BINARY_CLAUSES
- Ltk *impls;
- Cls impl, cimpl;
- int implvalid, cimplvalid;
-#else
- Cls **impls;
-#endif
- Lit **trail, **thead, **eot, **ttail, ** ttail2;
-#ifndef NADC
- Lit **ttailado;
-#endif
- unsigned adecidelevel;
- Lit **als, **alshead, **alstail, **eoals;
- Lit **CLS, **clshead, **eocls;
- int *rils, *rilshead, *eorils;
- int *cils, *cilshead, *eocils;
- int *fals, *falshead, *eofals;
- int *mass, szmass;
- int *mssass, szmssass;
- int *mcsass, nmcsass, szmcsass;
- int *humus, szhumus;
- Lit *failed_assumption;
- int extracted_all_failed_assumptions;
- Rnk **heap, **hhead, **eoh;
- Cls **oclauses, **ohead, **eoo; /* original clauses */
- Cls **lclauses, **lhead, ** EOL; /* learned clauses */
- int * soclauses, * sohead, * eoso; /* saved original clauses */
- int saveorig;
- int partial;
-#ifdef TRACE
- int trace;
- Zhn **zhains, **zhead, **eoz;
- int ocore;
-#endif
- FILE * rup;
- int rupstarted;
- int rupvariables;
- int rupclauses;
- Cls *mtcls;
- Cls *conflict;
- Lit **added, **ahead, **eoa;
- Var **marked, **mhead, **eom;
- Var **dfs, **dhead, **eod;
- Cls **resolved, **rhead, **eor;
- unsigned char *levels, *levelshead, *eolevels;
- unsigned *dused, *dusedhead, *eodused;
- unsigned char *buffer, *bhead, *eob;
- Act vinc, lscore, ilvinc, ifvinc;
-#ifdef VISCORES
- Act fvinc, nvinc;
-#endif
- Act cinc, lcinc, ilcinc, fcinc;
- unsigned srng;
- size_t current_bytes;
- size_t max_bytes;
- size_t recycled;
- double seconds, flseconds;
- double entered;
- unsigned nentered;
- int measurealltimeinlib;
- char *rline[2];
- int szrline, RCOUNT;
- double levelsum;
- unsigned iterations;
- int reports;
- int lastrheader;
- unsigned calls;
- unsigned decisions;
- unsigned restarts;
- unsigned simps;
- unsigned fsimplify;
- unsigned isimplify;
- unsigned reductions;
- unsigned lreduce;
- unsigned lreduceadjustcnt;
- unsigned lreduceadjustinc;
- unsigned lastreduceconflicts;
- unsigned llocked; /* locked large learned clauses */
- unsigned lrestart;
-#ifdef NLUBY
- unsigned drestart;
- unsigned ddrestart;
-#else
- unsigned lubycnt;
- unsigned lubymaxdelta;
- int waslubymaxdelta;
-#endif
- unsigned long long lsimplify;
- unsigned long long propagations;
- unsigned long long lpropagations;
- unsigned fixed; /* top level assignments */
-#ifndef NFL
- unsigned failedlits;
- unsigned ifailedlits;
- unsigned efailedlits;
- unsigned flcalls;
-#ifdef STATS
- unsigned flrounds;
- unsigned long long flprops;
- unsigned long long floopsed, fltried, flskipped;
-#endif
- unsigned long long fllimit;
- int simplifying;
- Lit ** saved;
- unsigned saved_size;
-#endif
- unsigned conflicts;
- unsigned contexts;
- unsigned internals;
- unsigned noclauses; /* current number large original clauses */
- unsigned nlclauses; /* current number large learned clauses */
- unsigned olits; /* current literals in large original clauses */
- unsigned llits; /* current literals in large learned clauses */
- unsigned oadded; /* added original clauses */
- unsigned ladded; /* added learned clauses */
- unsigned loadded; /* added original large clauses */
- unsigned lladded; /* added learned large clauses */
- unsigned addedclauses; /* oadded + ladded */
- unsigned vused; /* used variables */
- unsigned llitsadded; /* added learned literals */
- unsigned long long visits;
-#ifdef STATS
- unsigned loused; /* used large original clauses */
- unsigned llused; /* used large learned clauses */
- unsigned long long bvisits;
- unsigned long long tvisits;
- unsigned long long lvisits;
- unsigned long long othertrue;
- unsigned long long othertrue2;
- unsigned long long othertruel;
- unsigned long long othertrue2u;
- unsigned long long othertruelu;
- unsigned long long ltraversals;
- unsigned long long traversals;
-#ifdef TRACE
- unsigned long long antecedents;
-#endif
- unsigned uips;
- unsigned znts;
- unsigned assumptions;
- unsigned rdecisions;
- unsigned sdecisions;
- size_t srecycled;
- size_t rrecycled;
- unsigned long long derefs;
-#endif
- unsigned minimizedllits;
- unsigned nonminimizedllits;
-#ifndef NADC
- Lit *** ados, *** hados, *** eados;
- Lit *** adotab;
- unsigned nadotab;
- unsigned szadotab;
- Cls * adoconflict;
- unsigned adoconflicts;
- unsigned adoconflictlimit;
- int addingtoado;
- int adodisabled;
-#endif
- unsigned long long flips;
-#ifdef STATS
- unsigned long long FORCED;
- unsigned long long assignments;
- unsigned inclreduces;
- unsigned staticphasedecisions;
- unsigned skippedrestarts;
-#endif
- int * indices, * ihead, *eoi;
- unsigned sdflips;
-
- unsigned long long saved_flips;
- unsigned saved_max_var;
- unsigned min_flipped;
-
- void * emgr;
- picosat_malloc enew;
- picosat_realloc eresize;
- picosat_free edelete;
-
- struct {
- void * state;
- int (*function) (void *);
- } interrupt;
-
-#ifdef VISCORES
- FILE * fviscores;
-#endif
-};
-
-typedef PicoSAT PS;
-
-static INLINE Flt
-packflt (unsigned m, int e)
-{
- Flt res;
- assert (m < FLTMSB);
- assert (FLTMINEXPONENT <= e);
- assert (e <= FLTMAXEXPONENT);
- res = m | ((unsigned)(e + 128) << 24);
- return res;
-}
-
-static Flt
-base2flt (unsigned m, int e)
-{
- if (!m)
- return ZEROFLT;
-
- if (m < FLTMSB)
- {
- do
- {
- if (e <= FLTMINEXPONENT)
- return EPSFLT;
-
- e--;
- m <<= 1;
-
- }
- while (m < FLTMSB);
- }
- else
- {
- while (m >= FLTCARRY)
- {
- if (e >= FLTMAXEXPONENT)
- return INFFLT;
-
- e++;
- m >>= 1;
- }
- }
-
- m &= ~FLTMSB;
- return packflt (m, e);
-}
-
-static Flt
-addflt (Flt a, Flt b)
-{
- unsigned ma, mb, delta;
- int ea, eb;
-
- CMPSWAPFLT (a, b);
- if (!b)
- return a;
-
- UNPACKFLT (a, ma, ea);
- UNPACKFLT (b, mb, eb);
-
- assert (ea >= eb);
- delta = ea - eb;
- if (delta < 32) mb >>= delta; else mb = 0;
- if (!mb)
- return a;
-
- ma += mb;
- if (ma & FLTCARRY)
- {
- if (ea == FLTMAXEXPONENT)
- return INFFLT;
-
- ea++;
- ma >>= 1;
- }
-
- assert (ma < FLTCARRY);
- ma &= FLTMAXMANTISSA;
-
- return packflt (ma, ea);
-}
-
-static Flt
-mulflt (Flt a, Flt b)
-{
- unsigned ma, mb;
- unsigned long long accu;
- int ea, eb;
-
- CMPSWAPFLT (a, b);
- if (!b)
- return ZEROFLT;
-
- UNPACKFLT (a, ma, ea);
- UNPACKFLT (b, mb, eb);
-
- ea += eb;
- ea += 24;
- if (ea > FLTMAXEXPONENT)
- return INFFLT;
-
- if (ea < FLTMINEXPONENT)
- return EPSFLT;
-
- accu = ma;
- accu *= mb;
- accu >>= 24;
-
- if (accu >= FLTCARRY)
- {
- if (ea == FLTMAXEXPONENT)
- return INFFLT;
-
- ea++;
- accu >>= 1;
-
- if (accu >= FLTCARRY)
- return INFFLT;
- }
-
- assert (accu < FLTCARRY);
- assert (accu & FLTMSB);
-
- ma = accu;
- ma &= ~FLTMSB;
-
- return packflt (ma, ea);
-}
-
-static Flt
-ascii2flt (const char *str)
-{
- Flt ten = base2flt (10, 0);
- Flt onetenth = base2flt (26843546, -28);
- Flt res = ZEROFLT, tmp, base;
- const char *p = str;
- int ch;
-
- ch = *p++;
-
- if (ch != '.')
- {
- if (!isdigit (ch))
- return INFFLT; /* better abort ? */
-
- res = base2flt (ch - '0', 0);
-
- while ((ch = *p++))
- {
- if (ch == '.')
- break;
-
- if (!isdigit (ch))
- return INFFLT; /* better abort? */
-
- res = mulflt (res, ten);
- tmp = base2flt (ch - '0', 0);
- res = addflt (res, tmp);
- }
- }
-
- if (ch == '.')
- {
- ch = *p++;
- if (!isdigit (ch))
- return INFFLT; /* better abort ? */
-
- base = onetenth;
- tmp = mulflt (base2flt (ch - '0', 0), base);
- res = addflt (res, tmp);
-
- while ((ch = *p++))
- {
- if (!isdigit (ch))
- return INFFLT; /* better abort? */
-
- base = mulflt (base, onetenth);
- tmp = mulflt (base2flt (ch - '0', 0), base);
- res = addflt (res, tmp);
- }
- }
-
- return res;
-}
-
-#if defined(VISCORES)
-
-static double
-flt2double (Flt f)
-{
- double res;
- unsigned m;
- int e, i;
-
- UNPACKFLT (f, m, e);
- res = m;
-
- if (e < 0)
- {
- for (i = e; i < 0; i++)
- res *= 0.5;
- }
- else
- {
- for (i = 0; i < e; i++)
- res *= 2.0;
- }
-
- return res;
-}
-
-#endif
-
-static INLINE int
-log2flt (Flt a)
-{
- return FLTEXPONENT (a) + 24;
-}
-
-static INLINE int
-cmpflt (Flt a, Flt b)
-{
- if (a < b)
- return -1;
-
- if (a > b)
- return 1;
-
- return 0;
-}
-
-static void *
-new (PS * ps, size_t size)
-{
- size_t bytes;
- Blk *b;
-
- if (!size)
- return 0;
-
- bytes = size + SIZE_OF_BLK;
-
- if (ps->enew)
- b = ps->enew (ps->emgr, bytes);
- else
- b = malloc (bytes);
-
- ABORTIF (!b, "out of memory in 'new'");
-#ifndef NDEBUG
- b->header.size = size;
-#endif
- ps->current_bytes += size;
- if (ps->current_bytes > ps->max_bytes)
- ps->max_bytes = ps->current_bytes;
- return b->data;
-}
-
-static void
-delete (PS * ps, void *void_ptr, size_t size)
-{
- size_t bytes;
- Blk *b;
-
- if (!void_ptr)
- {
- assert (!size);
- return;
- }
-
- assert (size);
- b = PTR2BLK (void_ptr);
-
- assert (size <= ps->current_bytes);
- ps->current_bytes -= size;
-
- assert (b->header.size == size);
-
- bytes = size + SIZE_OF_BLK;
- if (ps->edelete)
- ps->edelete (ps->emgr, b, bytes);
- else
- free (b);
-}
-
-static void *
-resize (PS * ps, void *void_ptr, size_t old_size, size_t new_size)
-{
- size_t old_bytes, new_bytes;
- Blk *b;
-
- b = PTR2BLK (void_ptr);
-
- assert (old_size <= ps->current_bytes);
- ps->current_bytes -= old_size;
-
- if ((old_bytes = old_size))
- {
- assert (old_size && b && b->header.size == old_size);
- old_bytes += SIZE_OF_BLK;
- }
- else
- assert (!b);
-
- if ((new_bytes = new_size))
- new_bytes += SIZE_OF_BLK;
-
- if (ps->eresize)
- b = ps->eresize (ps->emgr, b, old_bytes, new_bytes);
- else
- b = realloc (b, new_bytes);
-
- if (!new_size)
- {
- assert (!b);
- return 0;
- }
-
- ABORTIF (!b, "out of memory in 'resize'");
-#ifndef NDEBUG
- b->header.size = new_size;
-#endif
-
- ps->current_bytes += new_size;
- if (ps->current_bytes > ps->max_bytes)
- ps->max_bytes = ps->current_bytes;
-
- return b->data;
-}
-
-static INLINE unsigned
-int2unsigned (int l)
-{
- return (l < 0) ? 1 + 2 * -l : 2 * l;
-}
-
-static INLINE Lit *
-int2lit (PS * ps, int l)
-{
- return ps->lits + int2unsigned (l);
-}
-
-static INLINE Lit **
-end_of_lits (Cls * c)
-{
- return (Lit**)c->lits + c->size;
-}
-
-#if !defined(NDEBUG) || defined(LOGGING)
-
-static void
-dumplits (PS * ps, Lit ** l, Lit ** end)
-{
- int first;
- Lit ** p;
-
- if (l == end)
- {
- /* empty clause */
- }
- else if (l + 1 == end)
- {
- fprintf (ps->out, "%d ", LIT2INT (l[0]));
- }
- else
- {
- assert (l + 2 <= end);
- first = (abs (LIT2INT (l[0])) > abs (LIT2INT (l[1])));
- fprintf (ps->out, "%d ", LIT2INT (l[first]));
- fprintf (ps->out, "%d ", LIT2INT (l[!first]));
- for (p = l + 2; p < end; p++)
- fprintf (ps->out, "%d ", LIT2INT (*p));
- }
-
- fputc ('0', ps->out);
-}
-
-static void
-dumpcls (PS * ps, Cls * c)
-{
- Lit **end;
-
- if (c)
- {
- end = end_of_lits (c);
- dumplits (ps, c->lits, end);
-#ifdef TRACE
- if (ps->trace)
- fprintf (ps->out, " clause(%u)", CLS2IDX (c));
-#endif
- }
- else
- fputs ("DECISION", ps->out);
-}
-
-static void
-dumpclsnl (PS * ps, Cls * c)
-{
- dumpcls (ps, c);
- fputc ('\n', ps->out);
-}
-
-void
-dumpcnf (PS * ps)
-{
- Cls **p, *c;
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
-
- if (!c)
- continue;
-
-#ifdef TRACE
- if (c->collected)
- continue;
-#endif
-
- dumpclsnl (ps, *p);
- }
-}
-
-#endif
-
-static INLINE void
-delete_prefix (PS * ps)
-{
- if (!ps->prefix)
- return;
-
- delete (ps, ps->prefix, strlen (ps->prefix) + 1);
- ps->prefix = 0;
-}
-
-static void
-new_prefix (PS * ps, const char * str)
-{
- delete_prefix (ps);
- assert (str);
- ps->prefix = new (ps, strlen (str) + 1);
- strcpy (ps->prefix, str);
-}
-
-static PS *
-init (void * pmgr,
- picosat_malloc pnew, picosat_realloc presize, picosat_free pdelete)
-{
- PS * ps;
-
-#if 0
- int count = 3 - !pnew - !presize - !pdelete;
-
- ABORTIF (count && !pnew, "API usage: missing 'picosat_set_new'");
- ABORTIF (count && !presize, "API usage: missing 'picosat_set_resize'");
- ABORTIF (count && !pdelete, "API usage: missing 'picosat_set_delete'");
-#endif
-
- ps = pnew ? pnew (pmgr, sizeof *ps) : malloc (sizeof *ps);
- ABORTIF (!ps, "failed to allocate memory for PicoSAT manager");
- memset (ps, 0, sizeof *ps);
-
- ps->emgr = pmgr;
- ps->enew = pnew;
- ps->eresize = presize;
- ps->edelete = pdelete;
-
- ps->size_vars = 1;
- ps->state = RESET;
- ps->defaultphase = JWLPHASE;
-#ifdef TRACE
- ps->ocore = -1;
-#endif
- ps->lastrheader = -2;
-#ifndef NADC
- ps->adoconflictlimit = UINT_MAX;
-#endif
- ps->min_flipped = UINT_MAX;
-
- NEWN (ps->lits, 2 * ps->size_vars);
- NEWN (ps->jwh, 2 * ps->size_vars);
- NEWN (ps->htps, 2 * ps->size_vars);
-#ifndef NDSC
- NEWN (ps->dhtps, 2 * ps->size_vars);
-#endif
- NEWN (ps->impls, 2 * ps->size_vars);
- NEWN (ps->vars, ps->size_vars);
- NEWN (ps->rnks, ps->size_vars);
-
- /* because '0' pos denotes not on heap
- */
- ENLARGE (ps->heap, ps->hhead, ps->eoh);
- ps->hhead = ps->heap + 1;
-
- ps->vinc = base2flt (1, 0); /* initial var activity */
- ps->ifvinc = ascii2flt ("1.05"); /* var score rescore factor */
-#ifdef VISCORES
- ps->fvinc = ascii2flt ("0.9523809"); /* 1/f = 1/1.05 */
- ps->nvinc = ascii2flt ("0.0476191"); /* 1 - 1/f = 1 - 1/1.05 */
-#endif
- ps->lscore = base2flt (1, 90); /* var activity rescore limit */
- ps->ilvinc = base2flt (1, -90); /* inverse of 'lscore' */
-
- ps->cinc = base2flt (1, 0); /* initial clause activity */
- ps->fcinc = ascii2flt ("1.001"); /* cls activity rescore factor */
- ps->lcinc = base2flt (1, 90); /* cls activity rescore limit */
- ps->ilcinc = base2flt (1, -90); /* inverse of 'ilcinc' */
-
- ps->lreduceadjustcnt = ps->lreduceadjustinc = 100;
- ps->lpropagations = ~0ull;
-
-#ifndef RCODE
- ps->out = stdout;
-#else
- ps->out = 0;
-#endif
- new_prefix (ps, "c ");
- ps->verbosity = 0;
- ps->plain = 0;
-
-#ifdef NO_BINARY_CLAUSES
- memset (&ps->impl, 0, sizeof (ps->impl));
- ps->impl.size = 2;
-
- memset (&ps->cimpl, 0, sizeof (ps->impl));
- ps->cimpl.size = 2;
-#endif
-
-#ifdef VISCORES
- ps->fviscores = popen (
- "/usr/bin/gnuplot -background black"
- " -xrm 'gnuplot*textColor:white'"
- " -xrm 'gnuplot*borderColor:white'"
- " -xrm 'gnuplot*axisColor:white'"
- , "w");
- fprintf (ps->fviscores, "unset key\n");
- // fprintf (ps->fviscores, "set log y\n");
- fflush (ps->fviscores);
- system ("rm -rf /tmp/picosat-viscores");
- system ("mkdir /tmp/picosat-viscores");
- system ("mkdir /tmp/picosat-viscores/data");
-#ifdef WRITEGIF
- system ("mkdir /tmp/picosat-viscores/gif");
- fprintf (ps->fviscores,
- "set terminal gif giant animate opt size 1024,768 x000000 xffffff"
- "\n");
-
- fprintf (ps->fviscores,
- "set output \"/tmp/picosat-viscores/gif/animated.gif\"\n");
-#endif
-#endif
- ps->defaultphase = JWLPHASE;
- ps->state = READY;
- ps->last_sat_call_result = 0;
-
- return ps;
-}
-
-static size_t
-bytes_clause (PS * ps, unsigned size, unsigned learned)
-{
- size_t res;
-
- res = sizeof (Cls);
- res += size * sizeof (Lit *);
- res -= 2 * sizeof (Lit *);
-
- if (learned && size > 2)
- res += sizeof (Act); /* add activity */
-
-#ifdef TRACE
- if (ps->trace)
- res += sizeof (Trd); /* add trace data */
-#else
- (void) ps;
-#endif
-
- return res;
-}
-
-static Cls *
-new_clause (PS * ps, unsigned size, unsigned learned)
-{
- size_t bytes;
- void * tmp;
-#ifdef TRACE
- Trd *trd;
-#endif
- Cls *res;
-
- bytes = bytes_clause (ps, size, learned);
- tmp = new (ps, bytes);
-
-#ifdef TRACE
- if (ps->trace)
- {
- trd = tmp;
-
- if (learned)
- trd->idx = LIDX2IDX (ps->lhead - ps->lclauses);
- else
- trd->idx = OIDX2IDX (ps->ohead - ps->oclauses);
-
- res = trd->cls;
- }
- else
-#endif
- res = tmp;
-
- res->size = size;
- res->learned = learned;
-
- res->collect = 0;
-#ifndef NDEBUG
- res->connected = 0;
-#endif
- res->locked = 0;
- res->used = 0;
-#ifdef TRACE
- res->core = 0;
- res->collected = 0;
-#endif
-
- if (learned && size > 2)
- {
- Act * p = CLS2ACT (res);
- *p = ps->cinc;
- }
-
- return res;
-}
-
-static void
-delete_clause (PS * ps, Cls * c)
-{
- size_t bytes;
-#ifdef TRACE
- Trd *trd;
-#endif
-
- bytes = bytes_clause (ps, c->size, c->learned);
-
-#ifdef TRACE
- if (ps->trace)
- {
- trd = CLS2TRD (c);
- delete (ps, trd, bytes);
- }
- else
-#endif
- delete (ps, c, bytes);
-}
-
-static void
-delete_clauses (PS * ps)
-{
- Cls **p;
- for (p = SOC; p != EOC; p = NXC (p))
- if (*p)
- delete_clause (ps, *p);
-
- DELETEN (ps->oclauses, ps->eoo - ps->oclauses);
- DELETEN (ps->lclauses, ps->EOL - ps->lclauses);
-
- ps->ohead = ps->eoo = ps->lhead = ps->EOL = 0;
-}
-
-#ifdef TRACE
-
-static void
-delete_zhain (PS * ps, Zhn * zhain)
-{
- const Znt *p, *znt;
-
- assert (zhain);
-
- znt = zhain->znt;
- for (p = znt; *p; p++)
- ;
-
- delete (ps, zhain, sizeof (Zhn) + (p - znt) + 1);
-}
-
-static void
-delete_zhains (PS * ps)
-{
- Zhn **p, *z;
- for (p = ps->zhains; p < ps->zhead; p++)
- if ((z = *p))
- delete_zhain (ps, z);
-
- DELETEN (ps->zhains, ps->eoz - ps->zhains);
- ps->eoz = ps->zhead = 0;
-}
-
-#endif
-
-#ifdef NO_BINARY_CLAUSES
-static void
-lrelease (PS * ps, Ltk * stk)
-{
- if (stk->start)
- DELETEN (stk->start, (1 << (stk->ldsize)));
- memset (stk, 0, sizeof (*stk));
-}
-#endif
-
-#ifndef NADC
-
-static INLINE unsigned
-llength (Lit ** a)
-{
- Lit ** p;
- for (p = a; *p; p++)
- ;
- return p - a;
-}
-
-static INLINE void
-resetadoconflict (PS * ps)
-{
- assert (ps->adoconflict);
- delete_clause (ps, ps->adoconflict);
- ps->adoconflict = 0;
-}
-
-static INLINE void
-reset_ados (PS * ps)
-{
- Lit *** p;
-
- for (p = ps->ados; p < ps->hados; p++)
- DELETEN (*p, llength (*p) + 1);
-
- DELETEN (ps->ados, ps->eados - ps->ados);
- ps->hados = ps->eados = 0;
-
- DELETEN (ps->adotab, ps->szadotab);
- ps->szadotab = ps->nadotab = 0;
-
- if (ps->adoconflict)
- resetadoconflict (ps);
-
- ps->adoconflicts = 0;
- ps->adoconflictlimit = UINT_MAX;
- ps->adodisabled = 0;
-}
-
-#endif
-
-static void
-reset (PS * ps)
-{
- ABORTIF (!ps ||
- ps->state == RESET, "API usage: reset without initialization");
-
- delete_clauses (ps);
-#ifdef TRACE
- delete_zhains (ps);
-#endif
-#ifdef NO_BINARY_CLAUSES
- {
- unsigned i;
- for (i = 2; i <= 2 * ps->max_var + 1; i++)
- lrelease (ps, ps->impls + i);
- }
-#endif
-#ifndef NADC
- reset_ados (ps);
-#endif
-#ifndef NFL
- DELETEN (ps->saved, ps->saved_size);
-#endif
- DELETEN (ps->htps, 2 * ps->size_vars);
-#ifndef NDSC
- DELETEN (ps->dhtps, 2 * ps->size_vars);
-#endif
- DELETEN (ps->impls, 2 * ps->size_vars);
- DELETEN (ps->lits, 2 * ps->size_vars);
- DELETEN (ps->jwh, 2 * ps->size_vars);
- DELETEN (ps->vars, ps->size_vars);
- DELETEN (ps->rnks, ps->size_vars);
- DELETEN (ps->trail, ps->eot - ps->trail);
- DELETEN (ps->heap, ps->eoh - ps->heap);
- DELETEN (ps->als, ps->eoals - ps->als);
- DELETEN (ps->CLS, ps->eocls - ps->CLS);
- DELETEN (ps->rils, ps->eorils - ps->rils);
- DELETEN (ps->cils, ps->eocils - ps->cils);
- DELETEN (ps->fals, ps->eofals - ps->fals);
- DELETEN (ps->mass, ps->szmass);
- DELETEN (ps->mssass, ps->szmssass);
- DELETEN (ps->mcsass, ps->szmcsass);
- DELETEN (ps->humus, ps->szhumus);
- DELETEN (ps->added, ps->eoa - ps->added);
- DELETEN (ps->marked, ps->eom - ps->marked);
- DELETEN (ps->dfs, ps->eod - ps->dfs);
- DELETEN (ps->resolved, ps->eor - ps->resolved);
- DELETEN (ps->levels, ps->eolevels - ps->levels);
- DELETEN (ps->dused, ps->eodused - ps->dused);
- DELETEN (ps->buffer, ps->eob - ps->buffer);
- DELETEN (ps->indices, ps->eoi - ps->indices);
- DELETEN (ps->soclauses, ps->eoso - ps->soclauses);
- delete_prefix (ps);
- delete (ps, ps->rline[0], ps->szrline);
- delete (ps, ps->rline[1], ps->szrline);
- assert (getenv ("LEAK") || !ps->current_bytes); /* found leak if failing */
-#ifdef VISCORES
- pclose (ps->fviscores);
-#endif
- if (ps->edelete)
- ps->edelete (ps->emgr, ps, sizeof *ps);
- else
- free (ps);
-}
-
-inline static void
-tpush (PS * ps, Lit * lit)
-{
- assert (ps->lits < lit && lit <= ps->lits + 2* ps->max_var + 1);
- if (ps->thead == ps->eot)
- {
- unsigned ttail2count = ps->ttail2 - ps->trail;
- unsigned ttailcount = ps->ttail - ps->trail;
-#ifndef NADC
- unsigned ttailadocount = ps->ttailado - ps->trail;
-#endif
- ENLARGE (ps->trail, ps->thead, ps->eot);
- ps->ttail = ps->trail + ttailcount;
- ps->ttail2 = ps->trail + ttail2count;
-#ifndef NADC
- ps->ttailado = ps->trail + ttailadocount;
-#endif
- }
-
- *ps->thead++ = lit;
-}
-
-static INLINE void
-assign_reason (PS * ps, Var * v, Cls * reason)
-{
-#if defined(NO_BINARY_CLAUSES) && !defined(NDEBUG)
- assert (reason != &ps->impl);
-#else
- (void) ps;
-#endif
- v->reason = reason;
-}
-
-static void
-assign_phase (PS * ps, Lit * lit)
-{
- unsigned new_phase, idx;
- Var * v = LIT2VAR (lit);
-
-#ifndef NFL
- /* In 'simplifying' mode we only need to keep 'min_flipped' up to date if
- * we force assignments on the top level. The other assignments will be
- * undone and thus we can keep the old saved value of the phase.
- */
- if (!ps->LEVEL || !ps->simplifying)
-#endif
- {
- new_phase = (LIT2SGN (lit) > 0);
-
- if (v->assigned)
- {
- ps->sdflips -= ps->sdflips/FFLIPPED;
-
- if (new_phase != v->phase)
- {
- assert (FFLIPPEDPREC >= FFLIPPED);
- ps->sdflips += FFLIPPEDPREC / FFLIPPED;
- ps->flips++;
-
- idx = LIT2IDX (lit);
- if (idx < ps->min_flipped)
- ps->min_flipped = idx;
-
- NOLOG (fprintf (ps->out,
- "%sflipped %d\n",
- ps->prefix, LIT2INT (lit)));
- }
- }
-
- v->phase = new_phase;
- v->assigned = 1;
- }
-
- lit->val = TRUE;
- NOTLIT (lit)->val = FALSE;
-}
-
-inline static void
-assign (PS * ps, Lit * lit, Cls * reason)
-{
- Var * v = LIT2VAR (lit);
- assert (lit->val == UNDEF);
-#ifdef STATS
- ps->assignments++;
-#endif
- v->level = ps->LEVEL;
- assign_phase (ps, lit);
- assign_reason (ps, v, reason);
- tpush (ps, lit);
-}
-
-inline static int
-cmp_added (PS * ps, Lit * k, Lit * l)
-{
- Val a = k->val, b = l->val;
- Var *u, *v;
- int res;
-
- if (a == UNDEF && b != UNDEF)
- return -1;
-
- if (a != UNDEF && b == UNDEF)
- return 1;
-
- u = LIT2VAR (k);
- v = LIT2VAR (l);
-
- if (a != UNDEF)
- {
- assert (b != UNDEF);
- res = v->level - u->level;
- if (res)
- return res; /* larger level first */
- }
-
- res = cmpflt (VAR2RNK (u)->score, VAR2RNK (v)->score);
- if (res)
- return res; /* smaller activity first */
-
- return u - v; /* smaller index first */
-}
-
-static INLINE void
-sorttwolits (Lit ** v)
-{
- Lit * a = v[0], * b = v[1];
-
- assert (a != b);
-
- if (a < b)
- return;
-
- v[0] = b;
- v[1] = a;
-}
-
-inline static void
-sortlits (PS * ps, Lit ** v, unsigned size)
-{
- if (size == 2)
- sorttwolits (v); /* same order with and with out 'NO_BINARY_CLAUSES' */
- else
- SORT (Lit *, cmp_added, v, size);
-}
-
-#ifdef NO_BINARY_CLAUSES
-static INLINE Cls *
-setimpl (PS * ps, Lit * a, Lit * b)
-{
- assert (!ps->implvalid);
- assert (ps->impl.size == 2);
-
- ps->impl.lits[0] = a;
- ps->impl.lits[1] = b;
-
- sorttwolits (ps->impl.lits);
- ps->implvalid = 1;
-
- return &ps->impl;
-}
-
-static INLINE void
-resetimpl (PS * ps)
-{
- ps->implvalid = 0;
-}
-
-static Cls *
-setcimpl (PS * ps, Lit * a, Lit * b)
-{
- assert (!ps->cimplvalid);
- assert (ps->cimpl.size == 2);
-
- ps->cimpl.lits[0] = a;
- ps->cimpl.lits[1] = b;
-
- sorttwolits (ps->cimpl.lits);
- ps->cimplvalid = 1;
-
- return &ps->cimpl;
-}
-
-static INLINE void
-resetcimpl (PS * ps)
-{
- assert (ps->cimplvalid);
- ps->cimplvalid = 0;
-}
-
-#endif
-
-static INLINE int
-cmp_ptr (PS * ps, void *l, void *k)
-{
- (void) ps;
- return ((char*)l) - (char*)k; /* arbitrarily already reverse */
-}
-
-static int
-cmp_rnk (Rnk * r, Rnk * s)
-{
- if (!r->moreimportant && s->moreimportant)
- return -1;
-
- if (r->moreimportant && !s->moreimportant)
- return 1;
-
- if (!r->lessimportant && s->lessimportant)
- return 1;
-
- if (r->lessimportant && !s->lessimportant)
- return -1;
-
- if (r->score < s->score)
- return -1;
-
- if (r->score > s->score)
- return 1;
-
- return -cmp_ptr (0, r, s);
-}
-
-static void
-hup (PS * ps, Rnk * v)
-{
- int upos, vpos;
- Rnk *u;
-
-#ifndef NFL
- assert (!ps->simplifying);
-#endif
-
- vpos = v->pos;
-
- assert (0 < vpos);
- assert (vpos < ps->hhead - ps->heap);
- assert (ps->heap[vpos] == v);
-
- while (vpos > 1)
- {
- upos = vpos / 2;
-
- u = ps->heap[upos];
-
- if (cmp_rnk (u, v) > 0)
- break;
-
- ps->heap[vpos] = u;
- u->pos = vpos;
-
- vpos = upos;
- }
-
- ps->heap[vpos] = v;
- v->pos = vpos;
-}
-
-static Cls *add_simplified_clause (PS *, int);
-
-inline static void
-add_antecedent (PS * ps, Cls * c)
-{
- assert (c);
-
-#ifdef NO_BINARY_CLAUSES
- if (ISLITREASON (c))
- return;
-
- if (c == &ps->impl)
- return;
-#elif defined(STATS) && defined(TRACE)
- ps->antecedents++;
-#endif
- if (ps->rhead == ps->eor)
- ENLARGE (ps->resolved, ps->rhead, ps->eor);
-
- assert (ps->rhead < ps->eor);
- *ps->rhead++ = c;
-}
-
-#ifdef TRACE
-
-#ifdef NO_BINARY_CLAUSES
-#error "can not combine TRACE and NO_BINARY_CLAUSES"
-#endif
-
-#endif /* TRACE */
-
-static INLINE void
-add_lit (PS * ps, Lit * lit)
-{
- assert (lit);
-
- if (ps->ahead == ps->eoa)
- ENLARGE (ps->added, ps->ahead, ps->eoa);
-
- *ps->ahead++ = lit;
-}
-
-static INLINE void
-push_var_as_marked (PS * ps, Var * v)
-{
- if (ps->mhead == ps->eom)
- ENLARGE (ps->marked, ps->mhead, ps->eom);
-
- *ps->mhead++ = v;
-}
-
-static INLINE void
-mark_var (PS * ps, Var * v)
-{
- assert (!v->mark);
- v->mark = 1;
- push_var_as_marked (ps, v);
-}
-
-#ifdef NO_BINARY_CLAUSES
-
-static Cls *
-impl2reason (PS * ps, Lit * lit)
-{
- Lit * other;
- Cls * res;
- other = ps->impl.lits[0];
- if (lit == other)
- other = ps->impl.lits[1];
- assert (other->val == FALSE);
- res = LIT2REASON (NOTLIT (other));
- resetimpl (ps);
- return res;
-}
-
-#endif
-
-/* Whenever we have a top level derived unit we really should derive a unit
- * clause otherwise the resolutions in 'add_simplified_clause' become
- * incorrect.
- */
-static Cls *
-resolve_top_level_unit (PS * ps, Lit * lit, Cls * reason)
-{
- unsigned count_resolved;
- Lit **p, **eol, *other;
- Var *u, *v;
-
- assert (ps->rhead == ps->resolved);
- assert (ps->ahead == ps->added);
-
- add_lit (ps, lit);
- add_antecedent (ps, reason);
- count_resolved = 1;
- v = LIT2VAR (lit);
-
- eol = end_of_lits (reason);
- for (p = reason->lits; p < eol; p++)
- {
- other = *p;
- u = LIT2VAR (other);
- if (u == v)
- continue;
-
- add_antecedent (ps, u->reason);
- count_resolved++;
- }
-
- /* Some of the literals could be assumptions. If at least one
- * variable is not an assumption, we should resolve.
- */
- if (count_resolved >= 2)
- {
-#ifdef NO_BINARY_CLAUSES
- if (reason == &ps->impl)
- resetimpl (ps);
-#endif
- reason = add_simplified_clause (ps, 1);
-#ifdef NO_BINARY_CLAUSES
- if (reason->size == 2)
- {
- assert (reason == &ps->impl);
- reason = impl2reason (ps, lit);
- }
-#endif
- assign_reason (ps, v, reason);
- }
- else
- {
- ps->ahead = ps->added;
- ps->rhead = ps->resolved;
- }
-
- return reason;
-}
-
-static void
-fixvar (PS * ps, Var * v)
-{
- Rnk * r;
-
- assert (VAR2LIT (v) != UNDEF);
- assert (!v->level);
-
- ps->fixed++;
-
- r = VAR2RNK (v);
- r->score = INFFLT;
-
-#ifndef NFL
- if (ps->simplifying)
- return;
-#endif
-
- if (!r->pos)
- return;
-
- hup (ps, r);
-}
-
-static INLINE void
-use_var (PS * ps, Var * v)
-{
- if (v->used)
- return;
-
- v->used = 1;
- ps->vused++;
-}
-
-static void
-assign_forced (PS * ps, Lit * lit, Cls * reason)
-{
- Var *v;
-
- assert (reason);
- assert (lit->val == UNDEF);
-
-#ifdef STATS
- ps->FORCED++;
-#endif
- assign (ps, lit, reason);
-
-#ifdef NO_BINARY_CLAUSES
- assert (reason != &ps->impl);
- if (ISLITREASON (reason))
- {
- reason = setimpl (ps, lit, NOTLIT (REASON2LIT (reason)));
- assert (reason);
- }
-#endif
- LOG ( fprintf (ps->out,
- "%sassign %d at level %d by ",
- ps->prefix, LIT2INT (lit), ps->LEVEL);
- dumpclsnl (ps, reason));
-
- v = LIT2VAR (lit);
- if (!ps->LEVEL)
- use_var (ps, v);
-
- if (!ps->LEVEL && reason->size > 1)
- {
- reason = resolve_top_level_unit (ps, lit, reason);
- assert (reason);
- }
-
-#ifdef NO_BINARY_CLAUSES
- if (ISLITREASON (reason) || reason == &ps->impl)
- {
- /* DO NOTHING */
- }
- else
-#endif
- {
- assert (!reason->locked);
- reason->locked = 1;
- if (reason->learned && reason->size > 2)
- ps->llocked++;
- }
-
-#ifdef NO_BINARY_CLAUSES
- if (reason == &ps->impl)
- resetimpl (ps);
-#endif
-
- if (!ps->LEVEL)
- fixvar (ps, v);
-}
-
-#ifdef NO_BINARY_CLAUSES
-
-static void
-lpush (PS * ps, Lit * lit, Cls * c)
-{
- int pos = (c->lits[0] == lit);
- Ltk * s = LIT2IMPLS (lit);
- unsigned oldsize, newsize;
-
- assert (c->size == 2);
-
- if (!s->start)
- {
- assert (!s->count);
- assert (!s->ldsize);
- NEWN (s->start, 1);
- }
- else
- {
- oldsize = (1 << (s->ldsize));
- assert (s->count <= oldsize);
- if (s->count == oldsize)
- {
- newsize = 2 * oldsize;
- RESIZEN (s->start, oldsize, newsize);
- s->ldsize++;
- }
- }
-
- s->start[s->count++] = c->lits[pos];
-}
-
-#endif
-
-static void
-connect_head_tail (PS * ps, Lit * lit, Cls * c)
-{
- Cls ** s;
- assert (c->size >= 1);
- if (c->size == 2)
- {
-#ifdef NO_BINARY_CLAUSES
- lpush (ps, lit, c);
- return;
-#else
- s = LIT2IMPLS (lit);
-#endif
- }
- else
- s = LIT2HTPS (lit);
-
- if (c->lits[0] != lit)
- {
- assert (c->size >= 2);
- assert (c->lits[1] == lit);
- c->next[1] = *s;
- }
- else
- c->next[0] = *s;
-
- *s = c;
-}
-
-#ifdef TRACE
-static void
-zpush (PS * ps, Zhn * zhain)
-{
- assert (ps->trace);
-
- if (ps->zhead == ps->eoz)
- ENLARGE (ps->zhains, ps->zhead, ps->eoz);
-
- *ps->zhead++ = zhain;
-}
-
-static INLINE int
-cmp_resolved (PS * ps, Cls * c, Cls * d)
-{
-#ifndef NDEBUG
- assert (ps->trace);
-#else
- (void) ps;
-#endif
- return CLS2IDX (c) - CLS2IDX (d);
-}
-
-static INLINE void
-bpushc (PS * ps, unsigned char ch)
-{
- if (ps->bhead == ps->eob)
- ENLARGE (ps->buffer, ps->bhead, ps->eob);
-
- *ps->bhead++ = ch;
-}
-
-static INLINE void
-bpushu (PS * ps, unsigned u)
-{
- while (u & ~0x7f)
- {
- bpushc (ps, u | 0x80);
- u >>= 7;
- }
-
- bpushc (ps, u);
-}
-
-static INLINE void
-bpushd (PS * ps, unsigned prev, unsigned this)
-{
- unsigned delta;
- assert (prev < this);
- delta = this - prev;
- bpushu (ps, delta);
-}
-
-static void
-add_zhain (PS * ps)
-{
- unsigned prev, this, count, rcount;
- Cls **p, *c;
- Zhn *res;
-
- assert (ps->trace);
- assert (ps->bhead == ps->buffer);
- assert (ps->rhead > ps->resolved);
-
- rcount = ps->rhead - ps->resolved;
- SORT (Cls *, cmp_resolved, ps->resolved, rcount);
-
- prev = 0;
- for (p = ps->resolved; p < ps->rhead; p++)
- {
- c = *p;
- this = CLS2TRD (c)->idx;
- bpushd (ps, prev, this);
- prev = this;
- }
- bpushc (ps, 0);
-
- count = ps->bhead - ps->buffer;
-
- res = new (ps, sizeof (Zhn) + count);
- res->core = 0;
- res->ref = 0;
- memcpy (res->znt, ps->buffer, count);
-
- ps->bhead = ps->buffer;
-#ifdef STATS
- ps->znts += count - 1;
-#endif
- zpush (ps, res);
-}
-
-#endif
-
-static void
-add_resolved (PS * ps, int learned)
-{
-#if defined(STATS) || defined(TRACE)
- Cls **p, *c;
-
- for (p = ps->resolved; p < ps->rhead; p++)
- {
- c = *p;
- if (c->used)
- continue;
-
- c->used = 1;
-
- if (c->size <= 2)
- continue;
-
-#ifdef STATS
- if (c->learned)
- ps->llused++;
- else
- ps->loused++;
-#endif
- }
-#endif
-
-#ifdef TRACE
- if (learned && ps->trace)
- add_zhain (ps);
-#else
- (void) learned;
-#endif
- ps->rhead = ps->resolved;
-}
-
-static void
-incjwh (PS * ps, Cls * c)
-{
- Lit **p, *lit, ** eol;
- Flt * f, inc, sum;
- unsigned size = 0;
- Var * v;
- Val val;
-
- eol = end_of_lits (c);
-
- for (p = c->lits; p < eol; p++)
- {
- lit = *p;
- val = lit->val;
-
- if (val && ps->LEVEL > 0)
- {
- v = LIT2VAR (lit);
- if (v->level > 0)
- val = UNDEF;
- }
-
- if (val == TRUE)
- return;
-
- if (val != FALSE)
- size++;
- }
-
- inc = base2flt (1, -size);
-
- for (p = c->lits; p < eol; p++)
- {
- lit = *p;
- f = LIT2JWH (lit);
- sum = addflt (*f, inc);
- *f = sum;
- }
-}
-
-static void
-write_rup_header (PS * ps, FILE * file)
-{
- char line[80];
- int i;
-
- sprintf (line, "%%RUPD32 %u %u", ps->rupvariables, ps->rupclauses);
-
- fputs (line, file);
- for (i = 255 - strlen (line); i >= 0; i--)
- fputc (' ', file);
-
- fputc ('\n', file);
- fflush (file);
-}
-
-static Cls *
-add_simplified_clause (PS * ps, int learned)
-{
- unsigned num_true, num_undef, num_false, size, count_resolved;
- Lit **p, **q, *lit, ** end;
- unsigned litlevel, glue;
- Cls *res, * reason;
- int reentered;
- Val val;
- Var *v;
-#if !defined(NDEBUG) && defined(TRACE)
- unsigned idx;
-#endif
-
- reentered = 0;
-
-REENTER:
-
- size = ps->ahead - ps->added;
-
- add_resolved (ps, learned);
-
- if (learned)
- {
- ps->ladded++;
- ps->llitsadded += size;
- if (size > 2)
- {
- ps->lladded++;
- ps->nlclauses++;
- ps->llits += size;
- }
- }
- else
- {
- ps->oadded++;
- if (size > 2)
- {
- ps->loadded++;
- ps->noclauses++;
- ps->olits += size;
- }
- }
-
- ps->addedclauses++;
- assert (ps->addedclauses == ps->ladded + ps->oadded);
-
-#ifdef NO_BINARY_CLAUSES
- if (size == 2)
- res = setimpl (ps, ps->added[0], ps->added[1]);
- else
-#endif
- {
- sortlits (ps, ps->added, size);
-
- if (learned)
- {
- if (ps->lhead == ps->EOL)
- {
- ENLARGE (ps->lclauses, ps->lhead, ps->EOL);
-
- /* A very difficult to find bug, which only occurs if the
- * learned clauses stack is immediately allocated before the
- * original clauses stack without padding. In this case, we
- * have 'SOC == EOC', which terminates all loops using the
- * idiom 'for (p = SOC; p != EOC; p = NXC(p))' immediately.
- * Unfortunately this occurred in 'fix_clause_lits' after
- * using a recent version of the memory allocator of 'Google'
- * perftools in the context of one large benchmark for
- * our SMT solver 'Boolector'.
- */
- if (ps->EOL == ps->oclauses)
- ENLARGE (ps->lclauses, ps->lhead, ps->EOL);
- }
-
-#if !defined(NDEBUG) && defined(TRACE)
- idx = LIDX2IDX (ps->lhead - ps->lclauses);
-#endif
- }
- else
- {
- if (ps->ohead == ps->eoo)
- {
- ENLARGE (ps->oclauses, ps->ohead, ps->eoo);
- if (ps->EOL == ps->oclauses)
- ENLARGE (ps->oclauses, ps->ohead, ps->eoo); /* ditto */
- }
-
-#if !defined(NDEBUG) && defined(TRACE)
- idx = OIDX2IDX (ps->ohead - ps->oclauses);
-#endif
- }
-
- assert (ps->EOL != ps->oclauses); /* ditto */
-
- res = new_clause (ps, size, learned);
-
- glue = 0;
-
- if (learned)
- {
- assert (ps->dusedhead == ps->dused);
-
- for (p = ps->added; p < ps->ahead; p++)
- {
- lit = *p;
- if (lit->val)
- {
- litlevel = LIT2VAR (lit)->level;
- assert (litlevel <= ps->LEVEL);
- while (ps->levels + litlevel >= ps->levelshead)
- {
- if (ps->levelshead >= ps->eolevels)
- ENLARGE (ps->levels, ps->levelshead, ps->eolevels);
- assert (ps->levelshead < ps->eolevels);
- *ps->levelshead++ = 0;
- }
- if (!ps->levels[litlevel])
- {
- if (ps->dusedhead >= ps->eodused)
- ENLARGE (ps->dused, ps->dusedhead, ps->eodused);
- assert (ps->dusedhead < ps->eodused);
- *ps->dusedhead++ = litlevel;
- ps->levels[litlevel] = 1;
- glue++;
- }
- }
- else
- glue++;
- }
-
- while (ps->dusedhead > ps->dused)
- {
- litlevel = *--ps->dusedhead;
- assert (ps->levels + litlevel < ps->levelshead);
- assert (ps->levels[litlevel]);
- ps->levels[litlevel] = 0;
- }
- }
-
- assert (glue <= MAXGLUE);
- res->glue = glue;
-
-#if !defined(NDEBUG) && defined(TRACE)
- if (ps->trace)
- assert (CLS2IDX (res) == idx);
-#endif
- if (learned)
- *ps->lhead++ = res;
- else
- *ps->ohead++ = res;
-
-#if !defined(NDEBUG) && defined(TRACE)
- if (ps->trace && learned)
- assert (ps->zhead - ps->zhains == ps->lhead - ps->lclauses);
-#endif
- assert (ps->lhead != ps->oclauses); /* ditto */
- }
-
- if (learned && ps->rup)
- {
- if (!ps->rupstarted)
- {
- write_rup_header (ps, ps->rup);
- ps->rupstarted = 1;
- }
- }
-
- num_true = num_undef = num_false = 0;
-
- q = res->lits;
- for (p = ps->added; p < ps->ahead; p++)
- {
- lit = *p;
- *q++ = lit;
-
- if (learned && ps->rup)
- fprintf (ps->rup, "%d ", LIT2INT (lit));
-
- val = lit->val;
-
- num_true += (val == TRUE);
- num_undef += (val == UNDEF);
- num_false += (val == FALSE);
- }
- assert (num_false + num_true + num_undef == size);
-
- if (learned && ps->rup)
- fputs ("0\n", ps->rup);
-
- ps->ahead = ps->added; /* reset */
-
- if (!reentered) // TODO merge
- if (size > 0)
- {
- assert (size <= 2 || !reentered); // TODO remove
- connect_head_tail (ps, res->lits[0], res);
- if (size > 1)
- connect_head_tail (ps, res->lits[1], res);
- }
-
- if (size == 0)
- {
- if (!ps->mtcls)
- ps->mtcls = res;
- }
-
-#ifdef NO_BINARY_CLAUSES
- if (size != 2)
-#endif
-#ifndef NDEBUG
- res->connected = 1;
-#endif
-
- LOG ( fprintf (ps->out, "%s%s ", ps->prefix, learned ? "learned" : "original");
- dumpclsnl (ps, res));
-
- /* Shrink clause by resolving it against top level assignments.
- */
- if (!ps->LEVEL && num_false > 0)
- {
- assert (ps->ahead == ps->added);
- assert (ps->rhead == ps->resolved);
-
- count_resolved = 1;
- add_antecedent (ps, res);
-
- end = end_of_lits (res);
- for (p = res->lits; p < end; p++)
- {
- lit = *p;
- v = LIT2VAR (lit);
- use_var (ps, v);
-
- if (lit->val == FALSE)
- {
- add_antecedent (ps, v->reason);
- count_resolved++;
- }
- else
- add_lit (ps, lit);
- }
-
- assert (count_resolved >= 2);
-
- learned = 1;
-#ifdef NO_BINARY_CLAUSES
- if (res == &ps->impl)
- resetimpl (ps);
-#endif
- reentered = 1;
- goto REENTER; /* and return simplified clause */
- }
-
- if (!num_true && num_undef == 1) /* unit clause */
- {
- lit = 0;
- for (p = res->lits; p < res->lits + size; p++)
- {
- if ((*p)->val == UNDEF)
- lit = *p;
-
- v = LIT2VAR (*p);
- use_var (ps, v);
- }
- assert (lit);
-
- reason = res;
-#ifdef NO_BINARY_CLAUSES
- if (size == 2)
- {
- Lit * other = res->lits[0];
- if (other == lit)
- other = res->lits[1];
-
- assert (other->val == FALSE);
- reason = LIT2REASON (NOTLIT (other));
- }
-#endif
- assign_forced (ps, lit, reason);
- num_true++;
- }
-
- if (num_false == size && !ps->conflict)
- {
-#ifdef NO_BINARY_CLAUSES
- if (res == &ps->impl)
- ps->conflict = setcimpl (ps, res->lits[0], res->lits[1]);
- else
-#endif
- ps->conflict = res;
- }
-
- if (!learned && !num_true && num_undef)
- incjwh (ps, res);
-
-#ifdef NO_BINARY_CLAUSES
- if (res == &ps->impl)
- resetimpl (ps);
-#endif
- return res;
-}
-
-static int
-trivial_clause (PS * ps)
-{
- Lit **p, **q, *prev;
- Var *v;
-
- SORT (Lit *, cmp_ptr, ps->added, ps->ahead - ps->added);
-
- prev = 0;
- q = ps->added;
- for (p = q; p < ps->ahead; p++)
- {
- Lit *this = *p;
-
- v = LIT2VAR (this);
-
- if (prev == this) /* skip repeated literals */
- continue;
-
- /* Top level satisfied ?
- */
- if (this->val == TRUE && !v->level)
- return 1;
-
- if (prev == NOTLIT (this))/* found pair of dual literals */
- return 1;
-
- *q++ = prev = this;
- }
-
- ps->ahead = q; /* shrink */
-
- return 0;
-}
-
-static void
-simplify_and_add_original_clause (PS * ps)
-{
-#ifdef NO_BINARY_CLAUSES
- Cls * c;
-#endif
- if (trivial_clause (ps))
- {
- ps->ahead = ps->added;
-
- if (ps->ohead == ps->eoo)
- ENLARGE (ps->oclauses, ps->ohead, ps->eoo);
-
- *ps->ohead++ = 0;
-
- ps->addedclauses++;
- ps->oadded++;
- }
- else
- {
- if (ps->CLS != ps->clshead)
- add_lit (ps, NOTLIT (ps->clshead[-1]));
-
-#ifdef NO_BINARY_CLAUSES
- c =
-#endif
- add_simplified_clause (ps, 0);
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl) assert (!ps->implvalid);
-#endif
- }
-}
-
-#ifndef NADC
-
-static void
-add_ado (PS * ps)
-{
- unsigned len = ps->ahead - ps->added;
- Lit ** ado, ** p, ** q, *lit;
- Var * v, * u;
-
-#ifdef TRACE
- assert (!ps->trace);
-#endif
-
- ABORTIF (ps->ados < ps->hados && llength (ps->ados[0]) != len,
- "internal: non matching all different constraint object lengths");
-
- if (ps->hados == ps->eados)
- ENLARGE (ps->ados, ps->hados, ps->eados);
-
- NEWN (ado, len + 1);
- *ps->hados++ = ado;
-
- p = ps->added;
- q = ado;
- u = 0;
- while (p < ps->ahead)
- {
- lit = *p++;
- v = LIT2VAR (lit);
- ABORTIF (v->inado,
- "internal: variable in multiple all different objects");
- v->inado = ado;
- if (!u && !lit->val)
- u = v;
- *q++ = lit;
- }
-
- assert (q == ado + len);
- *q++ = 0;
-
- /* TODO simply do a conflict test as in propado */
-
- ABORTIF (!u,
- "internal: "
- "adding fully instantiated all different object not implemented yet");
-
- assert (u);
- assert (u->inado == ado);
- assert (!u->ado);
- u->ado = ado;
-
- ps->ahead = ps->added;
-}
-
-#endif
-
-static void
-hdown (PS * ps, Rnk * r)
-{
- unsigned end, rpos, cpos, opos;
- Rnk *child, *other;
-
- assert (r->pos > 0);
- assert (ps->heap[r->pos] == r);
-
- end = ps->hhead - ps->heap;
- rpos = r->pos;
-
- for (;;)
- {
- cpos = 2 * rpos;
- if (cpos >= end)
- break;
-
- opos = cpos + 1;
- child = ps->heap[cpos];
-
- if (cmp_rnk (r, child) < 0)
- {
- if (opos < end)
- {
- other = ps->heap[opos];
-
- if (cmp_rnk (child, other) < 0)
- {
- child = other;
- cpos = opos;
- }
- }
- }
- else if (opos < end)
- {
- child = ps->heap[opos];
-
- if (cmp_rnk (r, child) >= 0)
- break;
-
- cpos = opos;
- }
- else
- break;
-
- ps->heap[rpos] = child;
- child->pos = rpos;
- rpos = cpos;
- }
-
- r->pos = rpos;
- ps->heap[rpos] = r;
-}
-
-static Rnk *
-htop (PS * ps)
-{
- assert (ps->hhead > ps->heap + 1);
- return ps->heap[1];
-}
-
-static Rnk *
-hpop (PS * ps)
-{
- Rnk *res, *last;
- unsigned end;
-
- assert (ps->hhead > ps->heap + 1);
-
- res = ps->heap[1];
- res->pos = 0;
-
- end = --ps->hhead - ps->heap;
- if (end == 1)
- return res;
-
- last = ps->heap[end];
-
- ps->heap[last->pos = 1] = last;
- hdown (ps, last);
-
- return res;
-}
-
-inline static void
-hpush (PS * ps, Rnk * r)
-{
- assert (!r->pos);
-
- if (ps->hhead == ps->eoh)
- ENLARGE (ps->heap, ps->hhead, ps->eoh);
-
- r->pos = ps->hhead++ - ps->heap;
- ps->heap[r->pos] = r;
- hup (ps, r);
-}
-
-static INLINE void
-fix_trail_lits (PS * ps, long delta)
-{
- Lit **p;
- for (p = ps->trail; p < ps->thead; p++)
- *p += delta;
-}
-
-#ifdef NO_BINARY_CLAUSES
-static void
-fix_impl_lits (PS * ps, long delta)
-{
- Ltk * s;
- Lit ** p;
-
- for (s = ps->impls + 2; s <= ps->impls + 2 * ps->max_var + 1; s++)
- for (p = s->start; p < s->start + s->count; p++)
- *p += delta;
-}
-#endif
-
-static void
-fix_clause_lits (PS * ps, long delta)
-{
- Cls **p, *clause;
- Lit **q, *lit, **eol;
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- clause = *p;
- if (!clause)
- continue;
-
- q = clause->lits;
- eol = end_of_lits (clause);
- while (q < eol)
- {
- assert (q - clause->lits <= (int) clause->size);
- lit = *q;
- lit += delta;
- *q++ = lit;
- }
- }
-}
-
-static INLINE void
-fix_added_lits (PS * ps, long delta)
-{
- Lit **p;
- for (p = ps->added; p < ps->ahead; p++)
- *p += delta;
-}
-
-static INLINE void
-fix_assumed_lits (PS * ps, long delta)
-{
- Lit **p;
- for (p = ps->als; p < ps->alshead; p++)
- *p += delta;
-}
-
-static INLINE void
-fix_cls_lits (PS * ps, long delta)
-{
- Lit **p;
- for (p = ps->CLS; p < ps->clshead; p++)
- *p += delta;
-}
-
-static INLINE void
-fix_heap_rnks (PS * ps, long delta)
-{
- Rnk **p;
-
- for (p = ps->heap + 1; p < ps->hhead; p++)
- *p += delta;
-}
-
-#ifndef NADC
-
-static INLINE void
-fix_ado (long delta, Lit ** ado)
-{
- Lit ** p;
- for (p = ado; *p; p++)
- *p += delta;
-}
-
-static INLINE void
-fix_ados (PS * ps, long delta)
-{
- Lit *** p;
-
- for (p = ps->ados; p < ps->hados; p++)
- fix_ado (delta, *p);
-}
-
-#endif
-
-static void
-enlarge (PS * ps, unsigned new_size_vars)
-{
- long rnks_delta, lits_delta;
- Lit *old_lits = ps->lits;
- Rnk *old_rnks = ps->rnks;
-
- RESIZEN (ps->lits, 2 * ps->size_vars, 2 * new_size_vars);
- RESIZEN (ps->jwh, 2 * ps->size_vars, 2 * new_size_vars);
- RESIZEN (ps->htps, 2 * ps->size_vars, 2 * new_size_vars);
-#ifndef NDSC
- RESIZEN (ps->dhtps, 2 * ps->size_vars, 2 * new_size_vars);
-#endif
- RESIZEN (ps->impls, 2 * ps->size_vars, 2 * new_size_vars);
- RESIZEN (ps->vars, ps->size_vars, new_size_vars);
- RESIZEN (ps->rnks, ps->size_vars, new_size_vars);
-
- if ((lits_delta = ps->lits - old_lits))
- {
- fix_trail_lits (ps, lits_delta);
- fix_clause_lits (ps, lits_delta);
- fix_added_lits (ps, lits_delta);
- fix_assumed_lits (ps, lits_delta);
- fix_cls_lits (ps, lits_delta);
-#ifdef NO_BINARY_CLAUSES
- fix_impl_lits (ps, lits_delta);
-#endif
-#ifndef NADC
- fix_ados (ps, lits_delta);
-#endif
- }
-
- if ((rnks_delta = ps->rnks - old_rnks))
- {
- fix_heap_rnks (ps, rnks_delta);
- }
-
- assert (ps->mhead == ps->marked);
-
- ps->size_vars = new_size_vars;
-}
-
-static void
-unassign (PS * ps, Lit * lit)
-{
- Cls *reason;
- Var *v;
- Rnk *r;
-
- assert (lit->val == TRUE);
-
- LOG ( fprintf (ps->out, "%sunassign %d\n", ps->prefix, LIT2INT (lit)));
-
- v = LIT2VAR (lit);
- reason = v->reason;
-
-#ifdef NO_BINARY_CLAUSES
- assert (reason != &ps->impl);
- if (ISLITREASON (reason))
- {
- /* DO NOTHING */
- }
- else
-#endif
- if (reason)
- {
- assert (reason->locked);
- reason->locked = 0;
- if (reason->learned && reason->size > 2)
- {
- assert (ps->llocked > 0);
- ps->llocked--;
- }
- }
-
- lit->val = UNDEF;
- NOTLIT (lit)->val = UNDEF;
-
- r = VAR2RNK (v);
- if (!r->pos)
- hpush (ps, r);
-
-#ifndef NDSC
- {
- Cls * p, * next, ** q;
-
- q = LIT2DHTPS (lit);
- p = *q;
- *q = 0;
-
- while (p)
- {
- Lit * other = p->lits[0];
-
- if (other == lit)
- {
- other = p->lits[1];
- q = p->next + 1;
- }
- else
- {
- assert (p->lits[1] == lit);
- q = p->next;
- }
-
- next = *q;
- *q = *LIT2HTPS (other);
- *LIT2HTPS (other) = p;
- p = next;
- }
- }
-#endif
-
-#ifndef NADC
- if (v->adotabpos)
- {
- assert (ps->nadotab);
- assert (*v->adotabpos == v->ado);
-
- *v->adotabpos = 0;
- v->adotabpos = 0;
-
- ps->nadotab--;
- }
-#endif
-}
-
-static Cls *
-var2reason (PS * ps, Var * var)
-{
- Cls * res = var->reason;
-#ifdef NO_BINARY_CLAUSES
- Lit * this, * other;
- if (ISLITREASON (res))
- {
- this = VAR2LIT (var);
- if (this->val == FALSE)
- this = NOTLIT (this);
-
- other = REASON2LIT (res);
- assert (other->val == TRUE);
- assert (this->val == TRUE);
- res = setimpl (ps, NOTLIT (other), this);
- }
-#else
- (void) ps;
-#endif
- return res;
-}
-
-static INLINE void
-mark_clause_to_be_collected (Cls * c)
-{
- assert (!c->collect);
- c->collect = 1;
-}
-
-static void
-undo (PS * ps, unsigned new_level)
-{
- Lit *lit;
- Var *v;
-
- while (ps->thead > ps->trail)
- {
- lit = *--ps->thead;
- v = LIT2VAR (lit);
- if (v->level == new_level)
- {
- ps->thead++; /* fix pre decrement */
- break;
- }
-
- unassign (ps, lit);
- }
-
- ps->LEVEL = new_level;
- ps->ttail = ps->thead;
- ps->ttail2 = ps->thead;
-#ifndef NADC
- ps->ttailado = ps->thead;
-#endif
-
-#ifdef NO_BINARY_CLAUSES
- if (ps->conflict == &ps->cimpl)
- resetcimpl (ps);
-#endif
-#ifndef NADC
- if (ps->conflict && ps->conflict == ps->adoconflict)
- resetadoconflict (ps);
-#endif
- ps->conflict = ps->mtcls;
- if (ps->LEVEL < ps->adecidelevel)
- {
- assert (ps->als < ps->alshead);
- ps->adecidelevel = 0;
- ps->alstail = ps->als;
- }
- LOG ( fprintf (ps->out, "%sback to level %u\n", ps->prefix, ps->LEVEL));
-}
-
-#ifndef NDEBUG
-
-static int
-clause_satisfied (Cls * c)
-{
- Lit **p, **eol, *lit;
-
- eol = end_of_lits (c);
- for (p = c->lits; p < eol; p++)
- {
- lit = *p;
- if (lit->val == TRUE)
- return 1;
- }
-
- return 0;
-}
-
-static void
-original_clauses_satisfied (PS * ps)
-{
- Cls **p, *c;
-
- for (p = ps->oclauses; p < ps->ohead; p++)
- {
- c = *p;
-
- if (!c)
- continue;
-
- if (c->learned)
- continue;
-
- assert (clause_satisfied (c));
- }
-}
-
-static void
-assumptions_satisfied (PS * ps)
-{
- Lit *lit, ** p;
-
- for (p = ps->als; p < ps->alshead; p++)
- {
- lit = *p;
- assert (lit->val == TRUE);
- }
-}
-
-#endif
-
-static void
-sflush (PS * ps)
-{
-#ifdef HAS_FLOAT
- double now = picosat_time_stamp ();
- double delta = now - ps->entered;
- delta = (delta < 0) ? 0 : delta;
- ps->seconds += delta;
- ps->entered = now;
-#endif
-}
-
-static double
-mb (PS * ps)
-{
- return ps->current_bytes / (double) (1 << 20);
-}
-
-static INLINE double
-avglevel (PS * ps)
-{
- return ps->decisions ? ps->levelsum / ps->decisions : 0.0;
-}
-
-static void
-rheader (PS * ps)
-{
- assert (ps->lastrheader <= ps->reports);
-
- if (ps->lastrheader == ps->reports)
- return;
-
- ps->lastrheader = ps->reports;
-
- fprintf (ps->out, "%s\n", ps->prefix);
- fprintf (ps->out, "%s %s\n", ps->prefix, ps->rline[0]);
- fprintf (ps->out, "%s %s\n", ps->prefix, ps->rline[1]);
- fprintf (ps->out, "%s\n", ps->prefix);
-}
-
-static unsigned
-dynamic_flips_per_assignment_per_mille (PS * ps)
-{
- assert (FFLIPPEDPREC >= 1000);
- return ps->sdflips / (FFLIPPEDPREC / 1000);
-}
-
-#ifdef NLUBY
-
-static int
-high_agility (PS * ps)
-{
- return dynamic_flips_per_assignment_per_mille (ps) >= 200;
-}
-
-static int
-very_high_agility (PS * ps)
-{
- return dynamic_flips_per_assignment_per_mille (ps) >= 250;
-}
-
-#else
-
-static int
-medium_agility (PS * ps)
-{
- return dynamic_flips_per_assignment_per_mille (ps) >= 230;
-}
-
-#endif
-
-static void
-relemdata (PS * ps)
-{
- char *p;
- int x;
-
- if (ps->reports < 0)
- {
- /* strip trailing white space
- */
- for (x = 0; x <= 1; x++)
- {
- p = ps->rline[x] + strlen (ps->rline[x]);
- while (p-- > ps->rline[x])
- {
- if (*p != ' ')
- break;
-
- *p = 0;
- }
- }
-
- rheader (ps);
- }
- else
- fputc ('\n', ps->out);
-
- ps->RCOUNT = 0;
-}
-
-static void
-relemhead (PS * ps, const char * name, int fp, double val)
-{
- int x, y, len, size;
- const char *fmt;
- unsigned tmp, e;
-
- if (ps->reports < 0)
- {
- x = ps->RCOUNT & 1;
- y = (ps->RCOUNT / 2) * 12 + x * 6;
-
- if (ps->RCOUNT == 1)
- sprintf (ps->rline[1], "%6s", "");
-
- len = strlen (name);
- while (ps->szrline <= len + y + 1)
- {
- size = ps->szrline ? 2 * ps->szrline : 128;
- ps->rline[0] = resize (ps, ps->rline[0], ps->szrline, size);
- ps->rline[1] = resize (ps, ps->rline[1], ps->szrline, size);
- ps->szrline = size;
- }
-
- fmt = (len <= 6) ? "%6s%10s" : "%-10s%4s";
- sprintf (ps->rline[x] + y, fmt, name, "");
- }
- else if (val < 0)
- {
- assert (fp);
-
- if (val > -100 && (tmp = val * 10.0 - 0.5) > -1000.0)
- {
- fprintf (ps->out, "-%4.1f ", -tmp / 10.0);
- }
- else
- {
- tmp = -val / 10.0 + 0.5;
- e = 1;
- while (tmp >= 100)
- {
- tmp /= 10;
- e++;
- }
-
- fprintf (ps->out, "-%2ue%u ", tmp, e);
- }
- }
- else
- {
- if (fp && val < 1000 && (tmp = val * 10.0 + 0.5) < 10000)
- {
- fprintf (ps->out, "%5.1f ", tmp / 10.0);
- }
- else if (!fp && (tmp = val) < 100000)
- {
- fprintf (ps->out, "%5u ", tmp);
- }
- else
- {
- tmp = val / 10.0 + 0.5;
- e = 1;
-
- while (tmp >= 1000)
- {
- tmp /= 10;
- e++;
- }
-
- fprintf (ps->out, "%3ue%u ", tmp, e);
- }
- }
-
- ps->RCOUNT++;
-}
-
-inline static void
-relem (PS * ps, const char *name, int fp, double val)
-{
- if (name)
- relemhead (ps, name, fp, val);
- else
- relemdata (ps);
-}
-
-static unsigned
-reduce_limit_on_lclauses (PS * ps)
-{
- unsigned res = ps->lreduce;
- res += ps->llocked;
- return res;
-}
-
-static void
-report (PS * ps, int replevel, char type)
-{
- int rounds;
-
-#ifdef RCODE
- (void) type;
-#endif
-
- if (ps->verbosity < replevel)
- return;
-
- sflush (ps);
-
- if (!ps->reports)
- ps->reports = -1;
-
- for (rounds = (ps->reports < 0) ? 2 : 1; rounds; rounds--)
- {
- if (ps->reports >= 0)
- fprintf (ps->out, "%s%c ", ps->prefix, type);
-#ifdef DMONNIAUX_DISABLE
-
- relem (ps, "seconds", 1, ps->seconds);
- relem (ps, "level", 1, avglevel (ps));
- assert (ps->fixed <= ps->max_var);
- relem (ps, "variables", 0, ps->max_var - ps->fixed);
- relem (ps, "used", 1, PERCENT (ps->vused, ps->max_var));
- relem (ps, "original", 0, ps->noclauses);
- relem (ps, "conflicts", 0, ps->conflicts);
- // relem (ps, "decisions", 0, ps->decisions);
- // relem (ps, "conf/dec", 1, PERCENT(ps->conflicts,ps->decisions));
- // relem (ps, "limit", 0, reduce_limit_on_lclauses (ps));
- relem (ps, "learned", 0, ps->nlclauses);
- // relem (ps, "limit", 1, PERCENT (ps->nlclauses, reduce_limit_on_lclauses (ps)));
- relem (ps, "limit", 0, ps->lreduce);
-#ifdef STATS
- relem (ps, "learning", 1, PERCENT (ps->llused, ps->lladded));
-#endif
- relem (ps, "agility", 1, dynamic_flips_per_assignment_per_mille (ps) / 10.0);
- // relem (ps, "original", 0, ps->noclauses);
- relem (ps, "MB", 1, mb (ps));
- // relem (ps, "lladded", 0, ps->lladded);
- // relem (ps, "llused", 0, ps->llused);
-
- relem (ps, 0, 0, 0);
-#endif
-
- ps->reports++;
- }
-
- /* Adapt this to the number of rows in your terminal.
- */
- #define ROWS 25
-
- if (INT_MOD(ps->reports, (ROWS - 3)) == (ROWS - 4))
- rheader (ps);
-
- fflush (ps->out);
-}
-
-static int
-bcp_queue_is_empty (PS * ps)
-{
- if (ps->ttail != ps->thead)
- return 0;
-
- if (ps->ttail2 != ps->thead)
- return 0;
-
-#ifndef NADC
- if (ps->ttailado != ps->thead)
- return 0;
-#endif
-
- return 1;
-}
-
-static int
-satisfied (PS * ps)
-{
- assert (!ps->mtcls);
- assert (!ps->failed_assumption);
- if (ps->alstail < ps->alshead)
- return 0;
- assert (!ps->conflict);
- assert (bcp_queue_is_empty (ps));
- return ps->thead == ps->trail + ps->max_var; /* all assigned */
-}
-
-static void
-vrescore (PS * ps)
-{
- Rnk *p, *eor = ps->rnks + ps->max_var;
- for (p = ps->rnks + 1; p <= eor; p++)
- if (p->score != INFFLT)
- p->score = mulflt (p->score, ps->ilvinc);
- ps->vinc = mulflt (ps->vinc, ps->ilvinc);;
-#ifdef VISCORES
- ps->nvinc = mulflt (ps->nvinc, ps->lscore);;
-#endif
-}
-
-static void
-inc_score (PS * ps, Var * v)
-{
- Flt score;
- Rnk *r;
-
-#ifndef NFL
- if (ps->simplifying)
- return;
-#endif
-
- if (!v->level)
- return;
-
- if (v->internal)
- return;
-
- r = VAR2RNK (v);
- score = r->score;
-
- assert (score != INFFLT);
-
- score = addflt (score, ps->vinc);
- assert (score < INFFLT);
- r->score = score;
- if (r->pos > 0)
- hup (ps, r);
-
- if (score > ps->lscore)
- vrescore (ps);
-}
-
-static void
-inc_activity (PS * ps, Cls * c)
-{
- Act *p;
-
- if (!c->learned)
- return;
-
- if (c->size <= 2)
- return;
-
- p = CLS2ACT (c);
- *p = addflt (*p, ps->cinc);
-}
-
-static INLINE unsigned
-hashlevel (unsigned l)
-{
- return 1u << (l & 31);
-}
-
-static INLINE void
-push (PS * ps, Var * v)
-{
- if (ps->dhead == ps->eod)
- ENLARGE (ps->dfs, ps->dhead, ps->eod);
-
- *ps->dhead++ = v;
-}
-
-static INLINE Var *
-pop (PS * ps)
-{
- assert (ps->dfs < ps->dhead);
- return *--ps->dhead;
-}
-
-static void
-analyze (PS * ps)
-{
- unsigned open, minlevel, siglevels, l, old, i, orig;
- Lit *this, *other, **p, **q, **eol;
- Var *v, *u, **m, *start, *uip;
- Cls *c;
-
- assert (ps->conflict);
-
- assert (ps->ahead == ps->added);
- assert (ps->mhead == ps->marked);
- assert (ps->rhead == ps->resolved);
-
- /* First, search for First UIP variable and mark all resolved variables.
- * At the same time determine the minimum decision level involved.
- * Increase activities of resolved variables.
- */
- q = ps->thead;
- open = 0;
- minlevel = ps->LEVEL;
- siglevels = 0;
- uip = 0;
-
- c = ps->conflict;
-
- for (;;)
- {
- add_antecedent (ps, c);
- inc_activity (ps, c);
- eol = end_of_lits (c);
- for (p = c->lits; p < eol; p++)
- {
- other = *p;
-
- if (other->val == TRUE)
- continue;
-
- assert (other->val == FALSE);
-
- u = LIT2VAR (other);
- if (u->mark)
- continue;
-
- u->mark = 1;
- inc_score (ps, u);
- use_var (ps, u);
-
- if (u->level == ps->LEVEL)
- {
- open++;
- }
- else
- {
- push_var_as_marked (ps, u);
-
- if (u->level)
- {
- /* The statistics counter 'nonminimizedllits' sums up the
- * number of literals that would be added if only the
- * 'first UIP' scheme for learned clauses would be used
- * and no clause minimization.
- */
- ps->nonminimizedllits++;
-
- if (u->level < minlevel)
- minlevel = u->level;
-
- siglevels |= hashlevel (u->level);
- }
- else
- {
- assert (!u->level);
- assert (u->reason);
- }
- }
- }
-
- do
- {
- if (q == ps->trail)
- {
- uip = 0;
- goto DONE_FIRST_UIP;
- }
-
- this = *--q;
- uip = LIT2VAR (this);
- }
- while (!uip->mark);
-
- uip->mark = 0;
-
- c = var2reason (ps, uip);
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- resetimpl (ps);
-#endif
- open--;
- if ((!open && ps->LEVEL) || !c)
- break;
-
- assert (c);
- }
-
-DONE_FIRST_UIP:
-
- if (uip)
- {
- assert (ps->LEVEL);
- this = VAR2LIT (uip);
- this += (this->val == TRUE);
- ps->nonminimizedllits++;
- ps->minimizedllits++;
- add_lit (ps, this);
-#ifdef STATS
- if (uip->reason)
- ps->uips++;
-#endif
- }
- else
- assert (!ps->LEVEL);
-
- /* Second, try to mark more intermediate variables, with the goal to
- * minimize the conflict clause. This is a DFS from already marked
- * variables backward through the implication graph. It tries to reach
- * other marked variables. If the search reaches an unmarked decision
- * variable or a variable assigned below the minimum level of variables in
- * the first uip learned clause or a level on which no variable has been
- * marked, then the variable from which the DFS is started is not
- * redundant. Otherwise the start variable is redundant and will
- * eventually be removed from the learned clause in step 4. We initially
- * implemented BFS, but then profiling revelead that this step is a bottle
- * neck for certain incremental applications. After switching to DFS this
- * hot spot went away.
- */
- orig = ps->mhead - ps->marked;
- for (i = 0; i < orig; i++)
- {
- start = ps->marked[i];
-
- assert (start->mark);
- assert (start != uip);
- assert (start->level < ps->LEVEL);
-
- if (!start->reason)
- continue;
-
- old = ps->mhead - ps->marked;
- assert (ps->dhead == ps->dfs);
- push (ps, start);
-
- while (ps->dhead > ps->dfs)
- {
- u = pop (ps);
- assert (u->mark);
-
- c = var2reason (ps, u);
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- resetimpl (ps);
-#endif
- if (!c ||
- ((l = u->level) &&
- (l < minlevel || ((hashlevel (l) & ~siglevels)))))
- {
- while (ps->mhead > ps->marked + old) /* reset all marked */
- (*--ps->mhead)->mark = 0;
-
- ps->dhead = ps->dfs; /* and DFS stack */
- break;
- }
-
- eol = end_of_lits (c);
- for (p = c->lits; p < eol; p++)
- {
- v = LIT2VAR (*p);
- if (v->mark)
- continue;
-
- mark_var (ps, v);
- push (ps, v);
- }
- }
- }
-
- for (m = ps->marked; m < ps->mhead; m++)
- {
- v = *m;
-
- assert (v->mark);
- assert (!v->resolved);
-
- use_var (ps, v);
-
- c = var2reason (ps, v);
- if (!c)
- continue;
-
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- resetimpl (ps);
-#endif
- eol = end_of_lits (c);
- for (p = c->lits; p < eol; p++)
- {
- other = *p;
-
- u = LIT2VAR (other);
- if (!u->level)
- continue;
-
- if (!u->mark) /* 'MARKTEST' */
- break;
- }
-
- if (p != eol)
- continue;
-
- add_antecedent (ps, c);
- v->resolved = 1;
- }
-
- for (m = ps->marked; m < ps->mhead; m++)
- {
- v = *m;
-
- assert (v->mark);
- v->mark = 0;
-
- if (v->resolved)
- {
- v->resolved = 0;
- continue;
- }
-
- this = VAR2LIT (v);
- if (this->val == TRUE)
- this++; /* actually NOTLIT */
-
- add_lit (ps, this);
- ps->minimizedllits++;
- }
-
- assert (ps->ahead <= ps->eoa);
- assert (ps->rhead <= ps->eor);
-
- ps->mhead = ps->marked;
-}
-
-static void
-fanalyze (PS * ps)
-{
- Lit ** eol, ** p, * lit;
- Cls * c, * reason;
- Var * v, * u;
- int next;
-
-#ifndef RCODE
- double start = picosat_time_stamp ();
-#endif
-
- assert (ps->failed_assumption);
- assert (ps->failed_assumption->val == FALSE);
-
- v = LIT2VAR (ps->failed_assumption);
- reason = var2reason (ps, v);
- if (!reason) return;
-#ifdef NO_BINARY_CLAUSES
- if (reason == &ps->impl)
- resetimpl (ps);
-#endif
-
- eol = end_of_lits (reason);
- for (p = reason->lits; p != eol; p++)
- {
- lit = *p;
- u = LIT2VAR (lit);
- if (u == v) continue;
- if (u->reason) break;
- }
- if (p == eol) return;
-
- assert (ps->ahead == ps->added);
- assert (ps->mhead == ps->marked);
- assert (ps->rhead == ps->resolved);
-
- next = 0;
- mark_var (ps, v);
- add_lit (ps, NOTLIT (ps->failed_assumption));
-
- do
- {
- v = ps->marked[next++];
- use_var (ps, v);
- if (v->reason)
- {
- reason = var2reason (ps, v);
-#ifdef NO_BINARY_CLAUSES
- if (reason == &ps->impl)
- resetimpl (ps);
-#endif
- add_antecedent (ps, reason);
- eol = end_of_lits (reason);
- for (p = reason->lits; p != eol; p++)
- {
- lit = *p;
- u = LIT2VAR (lit);
- if (u == v) continue;
- if (u->mark) continue;
- mark_var (ps, u);
- }
- }
- else
- {
- lit = VAR2LIT (v);
- if (lit->val == TRUE) lit = NOTLIT (lit);
- add_lit (ps, lit);
- }
- }
- while (ps->marked + next < ps->mhead);
-
- c = add_simplified_clause (ps, 1);
- v = LIT2VAR (ps->failed_assumption);
- reason = v->reason;
-#ifdef NO_BINARY_CLAUSES
- if (!ISLITREASON (reason))
-#endif
- {
- assert (reason->locked);
- reason->locked = 0;
- if (reason->learned && reason->size > 2)
- {
- assert (ps->llocked > 0);
- ps->llocked--;
- }
- }
-
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- {
- c = impl2reason (ps, NOTLIT (ps->failed_assumption));
- }
- else
-#endif
- {
- assert (c->learned);
- assert (!c->locked);
- c->locked = 1;
- if (c->size > 2)
- {
- ps->llocked++;
- assert (ps->llocked > 0);
- }
- }
-
- v->reason = c;
-
- while (ps->mhead > ps->marked)
- (*--ps->mhead)->mark = 0;
-
- if (ps->verbosity)
- fprintf (ps->out, "%sfanalyze took %.1f seconds\n",
- ps->prefix, picosat_time_stamp () - start);
-}
-
-/* Propagate assignment of 'this' to 'FALSE' by visiting all binary clauses in
- * which 'this' occurs.
- */
-inline static void
-prop2 (PS * ps, Lit * this)
-{
-#ifdef NO_BINARY_CLAUSES
- Lit ** l, ** start;
- Ltk * lstk;
-#else
- Cls * c, ** p;
- Cls * next;
-#endif
- Lit * other;
- Val tmp;
-
- assert (this->val == FALSE);
-
-#ifdef NO_BINARY_CLAUSES
- lstk = LIT2IMPLS (this);
- start = lstk->start;
- l = start + lstk->count;
- while (l != start)
- {
- /* The counter 'visits' is the number of clauses that are
- * visited during propagations of assignments.
- */
- ps->visits++;
-#ifdef STATS
- ps->bvisits++;
-#endif
- other = *--l;
- tmp = other->val;
-
- if (tmp == TRUE)
- {
-#ifdef STATS
- ps->othertrue++;
- ps->othertrue2++;
- if (LIT2VAR (other)->level < ps->LEVEL)
- ps->othertrue2u++;
-#endif
- continue;
- }
-
- if (tmp != FALSE)
- {
- assign_forced (ps, other, LIT2REASON (NOTLIT(this)));
- continue;
- }
-
- if (ps->conflict == &ps->cimpl)
- resetcimpl (ps);
- ps->conflict = setcimpl (ps, this, other);
- }
-#else
- /* Traverse all binary clauses with 'this'. Head/Tail pointers for binary
- * clauses do not have to be modified here.
- */
- p = LIT2IMPLS (this);
- for (c = *p; c; c = next)
- {
- ps->visits++;
-#ifdef STATS
- ps->bvisits++;
-#endif
- assert (!c->collect);
-#ifdef TRACE
- assert (!c->collected);
-#endif
- assert (c->size == 2);
-
- other = c->lits[0];
- if (other == this)
- {
- next = c->next[0];
- other = c->lits[1];
- }
- else
- next = c->next[1];
-
- tmp = other->val;
-
- if (tmp == TRUE)
- {
-#ifdef STATS
- ps->othertrue++;
- ps->othertrue2++;
- if (LIT2VAR (other)->level < ps->LEVEL)
- ps->othertrue2u++;
-#endif
- continue;
- }
-
- if (tmp == FALSE)
- ps->conflict = c;
- else
- assign_forced (ps, other, c); /* unit clause */
- }
-#endif /* !defined(NO_BINARY_CLAUSES) */
-}
-
-#ifndef NDSC
-static int
-should_disconnect_head_tail (PS * ps, Lit * lit)
-{
- unsigned litlevel;
- Var * v;
-
- assert (lit->val == TRUE);
-
- v = LIT2VAR (lit);
- litlevel = v->level;
-
- if (!litlevel)
- return 1;
-
-#ifndef NFL
- if (ps->simplifying)
- return 0;
-#endif
-
- return litlevel < ps->LEVEL;
-}
-#endif
-
-inline static void
-propl (PS * ps, Lit * this)
-{
- Lit **l, *other, *prev, *new_lit, **eol;
- Cls *next, **htp_ptr, **new_htp_ptr;
- Cls *c;
-#ifdef STATS
- unsigned size;
-#endif
-
- htp_ptr = LIT2HTPS (this);
- assert (this->val == FALSE);
-
- /* Traverse all non binary clauses with 'this'. Head/Tail pointers are
- * updated as well.
- */
- for (c = *htp_ptr; c; c = next)
- {
- ps->visits++;
-#ifdef STATS
- size = c->size;
- assert (size >= 3);
- ps->traversals++; /* other is dereferenced at least */
-
- if (size == 3)
- ps->tvisits++;
- else if (size >= 4)
- {
- ps->lvisits++;
- ps->ltraversals++;
- }
-#endif
-#ifdef TRACE
- assert (!c->collected);
-#endif
- assert (c->size > 0);
-
- other = c->lits[0];
- if (other != this)
- {
- assert (c->size != 1);
- c->lits[0] = this;
- c->lits[1] = other;
- next = c->next[1];
- c->next[1] = c->next[0];
- c->next[0] = next;
- }
- else if (c->size == 1) /* With assumptions we need to
- * traverse unit clauses as well.
- */
- {
- assert (!ps->conflict);
- ps->conflict = c;
- break;
- }
- else
- {
- assert (other == this && c->size > 1);
- other = c->lits[1];
- next = c->next[0];
- }
- assert (other == c->lits[1]);
- assert (this == c->lits[0]);
- assert (next == c->next[0]);
- assert (!c->collect);
-
- if (other->val == TRUE)
- {
-#ifdef STATS
- ps->othertrue++;
- ps->othertruel++;
-#endif
-#ifndef NDSC
- if (should_disconnect_head_tail (ps, other))
- {
- new_htp_ptr = LIT2DHTPS (other);
- c->next[0] = *new_htp_ptr;
- *new_htp_ptr = c;
-#ifdef STATS
- ps->othertruelu++;
-#endif
- *htp_ptr = next;
- continue;
- }
-#endif
- htp_ptr = c->next;
- continue;
- }
-
- l = c->lits + 1;
- eol = (Lit**) c->lits + c->size;
- prev = this;
-
- while (++l != eol)
- {
-#ifdef STATS
- if (size >= 3)
- {
- ps->traversals++;
- if (size > 3)
- ps->ltraversals++;
- }
-#endif
- new_lit = *l;
- *l = prev;
- prev = new_lit;
- if (new_lit->val != FALSE) break;
- }
-
- if (l == eol)
- {
- while (l > c->lits + 2)
- {
- new_lit = *--l;
- *l = prev;
- prev = new_lit;
- }
- assert (c->lits[0] == this);
-
- assert (other == c->lits[1]);
- if (other->val == FALSE) /* found conflict */
- {
- assert (!ps->conflict);
- ps->conflict = c;
- return;
- }
-
- assign_forced (ps, other, c); /* unit clause */
- htp_ptr = c->next;
- }
- else
- {
- assert (new_lit->val == TRUE || new_lit->val == UNDEF);
- c->lits[0] = new_lit;
- // *l = this;
- new_htp_ptr = LIT2HTPS (new_lit);
- c->next[0] = *new_htp_ptr;
- *new_htp_ptr = c;
- *htp_ptr = next;
- }
- }
-}
-
-#ifndef NADC
-
-static unsigned primes[] = { 996293, 330643, 753947, 500873 };
-
-#define PRIMES ((sizeof primes)/sizeof *primes)
-
-static unsigned
-hash_ado (PS * ps, Lit ** ado, unsigned salt)
-{
- unsigned i, res, tmp;
- Lit ** p, * lit;
-
- assert (salt < PRIMES);
-
- i = salt;
- res = 0;
-
- for (p = ado; (lit = *p); p++)
- {
- assert (lit->val);
-
- tmp = res >> 31;
- res <<= 1;
-
- if (lit->val > 0)
- res |= 1;
-
- assert (i < PRIMES);
- res *= primes[i++];
- if (i == PRIMES)
- i = 0;
-
- res += tmp;
- }
-
- return res & (ps->szadotab - 1);
-}
-
-static unsigned
-cmp_ado (Lit ** a, Lit ** b)
-{
- Lit ** p, ** q, * l, * k;
- int res;
-
- for (p = a, q = b; (l = *p); p++, q++)
- {
- k = *q;
- assert (k);
- if ((res = (l->val - k->val)))
- return res;
- }
-
- assert (!*q);
-
- return 0;
-}
-
-static Lit ***
-find_ado (PS * ps, Lit ** ado)
-{
- Lit *** res, ** other;
- unsigned pos, delta;
-
- pos = hash_ado (ps, ado, 0);
- assert (pos < ps->szadotab);
- res = ps->adotab + pos;
-
- other = *res;
- if (!other || !cmp_ado (other, ado))
- return res;
-
- delta = hash_ado (ps, ado, 1);
- if (!(delta & 1))
- delta++;
-
- assert (delta & 1);
- assert (delta < ps->szadotab);
-
- for (;;)
- {
- pos += delta;
- if (pos >= ps->szadotab)
- pos -= ps->szadotab;
-
- assert (pos < ps->szadotab);
- res = ps->adotab + pos;
- other = *res;
- if (!other || !cmp_ado (other, ado))
- return res;
- }
-}
-
-static void
-enlarge_adotab (PS * ps)
-{
- /* TODO make this generic */
-
- ABORTIF (ps->szadotab,
- "internal: all different objects table needs larger initial size");
- assert (!ps->nadotab);
- ps->szadotab = 10000;
- NEWN (ps->adotab, ps->szadotab);
- CLRN (ps->adotab, ps->szadotab);
-}
-
-static int
-propado (PS * ps, Var * v)
-{
- Lit ** p, ** q, *** adotabpos, **ado, * lit;
- Var * u;
-
- if (ps->LEVEL && ps->adodisabled)
- return 1;
-
- assert (!ps->conflict);
- assert (!ps->adoconflict);
- assert (VAR2LIT (v)->val != UNDEF);
- assert (!v->adotabpos);
-
- if (!v->ado)
- return 1;
-
- assert (v->inado);
-
- for (p = v->ado; (lit = *p); p++)
- if (lit->val == UNDEF)
- {
- u = LIT2VAR (lit);
- assert (!u->ado);
- u->ado = v->ado;
- v->ado = 0;
-
- return 1;
- }
-
- if (4 * ps->nadotab >= 3 * ps->szadotab) /* at least 75% filled */
- enlarge_adotab (ps);
-
- adotabpos = find_ado (ps, v->ado);
- ado = *adotabpos;
-
- if (!ado)
- {
- ps->nadotab++;
- v->adotabpos = adotabpos;
- *adotabpos = v->ado;
- return 1;
- }
-
- assert (ado != v->ado);
-
- ps->adoconflict = new_clause (ps, 2 * llength (ado), 1);
- q = ps->adoconflict->lits;
-
- for (p = ado; (lit = *p); p++)
- *q++ = lit->val == FALSE ? lit : NOTLIT (lit);
-
- for (p = v->ado; (lit = *p); p++)
- *q++ = lit->val == FALSE ? lit : NOTLIT (lit);
-
- assert (q == ENDOFCLS (ps->adoconflict));
- ps->conflict = ps->adoconflict;
- ps->adoconflicts++;
- return 0;
-}
-
-#endif
-
-static void
-bcp (PS * ps)
-{
- int props = 0;
- assert (!ps->conflict);
-
- if (ps->mtcls)
- return;
-
- for (;;)
- {
- if (ps->ttail2 < ps->thead) /* prioritize implications */
- {
- props++;
- prop2 (ps, NOTLIT (*ps->ttail2++));
- }
- else if (ps->ttail < ps->thead) /* unit clauses or clauses with length > 2 */
- {
- if (ps->conflict) break;
- propl (ps, NOTLIT (*ps->ttail++));
- if (ps->conflict) break;
- }
-#ifndef NADC
- else if (ps->ttailado < ps->thead)
- {
- if (ps->conflict) break;
- propado (ps, LIT2VAR (*ps->ttailado++));
- if (ps->conflict) break;
- }
-#endif
- else
- break; /* all assignments propagated, so break */
- }
-
- ps->propagations += props;
-}
-
-static unsigned
-drive (PS * ps)
-{
- unsigned res, vlevel;
- Lit **p;
- Var *v;
-
- res = 0;
- for (p = ps->added; p < ps->ahead; p++)
- {
- v = LIT2VAR (*p);
- vlevel = v->level;
- assert (vlevel <= ps->LEVEL);
- if (vlevel < ps->LEVEL && vlevel > res)
- res = vlevel;
- }
-
- return res;
-}
-
-#ifdef VISCORES
-
-static void
-viscores (PS * ps)
-{
- Rnk *p, *eor = ps->rnks + ps->max_var;
- char name[100], cmd[200];
- FILE * data;
- Flt s;
- int i;
-
- for (p = ps->rnks + 1; p <= ps->eor; p++)
- {
- s = p->score;
- if (s == INFFLT)
- continue;
- s = mulflt (s, ps->nvinc);
- assert (flt2double (s) <= 1.0);
- }
-
- sprintf (name, "/tmp/picosat-viscores/data/%08u", ps->conflicts);
- sprintf (cmd, "sort -n|nl>%s", name);
-
- data = popen (cmd, "w");
- for (p = ps->rnks + 1; p <= ps->eor; p++)
- {
- s = p->score;
- if (s == INFFLT)
- continue;
- s = mulflt (s, ps->nvinc);
- fprintf (data, "%lf %d\n", 100.0 * flt2double (s), (int)(p - ps->rnks));
- }
- fflush (data);
- pclose (data);
-
- for (i = 0; i < 8; i++)
- {
- sprintf (cmd, "awk '$3%%8==%d' %s>%s.%d", i, name, name, i);
- system (cmd);
- }
-
- fprintf (ps->fviscores, "set title \"%u\"\n", ps->conflicts);
- fprintf (ps->fviscores, "plot [0:%u] 0, 100 * (1 - 1/1.1), 100", ps->max_var);
-
- for (i = 0; i < 8; i++)
- fprintf (ps->fviscores,
- ", \"%s.%d\" using 1:2:3 with labels tc lt %d",
- name, i, i + 1);
-
- fputc ('\n', ps->fviscores);
- fflush (ps->fviscores);
-#ifndef WRITEGIF
- usleep (50000); /* refresh rate of 20 Hz */
-#endif
-}
-
-#endif
-
-static void
-crescore (PS * ps)
-{
- Cls **p, *c;
- Act *a;
- Flt factor;
- int l = log2flt (ps->cinc);
- assert (l > 0);
- factor = base2flt (1, -l);
-
- for (p = ps->lclauses; p != ps->lhead; p++)
- {
- c = *p;
-
- if (!c)
- continue;
-
-#ifdef TRACE
- if (c->collected)
- continue;
-#endif
- assert (c->learned);
-
- if (c->size <= 2)
- continue;
-
- a = CLS2ACT (c);
- *a = mulflt (*a, factor);
- }
-
- ps->cinc = mulflt (ps->cinc, factor);
-}
-
-static void
-inc_vinc (PS * ps)
-{
-#ifdef VISCORES
- ps->nvinc = mulflt (ps->nvinc, ps->fvinc);
-#endif
- ps->vinc = mulflt (ps->vinc, ps->ifvinc);
-}
-
-inline static void
-inc_max_var (PS * ps)
-{
- Lit *lit;
- Rnk *r;
- Var *v;
-
- assert (ps->max_var < ps->size_vars);
-
- if (ps->max_var + 1 == ps->size_vars)
- enlarge (ps, ps->size_vars + 2*(ps->size_vars + 3) / 4); /* +25% */
-
- ps->max_var++; /* new index of variable */
- assert (ps->max_var); /* no unsigned overflow */
-
- assert (ps->max_var < ps->size_vars);
-
- lit = ps->lits + 2 * ps->max_var;
- lit[0].val = lit[1].val = UNDEF;
-
- memset (ps->htps + 2 * ps->max_var, 0, 2 * sizeof *ps->htps);
-#ifndef NDSC
- memset (ps->dhtps + 2 * ps->max_var, 0, 2 * sizeof *ps->dhtps);
-#endif
- memset (ps->impls + 2 * ps->max_var, 0, 2 * sizeof *ps->impls);
- memset (ps->jwh + 2 * ps->max_var, 0, 2 * sizeof *ps->jwh);
-
- v = ps->vars + ps->max_var; /* initialize variable components */
- CLR (v);
-
- r = ps->rnks + ps->max_var; /* initialize rank */
- CLR (r);
-
- hpush (ps, r);
-}
-
-static void
-force (PS * ps, Cls * c)
-{
- Lit ** p, ** eol, * lit, * forced;
- Cls * reason;
-
- forced = 0;
- reason = c;
-
- eol = end_of_lits (c);
- for (p = c->lits; p < eol; p++)
- {
- lit = *p;
- if (lit->val == UNDEF)
- {
- assert (!forced);
- forced = lit;
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- reason = LIT2REASON (NOTLIT (p[p == c->lits ? 1 : -1]));
-#endif
- }
- else
- assert (lit->val == FALSE);
- }
-
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- resetimpl (ps);
-#endif
- if (!forced)
- return;
-
- assign_forced (ps, forced, reason);
-}
-
-static INLINE void
-inc_lreduce (PS * ps)
-{
-#ifdef STATS
- ps->inclreduces++;
-#endif
- ps->lreduce *= FREDUCE;
- ps->lreduce /= 100;
- report (ps, 1, '+');
-}
-
-static void
-backtrack (PS * ps)
-{
- unsigned new_level;
- Cls * c;
-
- ps->conflicts++;
- LOG ( fprintf (ps->out, "%sconflict ", ps->prefix); dumpclsnl (ps, ps->conflict));
-
- analyze (ps);
- new_level = drive (ps);
- // TODO: why not? assert (new_level != 1 || (ps->ahead - ps->added) == 2);
- c = add_simplified_clause (ps, 1);
- undo (ps, new_level);
- force (ps, c);
-
- if (
-#ifndef NFL
- !ps->simplifying &&
-#endif
- !--ps->lreduceadjustcnt)
- {
- /* With FREDUCE==110 and FREDADJ=121 we stir 'lreduce' to be
- * proportional to 'sqrt(conflicts)'. In earlier version we actually
- * used 'FREDADJ=150', which results in 'lreduce' to approximate
- * 'conflicts^(log(1.1)/log(1.5))' which is close to the fourth root
- * of 'conflicts', since log(1.1)/log(1.5)=0.235 (as observed by
- * Donald Knuth). The square root is the same we get by a Glucose
- * style increase, which simply adds a constant at every reduction.
- * This would be way simpler to implement but for now we keep the more
- * complicated code using the adjust increments and counters.
- */
- ps->lreduceadjustinc *= FREDADJ; ps->lreduceadjustinc /= 100; ps->lreduceadjustcnt
- = ps->lreduceadjustinc;
- inc_lreduce (ps);
- }
-
- if (ps->verbosity >= 4 && !(INT_MOD(ps->conflicts, 1000)))
- report (ps, 4, 'C');
-}
-
-static void
-inc_cinc (PS * ps)
-{
- ps->cinc = mulflt (ps->cinc, ps->fcinc);
- if (ps->lcinc < ps->cinc)
- crescore (ps);
-}
-
-static void
-incincs (PS * ps)
-{
- inc_vinc (ps);
- inc_cinc (ps);
-#ifdef VISCORES
- viscores (ps);
-#endif
-}
-
-static void
-disconnect_clause (PS * ps, Cls * c)
-{
- assert (c->connected);
-
- if (c->size > 2)
- {
- if (c->learned)
- {
- assert (ps->nlclauses > 0);
- ps->nlclauses--;
-
- assert (ps->llits >= c->size);
- ps->llits -= c->size;
- }
- else
- {
- assert (ps->noclauses > 0);
- ps->noclauses--;
-
- assert (ps->olits >= c->size);
- ps->olits -= c->size;
- }
- }
-
-#ifndef NDEBUG
- c->connected = 0;
-#endif
-}
-
-static int
-clause_is_toplevel_satisfied (PS * ps, Cls * c)
-{
- Lit *lit, **p, **eol = end_of_lits (c);
- Var *v;
-
- for (p = c->lits; p < eol; p++)
- {
- lit = *p;
- if (lit->val == TRUE)
- {
- v = LIT2VAR (lit);
- if (!v->level)
- return 1;
- }
- }
-
- return 0;
-}
-
-static int
-collect_clause (PS * ps, Cls * c)
-{
- assert (c->collect);
- c->collect = 0;
-
-#ifdef TRACE
- assert (!c->collected);
- c->collected = 1;
-#endif
- disconnect_clause (ps, c);
-
-#ifdef TRACE
- if (ps->trace && (!c->learned || c->used))
- return 0;
-#endif
- delete_clause (ps, c);
-
- return 1;
-}
-
-static size_t
-collect_clauses (PS * ps)
-{
- Cls *c, **p, **q, * next;
- Lit * lit, * eol;
- size_t res;
- int i;
-
- res = ps->current_bytes;
-
- eol = ps->lits + 2 * ps->max_var + 1;
- for (lit = ps->lits + 2; lit <= eol; lit++)
- {
- for (i = 0; i <= 1; i++)
- {
- if (i)
- {
-#ifdef NO_BINARY_CLAUSES
- Ltk * lstk = LIT2IMPLS (lit);
- Lit ** r, ** s;
- r = lstk->start;
- if (lit->val != TRUE || LIT2VAR (lit)->level)
- for (s = r; s < lstk->start + lstk->count; s++)
- {
- Lit * other = *s;
- Var *v = LIT2VAR (other);
- if (v->level ||
- other->val != TRUE)
- *r++ = other;
- }
- lstk->count = r - lstk->start;
- continue;
-#else
- p = LIT2IMPLS (lit);
-#endif
- }
- else
- p = LIT2HTPS (lit);
-
- for (c = *p; c; c = next)
- {
- q = c->next;
- if (c->lits[0] != lit)
- q++;
-
- next = *q;
- if (c->collect)
- *p = next;
- else
- p = q;
- }
- }
- }
-
-#ifndef NDSC
- for (lit = ps->lits + 2; lit <= eol; lit++)
- {
- p = LIT2DHTPS (lit);
- while ((c = *p))
- {
- Lit * other = c->lits[0];
- if (other == lit)
- {
- q = c->next + 1;
- }
- else
- {
- assert (c->lits[1] == lit);
- q = c->next;
- }
-
- if (c->collect)
- *p = *q;
- else
- p = q;
- }
- }
-#endif
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
-
- if (!c)
- continue;
-
- if (!c->collect)
- continue;
-
- if (collect_clause (ps, c))
- *p = 0;
- }
-
-#ifdef TRACE
- if (!ps->trace)
-#endif
- {
- q = ps->oclauses;
- for (p = q; p < ps->ohead; p++)
- if ((c = *p))
- *q++ = c;
- ps->ohead = q;
-
- q = ps->lclauses;
- for (p = q; p < ps->lhead; p++)
- if ((c = *p))
- *q++ = c;
- ps->lhead = q;
- }
-
- assert (ps->current_bytes <= res);
- res -= ps->current_bytes;
- ps->recycled += res;
-
- LOG ( fprintf (ps->out, "%scollected %ld bytes\n", ps->prefix, (long)res));
-
- return res;
-}
-
-static INLINE int
-need_to_reduce (PS * ps)
-{
- return ps->nlclauses >= reduce_limit_on_lclauses (ps);
-}
-
-#ifdef NLUBY
-
-static void
-inc_drestart (PS * ps)
-{
- ps->drestart *= FRESTART;
- ps->drestart /= 100;
-
- if (ps->drestart >= MAXRESTART)
- ps->drestart = MAXRESTART;
-}
-
-static void
-inc_ddrestart (PS * ps)
-{
- ps->ddrestart *= FRESTART;
- ps->ddrestart /= 100;
-
- if (ps->ddrestart >= MAXRESTART)
- ps->ddrestart = MAXRESTART;
-}
-
-#else
-
-static unsigned
-luby (unsigned i)
-{
- unsigned k;
- for (k = 1; k < 32; k++)
- if (i == (1u << k) - 1)
- return 1u << (k - 1);
-
- for (k = 1;; k++)
- if ((1u << (k - 1)) <= i && i < (1u << k) - 1)
- return luby (i - (1u << (k-1)) + 1);
-}
-
-#endif
-
-#ifndef NLUBY
-static void
-inc_lrestart (PS * ps, int skip)
-{
- unsigned delta;
-
- delta = 100 * luby (++ps->lubycnt);
- ps->lrestart = ps->conflicts + delta;
-
- if (ps->waslubymaxdelta)
- report (ps, 1, skip ? 'N' : 'R');
- else
- report (ps, 2, skip ? 'n' : 'r');
-
- if (delta > ps->lubymaxdelta)
- {
- ps->lubymaxdelta = delta;
- ps->waslubymaxdelta = 1;
- }
- else
- ps->waslubymaxdelta = 0;
-}
-#endif
-
-static void
-init_restart (PS * ps)
-{
-#ifdef NLUBY
- /* TODO: why is it better in incremental usage to have smaller initial
- * outer restart interval?
- */
- ps->ddrestart = ps->calls > 1 ? MINRESTART : 1000;
- ps->drestart = MINRESTART;
- ps->lrestart = ps->conflicts + ps->drestart;
-#else
- ps->lubycnt = 0;
- ps->lubymaxdelta = 0;
- ps->waslubymaxdelta = 0;
- inc_lrestart (ps, 0);
-#endif
-}
-
-static void
-restart (PS * ps)
-{
- int skip;
-#ifdef NLUBY
- char kind;
- int outer;
-
- inc_drestart (ps);
- outer = (ps->drestart >= ps->ddrestart);
-
- if (outer)
- skip = very_high_agility (ps);
- else
- skip = high_agility (ps);
-#else
- skip = medium_agility (ps);
-#endif
-
-#ifdef STATS
- if (skip)
- ps->skippedrestarts++;
-#endif
-
- assert (ps->conflicts >= ps->lrestart);
-
- if (!skip)
- {
- ps->restarts++;
- assert (ps->LEVEL > 1);
- LOG ( fprintf (ps->out, "%srestart %u\n", ps->prefix, ps->restarts));
- undo (ps, 0);
- }
-
-#ifdef NLUBY
- if (outer)
- {
- kind = skip ? 'N' : 'R';
- inc_ddrestart (ps);
- ps->drestart = MINRESTART;
- }
- else if (skip)
- {
- kind = 'n';
- }
- else
- {
- kind = 'r';
- }
-
- assert (ps->drestart <= MAXRESTART);
- ps->lrestart = ps->conflicts + ps->drestart;
- assert (ps->lrestart > ps->conflicts);
-
- report (outer ? 1 : 2, kind);
-#else
- inc_lrestart (ps, skip);
-#endif
-}
-
-inline static void
-assign_decision (PS * ps, Lit * lit)
-{
- assert (!ps->conflict);
-
- ps->LEVEL++;
-
- LOG ( fprintf (ps->out, "%snew level %u\n", ps->prefix, ps->LEVEL));
- LOG ( fprintf (ps->out,
- "%sassign %d at level %d <= DECISION\n",
- ps->prefix, LIT2INT (lit), ps->LEVEL));
-
- assign (ps, lit, 0);
-}
-
-#ifndef NFL
-
-static INLINE int
-lit_has_binary_clauses (PS * ps, Lit * lit)
-{
-#ifdef NO_BINARY_CLAUSES
- Ltk* lstk = LIT2IMPLS (lit);
- return lstk->count != 0;
-#else
- return *LIT2IMPLS (lit) != 0;
-#endif
-}
-
-static void
-flbcp (PS * ps)
-{
-#ifdef STATS
- unsigned long long propagaions_before_bcp = ps->propagations;
-#endif
- bcp (ps);
-#ifdef STATS
- ps->flprops += ps->propagations - propagaions_before_bcp;
-#endif
-}
-
-inline static int
-cmp_inverse_rnk (PS * ps, Rnk * a, Rnk * b)
-{
- (void) ps;
- return -cmp_rnk (a, b);
-}
-
-inline static Flt
-rnk2jwh (PS * ps, Rnk * r)
-{
- Flt res, sum, pjwh, njwh;
- Lit * plit, * nlit;
-
- plit = RNK2LIT (r);
- nlit = plit + 1;
-
- pjwh = *LIT2JWH (plit);
- njwh = *LIT2JWH (nlit);
-
- res = mulflt (pjwh, njwh);
-
- sum = addflt (pjwh, njwh);
- sum = mulflt (sum, base2flt (1, -10));
- res = addflt (res, sum);
-
- return res;
-}
-
-static int
-cmp_inverse_jwh_rnk (PS * ps, Rnk * r, Rnk * s)
-{
- Flt a = rnk2jwh (ps, r);
- Flt b = rnk2jwh (ps, s);
- int res = cmpflt (a, b);
-
- if (res)
- return -res;
-
- return cmp_inverse_rnk (ps, r, s);
-}
-
-static void
-faillits (PS * ps)
-{
- unsigned i, j, old_trail_count, common, saved_count;
- unsigned new_saved_size, oldladded = ps->ladded;
- unsigned long long limit, delta;
- Lit * lit, * other, * pivot;
- Rnk * r, ** p, ** q;
- int new_trail_count;
- double started;
-
- if (ps->plain)
- return;
-
- if (ps->heap + 1 >= ps->hhead)
- return;
-
- if (ps->propagations < ps->fllimit)
- return;
-
- sflush (ps);
- started = ps->seconds;
-
- ps->flcalls++;
-#ifdef STATSA
- ps->flrounds++;
-#endif
- delta = ps->propagations/10;
- if (delta >= 100*1000*1000) delta = 100*1000*1000;
- else if (delta <= 100*1000) delta = 100*1000;
-
- limit = ps->propagations + delta;
- ps->fllimit = ps->propagations;
-
- assert (!ps->LEVEL);
- assert (ps->simplifying);
-
- if (ps->flcalls <= 1)
- SORT (Rnk *, cmp_inverse_jwh_rnk, ps->heap + 1, ps->hhead - (ps->heap + 1));
- else
- SORT (Rnk *, cmp_inverse_rnk, ps->heap + 1, ps->hhead - (ps->heap + 1));
-
- i = 1; /* NOTE: heap starts at position '1' */
-
- while (ps->propagations < limit)
- {
- if (ps->heap + i == ps->hhead)
- {
- if (ps->ladded == oldladded)
- break;
-
- i = 1;
-#ifdef STATS
- ps->flrounds++;
-#endif
- oldladded = ps->ladded;
- }
-
- assert (ps->heap + i < ps->hhead);
-
- r = ps->heap[i++];
- lit = RNK2LIT (r);
-
- if (lit->val)
- continue;
-
- if (!lit_has_binary_clauses (ps, NOTLIT (lit)))
- {
-#ifdef STATS
- ps->flskipped++;
-#endif
- continue;
- }
-
-#ifdef STATS
- ps->fltried++;
-#endif
- LOG ( fprintf (ps->out, "%strying %d as failed literal\n",
- ps->prefix, LIT2INT (lit)));
-
- assign_decision (ps, lit);
- old_trail_count = ps->thead - ps->trail;
- flbcp (ps);
-
- if (ps->conflict)
- {
-EXPLICITLY_FAILED_LITERAL:
- LOG ( fprintf (ps->out, "%sfound explicitly failed literal %d\n",
- ps->prefix, LIT2INT (lit)));
-
- ps->failedlits++;
- ps->efailedlits++;
-
- backtrack (ps);
- flbcp (ps);
-
- if (!ps->conflict)
- continue;
-
-CONTRADICTION:
- assert (!ps->LEVEL);
- backtrack (ps);
- assert (ps->mtcls);
-
- goto RETURN;
- }
-
- if (ps->propagations >= limit)
- {
- undo (ps, 0);
- break;
- }
-
- lit = NOTLIT (lit);
-
- if (!lit_has_binary_clauses (ps, NOTLIT (lit)))
- {
-#ifdef STATS
- ps->flskipped++;
-#endif
- undo (ps, 0);
- continue;
- }
-
-#ifdef STATS
- ps->fltried++;
-#endif
- LOG ( fprintf (ps->out, "%strying %d as failed literals\n",
- ps->prefix, LIT2INT (lit)));
-
- new_trail_count = ps->thead - ps->trail;
- saved_count = new_trail_count - old_trail_count;
-
- if (saved_count > ps->saved_size)
- {
- new_saved_size = ps->saved_size ? 2 * ps->saved_size : 1;
- while (saved_count > new_saved_size)
- new_saved_size *= 2;
-
- RESIZEN (ps->saved, ps->saved_size, new_saved_size);
- ps->saved_size = new_saved_size;
- }
-
- for (j = 0; j < saved_count; j++)
- ps->saved[j] = ps->trail[old_trail_count + j];
-
- undo (ps, 0);
-
- assign_decision (ps, lit);
- flbcp (ps);
-
- if (ps->conflict)
- goto EXPLICITLY_FAILED_LITERAL;
-
- pivot = (ps->thead - ps->trail <= new_trail_count) ? lit : NOTLIT (lit);
-
- common = 0;
- for (j = 0; j < saved_count; j++)
- if ((other = ps->saved[j])->val == TRUE)
- ps->saved[common++] = other;
-
- undo (ps, 0);
-
- LOG (if (common)
- fprintf (ps->out,
- "%sfound %d literals implied by %d and %d\n",
- ps->prefix, common,
- LIT2INT (NOTLIT (lit)), LIT2INT (lit)));
-
-#if 1 // set to zero to disable 'lifting'
- for (j = 0;
- j < common
- /* TODO: For some Velev benchmarks, extracting the common implicit
- * failed literals took quite some time. This needs to be fixed by
- * a dedicated analyzer. Up to then we bound the number of
- * propagations in this loop as well.
- */
- && ps->propagations < limit + delta
- ; j++)
- {
- other = ps->saved[j];
-
- if (other->val == TRUE)
- continue;
-
- assert (!other->val);
-
- LOG ( fprintf (ps->out,
- "%sforcing %d as forced implicitly failed literal\n",
- ps->prefix, LIT2INT (other)));
-
- assert (pivot != NOTLIT (other));
- assert (pivot != other);
-
- assign_decision (ps, NOTLIT (other));
- flbcp (ps);
-
- assert (ps->LEVEL == 1);
-
- if (ps->conflict)
- {
- backtrack (ps);
- assert (!ps->LEVEL);
- }
- else
- {
- assign_decision (ps, pivot);
- flbcp (ps);
-
- backtrack (ps);
-
- if (ps->LEVEL)
- {
- assert (ps->LEVEL == 1);
-
- flbcp (ps);
-
- if (ps->conflict)
- {
- backtrack (ps);
- assert (!ps->LEVEL);
- }
- else
- {
- assign_decision (ps, NOTLIT (pivot));
- flbcp (ps);
- backtrack (ps);
-
- if (ps->LEVEL)
- {
- assert (ps->LEVEL == 1);
- flbcp (ps);
-
- if (!ps->conflict)
- {
-#ifdef STATS
- ps->floopsed++;
-#endif
- undo (ps, 0);
- continue;
- }
-
- backtrack (ps);
- }
-
- assert (!ps->LEVEL);
- }
-
- assert (!ps->LEVEL);
- }
- }
- assert (!ps->LEVEL);
- flbcp (ps);
-
- ps->failedlits++;
- ps->ifailedlits++;
-
- if (ps->conflict)
- goto CONTRADICTION;
- }
-#endif
- }
-
- ps->fllimit += 9 * (ps->propagations - ps->fllimit); /* 10% for failed literals */
-
-RETURN:
-
- /* First flush top level assigned literals. Those are prohibited from
- * being pushed up the heap during 'faillits' since 'simplifying' is set.
- */
- assert (ps->heap < ps->hhead);
- for (p = q = ps->heap + 1; p < ps->hhead; p++)
- {
- r = *p;
- lit = RNK2LIT (r);
- if (lit->val)
- r->pos = 0;
- else
- *q++ = r;
- }
-
- /* Then resort with respect to EVSIDS score and fix positions.
- */
- SORT (Rnk *, cmp_inverse_rnk, ps->heap + 1, ps->hhead - (ps->heap + 1));
- for (p = ps->heap + 1; p < ps->hhead; p++)
- (*p)->pos = p - ps->heap;
-
- sflush (ps);
- ps->flseconds += ps->seconds - started;
-}
-
-#endif
-
-static void
-simplify (PS * ps, int forced)
-{
- Lit * lit, * notlit, ** t;
- unsigned collect, delta;
-#ifdef STATS
- size_t bytes_collected;
-#endif
- int * q, ilit;
- Cls **p, *c;
- Var * v;
-
-#ifndef NDEDBUG
- (void) forced;
-#endif
-
- assert (!ps->mtcls);
- assert (!satisfied (ps));
- assert (forced || ps->lsimplify <= ps->propagations);
- assert (forced || ps->fsimplify <= ps->fixed);
-
- if (ps->LEVEL)
- undo (ps, 0);
-#ifndef NFL
- ps->simplifying = 1;
- faillits (ps);
- ps->simplifying = 0;
-
- if (ps->mtcls)
- return;
-#endif
-
- if (ps->cils != ps->cilshead)
- {
- assert (ps->ttail == ps->thead);
- assert (ps->ttail2 == ps->thead);
- ps->ttail = ps->trail;
- for (t = ps->trail; t < ps->thead; t++)
- {
- lit = *t;
- v = LIT2VAR (lit);
- if (v->internal)
- {
- assert (LIT2INT (lit) < 0);
- assert (lit->val == TRUE);
- unassign (ps, lit);
- }
- else
- *ps->ttail++ = lit;
- }
- ps->ttail2 = ps->thead = ps->ttail;
-
- for (q = ps->cils; q != ps->cilshead; q++)
- {
- ilit = *q;
- assert (0 < ilit && ilit <= (int) ps->max_var);
- v = ps->vars + ilit;
- assert (v->internal);
- v->level = 0;
- v->reason = 0;
- lit = int2lit (ps, -ilit);
- assert (lit->val == UNDEF);
- lit->val = TRUE;
- notlit = NOTLIT (lit);
- assert (notlit->val == UNDEF);
- notlit->val = FALSE;
- }
- }
-
- collect = 0;
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
- if (!c)
- continue;
-
-#ifdef TRACE
- if (c->collected)
- continue;
-#endif
-
- if (c->locked)
- continue;
-
- assert (!c->collect);
- if (clause_is_toplevel_satisfied (ps, c))
- {
- mark_clause_to_be_collected (c);
- collect++;
- }
- }
-
- LOG ( fprintf (ps->out, "%scollecting %d clauses\n", ps->prefix, collect));
-#ifdef STATS
- bytes_collected =
-#endif
- collect_clauses (ps);
-#ifdef STATS
- ps->srecycled += bytes_collected;
-#endif
-
- if (ps->cils != ps->cilshead)
- {
- for (q = ps->cils; q != ps->cilshead; q++)
- {
- ilit = *q;
- assert (0 < ilit && ilit <= (int) ps->max_var);
- assert (ps->vars[ilit].internal);
- if (ps->rilshead == ps->eorils)
- ENLARGE (ps->rils, ps->rilshead, ps->eorils);
- *ps->rilshead++ = ilit;
- lit = int2lit (ps, -ilit);
- assert (lit->val == TRUE);
- lit->val = UNDEF;
- notlit = NOTLIT (lit);
- assert (notlit->val == FALSE);
- notlit->val = UNDEF;
- }
- ps->cilshead = ps->cils;
- }
-
- delta = 10 * (ps->olits + ps->llits) + 100000;
- if (delta > 2000000)
- delta = 2000000;
- ps->lsimplify = ps->propagations + delta;
- ps->fsimplify = ps->fixed;
- ps->simps++;
- report (ps, 1, 's');
-}
-
-static void
-iteration (PS * ps)
-{
- assert (!ps->LEVEL);
- assert (bcp_queue_is_empty (ps));
- assert (ps->isimplify < ps->fixed);
-
- ps->iterations++;
- report (ps, 2, 'i');
-#ifdef NLUBY
- ps->drestart = MINRESTART;
- ps->lrestart = ps->conflicts + ps->drestart;
-#else
- init_restart (ps);
-#endif
- ps->isimplify = ps->fixed;
-}
-
-static int
-cmp_glue_activity_size (PS * ps, Cls * c, Cls * d)
-{
- Act a, b, * p, * q;
-
- (void) ps;
-
- assert (c->learned);
- assert (d->learned);
-
- if (c->glue < d->glue) // smaller glue preferred
- return 1;
-
- if (c->glue > d->glue)
- return -1;
-
- p = CLS2ACT (c);
- q = CLS2ACT (d);
- a = *p;
- b = *q;
-
- if (a < b) // then higher activity
- return -1;
-
- if (b < a)
- return 1;
-
- if (c->size < d->size) // then smaller size
- return 1;
-
- if (c->size > d->size)
- return -1;
-
- return 0;
-}
-
-static void
-reduce (PS * ps, unsigned percentage)
-{
- unsigned redcount, lcollect, collect, target;
-#ifdef STATS
- size_t bytes_collected;
-#endif
- Cls **p, *c;
-
- assert (ps->rhead == ps->resolved);
-
- ps->lastreduceconflicts = ps->conflicts;
-
- assert (percentage <= 100);
- LOG ( fprintf (ps->out,
- "%sreducing %u%% learned clauses\n",
- ps->prefix, percentage));
-
- while (ps->nlclauses - ps->llocked > (unsigned)(ps->eor - ps->resolved))
- ENLARGE (ps->resolved, ps->rhead, ps->eor);
-
- collect = 0;
- lcollect = 0;
-
- for (p = ((ps->fsimplify < ps->fixed) ? SOC : ps->lclauses); p != EOC; p = NXC (p))
- {
- c = *p;
- if (!c)
- continue;
-
-#ifdef TRACE
- if (c->collected)
- continue;
-#endif
-
- if (c->locked)
- continue;
-
- assert (!c->collect);
- if (ps->fsimplify < ps->fixed && clause_is_toplevel_satisfied (ps, c))
- {
- mark_clause_to_be_collected (c);
- collect++;
-
- if (c->learned && c->size > 2)
- lcollect++;
-
- continue;
- }
-
- if (!c->learned)
- continue;
-
- if (c->size <= 2)
- continue;
-
- assert (ps->rhead < ps->eor);
- *ps->rhead++ = c;
- }
- assert (ps->rhead <= ps->eor);
-
- ps->fsimplify = ps->fixed;
-
- redcount = ps->rhead - ps->resolved;
- SORT (Cls *, cmp_glue_activity_size, ps->resolved, redcount);
-
- assert (ps->nlclauses >= lcollect);
- target = ps->nlclauses - lcollect + 1;
-
- target = (percentage * target + 99) / 100;
-
- if (target >= redcount)
- target = redcount;
-
- ps->rhead = ps->resolved + target;
- while (ps->rhead > ps->resolved)
- {
- c = *--ps->rhead;
- mark_clause_to_be_collected (c);
-
- collect++;
- if (c->learned && c->size > 2) /* just for consistency */
- lcollect++;
- }
-
- if (collect)
- {
- ps->reductions++;
-#ifdef STATS
- bytes_collected =
-#endif
- collect_clauses (ps);
-#ifdef STATS
- ps->rrecycled += bytes_collected;
-#endif
- report (ps, 2, '-');
- }
-
- if (!lcollect)
- inc_lreduce (ps); /* avoid dead lock */
-
- assert (ps->rhead == ps->resolved);
-}
-
-static void
-init_reduce (PS * ps)
-{
- // lreduce = loadded / 2;
- ps->lreduce = 1000;
-
- if (ps->lreduce < 100)
- ps->lreduce = 100;
-
- if (ps->verbosity)
- fprintf (ps->out,
- "%s\n%sinitial reduction limit %u clauses\n%s\n",
- ps->prefix, ps->prefix, ps->lreduce, ps->prefix);
-}
-
-static INLINE unsigned
-rng (PS * ps)
-{
- unsigned res = ps->srng;
- ps->srng *= 1664525u;
- ps->srng += 1013904223u;
- NOLOG ( fprintf (ps->out, "%srng () = %u\n", ps->prefix, res));
- return res;
-}
-
-static unsigned
-rrng (PS * ps, unsigned low, unsigned high)
-{
- unsigned long long tmp;
- unsigned res, elements;
- assert (low <= high);
- elements = high - low + 1;
- tmp = rng (ps);
- tmp *= elements;
- tmp >>= 32;
- tmp += low;
- res = tmp;
- NOLOG ( fprintf (ps->out, "%srrng (ps, %u, %u) = %u\n", ps->prefix, low, high, res));
- assert (low <= res);
- assert (res <= high);
- return res;
-}
-
-static Lit *
-decide_phase (PS * ps, Lit * lit)
-{
- Lit * not_lit = NOTLIT (lit);
- Var *v = LIT2VAR (lit);
-
- assert (LIT2SGN (lit) > 0);
- if (v->usedefphase)
- {
- if (v->defphase)
- {
- /* assign to TRUE */
- }
- else
- {
- /* assign to FALSE */
- lit = not_lit;
- }
- }
- else if (!v->assigned)
- {
-#ifdef STATS
- ps->staticphasedecisions++;
-#endif
- if (ps->defaultphase == POSPHASE)
- {
- /* assign to TRUE */
- }
- else if (ps->defaultphase == NEGPHASE)
- {
- /* assign to FALSE */
- lit = not_lit;
- }
- else if (ps->defaultphase == RNDPHASE)
- {
- /* randomly assign default phase */
- if (rrng (ps, 1, 2) != 2)
- lit = not_lit;
- }
- else if (*LIT2JWH(lit) <= *LIT2JWH (not_lit))
- {
- /* assign to FALSE (Jeroslow-Wang says there are more short
- * clauses with negative occurence of this variable, so satisfy
- * those, to minimize BCP)
- */
- lit = not_lit;
- }
- else
- {
- /* assign to TRUE (... but strictly more positive occurrences) */
- }
- }
- else
- {
- /* repeat last phase: phase saving heuristic */
-
- if (v->phase)
- {
- /* assign to TRUE (last phase was TRUE as well) */
- }
- else
- {
- /* assign to FALSE (last phase was FALSE as well) */
- lit = not_lit;
- }
- }
-
- return lit;
-}
-
-static unsigned
-gcd (unsigned a, unsigned b)
-{
- unsigned tmp;
-
- assert (a);
- assert (b);
-
- if (a < b)
- {
- tmp = a;
- a = b;
- b = tmp;
- }
-
- while (b)
- {
- assert (a >= b);
- tmp = b;
- b = INT_MOD(a, b);
- a = tmp;
- }
-
- return a;
-}
-
-static Lit *
-rdecide (PS * ps)
-{
- unsigned idx, delta, spread;
- Lit * res;
-
- spread = RDECIDE;
- if (rrng (ps, 1, spread) != 2)
- return 0;
-
- assert (1 <= ps->max_var);
- idx = rrng (ps, 1, ps->max_var);
- res = int2lit (ps, idx);
-
- if (res->val != UNDEF)
- {
- delta = rrng (ps, 1, ps->max_var);
- while (gcd (delta, ps->max_var) != 1)
- delta--;
-
- assert (1 <= delta);
- assert (delta <= ps->max_var);
-
- do {
- idx += delta;
- if (idx > ps->max_var)
- idx -= ps->max_var;
- res = int2lit (ps, idx);
- } while (res->val != UNDEF);
- }
-
-#ifdef STATS
- ps->rdecisions++;
-#endif
- res = decide_phase (ps, res);
- LOG ( fprintf (ps->out, "%srdecide %d\n", ps->prefix, LIT2INT (res)));
-
- return res;
-}
-
-static Lit *
-sdecide (PS * ps)
-{
- Lit *res;
- Rnk *r;
-
- for (;;)
- {
- r = htop (ps);
- res = RNK2LIT (r);
- if (res->val == UNDEF) break;
- (void) hpop (ps);
- NOLOG ( fprintf (ps->out,
- "%shpop %u %u %u\n",
- ps->prefix, r - ps->rnks,
- FLTMANTISSA(r->score),
- FLTEXPONENT(r->score)));
- }
-
-#ifdef STATS
- ps->sdecisions++;
-#endif
- res = decide_phase (ps, res);
-
- LOG ( fprintf (ps->out, "%ssdecide %d\n", ps->prefix, LIT2INT (res)));
-
- return res;
-}
-
-static Lit *
-adecide (PS * ps)
-{
- Lit *lit;
- Var * v;
-
- assert (ps->als < ps->alshead);
- assert (!ps->failed_assumption);
-
- while (ps->alstail < ps->alshead)
- {
- lit = *ps->alstail++;
-
- if (lit->val == FALSE)
- {
- ps->failed_assumption = lit;
- v = LIT2VAR (lit);
-
- use_var (ps, v);
-
- LOG ( fprintf (ps->out, "%sfirst failed assumption %d\n",
- ps->prefix, LIT2INT (ps->failed_assumption)));
- fanalyze (ps);
- return 0;
- }
-
- if (lit->val == TRUE)
- {
- v = LIT2VAR (lit);
- if (v->level > ps->adecidelevel)
- ps->adecidelevel = v->level;
- continue;
- }
-
-#ifdef STATS
- ps->assumptions++;
-#endif
- LOG ( fprintf (ps->out, "%sadecide %d\n", ps->prefix, LIT2INT (lit)));
- ps->adecidelevel = ps->LEVEL + 1;
-
- return lit;
- }
-
- return 0;
-}
-
-static void
-decide (PS * ps)
-{
- Lit * lit;
-
- assert (!satisfied (ps));
- assert (!ps->conflict);
-
- if (ps->alstail < ps->alshead && (lit = adecide (ps)))
- ;
- else if (ps->failed_assumption)
- return;
- else if (satisfied (ps))
- return;
- else if (!(lit = rdecide (ps)))
- lit = sdecide (ps);
-
- assert (lit);
- assign_decision (ps, lit);
-
- ps->levelsum += ps->LEVEL;
- ps->decisions++;
-}
-
-static int
-sat (PS * ps, int l)
-{
- int count = 0, backtracked;
-
- if (!ps->conflict)
- bcp (ps);
-
- if (ps->conflict)
- backtrack (ps);
-
- if (ps->mtcls)
- return PICOSAT_UNSATISFIABLE;
-
- if (satisfied (ps))
- goto SATISFIED;
-
- if (ps->lsimplify <= ps->propagations)
- simplify (ps, 0);
-
- if (ps->mtcls)
- return PICOSAT_UNSATISFIABLE;
-
- if (satisfied (ps))
- goto SATISFIED;
-
- init_restart (ps);
-
- if (!ps->lreduce)
- init_reduce (ps);
-
- ps->isimplify = ps->fixed;
- backtracked = 0;
-
- for (;;)
- {
- if (!ps->conflict)
- bcp (ps);
-
- if (ps->conflict)
- {
- incincs (ps);
- backtrack (ps);
-
- if (ps->mtcls)
- return PICOSAT_UNSATISFIABLE;
- backtracked = 1;
- continue;
- }
-
- if (satisfied (ps))
- {
-SATISFIED:
-#ifndef NDEBUG
- original_clauses_satisfied (ps);
- assumptions_satisfied (ps);
-#endif
- return PICOSAT_SATISFIABLE;
- }
-
- if (backtracked)
- {
- backtracked = 0;
- if (!ps->LEVEL && ps->isimplify < ps->fixed)
- iteration (ps);
- }
-
- if (l >= 0 && count >= l) /* decision limit reached ? */
- return PICOSAT_UNKNOWN;
-
- if (ps->interrupt.function && /* external interrupt */
- count > 0 && !(INT_MOD(count, INTERRUPTLIM)) &&
- ps->interrupt.function (ps->interrupt.state))
- return PICOSAT_UNKNOWN;
-
- if (ps->propagations >= ps->lpropagations)/* propagation limit reached ? */
- return PICOSAT_UNKNOWN;
-
-#ifndef NADC
- if (!ps->adodisabled && ps->adoconflicts >= ps->adoconflictlimit)
- {
- assert (bcp_queue_is_empty (ps));
- return PICOSAT_UNKNOWN;
- }
-#endif
-
- if (ps->fsimplify < ps->fixed && ps->lsimplify <= ps->propagations)
- {
- simplify (ps, 0);
- if (!bcp_queue_is_empty (ps))
- continue;
-#ifndef NFL
- if (ps->mtcls)
- return PICOSAT_UNSATISFIABLE;
-
- if (satisfied (ps))
- return PICOSAT_SATISFIABLE;
-
- assert (!ps->LEVEL);
-#endif
- }
-
- if (need_to_reduce (ps))
- reduce (ps, 50);
-
- if (ps->conflicts >= ps->lrestart && ps->LEVEL > 2)
- restart (ps);
-
- decide (ps);
- if (ps->failed_assumption)
- return PICOSAT_UNSATISFIABLE;
- count++;
- }
-}
-
-static void
-rebias (PS * ps)
-{
- Cls ** p, * c;
- Var * v;
-
- for (v = ps->vars + 1; v <= ps->vars + ps->max_var; v++)
- v->assigned = 0;
-
- memset (ps->jwh, 0, 2 * (ps->max_var + 1) * sizeof *ps->jwh);
-
- for (p = ps->oclauses; p < ps->ohead; p++)
- {
- c = *p;
-
- if (!c)
- continue;
-
- if (c->learned)
- continue;
-
- incjwh (ps, c);
- }
-}
-
-#ifdef TRACE
-
-static unsigned
-core (PS * ps)
-{
- unsigned idx, prev, this, delta, i, lcore, vcore;
- unsigned *stack, *shead, *eos;
- Lit **q, **eol, *lit;
- Cls *c, *reason;
- Znt *p, byte;
- Zhn *zhain;
- Var *v;
-
- assert (ps->trace);
-
- assert (ps->mtcls || ps->failed_assumption);
- if (ps->ocore >= 0)
- return ps->ocore;
-
- lcore = ps->ocore = vcore = 0;
-
- stack = shead = eos = 0;
- ENLARGE (stack, shead, eos);
-
- if (ps->mtcls)
- {
- idx = CLS2IDX (ps->mtcls);
- *shead++ = idx;
- }
- else
- {
- assert (ps->failed_assumption);
- v = LIT2VAR (ps->failed_assumption);
- reason = v->reason;
- assert (reason);
- idx = CLS2IDX (reason);
- *shead++ = idx;
- }
-
- while (shead > stack)
- {
- idx = *--shead;
- zhain = IDX2ZHN (idx);
-
- if (zhain)
- {
- if (zhain->core)
- continue;
-
- zhain->core = 1;
- lcore++;
-
- c = IDX2CLS (idx);
- if (c)
- {
- assert (!c->core);
- c->core = 1;
- }
-
- i = 0;
- delta = 0;
- prev = 0;
- for (p = zhain->znt; (byte = *p); p++, i += 7)
- {
- delta |= (byte & 0x7f) << i;
- if (byte & 0x80)
- continue;
-
- this = prev + delta;
- assert (prev < this); /* no overflow */
-
- if (shead == eos)
- ENLARGE (stack, shead, eos);
- *shead++ = this;
-
- prev = this;
- delta = 0;
- i = -7;
- }
- }
- else
- {
- c = IDX2CLS (idx);
-
- assert (c);
- assert (!c->learned);
-
- if (c->core)
- continue;
-
- c->core = 1;
- ps->ocore++;
-
- eol = end_of_lits (c);
- for (q = c->lits; q < eol; q++)
- {
- lit = *q;
- v = LIT2VAR (lit);
- if (v->core)
- continue;
-
- v->core = 1;
- vcore++;
-
- if (!ps->failed_assumption) continue;
- if (lit != ps->failed_assumption) continue;
-
- reason = v->reason;
- if (!reason) continue;
- if (reason->core) continue;
-
- idx = CLS2IDX (reason);
- if (shead == eos)
- ENLARGE (stack, shead, eos);
- *shead++ = idx;
- }
- }
- }
-
- DELETEN (stack, eos - stack);
-
- if (ps->verbosity)
- fprintf (ps->out,
- "%s%u core variables out of %u (%.1f%%)\n"
- "%s%u core original clauses out of %u (%.1f%%)\n"
- "%s%u core learned clauses out of %u (%.1f%%)\n",
- ps->prefix, vcore, ps->max_var, PERCENT (vcore, ps->max_var),
- ps->prefix, ps->ocore, ps->oadded, PERCENT (ps->ocore, ps->oadded),
- ps->prefix, lcore, ps->ladded, PERCENT (lcore, ps->ladded));
-
- return ps->ocore;
-}
-
-static void
-trace_lits (PS * ps, Cls * c, FILE * file)
-{
- Lit **p, **eol = end_of_lits (c);
-
- assert (c);
- assert (c->core);
-
- for (p = c->lits; p < eol; p++)
- fprintf (file, "%d ", LIT2INT (*p));
-
- fputc ('0', file);
-}
-
-static void
-write_idx (PS * ps, unsigned idx, FILE * file)
-{
- fprintf (file, "%ld", EXPORTIDX (idx));
-}
-
-static void
-trace_clause (PS * ps, unsigned idx, Cls * c, FILE * file, int fmt)
-{
- assert (c);
- assert (c->core);
- assert (fmt == RUP_TRACE_FMT || !c->learned);
- assert (CLS2IDX (c) == idx);
-
- if (fmt != RUP_TRACE_FMT)
- {
- write_idx (ps, idx, file);
- fputc (' ', file);
- }
-
- trace_lits (ps, c, file);
-
- if (fmt != RUP_TRACE_FMT)
- fputs (" 0", file);
-
- fputc ('\n', file);
-}
-
-static void
-trace_zhain (PS * ps, unsigned idx, Zhn * zhain, FILE * file, int fmt)
-{
- unsigned prev, this, delta, i;
- Znt *p, byte;
- Cls * c;
-
- assert (zhain);
- assert (zhain->core);
-
- write_idx (ps, idx, file);
- fputc (' ', file);
-
- if (fmt == EXTENDED_TRACECHECK_TRACE_FMT)
- {
- c = IDX2CLS (idx);
- assert (c);
- trace_lits (ps, c, file);
- }
- else
- {
- assert (fmt == COMPACT_TRACECHECK_TRACE_FMT);
- putc ('*', file);
- }
-
- i = 0;
- delta = 0;
- prev = 0;
-
- for (p = zhain->znt; (byte = *p); p++, i += 7)
- {
- delta |= (byte & 0x7f) << i;
- if (byte & 0x80)
- continue;
-
- this = prev + delta;
-
- putc (' ', file);
- write_idx (ps, this, file);
-
- prev = this;
- delta = 0;
- i = -7;
- }
-
- fputs (" 0\n", file);
-}
-
-static void
-write_core (PS * ps, FILE * file)
-{
- Lit **q, **eol;
- Cls **p, *c;
-
- fprintf (file, "p cnf %u %u\n", ps->max_var, core (ps));
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
-
- if (!c || c->learned || !c->core)
- continue;
-
- eol = end_of_lits (c);
- for (q = c->lits; q < eol; q++)
- fprintf (file, "%d ", LIT2INT (*q));
-
- fputs ("0\n", file);
- }
-}
-
-#endif
-
-static void
-write_trace (PS * ps, FILE * file, int fmt)
-{
-#ifdef TRACE
- Cls *c, ** p;
- Zhn *zhain;
- unsigned i;
-
- core (ps);
-
- if (fmt == RUP_TRACE_FMT)
- {
- ps->rupvariables = picosat_variables (ps),
- ps->rupclauses = picosat_added_original_clauses (ps);
- write_rup_header (ps, file);
- }
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
-
- if (ps->oclauses <= p && p < ps->eoo)
- {
- i = OIDX2IDX (p - ps->oclauses);
- assert (!c || CLS2IDX (c) == i);
- }
- else
- {
- assert (ps->lclauses <= p && p < ps->EOL);
- i = LIDX2IDX (p - ps->lclauses);
- }
-
- zhain = IDX2ZHN (i);
-
- if (zhain)
- {
- if (zhain->core)
- {
- if (fmt == RUP_TRACE_FMT)
- trace_clause (ps,i, c, file, fmt);
- else
- trace_zhain (ps, i, zhain, file, fmt);
- }
- }
- else if (c)
- {
- if (fmt != RUP_TRACE_FMT && c)
- {
- if (c->core)
- trace_clause (ps, i, c, file, fmt);
- }
- }
- }
-#else
- (void) file;
- (void) fmt;
- (void) ps;
-#endif
-}
-
-static void
-write_core_wrapper (PS * ps, FILE * file, int fmt)
-{
- (void) fmt;
-#ifdef TRACE
- write_core (ps, file);
-#else
- (void) ps;
- (void) file;
-#endif
-}
-
-static Lit *
-import_lit (PS * ps, int lit, int nointernal)
-{
- Lit * res;
- Var * v;
-
- ABORTIF (lit == INT_MIN, "API usage: INT_MIN literal");
- ABORTIF (abs (lit) > (int) ps->max_var && ps->CLS != ps->clshead,
- "API usage: new variable index after 'picosat_push'");
-
- if (abs (lit) <= (int) ps->max_var)
- {
- res = int2lit (ps, lit);
- v = LIT2VAR (res);
- if (nointernal && v->internal)
- ABORT ("API usage: trying to import invalid literal");
- else if (!nointernal && !v->internal)
- ABORT ("API usage: trying to import invalid context");
- }
- else
- {
- while (abs (lit) > (int) ps->max_var)
- inc_max_var (ps);
- res = int2lit (ps, lit);
- }
-
- return res;
-}
-
-#ifdef TRACE
-static void
-reset_core (PS * ps)
-{
- Cls ** p, * c;
- Zhn ** q, * z;
- unsigned i;
-
- for (i = 1; i <= ps->max_var; i++)
- ps->vars[i].core = 0;
-
- for (p = SOC; p != EOC; p = NXC (p))
- if ((c = *p))
- c->core = 0;
-
- for (q = ps->zhains; q != ps->zhead; q++)
- if ((z = *q))
- z->core = 0;
-
- ps->ocore = -1;
-}
-#endif
-
-static void
-reset_assumptions (PS * ps)
-{
- Lit ** p;
-
- ps->failed_assumption = 0;
-
- if (ps->extracted_all_failed_assumptions)
- {
- for (p = ps->als; p < ps->alshead; p++)
- LIT2VAR (*p)->failed = 0;
-
- ps->extracted_all_failed_assumptions = 0;
- }
-
- ps->alstail = ps->alshead = ps->als;
- ps->adecidelevel = 0;
-}
-
-static INLINE void
-check_ready (PS * ps)
-{
- ABORTIF (!ps || ps->state == RESET, "API usage: uninitialized");
-}
-
-static INLINE void
-check_sat_state (PS * ps)
-{
- ABORTIF (ps->state != SAT, "API usage: expected to be in SAT state");
-}
-
-static INLINE void
-check_unsat_state (PS * ps)
-{
- ABORTIF (ps->state != UNSAT, "API usage: expected to be in UNSAT state");
-}
-
-static INLINE void
-check_sat_or_unsat_or_unknown_state (PS * ps)
-{
- ABORTIF (ps->state != SAT && ps->state != UNSAT && ps->state != UNKNOWN,
- "API usage: expected to be in SAT, UNSAT, or UNKNOWN state");
-}
-
-static void
-reset_partial (PS * ps)
-{
- unsigned idx;
- if (!ps->partial)
- return;
- for (idx = 1; idx <= ps->max_var; idx++)
- ps->vars[idx].partial = 0;
- ps->partial = 0;
-}
-
-static void
-reset_incremental_usage (PS * ps)
-{
- unsigned num_non_false;
- Lit * lit, ** q;
-
- check_sat_or_unsat_or_unknown_state (ps);
-
- LOG ( fprintf (ps->out, "%sRESET incremental usage\n", ps->prefix));
-
- if (ps->LEVEL)
- undo (ps, 0);
-
- reset_assumptions (ps);
-
- if (ps->conflict)
- {
- num_non_false = 0;
- for (q = ps->conflict->lits; q < end_of_lits (ps->conflict); q++)
- {
- lit = *q;
- if (lit->val != FALSE)
- num_non_false++;
- }
-
- // assert (num_non_false >= 2); // TODO: why this assertion?
-#ifdef NO_BINARY_CLAUSES
- if (ps->conflict == &ps->cimpl)
- resetcimpl (ps);
-#endif
-#ifndef NADC
- if (ps->conflict == ps->adoconflict)
- resetadoconflict (ps);
-#endif
- ps->conflict = 0;
- }
-
-#ifdef TRACE
- reset_core (ps);
-#endif
-
- reset_partial (ps);
-
- ps->saved_flips = ps->flips;
- ps->min_flipped = UINT_MAX;
- ps->saved_max_var = ps->max_var;
-
- ps->state = READY;
-}
-
-static void
-enter (PS * ps)
-{
- if (ps->nentered++)
- return;
-
- check_ready (ps);
- ps->entered = picosat_time_stamp ();
-}
-
-static INLINE void
-leave (PS * ps)
-{
- assert (ps->nentered);
- if (--ps->nentered)
- return;
-
- sflush (ps);
-}
-
-static void
-check_trace_support_and_execute (PS * ps,
- FILE * file,
- void (*f)(PS*,FILE*,int), int fmt)
-{
- check_ready (ps);
- check_unsat_state (ps);
-#ifdef TRACE
- ABORTIF (!ps->trace, "API usage: tracing disabled");
- enter (ps);
- f (ps, file, fmt);
- leave (ps);
-#else
- (void) file;
- (void) fmt;
- (void) f;
- ABORT ("compiled without trace support");
-#endif
-}
-
-static void
-extract_all_failed_assumptions (PS * ps)
-{
- Lit ** p, ** eol;
- Var * v, * u;
- int pos;
- Cls * c;
-
- assert (!ps->extracted_all_failed_assumptions);
-
- assert (ps->failed_assumption);
- assert (ps->mhead == ps->marked);
-
- if (ps->marked == ps->eom)
- ENLARGE (ps->marked, ps->mhead, ps->eom);
-
- v = LIT2VAR (ps->failed_assumption);
- mark_var (ps, v);
- pos = 0;
-
- while (pos < ps->mhead - ps->marked)
- {
- v = ps->marked[pos++];
- assert (v->mark);
- c = var2reason (ps, v);
- if (!c)
- continue;
- eol = end_of_lits (c);
- for (p = c->lits; p < eol; p++)
- {
- u = LIT2VAR (*p);
- if (!u->mark)
- mark_var (ps, u);
- }
-#ifdef NO_BINARY_CLAUSES
- if (c == &ps->impl)
- resetimpl (ps);
-#endif
- }
-
- for (p = ps->als; p < ps->alshead; p++)
- {
- u = LIT2VAR (*p);
- if (!u->mark) continue;
- u->failed = 1;
- LOG ( fprintf (ps->out,
- "%sfailed assumption %d\n",
- ps->prefix, LIT2INT (*p)));
- }
-
- while (ps->mhead > ps->marked)
- (*--ps->mhead)->mark = 0;
-
- ps->extracted_all_failed_assumptions = 1;
-}
-
-const char *
-picosat_copyright (void)
-{
- return "Copyright (c) 2006 - 2014 Armin Biere JKU Linz";
-}
-
-PicoSAT *
-picosat_init (void)
-{
- return init (0, 0, 0, 0);
-}
-
-PicoSAT *
-picosat_minit (void * pmgr,
- picosat_malloc pnew,
- picosat_realloc presize,
- picosat_free pfree)
-{
- ABORTIF (!pnew, "API usage: zero 'picosat_malloc' argument");
- ABORTIF (!presize, "API usage: zero 'picosat_realloc' argument");
- ABORTIF (!pfree, "API usage: zero 'picosat_free' argument");
- return init (pmgr, pnew, presize, pfree);
-}
-
-
-void
-picosat_adjust (PS * ps, int new_max_var)
-{
- unsigned new_size_vars;
-
- ABORTIF (abs (new_max_var) > (int) ps->max_var && ps->CLS != ps->clshead,
- "API usage: adjusting variable index after 'picosat_push'");
- enter (ps);
-
- new_max_var = abs (new_max_var);
- new_size_vars = new_max_var + 1;
-
- if (ps->size_vars < new_size_vars)
- enlarge (ps, new_size_vars);
-
- while (ps->max_var < (unsigned) new_max_var)
- inc_max_var (ps);
-
- leave (ps);
-}
-
-int
-picosat_inc_max_var (PS * ps)
-{
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- inc_max_var (ps);
-
- if (ps->measurealltimeinlib)
- leave (ps);
-
- return ps->max_var;
-}
-
-int
-picosat_context (PS * ps)
-{
- return ps->clshead == ps->CLS ? 0 : LIT2INT (ps->clshead[-1]);
-}
-
-int
-picosat_push (PS * ps)
-{
- int res;
- Lit *lit;
- Var * v;
-
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- if (ps->state != READY)
- reset_incremental_usage (ps);
-
- if (ps->rils != ps->rilshead)
- {
- res = *--ps->rilshead;
- assert (ps->vars[res].internal);
- }
- else
- {
- inc_max_var (ps);
- res = ps->max_var;
- v = ps->vars + res;
- assert (!v->internal);
- v->internal = 1;
- ps->internals++;
- LOG ( fprintf (ps->out, "%snew internal variable index %d\n", ps->prefix, res));
- }
-
- lit = int2lit (ps, res);
-
- if (ps->clshead == ps->eocls)
- ENLARGE (ps->CLS, ps->clshead, ps->eocls);
- *ps->clshead++ = lit;
-
- ps->contexts++;
-
- LOG ( fprintf (ps->out, "%snew context %d at depth %ld after push\n",
- ps->prefix, res, (long)(ps->clshead - ps->CLS)));
-
- if (ps->measurealltimeinlib)
- leave (ps);
-
- return res;
-}
-
-int
-picosat_pop (PS * ps)
-{
- Lit * lit;
- int res;
- ABORTIF (ps->CLS == ps->clshead, "API usage: too many 'picosat_pop'");
- ABORTIF (ps->added != ps->ahead, "API usage: incomplete clause");
-
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- if (ps->state != READY)
- reset_incremental_usage (ps);
-
- assert (ps->CLS < ps->clshead);
- lit = *--ps->clshead;
- LOG ( fprintf (ps->out, "%sclosing context %d at depth %ld after pop\n",
- ps->prefix, LIT2INT (lit), (long)(ps->clshead - ps->CLS) + 1));
-
- if (ps->cilshead == ps->eocils)
- ENLARGE (ps->cils, ps->cilshead, ps->eocils);
- *ps->cilshead++ = LIT2INT (lit);
-
- if (ps->cilshead - ps->cils > MAXCILS) {
- LOG ( fprintf (ps->out,
- "%srecycling %ld interals with forced simplification\n",
- ps->prefix, (long)(ps->cilshead - ps->cils)));
- simplify (ps, 1);
- }
-
- res = picosat_context (ps);
- if (res)
- LOG ( fprintf (ps->out, "%snew context %d at depth %ld after pop\n",
- ps->prefix, res, (long)(ps->clshead - ps->CLS)));
- else
- LOG ( fprintf (ps->out, "%souter most context reached after pop\n", ps->prefix));
-
- if (ps->measurealltimeinlib)
- leave (ps);
-
- return res;
-}
-
-void
-picosat_set_verbosity (PS * ps, int new_verbosity_level)
-{
- check_ready (ps);
- ps->verbosity = new_verbosity_level;
-}
-
-void
-picosat_set_plain (PS * ps, int new_plain_value)
-{
- check_ready (ps);
- ps->plain = new_plain_value;
-}
-
-int
-picosat_enable_trace_generation (PS * ps)
-{
- int res = 0;
- check_ready (ps);
-#ifdef TRACE
- ABORTIF (ps->addedclauses,
- "API usage: trace generation enabled after adding clauses");
- res = ps->trace = 1;
-#endif
- return res;
-}
-
-void
-picosat_set_incremental_rup_file (PS * ps, FILE * rup_file, int m, int n)
-{
- check_ready (ps);
- assert (!ps->rupstarted);
- ps->rup = rup_file;
- ps->rupvariables = m;
- ps->rupclauses = n;
-}
-
-void
-picosat_set_output (PS * ps, FILE * output_file)
-{
- check_ready (ps);
- ps->out = output_file;
-}
-
-void
-picosat_measure_all_calls (PS * ps)
-{
- check_ready (ps);
- ps->measurealltimeinlib = 1;
-}
-
-void
-picosat_set_prefix (PS * ps, const char * str)
-{
- check_ready (ps);
- new_prefix (ps, str);
-}
-
-void
-picosat_set_seed (PS * ps, unsigned s)
-{
- check_ready (ps);
- ps->srng = s;
-}
-
-void
-picosat_reset (PS * ps)
-{
- check_ready (ps);
- reset (ps);
-}
-
-int
-picosat_add (PS * ps, int int_lit)
-{
- int res = ps->oadded;
- Lit *lit;
-
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- ABORTIF (ps->rup && ps->rupstarted && ps->oadded >= (unsigned)ps->rupclauses,
- "API usage: adding too many clauses after RUP header written");
-#ifndef NADC
- ABORTIF (ps->addingtoado,
- "API usage: 'picosat_add' and 'picosat_add_ado_lit' mixed");
-#endif
- if (ps->state != READY)
- reset_incremental_usage (ps);
-
- if (ps->saveorig)
- {
- if (ps->sohead == ps->eoso)
- ENLARGE (ps->soclauses, ps->sohead, ps->eoso);
-
- *ps->sohead++ = int_lit;
- }
-
- if (int_lit)
- {
- lit = import_lit (ps, int_lit, 1);
- add_lit (ps, lit);
- }
- else
- simplify_and_add_original_clause (ps);
-
- if (ps->measurealltimeinlib)
- leave (ps);
-
- return res;
-}
-
-int
-picosat_add_arg (PS * ps, ...)
-{
- int lit;
- va_list ap;
- va_start (ap, ps);
- while ((lit = va_arg (ap, int)))
- (void) picosat_add (ps, lit);
- va_end (ap);
- return picosat_add (ps, 0);
-}
-
-int
-picosat_add_lits (PS * ps, int * lits)
-{
- const int * p;
- int lit;
- for (p = lits; (lit = *p); p++)
- (void) picosat_add (ps, lit);
- return picosat_add (ps, 0);
-}
-
-void
-picosat_add_ado_lit (PS * ps, int external_lit)
-{
-#ifndef NADC
- Lit * internal_lit;
-
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- if (ps->state != READY)
- reset_incremental_usage (ps);
-
- ABORTIF (!ps->addingtoado && ps->ahead > ps->added,
- "API usage: 'picosat_add' and 'picosat_add_ado_lit' mixed");
-
- if (external_lit)
- {
- ps->addingtoado = 1;
- internal_lit = import_lit (ps, external_lit, 1);
- add_lit (ps, internal_lit);
- }
- else
- {
- ps->addingtoado = 0;
- add_ado (ps);
- }
- if (ps->measurealltimeinlib)
- leave (ps);
-#else
- (void) ps;
- (void) external_lit;
- ABORT ("compiled without all different constraint support");
-#endif
-}
-
-static void
-assume (PS * ps, Lit * lit)
-{
- if (ps->alshead == ps->eoals)
- {
- assert (ps->alstail == ps->als);
- ENLARGE (ps->als, ps->alshead, ps->eoals);
- ps->alstail = ps->als;
- }
-
- *ps->alshead++ = lit;
- LOG ( fprintf (ps->out, "%sassumption %d\n", ps->prefix, LIT2INT (lit)));
-}
-
-static void
-assume_contexts (PS * ps)
-{
- Lit ** p;
- if (ps->als != ps->alshead)
- return;
- for (p = ps->CLS; p != ps->clshead; p++)
- assume (ps, *p);
-}
-
-#ifndef RCODE
-static const char * enumstr (int i) {
- int last = INT_MOD(i, 10);
- if (last == 1) return "st";
- if (last == 2) return "nd";
- if (last == 3) return "rd";
- return "th";
-}
-#endif
-
-static int
-tderef (PS * ps, int int_lit)
-{
- Lit * lit;
- Var * v;
-
- assert (abs (int_lit) <= (int) ps->max_var);
-
- lit = int2lit (ps, int_lit);
-
- v = LIT2VAR (lit);
- if (v->level > 0)
- return 0;
-
- if (lit->val == TRUE)
- return 1;
-
- if (lit->val == FALSE)
- return -1;
-
- return 0;
-}
-
-static int
-pderef (PS * ps, int int_lit)
-{
- Lit * lit;
- Var * v;
-
- assert (abs (int_lit) <= (int) ps->max_var);
-
- v = ps->vars + abs (int_lit);
- if (!v->partial)
- return 0;
-
- lit = int2lit (ps, int_lit);
-
- if (lit->val == TRUE)
- return 1;
-
- if (lit->val == FALSE)
- return -1;
-
- return 0;
-}
-
-static void
-minautarky (PS * ps)
-{
- unsigned * occs, maxoccs, tmpoccs, npartial;
- int * p, * c, lit, best, val;
-#ifdef LOGGING
- int tl;
-#endif
-
- assert (!ps->partial);
-
- npartial = 0;
-
- NEWN (occs, 2*ps->max_var + 1);
- CLRN (occs, 2*ps->max_var + 1);
- occs += ps->max_var;
- for (p = ps->soclauses; p < ps->sohead; p++)
- occs[*p]++;
- assert (occs[0] == ps->oadded);
-
- for (c = ps->soclauses; c < ps->sohead; c = p + 1)
- {
-#ifdef LOGGING
- tl = 0;
-#endif
- best = 0;
- maxoccs = 0;
- for (p = c; (lit = *p); p++)
- {
- val = tderef (ps, lit);
- if (val < 0)
- continue;
- if (val > 0)
- {
-#ifdef LOGGING
- tl = 1;
-#endif
- best = lit;
- maxoccs = occs[lit];
- }
-
- val = pderef (ps, lit);
- if (val > 0)
- break;
- if (val < 0)
- continue;
- val = int2lit (ps, lit)->val;
- assert (val);
- if (val < 0)
- continue;
- tmpoccs = occs[lit];
- if (best && tmpoccs <= maxoccs)
- continue;
- best = lit;
- maxoccs = tmpoccs;
- }
- if (!lit)
- {
- assert (best);
- LOG ( fprintf (ps->out, "%sautark %d with %d occs%s\n",
- ps->prefix, best, maxoccs, tl ? " (top)" : ""));
- ps->vars[abs (best)].partial = 1;
- npartial++;
- }
- for (p = c; (lit = *p); p++)
- {
- assert (occs[lit] > 0);
- occs[lit]--;
- }
- }
- occs -= ps->max_var;
- DELETEN (occs, 2*ps->max_var + 1);
- ps->partial = 1;
-
- if (ps->verbosity)
- fprintf (ps->out,
- "%sautarky of size %u out of %u satisfying all clauses (%.1f%%)\n",
- ps->prefix, npartial, ps->max_var, PERCENT (npartial, ps->max_var));
-}
-
-void
-picosat_assume (PS * ps, int int_lit)
-{
- Lit *lit;
-
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- if (ps->state != READY)
- reset_incremental_usage (ps);
-
- assume_contexts (ps);
- lit = import_lit (ps, int_lit, 1);
- assume (ps, lit);
-
- if (ps->measurealltimeinlib)
- leave (ps);
-}
-
-int
-picosat_sat (PS * ps, int l)
-{
- int res;
- char ch;
-
- enter (ps);
-
- ps->calls++;
- LOG ( fprintf (ps->out, "%sSTART call %u\n", ps->prefix, ps->calls));
-
- if (ps->added < ps->ahead)
- {
-#ifndef NADC
- if (ps->addingtoado)
- ABORT ("API usage: incomplete all different constraint");
- else
-#endif
- ABORT ("API usage: incomplete clause");
- }
-
- if (ps->state != READY)
- reset_incremental_usage (ps);
-
- assume_contexts (ps);
-
- res = sat (ps, l);
-
- assert (ps->state == READY);
-
- switch (res)
- {
- case PICOSAT_UNSATISFIABLE:
- ch = '0';
- ps->state = UNSAT;
- break;
- case PICOSAT_SATISFIABLE:
- ch = '1';
- ps->state = SAT;
- break;
- default:
- ch = '?';
- ps->state = UNKNOWN;
- break;
- }
-
- if (ps->verbosity)
- {
- report (ps, 1, ch);
- rheader (ps);
- }
-
- leave (ps);
- LOG ( fprintf (ps->out, "%sEND call %u result %d\n", ps->prefix, ps->calls, res));
-
- ps->last_sat_call_result = res;
-
- return res;
-}
-
-int
-picosat_res (PS * ps)
-{
- return ps->last_sat_call_result;
-}
-
-int
-picosat_deref (PS * ps, int int_lit)
-{
- Lit *lit;
-
- check_ready (ps);
- check_sat_state (ps);
- ABORTIF (!int_lit, "API usage: can not deref zero literal");
- ABORTIF (ps->mtcls, "API usage: deref after empty clause generated");
-
-#ifdef STATS
- ps->derefs++;
-#endif
-
- if (abs (int_lit) > (int) ps->max_var)
- return 0;
-
- lit = int2lit (ps, int_lit);
-
- if (lit->val == TRUE)
- return 1;
-
- if (lit->val == FALSE)
- return -1;
-
- return 0;
-}
-
-int
-picosat_deref_toplevel (PS * ps, int int_lit)
-{
- check_ready (ps);
- ABORTIF (!int_lit, "API usage: can not deref zero literal");
-
-#ifdef STATS
- ps->derefs++;
-#endif
- if (abs (int_lit) > (int) ps->max_var)
- return 0;
-
- return tderef (ps, int_lit);
-}
-
-int
-picosat_inconsistent (PS * ps)
-{
- check_ready (ps);
- return ps->mtcls != 0;
-}
-
-int
-picosat_corelit (PS * ps, int int_lit)
-{
- check_ready (ps);
- check_unsat_state (ps);
- ABORTIF (!int_lit, "API usage: zero literal can not be in core");
-
- assert (ps->mtcls || ps->failed_assumption);
-
-#ifdef TRACE
- {
- int res = 0;
- ABORTIF (!ps->trace, "tracing disabled");
- if (ps->measurealltimeinlib)
- enter (ps);
- core (ps);
- if (abs (int_lit) <= (int) ps->max_var)
- res = ps->vars[abs (int_lit)].core;
- assert (!res || ps->failed_assumption || ps->vars[abs (int_lit)].used);
- if (ps->measurealltimeinlib)
- leave (ps);
- return res;
- }
-#else
- ABORT ("compiled without trace support");
- return 0;
-#endif
-}
-
-int
-picosat_coreclause (PS * ps, int ocls)
-{
- check_ready (ps);
- check_unsat_state (ps);
-
- ABORTIF (ocls < 0, "API usage: negative original clause index");
- ABORTIF (ocls >= (int)ps->oadded, "API usage: original clause index exceeded");
-
- assert (ps->mtcls || ps->failed_assumption);
-
-#ifdef TRACE
- {
- Cls ** clsptr, * c;
- int res = 0;
-
- ABORTIF (!ps->trace, "tracing disabled");
- if (ps->measurealltimeinlib)
- enter (ps);
- core (ps);
- clsptr = ps->oclauses + ocls;
- assert (clsptr < ps->ohead);
- c = *clsptr;
- if (c)
- res = c->core;
- if (ps->measurealltimeinlib)
- leave (ps);
-
- return res;
- }
-#else
- ABORT ("compiled without trace support");
- return 0;
-#endif
-}
-
-int
-picosat_failed_assumption (PS * ps, int int_lit)
-{
- Lit * lit;
- Var * v;
- ABORTIF (!int_lit, "API usage: zero literal as assumption");
- check_ready (ps);
- check_unsat_state (ps);
- if (ps->mtcls)
- return 0;
- assert (ps->failed_assumption);
- if (abs (int_lit) > (int) ps->max_var)
- return 0;
- if (!ps->extracted_all_failed_assumptions)
- extract_all_failed_assumptions (ps);
- lit = import_lit (ps, int_lit, 1);
- v = LIT2VAR (lit);
- return v->failed;
-}
-
-int
-picosat_failed_context (PS * ps, int int_lit)
-{
- Lit * lit;
- Var * v;
- ABORTIF (!int_lit, "API usage: zero literal as context");
- ABORTIF (abs (int_lit) > (int) ps->max_var, "API usage: invalid context");
- check_ready (ps);
- check_unsat_state (ps);
- assert (ps->failed_assumption);
- if (!ps->extracted_all_failed_assumptions)
- extract_all_failed_assumptions (ps);
- lit = import_lit (ps, int_lit, 0);
- v = LIT2VAR (lit);
- return v->failed;
-}
-
-const int *
-picosat_failed_assumptions (PS * ps)
-{
- Lit ** p, * lit;
- Var * v;
- int ilit;
-
- ps->falshead = ps->fals;
- check_ready (ps);
- check_unsat_state (ps);
- if (!ps->mtcls)
- {
- assert (ps->failed_assumption);
- if (!ps->extracted_all_failed_assumptions)
- extract_all_failed_assumptions (ps);
-
- for (p = ps->als; p < ps->alshead; p++)
- {
- lit = *p;
- v = LIT2VAR (*p);
- if (!v->failed)
- continue;
- ilit = LIT2INT (lit);
- if (ps->falshead == ps->eofals)
- ENLARGE (ps->fals, ps->falshead, ps->eofals);
- *ps->falshead++ = ilit;
- }
- }
- if (ps->falshead == ps->eofals)
- ENLARGE (ps->fals, ps->falshead, ps->eofals);
- *ps->falshead++ = 0;
- return ps->fals;
-}
-
-const int *
-picosat_mus_assumptions (PS * ps, void * s, void (*cb)(void*,const int*), int fix)
-{
- int i, j, ilit, len, nwork, * work, res;
- signed char * redundant;
- Lit ** p, * lit;
- int failed;
- Var * v;
-#ifndef NDEBUG
- int oldlen;
-#endif
-#ifndef RCODE
- int norig = ps->alshead - ps->als;
-#endif
-
- check_ready (ps);
- check_unsat_state (ps);
- len = 0;
- if (!ps->mtcls)
- {
- assert (ps->failed_assumption);
- if (!ps->extracted_all_failed_assumptions)
- extract_all_failed_assumptions (ps);
-
- for (p = ps->als; p < ps->alshead; p++)
- if (LIT2VAR (*p)->failed)
- len++;
- }
-
- if (ps->mass)
- DELETEN (ps->mass, ps->szmass);
- ps->szmass = len + 1;
- NEWN (ps->mass, ps->szmass);
-
- i = 0;
- for (p = ps->als; p < ps->alshead; p++)
- {
- lit = *p;
- v = LIT2VAR (lit);
- if (!v->failed)
- continue;
- ilit = LIT2INT (lit);
- assert (i < len);
- ps->mass[i++] = ilit;
- }
- assert (i == len);
- ps->mass[i] = 0;
- if (ps->verbosity)
- fprintf (ps->out,
- "%sinitial set of failed assumptions of size %d out of %d (%.0f%%)\n",
- ps->prefix, len, norig, PERCENT (len, norig));
- if (cb)
- cb (s, ps->mass);
-
- nwork = len;
- NEWN (work, nwork);
- for (i = 0; i < len; i++)
- work[i] = ps->mass[i];
-
- NEWN (redundant, nwork);
- CLRN (redundant, nwork);
-
- for (i = 0; i < nwork; i++)
- {
- if (redundant[i])
- continue;
-
- if (ps->verbosity > 1)
- fprintf (ps->out,
- "%strying to drop %d%s assumption %d\n",
- ps->prefix, i, enumstr (i), work[i]);
- for (j = 0; j < nwork; j++)
- {
- if (i == j) continue;
- if (j < i && fix) continue;
- if (redundant[j]) continue;
- picosat_assume (ps, work[j]);
- }
-
- res = picosat_sat (ps, -1);
- if (res == 10)
- {
- if (ps->verbosity > 1)
- fprintf (ps->out,
- "%sfailed to drop %d%s assumption %d\n",
- ps->prefix, i, enumstr (i), work[i]);
-
- if (fix)
- {
- picosat_add (ps, work[i]);
- picosat_add (ps, 0);
- }
- }
- else
- {
- assert (res == 20);
- if (ps->verbosity > 1)
- fprintf (ps->out,
- "%ssuceeded to drop %d%s assumption %d\n",
- ps->prefix, i, enumstr (i), work[i]);
- redundant[i] = 1;
- for (j = 0; j < nwork; j++)
- {
- failed = picosat_failed_assumption (ps, work[j]);
- if (j <= i)
- {
- assert ((j < i && fix) || redundant[j] == !failed);
- continue;
- }
-
- if (!failed)
- {
- redundant[j] = -1;
- if (ps->verbosity > 1)
- fprintf (ps->out,
- "%salso suceeded to drop %d%s assumption %d\n",
- ps->prefix, j, enumstr (j), work[j]);
- }
- }
-
-#ifndef NDEBUG
- oldlen = len;
-#endif
- len = 0;
- for (j = 0; j < nwork; j++)
- if (!redundant[j])
- ps->mass[len++] = work[j];
- ps->mass[len] = 0;
- assert (len < oldlen);
-
- if (fix)
- {
- picosat_add (ps, -work[i]);
- picosat_add (ps, 0);
- }
-
-#ifndef NDEBUG
- for (j = 0; j <= i; j++)
- assert (redundant[j] >= 0);
-#endif
- for (j = i + 1; j < nwork; j++)
- {
- if (redundant[j] >= 0)
- continue;
-
- if (fix)
- {
- picosat_add (ps, -work[j]);
- picosat_add (ps, 0);
- }
-
- redundant[j] = 1;
- }
-
- if (ps->verbosity)
- fprintf (ps->out,
- "%sreduced set of failed assumptions of size %d out of %d (%.0f%%)\n",
- ps->prefix, len, norig, PERCENT (len, norig));
- if (cb)
- cb (s, ps->mass);
- }
- }
-
- DELETEN (work, nwork);
- DELETEN (redundant, nwork);
-
- if (ps->verbosity)
- {
- fprintf (ps->out, "%sreinitializing unsat state\n", ps->prefix);
- fflush (ps->out);
- }
-
- for (i = 0; i < len; i++)
- picosat_assume (ps, ps->mass[i]);
-
-#ifndef NDEBUG
- res =
-#endif
- picosat_sat (ps, -1);
- assert (res == 20);
-
- if (!ps->mtcls)
- {
- assert (!ps->extracted_all_failed_assumptions);
- extract_all_failed_assumptions (ps);
- }
-
- return ps->mass;
-}
-
-static const int *
-mss (PS * ps, int * a, int size)
-{
- int i, j, k, res;
-
- assert (!ps->mtcls);
-
- if (ps->szmssass)
- DELETEN (ps->mssass, ps->szmssass);
-
- ps->szmssass = 0;
- ps->mssass = 0;
-
- ps->szmssass = size + 1;
- NEWN (ps->mssass, ps->szmssass);
-
- LOG ( fprintf (ps->out, "%ssearch MSS over %d assumptions\n", ps->prefix, size));
-
- k = 0;
- for (i = k; i < size; i++)
- {
- for (j = 0; j < k; j++)
- picosat_assume (ps, ps->mssass[j]);
-
- LOG ( fprintf (ps->out,
- "%strying to add assumption %d to MSS : %d\n",
- ps->prefix, i, a[i]));
-
- picosat_assume (ps, a[i]);
-
- res = picosat_sat (ps, -1);
- if (res == 10)
- {
- LOG ( fprintf (ps->out,
- "%sadding assumption %d to MSS : %d\n", ps->prefix, i, a[i]));
-
- ps->mssass[k++] = a[i];
-
- for (j = i + 1; j < size; j++)
- {
- if (picosat_deref (ps, a[j]) <= 0)
- continue;
-
- LOG ( fprintf (ps->out,
- "%salso adding assumption %d to MSS : %d\n",
- ps->prefix, j, a[j]));
-
- ps->mssass[k++] = a[j];
-
- if (++i != j)
- {
- int tmp = a[i];
- a[i] = a[j];
- a[j] = tmp;
- }
- }
- }
- else
- {
- assert (res == 20);
-
- LOG ( fprintf (ps->out,
- "%signoring assumption %d in MSS : %d\n", ps->prefix, i, a[i]));
- }
- }
- ps->mssass[k] = 0;
- LOG ( fprintf (ps->out, "%sfound MSS of size %d\n", ps->prefix, k));
-
- return ps->mssass;
-}
-
-static void
-reassume (PS * ps, const int * a, int size)
-{
- int i;
- LOG ( fprintf (ps->out, "%sreassuming all assumptions\n", ps->prefix));
- for (i = 0; i < size; i++)
- picosat_assume (ps, a[i]);
-}
-
-const int *
-picosat_maximal_satisfiable_subset_of_assumptions (PS * ps)
-{
- const int * res;
- int i, *a, size;
-
- ABORTIF (ps->mtcls,
- "API usage: CNF inconsistent (use 'picosat_inconsistent')");
-
- enter (ps);
-
- size = ps->alshead - ps->als;
- NEWN (a, size);
-
- for (i = 0; i < size; i++)
- a[i] = LIT2INT (ps->als[i]);
-
- res = mss (ps, a, size);
- reassume (ps, a, size);
-
- DELETEN (a, size);
-
- leave (ps);
-
- return res;
-}
-
-static void
-check_mss_flags_clean (PS * ps)
-{
-#ifndef NDEBUG
- unsigned i;
- for (i = 1; i <= ps->max_var; i++)
- {
- assert (!ps->vars[i].msspos);
- assert (!ps->vars[i].mssneg);
- }
-#else
- (void) ps;
-#endif
-}
-
-static void
-push_mcsass (PS * ps, int lit)
-{
- if (ps->nmcsass == ps->szmcsass)
- {
- ps->szmcsass = ps->szmcsass ? 2*ps->szmcsass : 1;
- RESIZEN (ps->mcsass, ps->nmcsass, ps->szmcsass);
- }
-
- ps->mcsass[ps->nmcsass++] = lit;
-}
-
-static const int *
-next_mss (PS * ps, int mcs)
-{
- int i, *a, size, mssize, mcsize, lit, inmss;
- const int * res, * p;
- Var * v;
-
- if (ps->mtcls) return 0;
-
- check_mss_flags_clean (ps);
-
- if (mcs && ps->mcsass)
- {
- DELETEN (ps->mcsass, ps->szmcsass);
- ps->nmcsass = ps->szmcsass = 0;
- ps->mcsass = 0;
- }
-
- size = ps->alshead - ps->als;
- NEWN (a, size);
-
- for (i = 0; i < size; i++)
- a[i] = LIT2INT (ps->als[i]);
-
- (void) picosat_sat (ps, -1);
-
- //TODO short cut for 'picosat_res () == 10'?
-
- if (ps->mtcls)
- {
- assert (picosat_res (ps) == 20);
- res = 0;
- goto DONE;
- }
-
- res = mss (ps, a, size);
-
- if (ps->mtcls)
- {
- res = 0;
- goto DONE;
- }
-
- for (p = res; (lit = *p); p++)
- {
- v = ps->vars + abs (lit);
- if (lit < 0)
- {
- assert (!v->msspos);
- v->mssneg = 1;
- }
- else
- {
- assert (!v->mssneg);
- v->msspos = 1;
- }
- }
-
- mssize = p - res;
- mcsize = INT_MIN;
-
- for (i = 0; i < size; i++)
- {
- lit = a[i];
- v = ps->vars + abs (lit);
- if (lit > 0 && v->msspos)
- inmss = 1;
- else if (lit < 0 && v->mssneg)
- inmss = 1;
- else
- inmss = 0;
-
- if (mssize < mcsize)
- {
- if (inmss)
- picosat_add (ps, -lit);
- }
- else
- {
- if (!inmss)
- picosat_add (ps, lit);
- }
-
- if (!inmss && mcs)
- push_mcsass (ps, lit);
- }
- picosat_add (ps, 0);
- if (mcs)
- push_mcsass (ps, 0);
-
- for (i = 0; i < size; i++)
- {
- lit = a[i];
- v = ps->vars + abs (lit);
- v->msspos = 0;
- v->mssneg = 0;
- }
-
-DONE:
-
- reassume (ps, a, size);
- DELETEN (a, size);
-
- return res;
-}
-
-const int *
-picosat_next_maximal_satisfiable_subset_of_assumptions (PS * ps)
-{
- const int * res;
- enter (ps);
- res = next_mss (ps, 0);
- leave (ps);
- return res;
-}
-
-const int *
-picosat_next_minimal_correcting_subset_of_assumptions (PS * ps)
-{
- const int * res, * tmp;
- enter (ps);
- tmp = next_mss (ps, 1);
- res = tmp ? ps->mcsass : 0;
- leave (ps);
- return res;
-}
-
-const int *
-picosat_humus (PS * ps,
- void (*callback)(void*state,int nmcs,int nhumus),
- void * state)
-{
- int lit, nmcs, j, nhumus;
- const int * mcs, * p;
- unsigned i;
- Var * v;
- enter (ps);
-#ifndef NDEBUG
- for (i = 1; i <= ps->max_var; i++)
- {
- v = ps->vars + i;
- assert (!v->humuspos);
- assert (!v->humusneg);
- }
-#endif
- nhumus = nmcs = 0;
- while ((mcs = picosat_next_minimal_correcting_subset_of_assumptions (ps)))
- {
- for (p = mcs; (lit = *p); p++)
- {
- v = ps->vars + abs (lit);
- if (lit < 0)
- {
- if (!v->humusneg)
- {
- v->humusneg = 1;
- nhumus++;
- }
- }
- else
- {
- if (!v->humuspos)
- {
- v->humuspos = 1;
- nhumus++;
- }
- }
- }
- nmcs++;
- LOG ( fprintf (ps->out,
- "%smcs %d of size %d humus %d\n",
- ps->prefix, nmcs, (int)(p - mcs), nhumus));
- if (callback)
- callback (state, nmcs, nhumus);
- }
- assert (!ps->szhumus);
- ps->szhumus = 1;
- for (i = 1; i <= ps->max_var; i++)
- {
- v = ps->vars + i;
- if (v->humuspos)
- ps->szhumus++;
- if (v->humusneg)
- ps->szhumus++;
- }
- assert (nhumus + 1 == ps->szhumus);
- NEWN (ps->humus, ps->szhumus);
- j = 0;
- for (i = 1; i <= ps->max_var; i++)
- {
- v = ps->vars + i;
- if (v->humuspos)
- {
- assert (j < nhumus);
- ps->humus[j++] = (int) i;
- }
- if (v->humusneg)
- {
- assert (j < nhumus);
- assert (i < INT_MAX);
- ps->humus[j++] = - (int) i;
- }
- }
- assert (j == nhumus);
- assert (j < ps->szhumus);
- ps->humus[j] = 0;
- leave (ps);
- return ps->humus;
-}
-
-int
-picosat_usedlit (PS * ps, int int_lit)
-{
- int res;
- check_ready (ps);
- check_sat_or_unsat_or_unknown_state (ps);
- ABORTIF (!int_lit, "API usage: zero literal can not be used");
- int_lit = abs (int_lit);
- res = (int_lit <= (int) ps->max_var) ? ps->vars[int_lit].used : 0;
- return res;
-}
-
-void
-picosat_write_clausal_core (PS * ps, FILE * file)
-{
- check_trace_support_and_execute (ps, file, write_core_wrapper, 0);
-}
-
-void
-picosat_write_compact_trace (PS * ps, FILE * file)
-{
- check_trace_support_and_execute (ps, file, write_trace,
- COMPACT_TRACECHECK_TRACE_FMT);
-}
-
-void
-picosat_write_extended_trace (PS * ps, FILE * file)
-{
- check_trace_support_and_execute (ps, file, write_trace,
- EXTENDED_TRACECHECK_TRACE_FMT);
-}
-
-void
-picosat_write_rup_trace (PS * ps, FILE * file)
-{
- check_trace_support_and_execute (ps, file, write_trace, RUP_TRACE_FMT);
-}
-
-size_t
-picosat_max_bytes_allocated (PS * ps)
-{
- check_ready (ps);
- return ps->max_bytes;
-}
-
-void
-picosat_set_propagation_limit (PS * ps, unsigned long long l)
-{
- ps->lpropagations = l;
-}
-
-unsigned long long
-picosat_propagations (PS * ps)
-{
- return ps->propagations;
-}
-
-unsigned long long
-picosat_visits (PS * ps)
-{
- return ps->visits;
-}
-
-unsigned long long
-picosat_decisions (PS * ps)
-{
- return ps->decisions;
-}
-
-int
-picosat_variables (PS * ps)
-{
- check_ready (ps);
- return (int) ps->max_var;
-}
-
-int
-picosat_added_original_clauses (PS * ps)
-{
- check_ready (ps);
- return (int) ps->oadded;
-}
-
-void
-picosat_stats (PS * ps)
-{
-#ifndef RCODE
- unsigned redlits;
-#endif
-#ifdef STATS
- check_ready (ps);
- assert (ps->sdecisions + ps->rdecisions + ps->assumptions == ps->decisions);
-#endif
- if (ps->calls > 1)
- fprintf (ps->out, "%s%u calls\n", ps->prefix, ps->calls);
- if (ps->contexts)
- {
- fprintf (ps->out, "%s%u contexts", ps->prefix, ps->contexts);
-#ifdef STATS
- fprintf (ps->out, " %u internal variables", ps->internals);
-#endif
- fprintf (ps->out, "\n");
- }
- fprintf (ps->out, "%s%u iterations\n", ps->prefix, ps->iterations);
- fprintf (ps->out, "%s%u restarts", ps->prefix, ps->restarts);
-#ifdef STATS
- fprintf (ps->out, " (%u skipped)", ps->skippedrestarts);
-#endif
- fputc ('\n', ps->out);
-#ifndef NFL
- fprintf (ps->out, "%s%u failed literals", ps->prefix, ps->failedlits);
-#ifdef STATS
- fprintf (ps->out,
- ", %u calls, %u rounds, %llu propagations",
- ps->flcalls, ps->flrounds, ps->flprops);
-#endif
- fputc ('\n', ps->out);
-#ifdef STATS
- fprintf (ps->out,
- "%sfl: %u = %.1f%% implicit, %llu oopsed, %llu tried, %llu skipped\n",
- ps->prefix,
- ps->ifailedlits, PERCENT (ps->ifailedlits, ps->failedlits),
- ps->floopsed, ps->fltried, ps->flskipped);
-#endif
-#endif
- fprintf (ps->out, "%s%u conflicts", ps->prefix, ps->conflicts);
-#ifdef STATS
- fprintf (ps->out, " (%u uips = %.1f%%)\n", ps->uips, PERCENT(ps->uips,ps->conflicts));
-#else
- fputc ('\n', ps->out);
-#endif
-#ifndef NADC
- fprintf (ps->out, "%s%u adc conflicts\n", ps->prefix, ps->adoconflicts);
-#endif
-#ifdef STATS
- fprintf (ps->out, "%s%llu dereferenced literals\n", ps->prefix, ps->derefs);
-#endif
- fprintf (ps->out, "%s%u decisions", ps->prefix, ps->decisions);
-#ifdef STATS
- fprintf (ps->out, " (%u random = %.2f%%",
- ps->rdecisions, PERCENT (ps->rdecisions, ps->decisions));
- fprintf (ps->out, ", %u assumptions", ps->assumptions);
- fputc (')', ps->out);
-#endif
- fputc ('\n', ps->out);
-#ifdef STATS
- fprintf (ps->out,
- "%s%u static phase decisions (%.1f%% of all variables)\n",
- ps->prefix,
- ps->staticphasedecisions, PERCENT (ps->staticphasedecisions, ps->max_var));
-#endif
- fprintf (ps->out, "%s%u fixed variables\n", ps->prefix, ps->fixed);
- assert (ps->nonminimizedllits >= ps->minimizedllits);
-#ifndef RCODE
- redlits = ps->nonminimizedllits - ps->minimizedllits;
-#endif
- fprintf (ps->out, "%s%u learned literals\n", ps->prefix, ps->llitsadded);
- fprintf (ps->out, "%s%.1f%% deleted literals\n",
- ps->prefix, PERCENT (redlits, ps->nonminimizedllits));
-
-#ifdef STATS
-#ifdef TRACE
- fprintf (ps->out,
- "%s%llu antecedents (%.1f antecedents per clause",
- ps->prefix, ps->antecedents, AVERAGE (ps->antecedents, ps->conflicts));
- if (ps->trace)
- fprintf (ps->out, ", %.1f bytes/antecedent)", AVERAGE (ps->znts, ps->antecedents));
- fputs (")\n", ps->out);
-#endif
-
- fprintf (ps->out, "%s%llu propagations (%.1f propagations per decision)\n",
- ps->prefix, ps->propagations, AVERAGE (ps->propagations, ps->decisions));
- fprintf (ps->out, "%s%llu visits (%.1f per propagation)\n",
- ps->prefix, ps->visits, AVERAGE (ps->visits, ps->propagations));
- fprintf (ps->out,
- "%s%llu binary clauses visited (%.1f%% %.1f per propagation)\n",
- ps->prefix, ps->bvisits,
- PERCENT (ps->bvisits, ps->visits),
- AVERAGE (ps->bvisits, ps->propagations));
- fprintf (ps->out,
- "%s%llu ternary clauses visited (%.1f%% %.1f per propagation)\n",
- ps->prefix, ps->tvisits,
- PERCENT (ps->tvisits, ps->visits),
- AVERAGE (ps->tvisits, ps->propagations));
- fprintf (ps->out,
- "%s%llu large clauses visited (%.1f%% %.1f per propagation)\n",
- ps->prefix, ps->lvisits,
- PERCENT (ps->lvisits, ps->visits),
- AVERAGE (ps->lvisits, ps->propagations));
- fprintf (ps->out, "%s%llu other true (%.1f%% of visited clauses)\n",
- ps->prefix, ps->othertrue, PERCENT (ps->othertrue, ps->visits));
- fprintf (ps->out,
- "%s%llu other true in binary clauses (%.1f%%)"
- ", %llu upper (%.1f%%)\n",
- ps->prefix, ps->othertrue2, PERCENT (ps->othertrue2, ps->othertrue),
- ps->othertrue2u, PERCENT (ps->othertrue2u, ps->othertrue2));
- fprintf (ps->out,
- "%s%llu other true in large clauses (%.1f%%)"
- ", %llu upper (%.1f%%)\n",
- ps->prefix, ps->othertruel, PERCENT (ps->othertruel, ps->othertrue),
- ps->othertruelu, PERCENT (ps->othertruelu, ps->othertruel));
- fprintf (ps->out, "%s%llu ternary and large traversals (%.1f per visit)\n",
- ps->prefix, ps->traversals, AVERAGE (ps->traversals, ps->visits));
- fprintf (ps->out, "%s%llu large traversals (%.1f per large visit)\n",
- ps->prefix, ps->ltraversals, AVERAGE (ps->ltraversals, ps->lvisits));
- fprintf (ps->out, "%s%llu assignments\n", ps->prefix, ps->assignments);
-#else
- fprintf (ps->out, "%s%llu propagations\n", ps->prefix, picosat_propagations (ps));
- fprintf (ps->out, "%s%llu visits\n", ps->prefix, picosat_visits (ps));
-#endif
- fprintf (ps->out, "%s%.1f%% variables used\n", ps->prefix, PERCENT (ps->vused, ps->max_var));
-
- sflush (ps);
- fprintf (ps->out, "%s%.1f seconds in library\n", ps->prefix, ps->seconds);
- fprintf (ps->out, "%s%.1f megaprops/second\n",
- ps->prefix, AVERAGE (ps->propagations / 1e6f, ps->seconds));
- fprintf (ps->out, "%s%.1f megavisits/second\n",
- ps->prefix, AVERAGE (ps->visits / 1e6f, ps->seconds));
- fprintf (ps->out, "%sprobing %.1f seconds %.0f%%\n",
- ps->prefix, ps->flseconds, PERCENT (ps->flseconds, ps->seconds));
-#ifdef STATS
- fprintf (ps->out,
- "%srecycled %.1f MB in %u reductions\n",
- ps->prefix, ps->rrecycled / (double) (1 << 20), ps->reductions);
- fprintf (ps->out,
- "%srecycled %.1f MB in %u simplifications\n",
- ps->prefix, ps->srecycled / (double) (1 << 20), ps->simps);
-#else
- fprintf (ps->out, "%s%u simplifications\n", ps->prefix, ps->simps);
- fprintf (ps->out, "%s%u reductions\n", ps->prefix, ps->reductions);
- fprintf (ps->out, "%s%.1f MB recycled\n", ps->prefix, ps->recycled / (double) (1 << 20));
-#endif
- fprintf (ps->out, "%s%.1f MB maximally allocated\n",
- ps->prefix, picosat_max_bytes_allocated (ps) / (double) (1 << 20));
-}
-
-#ifndef NGETRUSAGE
-#include <sys/time.h>
-#include <sys/resource.h>
-#include <sys/unistd.h>
-#endif
-
-double
-picosat_time_stamp (void)
-{
- double res = -1;
-#ifndef NGETRUSAGE
- struct rusage u;
- res = 0;
- if (!getrusage (RUSAGE_SELF, &u))
- {
- res += u.ru_utime.tv_sec + 1e-6 * u.ru_utime.tv_usec;
- res += u.ru_stime.tv_sec + 1e-6 * u.ru_stime.tv_usec;
- }
-#endif
- return res;
-}
-
-double
-picosat_seconds (PS * ps)
-{
- check_ready (ps);
- return ps->seconds;
-}
-
-void
-picosat_print (PS * ps, FILE * file)
-{
-#ifdef NO_BINARY_CLAUSES
- Lit * lit, *other, * last;
- Ltk * stack;
-#endif
- Lit **q, **eol;
- Cls **p, *c;
- unsigned n;
-
- if (ps->measurealltimeinlib)
- enter (ps);
- else
- check_ready (ps);
-
- n = 0;
- n += ps->alshead - ps->als;
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
-
- if (!c)
- continue;
-
-#ifdef TRACE
- if (c->collected)
- continue;
-#endif
- n++;
- }
-
-#ifdef NO_BINARY_CLAUSES
- last = int2lit (ps, -ps->max_var);
- for (lit = int2lit (ps, 1); lit <= last; lit++)
- {
- stack = LIT2IMPLS (lit);
- eol = stack->start + stack->count;
- for (q = stack->start; q < eol; q++)
- if (*q >= lit)
- n++;
- }
-#endif
-
- fprintf (file, "p cnf %d %u\n", ps->max_var, n);
-
- for (p = SOC; p != EOC; p = NXC (p))
- {
- c = *p;
- if (!c)
- continue;
-
-#ifdef TRACE
- if (c->collected)
- continue;
-#endif
-
- eol = end_of_lits (c);
- for (q = c->lits; q < eol; q++)
- fprintf (file, "%d ", LIT2INT (*q));
-
- fputs ("0\n", file);
- }
-
-#ifdef NO_BINARY_CLAUSES
- last = int2lit (ps, -ps->max_var);
- for (lit = int2lit (ps, 1); lit <= last; lit++)
- {
- stack = LIT2IMPLS (lit);
- eol = stack->start + stack->count;
- for (q = stack->start; q < eol; q++)
- if ((other = *q) >= lit)
- fprintf (file, "%d %d 0\n", LIT2INT (lit), LIT2INT (other));
- }
-#endif
-
- {
- Lit **r;
- for (r = ps->als; r < ps->alshead; r++)
- fprintf (file, "%d 0\n", LIT2INT (*r));
- }
-
- fflush (file);
-
- if (ps->measurealltimeinlib)
- leave (ps);
-}
-
-void
-picosat_enter (PS * ps)
-{
- enter (ps);
-}
-
-void
-picosat_leave (PS * ps)
-{
- leave (ps);
-}
-
-void
-picosat_message (PS * ps, int vlevel, const char * fmt, ...)
-{
- va_list ap;
-
- if (vlevel > ps->verbosity)
- return;
-
- fputs (ps->prefix, ps->out);
- va_start (ap, fmt);
- vfprintf (ps->out, fmt, ap);
- va_end (ap);
- fputc ('\n', ps->out);
-}
-
-int
-picosat_changed (PS * ps)
-{
- int res;
-
- check_ready (ps);
- check_sat_state (ps);
-
- res = (ps->min_flipped <= ps->saved_max_var);
- assert (!res || ps->saved_flips != ps->flips);
-
- return res;
-}
-
-void
-picosat_reset_phases (PS * ps)
-{
- rebias (ps);
-}
-
-void
-picosat_reset_scores (PS * ps)
-{
- Rnk * r;
- ps->hhead = ps->heap + 1;
- for (r = ps->rnks + 1; r <= ps->rnks + ps->max_var; r++)
- {
- CLR (r);
- hpush (ps, r);
- }
-}
-
-void
-picosat_remove_learned (PS * ps, unsigned percentage)
-{
- enter (ps);
- reset_incremental_usage (ps);
- reduce (ps, percentage);
- leave (ps);
-}
-
-void
-picosat_set_global_default_phase (PS * ps, int phase)
-{
- check_ready (ps);
- ABORTIF (phase < 0, "API usage: 'picosat_set_global_default_phase' "
- "with negative argument");
- ABORTIF (phase > 3, "API usage: 'picosat_set_global_default_phase' "
- "with argument > 3");
- ps->defaultphase = phase;
-}
-
-void
-picosat_set_default_phase_lit (PS * ps, int int_lit, int phase)
-{
- unsigned newphase;
- Lit * lit;
- Var * v;
-
- check_ready (ps);
-
- lit = import_lit (ps, int_lit, 1);
- v = LIT2VAR (lit);
-
- if (phase)
- {
- newphase = (int_lit < 0) == (phase < 0);
- v->defphase = v->phase = newphase;
- v->usedefphase = v->assigned = 1;
- }
- else
- {
- v->usedefphase = v->assigned = 0;
- }
-}
-
-void
-picosat_set_more_important_lit (PS * ps, int int_lit)
-{
- Lit * lit;
- Var * v;
- Rnk * r;
-
- check_ready (ps);
-
- lit = import_lit (ps, int_lit, 1);
- v = LIT2VAR (lit);
- r = VAR2RNK (v);
-
- ABORTIF (r->lessimportant, "can not mark variable more and less important");
-
- if (r->moreimportant)
- return;
-
- r->moreimportant = 1;
-
- if (r->pos)
- hup (ps, r);
-}
-
-void
-picosat_set_less_important_lit (PS * ps, int int_lit)
-{
- Lit * lit;
- Var * v;
- Rnk * r;
-
- check_ready (ps);
-
- lit = import_lit (ps, int_lit, 1);
- v = LIT2VAR (lit);
- r = VAR2RNK (v);
-
- ABORTIF (r->moreimportant, "can not mark variable more and less important");
-
- if (r->lessimportant)
- return;
-
- r->lessimportant = 1;
-
- if (r->pos)
- hdown (ps, r);
-}
-
-#ifndef NADC
-
-unsigned
-picosat_ado_conflicts (PS * ps)
-{
- check_ready (ps);
- return ps->adoconflicts;
-}
-
-void
-picosat_disable_ado (PS * ps)
-{
- check_ready (ps);
- assert (!ps->adodisabled);
- ps->adodisabled = 1;
-}
-
-void
-picosat_enable_ado (PS * ps)
-{
- check_ready (ps);
- assert (ps->adodisabled);
- ps->adodisabled = 0;
-}
-
-void
-picosat_set_ado_conflict_limit (PS * ps, unsigned newadoconflictlimit)
-{
- check_ready (ps);
- ps->adoconflictlimit = newadoconflictlimit;
-}
-
-#endif
-
-void
-picosat_simplify (PS * ps)
-{
- enter (ps);
- reset_incremental_usage (ps);
- simplify (ps, 1);
- leave (ps);
-}
-
-int
-picosat_haveados (void)
-{
-#ifndef NADC
- return 1;
-#else
- return 0;
-#endif
-}
-
-void
-picosat_save_original_clauses (PS * ps)
-{
- if (ps->saveorig) return;
- ABORTIF (ps->oadded, "API usage: 'picosat_save_original_clauses' too late");
- ps->saveorig = 1;
-}
-
-void picosat_set_interrupt (PicoSAT * ps,
- void * external_state,
- int (*interrupted)(void * external_state))
-{
- ps->interrupt.state = external_state;
- ps->interrupt.function = interrupted;
-}
-
-int
-picosat_deref_partial (PS * ps, int int_lit)
-{
- check_ready (ps);
- check_sat_state (ps);
- ABORTIF (!int_lit, "API usage: can not partial deref zero literal");
- ABORTIF (ps->mtcls, "API usage: deref partial after empty clause generated");
- ABORTIF (!ps->saveorig, "API usage: 'picosat_save_original_clauses' missing");
-
-#ifdef STATS
- ps->derefs++;
-#endif
-
- if (!ps->partial)
- minautarky (ps);
-
- return pderef (ps, int_lit);
-}
-#include "config.h"
-
-const char *
-picosat_version (void)
-{
- return PICOSAT_VERSION;
-}
-
-const char *
-picosat_config (void)
-{
- return PICOSAT_CC " " PICOSAT_CFLAGS;
-}
-
diff --git a/test/monniaux/picosat-965/onefile/testcmp.sh b/test/monniaux/picosat-965/onefile/testcmp.sh
index bab609e2..2228c675 100755
--- a/test/monniaux/picosat-965/onefile/testcmp.sh
+++ b/test/monniaux/picosat-965/onefile/testcmp.sh
@@ -2,15 +2,20 @@ DEFINES="-DNALARM -DNZIP -DNGETRUSAGE -DNDEBUG"
COMPCERT=/local/monniaux/Kalray/mppa-RTLpathSE-verif-hash-junk
DATA=$COMPCERT/test/monniaux/picosat-965/tiny.dat
CCOMP="$COMPCERT/ccomp -fbitfields -fduplicate 2 -fall-loads-nontrap $DEFINES"
-GCC="kvx-cos-gcc -O -Wimplicit -Wuninitialized -Werror $DEFINES"
-HOSTCC1="gcc -O -Wimplicit -Wuninitialized -Werror $DEFINES"
-HOSTCC2="gcc -O -Wimplicit -Wuninitialized -Werror -fsanitize=undefined -fsanitize=address $DEFINES"
-HOSTCC3="gcc -O3 -Wimplicit -Wuninitialized -Werror $DEFINES"
-HOSTCC4="clang -O -Wimplicit -Wuninitialized -Werror $DEFINES"
-HOSTCC5="clang -O -Wimplicit -Wuninitialized -Werror -fsanitize=undefined -fsanitize=address $DEFINES"
+GCC="kvx-cos-gcc -O -Wimplicit -Wuninitialized -Wmaybe-uninitialized -Werror $DEFINES"
+HOSTCC0="gcc -Wimplicit -Wuninitialized -Wmaybe-uninitialized -Werror $DEFINES"
+HOSTCC1="gcc -O -Wimplicit -Wuninitialized -Wmaybe-uninitialized -Werror $DEFINES"
+HOSTCC2="gcc -O -Wimplicit -Wuninitialized -Wmaybe-uninitialized -Werror -fsanitize=undefined -fsanitize=address $DEFINES"
+HOSTCC3="gcc -O3 -Wimplicit -Wuninitialized -Wmaybe-uninitialized -Werror $DEFINES"
+HOSTCC4="clang -Wimplicit -Wuninitialized -Werror $DEFINES"
+HOSTCC5="clang -Wimplicit -Wuninitialized -Werror -fsanitize=undefined -fsanitize=address $DEFINES"
CFILES="picosat.c"
SIMU="kvx-cluster --timeout=100000 -- "
+if ! $HOSTCC0 $CFILES -o picosat.cc0.host ;
+then exit 30 ;
+fi
+
if ! $HOSTCC1 $CFILES -o picosat.cc1.host ;
then exit 31 ;
fi
@@ -31,11 +36,21 @@ if ! $HOSTCC5 $CFILES -o picosat.cc5.host ;
then exit 35 ;
fi
+timeout 1 ./picosat.cc0.host $DATA 2>&1 > picosat.cc0.out
+if [ $? -ge 100 ];
+then exit 40 ;
+fi
+
timeout 1 ./picosat.cc1.host $DATA 2>&1 > picosat.cc1.out
if [ $? -ge 100 ];
then exit 41 ;
fi
+timeout 1 valgrind --log-file=picosat.cc0.valgrind.log ./picosat.cc0.host $DATA 2>&1 > picosat.cc0.valgrind.out
+if [ $? -ge 100 ];
+then exit 50 ;
+fi
+
timeout 1 valgrind --log-file=picosat.cc1.valgrind.log ./picosat.cc1.host $DATA 2>&1 > picosat.cc1.valgrind.out
if [ $? -ge 100 ];
then exit 51 ;
@@ -61,6 +76,14 @@ if [ $? -ge 100 ];
then exit 45 ;
fi
+if ! cmp picosat.cc0.out picosat.cc1.out ;
+then exit 60 ;
+fi
+
+if ! cmp picosat.cc0.out picosat.cc0.valgrind.out ;
+then exit 70 ;
+fi
+
if ! cmp picosat.cc1.out picosat.cc1.valgrind.out ;
then exit 61 ;
fi
diff --git a/test/monniaux/rules.mk b/test/monniaux/rules.mk
index a5754574..7d9457fd 100644
--- a/test/monniaux/rules.mk
+++ b/test/monniaux/rules.mk
@@ -21,10 +21,10 @@ MEASURES?=time
ALL_CFLAGS+=-Wall -D__KVX_COS__ -DMAX_MEASURES=$(MAX_MEASURES)
#ALL_CFLAGS+=-g
ALL_GCCFLAGS+=$(ALL_CFLAGS) -std=c99 -Wextra -Werror=implicit
-ALL_CCOMPFLAGS+=$(ALL_CFLAGS) -fduplicate 2 -fprepass -fprepass= list -fall-loads-nontrap
+ALL_CCOMPFLAGS+=$(ALL_CFLAGS) -fprofile-use= ../compcert_profiling.dat
# The compilers
-KVX_CC?=kvx-cos-gcc
+KVX_CC?=kvx-elf-gcc
KVX_CCOMP?=ccomp
# Command to execute
@@ -37,11 +37,11 @@ GCC1FLAGS?=$(ALL_GCCFLAGS) -O1
GCC2FLAGS?=$(ALL_GCCFLAGS) -O2
GCC3FLAGS?=$(ALL_GCCFLAGS) -O3
GCC4FLAGS?=
-CCOMP0FLAGS?=$(ALL_CCOMPFLAGS) -O2 -fno-postpass
-CCOMP1FLAGS?=$(ALL_CCOMPFLAGS) -O2 -fpostpass= greedy
-CCOMP2FLAGS?=$(ALL_CCOMPFLAGS) -O2 -fno-if-conversion
-CCOMP3FLAGS?=$(ALL_CCOMPFLAGS) -O2
-CCOMP4FLAGS?=
+CCOMP0FLAGS?=$(ALL_CCOMPFLAGS) -O2
+CCOMP1FLAGS?=$(ALL_CCOMPFLAGS) -O2 -ftracelinearize -fduplicate 0
+CCOMP2FLAGS?=$(ALL_CCOMPFLAGS) -O2 -ftracelinearize -fduplicate 1 -fprepass -fprepass= list
+CCOMP3FLAGS?=$(ALL_CCOMPFLAGS) -O2 -ftracelinearize -fduplicate 2 -fprepass -fprepass= list
+CCOMP4FLAGS?=$(ALL_CCOMPFLAGS) -O2 -ftracelinearize -fduplicate 0 -fprepass -fprepass= list
# Prefix names
GCC0PREFIX?=.gcc.o0
@@ -49,11 +49,11 @@ GCC1PREFIX?=.gcc.o1
GCC2PREFIX?=.gcc.o2
GCC3PREFIX?=.gcc.o3
GCC4PREFIX?=
-CCOMP0PREFIX?=.ccomp.nobundle
-CCOMP1PREFIX?=.ccomp.greedy
-CCOMP2PREFIX?=.ccomp.noif
-CCOMP3PREFIX?=.ccomp
-CCOMP4PREFIX?=
+CCOMP0PREFIX?=.ccomp
+CCOMP1PREFIX?=.ccomp.linearize
+CCOMP2PREFIX?=.ccomp.prepass1
+CCOMP3PREFIX?=.ccomp.prepass2
+CCOMP4PREFIX?=.ccomp.prepass0
# List of outfiles, updated by gen_rules
OUTFILES:=
diff --git a/test/monniaux/scheduling/mal_schedule.c b/test/monniaux/scheduling/mal_schedule.c
new file mode 100644
index 00000000..a6ba967f
--- /dev/null
+++ b/test/monniaux/scheduling/mal_schedule.c
@@ -0,0 +1,14 @@
+#include <stdint.h>
+int16_t meuh;
+extern int uv_encode(double, double, int);
+void f(int *ab, int e) {
+ uint32_t *ao = (uint32_t *)ab;
+ int16_t *aq = &meuh;
+ while (e) {
+ int ar, as;
+ ar = 1. / 2147483647;
+ as = uv_encode(5, *aq, *ab);
+ if (as)
+ *ao++ = ar;
+ }
+}
diff --git a/test/monniaux/yarpgen/Makefile b/test/monniaux/yarpgen/Makefile
index 28bd5ae0..24dd19c3 100644
--- a/test/monniaux/yarpgen/Makefile
+++ b/test/monniaux/yarpgen/Makefile
@@ -1,5 +1,6 @@
TARGET_CCOMP=../../../ccomp
TARGET_CC=gcc
+#EXECUTE=kvx-cluster --
all:
@@ -19,7 +20,7 @@ MAX=129
PREFIX=ran%06.f
CCOMPOPTS=-static
-CCOMPFLAGS+=-funprototyped -fbitfields -fno-cse2 -stdlib ../../../runtime # FIXME
+CCOMPFLAGS+= -funprototyped -fbitfields -fno-cse2 -stdlib ../../../runtime
TESTS_C=$(shell seq --format $(PREFIX)/func.c 1 $(MAX)) \
$(shell seq --format $(PREFIX)/driver.c 1 $(MAX)) \
generated by cgit (git 2.34.1) at 2024-06-12 05:52:28 +0000