graph.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420
  1. /*****************************************************************************
  2. * dcc project CFG related functions
  3. * (C) Cristina Cifuentes
  4. ****************************************************************************/
  5. #include "dcc.h"
  6. #include <string.h>
  7. #if __BORLAND__
  8. #include <alloc.h>
  9. #else
  10. #include <malloc.h> /* For free() */
  11. #endif
  12. #include "graph.h"
  13. //static BB * rmJMP(Function * pProc, int marker, BB * pBB);
  14. static void mergeFallThrough(Function * pProc, BB * pBB);
  15. static void dfsNumbering(BB * pBB, std::vector<BB*> &dfsLast, int *first, int *last);
  16. /*****************************************************************************
  17. * createCFG - Create the basic control flow graph
  18. ****************************************************************************/
  19. void Function::createCFG()
  20. {
  21. /* Splits Icode associated with the procedure into Basic Blocks.
  22. * The links between BBs represent the control flow graph of the
  23. * procedure.
  24. * A Basic Block is defined to end on one of the following instructions:
  25. * 1) Conditional and unconditional jumps
  26. * 2) CALL(F)
  27. * 3) RET(F)
  28. * 4) On the instruction before a join (a flagged TARGET)
  29. * 5) Repeated string instructions
  30. * 6) End of procedure
  31. */
  32. int i;
  33. int ip, start;
  34. BB * psBB;
  35. BB * pBB;
  36. iICODE pIcode = Icode.begin();
  37. stats.numBBbef = stats.numBBaft = 0;
  38. for (ip = start = 0; pIcode!=Icode.end(); ip++, pIcode++)
  39. {
  40. LLInst *ll = pIcode->ll();
  41. /* Stick a NOWHERE_NODE on the end if we terminate
  42. * with anything other than a ret, jump or terminate */
  43. if (ip + 1 == Icode.size() and
  44. (not ll->testFlags(TERMINATES)) and
  45. (not ll->match(iJMP)) and (not ll->match(iJMPF)) and
  46. (not ll->match(iRET)) and (not ll->match(iRETF)))
  47. {
  48. pBB=BB::Create(start, ip, NOWHERE_NODE, 0, this);
  49. }
  50. /* Only process icodes that have valid instructions */
  51. else if (not ll->testFlags(NO_CODE) )
  52. {
  53. switch (ll->getOpcode()) {
  54. case iJB: case iJBE: case iJAE: case iJA:
  55. case iJL: case iJLE: case iJGE: case iJG:
  56. case iJE: case iJNE: case iJS: case iJNS:
  57. case iJO: case iJNO: case iJP: case iJNP:
  58. case iJCXZ:
  59. pBB = BB::Create(start, ip, TWO_BRANCH, 2, this);
  60. CondJumps:
  61. start = ip + 1;
  62. pBB->edges[0].ip = (uint32_t)start;
  63. /* This is for jumps off into nowhere */
  64. if ( ll->testFlags(NO_LABEL) )
  65. {
  66. pBB->edges.pop_back();
  67. }
  68. else
  69. pBB->edges[1].ip = ll->src.op();
  70. break;
  71. case iLOOP: case iLOOPE: case iLOOPNE:
  72. pBB = BB::Create(start, ip, LOOP_NODE, 2, this);
  73. goto CondJumps;
  74. case iJMPF: case iJMP:
  75. if (ll->testFlags(SWITCH))
  76. {
  77. pBB = BB::Create(start, ip, MULTI_BRANCH, ll->caseTbl.numEntries, this);
  78. for (i = 0; i < ll->caseTbl.numEntries; i++)
  79. pBB->edges[i].ip = ll->caseTbl.entries[i];
  80. hasCase = TRUE;
  81. }
  82. else if ((ll->getFlag() & (I | NO_LABEL)) == I) //TODO: WHY NO_LABEL TESTIT
  83. {
  84. pBB = BB::Create(start, ip, ONE_BRANCH, 1, this);
  85. pBB->edges[0].ip = ll->src.op();
  86. }
  87. else
  88. BB::Create(start, ip, NOWHERE_NODE, 0, this);
  89. start = ip + 1;
  90. break;
  91. case iCALLF: case iCALL:
  92. {
  93. Function * p = ll->src.proc.proc;
  94. if (p)
  95. i = ((p->flg) & TERMINATES) ? 0 : 1;
  96. else
  97. i = 1;
  98. pBB = BB::Create(start, ip, CALL_NODE, i, this);
  99. start = ip + 1;
  100. if (i)
  101. pBB->edges[0].ip = (uint32_t)start;
  102. }
  103. break;
  104. case iRET: case iRETF:
  105. BB::Create(start, ip, RETURN_NODE, 0, this);
  106. start = ip + 1;
  107. break;
  108. default:
  109. /* Check for exit to DOS */
  110. iICODE next1=++iICODE(pIcode);
  111. if ( ll->testFlags(TERMINATES) )
  112. {
  113. pBB = BB::Create(start, ip, TERMINATE_NODE, 0, this);
  114. start = ip + 1;
  115. }
  116. /* Check for a fall through */
  117. else if (next1 != Icode.end())
  118. {
  119. assert(next1->loc_ip==ip+1);
  120. if (next1->ll()->testFlags(TARGET | CASE))
  121. {
  122. pBB = BB::Create(start, ip, FALL_NODE, 1, this);
  123. start = ip + 1;
  124. pBB->edges[0].ip = (uint32_t)start;
  125. }
  126. }
  127. break;
  128. }
  129. }
  130. }
  131. auto iter=heldBBs.begin();
  132. /* Convert list of BBs into a graph */
  133. for (; iter!=heldBBs.end(); ++iter)
  134. {
  135. pBB = *iter;
  136. for (i = 0; i < pBB->edges.size(); i++)
  137. {
  138. ip = pBB->edges[i].ip;
  139. if (ip >= SYNTHESIZED_MIN)
  140. {
  141. fatalError (INVALID_SYNTHETIC_BB);
  142. return ;
  143. }
  144. auto iter2=std::find_if(heldBBs.begin(),heldBBs.end(),
  145. [ip](BB *psBB)->bool {return psBB->begin()==ip;});
  146. if(iter2==heldBBs.end())
  147. fatalError(NO_BB, ip, name.c_str());
  148. psBB = *iter2;
  149. pBB->edges[i].BBptr = psBB;
  150. psBB->inEdges.push_back((BB *)nullptr);
  151. }
  152. }
  153. }
  154. void Function::markImpure()
  155. {
  156. SYM * psym;
  157. #ifdef _lint
  158. for (auto i=Icode.begin(); i!=Icode.end(); ++i)
  159. {
  160. ICODE &icod(*i);
  161. #else
  162. for(ICODE &icod : Icode)
  163. {
  164. #endif
  165. if ( not icod.ll()->testFlags(SYM_USE | SYM_DEF))
  166. continue;
  167. psym = &symtab[icod.ll()->caseTbl.numEntries];
  168. for (int c = (int)psym->label; c < (int)psym->label+psym->size; c++)
  169. {
  170. if (BITMAP(c, BM_CODE))
  171. {
  172. icod.ll()->setFlags(IMPURE);
  173. flg |= IMPURE;
  174. break;
  175. }
  176. }
  177. }
  178. }
  179. /*****************************************************************************
  180. * newBB - Allocate new BB and link to end of list
  181. *****************************************************************************/
  182. /*****************************************************************************
  183. * freeCFG - Deallocates a cfg
  184. ****************************************************************************/
  185. void Function::freeCFG()
  186. {
  187. #ifdef _lint
  188. for (auto i=heldBBs.begin(); i!=heldBBs.end(); ++i)
  189. {
  190. BB *p(*i);
  191. #else
  192. for(BB *p : heldBBs)
  193. {
  194. #endif
  195. delete p;
  196. }
  197. }
  198. /*****************************************************************************
  199. * compressCFG - Remove redundancies and add in-edge information
  200. ****************************************************************************/
  201. void Function::compressCFG()
  202. {
  203. BB * pBB, *pNxt;
  204. int ip, first=0, last, i;
  205. /* First pass over BB list removes redundant jumps of the form
  206. * (Un)Conditional -> Unconditional jump */
  207. auto iter=m_cfg.begin();
  208. for (;iter!=m_cfg.end(); ++iter)
  209. {
  210. pBB = *iter;
  211. if(pBB->inEdges.empty() || (pBB->nodeType != ONE_BRANCH && pBB->nodeType != TWO_BRANCH))
  212. continue;
  213. for (i = 0; i < pBB->edges.size(); i++)
  214. {
  215. ip = pBB->rbegin();
  216. pNxt = pBB->edges[i].BBptr->rmJMP(ip, pBB->edges[i].BBptr);
  217. if (not pBB->edges.empty()) /* Might have been clobbered */
  218. {
  219. pBB->edges[i].BBptr = pNxt;
  220. assert(pBB->back().loc_ip==ip);
  221. pBB->back().ll()->SetImmediateOp((uint32_t)pNxt->begin());
  222. //Icode[ip].SetImmediateOp((uint32_t)pNxt->begin());
  223. }
  224. }
  225. }
  226. /* Next is a depth-first traversal merging any FALL_NODE or
  227. * ONE_BRANCH that fall through to a node with that as their only
  228. * in-edge. */
  229. m_cfg.front()->mergeFallThrough(Icode);
  230. /* Remove redundant BBs created by the above compressions
  231. * and allocate in-edge arrays as required. */
  232. stats.numBBaft = stats.numBBbef;
  233. for(auto iter=m_cfg.begin(); iter!=m_cfg.end(); ++iter)
  234. {
  235. pBB = *iter;
  236. if (pBB->inEdges.empty())
  237. {
  238. if (iter == m_cfg.begin()) /* Init it misses out on */
  239. pBB->index = UN_INIT;
  240. else
  241. {
  242. delete pBB;
  243. stats.numBBaft--;
  244. }
  245. }
  246. else
  247. {
  248. pBB->inEdgeCount = pBB->inEdges.size();
  249. }
  250. }
  251. /* Allocate storage for dfsLast[] array */
  252. numBBs = stats.numBBaft;
  253. m_dfsLast.resize(numBBs,0); // = (BB **)allocMem(numBBs * sizeof(BB *))
  254. /* Now do a dfs numbering traversal and fill in the inEdges[] array */
  255. last = numBBs - 1;
  256. m_cfg.front()->dfsNumbering(m_dfsLast, &first, &last);
  257. }
  258. /****************************************************************************
  259. * rmJMP - If BB addressed is just a JMP it is replaced with its target
  260. ***************************************************************************/
  261. BB *BB::rmJMP(int marker, BB * pBB)
  262. {
  263. marker += DFS_JMP;
  264. while (pBB->nodeType == ONE_BRANCH && pBB->size() == 1)
  265. {
  266. if (pBB->traversed != marker)
  267. {
  268. pBB->traversed = marker;
  269. pBB->inEdges.pop_back();
  270. if (not pBB->inEdges.empty())
  271. {
  272. pBB->edges[0].BBptr->inEdges.push_back((BB *)nullptr);
  273. }
  274. else
  275. {
  276. pBB->front().ll()->setFlags(NO_CODE);
  277. pBB->front().invalidate(); //pProc->Icode.SetLlInvalid(pBB->begin(), TRUE);
  278. }
  279. pBB = pBB->edges[0].BBptr;
  280. }
  281. else
  282. {
  283. /* We are going around in circles */
  284. pBB->nodeType = NOWHERE_NODE;
  285. pBB->front().ll()->src.SetImmediateOp(pBB->front().loc_ip);
  286. //pBB->front().ll()->src.immed.op = pBB->front().loc_ip;
  287. do {
  288. pBB = pBB->edges[0].BBptr;
  289. pBB->inEdges.pop_back(); // was --numInedges
  290. if (! pBB->inEdges.empty())
  291. {
  292. pBB->front().ll()->setFlags(NO_CODE);
  293. pBB->front().invalidate();
  294. // pProc->Icode.setFlags(pBB->start, NO_CODE);
  295. // pProc->Icode.SetLlInvalid(pBB->start, TRUE);
  296. }
  297. } while (pBB->nodeType != NOWHERE_NODE);
  298. pBB->edges.clear();
  299. }
  300. }
  301. return pBB;
  302. }
  303. /*****************************************************************************
  304. * mergeFallThrough
  305. ****************************************************************************/
  306. void BB::mergeFallThrough( CIcodeRec &Icode)
  307. {
  308. BB * pChild;
  309. int i;
  310. if (!this)
  311. {
  312. printf("mergeFallThrough on empty BB!\n");
  313. }
  314. while (nodeType == FALL_NODE || nodeType == ONE_BRANCH)
  315. {
  316. pChild = edges[0].BBptr;
  317. /* Jump to next instruction can always be removed */
  318. if (nodeType == ONE_BRANCH)
  319. {
  320. assert(Parent==pChild->Parent);
  321. if(back().loc_ip>pChild->front().loc_ip) // back edege
  322. break;
  323. auto iter=std::find_if(this->end2(),pChild->begin2(),[](ICODE &c)
  324. {return not c.ll()->testFlags(NO_CODE);});
  325. if (iter != pChild->begin2())
  326. break;
  327. back().ll()->setFlags(NO_CODE);
  328. back().invalidate();
  329. nodeType = FALL_NODE;
  330. length--;
  331. }
  332. /* If there's no other edges into child can merge */
  333. if (pChild->inEdges.size() != 1)
  334. break;
  335. nodeType = pChild->nodeType;
  336. length = (pChild->start - start) + pChild->length ;
  337. pChild->front().ll()->clrFlags(TARGET);
  338. edges.swap(pChild->edges);
  339. pChild->inEdges.clear();
  340. pChild->edges.clear();
  341. }
  342. traversed = DFS_MERGE;
  343. /* Process all out edges recursively */
  344. for (i = 0; i < edges.size(); i++)
  345. if (edges[i].BBptr->traversed != DFS_MERGE)
  346. edges[i].BBptr->mergeFallThrough(Icode);
  347. }
  348. /*****************************************************************************
  349. * dfsNumbering - Numbers nodes during first and last visits and determine
  350. * in-edges
  351. ****************************************************************************/
  352. void BB::dfsNumbering(std::vector<BB *> &dfsLast, int *first, int *last)
  353. {
  354. BB * pChild;
  355. traversed = DFS_NUM;
  356. dfsFirstNum = (*first)++;
  357. /* index is being used as an index to inEdges[]. */
  358. // for (i = 0; i < edges.size(); i++)
  359. #ifdef _lint
  360. for (auto i=edges.begin(); i!=edges.end(); ++i)
  361. {
  362. auto edge(*i);
  363. #else
  364. for(auto edge : edges)
  365. {
  366. #endif
  367. pChild = edge.BBptr;
  368. pChild->inEdges[pChild->index++] = this;
  369. /* Is this the last visit? */
  370. if (pChild->index == pChild->inEdges.size())
  371. pChild->index = UN_INIT;
  372. if (pChild->traversed != DFS_NUM)
  373. pChild->dfsNumbering(dfsLast, first, last);
  374. }
  375. dfsLastNum = *last;
  376. dfsLast[(*last)--] = this;
  377. }