A NodeSet contains a set of SUnit DAG nodes with additional information that assigns a priority to the set.
Declared in <llvm/CodeGen/MachinePipeliner.h>
class NodeSet;| Name | Description |
|---|---|
iterator | Const iterator over the SUnits in this node set. |
| Name | Description |
|---|---|
NodeSet [constructor] | Constructors |
begin | Return an iterator to the first node in the set. |
clear | Clear the nodes and reset all priority metrics. |
compareRecMII | Compare this set's recurrence MII against RHS. |
computeNodeSetInfo | Summarize node functions for the entire node set. |
count | Return how many times SU occurs in the set (0 or 1). |
dump | Dump the node set to the debug stream. |
empty | Return true if the set contains no nodes. |
end | Return an iterator past the last node in the set. |
getLatency | Return the recurrence latency computed for this node set. |
getMaxDepth | Return the maximum dependence-graph depth among nodes in the set. |
getNode | Return the node at index i. |
getRecMII | Return the recurrence-constrained minimum initiation interval. |
hasRecurrence | Return true if this set represents a recurrence circuit. |
insert | insert overloads |
isExceedSU | Return true if SU is the node that exceeds register pressure. |
print | Print the node set to os. |
remove_if | Remove every node for which predicate P returns true. |
setColocate | Set the colocate group identifier used as a sort tie-breaker. |
setExceedPressure | Record that scheduling SU would exceed register pressure. |
setRecMII | Set the recurrence MII for this node set. |
size | Return the number of nodes in the set. |
operator SetVector<SUnit*>& | Convert this node set to the underlying SetVector of SUnits. |
operator== | Return true if this set has the same priority key as RHS. |
operator!= | Return true if this set does not have the same priority key as RHS. |
operator> | Return true if this node set should be scheduled before RHS. |