AstQueryNamespace::querySubTree
querySubTree overloads
Synopses
Declared in <src/midend/astQuery/astQuery.h>
** The function Result querySubTree ( SgNode * subTree, _Result (__x)(SgNode_), AstQueryNamespace::QueryDepth defineQueryType =AstQueryNamespace::AllNodes )* will query the subtree of the IR node in the first argument for nodessatisfying the criteria specified in and returned by the function pointer inthe second argument.**
template<class _Result>
_Result
querySubTree(
SgNode* subTree,
_Result(* __x)(SgNode*),
AstQueryNamespace::QueryDepth defineQueryType = AstQueryNamespace::AllNodes);
**** The function std::list<ListElement> querySubTree<ListElement>(SgNode* node,Predicate& _pred) will query the subtree of the IR node in the first argumentfor nodes satisfying the criteria specified in and returned by the predicatein the second argument.**
template<typename NodeFunctional>
std::invoke_result_t<NodeFunctional&, SgNode*>
querySubTree(
SgNode* node,
NodeFunctional nodeFunc,
AstQueryNamespace::QueryDepth defineQueryType = AstQueryNamespace::AllNodes,
t_traverseOrder treeTraversalOrder = preorder);
**** The function Result querySubTree ( SgNode * subTree, _Result (__x)(SgNode_,_Arg), Arg x_arg, AstQueryNamespace::QueryDepth defineQueryType =AstQueryNamespace::AllNodes ) will query the subtree of the IR node in the first argument for nodessatisfying the criteria specified in and returned by the function pointer inthe second argument.**
template<
class _Arg,
class _Result>
_Result
querySubTree(
SgNode* subTree,
_Result(* __x)(SgNode*, _Arg),
_Arg x_arg,
AstQueryNamespace::QueryDepth defineQueryType = AstQueryNamespace::AllNodes);
Created with MrDocs