Movatterモバイル変換

A vector that has set insertion semantics.More...

#include "llvm/ADT/SetVector.h"

Public Types
using	value_type = typename Vector::value_type

using	key_type = typename Set::key_type

using	reference =value_type &

using	const_reference =const value_type &

using	set_type = Set

using	vector_type =Vector

using	iterator = typename vector_type::const_iterator

using	const_iterator = typename vector_type::const_iterator

using	reverse_iterator = typename vector_type::const_reverse_iterator

using	const_reverse_iterator = typename vector_type::const_reverse_iterator

using	size_type = typename vector_type::size_type

Public Member Functions
	SetVector ()=default
	Construct an emptySetVector.

template<typename It >
	SetVector (It Start, ItEnd)
	Initialize aSetVector with a range of elements.

ArrayRef<value_type >	getArrayRef ()const

Vector	takeVector ()
	Clear theSetVector and return the underlying vector.

bool	empty ()const
	Determine if theSetVector is empty or not.

size_type	size ()const
	Determine the number of elements in theSetVector.

iterator	begin ()
	Get an iterator to the beginning of theSetVector.

const_iterator	begin ()const
	Get a const_iterator to the beginning of theSetVector.

iterator	end ()
	Get an iterator to the end of theSetVector.

const_iterator	end ()const
	Get a const_iterator to the end of theSetVector.

reverse_iterator	rbegin ()
	Get an reverse_iterator to the end of theSetVector.

const_reverse_iterator	rbegin ()const
	Get a const_reverse_iterator to the end of theSetVector.

reverse_iterator	rend ()
	Get a reverse_iterator to the beginning of theSetVector.

const_reverse_iterator	rend ()const
	Get a const_reverse_iterator to the beginning of theSetVector.

const value_type &	front ()const
	Return the first element of theSetVector.

const value_type &	back ()const
	Return the last element of theSetVector.

const_reference	operator[] (size_type n)const
	Index into theSetVector.

bool	insert (const value_type &X)
	Insert a new element into theSetVector.

template<typename It >
void	insert (It Start, ItEnd)
	Insert a range of elements into theSetVector.

bool	remove (const value_type &X)
	Remove an item from the set vector.

iterator	erase (const_iterator I)
	Erase a single element from the set vector.

template<typename UnaryPredicate >
bool	remove_if (UnaryPredicateP)
	Remove items from the set vector based on a predicate function.

bool	contains (const key_type &key)const
	Check if theSetVector contains the given key.

size_type	count (const key_type &key)const
	Count the number of elements of a given key in theSetVector.

void	clear ()
	Completely clear theSetVector.

void	pop_back ()
	Remove the last element of theSetVector.

value_type	pop_back_val ()

bool	operator== (const SetVector &that)const

bool	operator!= (const SetVector &that)const

template<class STy >
bool	set_union (const STy &S)
	Compute This := This u S, return whether 'This' changed.

template<class STy >
void	set_subtract (const STy &S)
	Compute This := This - B TODO: We should be able to use set_subtract fromSetOperations.h, butSetVector interface is inconsistent withDenseSet.

void	swap (SetVector<T,Vector, Set,N > &RHS)

Detailed Description

template<typenameT, typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>
class llvm::SetVector< T, Vector, Set, N >

A vector that has set insertion semantics.

This adapter class provides a way to keep a set of things that also has the property of a deterministic iteration order. The order of iteration is the order of insertion.

The key and value types are derived from the Set and Vector types respectively. This allows the vector-type operations and set-type operations to have different types. In particular, this is useful when storing pointers as "Foo *" values but looking them up as "const Foo *" keys.

No constraint is placed on the key and value types, although it is assumed that value_type can be converted into key_type for insertion. Users must be aware of any loss of information in this conversion. For example, setting value_type to float and key_type to int can produce very surprising results, but it is not explicitly disallowed.

The parameter N specifies the "small" size of the container, which is the number of elements upto which a linear scan over the Vector will be used when searching for elements instead of checking Set, due to it being better for performance. A value of 0 means that this mode of operation is not used, and is the default value.

Definition at line57 of fileSetVector.h.

Member Typedef Documentation

◆ const_iterator

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::const_iterator = typename vector_type::const_iterator

Definition at line70 of fileSetVector.h.

◆ const_reference

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::const_reference =const value_type &

Definition at line66 of fileSetVector.h.

◆ const_reverse_iterator

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::const_reverse_iterator = typename vector_type::const_reverse_iterator

Definition at line72 of fileSetVector.h.

◆ iterator

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::iterator = typename vector_type::const_iterator

Definition at line69 of fileSetVector.h.

◆ key_type

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::key_type = typename Set::key_type

Definition at line64 of fileSetVector.h.

◆ reference

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::reference =value_type &

Definition at line65 of fileSetVector.h.

◆ reverse_iterator

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::reverse_iterator = typename vector_type::const_reverse_iterator

Definition at line71 of fileSetVector.h.

◆ set_type

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::set_type = Set

Definition at line67 of fileSetVector.h.

◆ size_type

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::size_type = typename vector_type::size_type

Definition at line73 of fileSetVector.h.

◆ value_type

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::value_type = typename Vector::value_type

Definition at line63 of fileSetVector.h.

◆ vector_type

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

usingllvm::SetVector<T,Vector, Set,N >::vector_type =Vector

Definition at line68 of fileSetVector.h.

Constructor & Destructor Documentation

◆ SetVector()[1/2]

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

llvm::SetVector<T,Vector, Set,N >::SetVector

(

)

default

Construct an emptySetVector.

◆ SetVector()[2/2]

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

template<typename It >

llvm::SetVector<T,Vector, Set,N >::SetVector	(	It	Start,
		It	End
	)

inline

Initialize aSetVector with a range of elements.

Definition at line80 of fileSetVector.h.

ReferencesEnd, andllvm::SetVector< T, Vector, Set, N >::insert().

Member Function Documentation

◆ back()

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

const value_type &llvm::SetVector<T,Vector, Set,N >::back

(

)

const

inline

Return the last element of theSetVector.

Definition at line149 of fileSetVector.h.

Referencesassert(), andllvm::SetVector< T, Vector, Set, N >::empty().

Referenced byllvm::DGNode< NodeType, EdgeType >::back(),llvm::ControlFlowHub::finalize(),llvm::SetVector< T, Vector, Set, N >::pop_back(),llvm::SetVector< T, Vector, Set, N >::pop_back_val(),llvm::AttributorCGSCCPass::run(),llvm::AttributorLightCGSCCPass::run(),llvm::OpenMPOptCGSCCPass::run(), andsortBlocks().

◆ begin()[1/2]

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

iterator llvm::SetVector<T,Vector, Set,N >::begin

(

)

inline

Get an iterator to the beginning of theSetVector.

Definition at line103 of fileSetVector.h.

Referenced byllvm::NodeSet::begin(),llvm::sandboxir::Region::begin(),llvm::AADepGraphNode::begin(),llvm::DGNode< NodeType, EdgeType >::begin(),llvm::AADepGraphNode::child_begin(),llvm::rdf::Liveness::computeLiveIns(),llvm::MachO::convertToInterfaceFile(),llvm::SetTheory::expand(),findLiveSetAtInst(),formLCSSAForInstructionsImpl(),getPotentialCopiesOfMemoryValue(),llvm::AttributorCallGraph::optimisticEdgesBegin(),llvm::promoteLoopAccessesToScalars(),llvm::MemorySSAUpdater::removeMemoryAccess(),replaceConditionalBranchesOnConstant(),llvm::coro::sinkSpillUsesAfterCoroBegin(),splitPredecessorsOfLoopExit(),unswitchNontrivialInvariants(), andllvm::VPlan::vectorFactors().

◆ begin()[2/2]

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

const_iterator llvm::SetVector<T,Vector, Set,N >::begin

(

)

const

inline

Get a const_iterator to the beginning of theSetVector.

Definition at line108 of fileSetVector.h.

◆ clear()

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

voidllvm::SetVector<T,Vector, Set,N >::clear

(

)

inline

Completely clear theSetVector.

Definition at line273 of fileSetVector.h.

Referenced byanalyzeLoopUnrollCost(),llvm::DGNode< NodeType, EdgeType >::clear(),llvm::NodeSet::clear(),llvm::slpvectorizer::BoUpSLP::deleteTree(),findBestInsertionSet(),fixIrreducible(),pred_L(),llvm::MemorySSAUpdater::removeMemoryAccess(),llvm::InstructionSelect::MIIteratorMaintainer::reportFullyCreatedInstrs(),llvm::Combiner::WorkListMaintainerImpl< Lvl >::reset(),llvm::VPlan::setUF(),llvm::VPlan::setVF(), andsucc_L().

◆ contains()

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

bool llvm::SetVector<T,Vector, Set,N >::contains

(

const key_type &

key

)

const

inline

Check if theSetVector contains the given key.

Definition at line254 of fileSetVector.h.

Referencesllvm::is_contained().

Referenced byllvm::InterleavedAccessInfo::analyzeInterleaving(),canRewriteGEPAsOffset(),computePath(),llvm::PotentialValuesState< MemberTy >::contains(),llvm::sandboxir::Region::contains(),llvm::convertUsersOfConstantsToInstructions(),llvm::slpvectorizer::BoUpSLP::findPartiallyOrderedLoads(),gatherPossiblyVectorizableLoads(),getSameOpcode(),llvm::VPlan::hasUF(),insertTrivialPHIs(), andllvm::SIMachineFunctionInfo::isWWMReg().

◆ count()

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

size_type llvm::SetVector<T,Vector, Set,N >::count

(

const key_type &

key

)

const

inline

Count the number of elements of a given key in theSetVector.

Returns: 0 if the element is not in theSetVector, 1 if it is.

Definition at line264 of fileSetVector.h.

Referencesllvm::is_contained().

Referenced byaddMappingsFromTLI(),buildClonedLoops(),llvm::NodeSet::count(),deleteDeadBlocksFromLoop(),eliminateDeadCode(),eraseLifetimeMarkersOnInputs(),findBestInsertionSet(),findExtractedInputToOverallInputMapping(),llvm::CodeExtractor::findInputsOutputs(),getPotentialCopiesOfMemoryValue(),llvm::VPlan::hasVF(),llvm::Attributor::isAssumedDead(),llvm::DotFuncBCIInfo::isDependent(),llvm::Attributor::isRunOn(),llvm::MemorySSAUpdater::removeBlocks(),shouldEmitDWARF(),llvm::SimplifyInstructionsInBlock(),sortBlocks(),tryInterleave(), andunswitchNontrivialInvariants().

◆ empty()

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

bool llvm::SetVector<T,Vector, Set,N >::empty

(

)

const

inline

Determine if theSetVector is empty or not.

Definition at line93 of fileSetVector.h.

Referenced byaddUsersInExitBlocks(),analyzeLoopUnrollCost(),llvm::Combiner::WorkListMaintainerImpl< Lvl >::appliedCombine(),llvm::SetVector< T, Vector, Set, N >::back(),computeLiveInValues(),llvm::DwarfCompileUnit::createAndAddScopeChildren(),llvm::OpenMPIRBuilder::createParallel(),llvm::LLVMContextImpl::dropTriviallyDeadConstantArrays(),eliminateDeadCode(),llvm::LiveRangeEdit::eliminateDeadDefs(),llvm::NodeSet::empty(),llvm::sandboxir::Region::empty(),llvm::rdf::DeadCodeElimination::erase(),llvm::CodeExtractor::extractCodeRegion(),llvm::SetVector< T, Vector, Set, N >::front(),gatherPossiblyVectorizableLoads(),llvm::MDNode::getMostGenericAliasScope(),llvm::VPlan::hasUF(),interpretValues(),llvm::InstructionWorklist::isEmpty(),llvm::Attributor::isRunOn(),llvm::SetVector< T, Vector, Set, N >::pop_back(),llvm::InstructionWorklist::popDeferred(),pred_L(),llvm::MemorySSAUpdater::removeMemoryAccess(),llvm::removeUnreachableBlocks(),llvm::slpvectorizer::BoUpSLP::reorderBottomToTop(),llvm::InstructionSelect::MIIteratorMaintainer::reportFullyCreatedInstrs(),llvm::ReassociatePass::run(),llvm::AttributorCGSCCPass::run(),llvm::AttributorLightCGSCCPass::run(),runAttributorLightOnFunctions(),runAttributorOnFunctions(),llvm::PlaceSafepointsPass::runImpl(),llvm::SimplifyInstructionsInBlock(),llvm::InnerLoopVectorizer::sinkScalarOperands(),sortBlocks(),llvm::SplitIndirectBrCriticalEdges(),splitPredecessorsOfLoopExit(),succ_L(),tryInterleave(), andllvm::InstructionWorklist::zap().

◆ end()[1/2]

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

iterator llvm::SetVector<T,Vector, Set,N >::end

(

)

inline

Get an iterator to the end of theSetVector.

Definition at line113 of fileSetVector.h.

Referenced byllvm::AADepGraphNode::child_end(),llvm::rdf::Liveness::computeLiveIns(),llvm::NodeSet::end(),llvm::sandboxir::Region::end(),llvm::AADepGraphNode::end(),llvm::DGNode< NodeType, EdgeType >::end(),llvm::SetTheory::expand(),findLiveSetAtInst(),formLCSSAForInstructionsImpl(),getPotentialCopiesOfMemoryValue(),llvm::DGNode< NodeType, EdgeType >::hasEdgeTo(),llvm::AttributorCallGraph::optimisticEdgesEnd(),llvm::MemorySSAUpdater::removeMemoryAccess(),replaceConditionalBranchesOnConstant(),llvm::coro::sinkSpillUsesAfterCoroBegin(), andllvm::VPlan::vectorFactors().

◆ end()[2/2]

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

const_iterator llvm::SetVector<T,Vector, Set,N >::end

(

)

const

inline

Get a const_iterator to the end of theSetVector.

Definition at line118 of fileSetVector.h.

◆ erase()

template<typenameT , typenameVector = SmallVector<T, 0>, typename Set = DenseSet<T>,unsigned N = 0>

iterator llvm::SetVector<T,Vector, Set,N >::erase

(

const_iterator

)

inline

Erase a single element from the set vector.

Returns: an iterator pointing to the next element that followed the element erased. This is the end of theSetVector if the last element is erased.

Definition at line212 of fileSetVector.h.

Referencesassert(), andI.