Home
last modified time | relevance | path

Searched refs:FirstN (Results 1 - 2 of 2) sorted by relevance

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DValueMapper.cpp249 /// 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);
291 /// This traverses the metadata graph deeply enough to map \c FirstN. It
300 /// \post \c G.POT is a post-order traversal ending with \c FirstN.
303 bool createPOT(UniquedGraph &G, const MDNode &FirstN);
625 bool MDNodeMapper::createPOT(UniquedGraph &G, const MDNode &FirstN) { in createPOT() argument
627 assert(FirstN.isUniqued() && "Expected uniqued node in POT"); in createPOT()
629 // Construct a post-order traversal of the uniqued subgraph under FirstN. in createPOT()
632 Worklist.push_back(POTWorklistEntry(const_cast<MDNode &>(FirstN))); in createPOT()
755 mapTopLevelUniquedNode(const MDNode &FirstN) mapTopLevelUniquedNode() argument
[all...]
/third_party/json/tests/thirdparty/Fuzzer/
H A DFuzzerTraceState.cpp128 const size_t FirstN = 64; in WantToHandleOneMoreMutation() local
130 if (NumMutations <= FirstN) return true; in WantToHandleOneMoreMutation()
131 size_t Diff = NumMutations - FirstN; in WantToHandleOneMoreMutation()

Completed in 2 milliseconds