Lines Matching refs:OrderedEntries
3796 ArrayRef<TreeEntry *> OrderedEntries = It->second.getArrayRef(); in reorderTopToBottom() local
3803 for (const TreeEntry *OpTE : OrderedEntries) { in reorderTopToBottom()
3974 SetVector<TreeEntry *> OrderedEntries; in reorderBottomToTop() local
3980 for_each(VectorizableTree, [this, &OrderedEntries, &GathersToOrders, in reorderBottomToTop()
3987 OrderedEntries.insert(TE.get()); in reorderBottomToTop()
3998 while (!OrderedEntries.empty()) { in reorderBottomToTop()
4003 for (TreeEntry *TE : OrderedEntries) { in reorderBottomToTop()
4028 [&OrderedEntries](TreeEntry *TE) { OrderedEntries.remove(TE); }); in reorderBottomToTop()
4041 [&OrderedEntries](const std::pair<unsigned, TreeEntry *> &Op) { in reorderBottomToTop()
4042 OrderedEntries.remove(Op.second); in reorderBottomToTop()
4132 [&OrderedEntries](const std::pair<unsigned, TreeEntry *> &Op) { in reorderBottomToTop()
4133 OrderedEntries.remove(Op.second); in reorderBottomToTop()
4149 [&OrderedEntries](const std::pair<unsigned, TreeEntry *> &Op) { in reorderBottomToTop()
4150 OrderedEntries.remove(Op.second); in reorderBottomToTop()
4165 OrderedEntries.remove(TE); in reorderBottomToTop()
4193 OrderedEntries.remove(Gather); in reorderBottomToTop()
4211 OrderedEntries.insert(Data.first); in reorderBottomToTop()