llvm::ScheduleDAGTopologicalSort

Name

const_iterator

const_reverse_iterator

iterator

reverse_iterator

Name

Description

ScheduleDAGTopologicalSort [constructor]

Constructor

AddPred

Updates the topological ordering to accommodate an edge to be added from SUnit X to SUnit Y.

AddPredQueued

Queues an update to the topological ordering to accommodate an edge to be added from SUnit X to SUnit Y.

AddSUnitWithoutPredecessors

Add a SUnit without predecessors to the end of the topological order. It also must be the first new node added to the DAG.

GetSubGraph

Returns an array of SUs that are both in the successor subtree of StartSU and in the predecessor subtree of TargetSU. StartSU and TargetSU are not in the array. Success is false if TargetSU is not in the successor subtree of StartSU, else it is true.

InitDAGTopologicalSorting

Creates the initial topological ordering from the DAG to be scheduled.

IsReachable

Checks if SU is reachable from TargetSU.

MarkDirty

Mark the ordering as temporarily broken, after a new node has been added.

RemovePred

Updates the topological ordering to accommodate an edge to be removed from the specified node N from the predecessors of the current node M.

WillCreateCycle

Returns true if addPred(TargetSU, SU) creates a cycle.

begin

end

rbegin

rend