/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Support/ |
H A D | DataFlow.h | 27 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...] |
H A D | CFG.h | 249 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits 252 static NodeType *getEntryNode(BasicBlock *BB) { return BB; } 253 static inline ChildIteratorType child_begin(NodeType *N) { 256 static inline ChildIteratorType child_end(NodeType *N) { 262 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits 265 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; } 267 static inline ChildIteratorType child_begin(NodeType *N) { 270 static inline ChildIteratorType child_end(NodeType *N) { 281 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits 283 static NodeType *getEntryNod 293 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template<class NodeType> 35 NodeType, ptrdiff_t> 37 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super; 50 PointerIntPair<NodeType*, 2, enum ItMode> Node; 62 NodeType* getNode() const{ return Node.getPointer(); } 87 typedef RNSuccIterator<NodeType> Self; 92 inline RNSuccIterator(NodeType* node) 107 inline RNSuccIterator(NodeType* node, bool) 165 template<class NodeType> 166 class RNSuccIterator<FlatIt<NodeType> > [all...] |
H A D | DominatorInternals.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, 35 typename GraphT::NodeType* V, unsigned N) { 56 SmallVector<std::pair<typename GraphT::NodeType*, 60 typename GraphT::NodeType* BB = Worklist.back().first; 63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = 93 typename GraphT::NodeType* Succ = *NextSucc; 95 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = 107 typename GraphT::NodeType* 108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, 109 typename GraphT::NodeType *VI [all...] |
H A D | Interval.h | 125 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) {
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/ADT/ |
H A D | GraphTraits.h | 30 // 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 D | PostOrderIterator.h | 58 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 D | SCCIterator.h | 38 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...] |
/macosx-10.9.5/WebCore-7537.78.1/platform/ |
H A D | TreeShared.h | 31 template<typename NodeType> class TreeShared; 32 template<typename NodeType> void adopted(TreeShared<NodeType>*); 35 template<typename NodeType> class TreeShared { 76 NodeType* thisNode = static_cast<NodeType*>(this); 104 friend void adopted<>(TreeShared<NodeType>*); 116 template<typename NodeType> inline void adopted(TreeShared<NodeType>* object)
|
/macosx-10.9.5/libxml2-26/libxml2/python/tests/ |
H A D | reader3.py | 33 if reader.Name() == "doc" or reader.NodeType() == 10: 38 if reader.Name() != "doc" or reader.NodeType() != 1: 45 if reader.Name() != "tst" or reader.NodeType() != 5: 52 if reader.Name() != "doc" or reader.NodeType() != 15: 71 if reader.Name() == "doc" or reader.NodeType() == 10: 76 if reader.Name() != "doc" or reader.NodeType() != 1: 83 if reader.Name() != "p" or reader.NodeType() != 1: 90 if reader.NodeType() != 3 or reader.Value() != "test": 97 if reader.Name() != "p" or reader.NodeType() != 15: 104 if reader.Name() != "doc" or reader.NodeType() ! [all...] |
H A D | readernext.py | 26 reader.NodeType() != 1 or reader.HasAttributes() != 0: 34 reader.NodeType() != 1 or reader.HasAttributes() != 0: 41 if reader.Name() != "c" or reader.NodeType() != 1 or \ 49 if reader.Name() != "b" or reader.NodeType() != 15: 57 reader.NodeType() != 1 or reader.HasAttributes() != 0: 65 reader.NodeType() != 15 or reader.HasAttributes() != 0:
|
H A D | reader4.py | 23 res=res + "%s (%s) [%s] %d\n" % (reader.NodeType(),reader.Name(), 25 if reader.NodeType() == 1: # Element 27 res = res + "-- %s (%s) [%s]\n" % (reader.NodeType(),
|
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/python/tests/ |
H A D | reader3.py | 28 if reader.Name() == "doc" or reader.NodeType() == 10: 33 if reader.Name() != "doc" or reader.NodeType() != 1: 40 if reader.Name() != "tst" or reader.NodeType() != 5: 47 if reader.Name() != "doc" or reader.NodeType() != 15: 66 if reader.Name() == "doc" or reader.NodeType() == 10: 71 if reader.Name() != "doc" or reader.NodeType() != 1: 78 if reader.Name() != "p" or reader.NodeType() != 1: 85 if reader.NodeType() != 3 or reader.Value() != "test": 92 if reader.Name() != "p" or reader.NodeType() != 15: 99 if reader.Name() != "doc" or reader.NodeType() ! [all...] |
H A D | readernext.py | 21 reader.NodeType() != 1 or reader.HasAttributes() != 0: 29 reader.NodeType() != 1 or reader.HasAttributes() != 0: 36 if reader.Name() != "c" or reader.NodeType() != 1 or \ 44 if reader.Name() != "b" or reader.NodeType() != 15: 52 reader.NodeType() != 1 or reader.HasAttributes() != 0: 60 reader.NodeType() != 15 or reader.HasAttributes() != 0:
|
H A D | reader4.py | 18 res=res + "%s (%s) [%s] %d\n" % (reader.NodeType(),reader.Name(), 20 if reader.NodeType() == 1: # Element 22 res = res + "-- %s (%s) [%s]\n" % (reader.NodeType(),
|
/macosx-10.9.5/WebCore-7537.78.1/dom/ |
H A D | CDATASection.h | 38 virtual NodeType nodeType() const; 40 virtual bool childTypeAllowed(NodeType) const;
|
H A D | Comment.h | 38 virtual NodeType nodeType() const; 40 virtual bool childTypeAllowed(NodeType) const;
|
H A D | Notation.cpp | 41 Node::NodeType Notation::nodeType() const 52 bool Notation::childTypeAllowed(NodeType) const
|
H A D | CDATASection.cpp | 44 Node::NodeType CDATASection::nodeType() const 54 bool CDATASection::childTypeAllowed(NodeType) const
|
H A D | Comment.cpp | 44 Node::NodeType Comment::nodeType() const 54 bool Comment::childTypeAllowed(NodeType) const
|
H A D | DocumentFragment.h | 47 virtual NodeType nodeType() const; 49 virtual bool childTypeAllowed(NodeType) const;
|
H A D | Notation.h | 40 virtual NodeType nodeType() const; 42 virtual bool childTypeAllowed(NodeType) const;
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/ |
H A D | DFGMinifiedNode.h | 41 inline bool belongsInMinifiedGraph(NodeType type) 65 NodeType op() const { return m_op; } 100 static bool hasChild(NodeType type) 113 static bool hasConstantNumber(NodeType type) 117 static bool hasWeakConstant(NodeType type) 124 NodeType m_op;
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 163 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) {
|
/macosx-10.9.5/ICU-511.35/icuSources/common/ |
H A D | rbbinode.h | 27 enum NodeType { enum in class:RBBINode 54 NodeType fType; 87 RBBINode(NodeType t); 94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|