HomeSort by relevance Sort by last modified time
    Searched refs:NodeType (Results 26 - 50 of 126) sorted by null

12 3 4 5 6

  /external/clang/include/clang/ASTMatchers/
ASTMatchersMacros.h 229 /// The variables are the same as for AST_MATCHER, but NodeType will be deduced
233 template <typename NodeType> \
235 : public ::clang::ast_matchers::internal::MatcherInterface<NodeType> { \
237 bool matches(const NodeType &Node, \
249 template <typename NodeType> \
250 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \
251 const NodeType &Node, \
260 /// AST_MATCHER_P, with the addition of NodeType, which specifies the node type
261 /// of the matcher Matcher<NodeType> returned by the function matcher().
272 template <typename NodeType, typename ParamT>
    [all...]
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode NodeType;
171 typedef NodeType::iterator ChildIteratorType;
173 static NodeType *getEntryNode(NodeType *N) {
176 static inline ChildIteratorType child_begin(NodeType *N) {
179 static inline ChildIteratorType child_end(NodeType *N) {
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
  /external/llvm/include/llvm/CodeGen/
MachineDominators.h 251 typedef Node NodeType;
254 static NodeType *getEntryNode(NodeType *N) { return N; }
255 static inline ChildIteratorType child_begin(NodeType *N) {
258 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
276 static NodeType *getEntryNode(MachineDominatorTree *DT) {
MachineBasicBlock.h     [all...]
  /external/llvm/include/llvm/Analysis/
CallGraph.h 404 typedef CallGraphNode NodeType;
410 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
412 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
414 static inline ChildIteratorType child_begin(NodeType *N) {
417 static inline ChildIteratorType child_end(NodeType *N) {
425 typedef const CallGraphNode NodeType;
431 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
433 typedef mapped_iterator<NodeType::const_iterator, CGNDerefFun>
436 static inline ChildIteratorType child_begin(NodeType *N) {
439 static inline ChildIteratorType child_end(NodeType *N)
    [all...]
LazyCallGraph.h 521 typedef LazyCallGraph::Node NodeType;
524 static NodeType *getEntryNode(NodeType *N) { return N; }
525 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
526 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
529 typedef LazyCallGraph::Node NodeType;
532 static NodeType *getEntryNode(NodeType *N) { return N; }
533 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
534 static ChildIteratorType child_end(NodeType *N) { return N->end();
    [all...]
LoopInfo.h 776 typedef const Loop NodeType;
779 static NodeType *getEntryNode(const Loop *L) { return L; }
780 static inline ChildIteratorType child_begin(NodeType *N) {
783 static inline ChildIteratorType child_end(NodeType *N) {
789 typedef Loop NodeType;
792 static NodeType *getEntryNode(Loop *L) { return L; }
793 static inline ChildIteratorType child_begin(NodeType *N) {
796 static inline ChildIteratorType child_end(NodeType *N) {
PostDominators.h 99 static NodeType *getEntryNode(PostDominatorTree *DT) {
  /external/libxml2/python/tests/
reader.py 26 reader.NodeType() != 1 or reader.HasAttributes() != 0:
34 reader.NodeType() != 1 or reader.HasAttributes() != 1:
42 reader.NodeType() != 1 or reader.HasAttributes() != 0:
50 reader.NodeType() != 3 or reader.HasAttributes() != 0 or \
59 reader.NodeType() != 15 or reader.HasAttributes() != 0:
67 reader.NodeType() != 15 or reader.HasAttributes() != 0:
261 reader.Value() != "http://example.com/foo" or reader.NodeType() != 2:
278 reader.Value() != "http://example.com/foo" or reader.NodeType() != 2:
309 res=res + "%s (%s) [%s] %d %d\n" % (reader.NodeType(),reader.Name(),
312 if reader.NodeType() == 1: # Elemen
    [all...]
reader2.py 98 res = res + "%s,%s\n" % (reader.NodeType(),reader.Name())
148 res = res + "%s %s\n" % (reader.NodeType(),reader.Name())
202 res = res + "%s %s %d\n" % (reader.NodeType(),reader.Name(),reader.Depth())
244 res = res + "%s %s %d\n" % (reader.NodeType(),reader.Name(),reader.Depth())
reader7.py 15 result = result + "%d %d %s %d\n" % (reader.Depth(), reader.NodeType(),
walker.py 15 result = result + "%d %d %s %d\n" % (reader.Depth(), reader.NodeType(),
  /external/llvm/include/llvm/Support/
GraphWriter.h 62 typedef typename GTraits::NodeType NodeType;
69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
147 bool isNodeHidden(NodeType &Node) {
151 bool isNodeHidden(NodeType *const *Node) {
155 bool isNodeHidden(NodeType *Node) {
159 void writeNode(NodeType& Node) {
163 void writeNode(NodeType *const *Node) {
167 void writeNode(NodeType *Node) {
240 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI)
    [all...]
GenericDomTree.h 179 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType> &DT,
253 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT,
254 typename GraphT::NodeType *NewBB) {
258 typename GraphT::NodeType *NewBBSucc = *GraphT::child_begin(NewBB);
260 std::vector<typename GraphT::NodeType *> PredBlocks;
275 typename InvTraits::NodeType *ND = *PI;
632 friend typename GraphT::NodeType *
633 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT,
634 typename GraphT::NodeType *V, unsigned LastLinked);
637 friend unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType> &DT
    [all...]
  /external/v8/test/cctest/
expression-type-collector.cc 19 AstNode::NodeType type;
50 AstNode::NodeType type = expression->node_type();
test-ast-expression-visitor.cc 25 typedef std::map<AstNode::NodeType, int> Counters;
  /external/llvm/include/llvm/IR/
Type.h 440 typedef Type NodeType;
443 static inline NodeType *getEntryNode(Type *T) { return T; }
444 static inline ChildIteratorType child_begin(NodeType *N) {
447 static inline ChildIteratorType child_end(NodeType *N) {
453 typedef const Type NodeType;
456 static inline NodeType *getEntryNode(NodeType *T) { return T; }
457 static inline ChildIteratorType child_begin(NodeType *N) {
460 static inline ChildIteratorType child_end(NodeType *N) {
  /external/llvm/lib/Analysis/
BlockFrequencyInfo.cpp 53 typedef const BasicBlock NodeType;
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) {
  /external/llvm/lib/CodeGen/
MachineBlockFrequencyInfo.cpp 54 typedef const MachineBasicBlock NodeType;
59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) {
63 static ChildIteratorType child_begin(const NodeType *N) {
67 static ChildIteratorType child_end(const NodeType *N) {
  /frameworks/compile/mclinker/unittests/
FactoriesTest.cpp 40 NodeAlloc::NodeType* node = m_pNodeAlloc->produce();
52 NodeAlloc::NodeType* node = 0;
71 NodeAlloc::NodeType* node = 0;
93 NodeAlloc::NodeType* node = 0;
117 NodeAlloc::NodeType* node = 0;
153 NodeAlloc::NodeType* node = 0;
  /external/libxml2/
regressions.py 264 if reader.NodeType() == 1:
266 elif reader.NodeType() == 15:
273 elif reader.NodeType() == 15: # end of element
297 if reader.NodeType() == 1:
301 elif reader.NodeType() == 15:
308 elif reader.NodeType() == 15: # end of element
320 reader.Depth(), reader.NodeType(), reader.Name())
  /external/clang/include/clang/Analysis/
CFG.h     [all...]
  /external/icu/icu4c/source/common/
rbbiscan.h 92 RBBINode *pushNewNode(RBBINode::NodeType t);
  /external/llvm/unittests/Analysis/
CallGraphTest.cpp 20 typedef typename GraphTraits<Ty *>::NodeType NodeTy;
  /external/llvm/lib/Target/BPF/
BPFISelLowering.h 25 enum NodeType : unsigned {

Completed in 296 milliseconds

12 3 4 5 6