OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:GraphT
(Results
1 - 9
of
9
) sorted by null
/external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
32
template<class
GraphT
>
33
unsigned DFSPass(DominatorTreeBase<typename
GraphT
::NodeType>& DT,
34
typename
GraphT
::NodeType* V, unsigned N) {
55
SmallVector<std::pair<typename
GraphT
::NodeType*,
56
typename
GraphT
::ChildIteratorType>, 32> Worklist;
57
Worklist.push_back(std::make_pair(V,
GraphT
::child_begin(V)));
59
typename
GraphT
::NodeType* BB = Worklist.back().first;
60
typename
GraphT
::ChildIteratorType NextSucc = Worklist.back().second;
62
typename DominatorTreeBase<typename
GraphT
::NodeType>::InfoRec &BBInfo =
66
if (NextSucc ==
GraphT
::child_begin(BB))
[
all
...]
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DominatorInternals.h
33
template<class
GraphT
>
34
unsigned DFSPass(DominatorTreeBase<typename
GraphT
::NodeType>& DT,
35
typename
GraphT
::NodeType* V, unsigned N) {
56
SmallVector<std::pair<typename
GraphT
::NodeType*,
57
typename
GraphT
::ChildIteratorType>, 32> Worklist;
58
Worklist.push_back(std::make_pair(V,
GraphT
::child_begin(V)));
60
typename
GraphT
::NodeType* BB = Worklist.back().first;
61
typename
GraphT
::ChildIteratorType NextSucc = Worklist.back().second;
63
typename DominatorTreeBase<typename
GraphT
::NodeType>::InfoRec &BBInfo =
67
if (NextSucc ==
GraphT
::child_begin(BB))
[
all
...]
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
51
template <class
GraphT
>
52
unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
53
typename
GraphT
::NodeRef V, unsigned N) {
55
typename
GraphT
::NodeRef,
56
typename DominatorTreeBaseByGraphTraits<
GraphT
>::InfoRec>
61
typename
GraphT
::NodeRef BB = *I;
78
template <class
GraphT
>
79
unsigned DFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
80
typename
GraphT
::NodeRef V, unsigned N) {
82
typename
GraphT
::NodeRef
[
all
...]
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/
GenericDomTreeConstruction.h
51
template <class
GraphT
>
52
unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
53
typename
GraphT
::NodeRef V, unsigned N) {
55
typename
GraphT
::NodeRef,
56
typename DominatorTreeBaseByGraphTraits<
GraphT
>::InfoRec>
61
typename
GraphT
::NodeRef BB = *I;
78
template <class
GraphT
>
79
unsigned DFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
80
typename
GraphT
::NodeRef V, unsigned N) {
82
typename
GraphT
::NodeRef
[
all
...]
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/
GenericDomTreeConstruction.h
51
template <class
GraphT
>
52
unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
53
typename
GraphT
::NodeRef V, unsigned N) {
55
typename
GraphT
::NodeRef,
56
typename DominatorTreeBaseByGraphTraits<
GraphT
>::InfoRec>
61
typename
GraphT
::NodeRef BB = *I;
78
template <class
GraphT
>
79
unsigned DFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
80
typename
GraphT
::NodeRef V, unsigned N) {
82
typename
GraphT
::NodeRef
[
all
...]
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
51
template <class
GraphT
>
52
unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
53
typename
GraphT
::NodeRef V, unsigned N) {
55
typename
GraphT
::NodeRef,
56
typename DominatorTreeBaseByGraphTraits<
GraphT
>::InfoRec>
61
typename
GraphT
::NodeRef BB = *I;
78
template <class
GraphT
>
79
unsigned DFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
80
typename
GraphT
::NodeRef V, unsigned N) {
82
typename
GraphT
::NodeRef
[
all
...]
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/
GenericDomTreeConstruction.h
51
template <class
GraphT
>
52
unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
53
typename
GraphT
::NodeRef V, unsigned N) {
55
typename
GraphT
::NodeRef,
56
typename DominatorTreeBaseByGraphTraits<
GraphT
>::InfoRec>
61
typename
GraphT
::NodeRef BB = *I;
78
template <class
GraphT
>
79
unsigned DFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
80
typename
GraphT
::NodeRef V, unsigned N) {
82
typename
GraphT
::NodeRef
[
all
...]
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/
GenericDomTreeConstruction.h
51
template <class
GraphT
>
52
unsigned ReverseDFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
53
typename
GraphT
::NodeRef V, unsigned N) {
55
typename
GraphT
::NodeRef,
56
typename DominatorTreeBaseByGraphTraits<
GraphT
>::InfoRec>
61
typename
GraphT
::NodeRef BB = *I;
78
template <class
GraphT
>
79
unsigned DFSPass(DominatorTreeBaseByGraphTraits<
GraphT
> &DT,
80
typename
GraphT
::NodeRef V, unsigned N) {
82
typename
GraphT
::NodeRef
[
all
...]
/external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp
623
typedef bfi_detail::IrreducibleGraph
GraphT
;
625
typedef const
GraphT
::IrrNode NodeType;
626
typedef
GraphT
::IrrNode::iterator ChildIteratorType;
628
static const NodeType *getEntryNode(const
GraphT
&G) {
Completed in 348 milliseconds