};
template<bool computeStack>
- fgWalkResult fgWalkTreePreRec (GenTreePtr *pTree, fgWalkData *fgWalkPre);
+ static fgWalkResult fgWalkTreePreRec (GenTreePtr *pTree, fgWalkData *fgWalkPre);
// general purpose tree-walker that is capable of doing pre- and post- order
// callbacks at the same time
template<bool doPreOrder, bool doPostOrder>
- fgWalkResult fgWalkTreeRec (GenTreePtr *pTree, fgWalkData *fgWalkPre);
+ static fgWalkResult fgWalkTreeRec (GenTreePtr *pTree, fgWalkData *fgWalkPre);
fgWalkResult fgWalkTreePre (GenTreePtr *pTree,
fgWalkPreFn *visitor,
//----- Postorder
template<bool computeStack>
- fgWalkResult fgWalkTreePostRec (GenTreePtr *pTree, fgWalkData *fgWalkPre);
+ static fgWalkResult fgWalkTreePostRec (GenTreePtr *pTree, fgWalkData *fgWalkPre);
fgWalkResult fgWalkTreePost (GenTreePtr *pTree,
fgWalkPostFn *visitor,
// a stack of ancestor nodes which can be viewed in the callback.
//
template<bool computeStack>
+// static
Compiler::fgWalkResult Compiler::fgWalkTreePreRec(GenTreePtr *pTree, fgWalkData *fgWalkData)
{
fgWalkResult result = WALK_CONTINUE;
default:
#ifdef DEBUG
- gtDispTree(tree);
+ fgWalkData->compiler->gtDispTree(tree);
#endif
assert(!"unexpected operator");
}
// a stack of ancestor nodes which can be viewed in the callback.
//
template<bool computeStack>
+// static
Compiler::fgWalkResult Compiler::fgWalkTreePostRec(GenTreePtr *pTree, fgWalkData *fgWalkData)
{
fgWalkResult result;
default:
#ifdef DEBUG
- gtDispTree(tree);
+ fgWalkData->compiler->gtDispTree(tree);
#endif
assert(!"unexpected operator");
}
// walk tree doing callbacks in both pre- and post- order (both optional)
template<bool doPreOrder, bool doPostOrder>
+// static
Compiler::fgWalkResult
Compiler::fgWalkTreeRec(GenTreePtr *pTree, fgWalkData *fgWalkData)
{
default:
#ifdef DEBUG
- gtDispTree(tree);
+ fgWalkData->compiler->gtDispTree(tree);
#endif
assert(!"unexpected operator");
}