src/ASTAnalyses/Encoding/encodinggraph.cc

   1 #include "encodinggraph.h"
   2 #include "iterator.h"
   3 #include "element.h"
   4 #include "function.h"
   5 #include "predicate.h"
   6 #include "set.h"
   7 #include "csolver.h"
   8 #include "tunable.h"
   9 #include "qsort.h"
  10 #include "subgraph.h"
  11 #include "elementencoding.h"
  12
  13 EncodingGraph::EncodingGraph(CSolver * _solver) :
  14         solver(_solver) {
  15 }
  16
  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();
  22         if (v1 < v2)
  23                 return 1;
  24         else if (v1 == v2)
  25                 return 0;
  26         else
  27                 return -1;
  28 }
  29
  30 void EncodingGraph::buildGraph() {
  31         ElementIterator it(solver);
  32         while(it.hasNext()) {
  33                 Element * e = it.next();
  34                 switch(e->type) {
  35                 case ELEMSET:
  36                 case ELEMFUNCRETURN:
  37                         processElement(e);
  38                         break;
  39                 case ELEMCONST:
  40                         break;
  41                 default:
  42                         ASSERT(0);
  43                 }
  44         }
  45         bsdqsort(edgeVector.expose(), edgeVector.getSize(), sizeof(EncodingEdge *), sortEncodingEdge);
  46         decideEdges();
  47 }
  48
  49 void EncodingGraph::encode() {
  50         SetIteratorEncodingSubGraph * itesg=subgraphs.iterator();
  51         while(itesg->hasNext()) {
  52                 EncodingSubGraph *sg=itesg->next();
  53                 sg->encode();
  54         }
  55         delete itesg;
  56
  57         ElementIterator it(solver);
  58         while(it.hasNext()) {
  59                 Element * e = it.next();
  60                 switch(e->type) {
  61                 case ELEMSET:
  62                 case ELEMFUNCRETURN: {
  63                         ElementEncoding *encoding=e->getElementEncoding();
  64                         if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
  65                                 EncodingNode *n = getNode(e);
  66                                 if (n == NULL)
  67                                         continue;
  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);
  74                                         if (subgraph == NULL)
  75                                                 continue;
  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;
  86                                         }
  87                                 }
  88                         }
  89                         break;
  90                 }
  91                 default:
  92                         break;
  93                 }
  94                 encodeParent(e);
  95         }
  96 }
  97
  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)
 106                                 continue;
 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)
 114                                         return;
 115                                 EncodingEdge *edge=getEdge(left, right, NULL);
 116                                 if (edge != NULL && edge->getEncoding() == EDGE_MATCH) {
 117                                         fenc->setFunctionEncodingType(CIRCUIT);
 118                                 }
 119                         }
 120                 }
 121         }
 122 }
 123
 124 void EncodingGraph::mergeNodes(EncodingNode *first, EncodingNode *second) {
 125         EncodingSubGraph *graph1=graphMap.get(first);
 126         EncodingSubGraph *graph2=graphMap.get(second);
 127         if (graph1 == NULL && graph2 == NULL) {
 128                 graph1 = new EncodingSubGraph();
 129                 subgraphs.add(graph1);
 130                 graphMap.put(first, graph1);
 131                 graph1->addNode(first);
 132         }
 133         if (graph1 == NULL && graph2 != NULL) {
 134                 graph1 = graph2;
 135                 graph2 = NULL;
 136                 EncodingNode *tmp = second;
 137                 second = first;
 138                 first = tmp;
 139         }
 140         if (graph1 != NULL && graph2 != NULL) {
 141                 SetIteratorEncodingNode * nodeit=graph2->nodeIterator();
 142                 while(nodeit->hasNext()) {
 143                         EncodingNode *node=nodeit->next();
 144                         graph1->addNode(node);
 145                         graphMap.put(node, graph1);
 146                 }
 147                 subgraphs.remove(graph2);
 148                 delete nodeit;
 149                 delete graph2;
 150         } else {
 151                 ASSERT(graph1 != NULL && graph2 == NULL);
 152                 graph1->addNode(second);
 153                 graphMap.put(second, graph1);
 154         }
 155 }
 156
 157 void EncodingGraph::processElement(Element *e) {
 158         uint size=e->parents.getSize();
 159         for(uint i=0;i<size;i++) {
 160                 ASTNode * n = e->parents.get(i);
 161                 switch(n->type) {
 162                 case PREDICATEOP:
 163                         processPredicate((BooleanPredicate *)n);
 164                         break;
 165                 case ELEMFUNCRETURN:
 166                         processFunction((ElementFunction *)n);
 167                         break;
 168                 default:
 169                         ASSERT(0);
 170                 }
 171         }
 172 }
 173
 174 void EncodingGraph::processFunction(ElementFunction *ef) {
 175         Function *f=ef->getFunction();
 176         if (f->type==OPERATORFUNC) {
 177                 FunctionOperator *fo=(FunctionOperator*)f;
 178                 ASSERT(ef->inputs.getSize() == 2);
 179                 EncodingNode *left=createNode(ef->inputs.get(0));
 180                 EncodingNode *right=createNode(ef->inputs.get(1));
 181                 if (left == NULL && right == NULL)
 182                         return;
 183                 EncodingNode *dst=createNode(ef);
 184                 EncodingEdge *edge=createEdge(left, right, dst);
 185                 edge->numArithOps++;
 186         }
 187 }
 188
 189 void EncodingGraph::processPredicate(BooleanPredicate *b) {
 190         Predicate *p=b->getPredicate();
 191         if (p->type==OPERATORPRED) {
 192                 PredicateOperator *po=(PredicateOperator *)p;
 193                 ASSERT(b->inputs.getSize()==2);
 194                 EncodingNode *left=createNode(b->inputs.get(0));
 195                 EncodingNode *right=createNode(b->inputs.get(1));
 196                 if (left == NULL || right == NULL)
 197                         return;
 198                 EncodingEdge *edge=createEdge(left, right, NULL);
 199                 CompOp op=po->getOp();
 200                 switch(op) {
 201                 case SATC_EQUALS:
 202                         edge->numEquals++;
 203                         break;
 204                 case SATC_LT:
 205                 case SATC_LTE:
 206                 case SATC_GT:
 207                 case SATC_GTE:
 208                         edge->numComparisons++;
 209                         break;
 210                 default:
 211                         ASSERT(0);
 212                 }
 213         }
 214 }
 215
 216 uint convertSize(uint cost) {
 217         cost = 1.2 * cost; // fudge factor
 218         return NEXTPOW2(cost);
 219 }
 220
 221 void EncodingGraph::decideEdges() {
 222         uint size=edgeVector.getSize();
 223         for(uint i=0; i<size; i++) {
 224                 EncodingEdge *ee = edgeVector.get(i);
 225                 EncodingNode *left = ee->left;
 226                 EncodingNode *right = ee->right;
 227
 228                 if (ee->encoding != EDGE_UNASSIGNED ||
 229                                 left->encoding != BINARYINDEX ||
 230                                 right->encoding != BINARYINDEX)
 231                         continue;
 232
 233                 uint64_t eeValue = ee->getValue();
 234                 if (eeValue == 0)
 235                         return;
 236
 237                 EncodingSubGraph *leftGraph = graphMap.get(left);
 238                 EncodingSubGraph *rightGraph = graphMap.get(right);
 239                 if (leftGraph == NULL && rightGraph !=NULL) {
 240                         EncodingNode *tmp = left; left=right; right=tmp;
 241                         EncodingSubGraph *tmpsg = leftGraph; leftGraph = rightGraph; rightGraph = tmpsg;
 242                 }
 243
 244                 uint leftSize=0, rightSize=0, newSize=0;
 245                 uint64_t totalCost=0;
 246                 if (leftGraph == NULL && rightGraph == NULL) {
 247                         leftSize=convertSize(left->getSize());
 248                         rightSize=convertSize(right->getSize());
 249                         newSize=convertSize(left->s->getUnionSize(right->s));
 250                         newSize=(leftSize > newSize) ? leftSize: newSize;
 251                         newSize=(rightSize > newSize) ? rightSize: newSize;
 252                         totalCost = (newSize - leftSize) * left->elements.getSize() +
 253                                 (newSize - rightSize) * right->elements.getSize();
 254                 } else if (leftGraph != NULL && rightGraph == NULL) {
 255                         leftSize=convertSize(leftGraph->encodingSize);
 256                         rightSize=convertSize(right->getSize());
 257                         newSize=convertSize(leftGraph->estimateNewSize(right));
 258                         newSize=(leftSize > newSize) ? leftSize: newSize;
 259                         newSize=(rightSize > newSize) ? rightSize: newSize;
 260                         totalCost = (newSize - leftSize) * leftGraph->numElements +
 261                                 (newSize - rightSize) * right->elements.getSize();
 262                 } else {
 263                         //Neither are null
 264                         leftSize=convertSize(leftGraph->encodingSize);
 265                         rightSize=convertSize(rightGraph->encodingSize);
 266                         newSize=convertSize(leftGraph->estimateNewSize(rightGraph));
 267                         newSize=(leftSize > newSize) ? leftSize: newSize;
 268                         newSize=(rightSize > newSize) ? rightSize: newSize;
 269                         totalCost = (newSize - leftSize) * leftGraph->numElements +
 270                                 (newSize - rightSize) * rightGraph->numElements;
 271                 }
 272                 double conversionfactor = 0.5;
 273                 if ((totalCost * conversionfactor) < eeValue) {
 274                         //add the edge
 275                         mergeNodes(left, right);
 276                 }
 277         }
 278 }
 279
 280 static TunableDesc EdgeEncodingDesc(EDGE_UNASSIGNED, EDGE_MATCH, EDGE_UNASSIGNED);
 281
 282 EncodingEdge * EncodingGraph::getEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
 283         EncodingEdge e(left, right, dst);
 284         EncodingEdge *result = edgeMap.get(&e);
 285         return result;
 286 }
 287
 288 EncodingEdge * EncodingGraph::createEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
 289         EncodingEdge e(left, right, dst);
 290         EncodingEdge *result = edgeMap.get(&e);
 291         if (result == NULL) {
 292                 result=new EncodingEdge(left, right, dst);
 293                 VarType v1=left->getType();
 294                 VarType v2=right->getType();
 295                 if (v1 > v2) {
 296                         VarType tmp=v2;
 297                         v2=v1;
 298                         v1=tmp;
 299                 }
 300
 301                 if ((left != NULL && left->encoding==BINARYINDEX) &&
 302                                 (right != NULL) && right->encoding==BINARYINDEX) {
 303                         EdgeEncodingType type=(EdgeEncodingType)solver->getTuner()->getVarTunable(v1, v2, EDGEENCODING, &EdgeEncodingDesc);
 304                         result->setEncoding(type);
 305                         if (type == EDGE_MATCH) {
 306                                 mergeNodes(left, right);
 307                         }
 308                 }
 309                 edgeMap.put(result, result);
 310                 edgeVector.push(result);
 311                 if (left != NULL)
 312                         left->edges.add(result);
 313                 if (right != NULL)
 314                         right->edges.add(result);
 315                 if (dst != NULL)
 316                         dst->edges.add(result);
 317         }
 318         return result;
 319 }
 320
 321 EncodingNode::EncodingNode(Set *_s) :
 322         s(_s) {
 323 }
 324
 325 uint EncodingNode::getSize() const {
 326         return s->getSize();
 327 }
 328
 329 VarType EncodingNode::getType() const {
 330         return s->getType();
 331 }
 332
 333 static TunableDesc NodeEncodingDesc(ELEM_UNASSIGNED, BINARYINDEX, ELEM_UNASSIGNED);
 334
 335 EncodingNode * EncodingGraph::createNode(Element *e) {
 336         if (e->type == ELEMCONST)
 337                 return NULL;
 338         Set *s = e->getRange();
 339         EncodingNode *n = encodingMap.get(s);
 340         if (n == NULL) {
 341                 n = new EncodingNode(s);
 342                 n->setEncoding((ElementEncodingType)solver->getTuner()->getVarTunable(n->getType(), NODEENCODING, &NodeEncodingDesc));
 343                 encodingMap.put(s, n);
 344         }
 345         n->addElement(e);
 346         return n;
 347 }
 348
 349 EncodingNode * EncodingGraph::getNode(Element *e) {
 350         if (e->type == ELEMCONST)
 351                 return NULL;
 352         Set *s = e->getRange();
 353         EncodingNode *n = encodingMap.get(s);
 354         return n;
 355 }
 356
 357 void EncodingNode::addElement(Element *e) {
 358         elements.add(e);
 359 }
 360
 361 EncodingEdge::EncodingEdge(EncodingNode *_l, EncodingNode *_r) :
 362         left(_l),
 363         right(_r),
 364         dst(NULL),
 365         encoding(EDGE_UNASSIGNED),
 366         numArithOps(0),
 367         numEquals(0),
 368         numComparisons(0)
 369 {
 370 }
 371
 372 EncodingEdge::EncodingEdge(EncodingNode *_left, EncodingNode *_right, EncodingNode *_dst) :
 373         left(_left),
 374         right(_right),
 375         dst(_dst),
 376         encoding(EDGE_UNASSIGNED),
 377         numArithOps(0),
 378         numEquals(0),
 379         numComparisons(0)
 380 {
 381 }
 382
 383 uint hashEncodingEdge(EncodingEdge *edge) {
 384         uintptr_t hash=(((uintptr_t) edge->left) >> 2) ^ (((uintptr_t)edge->right) >> 4) ^ (((uintptr_t)edge->dst) >> 6);
 385         return (uint) hash;
 386 }
 387
 388 bool equalsEncodingEdge(EncodingEdge *e1, EncodingEdge *e2) {
 389         return e1->left == e2->left && e1->right == e2->right && e1->dst == e2->dst;
 390 }
 391
 392 uint64_t EncodingEdge::getValue() const {
 393         uint lSize = (left != NULL) ? left->getSize() : 1;
 394         uint rSize = (right != NULL) ? right->getSize() : 1;
 395         uint min = (lSize < rSize) ? lSize : rSize;
 396         return numEquals * min + numComparisons * lSize * rSize;
 397 }
 398
 399