1 /* Copyright (c) 2015 Regents of the University of California
3 * Author: Brian Demsky <bdemsky@uci.edu>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * version 2 as published by the Free Software Foundation.
10 #include "inc_solver.h"
11 #define SATSOLVER "sat_solver"
15 IncrementalSolver * allocIncrementalSolver() {
16 IncrementalSolver *This=(IncrementalSolver *)ourmalloc(sizeof(IncrementalSolver));
17 This->buffer=((int *)ourmalloc(sizeof(int)*IS_BUFFERSIZE));
25 void deleteIncrementalSolver(IncrementalSolver * This) {
27 ourfree(This->buffer);
28 if (This->solution != NULL)
29 ourfree(This->solution);
32 void resetSolver(IncrementalSolver * This) {
38 void addClauseLiteral(IncrementalSolver * This, int literal) {
39 This->buffer[This->offset++]=literal;
40 if (This->offset==IS_BUFFERSIZE) {
41 flushBufferSolver(This);
45 void addArrayClauseLiteral(IncrementalSolver * This, uint numliterals, int * literals) {
46 for(uint i=0;i<numliterals; i++) {
47 This->buffer[This->offset++]=literals[i];
48 if (This->offset==IS_BUFFERSIZE) {
49 flushBufferSolver(This);
52 This->buffer[This->offset++]=0;
53 if (This->offset==IS_BUFFERSIZE) {
54 flushBufferSolver(This);
58 void finishedClauses(IncrementalSolver * This) {
59 addClauseLiteral(This, 0);
62 void freeze(IncrementalSolver * This, int variable) {
63 addClauseLiteral(This, IS_FREEZE);
64 addClauseLiteral(This, variable);
67 int solve(IncrementalSolver * This) {
70 return getSolution(This);
74 void startSolve(IncrementalSolver *This) {
75 addClauseLiteral(This, IS_RUNSOLVER);
76 flushBufferSolver(This);
79 int getSolution(IncrementalSolver * This) {
80 int result=readIntSolver(This);
81 if (result == IS_SAT) {
82 int numVars=readIntSolver(This);
83 if (numVars > This->solutionsize) {
84 if (This->solution != NULL)
85 ourfree(This->solution);
86 This->solution = (int *) ourmalloc((numVars+1)*sizeof(int));
87 This->solution[0] = 0;
89 readSolver(This, &This->solution[1], numVars * sizeof(int));
94 int readIntSolver(IncrementalSolver * This) {
96 readSolver(This, &value, 4);
100 void readSolver(IncrementalSolver * This, void * tmp, ssize_t size) {
101 char *result = (char *) tmp;
102 ssize_t bytestoread=size;
105 ssize_t n=read(This->from_solver_fd, &((char *)result)[bytesread], bytestoread);
107 model_print("Read failure\n");
112 } while(bytestoread != 0);
115 bool getValueSolver(IncrementalSolver * This, int variable) {
116 return This->solution[variable];
119 void createSolver(IncrementalSolver * This) {
122 if (pipe(to_pipe) || pipe(from_pipe)) {
123 model_print("Error creating pipe.\n");
126 if ((This->solver_pid = fork()) == -1) {
127 model_print("Error forking.\n");
130 if (This->solver_pid == 0) {
134 int fd=open("log_file", O_WRONLY|O_CREAT|O_TRUNC, S_IRWXU);
136 if ((dup2(to_pipe[0], 0) == -1) ||
137 (dup2(from_pipe[1], IS_OUT_FD) == -1) ||
138 (dup2(fd, 1) == -1)) {
139 model_print("Error duplicating pipes\n");
142 execlp(SATSOLVER, SATSOLVER, NULL);
143 model_print("execlp Failed\n");
147 This->to_solver_fd = to_pipe[1];
148 This->from_solver_fd = from_pipe[0];
154 void killSolver(IncrementalSolver * This) {
155 close(This->to_solver_fd);
156 close(This->from_solver_fd);
158 if (This->solver_pid > 0) {
160 kill(This->solver_pid, SIGKILL);
161 waitpid(This->solver_pid, &status, 0);
165 void flushBufferSolver(IncrementalSolver * This) {
166 ssize_t bytestowrite=sizeof(int)*This->offset;
167 ssize_t byteswritten=0;
169 ssize_t n=write(This->to_solver_fd, &((char *)This->buffer)[byteswritten], bytestowrite);
171 perror("Write failure\n");
172 model_print("to_solver_fd=%d\n",This->to_solver_fd);
177 } while(bytestowrite != 0);