HomeSort by: relevance | last modified time | path
    Searched defs:getNode (Results 1 - 25 of 28) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
WorkList.h 48 ExplodedNode *getNode() const { return node; }
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Transformer/
RangeSelector.cpp 54 static Expected<DynTypedNode> getNode(const ast_matchers::BoundNodes &Nodes,
143 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID);
156 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID);
190 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID);
202 Expected<DynTypedNode> N = getNode(Result.Nodes, ID);
260 Expected<DynTypedNode> N = getNode(Result.Nodes, ID);
Stencil.cpp 37 getNode(const ast_matchers::BoundNodes &Nodes, StringRef Id) {
185 auto NodeOrErr = getNode(Match.Nodes, Id);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachinePostDominators.h 47 return PDT->getNode(BB);
50 MachineDomTreeNode *getNode(MachineBasicBlock *BB) const {
51 return PDT->getNode(BB);
MachineDominators.h 157 return DT->getNode(BB);
160 /// getNode - return the (Post)DominatorTree node for the specified basic
163 MachineDomTreeNode *getNode(MachineBasicBlock *BB) const {
165 return DT->getNode(BB);
MachinePipeliner.h 361 SUnit *getNode(unsigned i) const { return Nodes[i]; };
ScheduleDAG.h 355 SDNode *getNode() const {
583 return getNodeDesc(SU->getNode());
654 const SUnit *getNode() const { return Node; }
  /src/external/apache2/llvm/dist/clang/utils/
FindSpecRefs 776 def getNode(keys):
779 key,parent = keys[-1],getNode(keys[:-1])
786 n = getNode((ref.name,) + ref.section.indices)
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CallGraph.cpp 197 CallGraphNode *CallGraph::getNode(const Decl *F) const {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
RegionIterator.h 80 NodeRef getNode() const { return Node.getPointer(); }
89 succ = getNode()->getParent()->getNode(BB);
97 return getNode()->template getNodeAs<RegionT>()->getExit();
102 return getNode()->getParent()->getExit() == BB;
150 while (BItor != BlockTraits::child_end(getNode()->getEntry())
294 return R->getNode(R->getEntry()); \
RegionInfo.h 370 RegionNodeT *getNode() const {
513 RegionNodeT *getNode(BlockT *BB) const;
LazyCallGraph.h 158 Node &getNode() const;
1210 GetEndT &&GetEnd, GetNodeT &&GetNode,
1246 inline LazyCallGraph::Node &LazyCallGraph::Edge::getNode() const {
1253 return getNode().getFunction();
RegionInfoImpl.h 107 if (!DT->getNode(BB))
169 if (DT->getNode(Pred) && !contains(Pred)) {
375 typename Tr::RegionNodeT *RegionBase<Tr>::getNode(BlockT *BB) const {
378 return Child->getNode();
644 return PDT->getNode(e->second)->getIDom();
687 DomTreeNodeT *N = PDT->getNode(entry);
728 DomTreeNodeT *N = DT->getNode(entry);
920 buildRegionsTree(DT->getNode(BB), TopLevelRegion);
BlockFrequencyInfoImpl.h 879 BlockNode getNode(const rpot_iterator &I) const {
883 BlockNode getNode(const BlockT *BB) const { return Nodes.lookup(BB).first; }
981 return BlockFrequencyInfoImplBase::getBlockFreq(getNode(BB));
987 return BlockFrequencyInfoImplBase::getBlockProfileCount(F, getNode(BB),
999 return BlockFrequencyInfoImplBase::isIrrLoopHeader(getNode(BB));
1012 return BlockFrequencyInfoImplBase::getFloatingBlockFreq(getNode(BB));
1034 return BlockFrequencyInfoImplBase::printBlockFreq(OS, getNode(BB));
1111 BlockFrequencyInfoImplBase::setBlockFreq(getNode(BB), Freq);
1134 BlockNode Node = getNode(I);
1160 BlockNode Header = getNode(Loop->getHeader())
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 394 ExplodedNode *ExplodedGraph::getNode(const ProgramPoint &L,
  /src/external/apache2/llvm/dist/llvm/include/llvm/BinaryFormat/
MsgPackDocument.h 308 DocNode getNode() {
314 DocNode getNode(int64_t V) {
321 DocNode getNode(int V) {
328 DocNode getNode(uint64_t V) {
335 DocNode getNode(unsigned V) {
342 DocNode getNode(bool V) {
349 DocNode getNode(double V) {
357 DocNode getNode(StringRef V, bool Copy = false) {
367 DocNode getNode(const char *V, bool Copy = false) {
368 return getNode(StringRef(V), Copy)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
ItaniumManglingCanonicalizer.cpp 79 itanium_demangle::Node *getNode() {
82 void Profile(llvm::FoldingSetNodeID &ID) { profileNode(ID, getNode()); }
109 return {static_cast<T*>(Existing->getNode()), false};
119 T *Result = new (New->getNode()) T(std::forward<Args>(As)...);
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsOptimizePICCall.cpp 68 const MachineDomTreeNode *getNode() const;
183 const MachineDomTreeNode *MBBInfo::getNode() const { return Node; }
220 const MachineDomTreeNode *Node = MBBI.getNode();
229 MachineBasicBlock *MBB = MBBI.getNode()->getBlock();
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
Graph.h 114 NodeEntry &N = G.getNode(NIds[NIdx]);
135 NodeEntry &N = G.getNode(NIds[NIdx]);
180 NodeEntry &getNode(NodeId NId) {
184 const NodeEntry &getNode(NodeId NId) const {
452 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); }
470 getNode(NId).Costs = AllocatedCosts;
482 return getNode(NId).Costs;
493 return getNode(NId).Metadata;
497 return getNode(NId).Metadata;
501 return getNode(NId).getAdjEdgeIds().size()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
TypeBasedAliasAnalysis.cpp 157 /// getNode - Get the MDNode for this TBAANode.
158 MDNodeTy *getNode() const { return Node; }
210 MDNodeTy *getNode() const { return Node; }
274 const MDNode *getNode() const { return Node; }
281 return getNode() == Other.getNode();
292 return (getNode()->getNumOperands() - FirstFieldOpNo) / NumOpsPerField;
299 auto *TypeNode = cast<MDNode>(getNode()->getOperand(OpIndex));
492 while (TA.getNode()) {
493 if (PathA.count(TA.getNode()))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
ImmutableGraph.h 422 static NodeRef getNode(typename GraphT::Node const &N) { return NodeRef{&N}; }
424 mapped_iterator<typename GraphT::Node const *, decltype(&getNode)>;
426 return {G->nodes_begin(), &getNode};
429 return {G->nodes_end(), &getNode};
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
GenericDomTree.h 347 /// getNode - return the (Post)DominatorTree node for the specified basic
351 DomTreeNodeBase<NodeT> *getNode(const NodeT *BB) const {
358 /// See getNode.
360 return getNode(BB);
376 const DomTreeNodeBase<NodeT> *RN = getNode(R);
408 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
481 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
482 DomTreeNodeBase<NodeT> *NodeB = getNode(B);
620 assert(getNode(BB) == nullptr && "Block already in dominator tree!");
621 DomTreeNodeBase<NodeT> *IDomNode = getNode(DomBB)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
ASTMatchersInternal.h 241 DynTypedNode getNode(StringRef ID) const {
1984 return Nodes.getNode(ID) != Node;
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 144 const Node &getNode(NodeId Id) const { return Nodes[Id]; }
213 return std::make_tuple(MyId, Tree.getNode(MyId).Parent);
230 N.Height = std::max(N.Height, 1 + Tree.getNode(Child).Height);
285 const Node &N = Tree.getNode(Id);
300 for (NodeId Child : Tree.getNode(Ids[Expanded++]).Children)
310 for (NodeId Child : getNode(Id).Children)
323 while ((Parent = getNode(Cur).Parent).isValid() &&
324 getNode(Parent).Children[0] == Cur) {
332 return getNode(Id).RightMostDescendant - Id + 1;
336 return Id >= SubtreeRoot && Id <= getNode(SubtreeRoot).RightMostDescendant
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
Metadata.h 1230 const MDNode *getNode() const { return Node; }

Completed in 36 milliseconds

1 2