Lines Matching defs:FirstN

249   /// underneath \c FirstN and calculates the nodes' mapping.  Each node uses
255   ///  1. \a createPOT(): traverse the uniqued subgraph under \c FirstN and
265   Metadata *mapTopLevelUniquedNode(const MDNode &FirstN);
292   /// This traverses the metadata graph deeply enough to map \c FirstN.  It
301   /// \post \c G.POT is a post-order traversal ending with \c FirstN.
304   bool createPOT(UniquedGraph &G, const MDNode &FirstN);
727 bool MDNodeMapper::createPOT(UniquedGraph &G, const MDNode &FirstN) {
729   assert(FirstN.isUniqued() && "Expected uniqued node in POT");
731   // Construct a post-order traversal of the uniqued subgraph under FirstN.
734   Worklist.push_back(POTWorklistEntry(const_cast<MDNode &>(FirstN)));
735   (void)G.Info[&FirstN];
862 Metadata *MDNodeMapper::mapTopLevelUniquedNode(const MDNode &FirstN) {
863   assert(FirstN.isUniqued() && "Expected uniqued node");
865   // Create a post-order traversal of uniqued nodes under FirstN.
867   if (!createPOT(G, FirstN)) {
871     return &const_cast<MDNode &>(FirstN);
881   return *getMappedOp(&FirstN);