/external/clang/include/clang/ASTMatchers/ |
ASTMatchersMacros.h | 199 /// The variables are the same as for AST_MATCHER, but NodeType will be deduced 203 template <typename NodeType> \ 204 class matcher_##DefineMatcher##Matcher : public MatcherInterface<NodeType> { \ 206 bool matches(const NodeType &Node, ASTMatchFinder *Finder, \ 216 template <typename NodeType> \ 217 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \ 218 const NodeType &Node, ASTMatchFinder *Finder, \ 226 /// AST_MATCHER_P, with the addition of NodeType, which specifies the node type 227 /// of the matcher Matcher<NodeType> returned by the function matcher(). 238 template <typename NodeType, typename ParamT> [all...] |
/external/llvm/include/llvm/IR/ |
CFG.h | 275 typedef BasicBlock NodeType; 278 static NodeType *getEntryNode(BasicBlock *BB) { return BB; } 279 static inline ChildIteratorType child_begin(NodeType *N) { 282 static inline ChildIteratorType child_end(NodeType *N) { 288 typedef const BasicBlock NodeType; 291 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; } 293 static inline ChildIteratorType child_begin(NodeType *N) { 296 static inline ChildIteratorType child_end(NodeType *N) { 307 typedef BasicBlock NodeType; 309 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; [all...] |
Dominators.h | 39 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA 43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT 118 typedef DomTreeNode NodeType; 119 typedef NodeType::iterator ChildIteratorType; 121 static NodeType *getEntryNode(NodeType *N) { 124 static inline ChildIteratorType child_begin(NodeType *N) { 127 static inline ChildIteratorType child_end(NodeType *N) { 144 static NodeType *getEntryNode(DominatorTree *DT) {
|
Type.h | 445 typedef Type NodeType; 448 static inline NodeType *getEntryNode(Type *T) { return T; } 449 static inline ChildIteratorType child_begin(NodeType *N) { 452 static inline ChildIteratorType child_end(NodeType *N) { 458 typedef const Type NodeType; 461 static inline NodeType *getEntryNode(NodeType *T) { return T; } 462 static inline ChildIteratorType child_begin(NodeType *N) { 465 static inline ChildIteratorType child_end(NodeType *N) {
|
/external/llvm/unittests/ADT/ |
SCCIteratorTest.cpp | 97 /// NodeType - Node index and set of children of the node. 98 typedef std::pair<unsigned, NodeSubset> NodeType; 102 NodeType Nodes[N]; 128 NodeType *AccessNode(unsigned Idx) const { 132 return const_cast<NodeType *>(&Nodes[Idx]); 165 NodeType *FirstNode; 172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} 209 NodeType *operator*() { 222 static ChildIterator child_begin(NodeType *Parent) { 227 static ChildIterator child_end(NodeType *Parent) [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
ExplodedGraph.h | 445 typedef clang::ento::ExplodedNode NodeType; 446 typedef NodeType::succ_iterator ChildIteratorType; 447 typedef llvm::df_iterator<NodeType*> nodes_iterator; 449 static inline NodeType* getEntryNode(NodeType* N) { 453 static inline ChildIteratorType child_begin(NodeType* N) { 457 static inline ChildIteratorType child_end(NodeType* N) { 461 static inline nodes_iterator nodes_begin(NodeType* N) { 465 static inline nodes_iterator nodes_end(NodeType* N) { 471 typedef const clang::ento::ExplodedNode NodeType; [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
ElementTraversal.h | 98 template <class NodeType> 99 static ElementType* firstChildTemplate(NodeType&); 100 template <class NodeType> 101 static ElementType* lastChildTemplate(NodeType&); 102 template <class NodeType> 103 static ElementType* firstAncestorOrSelfTemplate(NodeType&); 104 template <class NodeType> 105 static ElementType* firstWithinTemplate(NodeType&); 106 template <class NodeType> 107 static ElementType* lastWithinTemplate(NodeType&) [all...] |
DocumentFragment.cpp | 47 Node::NodeType DocumentFragment::nodeType() const 52 bool DocumentFragment::childTypeAllowed(NodeType type) const
|
CDATASection.cpp | 44 Node::NodeType CDATASection::nodeType() const
|
Comment.cpp | 44 Node::NodeType Comment::nodeType() const
|
Attr.h | 78 virtual NodeType nodeType() const OVERRIDE { return ATTRIBUTE_NODE; } 85 virtual bool childTypeAllowed(NodeType) const OVERRIDE;
|
DocumentType.cpp | 49 Node::NodeType DocumentType::nodeType() const
|
DocumentType.h | 48 virtual NodeType nodeType() const OVERRIDE;
|
MutationRecord.h | 44 template <typename NodeType> class StaticNodeTypeList;
|
/external/clang/include/clang/Analysis/ |
CallGraph.h | 174 typedef clang::CallGraphNode NodeType; 178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; } 179 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType; 180 static inline ChildIteratorType child_begin(NodeType *N) { 183 static inline ChildIteratorType child_end (NodeType *N) { 192 typedef const clang::CallGraphNode NodeType; 193 typedef NodeType::const_iterator ChildIteratorType; 194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; } 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} 196 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); [all...] |
/external/llvm/include/llvm/Analysis/ |
CallGraph.h | 399 typedef CallGraphNode NodeType; 405 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; } 407 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType; 409 static inline ChildIteratorType child_begin(NodeType *N) { 412 static inline ChildIteratorType child_end(NodeType *N) { 420 typedef const CallGraphNode NodeType; 421 typedef NodeType::const_iterator ChildIteratorType; 423 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; } 424 static inline ChildIteratorType child_begin(NodeType *N) { 427 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); [all...] |
LazyCallGraph.h | 516 typedef LazyCallGraph::Node NodeType; 519 static NodeType *getEntryNode(NodeType *N) { return N; } 520 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); } 521 static ChildIteratorType child_end(NodeType *N) { return N->end(); } 524 typedef LazyCallGraph::Node NodeType; 527 static NodeType *getEntryNode(NodeType *N) { return N; } 528 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); } 529 static ChildIteratorType child_end(NodeType *N) { return N->end(); [all...] |
/frameworks/compile/mclinker/include/mcld/ADT/ |
TreeAllocator.h | 35 typedef Node<DataType> NodeType; 41 NodeType* produce() { 42 NodeType* result = Alloc::allocate();
|
/external/clang/include/clang/Analysis/Analyses/ |
Dominators.h | 172 typedef ::clang::DomTreeNode NodeType; 173 typedef NodeType::iterator ChildIteratorType; 175 static NodeType *getEntryNode(NodeType *N) { 178 static inline ChildIteratorType child_begin(NodeType *N) { 181 static inline ChildIteratorType child_end(NodeType *N) { 198 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
|
/external/llvm/include/llvm/CodeGen/ |
MachineDominators.h | 182 typedef MachineDomTreeNode NodeType; 183 typedef NodeType::iterator ChildIteratorType; 185 static NodeType *getEntryNode(NodeType *N) { 188 static inline ChildIteratorType child_begin(NodeType* N) { 191 static inline ChildIteratorType child_end(NodeType* N) { 198 static NodeType *getEntryNode(MachineDominatorTree *DT) {
|
/external/chromium_org/third_party/libxml/chromium/ |
libxml_utils.cc | 52 return NodeType() == XML_READER_TYPE_END_ELEMENT; 74 while (NodeType() != XML_READER_TYPE_END_ELEMENT || Depth() != start_depth) { 89 switch (NodeType()) {
|
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/ |
AudioNode.h | 69 enum NodeType { 97 NodeType nodeType() const { return m_nodeType; } 99 void setNodeType(NodeType); 205 NodeType m_nodeType;
|
/external/llvm/include/llvm/Support/ |
GraphWriter.h | 63 typedef typename GTraits::NodeType NodeType; 70 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { 148 bool isNodeHidden(NodeType &Node) { 152 bool isNodeHidden(NodeType *const *Node) { 156 bool isNodeHidden(NodeType *Node) { 160 void writeNode(NodeType& Node) { 164 void writeNode(NodeType *const *Node) { 168 void writeNode(NodeType *Node) { 239 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) [all...] |
/external/chromium_org/ui/views/examples/ |
tree_view_example.h | 78 typedef ui::TreeNodeWithValue<int> NodeType; 80 ui::TreeNodeModel<NodeType> model_;
|
/external/chromium_org/v8/src/ |
ast.cc | 1004 #define REGULAR_NODE(NodeType) \ 1005 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ 1008 #define REGULAR_NODE_WITH_FEEDBACK_SLOTS(NodeType) \ 1009 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ 1013 #define DONT_OPTIMIZE_NODE(NodeType) \ 1014 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ 1016 set_dont_crankshaft_reason(k##NodeType); \ [all...] |