reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/Support/GenericDomTreeConstruction.h
  103     NodeToInfo.clear();
  170     auto InfoIt = NodeToInfo.find(BB);
  171     if (InfoIt == NodeToInfo.end()) return nullptr;
  223     if (NodeToInfo.count(V) != 0) NodeToInfo[V].Parent = AttachToNum;
  223     if (NodeToInfo.count(V) != 0) NodeToInfo[V].Parent = AttachToNum;
  227       auto &BBInfo = NodeToInfo[BB];
  238         const auto SIT = NodeToInfo.find(Succ);
  241         if (SIT != NodeToInfo.end() && SIT->second.DFSNum != 0) {
  250         auto &SuccInfo = NodeToInfo[Succ];
  275     InfoRec *VInfo = &NodeToInfo[V];
  283       VInfo = &NodeToInfo[NumToNode[VInfo->Parent]];
  289     const InfoRec *PLabelInfo = &NodeToInfo[PInfo->Label];
  293       const InfoRec *VLabelInfo = &NodeToInfo[VInfo->Label];
  309       auto &VInfo = NodeToInfo[V];
  317       auto &WInfo = NodeToInfo[W];
  322         if (NodeToInfo.count(N) == 0)  // Skip unreachable predecessors.
  330         unsigned SemiU = NodeToInfo[eval(N, i + 1, EvalStack)].Semi;
  341       auto &WInfo = NodeToInfo[W];
  342       const unsigned SDomNum = NodeToInfo[NumToNode[WInfo.Semi]].DFSNum;
  344       while (NodeToInfo[WIDomCandidate].DFSNum > SDomNum)
  345         WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
  360     auto &BBInfo = NodeToInfo[nullptr];
  442         if (SNCA.NodeToInfo.count(I) == 0) {
  470             SNCA.NodeToInfo.erase(N);
  596     NodeToInfo[NumToNode[1]].IDom = AttachTo->getBlock();
  619     NodeToInfo[NumToNode[1]].IDom = AttachTo->getBlock();
  624       const TreeNodePtr NewIDom = DT.getNode(NodeToInfo[N].IDom);
 1314       if (NodeToInfo.count(BB) == 0) {
 1521         if (NodeToInfo.count(Child->getBlock()) != 0) {
 1557           if (NodeToInfo.count(S->getBlock()) == 0) {