![]() |
P4C
The P4 Compiler
|
#include <dpdkAsmOpt.h>
Public Member Functions | |
CollectUseDefInfo (P4::TypeMap *typeMap) | |
bool | haveSingleUseDef (cstring str) |
bool | preorder (const IR::DpdkBinaryStatement *b) override |
bool | preorder (const IR::DpdkCastStatement *c) override |
bool | preorder (const IR::DpdkChecksumAddStatement *c) override |
bool | preorder (const IR::DpdkChecksumSubStatement *c) override |
bool | preorder (const IR::DpdkCounterCountStatement *c) override |
bool | preorder (const IR::DpdkEmitStatement *e) override |
bool | preorder (const IR::DpdkExtractStatement *e) override |
bool | preorder (const IR::DpdkGetHashStatement *c) override |
bool | preorder (const IR::DpdkJmpCondStatement *b) override |
bool | preorder (const IR::DpdkLearnStatement *b) override |
bool | preorder (const IR::DpdkLookaheadStatement *l) override |
bool | preorder (const IR::DpdkMeterDeclStatement *c) override |
bool | preorder (const IR::DpdkMeterExecuteStatement *e) override |
bool | preorder (const IR::DpdkMirrorStatement *m) override |
bool | preorder (const IR::DpdkMovStatement *mv) override |
bool | preorder (const IR::DpdkRearmStatement *r) override |
bool | preorder (const IR::DpdkRecircidStatement *t) override |
bool | preorder (const IR::DpdkRegisterDeclStatement *r) override |
bool | preorder (const IR::DpdkRegisterReadStatement *r) override |
bool | preorder (const IR::DpdkRegisterWriteStatement *r) override |
bool | preorder (const IR::DpdkRxStatement *r) override |
bool | preorder (const IR::DpdkTable *t) override |
bool | preorder (const IR::DpdkTxStatement *t) override |
bool | preorder (const IR::DpdkUnaryStatement *u) override |
bool | preorder (const IR::DpdkVerifyStatement *v) override |
![]() | |
const IR::Node * | apply_visitor (const IR::Node *, const char *name=0) override |
profile_t | init_apply (const IR::Node *root) override |
virtual void | loop_revisit (const IR::Node *) |
virtual void | postorder (const IR::Node *) |
virtual bool | preorder (const IR::Node *) |
virtual void | revisit (const IR::Node *) |
void | revisit_visited () |
bool | visit_in_progress (const IR::Node *n) const |
void | visitAgain () const override |
void | visitOnce () const override |
![]() | |
virtual bool | check_global (cstring) |
virtual void | clear_globals () |
virtual Visitor * | clone () const |
virtual ControlFlowVisitor * | controlFlowVisitor () |
virtual void | end_apply () |
virtual void | end_apply (const IR::Node *root) |
virtual void | erase_global (cstring) |
template<class T > | |
const T * | findContext () const |
template<class T > | |
const T * | findContext (const Context *&c) const |
template<class T > | |
const T * | findOrigCtxt () const |
template<class T > | |
const T * | findOrigCtxt (const Context *&c) const |
virtual Visitor & | flow_clone () |
virtual void | flow_merge (Visitor &) |
virtual bool | flow_merge_closure (Visitor &) |
virtual void | flow_merge_global_from (cstring) |
virtual void | flow_merge_global_to (cstring) |
const Context * | getChildContext () const |
int | getChildrenVisited () const |
const Context * | getContext () const |
int | getContextDepth () const |
const IR::Node * | getCurrentNode () const |
template<class T > | |
const T * | getCurrentNode () const |
const IR::Node * | getOriginal () const |
template<class T > | |
const T * | getOriginal () const |
template<class T > | |
const T * | getParent () const |
virtual bool | has_flow_joins () const |
profile_t | init_apply (const IR::Node *root, const Context *parent_context) |
bool | isInContext (const IR::Node *n) const |
virtual const char * | name () const |
template<class T > | |
void | parallel_visit (const IR::Vector< T > &v, const char *name, int cidx) |
template<class T > | |
void | parallel_visit (const IR::Vector< T > &v, const char *name=0) |
template<class T > | |
void | parallel_visit (IR::Vector< T > &v, const char *name, int cidx) |
template<class T > | |
void | parallel_visit (IR::Vector< T > &v, const char *name=0) |
void | print_context () const |
const Visitor & | setCalledBy (const Visitor *visitor) |
void | setName (const char *name) |
void | visit (const IR::Node &n, const char *name, int cidx) |
void | visit (const IR::Node &n, const char *name=0) |
void | visit (const IR::Node *&n, const char *name, int cidx) |
void | visit (const IR::Node *&n, const char *name=0) |
void | visit (const IR::Node *const &n, const char *name, int cidx) |
void | visit (const IR::Node *const &n, const char *name=0) |
void | visit (IR::Node &n, const char *name, int cidx) |
void | visit (IR::Node &n, const char *name=0) |
void | visit (IR::Node *&, const char *=0, int=0) |
template<class T , typename = std::enable_if_t<Util::has_SourceInfo_v<T>>, class... Args> | |
void | warn (const int kind, const char *format, const T &node, Args &&...args) |
The const ref variant of the above. | |
template<class T , typename = std::enable_if_t<Util::has_SourceInfo_v<T>>, class... Args> | |
void | warn (const int kind, const char *format, const T *node, Args &&...args) |
bool | warning_enabled (int warning_kind) const |
Public Attributes | |
std::unordered_map< cstring, int > | defInfo |
std::unordered_map< cstring, bool > | dontEliminate |
std::unordered_map< cstring, const IR::Expression * > | replacementMap |
std::unordered_map< cstring, int > | usesInfo |
![]() | |
const Visitor * | called_by = nullptr |
cstring | internalName |
SplitFlowVisit_base *& | split_link |
SplitFlowVisit_base * | split_link_mem = nullptr |
Additional Inherited Members | |
![]() | |
typedef Visitor_Context | Context |
![]() | |
static cstring | demangle (const char *) |
static bool | warning_enabled (const Visitor *visitor, int warning_kind) |
![]() | |
virtual void | init_join_flows (const IR::Node *) |
virtual bool | join_flows (const IR::Node *) |
virtual void | post_join_flows (const IR::Node *, const IR::Node *) |
void | visit_children (const IR::Node *, std::function< void()> fn) |
![]() | |
bool | dontForwardChildrenBeforePreorder = false |
bool | joinFlows = false |
bool | visitDagOnce = true |
This pass collect use def info by analysing all possible source and destinations, this info will be used by copy elimination pass.
std::unordered_map<cstring , int> DPDK::CollectUseDefInfo::usesInfo |
Member expression as string considered key for all below maps, and value contains number of occurences either at use or def point. And this point it's assumed all keys are unique.