HomeSort by relevance Sort by last modified time
    Searched refs:StmtNode (Results 1 - 11 of 11) sorted by null

  /external/llvm/lib/Target/Hexagon/
RDFCopy.h 47 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
HexagonOptAddrMode.cpp 83 bool canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, MachineInstr *MI,
85 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
86 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
139 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN,
165 MachineInstr *UseMI = NodeAddr<StmtNode *>(IA).Addr->getCode();
190 bool HexagonOptAddrMode::allValidCandidates(NodeAddr<StmtNode *> SA,
202 NodeAddr<StmtNode *> TempIA = DA.Addr->getOwner(*DFG);
213 void HexagonOptAddrMode::getAllRealUses(NodeAddr<StmtNode *> SA,
224 NodeAddr<StmtNode *> TempIA = UA.Addr->getOwner(*DFG);
263 NodeAddr<StmtNode *> SN = UN.Addr->getOwner(*DFG)
    [all...]
HexagonRDFOpt.cpp 149 NodeAddr<StmtNode*> SA = TA;
165 auto SA = DFG.addr<StmtNode*>(N);
176 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
205 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
RDFCopy.cpp 77 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) {
124 NodeAddr<StmtNode*> SA = IA;
149 dbgs() << "Instr: " << *DFG.addr<StmtNode*>(I).Addr->getCode();
214 << *NodeAddr<StmtNode*>(IA).Addr->getCode();
RDFDeadCode.cpp 75 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode()))
152 if (isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode()))
226 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
RDFGraph.h 574 struct StmtNode : public InstrNode {
753 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
776 void linkStmtRefs(DefStackMap &DefM, NodeAddr<StmtNode*> SA);
RDFLiveness.cpp 139 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent();
159 auto CA = NodeAddr<StmtNode*>(OA).Addr->getCode();
160 auto CB = NodeAddr<StmtNode*>(OB).Addr->getCode();
    [all...]
RDFGraph.cpp 210 const Print<NodeAddr<StmtNode*>> &P) {
225 OS << PrintNode<StmtNode*>(P.Obj, P.G);
907 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner,
909 NodeAddr<StmtNode*> SA = newNode(NodeAttrs::Code | NodeAttrs::Stmt);
1035 auto *MI = NodeAddr<StmtNode*>(IA).Addr->getCode();
    [all...]
  /external/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 146 bool TraverseStmt(Stmt *StmtNode) {
148 const Stmt *StmtToTraverse = StmtNode;
151 const Expr *ExprNode = dyn_cast_or_null<Expr>(StmtNode);
222 bool baseTraverse(const Stmt &StmtNode) {
223 return VisitorBase::TraverseStmt(const_cast<Stmt*>(&StmtNode));
369 bool TraverseStmt(Stmt *StmtNode);
823 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode) {
824 if (!StmtNode) {
827 match(*StmtNode);
828 return RecursiveASTVisitor<MatchASTVisitor>::TraverseStmt(StmtNode);
    [all...]
  /external/clang/lib/Analysis/
Consumed.cpp 75 if (const Stmt *StmtNode = Block->getTerminator()) {
76 return StmtNode->getLocStart();
517 PropagationInfo getInfo(const Expr *StmtNode) const {
518 ConstInfoEntry Entry = findInfo(StmtNode);
    [all...]
  /external/clang/lib/AST/
ASTContext.cpp     [all...]

Completed in 841 milliseconds