libTriton version 1.0 build 1590
Loading...
Searching...
No Matches
Namespaces | Functions
ast.cpp File Reference
#include <algorithm>
#include <cmath>
#include <list>
#include <new>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <triton/ast.hpp>
#include <triton/astContext.hpp>
#include <triton/astRepresentation.hpp>
#include <triton/exceptions.hpp>
#include <triton/symbolicExpression.hpp>
#include <triton/symbolicVariable.hpp>

Go to the source code of this file.

Namespaces

namespace  triton
 The Triton namespace.
 
namespace  triton::ast
 The AST namespace.
 

Functions

std::ostream & triton::ast::operator<< (std::ostream &stream, AbstractNode *node)
 Displays the node in ast representation.
 
triton::uint512 triton::ast::hash2n (triton::uint512 hash, triton::uint32 n)
 Custom hash2n function for hash routine.
 
triton::uint512 triton::ast::rotl (const triton::uint512 &value, triton::uint32 shift)
 Custom rotate left function for hash routine.
 
triton::sint512 triton::ast::modularSignExtend (AbstractNode *node)
 Custom modular sign extend for bitwise operation.
 
SharedAbstractNode triton::ast::newInstance (AbstractNode *node, bool unroll=false)
 AST C++ API - Duplicates the AST.
 
SharedAbstractNode triton::ast::unroll (const SharedAbstractNode &node)
 AST C++ API - Unrolls the SSA form of a given AST.
 
std::vector< SharedAbstractNodetriton::ast::childrenExtraction (const SharedAbstractNode &node, bool unroll, bool revert)
 Returns node and all its children of an AST sorted topologically. If unroll is true, references are unrolled. If revert is true, children are on top of list.
 
std::vector< SharedAbstractNodetriton::ast::parentsExtraction (const SharedAbstractNode &node, bool revert)
 Returns node and all its parents of an AST sorted topologically. If revert is true, oldest parents are on top of list.
 
std::deque< SharedAbstractNodetriton::ast::search (const SharedAbstractNode &node, triton::ast::ast_e match=ANY_NODE)
 Returns a deque of collected matched nodes via a depth-first pre order traversal.
 
SharedAbstractNode triton::ast::dereference (const SharedAbstractNode &node)
 Returns the first non referene node encountered.
 
triton::uint32 triton::ast::getIndexSize (const SharedAbstractNode &node)
 Gets the index size of an array.