1 #include "encodinggraph.h"
11 #include "elementencoding.h"
13 EncodingGraph::EncodingGraph(CSolver *_solver) :
17 EncodingGraph::~EncodingGraph() {
18 subgraphs.resetAndDelete();
19 encodingMap.resetAndDeleteVals();
20 edgeMap.resetAndDeleteVals();
23 int sortEncodingEdge(const void *p1, const void *p2) {
24 const EncodingEdge *e1 = *(const EncodingEdge **) p1;
25 const EncodingEdge *e2 = *(const EncodingEdge **) p2;
26 uint64_t v1 = e1->getValue();
27 uint64_t v2 = e2->getValue();
36 void EncodingGraph::buildGraph() {
37 ElementIterator it(solver);
38 while (it.hasNext()) {
39 Element *e = it.next();
51 bsdqsort(edgeVector.expose(), edgeVector.getSize(), sizeof(EncodingEdge *), sortEncodingEdge);
56 void EncodingGraph::validate() {
57 SetIteratorBooleanEdge* it= solver->getConstraints();
59 BooleanEdge be = it->next();
60 if(be->type == PREDICATEOP){
61 BooleanPredicate *b = (BooleanPredicate *)be.getBoolean();
62 if(b->predicate->type == OPERATORPRED){
63 PredicateOperator* predicate = (PredicateOperator*) b->predicate;
64 if(predicate->getOp() == SATC_EQUALS){
65 ASSERT(b->inputs.getSize() == 2);
66 Element* e1= b->inputs.get(0);
67 Element* e2= b->inputs.get(1);
68 if(e1->type == ELEMCONST || e1->type == ELEMCONST)
70 ElementEncoding *enc1 = e1->getElementEncoding();
71 ElementEncoding *enc2 = e2->getElementEncoding();
72 ASSERT(enc1->getElementEncodingType() != ELEM_UNASSIGNED);
73 ASSERT(enc2->getElementEncodingType() != ELEM_UNASSIGNED);
74 if(enc1->getElementEncodingType() == enc2->getElementEncodingType() && enc1->getElementEncodingType() == BINARYINDEX && b->getFunctionEncoding()->type == CIRCUIT){
75 for(uint i=0; i<enc1->encArraySize; i++){
76 if(enc1->isinUseElement(i)){
77 uint64_t val1 = enc1->encodingArray[i];
78 if(enc2->isinUseElement(i)){
79 ASSERT(val1 == enc2->encodingArray[i]);
81 for(uint j=0; j< enc2->encArraySize; j++){
82 if(enc2->isinUseElement(j)){
83 ASSERT(val1 != enc2->encodingArray[j]);
90 //Now make sure that all the elements in the set are appeared in the encoding array!
91 for(uint k=0; k< b->inputs.getSize(); k++){
92 Element *e = b->inputs.get(k);
93 ElementEncoding *enc = e->getElementEncoding();
94 Set *s = e->getRange();
95 for (uint i = 0; i < s->getSize(); i++) {
96 uint64_t value = s->getElement(i);
98 for(uint j=0; j< enc->encArraySize; j++){
99 if(enc->isinUseElement(j) && enc->encodingArray[j] == value){
115 void EncodingGraph::encode() {
116 if (solver->getTuner()->getTunable(ENCODINGGRAPHOPT, &offon) == 0)
119 SetIteratorEncodingSubGraph *itesg = subgraphs.iterator();
120 model_print("#SubGraph = %u\n", subgraphs.getSize());
121 while (itesg->hasNext()) {
122 EncodingSubGraph *sg = itesg->next();
127 ElementIterator it(solver);
128 while (it.hasNext()) {
129 Element *e = it.next();
132 case ELEMFUNCRETURN: {
133 ElementEncoding *encoding = e->getElementEncoding();
134 if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
135 EncodingNode *n = getNode(e);
138 ElementEncodingType encodetype = n->getEncoding();
139 encoding->setElementEncodingType(encodetype);
140 if (encodetype == UNARY || encodetype == ONEHOT) {
141 encoding->encodingArrayInitialization();
142 } else if (encodetype == BINARYINDEX) {
143 EncodingSubGraph *subgraph = graphMap.get(n);
144 DEBUG("graphMap.get(subgraph=%p, n=%p)\n", subgraph, n);
145 if (subgraph == NULL) {
146 encoding->encodingArrayInitialization();
149 uint encodingSize = subgraph->getEncodingMaxVal(n) + 1;
150 uint paddedSize = encoding->getSizeEncodingArray(encodingSize);
151 encoding->allocInUseArrayElement(paddedSize);
152 encoding->allocEncodingArrayElement(paddedSize);
153 Set *s = e->getRange();
154 for (uint i = 0; i < s->getSize(); i++) {
155 uint64_t value = s->getElement(i);
156 uint encodingIndex = subgraph->getEncoding(n, value);
157 encoding->setInUseElement(encodingIndex);
158 ASSERT(encoding->isinUseElement(encodingIndex));
159 encoding->encodingArray[encodingIndex] = value;
172 void EncodingGraph::encodeParent(Element *e) {
173 uint size = e->parents.getSize();
174 for (uint i = 0; i < size; i++) {
175 ASTNode *n = e->parents.get(i);
176 if (n->type == PREDICATEOP) {
177 BooleanPredicate *b = (BooleanPredicate *)n;
178 FunctionEncoding *fenc = b->getFunctionEncoding();
179 if (fenc->getFunctionEncodingType() != FUNC_UNASSIGNED)
181 Predicate *p = b->getPredicate();
182 if (p->type == OPERATORPRED) {
183 PredicateOperator *po = (PredicateOperator *)p;
184 ASSERT(b->inputs.getSize() == 2);
185 EncodingNode *left = createNode(b->inputs.get(0));
186 EncodingNode *right = createNode(b->inputs.get(1));
187 if (left == NULL || right == NULL)
189 EncodingEdge *edge = getEdge(left, right, NULL);
191 EncodingSubGraph *leftGraph = graphMap.get(left);
192 if (leftGraph != NULL && leftGraph == graphMap.get(right)) {
193 fenc->setFunctionEncodingType(CIRCUIT);
201 void EncodingGraph::mergeNodes(EncodingNode *first, EncodingNode *second) {
202 EncodingSubGraph *graph1 = graphMap.get(first);
203 DEBUG("graphMap.get(first=%p, graph1=%p)\n", first, graph1);
204 EncodingSubGraph *graph2 = graphMap.get(second);
205 DEBUG("graphMap.get(second=%p, graph2=%p)\n", second, graph2);
207 first->setEncoding(BINARYINDEX);
209 second->setEncoding(BINARYINDEX);
211 if (graph1 == NULL && graph2 == NULL) {
212 graph1 = new EncodingSubGraph();
213 subgraphs.add(graph1);
214 DEBUG("graphMap.put(first=%p, graph1=%p)\n", first, graph1);
215 graphMap.put(first, graph1);
216 graph1->addNode(first);
218 if (graph1 == NULL && graph2 != NULL) {
221 EncodingNode *tmp = second;
225 if (graph1 != NULL && graph2 != NULL) {
226 if (graph1 == graph2)
229 SetIteratorEncodingNode *nodeit = graph2->nodeIterator();
230 while (nodeit->hasNext()) {
231 EncodingNode *node = nodeit->next();
232 graph1->addNode(node);
233 DEBUG("graphMap.put(node=%p, graph1=%p)\n", node, graph1);
234 graphMap.put(node, graph1);
236 subgraphs.remove(graph2);
238 DEBUG("Deleting graph2 =%p \n", graph2);
241 ASSERT(graph1 != NULL && graph2 == NULL);
242 graph1->addNode(second);
243 DEBUG("graphMap.put(first=%p, graph1=%p)\n", first, graph1);
244 graphMap.put(second, graph1);
248 void EncodingGraph::processElement(Element *e) {
249 uint size = e->parents.getSize();
250 for (uint i = 0; i < size; i++) {
251 ASTNode *n = e->parents.get(i);
254 processPredicate((BooleanPredicate *)n);
257 processFunction((ElementFunction *)n);
265 void EncodingGraph::processFunction(ElementFunction *ef) {
266 Function *f = ef->getFunction();
267 if (f->type == OPERATORFUNC) {
268 FunctionOperator *fo = (FunctionOperator *)f;
269 ASSERT(ef->inputs.getSize() == 2);
270 EncodingNode *left = createNode(ef->inputs.get(0));
271 EncodingNode *right = createNode(ef->inputs.get(1));
272 if (left == NULL && right == NULL)
274 EncodingNode *dst = createNode(ef);
275 EncodingEdge *edge = createEdge(left, right, dst);
280 void EncodingGraph::processPredicate(BooleanPredicate *b) {
281 Predicate *p = b->getPredicate();
282 if (p->type == OPERATORPRED) {
283 PredicateOperator *po = (PredicateOperator *)p;
284 ASSERT(b->inputs.getSize() == 2);
285 EncodingNode *left = createNode(b->inputs.get(0));
286 EncodingNode *right = createNode(b->inputs.get(1));
287 if (left == NULL || right == NULL)
289 EncodingEdge *edge = createEdge(left, right, NULL);
290 CompOp op = po->getOp();
299 edge->numComparisons++;
307 uint convertSize(uint cost) {
308 cost = FUDGEFACTOR * cost;// fudge factor
309 return NEXTPOW2(cost);
312 void EncodingGraph::decideEdges() {
313 uint size = edgeVector.getSize();
314 for (uint i = 0; i < size; i++) {
315 EncodingEdge *ee = edgeVector.get(i);
316 EncodingNode *left = ee->left;
317 EncodingNode *right = ee->right;
319 if (ee->encoding != EDGE_UNASSIGNED ||
320 !left->couldBeBinaryIndex() ||
321 !right->couldBeBinaryIndex())
324 uint64_t eeValue = ee->getValue();
328 EncodingSubGraph *leftGraph = graphMap.get(left);
329 DEBUG("graphMap.get(left=%p, leftgraph=%p)\n", left, leftGraph);
330 EncodingSubGraph *rightGraph = graphMap.get(right);
331 DEBUG("graphMap.get(right=%p, rightgraph=%p)\n", right, rightGraph);
332 if (leftGraph == NULL && rightGraph != NULL) {
333 EncodingNode *tmp = left; left = right; right = tmp;
334 EncodingSubGraph *tmpsg = leftGraph; leftGraph = rightGraph; rightGraph = tmpsg;
337 uint leftSize = 0, rightSize = 0, newSize = 0, max=0;
339 if (leftGraph == NULL && rightGraph == NULL) {
340 leftSize = convertSize(left->getSize());
341 rightSize = convertSize(right->getSize());
342 newSize = convertSize(left->s->getUnionSize(right->s));
343 newSize = (leftSize > newSize) ? leftSize : newSize;
344 newSize = (rightSize > newSize) ? rightSize : newSize;
345 max = rightSize > leftSize? rightSize : leftSize;
346 // model_print("Merge=%s\tsimilarity=%f\n", max==newSize?"TRUE":"FALSE", left->measureSimilarity(right));
347 merge = left->measureSimilarity(right) > 1.5 || max == newSize;
348 } else if (leftGraph != NULL && rightGraph == NULL) {
349 leftSize = convertSize(leftGraph->encodingSize);
350 rightSize = convertSize(right->getSize());
351 newSize = convertSize(leftGraph->estimateNewSize(right));
352 newSize = (leftSize > newSize) ? leftSize : newSize;
353 newSize = (rightSize > newSize) ? rightSize : newSize;
354 max = rightSize > leftSize? rightSize : leftSize;
355 // model_print("Merge=%s\tsimilarity=%f\n", max==newSize?"TRUE":"FALSE", leftGraph->measureSimilarity(right));
356 merge = leftGraph->measureSimilarity(right) > 1.5 || max == newSize;
359 leftSize = convertSize(leftGraph->encodingSize);
360 rightSize = convertSize(rightGraph->encodingSize);
361 newSize = convertSize(leftGraph->estimateNewSize(rightGraph));
362 // model_print("MergingSubGraphs: left=%u\tright=%u\tnewSize=%u\n", leftSize, rightSize, newSize);
363 newSize = (leftSize > newSize) ? leftSize : newSize;
364 newSize = (rightSize > newSize) ? rightSize : newSize;
365 // model_print("Merge=%s\tsimilarity=%f\n", max==newSize?"TRUE":"FALSE", leftGraph->measureSimilarity(rightGraph));
366 max = rightSize > leftSize? rightSize : leftSize;
367 merge = leftGraph->measureSimilarity(right) > 1.5 || max == newSize;
371 mergeNodes(left, right);
376 static TunableDesc EdgeEncodingDesc(EDGE_UNASSIGNED, EDGE_MATCH, EDGE_UNASSIGNED);
378 EncodingEdge *EncodingGraph::getEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
379 EncodingEdge e(left, right, dst);
380 EncodingEdge *result = edgeMap.get(&e);
384 EncodingEdge *EncodingGraph::createEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
385 EncodingEdge e(left, right, dst);
386 EncodingEdge *result = edgeMap.get(&e);
387 if (result == NULL) {
388 result = new EncodingEdge(left, right, dst);
389 VarType v1 = left->getType();
390 VarType v2 = right->getType();
397 if ((left != NULL && left->couldBeBinaryIndex()) &&
398 (right != NULL) && right->couldBeBinaryIndex()) {
399 EdgeEncodingType type = (EdgeEncodingType)solver->getTuner()->getVarTunable(v1, v2, EDGEENCODING, &EdgeEncodingDesc);
400 result->setEncoding(type);
401 if (type == EDGE_MATCH) {
402 mergeNodes(left, right);
405 edgeMap.put(result, result);
406 edgeVector.push(result);
408 left->edges.add(result);
410 right->edges.add(result);
412 dst->edges.add(result);
417 EncodingNode::EncodingNode(Set *_s) :
421 uint EncodingNode::getSize() const {
425 uint64_t EncodingNode::getIndex(uint index){
426 return s->getElement(index);
429 VarType EncodingNode::getType() const {
433 bool EncodingNode::itemExists(uint64_t item){
434 for(uint i=0; i< s->getSize(); i++){
435 if(item == s->getElement(i))
441 double EncodingNode::measureSimilarity(EncodingNode *node){
443 for(uint i=0; i < s->getSize(); i++){
444 uint64_t item = s->getElement(i);
445 if(node->itemExists(item)){
449 // model_print("common=%u\tsize1=%u\tsize2=%u\tsim1=%f\tsim2=%f\n", common, s->getSize(), node->getSize(), 1.0*common/s->getSize(), 1.0*common/node->getSize());
450 return common*1.0/s->getSize() + common*1.0/node->getSize();
453 EncodingNode *EncodingGraph::createNode(Element *e) {
454 if (e->type == ELEMCONST)
456 Set *s = e->getRange();
457 EncodingNode *n = encodingMap.get(s);
459 n = new EncodingNode(s);
460 n->setEncoding((ElementEncodingType)solver->getTuner()->getVarTunable(n->getType(), NODEENCODING, &NodeEncodingDesc));
462 encodingMap.put(s, n);
468 EncodingNode *EncodingGraph::getNode(Element *e) {
469 if (e->type == ELEMCONST)
471 Set *s = e->getRange();
472 EncodingNode *n = encodingMap.get(s);
476 void EncodingNode::addElement(Element *e) {
480 EncodingEdge::EncodingEdge(EncodingNode *_l, EncodingNode *_r) :
484 encoding(EDGE_UNASSIGNED),
491 EncodingEdge::EncodingEdge(EncodingNode *_left, EncodingNode *_right, EncodingNode *_dst) :
495 encoding(EDGE_UNASSIGNED),
502 uint hashEncodingEdge(EncodingEdge *edge) {
503 uintptr_t hash = (((uintptr_t) edge->left) >> 2) ^ (((uintptr_t)edge->right) >> 4) ^ (((uintptr_t)edge->dst) >> 6);
507 bool equalsEncodingEdge(EncodingEdge *e1, EncodingEdge *e2) {
508 return e1->left == e2->left && e1->right == e2->right && e1->dst == e2->dst;
511 uint64_t EncodingEdge::getValue() const {
512 uint lSize = (left != NULL) ? left->getSize() : 1;
513 uint rSize = (right != NULL) ? right->getSize() : 1;
514 uint min = (lSize < rSize) ? lSize : rSize;
515 return numEquals * min + numComparisons * lSize * rSize;