pnodewalk.h 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551
  1. //-------------------------------------------------------------------------------------------------------
  2. // Copyright (C) Microsoft. All rights reserved.
  3. // Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.
  4. //-------------------------------------------------------------------------------------------------------
  5. #pragma once
  6. template <class ResultType, class Context>
  7. struct WalkerPolicyBase
  8. {
  9. typedef ResultType ResultType;
  10. typedef Context Context;
  11. inline bool ContinueWalk(ResultType) { return true; }
  12. inline ResultType DefaultResult() { return ResultType(); }
  13. inline ResultType WalkNode(ParseNode *pnode, Context context) { return DefaultResult(); }
  14. inline ResultType WalkListNode(ParseNode *pnode, Context context) { return DefaultResult(); }
  15. virtual ResultType WalkChild(ParseNode *pnode, Context context) { return DefaultResult(); }
  16. inline ResultType WalkFirstChild(ParseNode *pnode, Context context) { return WalkChild(pnode, context); }
  17. inline ResultType WalkSecondChild(ParseNode *pnode, Context context) { return WalkChild(pnode, context); }
  18. inline ResultType WalkNthChild(ParseNode *pparentnode, ParseNode *pnode, Context context) { return WalkChild(pnode, context); }
  19. inline void WalkReference(ParseNode **ppnode, Context context) { }
  20. };
  21. template <class Context>
  22. struct WalkerPolicyBase<bool, Context>
  23. {
  24. typedef bool ResultType;
  25. typedef Context Context;
  26. inline bool ContinueWalk(ResultType) { return true; }
  27. inline bool DefaultResult() { return true; }
  28. inline ResultType WalkNode(ParseNode *pnode, Context context) { return DefaultResult(); }
  29. inline ResultType WalkListNode(ParseNode *pnode, Context context) { return DefaultResult(); }
  30. virtual ResultType WalkChild(ParseNode *pnode, Context context) { return DefaultResult(); }
  31. inline ResultType WalkFirstChild(ParseNode *pnode, Context context) { return WalkChild(pnode, context); }
  32. inline ResultType WalkSecondChild(ParseNode *pnode, Context context) { return WalkChild(pnode, context); }
  33. inline ResultType WalkNthChild(ParseNode *pparentnode, ParseNode *pnode, Context context) { return WalkChild(pnode, context); }
  34. inline void WalkReference(ParseNode **ppnode, Context context) { }
  35. };
  36. template <typename WalkerPolicy>
  37. class ParseNodeWalker : public WalkerPolicy
  38. {
  39. public:
  40. typedef typename WalkerPolicy::Context Context;
  41. protected:
  42. typedef typename WalkerPolicy::ResultType ResultType;
  43. private:
  44. ResultType WalkList(ParseNode *pnodeparent, ParseNode *&pnode, Context context)
  45. {
  46. ResultType result = DefaultResult();
  47. bool first = true;
  48. if (pnode)
  49. {
  50. result = WalkListNode(pnode, context);
  51. if (!ContinueWalk(result)) return result;
  52. ParseNodePtr current = pnode;
  53. ParseNodePtr *ppnode = &pnode;
  54. // Skip list nodes and nested VarDeclList nodes
  55. while ((current->nop == knopList && (current->grfpn & PNodeFlags::fpnDclList) == 0) ||
  56. (current->nop == pnode->nop && (current->grfpn & pnode->grfpn & PNodeFlags::fpnDclList)))
  57. {
  58. WalkReference(&current->sxBin.pnode1, context);
  59. result = first ? WalkFirstChild(current->sxBin.pnode1, context) : WalkNthChild(pnodeparent, current->sxBin.pnode1, context);
  60. first = false;
  61. if (!ContinueWalk(result)) return result;
  62. ppnode = &current->sxBin.pnode2;
  63. current = *ppnode;
  64. }
  65. WalkReference(ppnode, context);
  66. result = first ? WalkFirstChild(*ppnode, context) : WalkNthChild(pnodeparent, *ppnode, context);
  67. }
  68. // Reset the reference back.
  69. WalkReference(nullptr, context);
  70. return result;
  71. }
  72. ResultType WalkLeaf(ParseNode *pnode, Context context)
  73. {
  74. return WalkNode(pnode, context);
  75. }
  76. ResultType WalkPreUnary(ParseNode *pnode, Context context)
  77. {
  78. ResultType result = WalkNode(pnode, context);
  79. if (ContinueWalk(result) && pnode->sxUni.pnode1) result = WalkFirstChild(pnode->sxUni.pnode1, context);
  80. return result;
  81. }
  82. ResultType WalkPostUnary(ParseNode *pnode, Context context)
  83. {
  84. ResultType result = WalkFirstChild(pnode->sxUni.pnode1, context);
  85. if (ContinueWalk(result)) result = WalkNode(pnode, context);
  86. return result;
  87. }
  88. ResultType WalkBinary(ParseNode *pnode, Context context)
  89. {
  90. ResultType result = WalkFirstChild(pnode->sxBin.pnode1, context);
  91. if (ContinueWalk(result))
  92. {
  93. result = WalkNode(pnode, context);
  94. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxBin.pnode2, context);
  95. }
  96. return result;
  97. }
  98. ResultType WalkTernary(ParseNode *pnode, Context context)
  99. {
  100. ResultType result = WalkFirstChild(pnode->sxTri.pnode1, context);
  101. if (ContinueWalk(result))
  102. {
  103. result = WalkNode(pnode, context);
  104. if (ContinueWalk(result))
  105. {
  106. result = WalkSecondChild(pnode->sxTri.pnode2, context);
  107. if (ContinueWalk(result)) result = WalkNthChild(pnode, pnode->sxTri.pnode3, context);
  108. }
  109. }
  110. return result;
  111. }
  112. ResultType WalkCall(ParseNode *pnode, Context context)
  113. {
  114. ResultType result = WalkFirstChild(pnode->sxBin.pnode1, context);
  115. if (ContinueWalk(result))
  116. {
  117. result = WalkNode(pnode, context);
  118. if (ContinueWalk(result)) result = WalkList(pnode, pnode->sxBin.pnode2, context);
  119. }
  120. return result;
  121. }
  122. ResultType WalkStringTemplate(ParseNode *pnode, Context context)
  123. {
  124. ResultType result;
  125. if (!pnode->sxStrTemplate.isTaggedTemplate)
  126. {
  127. if (pnode->sxStrTemplate.pnodeSubstitutionExpressions == nullptr)
  128. {
  129. // If we don't have any substitution expressions, then we should only have one string literal and not a list
  130. result = WalkNode(pnode->sxStrTemplate.pnodeStringLiterals, context);
  131. }
  132. else
  133. {
  134. result = WalkList(pnode, pnode->sxStrTemplate.pnodeSubstitutionExpressions, context);
  135. if (ContinueWalk(result))
  136. {
  137. result = WalkList(pnode, pnode->sxStrTemplate.pnodeStringLiterals, context);
  138. }
  139. }
  140. }
  141. else
  142. {
  143. // Tagged template nodes are call nodes
  144. result = WalkCall(pnode, context);
  145. }
  146. return result;
  147. }
  148. ResultType WalkVar(ParseNode *pnode, Context context)
  149. {
  150. ResultType result = WalkNode(pnode, context);
  151. if (ContinueWalk(result) && pnode->sxVar.pnodeInit) result = WalkFirstChild(pnode->sxVar.pnodeInit, context);
  152. return result;
  153. }
  154. ResultType WalkFnc(ParseNode *pnode, Context context)
  155. {
  156. ResultType result;
  157. // For ordering, arguments are considered prior to the function and the body after.
  158. for (ParseNode** argNode = &(pnode->sxFnc.pnodeArgs); *argNode != nullptr; argNode = &((*argNode)->sxVar.pnodeNext))
  159. {
  160. result = *argNode == pnode->sxFnc.pnodeArgs ? WalkFirstChild(*argNode, context) : WalkNthChild(pnode, *argNode, context);
  161. if (!ContinueWalk(result)) return result;
  162. }
  163. if (pnode->sxFnc.pnodeRest != nullptr)
  164. {
  165. result = WalkSecondChild(pnode->sxFnc.pnodeRest, context);
  166. if (!ContinueWalk(result)) return result;
  167. }
  168. result = WalkNode(pnode, context);
  169. if (ContinueWalk(result)) result = WalkNthChild(pnode, pnode->sxFnc.pnodeBody, context);
  170. return result;
  171. }
  172. ResultType WalkProg(ParseNode *pnode, Context context)
  173. {
  174. ResultType result = WalkNode(pnode, context);
  175. if (ContinueWalk(result)) result = WalkList(pnode, pnode->sxFnc.pnodeBody, context);
  176. return result;
  177. }
  178. ResultType WalkFor(ParseNode *pnode, Context context)
  179. {
  180. ResultType result = WalkFirstChild(pnode->sxFor.pnodeInit, context);
  181. if (ContinueWalk(result))
  182. {
  183. result = WalkNthChild(pnode, pnode->sxFor.pnodeCond, context);
  184. if (ContinueWalk(result))
  185. {
  186. result = WalkNthChild(pnode, pnode->sxFor.pnodeIncr, context);
  187. if (ContinueWalk(result))
  188. {
  189. result = WalkNode(pnode, context);
  190. if (ContinueWalk(result))
  191. {
  192. result = WalkSecondChild(pnode->sxFor.pnodeBody, context);
  193. }
  194. }
  195. }
  196. }
  197. return result;
  198. }
  199. ResultType WalkIf(ParseNode *pnode, Context context)
  200. {
  201. ResultType result = WalkFirstChild(pnode->sxIf.pnodeCond, context);
  202. if (ContinueWalk(result))
  203. {
  204. result = WalkNode(pnode, context);
  205. if (ContinueWalk(result))
  206. {
  207. result = WalkSecondChild(pnode->sxIf.pnodeTrue, context);
  208. if (ContinueWalk(result) && pnode->sxIf.pnodeFalse)
  209. result = WalkNthChild(pnode, pnode->sxIf.pnodeFalse, context);
  210. }
  211. }
  212. return result;
  213. }
  214. ResultType WalkWhile(ParseNode *pnode, Context context)
  215. {
  216. ResultType result = WalkFirstChild(pnode->sxWhile.pnodeCond, context);
  217. if (ContinueWalk(result))
  218. {
  219. result = WalkNode(pnode, context);
  220. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxWhile.pnodeBody, context);
  221. }
  222. return result;
  223. }
  224. ResultType WalkDoWhile(ParseNode *pnode, Context context)
  225. {
  226. ResultType result = WalkFirstChild(pnode->sxWhile.pnodeBody, context);
  227. if (ContinueWalk(result))
  228. {
  229. result = WalkNode(pnode, context);
  230. if (ContinueWalk(result))
  231. {
  232. result = WalkSecondChild(pnode->sxWhile.pnodeCond, context);
  233. }
  234. }
  235. return result;
  236. }
  237. ResultType WalkForInOrForOf(ParseNode *pnode, Context context)
  238. {
  239. ResultType result = WalkFirstChild(pnode->sxForInOrForOf.pnodeLval, context);
  240. if (ContinueWalk(result))
  241. {
  242. result = WalkNthChild(pnode, pnode->sxForInOrForOf.pnodeObj, context);
  243. if (ContinueWalk(result))
  244. {
  245. result = WalkNode(pnode, context);
  246. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxForInOrForOf.pnodeBody, context);
  247. }
  248. }
  249. return result;
  250. }
  251. ResultType WalkReturn(ParseNode *pnode, Context context)
  252. {
  253. ResultType result = WalkNode(pnode, context);
  254. if (ContinueWalk(result) && pnode->sxReturn.pnodeExpr) result = WalkFirstChild(pnode->sxReturn.pnodeExpr, context);
  255. return result;
  256. }
  257. ResultType WalkBlock(ParseNode *pnode, Context context)
  258. {
  259. ResultType result = WalkNode(pnode, context);
  260. if (ContinueWalk(result) && pnode->sxBlock.pnodeStmt)
  261. result = WalkList(pnode, pnode->sxBlock.pnodeStmt, context);
  262. return result;
  263. }
  264. ResultType WalkWith(ParseNode *pnode, Context context)
  265. {
  266. ResultType result = WalkFirstChild(pnode->sxWith.pnodeObj, context);
  267. if (ContinueWalk(result))
  268. {
  269. result = WalkNode(pnode, context);
  270. if (ContinueWalk(result))
  271. {
  272. result = WalkSecondChild(pnode->sxWith.pnodeBody, context);
  273. }
  274. }
  275. return result;
  276. }
  277. ResultType WalkSwitch(ParseNode *pnode, Context context)
  278. {
  279. ResultType result = WalkFirstChild(pnode->sxSwitch.pnodeVal, context);
  280. if (ContinueWalk(result))
  281. {
  282. for (ParseNode** caseNode = &(pnode->sxSwitch.pnodeCases); *caseNode != nullptr; caseNode = &((*caseNode)->sxCase.pnodeNext))
  283. {
  284. result = *caseNode == pnode->sxSwitch.pnodeCases ? WalkFirstChild(*caseNode, context) : WalkNthChild(pnode, *caseNode, context);
  285. if (!ContinueWalk(result)) return result;
  286. }
  287. result = WalkNode(pnode, context);
  288. }
  289. return result;
  290. }
  291. ResultType WalkCase(ParseNode *pnode, Context context)
  292. {
  293. ResultType result = WalkFirstChild(pnode->sxCase.pnodeExpr, context);
  294. if (ContinueWalk(result))
  295. {
  296. result = WalkNode(pnode, context);
  297. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxCase.pnodeBody, context);
  298. }
  299. return result;
  300. }
  301. ResultType WalkTryFinally(ParseNode *pnode, Context context)
  302. {
  303. ResultType result = WalkFirstChild(pnode->sxTryFinally.pnodeTry, context);
  304. if (ContinueWalk(result))
  305. {
  306. result = WalkNode(pnode, context);
  307. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxTryFinally.pnodeFinally, context);
  308. }
  309. return result;
  310. }
  311. ResultType WalkFinally(ParseNode *pnode, Context context)
  312. {
  313. ResultType result = WalkNode(pnode, context);
  314. if (ContinueWalk(result)) result = WalkFirstChild(pnode->sxFinally.pnodeBody, context);
  315. return result;
  316. }
  317. ResultType WalkCatch(ParseNode *pnode, Context context)
  318. {
  319. ResultType result = WalkFirstChild(pnode->sxCatch.pnodeParam, context);
  320. if (ContinueWalk(result))
  321. {
  322. result = WalkNode(pnode, context);
  323. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxCatch.pnodeBody, context);
  324. }
  325. return result;
  326. }
  327. ResultType WalkTryCatch(ParseNode *pnode, Context context)
  328. {
  329. ResultType result = WalkFirstChild(pnode->sxTryCatch.pnodeTry, context);
  330. if (ContinueWalk(result))
  331. {
  332. result = WalkNode(pnode, context);
  333. if (ContinueWalk(result)) result = WalkSecondChild(pnode->sxTryCatch.pnodeCatch, context);
  334. }
  335. return result;
  336. }
  337. ResultType WalkTry(ParseNode *pnode, Context context)
  338. {
  339. ResultType result = WalkNode(pnode, context);
  340. if (ContinueWalk(result)) result = WalkFirstChild(pnode->sxTry.pnodeBody, context);
  341. return result;
  342. }
  343. ResultType WalkClass(ParseNode *pnode, Context context)
  344. {
  345. // First walk the class node itself
  346. ResultType result = WalkNode(pnode, context);
  347. if (!ContinueWalk(result)) return result;
  348. // Walk extends expr
  349. result = WalkFirstChild(pnode->sxClass.pnodeExtends, context);
  350. if (!ContinueWalk(result)) return result;
  351. // Walk the constructor
  352. result = WalkNthChild(pnode, pnode->sxClass.pnodeConstructor, context);
  353. if (!ContinueWalk(result)) return result;
  354. // Walk all non-static members
  355. result = WalkList(pnode, pnode->sxClass.pnodeMembers, context);
  356. if (!ContinueWalk(result)) return result;
  357. // Walk all static members
  358. result = WalkList(pnode, pnode->sxClass.pnodeStaticMembers, context);
  359. return result;
  360. }
  361. public:
  362. ResultType Walk(ParseNode *pnode, Context context)
  363. {
  364. if (!pnode) return DefaultResult();
  365. switch (pnode->nop) {
  366. // Handle all special cases first.
  367. // Post-fix unary operators.
  368. //PTNODE(knopIncPost , "++ post" ,Inc ,Uni ,fnopUni|fnopAsg)
  369. //PTNODE(knopDecPost , "-- post" ,Dec ,Uni ,fnopUni|fnopAsg)
  370. case knopIncPost:
  371. case knopDecPost:
  372. return WalkPostUnary(pnode, context);
  373. // Call and call like
  374. //PTNODE(knopCall , "()" ,None ,Bin ,fnopBin)
  375. //PTNODE(knopNew , "new" ,None ,Bin ,fnopBin)
  376. //PTNODE(knopIndex , "[]" ,None ,Bin ,fnopBin)
  377. case knopCall:
  378. case knopNew:
  379. case knopIndex:
  380. return WalkCall(pnode, context);
  381. // Ternary operator
  382. //PTNODE(knopQmark , "?" ,None ,Tri ,fnopBin)
  383. case knopQmark:
  384. return WalkTernary(pnode, context);
  385. // General nodes.
  386. //PTNODE(knopList , "<list>" ,None ,Bin ,fnopNone)
  387. case knopList:
  388. return WalkList(NULL, pnode, context);
  389. //PTNODE(knopVarDecl , "varDcl" ,None ,Var ,fnopNone)
  390. case knopVarDecl:
  391. case knopConstDecl:
  392. case knopLetDecl:
  393. case knopTemp:
  394. return WalkVar(pnode, context);
  395. //PTNODE(knopFncDecl , "fncDcl" ,None ,Fnc ,fnopLeaf)
  396. case knopFncDecl:
  397. return WalkFnc(pnode, context);
  398. //PTNODE(knopProg , "program" ,None ,Fnc ,fnopNone)
  399. case knopProg:
  400. return WalkProg(pnode, context);
  401. //PTNODE(knopFor , "for" ,None ,For ,fnopBreak|fnopContinue)
  402. case knopFor:
  403. return WalkFor(pnode, context);
  404. //PTNODE(knopIf , "if" ,None ,If ,fnopNone)
  405. case knopIf:
  406. return WalkIf(pnode, context);
  407. //PTNODE(knopWhile , "while" ,None ,While,fnopBreak|fnopContinue)
  408. case knopWhile:
  409. return WalkWhile(pnode, context);
  410. //PTNODE(knopDoWhile , "do-while" ,None ,While,fnopBreak|fnopContinue)
  411. case knopDoWhile:
  412. return WalkDoWhile(pnode, context);
  413. //PTNODE(knopForIn , "for in" ,None ,ForIn,fnopBreak|fnopContinue|fnopCleanup)
  414. case knopForIn:
  415. return WalkForInOrForOf(pnode, context);
  416. case knopForOf:
  417. return WalkForInOrForOf(pnode, context);
  418. //PTNODE(knopReturn , "return" ,None ,Uni ,fnopNone)
  419. case knopReturn:
  420. return WalkReturn(pnode, context);
  421. //PTNODE(knopBlock , "{}" ,None ,Block,fnopNone)
  422. case knopBlock:
  423. return WalkBlock(pnode, context);
  424. //PTNODE(knopWith , "with" ,None ,With ,fnopCleanup)
  425. case knopWith:
  426. return WalkWith(pnode, context);
  427. //PTNODE(knopSwitch , "switch" ,None ,Switch,fnopBreak)
  428. case knopSwitch:
  429. return WalkSwitch(pnode, context);
  430. //PTNODE(knopCase , "case" ,None ,Case ,fnopNone)
  431. case knopCase:
  432. return WalkCase(pnode, context);
  433. //PTNODE(knopTryFinally,"try-finally",None,TryFinally,fnopCleanup)
  434. case knopTryFinally:
  435. return WalkTryFinally(pnode, context);
  436. case knopFinally:
  437. return WalkFinally(pnode, context);
  438. //PTNODE(knopCatch , "catch" ,None ,Catch,fnopNone)
  439. case knopCatch:
  440. return WalkCatch(pnode, context);
  441. //PTNODE(knopTryCatch , "try-catch" ,None ,TryCatch ,fnopCleanup)
  442. case knopTryCatch:
  443. return WalkTryCatch(pnode, context);
  444. //PTNODE(knopTry , "try" ,None ,Try ,fnopCleanup)
  445. case knopTry:
  446. return WalkTry(pnode, context);
  447. //PTNODE(knopThrow , "throw" ,None ,Uni ,fnopNone)
  448. case knopThrow:
  449. return WalkPostUnary(pnode, context);
  450. case knopStrTemplate:
  451. return WalkStringTemplate(pnode, context);
  452. //PTNODE(knopClassDecl , "classDecl" ,None ,Class ,fnopLeaf)
  453. case knopClassDecl:
  454. return WalkClass(pnode, context);
  455. default:
  456. {
  457. uint fnop = ParseNode::Grfnop(pnode->nop);
  458. if (fnop & fnopLeaf || fnop && fnopNone)
  459. {
  460. return WalkLeaf(pnode, context);
  461. }
  462. else if (fnop & fnopBin)
  463. {
  464. return WalkBinary(pnode, context);
  465. }
  466. else if (fnop & fnopUni)
  467. {
  468. // Prefix unary operators.
  469. return WalkPreUnary(pnode, context);
  470. }
  471. // Some node types are both fnopNotExprStmt and something else. Try the above cases first and fall back to this one.
  472. if (fnop & fnopNotExprStmt)
  473. {
  474. return WalkLeaf(pnode, context);
  475. }
  476. Assert(false);
  477. __assume(false);
  478. }
  479. }
  480. }
  481. };