13 // to identify roots.
22 // In order to support this particular transformation, all stack roots are
44     /// roots.
52     /// Roots - GC roots in the current function. Each is a pair of the
54     std::vector<std::pair<CallInst*,AllocaInst*> > Roots;  member in __anon8290c8c00111::ShadowStackGC
210   for (unsigned I = 0; I != Roots.size(); ++I) {  in GetFrameMap()
211     Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));  in GetFrameMap()
221     ConstantInt::get(Int32Ty, Roots.size(), false),  in GetFrameMap()
263   for (size_t I = 0; I != Roots.size(); I++)  in GetConcreteStackEntryType()
264     EltTys.push_back(Roots[I].second->getAllocatedType());  in GetConcreteStackEntryType()
273   //   int32_t NumRoots; // Number of roots in stack frame.  in initializeCustomLowering()
275   //   void *Meta[];     // May be absent for roots without metadata.  in initializeCustomLowering()
288   //   void *Roots[];          // Stack roots (in-place array, so we pretend).  in initializeCustomLowering()
327   assert(Roots.empty() && "Not cleaned up?");  in CollectRoots()
339               Roots.push_back(Pair);  in CollectRoots()
344   // Number roots with metadata (usually empty) at the beginning, so that the  in CollectRoots()
346   Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end());  in CollectRoots()
381   // If there are no roots in this function, then there is no need to add a  in performCustomLowering()
383   if (Roots.empty())  in performCustomLowering()
407   for (unsigned I = 0, E = Roots.size(); I != E; ++I) {  in performCustomLowering()
412     AllocaInst *OriginalAlloca = Roots[I].second;  in performCustomLowering()
446   for (unsigned I = 0, E = Roots.size(); I != E; ++I) {  in performCustomLowering()
447     Roots[I].first->eraseFromParent();  in performCustomLowering()
448     Roots[I].second->eraseFromParent();  in performCustomLowering()
451   Roots.clear();  in performCustomLowering()