Searched refs:NodeInfo (Results 1 – 7 of 7) sorted by relevance
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 258 struct NodeInfo { struct
259 NodeInfo *Group = this; argument
266 NodeInfo *find(NodeInfo *Node) { in find() argument
275 NodeInfo *G1 = find(&NodeInfoMap[Edge->Source]); in unionGroups()
276 NodeInfo *G2 = find(&NodeInfoMap[Edge->Target]); in unionGroups()
294 std::unordered_map<NodeType *, NodeInfo> NodeInfoMap;
|
| /openbsd-src/gnu/llvm/clang/utils/TableGen/ |
| H A D | ClangASTPropertiesEmitter.cpp | 78 struct NodeInfo { struct
93 std::map<HasProperties, NodeInfo> NodeInfos;
182 void visitAllProperties(HasProperties derived, const NodeInfo &derivedInfo, in visitAllProperties()
197 [&](HasProperties node, const NodeInfo &info) { in visitAllProperties()
208 const NodeInfo &derivedNodeInfo, in visitAllNodesWithInfo()
210 const NodeInfo &info)> in visitAllNodesWithInfo()
278 void validateNode(HasProperties node, const NodeInfo &nodeInfo);
296 const NodeInfo &derivedNodeInfo) { in validateNode()
304 const NodeInfo &nodeInfo) { in validateNode()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | TruncInstCombine.cpp | 386 TruncInstCombine::Info &NodeInfo = Itr.second; in ReduceExpressionGraph() local
388 assert(!NodeInfo.NewValue && "Instruction has been evaluated"); in ReduceExpressionGraph()
403 NodeInfo.NewValue = I->getOperand(0); in ReduceExpressionGraph()
476 NodeInfo.NewValue = Res; in ReduceExpressionGraph()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | MachinePipeliner.h | 132 struct NodeInfo { struct
138 NodeInfo() = default; argument
141 std::vector<NodeInfo> ScheduleInfo;
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/ |
| H A D | CodeGenDAGPatterns.cpp | 1613 const SDNodeInfo &NodeInfo, in getOperandNum() argument
1615 unsigned NumResults = NodeInfo.getNumResults(); in getOperandNum()
1639 const SDNodeInfo &NodeInfo, in ApplyTypeConstraint() argument
1645 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo); in ApplyTypeConstraint()
1667 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo); in ApplyTypeConstraint()
1690 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1699 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1707 getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1717 getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1732 N, NodeInfo, OResNo); in ApplyTypeConstraint()
[all …]
|
| H A D | CodeGenDAGPatterns.h | 421 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/MIRParser/ |
| H A D | MIParser.cpp | 1371 auto NodeInfo = PFS.IRSlots.MetadataNodes.find(ID); in parseMetadata() local
1372 if (NodeInfo != PFS.IRSlots.MetadataNodes.end()) { in parseMetadata()
1373 MD = NodeInfo->second.get(); in parseMetadata()
1377 NodeInfo = PFS.MachineMetadataNodes.find(ID); in parseMetadata()
1378 if (NodeInfo != PFS.MachineMetadataNodes.end()) { in parseMetadata()
1379 MD = NodeInfo->second.get(); in parseMetadata()
2241 auto NodeInfo = PFS.IRSlots.MetadataNodes.find(ID); in parseMDNode() local
2242 if (NodeInfo == PFS.IRSlots.MetadataNodes.end()) { in parseMDNode()
2243 NodeInfo = PFS.MachineMetadataNodes.find(ID); in parseMDNode()
2244 if (NodeInfo == PFS.MachineMetadataNodes.end()) in parseMDNode()
[all …]
|