llvm::BitIntegerState

Specialization of the integer state for a bit‐wise encoding.

Synopsis

Declared in <llvm/Transforms/IPO/Attributor.h>

template<
    typename base_ty = uint32_t,
    base_ty BestState = ~ base_ty(0),
    base_ty WorstState = 0>
struct BitIntegerState
    : IntegerStateBase<base_ty, BestState, WorstState>

Base Classes

Name

Description

IntegerStateBase<base_ty, BestState, WorstState>

Simple state with integers encoding.

Type Aliases

Name

Description

base_t

Underlying integer storage type.

super

Superclass type alias.

Member Functions

Name

Description

BitIntegerState [constructor]

Constructors

addKnownBits

Add the bits in BitsEncoding to the "known bits".

getAssumed

Return the assumed state encoding.

getKnown

Return the known state encoding

indicateOptimisticFixpoint [virtual]

See AbstractState::indicateOptimisticFixpoint(...)

indicatePessimisticFixpoint [virtual]

See AbstractState::indicatePessimisticFixpoint(...)

intersectAssumedBits

Keep only "assumed bits" also set in BitsEncoding but all known ones.

isAssumed

Return true if the bits set in BitsEncoding are "assumed bits".

isAtFixpoint [virtual]

See AbstractState::isAtFixpoint()

isKnown

Return true if the bits set in BitsEncoding are "known bits".

isValidState [virtual]

See AbstractState::isValidState() NOTE: For now we simply pretend that the worst possible state is invalid.

operator&=

Join assumed and known information with R using bitwise AND.

operator+=

"Clamp" this state with R. The result is subtype dependent but it is intended that information known in either state will be known in this one afterwards.

operatorˆ=

Clamp this state with R.

operator|=

Join assumed and known information with R using bitwise OR.

removeAssumedBits

Remove the bits in BitsEncoding from the "assumed bits" if not known.

removeKnownBits

Remove the bits in BitsEncoding from the "known bits".

operator==

Return true if this equals R.

operator!=

Return true if this differs from R.