Skip to content

AstQueryNamespace::queryMemoryPool

queryMemoryPool overloads

Synopses

Declared in <src/midend/astQuery/astQuery.h>

**** 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*>
queryMemoryPool(
    NodeFunctional nodeFunc,
    VariantVector* targetVariantVector = NULL);

» more...

** The function void queryMemoryPool(ROSE_VisitTraversal& astQuery, VariantVector_variantsToTraverse); traverses the parts of the memory pool which hascorresponding variants in VariantVector.**_

template<class FunctionalType>
void
queryMemoryPool(
    AstQuery<ROSE_VisitTraversal, FunctionalType>& astQuery,
    VariantVector* variantsToTraverse);

» more...

** 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
queryMemoryPool(
    _Result(* __x)(SgNode*),
    VariantVector* targetVariantVector = NULL);

» more...

**** 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
queryMemoryPool(
    _Result(* __x)(SgNode*, _Arg),
    _Arg x_arg,
    VariantVector* targetVariantVector = NULL);

» more...

Created with MrDocs