Inheritance diagram for Phv_Parde_Mau_Use:

[legend]

Public Member Functions
	Phv_Parde_Mau_Use (const PhvInfo &p)

bool	is_allocation_required (const PHV::Field *f) const

bool	is_deparsed (const PHV::Field *f) const

bool	is_extracted (const PHV::Field *f, std::optional< gress_t > gress=std::nullopt) const

bool	is_extracted_from_constant (const PHV::Field *f, std::optional< gress_t > gress=std::nullopt) const

bool	is_extracted_from_pkt (const PHV::Field *f, std::optional< gress_t > gress=std::nullopt) const

bool	is_learning (const PHV::Field *f) const

bool	is_referenced (const PHV::Field *f) const

bool	is_used_alu (const PHV::Field *f) const

bool	is_used_mau (const PHV::Field *f) const

bool	is_used_mau (const PHV::Field *f, le_bitrange range) const

bool	is_used_parde (const PHV::Field *f) const

bool	is_written_mau (const PHV::Field *f) const

ordered_set< std::pair< const IR::MAU::Table , const IR::MAU::TableKey > >	ixbar_read (const PHV::Field *f, le_bitrange range) const

Public Member Functions inherited from P4::Inspector
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

Public Member Functions inherited from P4::Visitor
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> && !std::is_pointer_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 Member Functions inherited from TofinoWriteContext
bool	isIxbarRead (bool root_value=false)

bool	isRead (bool root_value=false)

bool	isWrite (bool root_value=false)

Public Attributes
bitvec	deparser_i [GRESS_T_COUNT]
	Fields used in the deparser.

ordered_map< int, ordered_map< unsigned, ordered_set< le_bitrange > > >	use_i

Public Attributes inherited from P4::Visitor
const Visitor *	called_by = nullptr

cstring	internalName

SplitFlowVisit_base *&	split_link

SplitFlowVisit_base *	split_link_mem = nullptr

Protected Member Functions
profile_t	init_apply (const IR::Node *) override

bool	preorder (const IR::BFN::Deparser *) override

bool	preorder (const IR::BFN::Digest *) override

bool	preorder (const IR::BFN::Extract *) override

bool	preorder (const IR::BFN::Parser *) override

bool	preorder (const IR::BFN::ParserChecksumWritePrimitive *) override

bool	preorder (const IR::Expression *) override

bool	preorder (const IR::MAU::TableKey *) override

bool	preorder (const IR::MAU::TableSeq *) override

Protected Member Functions inherited from P4::Visitor
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)

Protected Attributes
bool	in_dep = false

bool	in_mau = false

const PhvInfo &	phv

gress_t	thread = INGRESS

Protected Attributes inherited from P4::Visitor
bool	dontForwardChildrenBeforePreorder = false

bool	joinFlows = false

bool	visitDagOnce = true

Additional Inherited Members
Public Types inherited from P4::Visitor
typedef Visitor_Context	Context

Static Public Member Functions inherited from P4::Visitor
static cstring	demangle (const char *)

static bool	warning_enabled (const Visitor *visitor, int warning_kind)

Member Function Documentation

◆ init_apply()

Visitor::profile_t Phv_Parde_Mau_Use::init_apply ( const IR::Node * root )

overrideprotected

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

SPDX-License-Identifier: Apache-2.0

◆ is_allocation_required()

bool Phv_Parde_Mau_Use::is_allocation_required ( const PHV::Field * f ) const

Returns: true if f needs to be allocated for PHV. A field must be allocated to a PHV if is_ignore_alloc() is false and (1) is referenced or (2) not referenced, but is ghost field (we should try to eliminated this case once we add ghost field writes to IR).

◆ is_deparsed()

bool Phv_Parde_Mau_Use::is_deparsed ( const PHV::Field * f ) const

Returns: true if f is used in the deparser.

◆ is_extracted()

bool Phv_Parde_Mau_Use::is_extracted	(	const PHV::Field *	f,
		std::optional< gress_t >	gress = std::nullopt ) const

Returns: true if f is extracted in the (ingress or egress) parser.

◆ is_extracted_from_constant()

bool Phv_Parde_Mau_Use::is_extracted_from_constant	(	const PHV::Field *	f,
		std::optional< gress_t >	gress = std::nullopt ) const

Returns: true if f is extracted in the (ingress or egress) parser from a constant.

◆ is_extracted_from_pkt()

bool Phv_Parde_Mau_Use::is_extracted_from_pkt	(	const PHV::Field *	f,
		std::optional< gress_t >	gress = std::nullopt ) const

Returns: true if f is extracted in the (ingress or egress) parser from packet data.

◆ is_learning()

bool Phv_Parde_Mau_Use::is_learning ( const PHV::Field * f ) const

inline

Returns: true if is read by deparser for learning digest and subject to the maxDigestSizeInBytes constraint.

◆ is_referenced()

bool Phv_Parde_Mau_Use::is_referenced ( const PHV::Field * f ) const

Returns: true if f is read or written anywhere in the pipeline or if f is marked bridged.

◆ is_used_alu()

bool Phv_Parde_Mau_Use::is_used_alu ( const PHV::Field * f ) const

Returns: true if f is used in an ALU instruction.

◆ is_used_mau()

bool Phv_Parde_Mau_Use::is_used_mau ( const PHV::Field * f ) const

Returns: true if f is used (read or written) in the MAU pipeline.

◆ is_used_parde()

bool Phv_Parde_Mau_Use::is_used_parde ( const PHV::Field * f ) const

Returns: true if f is used in the parser or deparser.

◆ is_written_mau()

bool Phv_Parde_Mau_Use::is_written_mau ( const PHV::Field * f ) const

Returns: true if f is written in the MAU pipeline.

◆ ixbar_read()

ordered_set< std::pair< const IR::MAU::Table , const IR::MAU::TableKey > > Phv_Parde_Mau_Use::ixbar_read	(	const PHV::Field *	f,
		le_bitrange	range ) const

Returns: ixbar read of sub-ranges to tables of range of f. premise: range must be a fine-sliced range that either all of or none of the bits in the range are read by ixbar. Otherwise, BUG will be thrown.

Member Data Documentation

◆ use_i

ordered_map<int, ordered_map<unsigned, ordered_set<le_bitrange> > > Phv_Parde_Mau_Use::use_i

Represents uses of fields in MAU/PARDE. Keys of the outer maps are all the field ids used in the program. The inner map represents how those fields are used. The key of the inner map represents where the use (read or write) happens in the PARDE (value 0) or MAU (value 1). The values in the inner map are the slices of the fields used in the respective units.

Public Member Functions

Public Attributes

Protected Member Functions

Protected Attributes

Additional Inherited Members