1 #include "encodinggraph.h"
11 #include "elementencoding.h"
13 EncodingGraph::EncodingGraph(CSolver *_solver) :
17 int sortEncodingEdge(const void *p1, const void *p2) {
18 const EncodingEdge *e1 = *(const EncodingEdge **) p1;
19 const EncodingEdge *e2 = *(const EncodingEdge **) p2;
20 uint64_t v1 = e1->getValue();
21 uint64_t v2 = e2->getValue();
30 void EncodingGraph::buildGraph() {
31 ElementIterator it(solver);
32 while (it.hasNext()) {
33 Element *e = it.next();
45 bsdqsort(edgeVector.expose(), edgeVector.getSize(), sizeof(EncodingEdge *), sortEncodingEdge);
49 void EncodingGraph::encode() {
50 SetIteratorEncodingSubGraph *itesg = subgraphs.iterator();
51 while (itesg->hasNext()) {
52 EncodingSubGraph *sg = itesg->next();
57 ElementIterator it(solver);
58 while (it.hasNext()) {
59 Element *e = it.next();
62 case ELEMFUNCRETURN: {
63 ElementEncoding *encoding = e->getElementEncoding();
64 if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
65 EncodingNode *n = getNode(e);
68 ElementEncodingType encodetype = n->getEncoding();
69 encoding->setElementEncodingType(encodetype);
70 if (encodetype == UNARY || encodetype == ONEHOT) {
71 encoding->encodingArrayInitialization();
72 } else if (encodetype == BINARYINDEX) {
73 EncodingSubGraph *subgraph = graphMap.get(n);
76 uint encodingSize = subgraph->getEncodingSize(n);
77 uint paddedSize = encoding->getSizeEncodingArray(encodingSize);
78 encoding->allocInUseArrayElement(paddedSize);
79 encoding->allocEncodingArrayElement(paddedSize);
80 Set *s = e->getRange();
81 for (uint i = 0; i < s->getSize(); i++) {
82 uint64_t value = s->getElement(i);
83 uint encodingIndex = subgraph->getEncoding(n, value);
84 encoding->setInUseElement(encodingIndex);
85 encoding->encodingArray[encodingIndex] = value;
98 void EncodingGraph::encodeParent(Element *e) {
99 uint size = e->parents.getSize();
100 for (uint i = 0; i < size; i++) {
101 ASTNode *n = e->parents.get(i);
102 if (n->type == PREDICATEOP) {
103 BooleanPredicate *b = (BooleanPredicate *)n;
104 FunctionEncoding *fenc = b->getFunctionEncoding();
105 if (fenc->getFunctionEncodingType() != FUNC_UNASSIGNED)
107 Predicate *p = b->getPredicate();
108 if (p->type == OPERATORPRED) {
109 PredicateOperator *po = (PredicateOperator *)p;
110 ASSERT(b->inputs.getSize() == 2);
111 EncodingNode *left = createNode(b->inputs.get(0));
112 EncodingNode *right = createNode(b->inputs.get(1));
113 if (left == NULL || right == NULL)
115 EncodingEdge *edge = getEdge(left, right, NULL);
116 if (edge != NULL && edge->getEncoding() == EDGE_MATCH) {
117 fenc->setFunctionEncodingType(CIRCUIT);
124 void EncodingGraph::mergeNodes(EncodingNode *first, EncodingNode *second) {
125 EncodingSubGraph *graph1 = graphMap.get(first);
126 EncodingSubGraph *graph2 = graphMap.get(second);
128 first->setEncoding(BINARYINDEX);
130 second->setEncoding(BINARYINDEX);
132 if (graph1 == NULL && graph2 == NULL) {
133 graph1 = new EncodingSubGraph();
134 subgraphs.add(graph1);
135 graphMap.put(first, graph1);
136 graph1->addNode(first);
138 if (graph1 == NULL && graph2 != NULL) {
141 EncodingNode *tmp = second;
145 if (graph1 != NULL && graph2 != NULL) {
146 SetIteratorEncodingNode *nodeit = graph2->nodeIterator();
147 while (nodeit->hasNext()) {
148 EncodingNode *node = nodeit->next();
149 graph1->addNode(node);
150 graphMap.put(node, graph1);
152 subgraphs.remove(graph2);
156 ASSERT(graph1 != NULL && graph2 == NULL);
157 graph1->addNode(second);
158 graphMap.put(second, graph1);
162 void EncodingGraph::processElement(Element *e) {
163 uint size = e->parents.getSize();
164 for (uint i = 0; i < size; i++) {
165 ASTNode *n = e->parents.get(i);
168 processPredicate((BooleanPredicate *)n);
171 processFunction((ElementFunction *)n);
179 void EncodingGraph::processFunction(ElementFunction *ef) {
180 Function *f = ef->getFunction();
181 if (f->type == OPERATORFUNC) {
182 FunctionOperator *fo = (FunctionOperator *)f;
183 ASSERT(ef->inputs.getSize() == 2);
184 EncodingNode *left = createNode(ef->inputs.get(0));
185 EncodingNode *right = createNode(ef->inputs.get(1));
186 if (left == NULL && right == NULL)
188 EncodingNode *dst = createNode(ef);
189 EncodingEdge *edge = createEdge(left, right, dst);
194 void EncodingGraph::processPredicate(BooleanPredicate *b) {
195 Predicate *p = b->getPredicate();
196 if (p->type == OPERATORPRED) {
197 PredicateOperator *po = (PredicateOperator *)p;
198 ASSERT(b->inputs.getSize() == 2);
199 EncodingNode *left = createNode(b->inputs.get(0));
200 EncodingNode *right = createNode(b->inputs.get(1));
201 if (left == NULL || right == NULL)
203 EncodingEdge *edge = createEdge(left, right, NULL);
204 CompOp op = po->getOp();
213 edge->numComparisons++;
221 uint convertSize(uint cost) {
222 cost = 1.2 * cost;// fudge factor
223 return NEXTPOW2(cost);
226 void EncodingGraph::decideEdges() {
227 uint size = edgeVector.getSize();
228 for (uint i = 0; i < size; i++) {
229 EncodingEdge *ee = edgeVector.get(i);
230 EncodingNode *left = ee->left;
231 EncodingNode *right = ee->right;
233 if (ee->encoding != EDGE_UNASSIGNED ||
234 !left->couldBeBinaryIndex() ||
235 !right->couldBeBinaryIndex())
238 uint64_t eeValue = ee->getValue();
242 EncodingSubGraph *leftGraph = graphMap.get(left);
243 EncodingSubGraph *rightGraph = graphMap.get(right);
244 if (leftGraph == NULL && rightGraph != NULL) {
245 EncodingNode *tmp = left; left = right; right = tmp;
246 EncodingSubGraph *tmpsg = leftGraph; leftGraph = rightGraph; rightGraph = tmpsg;
249 uint leftSize = 0, rightSize = 0, newSize = 0;
250 uint64_t totalCost = 0;
251 if (leftGraph == NULL && rightGraph == NULL) {
252 leftSize = convertSize(left->getSize());
253 rightSize = convertSize(right->getSize());
254 newSize = convertSize(left->s->getUnionSize(right->s));
255 newSize = (leftSize > newSize) ? leftSize : newSize;
256 newSize = (rightSize > newSize) ? rightSize : newSize;
257 totalCost = (newSize - leftSize) * left->elements.getSize() +
258 (newSize - rightSize) * right->elements.getSize();
259 } else if (leftGraph != NULL && rightGraph == NULL) {
260 leftSize = convertSize(leftGraph->encodingSize);
261 rightSize = convertSize(right->getSize());
262 newSize = convertSize(leftGraph->estimateNewSize(right));
263 newSize = (leftSize > newSize) ? leftSize : newSize;
264 newSize = (rightSize > newSize) ? rightSize : newSize;
265 totalCost = (newSize - leftSize) * leftGraph->numElements +
266 (newSize - rightSize) * right->elements.getSize();
269 leftSize = convertSize(leftGraph->encodingSize);
270 rightSize = convertSize(rightGraph->encodingSize);
271 newSize = convertSize(leftGraph->estimateNewSize(rightGraph));
272 newSize = (leftSize > newSize) ? leftSize : newSize;
273 newSize = (rightSize > newSize) ? rightSize : newSize;
274 totalCost = (newSize - leftSize) * leftGraph->numElements +
275 (newSize - rightSize) * rightGraph->numElements;
277 double conversionfactor = 0.5;
278 if ((totalCost * conversionfactor) < eeValue) {
280 mergeNodes(left, right);
285 static TunableDesc EdgeEncodingDesc(EDGE_UNASSIGNED, EDGE_MATCH, EDGE_UNASSIGNED);
287 EncodingEdge *EncodingGraph::getEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
288 EncodingEdge e(left, right, dst);
289 EncodingEdge *result = edgeMap.get(&e);
293 EncodingEdge *EncodingGraph::createEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
294 EncodingEdge e(left, right, dst);
295 EncodingEdge *result = edgeMap.get(&e);
296 if (result == NULL) {
297 result = new EncodingEdge(left, right, dst);
298 VarType v1 = left->getType();
299 VarType v2 = right->getType();
306 if ((left != NULL && left->couldBeBinaryIndex()) &&
307 (right != NULL) && right->couldBeBinaryIndex()) {
308 EdgeEncodingType type = (EdgeEncodingType)solver->getTuner()->getVarTunable(v1, v2, EDGEENCODING, &EdgeEncodingDesc);
309 result->setEncoding(type);
310 if (type == EDGE_MATCH) {
311 mergeNodes(left, right);
314 edgeMap.put(result, result);
315 edgeVector.push(result);
317 left->edges.add(result);
319 right->edges.add(result);
321 dst->edges.add(result);
326 EncodingNode::EncodingNode(Set *_s) :
330 uint EncodingNode::getSize() const {
334 VarType EncodingNode::getType() const {
338 static TunableDesc NodeEncodingDesc(ELEM_UNASSIGNED, BINARYINDEX, ELEM_UNASSIGNED);
340 EncodingNode *EncodingGraph::createNode(Element *e) {
341 if (e->type == ELEMCONST)
343 Set *s = e->getRange();
344 EncodingNode *n = encodingMap.get(s);
346 n = new EncodingNode(s);
347 n->setEncoding((ElementEncodingType)solver->getTuner()->getVarTunable(n->getType(), NODEENCODING, &NodeEncodingDesc));
349 encodingMap.put(s, n);
355 EncodingNode *EncodingGraph::getNode(Element *e) {
356 if (e->type == ELEMCONST)
358 Set *s = e->getRange();
359 EncodingNode *n = encodingMap.get(s);
363 void EncodingNode::addElement(Element *e) {
367 EncodingEdge::EncodingEdge(EncodingNode *_l, EncodingNode *_r) :
371 encoding(EDGE_UNASSIGNED),
378 EncodingEdge::EncodingEdge(EncodingNode *_left, EncodingNode *_right, EncodingNode *_dst) :
382 encoding(EDGE_UNASSIGNED),
389 uint hashEncodingEdge(EncodingEdge *edge) {
390 uintptr_t hash = (((uintptr_t) edge->left) >> 2) ^ (((uintptr_t)edge->right) >> 4) ^ (((uintptr_t)edge->dst) >> 6);
394 bool equalsEncodingEdge(EncodingEdge *e1, EncodingEdge *e2) {
395 return e1->left == e2->left && e1->right == e2->right && e1->dst == e2->dst;
398 uint64_t EncodingEdge::getValue() const {
399 uint lSize = (left != NULL) ? left->getSize() : 1;
400 uint rSize = (right != NULL) ? right->getSize() : 1;
401 uint min = (lSize < rSize) ? lSize : rSize;
402 return numEquals * min + numComparisons * lSize * rSize;