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=getElementEncoding(e);
  64                         if (encoding->getElementEncodingType() == ELEM_UNASSIGNED) {
  65                                 EncodingNode *n = getNode(e);
  66                                 ASSERT(n != NULL);
  67                                 ElementEncodingType encodetype=n->getEncoding();
  68                                 encoding->setElementEncodingType(encodetype);
  69                                 if (encodetype == UNARY || encodetype == ONEHOT) {
  70                                         encoding->encodingArrayInitialization();
  71                                 } else if (encodetype == BINARYINDEX) {
  72                                         EncodingSubGraph * subgraph = graphMap.get(n);
  73                                         uint encodingSize = subgraph->getEncodingSize(n);
  74                                         uint paddedSize = encoding->getSizeEncodingArray(encodingSize);
  75                                         encoding->allocInUseArrayElement(paddedSize);
  76                                         encoding->allocEncodingArrayElement(paddedSize);
  77                                         Set * s=e->getRange();
  78                                         for(uint i=0;i<s->getSize();i++) {
  79                                                 uint64_t value=s->getElement(i);
  80                                                 uint encodingIndex=subgraph->getEncoding(n, value);
  81                                                 encoding->setInUseElement(encodingIndex);
  82                                                 encoding->encodingArray[encodingIndex] = value;
  83                                         }
  84                                 }
  85                         }
  86                         break;
  87                 }
  88                 default:
  89                         break;
  90                 }
  91         }
  92
  93 }
  94
  95 void EncodingGraph::mergeNodes(EncodingNode *first, EncodingNode *second) {
  96         EncodingSubGraph *graph1=graphMap.get(first);
  97         EncodingSubGraph *graph2=graphMap.get(second);
  98         if (graph1 == NULL && graph2 == NULL) {
  99                 graph1 = new EncodingSubGraph();
 100                 subgraphs.add(graph1);
 101                 graphMap.put(first, graph1);
 102                 graph1->addNode(first);
 103         }
 104         if (graph1 == NULL && graph2 != NULL) {
 105                 graph1 = graph2;
 106                 graph2 = NULL;
 107                 EncodingNode *tmp = second;
 108                 second = first;
 109                 first = tmp;
 110         }
 111         if (graph1 != NULL && graph2 != NULL) {
 112                 SetIteratorEncodingNode * nodeit=graph2->nodeIterator();
 113                 while(nodeit->hasNext()) {
 114                         EncodingNode *node=nodeit->next();
 115                         graph1->addNode(node);
 116                         graphMap.put(node, graph1);
 117                 }
 118                 subgraphs.remove(graph2);
 119                 delete nodeit;
 120                 delete graph2;
 121         } else {
 122                 ASSERT(graph1 != NULL && graph2 == NULL);
 123                 graph1->addNode(second);
 124                 graphMap.put(second, graph1);
 125         }
 126 }
 127
 128 void EncodingGraph::processElement(Element *e) {
 129         uint size=e->parents.getSize();
 130         for(uint i=0;i<size;i++) {
 131                 ASTNode * n = e->parents.get(i);
 132                 switch(n->type) {
 133                 case PREDICATEOP:
 134                         processPredicate((BooleanPredicate *)n);
 135                         break;
 136                 case ELEMFUNCRETURN:
 137                         processFunction((ElementFunction *)n);
 138                         break;
 139                 default:
 140                         ASSERT(0);
 141                 }
 142         }
 143 }
 144
 145 void EncodingGraph::processFunction(ElementFunction *ef) {
 146         Function *f=ef->getFunction();
 147         if (f->type==OPERATORFUNC) {
 148                 FunctionOperator *fo=(FunctionOperator*)f;
 149                 ASSERT(ef->inputs.getSize() == 2);
 150                 EncodingNode *left=createNode(ef->inputs.get(0));
 151                 EncodingNode *right=createNode(ef->inputs.get(1));
 152                 if (left == NULL && right == NULL)
 153                         return;
 154                 EncodingNode *dst=createNode(ef);
 155                 EncodingEdge *edge=getEdge(left, right, dst);
 156                 edge->numArithOps++;
 157         }
 158 }
 159
 160 void EncodingGraph::processPredicate(BooleanPredicate *b) {
 161         Predicate *p=b->getPredicate();
 162         if (p->type==OPERATORPRED) {
 163                 PredicateOperator *po=(PredicateOperator *)p;
 164                 ASSERT(b->inputs.getSize()==2);
 165                 EncodingNode *left=createNode(b->inputs.get(0));
 166                 EncodingNode *right=createNode(b->inputs.get(1));
 167                 if (left == NULL || right == NULL)
 168                         return;
 169                 EncodingEdge *edge=getEdge(left, right, NULL);
 170                 CompOp op=po->getOp();
 171                 switch(op) {
 172                 case SATC_EQUALS:
 173                         edge->numEquals++;
 174                         break;
 175                 case SATC_LT:
 176                 case SATC_LTE:
 177                 case SATC_GT:
 178                 case SATC_GTE:
 179                         edge->numComparisons++;
 180                         break;
 181                 default:
 182                         ASSERT(0);
 183                 }
 184         }
 185 }
 186
 187 uint convertSize(uint cost) {
 188         cost = 1.2 * cost; // fudge factor
 189         return NEXTPOW2(cost);
 190 }
 191
 192 void EncodingGraph::decideEdges() {
 193         uint size=edgeVector.getSize();
 194         for(uint i=0; i<size; i++) {
 195                 EncodingEdge *ee = edgeVector.get(i);
 196                 EncodingNode *left = ee->left;
 197                 EncodingNode *right = ee->right;
 198
 199                 if (ee->encoding != EDGE_UNASSIGNED ||
 200                                 left->encoding != BINARYINDEX ||
 201                                 right->encoding != BINARYINDEX)
 202                         continue;
 203
 204                 uint64_t eeValue = ee->getValue();
 205                 if (eeValue == 0)
 206                         return;
 207
 208                 EncodingSubGraph *leftGraph = graphMap.get(left);
 209                 EncodingSubGraph *rightGraph = graphMap.get(right);
 210                 if (leftGraph == NULL && rightGraph !=NULL) {
 211                         EncodingNode *tmp = left; left=right; right=tmp;
 212                         EncodingSubGraph *tmpsg = leftGraph; leftGraph = rightGraph; rightGraph = tmpsg;
 213                 }
 214
 215                 uint leftSize=0, rightSize=0, newSize=0;
 216                 uint64_t totalCost=0;
 217                 if (leftGraph == NULL && rightGraph == NULL) {
 218                         leftSize=convertSize(left->getSize());
 219                         rightSize=convertSize(right->getSize());
 220                         newSize=convertSize(left->s->getUnionSize(right->s));
 221                         newSize=(leftSize > newSize) ? leftSize: newSize;
 222                         newSize=(rightSize > newSize) ? rightSize: newSize;
 223                         totalCost = (newSize - leftSize) * left->elements.getSize() +
 224                                 (newSize - rightSize) * right->elements.getSize();
 225                 } else if (leftGraph != NULL && rightGraph == NULL) {
 226                         leftSize=convertSize(leftGraph->encodingSize);
 227                         rightSize=convertSize(right->getSize());
 228                         newSize=convertSize(leftGraph->estimateNewSize(right));
 229                         newSize=(leftSize > newSize) ? leftSize: newSize;
 230                         newSize=(rightSize > newSize) ? rightSize: newSize;
 231                         totalCost = (newSize - leftSize) * leftGraph->numElements +
 232                                 (newSize - rightSize) * right->elements.getSize();
 233                 } else {
 234                         //Neither are null
 235                         leftSize=convertSize(leftGraph->encodingSize);
 236                         rightSize=convertSize(rightGraph->encodingSize);
 237                         newSize=convertSize(leftGraph->estimateNewSize(rightGraph));
 238                         newSize=(leftSize > newSize) ? leftSize: newSize;
 239                         newSize=(rightSize > newSize) ? rightSize: newSize;
 240                         totalCost = (newSize - leftSize) * leftGraph->numElements +
 241                                 (newSize - rightSize) * rightGraph->numElements;
 242                 }
 243                 double conversionfactor = 0.5;
 244                 if ((totalCost * conversionfactor) < eeValue) {
 245                         //add the edge
 246                         mergeNodes(left, right);
 247                 }
 248         }
 249 }
 250
 251 static TunableDesc EdgeEncodingDesc(EDGE_UNASSIGNED, EDGE_MATCH, EDGE_UNASSIGNED);
 252
 253 EncodingEdge * EncodingGraph::getEdge(EncodingNode *left, EncodingNode *right, EncodingNode *dst) {
 254         EncodingEdge e(left, right, dst);
 255         EncodingEdge *result = edgeMap.get(&e);
 256         if (result == NULL) {
 257                 result=new EncodingEdge(left, right, dst);
 258                 VarType v1=left->getType();
 259                 VarType v2=right->getType();
 260                 if (v1 > v2) {
 261                         VarType tmp=v2;
 262                         v2=v1;
 263                         v1=tmp;
 264                 }
 265
 266                 if ((left != NULL && left->encoding==BINARYINDEX) &&
 267                                 (right != NULL) && right->encoding==BINARYINDEX) {
 268                         EdgeEncodingType type=(EdgeEncodingType)solver->getTuner()->getVarTunable(v1, v2, EDGEENCODING, &EdgeEncodingDesc);
 269                         result->setEncoding(type);
 270                         if (type == EDGE_MATCH) {
 271                                 mergeNodes(left, right);
 272                         }
 273                 }
 274                 edgeMap.put(result, result);
 275                 edgeVector.push(result);
 276                 if (left != NULL)
 277                         left->edges.add(result);
 278                 if (right != NULL)
 279                         right->edges.add(result);
 280                 if (dst != NULL)
 281                         dst->edges.add(result);
 282         }
 283         return result;
 284 }
 285
 286 EncodingNode::EncodingNode(Set *_s) :
 287         s(_s) {
 288 }
 289
 290 uint EncodingNode::getSize() const {
 291         return s->getSize();
 292 }
 293
 294 VarType EncodingNode::getType() const {
 295         return s->getType();
 296 }
 297
 298 static TunableDesc NodeEncodingDesc(ELEM_UNASSIGNED, BINARYINDEX, ELEM_UNASSIGNED);
 299
 300 EncodingNode * EncodingGraph::createNode(Element *e) {
 301         if (e->type == ELEMCONST)
 302                 return NULL;
 303         Set *s = e->getRange();
 304         EncodingNode *n = encodingMap.get(s);
 305         if (n == NULL) {
 306                 n = new EncodingNode(s);
 307                 n->setEncoding((ElementEncodingType)solver->getTuner()->getVarTunable(n->getType(), NODEENCODING, &NodeEncodingDesc));
 308                 encodingMap.put(s, n);
 309         }
 310         n->addElement(e);
 311         return n;
 312 }
 313
 314 EncodingNode * EncodingGraph::getNode(Element *e) {
 315         if (e->type == ELEMCONST)
 316                 return NULL;
 317         Set *s = e->getRange();
 318         EncodingNode *n = encodingMap.get(s);
 319         return n;
 320 }
 321
 322 void EncodingNode::addElement(Element *e) {
 323         elements.add(e);
 324 }
 325
 326 EncodingEdge::EncodingEdge(EncodingNode *_l, EncodingNode *_r) :
 327         left(_l),
 328         right(_r),
 329         dst(NULL),
 330         encoding(EDGE_UNASSIGNED),
 331         numArithOps(0),
 332         numEquals(0),
 333         numComparisons(0)
 334 {
 335 }
 336
 337 EncodingEdge::EncodingEdge(EncodingNode *_left, EncodingNode *_right, EncodingNode *_dst) :
 338         left(_left),
 339         right(_right),
 340         dst(_dst),
 341         encoding(EDGE_UNASSIGNED),
 342         numArithOps(0),
 343         numEquals(0),
 344         numComparisons(0)
 345 {
 346 }
 347
 348 uint hashEncodingEdge(EncodingEdge *edge) {
 349         uintptr_t hash=(((uintptr_t) edge->left) >> 2) ^ (((uintptr_t)edge->right) >> 4) ^ (((uintptr_t)edge->dst) >> 6);
 350         return (uint) hash;
 351 }
 352
 353 bool equalsEncodingEdge(EncodingEdge *e1, EncodingEdge *e2) {
 354         return e1->left == e2->left && e1->right == e2->right && e1->dst == e2->dst;
 355 }
 356
 357 uint64_t EncodingEdge::getValue() const {
 358         uint lSize = (left != NULL) ? left->getSize() : 1;
 359         uint rSize = (right != NULL) ? right->getSize() : 1;
 360         uint min = (lSize < rSize) ? lSize : rSize;
 361         return numEquals * min + numComparisons * lSize * rSize;
 362 }
 363
 364