| /tools/motodev/src/plugins/android.codeutils/src/com/motorola/studio/android/model/resources/types/ |
| ResourcesNode.java | 36 NodeType nodeType = node.getNodeType();
38 (nodeType == NodeType.String) || (nodeType == NodeType.Color)
39 || (nodeType == NodeType.Dimen) || (nodeType == NodeType.Drawable)
[all...] |
| ColorNode.java | 39 public NodeType getNodeType()
41 return NodeType.Color;
|
| DimenNode.java | 39 public NodeType getNodeType()
41 return NodeType.Dimen;
|
| DrawableNode.java | 39 public NodeType getNodeType()
41 return NodeType.Drawable;
|
| /tools/motodev/src/plugins/common/src/com/motorola/studio/android/model/manifest/dom/ |
| ReceiverNode.java | 37 public NodeType getNodeType()
39 return NodeType.Receiver;
|
| PermissionTreeNode.java | 38 * @see com.motorola.studio.android.model.manifest.dom.AndroidManifestNode#canContains(com.motorola.studio.android.model.manifest.dom.AndroidManifestNode.NodeType)
41 protected boolean canContains(NodeType nodeType)
60 public NodeType getNodeType()
62 return NodeType.PermissionTree;
|
| ActionNode.java | 41 public NodeType getNodeType()
43 return NodeType.Action;
|
| CategoryNode.java | 41 public NodeType getNodeType()
43 return NodeType.Category;
|
| ServiceNode.java | 34 * @see com.motorola.studio.android.model.manifest.dom.AndroidManifestNode#canContains(com.motorola.studio.android.model.manifest.dom.AndroidManifestNode.NodeType)
37 protected boolean canContains(NodeType nodeType)
39 return (nodeType == NodeType.IntentFilter) || (nodeType == NodeType.MetaData)
40 || (nodeType == NodeType.Comment);
47 public NodeType getNodeType(
[all...] |
| UsesFeatureNode.java | 42 public NodeType getNodeType()
44 return NodeType.UsesFeature;
|
| UsesLibraryNode.java | 41 public NodeType getNodeType()
43 return NodeType.UsesLibrary;
|
| /external/llvm/include/llvm/Analysis/ |
| 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...] |
| 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 *VIn, unsigned LastLinked)
[all...] |
| /external/llvm/include/llvm/Support/ |
| DataFlow.h | 27 typedef const Value NodeType;
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;
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;
64 static NodeType *getEntryNode(Inverse<const User*> G)
[all...] |
| CFG.h | 249 typedef BasicBlock NodeType;
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;
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;
283 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| 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;
88 typedef typename GraphTraits<T>::NodeType NodeType;
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
95 static ChildIteratorType child_begin(NodeType* N) {
99 static ChildIteratorType child_end(NodeType* N)
[all...] |
| 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 *BB) {
[all...] |
| SCCIterator.h | 38 std::vector<typename GT::NodeType>, ptrdiff_t> {
39 typedef typename GT::NodeType NodeType;
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 *childN = *VisitStack.back().second++
[all...] |
| /external/clang/include/clang/AST/ |
| StmtGraphTraits.h | 28 typedef clang::Stmt NodeType;
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;
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/webkit/Source/WebCore/dom/ |
| CDATASection.h | 38 virtual NodeType nodeType() const;
40 virtual bool childTypeAllowed(NodeType) const;
|
| Comment.h | 38 virtual NodeType nodeType() const;
40 virtual bool childTypeAllowed(NodeType) const;
|
| DocumentFragment.h | 44 virtual NodeType nodeType() const;
46 virtual bool childTypeAllowed(NodeType) const;
|
| Notation.cpp | 41 Node::NodeType Notation::nodeType() const
52 bool Notation::childTypeAllowed(NodeType) const
|
| Notation.h | 40 virtual NodeType nodeType() const;
42 virtual bool childTypeAllowed(NodeType) const;
|
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersMacros.h | 151 /// AST_MATCHER_P, with the addition of NodeType, which specifies the node type
152 /// of the matcher Matcher<NodeType> returned by the function matcher().
157 template <typename NodeType, typename ParamT> \
159 : public MatcherInterface<NodeType> { \
164 const NodeType &Node, ASTMatchFinder *Finder, \
178 template <typename NodeType, typename ParamT> \
179 bool internal::matcher_##DefineMatcher##Matcher<NodeType, ParamT>::matches( \
180 const NodeType &Node, ASTMatchFinder *Finder, \
189 /// addition of NodeType, which specifies the node type of the matcher
190 /// Matcher<NodeType> returned by the function DefineMatcher()
[all...] |
