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);
55 void EncodingGraph::encode() {
56 SetIteratorEncodingSubGraph *itesg = subgraphs.iterator();
57 while (itesg->hasNext()) {
58 EncodingSubGraph *sg = itesg->next();
63 ElementIterator it(solver);
64 while (it.hasNext()) {
65 Element *e = it.next();
68 case ELEMFUNCRETURN: {
69 ElementEncoding *encoding = e->getElementEncoding();
70 if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
71 EncodingNode *n = getNode(e);
74 ElementEncodingType encodetype = n->getEncoding();
75 encoding->setElementEncodingType(encodetype);
76 if (encodetype == UNARY || encodetype == ONEHOT) {
77 encoding->encodingArrayInitialization();
78 } else if (encodetype == BINARYINDEX) {
79 EncodingSubGraph *subgraph = graphMap.get(n);
80 DEBUG("graphMap.get(subgraph=%p, n=%p)\n", subgraph, n);
83 uint encodingSize = subgraph->getEncodingMaxVal(n) + 1;
84 uint paddedSize = encoding->getSizeEncodingArray(encodingSize);
85 encoding->allocInUseArrayElement(paddedSize);
86 encoding->allocEncodingArrayElement(paddedSize);
87 Set *s = e->getRange();
88 for (uint i = 0; i < s->getSize(); i++) {
89 uint64_t value = s->getElement(i);
90 uint encodingIndex = subgraph->getEncoding(n, value);
91 encoding->setInUseElement(encodingIndex);
92 encoding->encodingArray[encodingIndex] = value;
105 void EncodingGraph::encodeParent(Element *e) {
106 uint size = e->parents.getSize();
107 for (uint i = 0; i < size; i++) {
108 ASTNode *n = e->parents.get(i);
109 if (n->type == PREDICATEOP) {
110 BooleanPredicate *b = (BooleanPredicate *)n;
111 FunctionEncoding *fenc = b->getFunctionEncoding();
112 if (fenc->getFunctionEncodingType() != FUNC_UNASSIGNED)
114 Predicate *p = b->getPredicate();
115 if (p->type == OPERATORPRED) {
116 PredicateOperator *po = (PredicateOperator *)p;
117 ASSERT(b->inputs.getSize() == 2);
118 EncodingNode *left = createNode(b->inputs.get(0));
119 EncodingNode *right = createNode(b->inputs.get(1));
120 if (left == NULL || right == NULL)
122 EncodingEdge *edge = getEdge(left, right, NULL);
123 if (edge != NULL && edge->getEncoding() == EDGE_MATCH) {
124 fenc->setFunctionEncodingType(CIRCUIT);
131 void EncodingGraph::mergeNodes(EncodingNode *first, EncodingNode *second) {
132 EncodingSubGraph *graph1 = graphMap.get(first);
133 DEBUG("graphMap.get(first=%p, graph1=%p)\n", first, graph1);
134 EncodingSubGraph *graph2 = graphMap.get(second);
135 DEBUG("graphMap.get(second=%p, graph2=%p)\n", second, graph2);
137 first->setEncoding(BINARYINDEX);
139 second->setEncoding(BINARYINDEX);
141 if (graph1 == NULL && graph2 == NULL) {
142 graph1 = new EncodingSubGraph();
143 subgraphs.add(graph1);
144 DEBUG("graphMap.put(first=%p, graph1=%p)\n", first, graph1);
145 graphMap.put(first, graph1);
146 graph1->addNode(first);
148 if (graph1 == NULL && graph2 != NULL) {
151 EncodingNode *tmp = second;
155 if (graph1 != NULL && graph2 != NULL) {
156 SetIteratorEncodingNode *nodeit = graph2->nodeIterator();
157 while (nodeit->hasNext()) {
158 EncodingNode *node = nodeit->next();
159 graph1->addNode(node);
160 DEBUG("graphMap.put(node=%p, graph1=%p)\n", node, graph1);
161 graphMap.put(node, graph1);
163 subgraphs.remove(graph2);
165 DEBUG("Deleting graph2 =%p \n", graph2);
168 ASSERT(graph1 != NULL && graph2 == NULL);
169 graph1->addNode(first);
170 DEBUG("graphMap.put(first=%p, graph1=%p)\n", first, graph1);
171 graphMap.put(first, graph1);
175 void EncodingGraph::processElement(Element *e) {
176 uint size = e->parents.getSize();
177 for (uint i = 0; i < size; i++) {
178 ASTNode *n = e->parents.get(i);
181 processPredicate((BooleanPredicate *)n);
184 processFunction((ElementFunction *)n);
192 void EncodingGraph::processFunction(ElementFunction *ef) {
193 Function *f = ef->getFunction();
194 if (f->type == OPERATORFUNC) {
195 FunctionOperator *fo = (FunctionOperator *)f;
196 ASSERT(ef->inputs.getSize() == 2);
197 EncodingNode *left = createNode(ef->inputs.get(0));
198 EncodingNode *right = createNode(ef->inputs.get(1));
199 if (left == NULL && right == NULL)
201 EncodingNode *dst = createNode(ef);
202 EncodingEdge *edge = createEdge(left, right, dst);
207 void EncodingGraph::processPredicate(BooleanPredicate *b) {
208 Predicate *p = b->getPredicate();
209 if (p->type == OPERATORPRED) {
210 PredicateOperator *po = (PredicateOperator *)p;
211 ASSERT(b->inputs.getSize() == 2);
212 EncodingNode *left = createNode(b->inputs.get(0));
213 EncodingNode *right = createNode(b->inputs.get(1));
214 if (left == NULL || right == NULL)
216 EncodingEdge *edge = createEdge(left, right, NULL);
217 CompOp op = po->getOp();
226 edge->numComparisons++;
234 uint convertSize(uint cost) {
235 cost = 1.2 * cost;// fudge factor
236 return NEXTPOW2(cost);
239 void EncodingGraph::decideEdges() {
240 uint size = edgeVector.getSize();
241 for (uint i = 0; i < size; i++) {
242 EncodingEdge *ee = edgeVector.get(i);
243 EncodingNode *left = ee->left;
244 EncodingNode *right = ee->right;
246 if (ee->encoding != EDGE_UNASSIGNED ||
247 !left->couldBeBinaryIndex() ||
248 !right->couldBeBinaryIndex())
251 uint64_t eeValue = ee->getValue();
255 EncodingSubGraph *leftGraph = graphMap.get(left);
256 DEBUG("graphMap.get(left=%p, leftgraph=%p)\n", left, leftGraph);
257 EncodingSubGraph *rightGraph = graphMap.get(right);
258 DEBUG("graphMap.get(right=%p, rightgraph=%p)\n", right, rightGraph);
259 if (leftGraph == NULL && rightGraph != NULL) {
260 EncodingNode *tmp = left; left = right; right = tmp;
261 EncodingSubGraph *tmpsg = leftGraph; leftGraph = rightGraph; rightGraph = tmpsg;
264 uint leftSize = 0, rightSize = 0, newSize = 0;
265 uint64_t totalCost = 0;
266 if (leftGraph == NULL && rightGraph == NULL) {
267 leftSize = convertSize(left->getSize());
268 rightSize = convertSize(right->getSize());
269 newSize = convertSize(left->s->getUnionSize(right->s));
270 newSize = (leftSize > newSize) ? leftSize : newSize;
271 newSize = (rightSize > newSize) ? rightSize : newSize;
272 totalCost = (newSize - leftSize) * left->elements.getSize() +
273 (newSize - rightSize) * right->elements.getSize();
274 } else if (leftGraph != NULL && rightGraph == NULL) {
275 leftSize = convertSize(leftGraph->encodingSize);
276 rightSize = convertSize(right->getSize());
277 newSize = convertSize(leftGraph->estimateNewSize(right));
278 newSize = (leftSize > newSize) ? leftSize : newSize;
279 newSize = (rightSize > newSize) ? rightSize : newSize;
280 totalCost = (newSize - leftSize) * leftGraph->numElements +
281 (newSize - rightSize) * right->elements.getSize();
284 leftSize = convertSize(leftGraph->encodingSize);
285 rightSize = convertSize(rightGraph->encodingSize);
286 newSize = convertSize(leftGraph->estimateNewSize(rightGraph));
287 newSize = (leftSize > newSize) ? leftSize : newSize;
288 newSize = (rightSize > newSize) ? rightSize : newSize;
289 totalCost = (newSize - leftSize) * leftGraph->numElements +
290 (newSize - rightSize) * rightGraph->numElements;
292 double conversionfactor = 0.5;
293 if (leftGraph != rightGraph && (totalCost * conversionfactor) < eeValue) {
295 mergeNodes(left, right);
300 static TunableDesc EdgeEncodingDesc(EDGE_UNASSIGNED, EDGE_MATCH, EDGE_UNASSIGNED);
302 EncodingEdge *EncodingGraph::getEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
303 EncodingEdge e(left, right, dst);
304 EncodingEdge *result = edgeMap.get(&e);
308 EncodingEdge *EncodingGraph::createEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
309 EncodingEdge e(left, right, dst);
310 EncodingEdge *result = edgeMap.get(&e);
311 if (result == NULL) {
312 result = new EncodingEdge(left, right, dst);
313 VarType v1 = left->getType();
314 VarType v2 = right->getType();
321 if ((left != NULL && left->couldBeBinaryIndex()) &&
322 (right != NULL) && right->couldBeBinaryIndex()) {
323 EdgeEncodingType type = (EdgeEncodingType)solver->getTuner()->getVarTunable(v1, v2, EDGEENCODING, &EdgeEncodingDesc);
324 result->setEncoding(type);
325 if (type == EDGE_MATCH) {
326 mergeNodes(left, right);
329 edgeMap.put(result, result);
330 edgeVector.push(result);
332 left->edges.add(result);
334 right->edges.add(result);
336 dst->edges.add(result);
341 EncodingNode::EncodingNode(Set *_s) :
345 uint EncodingNode::getSize() const {
349 VarType EncodingNode::getType() const {
353 static TunableDesc NodeEncodingDesc(ELEM_UNASSIGNED, BINARYINDEX, ELEM_UNASSIGNED);
355 EncodingNode *EncodingGraph::createNode(Element *e) {
356 if (e->type == ELEMCONST)
358 Set *s = e->getRange();
359 EncodingNode *n = encodingMap.get(s);
361 n = new EncodingNode(s);
362 n->setEncoding((ElementEncodingType)solver->getTuner()->getVarTunable(n->getType(), NODEENCODING, &NodeEncodingDesc));
364 encodingMap.put(s, n);
370 EncodingNode *EncodingGraph::getNode(Element *e) {
371 if (e->type == ELEMCONST)
373 Set *s = e->getRange();
374 EncodingNode *n = encodingMap.get(s);
378 void EncodingNode::addElement(Element *e) {
382 EncodingEdge::EncodingEdge(EncodingNode *_l, EncodingNode *_r) :
386 encoding(EDGE_UNASSIGNED),
393 EncodingEdge::EncodingEdge(EncodingNode *_left, EncodingNode *_right, EncodingNode *_dst) :
397 encoding(EDGE_UNASSIGNED),
404 uint hashEncodingEdge(EncodingEdge *edge) {
405 uintptr_t hash = (((uintptr_t) edge->left) >> 2) ^ (((uintptr_t)edge->right) >> 4) ^ (((uintptr_t)edge->dst) >> 6);
409 bool equalsEncodingEdge(EncodingEdge *e1, EncodingEdge *e2) {
410 return e1->left == e2->left && e1->right == e2->right && e1->dst == e2->dst;
413 uint64_t EncodingEdge::getValue() const {
414 uint lSize = (left != NULL) ? left->getSize() : 1;
415 uint rSize = (right != NULL) ? right->getSize() : 1;
416 uint min = (lSize < rSize) ? lSize : rSize;
417 return numEquals * min + numComparisons * lSize * rSize;