Lines Matching defs:FirstN

251   /// underneath \c FirstN and calculates the nodes' mapping.  Each node uses
257   ///  1. \a createPOT(): traverse the uniqued subgraph under \c FirstN and
267   Metadata *mapTopLevelUniquedNode(const MDNode &FirstN);
294   /// This traverses the metadata graph deeply enough to map \c FirstN.  It
303   /// \post \c G.POT is a post-order traversal ending with \c FirstN.
306   bool createPOT(UniquedGraph &G, const MDNode &FirstN);
726 bool MDNodeMapper::createPOT(UniquedGraph &G, const MDNode &FirstN) {
728   assert(FirstN.isUniqued() && "Expected uniqued node in POT");
730   // Construct a post-order traversal of the uniqued subgraph under FirstN.
733   Worklist.push_back(POTWorklistEntry(const_cast<MDNode &>(FirstN)));
734   (void)G.Info[&FirstN];
861 Metadata *MDNodeMapper::mapTopLevelUniquedNode(const MDNode &FirstN) {
862   assert(FirstN.isUniqued() && "Expected uniqued node");
864   // Create a post-order traversal of uniqued nodes under FirstN.
866   if (!createPOT(G, FirstN)) {
870     return &const_cast<MDNode &>(FirstN);
880   return *getMappedOp(&FirstN);