OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:DFS
(Results
1 - 3
of
3
) sorted by null
/external/llvm/include/llvm/Analysis/
LoopIterator.h
51
/// preorder visited by
DFS
. It's postorder number is initially zero and set
64
/// Traverse the loop blocks and store the
DFS
result.
72
assert(isComplete() && "bad loop
DFS
");
79
assert(isComplete() && "bad loop
DFS
");
96
assert(I != PostNumbers.end() && "block not visited by
DFS
");
97
assert(I->second && "block not finished by
DFS
");
119
LoopBlocksDFS &
DFS
;
124
DFS
(Storage), LI(LInfo) {}
128
/// finishPostorder to record the
DFS
result.
130
assert(
DFS
.PostBlocks.empty() && "Need clear DFS result before traversing")
[
all
...]
/external/clang/lib/StaticAnalyzer/Core/
CoreEngine.cpp
33
class
DFS
: public WorkList {
94
WorkList *WorkList::makeDFS() { return new
DFS
(); }
/external/llvm/lib/Analysis/
LoopInfo.cpp
400
LoopBlocksDFS
DFS
;
414
Unloop(UL), LI(LInfo),
DFS
(UL), FoundIB(false) {}
433
LoopBlocksTraversal Traversal(
DFS
, LI);
454
// the
DFS
result cached by Traversal.
462
for (LoopBlocksDFS::POIterator POI =
DFS
.beginPostorder(),
463
POE =
DFS
.endPostorder(); POI != POE; ++POI) {
509
assert(SubloopParents.count(Subloop) && "
DFS
failed to visit subloop");
555
assert((FoundIB || !
DFS
.hasPostorder(*I)) && "should have seen IB");
676
// FIXME: With an up-to-date
DFS
(see LoopIterator.h) and DominatorTree, we
698
/// Traverse the loop blocks and store the
DFS
result
[
all
...]
Completed in 490 milliseconds