| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 69 template <typename NodeRef, unsigned SmallSize=8>
70 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> {
71 typedef SmallPtrSet<NodeRef, SmallSize> BaseSet;
73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N) ; }
77 void completed(NodeRef) { }
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
88 typedef std::iterator<std::forward_iterator_tag, typename GT::NodeRef> super;
90 typedef typename GT::NodeRef NodeRef;
[all...] |
| IntervalMap.h | 196 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
441 // PointerIntPair used by NodeRef.
469 //--- IntervalMapImpl::NodeRef ---//
481 // A NodeRef doesn't know whether it references a leaf node or a branch node.
485 // of 0 in a NodeRef. The valid range of sizes is 1-64.
489 class NodeRef {
498 /// NodeRef - Create a null ref.
499 NodeRef() = default;
504 /// NodeRef - Create a reference to the node p with n elements.
506 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| PostOrderIterator.h | 63 template <typename NodeRef>
64 bool insertEdge(Optional<NodeRef> From, NodeRef To) {
69 template <typename NodeRef> void finishPostorder(NodeRef BB) {}
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) {
89 template <class NodeRef> void finishPostorder(NodeRef BB) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraph.h | 412 typedef CallGraphNode *NodeRef;
416 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
423 static ChildIteratorType child_begin(NodeRef N) {
426 static ChildIteratorType child_end(NodeRef N) {
432 typedef const CallGraphNode *NodeRef;
436 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
443 static ChildIteratorType child_begin(NodeRef N) {
446 static ChildIteratorType child_end(NodeRef N) {
453 static NodeRef getEntryNode(CallGraph *CGN) {
476 static NodeRef getEntryNode(const CallGraph *CGN)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| CFG.h | 163 typedef BasicBlock *NodeRef;
166 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
167 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
168 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
172 typedef const BasicBlock *NodeRef;
175 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
177 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
178 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
187 typedef BasicBlock *NodeRef;
189 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph;
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 62 typedef typename GTraits::NodeRef NodeRef;
67 static_assert(std::is_pointer<NodeRef>::value,
68 "FIXME: Currently GraphWriter requires the NodeRef type to be "
74 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) {
152 bool isNodeHidden(NodeRef Node) {
156 void writeNode(NodeRef Node) {
229 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) {
230 if (NodeRef TargetNode = *EI) {
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| CallGraph.h | 402 typedef CallGraphNode *NodeRef;
406 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
413 static ChildIteratorType child_begin(NodeRef N) {
416 static ChildIteratorType child_end(NodeRef N) {
422 typedef const CallGraphNode *NodeRef;
426 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
433 static ChildIteratorType child_begin(NodeRef N) {
436 static ChildIteratorType child_end(NodeRef N) {
443 static NodeRef getEntryNode(CallGraph *CGN) {
466 static NodeRef getEntryNode(const CallGraph *CGN)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
| GraphWriter.h | 62 typedef typename GTraits::NodeRef NodeRef;
67 static_assert(std::is_pointer<NodeRef>::value,
68 "FIXME: Currently GraphWriter requires the NodeRef type to be "
74 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) {
151 bool isNodeHidden(NodeRef Node) {
155 void writeNode(NodeRef Node) {
228 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) {
229 if (NodeRef TargetNode = *EI) {
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| CallGraph.h | 402 typedef CallGraphNode *NodeRef;
406 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
413 static ChildIteratorType child_begin(NodeRef N) {
416 static ChildIteratorType child_end(NodeRef N) {
422 typedef const CallGraphNode *NodeRef;
426 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
433 static ChildIteratorType child_begin(NodeRef N) {
436 static ChildIteratorType child_end(NodeRef N) {
443 static NodeRef getEntryNode(CallGraph *CGN) {
466 static NodeRef getEntryNode(const CallGraph *CGN)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/ |
| GraphWriter.h | 62 typedef typename GTraits::NodeRef NodeRef;
67 static_assert(std::is_pointer<NodeRef>::value,
68 "FIXME: Currently GraphWriter requires the NodeRef type to be "
74 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) {
151 bool isNodeHidden(NodeRef Node) {
155 void writeNode(NodeRef Node) {
228 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) {
229 if (NodeRef TargetNode = *EI) {
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 197 // Leaves store ((KeyT, KeyT), ValT) pairs, branches use (NodeRef, KeyT).
442 // PointerIntPair used by NodeRef.
470 //--- IntervalMapImpl::NodeRef ---//
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
486 // of 0 in a NodeRef. The valid range of sizes is 1-64.
490 class NodeRef {
499 /// NodeRef - Create a null ref.
500 NodeRef() = default;
505 /// NodeRef - Create a reference to the node p with n elements.
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 453 typedef clang::ento::ExplodedNode *NodeRef;
455 typedef llvm::df_iterator<NodeRef> nodes_iterator;
457 static NodeRef getEntryNode(NodeRef N) { return N; }
459 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
461 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
463 static nodes_iterator nodes_begin(NodeRef N) { return df_begin(N); }
465 static nodes_iterator nodes_end(NodeRef N) { return df_end(N); }
469 typedef const clang::ento::ExplodedNode *NodeRef;
471 typedef llvm::df_iterator<NodeRef> nodes_iterator
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | [all...] |
| LoopInfo.h | 810 typedef const Loop *NodeRef;
813 static NodeRef getEntryNode(const Loop *L) { return L; }
814 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
815 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
819 typedef Loop *NodeRef;
822 static NodeRef getEntryNode(Loop *L) { return L; }
823 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
824 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 453 typedef clang::ento::ExplodedNode *NodeRef;
455 typedef llvm::df_iterator<NodeRef> nodes_iterator;
457 static NodeRef getEntryNode(NodeRef N) { return N; }
459 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
461 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
463 static nodes_iterator nodes_begin(NodeRef N) { return df_begin(N); }
465 static nodes_iterator nodes_end(NodeRef N) { return df_end(N); }
469 typedef const clang::ento::ExplodedNode *NodeRef;
471 typedef llvm::df_iterator<NodeRef> nodes_iterator
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | [all...] |
| LoopInfo.h | 801 typedef const Loop *NodeRef;
804 static NodeRef getEntryNode(const Loop *L) { return L; }
805 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
806 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
810 typedef Loop *NodeRef;
813 static NodeRef getEntryNode(Loop *L) { return L; }
814 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
815 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
|
