OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Callees
(Results
1 - 2
of
2
) sorted by null
/external/llvm/include/llvm/Analysis/
LazyCallGraph.h
20
/// across the functions of a module in ways that ensure all
callees
are
93
/// which could potentially change the set of potential
callees
. The
158
///
callees
, de-duplicate and provide fast testing of whether a function is
172
mutable NodeVectorT
Callees
;
175
/// \brief Basic constructor implements the scanning of F into
Callees
and
196
return iterator(*G,
Callees
.begin(),
Callees
.end());
198
iterator end() const { return iterator(*G,
Callees
.end(),
Callees
.end()); }
/external/llvm/lib/Analysis/
LazyCallGraph.cpp
25
SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &
Callees
,
42
CalleeIndexMap.insert(std::make_pair(F,
Callees
.size())).second) {
45
Callees
.push_back(F);
63
// Find all the potential
callees
in this function. First walk the
75
findCallees(Worklist, Visited,
Callees
, CalleeIndexMap);
82
CalleeIndexMap.insert(std::make_pair(&Callee,
Callees
.size()));
83
Callees
.push_back(&Callee);
87
CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(),
Callees
.size()));
88
Callees
.push_back(&CalleeN);
96
Callees
[IndexMapI->second] = nullptr
[
all
...]
Completed in 56 milliseconds