Optimize ScheduleDAGRRList's topological sort to use one pass instead

of two, and to not need a scratch std::vector. Also, compute the ordering
immediately in the result array, instead of in another scratch std::vector
that is copied to the result array.

llvm-svn: 55421