Searched defs:NodeType (Results 1 - 25 of 58) sorted by relevance

123

/external/smack/src/org/jivesoftware/smackx/pubsub/
H A DNodeType.java21 public enum NodeType enum
/external/llvm/include/llvm/Support/
H A DDataFlow.h27 typedef const Value NodeType; typedef in struct:llvm::GraphTraits
30 static NodeType *getEntryNode(const Value *G) {
34 static inline ChildIteratorType child_begin(NodeType *N) {
38 static inline ChildIteratorType child_end(NodeType *N) {
44 typedef Value NodeType; typedef in struct:llvm::GraphTraits
47 static NodeType *getEntryNode(Value *G) {
51 static inline ChildIteratorType child_begin(NodeType *N) {
55 static inline ChildIteratorType child_end(NodeType *N) {
61 typedef const Value NodeType; typedef in struct:llvm::GraphTraits
64 static NodeType *getEntryNod
82 typedef Value NodeType; typedef in struct:llvm::GraphTraits
[all...]
/external/chromium_org/chrome/test/chromedriver/js/
H A Dcall_function.js18 var NodeType = {
147 if (nodeType == NodeType.ELEMENT || nodeType == NodeType.DOCUMENT
/external/chromium_org/ui/views/examples/
H A Dtree_view_example.h78 typedef ui::TreeNodeWithValue<int> NodeType; typedef in class:views::examples::TreeViewExample
80 ui::TreeNodeModel<NodeType> model_;
/external/clang/include/clang/AST/
H A DStmtGraphTraits.h28 typedef clang::Stmt NodeType; typedef in struct:llvm::GraphTraits
32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }
34 static inline ChildIteratorType child_begin(NodeType* N) {
39 static inline ChildIteratorType child_end(NodeType* N) {
55 typedef const clang::Stmt NodeType; typedef in struct:llvm::GraphTraits
59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }
61 static inline ChildIteratorType child_begin(NodeType* N) {
66 static inline ChildIteratorType child_end(NodeType* N) {
/external/llvm/include/llvm/ADT/
H A DGraphTraits.h30 // typedef NodeType - Type of Node in the graph
33 // static NodeType *getEntryNode(const GraphType &)
36 // static ChildIteratorType child_begin(NodeType *)
37 // static ChildIteratorType child_end (NodeType *)
60 typedef typename GraphType::UnknownGraphTypeError NodeType; typedef in struct:llvm::GraphTraits
88 typedef typename GraphTraits<T>::NodeType NodeType; typedef in struct:llvm::GraphTraits
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
95 static ChildIteratorType child_begin(NodeType* N) {
99 static ChildIteratorType child_end(NodeType*
[all...]
H A DDepthFirstIterator.h63 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
66 typename GT::NodeType, ptrdiff_t>,
69 typename GT::NodeType, ptrdiff_t> super;
71 typedef typename GT::NodeType NodeType; typedef in class:llvm::df_iterator
73 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
80 inline df_iterator(NodeType *Node) {
88 inline df_iterator(NodeType *Node, SetType &S)
104 NodeType *Node = Top.first.getPointer();
113 NodeType *Nex
[all...]
H A DPostOrderIterator.h58 template<typename NodeType>
59 bool insertEdge(NodeType *From, NodeType *To) {
64 template<typename NodeType>
65 void finishPostorder(NodeType *BB) {}
79 template<class NodeType>
80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); }
83 template<class NodeType>
84 void finishPostorder(NodeType *B
96 typedef typename GT::NodeType NodeType; typedef in class:llvm::po_iterator
260 typedef typename GT::NodeType NodeType; typedef in class:llvm::ReversePostOrderTraversal
[all...]
H A DSCCIterator.h38 std::vector<typename GT::NodeType>, ptrdiff_t> {
39 typedef typename GT::NodeType NodeType; typedef in class:llvm::scc_iterator
41 typedef std::vector<NodeType*> SccTy;
43 std::vector<typename GT::NodeType>, ptrdiff_t> super;
51 DenseMap<NodeType *, unsigned> nodeVisitNumbers;
54 std::vector<NodeType *> SCCNodeStack;
61 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
69 void DFSVisitOne(NodeType *N) {
84 NodeType *child
[all...]
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp97 /// 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 *Paren
234 typedef typename Graph<N>::NodeType NodeType; typedef in struct:llvm::GraphTraits
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DACBTree.h12 } NodeType; typedef in typeref:enum:__anon299
/external/llvm/lib/Target/XCore/
H A DXCoreISelLowering.h29 enum NodeType { enum in namespace:llvm::XCoreISD
/external/chromium/chrome/common/
H A Dlibxml_utils.h102 int NodeType() { return xmlTextReaderNodeType(reader_); } function in class:XmlReader
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DTreeNode.h50 typedef T NodeType; typedef in class:WTF::TreeNode
61 NodeType* next() const { return m_next; }
62 NodeType* previous() const { return m_previous; }
63 NodeType* parent() const { return m_parent; }
64 NodeType* firstChild() const { return m_firstChild; }
65 NodeType* lastChild() const { return m_lastChild; }
66 NodeType* here() const { return static_cast<NodeType*>(const_cast<TreeNode*>(this)); }
71 void insertBefore(NodeType* newChild, NodeType* refChil
[all...]
/external/chromium_org/third_party/WebKit/public/web/
H A DWebNode.h78 enum NodeType { enum in class:blink::WebNode
95 BLINK_EXPORT NodeType nodeType() const;
/external/chromium_org/third_party/libxml/chromium/
H A Dlibxml_utils.h96 int NodeType() { return xmlTextReaderNodeType(reader_); } function in class:XmlReader
/external/llvm/include/llvm/Analysis/
H A DInterval.h125 typedef Interval NodeType; typedef in struct:llvm::GraphTraits
128 static NodeType *getEntryNode(Interval *I) { return I; }
131 static inline ChildIteratorType child_begin(NodeType *N) {
134 static inline ChildIteratorType child_end(NodeType *N) {
140 typedef Interval NodeType; typedef in struct:llvm::GraphTraits
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
143 static inline ChildIteratorType child_begin(NodeType *N) {
146 static inline ChildIteratorType child_end(NodeType *N) {
/external/llvm/include/llvm/CodeGen/
H A DMachineDominators.h182 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 DMachineLoopInfo.h163 typedef const MachineLoop NodeType; typedef in struct:llvm::GraphTraits
166 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
167 static inline ChildIteratorType child_begin(NodeType *N) {
170 static inline ChildIteratorType child_end(NodeType *N) {
176 typedef MachineLoop NodeType; typedef in struct:llvm::GraphTraits
179 static NodeType *getEntryNode(MachineLoop *L) { return L; }
180 static inline ChildIteratorType child_begin(NodeType *N) {
183 static inline ChildIteratorType child_end(NodeType *N) {
/external/llvm/lib/Target/AArch64/
H A DAArch64ISelLowering.h26 enum NodeType { enum in namespace:llvm::AArch64ISD
27 // Start the numbering from where ISD NodeType finishes.
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/
H A DAudioNode.h63 enum NodeType { enum in class:WebCore::AudioNode
91 NodeType nodeType() const { return m_nodeType; }
93 void setNodeType(NodeType);
202 NodeType m_nodeType;
/external/chromium_org/third_party/icu/source/common/
H A Drbbinode.h27 enum NodeType { enum in class:RBBINode
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h171 typedef ::clang::DomTreeNode NodeType; typedef in struct:llvm::GraphTraits
172 typedef NodeType::iterator ChildIteratorType;
174 static NodeType *getEntryNode(NodeType *N) {
177 static inline ChildIteratorType child_begin(NodeType *N) {
180 static inline ChildIteratorType child_end(NodeType *N) {
197 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
/external/clang/include/clang/Analysis/
H A DCallGraph.h174 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/icu4c/common/
H A Drbbinode.h27 enum NodeType { enum in class:RBBINode
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);

Completed in 1534 milliseconds

123