/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | 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...] |
H A D | DocumentFragment.cpp | 47 Node::NodeType DocumentFragment::nodeType() const 52 bool DocumentFragment::childTypeAllowed(NodeType type) const
|
H A D | DocumentFragment.h | 48 virtual NodeType nodeType() const OVERRIDE FINAL; 50 virtual bool childTypeAllowed(NodeType) const OVERRIDE;
|
H A D | CDATASection.cpp | 44 Node::NodeType CDATASection::nodeType() const
|
H A D | CDATASection.h | 39 virtual NodeType nodeType() const OVERRIDE;
|
H A D | Comment.cpp | 44 Node::NodeType Comment::nodeType() const
|
H A D | Comment.h | 39 virtual NodeType nodeType() const OVERRIDE;
|
H A D | DocumentType.cpp | 49 Node::NodeType DocumentType::nodeType() const
|
/external/clang/unittests/AST/ |
H A D | MatchVerifier.h | 31 template <typename NodeType> 58 const NodeType &Node) {} 76 template <typename NodeType> template <typename MatcherType> 77 testing::AssertionResult MatchVerifier<NodeType>::match( 116 template <typename NodeType> 117 void MatchVerifier<NodeType>::run(const MatchFinder::MatchResult &Result) { 118 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); 146 template <typename NodeType> 147 class LocationVerifier : public MatchVerifier<NodeType> { [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 64 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>, 67 typename GT::NodeType, ptrdiff_t>, 70 typename GT::NodeType, ptrdiff_t> super; 72 typedef typename GT::NodeType NodeType; typedef in class:llvm::df_iterator 74 typedef PointerIntPair<NodeType*, 1> PointerIntTy; 81 inline df_iterator(NodeType *Node) { 89 inline df_iterator(NodeType *Node, SetType &S) 105 NodeType *Node = Top.first.getPointer(); 114 NodeType *Nex [all...] |
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 174 typedef clang::CallGraphNode NodeType; typedef in struct:llvm::GraphTraits 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; typedef in struct:llvm::GraphTraits 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 * [all...] |
/external/clang/include/clang/ASTMatchers/ |
H A D | 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, typenam [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 172 typedef ::clang::DomTreeNode NodeType; typedef in struct:llvm::GraphTraits 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/ |
H A D | MachineDominators.h | 182 typedef MachineDomTreeNode NodeType; typedef in struct:llvm::GraphTraits 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) {
|
H A D | MachineBasicBlock.h | 704 typedef MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits 707 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; } 708 static inline ChildIteratorType child_begin(NodeType *N) { 711 static inline ChildIteratorType child_end(NodeType *N) { 717 typedef const MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits 720 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; } 721 static inline ChildIteratorType child_begin(NodeType *N) { 724 static inline ChildIteratorType child_end(NodeType *N) { 736 typedef MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits 738 static NodeType *getEntryNod 750 typedef const MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits [all...] |
/external/chromium_org/third_party/libxml/chromium/ |
H A D | 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/llvm/include/llvm/Analysis/ |
H A D | CallGraph.h | 399 typedef CallGraphNode NodeType; typedef in struct:GraphTraits 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; typedef in struct:GraphTraits 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 * [all...] |
H A D | LazyCallGraph.h | 516 typedef LazyCallGraph::Node NodeType; typedef in struct:llvm::GraphTraits 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; typedef in struct:llvm::GraphTraits 527 static NodeType *getEntryNode(NodeType *N) { return N; } 528 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); } 529 static ChildIteratorType child_end(NodeType * [all...] |
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/ |
H A D | AudioNode.h | 69 enum NodeType { enum in class:blink::AudioNode 97 NodeType nodeType() const { return m_nodeType; } 99 void setNodeType(NodeType); 205 NodeType m_nodeType;
|
/external/llvm/include/llvm/Support/ |
H A D | GraphWriter.h | 63 typedef typename GTraits::NodeType NodeType; typedef in class:llvm::GraphWriter 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 *Nod [all...] |
/external/chromium_org/ui/views/examples/ |
H A D | tree_view_example.h | 78 typedef ui::TreeNodeWithValue<int> NodeType; typedef in class:views::examples::TreeViewExample 80 ui::TreeNodeModel<NodeType> model_;
|
/external/chromium_org/v8/src/ |
H A D | 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...] |
/external/llvm/include/llvm/IR/ |
H A D | 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/chromium_org/chrome/test/chromedriver/js/ |
H A D | call_function.js | 18 var NodeType = { 147 if (nodeType == NodeType.ELEMENT || nodeType == NodeType.DOCUMENT
|
/external/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfo.cpp | 53 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits 57 static inline const NodeType *getEntryNode(const BlockFrequencyInfo *G) { 60 static ChildIteratorType child_begin(const NodeType *N) { 63 static ChildIteratorType child_end(const NodeType *N) {
|