Searched defs:getNode (Results 1 - 25 of 46) sorted by relevance

12

/external/eigen/doc/
H A Deigen_navtree_hacks.js53 function getNode(o, po) function
/external/llvm/include/llvm/CodeGen/
H A DMachinePostDominators.h49 return DT->getNode(BB);
52 MachineDomTreeNode *getNode(MachineBasicBlock *BB) const { function in struct:llvm::MachinePostDominatorTree
53 return DT->getNode(BB);
H A DMachineDominators.h160 return DT->getNode(BB);
163 /// getNode - return the (Post)DominatorTree node for the specified basic
166 inline MachineDomTreeNode *getNode(MachineBasicBlock *BB) const { function in class:llvm::MachineDominatorTree
168 return DT->getNode(BB);
H A DScheduleDAG.h386 /// getNode - Return the representative SDNode for this SUnit.
388 SDNode *getNode() const { function
586 return getNodeDesc(SU->getNode());
650 const SUnit *getNode() const { return Node; } function in class:llvm::SUnit::SUnitIterator
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DCommonTreeNodeStream.as196 public function getNode(i:int):Object { function
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java57 Node a_node = getNode(a);
58 Node b_node = getNode(b);
62 protected Node getNode(Object a) { method in class:Graph
/external/apache-xml/src/main/java/org/apache/xpath/
H A DSourceTreeManager.java172 int cachedNode = getNode(source);
196 public int getNode(Source source) method in class:SourceTreeManager
200 // return ((DOMSource) source).getNode();
210 // System.out.println("getNode: "+n);
215 // System.out.println("getNode - url: "+url);
216 // System.out.println("getNode - sTree.m_url: "+sTree.m_url);
221 // System.out.println("getNode - returning: "+node);
276 int n = getNode(source);
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DWorkList.h49 ExplodedNode *getNode() const { return node; } function in class:clang::ento::WorkListUnit
/external/llvm/include/llvm/Analysis/
H A DPostDominators.h50 return DT->getNode(BB);
53 inline DomTreeNode *getNode(BasicBlock *BB) const { function in struct:llvm::PostDominatorTree
54 return DT->getNode(BB);
H A DRegionIterator.h65 NodeType* getNode() const{ return Node.getPointer(); } function in class:llvm::RNSuccIterator
74 succ = getNode()->getParent()->getNode(BB);
82 return getNode()->template getNodeAs<RegionT>()->getExit();
87 return getNode()->getParent()->getExit() == BB;
137 while (BItor != BlockTraits::child_end(getNode()->getEntry())
281 return R->getNode(R->getEntry()); \
H A DRegionInfo.h363 RegionNodeT *getNode() const { function in class:llvm::RegionBase
501 RegionNodeT *getNode(BlockT *BB) const;
H A DRegionInfoImpl.h106 if (!DT->getNode(BB))
171 if (DT->getNode(Pred) && !contains(Pred)) {
357 typename Tr::RegionNodeT *RegionBase<Tr>::getNode(BlockT *BB) const { function in class:llvm::RegionBase
360 return Child->getNode();
628 return PDT->getNode(e->second)->getIDom();
671 DomTreeNodeT *N = PDT->getNode(entry);
711 DomTreeNodeT *N = DT->getNode(entry);
914 buildRegionsTree(DT->getNode(BB), TopLevelRegion);
/external/clang/lib/Analysis/
H A DCallGraph.cpp142 CallGraphNode *CallGraph::getNode(const Decl *F) const { function in class:CallGraph
/external/clang/utils/
H A DFindSpecRefs776 def getNode(keys): function in function:buildRefTree
779 key,parent = keys[-1],getNode(keys[:-1])
786 n = getNode((ref.name,) + ref.section.indices)
/external/deqp/framework/common/
H A DtcuTestHierarchyIterator.cpp135 TestNode* TestHierarchyIterator::getNode (void) const function in class:tcu::TestHierarchyIterator
/external/llvm/lib/Analysis/
H A DScopedNoAliasAA.cpp63 /// getNode - Get the MDNode for this AliasScopeNode.
64 const MDNode *getNode() const { return Node; } function in class:__anon10373::AliasScopeNode
H A DTypeBasedAliasAnalysis.cpp151 /// getNode - Get the MDNode for this TBAANode.
152 const MDNode *getNode() const { return Node; } function in class:__anon10375::TBAANode
189 const MDNode *getNode() const { return Node; } function in class:__anon10375::TBAAStructTagNode
225 const MDNode *getNode() const { return Node; } function in class:__anon10375::TBAAStructTypeNode
357 if (T.getNode() == B)
363 if (!T.getNode())
369 if (T.getNode() == A)
375 if (!T.getNode())
383 if (RootA.getNode() != RootB.getNode())
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp301 ExplodedNode *ExplodedGraph::getNode(const ProgramPoint &L, function in class:ExplodedGraph
398 ExplodedNode *NewN = G->getNode(N->getLocation(), N->State, N->isSink(),
/external/llvm/lib/IR/
H A DAttributeImpl.h197 const IndexAttrPair *getNode(unsigned Slot) const { function in class:llvm::AttributeSetImpl
233 return getNode(Slot)->first;
240 return AttributeSet::get(Context, *getNode(Slot));
246 return getNode(Slot)->second;
254 Profile(ID, makeArrayRef(getNode(0), getNumAttributes()));
/external/llvm/lib/Target/Mips/
H A DMipsOptimizePICCall.cpp50 const MachineDomTreeNode *getNode() const;
163 const MachineDomTreeNode *MBBInfo::getNode() const { return Node; } function in class:MBBInfo
200 const MachineDomTreeNode *Node = MBBI.getNode();
210 MachineBasicBlock *MBB = MBBI.getNode()->getBlock();
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h93 inline Node *getNode() const { assert(e); return d ? function in class:nv50_ir::Graph::EdgeIterator
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
H A DDOM2DTM.java127 m_pos=m_root = domSource.getNode();
604 public Node getNode(int nodeHandle) method in class:DOM2DTM
816 Node node = getNode(nodeHandle);
871 Node node = getNode(nodeHandle);
958 Node node = getNode(nodeHandle);
982 Node node = getNode(nodeHandle);
1001 Node node = getNode(nodeHandle);
1060 Node node = getNode(nodeHandle);
1103 Node node = getNode(nodeHandle);
1115 Node node = getNode(nodeHandl
[all...]
/external/skia/src/core/
H A DSkTLList.h219 Node* getNode() { return INHERITED::get(); } function in class:SkTLList::Iter
347 fList.addBefore(node, location.getNode());
355 fList.addAfter(node, location.getNode());
/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h122 NodeEntry &N = G.getNode(NIds[NIdx]);
152 NodeEntry &N = G.getNode(NIds[NIdx]);
193 NodeEntry &getNode(NodeId NId) { function in class:llvm::PBQP::Graph
197 const NodeEntry &getNode(NodeId NId) const {
458 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); }
476 getNode(NId).Costs = AllocatedCosts;
488 return getNode(NId).Costs;
499 return getNode(NId).Metadata;
503 return getNode(NId).Metadata;
507 return getNode(NI
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/
H A DDTM.java842 public org.w3c.dom.Node getNode(int nodeHandle); method in interface:DTM

Completed in 7542 milliseconds

12