OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:ChildItTy
(Results
1 - 14
of
14
) sorted by null
/external/llvm/include/llvm/ADT/
SCCIterator.h
45
typedef typename GT::ChildIteratorType
ChildItTy
;
52
ChildItTy
NextChild; ///< The next child, modified inplace during DFS.
55
StackElement(NodeType *Node, const
ChildItTy
&Child, unsigned Min)
216
for (
ChildItTy
CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE;
DepthFirstIterator.h
72
typedef typename GT::ChildIteratorType
ChildItTy
;
78
std::vector<std::pair<PointerIntTy,
ChildItTy
>> VisitStack;
104
std::pair<PointerIntTy,
ChildItTy
> &Top = VisitStack.back();
106
ChildItTy
&It = Top.second;
PostOrderIterator.h
99
typedef typename GT::ChildIteratorType
ChildItTy
;
103
std::vector<std::pair<NodeType *,
ChildItTy
> > VisitStack;
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DepthFirstIterator.h
72
typedef typename GT::ChildIteratorType
ChildItTy
;
78
std::vector<std::pair<PointerIntTy,
ChildItTy
> > VisitStack;
103
std::pair<PointerIntTy,
ChildItTy
> &Top = VisitStack.back();
105
ChildItTy
&It = Top.second;
PostOrderIterator.h
58
typedef typename GT::ChildIteratorType
ChildItTy
;
62
std::vector<std::pair<NodeType *,
ChildItTy
> > VisitStack;
SCCIterator.h
40
typedef typename GT::ChildIteratorType
ChildItTy
;
61
std::vector<std::pair<NodeType *,
ChildItTy
> > VisitStack;
181
for (
ChildItTy
CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI)
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
BreadthFirstIterator.h
55
typedef typename GT::ChildIteratorType
ChildItTy
;
58
typedef std::pair<NodeRef, Optional<
ChildItTy
>> QueueElement;
83
Optional<
ChildItTy
> &ChildIt = H.second;
SCCIterator.h
47
typedef typename GT::ChildIteratorType
ChildItTy
;
54
ChildItTy
NextChild; ///< The next child, modified inplace during DFS.
57
StackElement(NodeRef Node, const
ChildItTy
&Child, unsigned Min)
218
for (
ChildItTy
CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE;
DepthFirstIterator.h
91
typedef typename GT::ChildIteratorType
ChildItTy
;
96
typedef std::pair<NodeRef, Optional<
ChildItTy
>> StackElement;
120
Optional<
ChildItTy
> &Opt = VisitStack.back().second;
PostOrderIterator.h
101
typedef typename GT::ChildIteratorType
ChildItTy
;
105
std::vector<std::pair<NodeRef,
ChildItTy
>> VisitStack;
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
BreadthFirstIterator.h
55
typedef typename GT::ChildIteratorType
ChildItTy
;
58
typedef std::pair<NodeRef, Optional<
ChildItTy
>> QueueElement;
83
Optional<
ChildItTy
> &ChildIt = H.second;
SCCIterator.h
47
typedef typename GT::ChildIteratorType
ChildItTy
;
54
ChildItTy
NextChild; ///< The next child, modified inplace during DFS.
57
StackElement(NodeRef Node, const
ChildItTy
&Child, unsigned Min)
218
for (
ChildItTy
CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE;
DepthFirstIterator.h
91
typedef typename GT::ChildIteratorType
ChildItTy
;
96
typedef std::pair<NodeRef, Optional<
ChildItTy
>> StackElement;
120
Optional<
ChildItTy
> &Opt = VisitStack.back().second;
PostOrderIterator.h
101
typedef typename GT::ChildIteratorType
ChildItTy
;
105
std::vector<std::pair<NodeRef,
ChildItTy
>> VisitStack;
Completed in 165 milliseconds