#include <SkSLProgramUsage.h>

Classes
struct	VariableCounts

Public Member Functions
VariableCounts	get (const Variable &) const

bool	isDead (const Variable &) const

int	get (const FunctionDeclaration &) const

void	add (const Expression *expr)

void	add (const Statement *stmt)

void	add (const ProgramElement &element)

void	remove (const Expression *expr)

void	remove (const Statement *stmt)

void	remove (const ProgramElement &element)

bool	operator== (const ProgramUsage &that) const

bool	operator!= (const ProgramUsage &that) const

Public Attributes
skia_private::THashMap< const Symbol *, int >	fStructCounts

skia_private::THashMap< const Symbol *, int >	fCallCounts

skia_private::THashMap< const Variable *, VariableCounts >	fVariableCounts

Detailed Description

Side-car class holding mutable information about a Program's IR

Definition at line 26 of file SkSLProgramUsage.h.

Member Function Documentation

◆ add() [1/3]

void SkSL::ProgramUsage::add ( const Expression * expr )

Definition at line 190 of file SkSLProgramUsage.cpp.

                                             {
    ProgramUsageVisitor addRefs(this, /*delta=*/+1);
    addRefs.visitExpression(*expr);
}

◆ add() [2/3]

void SkSL::ProgramUsage::add ( const ProgramElement & element )

Definition at line 200 of file SkSLProgramUsage.cpp.

                                                    {
    ProgramUsageVisitor addRefs(this, /*delta=*/+1);
    addRefs.visitProgramElement(element);
}

◆ add() [3/3]

void SkSL::ProgramUsage::add ( const Statement * stmt )

Definition at line 195 of file SkSLProgramUsage.cpp.

                                            {
    ProgramUsageVisitor addRefs(this, /*delta=*/+1);
    addRefs.visitStatement(*stmt);
}

◆ get() [1/2]

int SkSL::ProgramUsage::get ( const FunctionDeclaration & f ) const

Definition at line 185 of file SkSLProgramUsage.cpp.

                                                        {
    const int* count = fCallCounts.find(&f);
    return count ? *count : 0;
}

◆ get() [2/2]

ProgramUsage::VariableCounts SkSL::ProgramUsage::get ( const Variable & v ) const

Definition at line 164 of file SkSLProgramUsage.cpp.

                                                                    {
    const VariableCounts* counts = fVariableCounts.find(&v);
    SkASSERT(counts);
    return *counts;
}

◆ isDead()

bool SkSL::ProgramUsage::isDead ( const Variable & v ) const

Definition at line 170 of file SkSLProgramUsage.cpp.

                                                 {
    ModifierFlags flags = v.modifierFlags();
    VariableCounts counts = this->get(v);
    if (flags & (ModifierFlag::kIn | ModifierFlag::kOut | ModifierFlag::kUniform)) {
        // Never eliminate ins, outs, or uniforms.
        return false;
    }
    if (v.type().componentType().isOpaque()) {
        // Never eliminate samplers, runtime-effect children, or atomics.
        return false;
    }
    // Consider the variable dead if it's never read and never written (besides the initial-value).
    return !counts.fRead && (counts.fWrite <= (v.initialValue() ? 1 : 0));
}

◆ operator!=()

bool SkSL::ProgramUsage::operator!= ( const ProgramUsage & that ) const

inline

Definition at line 46 of file SkSLProgramUsage.h.

46{ return !(*this == that); }

◆ operator==()

bool SkSL::ProgramUsage::operator== ( const ProgramUsage & that ) const

Definition at line 285 of file SkSLProgramUsage.cpp.

                                                            {
    // ProgramUsage can be "equal" while the underlying hash maps look slightly different, because a
    // dead-stripped variable or function will have a usage count of zero, but will still exist in
    // the maps. If the program usage is re-analyzed from scratch, the maps will not contain an
    // entry for these variables or functions at all. This means our maps can be "equal" while
    // having different element counts.
    //
    // In order to check these maps, we compare map entries bi-directionally, skipping zero-usage
    // entries. If all the non-zero elements in `this` match the elements in `that`, and all the
    // non-zero elements in `that` match the elements in `this`, all the non-zero elements must be
    // identical, and all the zero elements must be either zero or non-existent on both sides.
    return contains_matching_data(*this, that) &&
           contains_matching_data(that, *this);
}

◆ remove() [1/3]

void SkSL::ProgramUsage::remove ( const Expression * expr )

Definition at line 205 of file SkSLProgramUsage.cpp.

                                                {
    ProgramUsageVisitor subRefs(this, /*delta=*/-1);
    subRefs.visitExpression(*expr);
}

◆ remove() [2/3]

void SkSL::ProgramUsage::remove ( const ProgramElement & element )

Definition at line 215 of file SkSLProgramUsage.cpp.

                                                       {
    ProgramUsageVisitor subRefs(this, /*delta=*/-1);
    subRefs.visitProgramElement(element);
}

◆ remove() [3/3]

void SkSL::ProgramUsage::remove ( const Statement * stmt )

Definition at line 210 of file SkSLProgramUsage.cpp.

                                               {
    ProgramUsageVisitor subRefs(this, /*delta=*/-1);
    subRefs.visitStatement(*stmt);
}

Member Data Documentation

◆ fCallCounts

skia_private::THashMap<const Symbol*, int> SkSL::ProgramUsage::fCallCounts

Definition at line 51 of file SkSLProgramUsage.h.

◆ fStructCounts

skia_private::THashMap<const Symbol*, int> SkSL::ProgramUsage::fStructCounts

Definition at line 49 of file SkSLProgramUsage.h.

◆ fVariableCounts

skia_private::THashMap<const Variable*, VariableCounts> SkSL::ProgramUsage::fVariableCounts

Definition at line 52 of file SkSLProgramUsage.h.

The documentation for this class was generated from the following files:

third_party/skia/src/sksl/analysis/SkSLProgramUsage.h
third_party/skia/src/sksl/analysis/SkSLProgramUsage.cpp

Classes

Public Member Functions

Public Attributes