Home
last modified time | relevance | path

Searched refs:InfoRec (Results 1 – 4 of 4) sorted by relevance

/external/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h39 InfoRec &VInfo = DT.Info[DT.Roots[i]]; in DFSPass()
46 InfoRec &SuccVInfo = DT.Info[*SI]; in DFSPass()
62 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
94 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = in DFSPass()
109 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInInfo = in Eval()
122 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInfo = in Eval()
137 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VAInfo = in Eval()
157 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in Calculate()
192 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &WInfo = in Calculate()
DGenericDomTree.h224 struct InfoRec { struct
230 InfoRec() : DFSNum(0), Parent(0), Semi(0), Label(nullptr) {} in InfoRec() argument
239 DenseMap<NodeT *, InfoRec> Info;
/external/llvm-project/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h64 struct InfoRec { struct
76 DenseMap<NodePtr, InfoRec> NodeToInfo;
241 SmallVectorImpl<InfoRec *> &Stack) { in eval()
242 InfoRec *VInfo = &NodeToInfo[V]; in eval()
255 const InfoRec *PInfo = VInfo; in eval()
256 const InfoRec *PLabelInfo = &NodeToInfo[PInfo->Label]; in eval()
260 const InfoRec *VLabelInfo = &NodeToInfo[VInfo->Label]; in eval()
281 SmallVector<InfoRec *, 32> EvalStack;
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h61 struct InfoRec { struct
73 DenseMap<NodePtr, InfoRec> NodeToInfo;
274 SmallVectorImpl<InfoRec *> &Stack) { in eval()
275 InfoRec *VInfo = &NodeToInfo[V]; in eval()
288 const InfoRec *PInfo = VInfo; in eval()
289 const InfoRec *PLabelInfo = &NodeToInfo[PInfo->Label]; in eval()
293 const InfoRec *VLabelInfo = &NodeToInfo[VInfo->Label]; in eval()
314 SmallVector<InfoRec *, 32> EvalStack;