LeftShiftNode

Bitwise left-shift operation; shifts in zeros.

Shift amount must be no greater than the number of input bits, otherwise results in poison.

@mnemonic("shl")

struct LeftShiftNode {

OutEdge input;

OutEdge shift;

InEdge output;

static err_t initialize(LeftShiftNode* self);

static void dispose(LeftShiftNode* self);

bool opEquals(const(LeftShiftNode) rhs);

hash_t toHash();

inout(InEdge)* opIndex(InEdge.ID slot);

OutEdgeIterator!Callable outEdges [@property getter];

InEdgeIterator!Callable inEdges [@property getter];

}

Members

Functions

opEquals bool opEquals(const(LeftShiftNode) rhs): Equivalence <=> structural equality.
opIndex inout(InEdge)* opIndex(InEdge.ID slot): See Node.opIndex.
toHash hash_t toHash(): Semantic hash.

Properties

inEdges InEdgeIterator!Callable inEdges [@property getter]: Provides an iterator over this node's in-edges.
outEdges OutEdgeIterator!Callable outEdges [@property getter]: Provides an iterator over this node's out-edges.

Static functions

dispose void dispose(LeftShiftNode* self): Frees all resources allocated by this node and sets it to an uninitialized state.
initialize err_t initialize(LeftShiftNode* self): Initializes a shift node.

Variables

input OutEdge input;: Initial bit pattern being shifted.
output InEdge output;: Resulting bit pattern.
shift OutEdge shift;: Number of times the shift is performed.

Mixed In Members

From `mixin NodeInheritance`

opPostMove void opPostMove(const(This) old): Post-move adjusts in-edge slots' owner pointer.

See Also

LeftShiftNoOverflowNode