| /freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | StmtNodes.td | 3 class StmtNode<StmtNode base, bit abstract = 0> : ASTNode, AttrSubject {
4 StmtNode Base = base;
9 def Stmt : StmtNode<?, 1>;
10 def NullStmt : StmtNode<Stmt>;
11 def CompoundStmt : StmtNode<Stmt>;
12 def IfStmt : StmtNode<Stmt>;
13 def SwitchStmt : StmtNode<Stmt>;
14 def WhileStmt : StmtNode<Stmt>;
15 def DoStmt : StmtNode<Stmt>;
16 def ForStmt : StmtNode<Stmt>;
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonOptAddrMode.cpp | 92 bool processAddBases(NodeAddr<StmtNode *> AddSN, MachineInstr *AddMI);
93 bool usedInLoadStore(NodeAddr<StmtNode *> CurrentInstSN, int64_t NewOffset);
96 std::vector<std::pair<NodeAddr<StmtNode *>, NodeAddr<UseNode *>>>
98 NodeAddr<StmtNode *> &UseSN);
101 bool processAddUses(NodeAddr<StmtNode *> AddSN, MachineInstr *AddMI,
107 bool canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, MachineInstr &MI,
109 bool isSafeToExtLR(NodeAddr<StmtNode *> SN, MachineInstr *MI,
111 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
112 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
167 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, in canRemoveAddasl()
[all …]
|
| H A D | RDFCopy.cpp | 64 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { in recordCopy()
110 NodeAddr<StmtNode*> SA = IA; in scanBlock()
134 dbgs() << "Instr: " << *DFG.addr<StmtNode*>(I).Addr->getCode(); in run()
215 << *NodeAddr<StmtNode*>(IA).Addr->getCode(); in run()
|
| H A D | HexagonRDFOpt.cpp | 163 NodeAddr<StmtNode*> SA = TA; in run()
178 auto SA = DFG.addr<StmtNode*>(N); in run()
188 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in removeOperand()
217 MachineInstr &MI = *NodeAddr<StmtNode*>(IA).Addr->getCode(); in rewrite()
|
| H A D | RDFCopy.h | 53 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
|
| H A D | RDFDeadCode.h | 58 bool isLiveInstr(NodeAddr<StmtNode*> S) const;
|
| H A D | RDFDeadCode.cpp | 58 bool DeadCodeElimination::isLiveInstr(NodeAddr<StmtNode *> S) const { in isLiveInstr()
237 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in erase()
|
| /freebsd/contrib/llvm-project/clang/utils/TableGen/ |
| H A D | ASTTableGen.h | 225 class StmtNode : public ASTNode {
227 StmtNode(const llvm::Record *record = nullptr) : ASTNode(record) {} in ASTNode()
231 StmtNode getBase() const { return StmtNode(ASTNode::getBase().getRecord()); } in getBase()
|
| H A D | ASTTableGen.cpp | 67 StringRef clang::tblgen::StmtNode::getClassName() const { in getClassName()
70 std::string clang::tblgen::StmtNode::getId() const { in getId()
|
| /freebsd/contrib/llvm-project/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 164 Stmt *getStmtToTraverse(Stmt *StmtNode) { in getStmtToTraverse() argument
165 Stmt *StmtToTraverse = StmtNode; in getStmtToTraverse()
166 if (auto *ExprNode = dyn_cast_or_null<Expr>(StmtNode)) { in getStmtToTraverse()
167 auto *LambdaNode = dyn_cast_or_null<LambdaExpr>(StmtNode); in getStmtToTraverse()
178 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) { in TraverseStmt() argument
184 Stmt *StmtToTraverse = getStmtToTraverse(StmtNode); in TraverseStmt()
188 if (IgnoreImplicitChildren && isa<CXXDefaultArgExpr>(StmtNode)) in TraverseStmt()
340 bool baseTraverse(const Stmt &StmtNode) { in baseTraverse() argument
341 return VisitorBase::TraverseStmt(const_cast<Stmt*>(&StmtNode)); in baseTraverse()
503 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr);
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | ParentMapContext.cpp | 466 bool dataTraverseStmtPre(Stmt *StmtNode) { in dataTraverseStmtPre() argument
467 addParent(StmtNode, &Map.PointerParents); in dataTraverseStmtPre()
468 ParentStack.push_back(DynTypedNode::create(*StmtNode)); in dataTraverseStmtPre()
471 bool dataTraverseStmtPost(Stmt *StmtNode) { in dataTraverseStmtPost() argument
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFGraph.h | 375 struct StmtNode;
391 using Stmt = NodeAddr<StmtNode *>;
637 struct StmtNode : public InstrNode { struct
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | Consumed.cpp | 76 if (const Stmt *StmtNode = Block->getTerminatorStmt()) { in getLastStmtLoc() local
77 return StmtNode->getBeginLoc(); in getLastStmtLoc()
512 PropagationInfo getInfo(const Expr *StmtNode) const { in getInfo()
513 ConstInfoEntry Entry = findInfo(StmtNode); in getInfo()
|
| H A D | UnsafeBufferUsage.cpp | 143 if (const Stmt *StmtNode = DynNode.get<Stmt>()) { in findMatch() local
144 TraverseStmt(const_cast<Stmt *>(StmtNode)); in findMatch()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 161 return NodeAddr<StmtNode *>(IA).Addr->getCode()->getParent(); in getAllReachingDefs()
193 const MachineInstr *InA = NodeAddr<StmtNode *>(OA).Addr->getCode(); in getAllReachingDefs()
194 const MachineInstr *InB = NodeAddr<StmtNode *>(OB).Addr->getCode(); in getAllReachingDefs()
|
| H A D | RDFGraph.cpp | 253 OS << PrintNode<StmtNode *>(P.Obj, P.G); in operator <<()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 456 MachineInstr *Sink = DFG.addr<StmtNode *>(TransmitterId).Addr->getCode(); in getGadgetGraph()
475 for (NodeAddr<StmtNode *> SA : in getGadgetGraph()
|