Home
last modified time | relevance | path

Searched refs:reachable (Results 1 – 25 of 56) sorted by relevance

123

/external/clang/lib/StaticAnalyzer/Checkers/
DUnreachableCodeChecker.cpp46 CFGBlocksSet &reachable,
56 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
77 reachable.insert(CB->getBlockID()); in checkEndAnalysis()
91 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
100 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
103 if (reachable.count(CB->getBlockID())) in checkEndAnalysis()
147 CFGBlocksSet &reachable, in FindUnreachableEntryPoints() argument
153 if (!reachable.count((*I)->getBlockID())) { in FindUnreachableEntryPoints()
156 reachable.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
159 FindUnreachableEntryPoints(*I, reachable, visited); in FindUnreachableEntryPoints()
DAnalyzerStatsChecker.cpp39 llvm::SmallPtrSet<const CFGBlock*, 256> reachable; in checkEndAnalysis() local
51 reachable.insert(CB); in checkEndAnalysis()
66 if (!reachable.count(CB)) { in checkEndAnalysis()
DDeadStoresChecker.cpp36 llvm::BitVector reachable; member in __anon04361cd60111::ReachableCode
39 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {} in ReachableCode()
44 return reachable[block->getBlockID()]; in isReachable()
59 llvm::BitVector::reference isReachable = reachable[block->getBlockID()]; in computeReachableBlocks()
/external/clang/lib/Analysis/
DReachableCode.cpp124 llvm::BitVector &reachable, in MarkLiveTop() argument
163 reachable.set(item->getBlockID()); in MarkLiveTop()
168 if (!reachable[blockID]) { in MarkLiveTop()
169 reachable.set(blockID); in MarkLiveTop()
236 llvm::BitVector reachable(cfg->getNumBlockIDs()); in FindUnreachableCode() local
237 unsigned numReachable = ScanReachableFromBlock(cfg->getEntry(), reachable); in FindUnreachableCode()
252 if (!reachable[b.getBlockID()]) { in FindUnreachableCode()
258 numReachable += ScanReachableFromBlock(b, reachable); in FindUnreachableCode()
265 reachable.set(b.getBlockID()); in FindUnreachableCode()
271 numReachable += ScanReachableFromBlock(b, reachable); in FindUnreachableCode()
[all …]
DCFGReachabilityAnalysis.cpp37 return reachable[DstBlockID][Src->getBlockID()]; in isReachable()
46 ReachableSet &DstReachability = reachable[Dst->getBlockID()]; in mapReachability()
/external/valgrind/main/memcheck/
Dmemcheck.h203 #define VALGRIND_COUNT_LEAKS(leaked, dubious, reachable, suppressed) \ argument
219 reachable = _qzz_reachable; \
225 #define VALGRIND_COUNT_LEAK_BLOCKS(leaked, dubious, reachable, suppressed) \ argument
241 reachable = _qzz_reachable; \
/external/valgrind/main/memcheck/tests/
Derror_counts.c11 int* reachable; in main() local
49 reachable = malloc(99); in main()
Dnanoleak2.vgtest1 vgopts: --leak-check=yes --gen-suppressions=all --show-reachable=no -q
/external/valgrind/main/drd/tests/
Dunit_vc.vgtest3 vgopts: -q --tool=memcheck --leak-check=full --show-reachable=yes
Dunit_bitmap.vgtest3 vgopts: -q --tool=memcheck --leak-check=full --show-reachable=yes
/external/valgrind/main/
Ddarwin9.supp126 # Still-reachable memory.
130 darwin-still-reachable-1
142 darwin-still-reachable-2
155 darwin-still-reachable-3
DFAQ.txt157 'still reachable' memory leaks involving these classes at the exit of
165 program cause Valgrind to report this memory as still reachable. The
353 reachable", and "suppressed"?
370 * "still reachable" means your program is probably ok -- it didn't free
372 Don't use --show-reachable=yes if you don't want to see these reports.
/external/llvm/test/Transforms/GlobalDCE/
D2002-07-17-ConstantRef.ll6 ; Not dead, can be reachable via X
/external/clang/include/clang/Analysis/Analyses/
DCFGReachabilityAnalysis.h36 ReachableMap reachable; variable
/external/llvm/test/Transforms/LCSSA/
Dunreachable-use.ll4 ; LCSSA doesn't need to transform uses in blocks not reachable
/external/llvm/test/Transforms/InstCombine/
D2008-07-13-DivZero.ll6 ; call. If the callee never returns, we can't assume the div is reachable.
/external/iptables/extensions/
Dlibxt_TEE.man7 Send the cloned packet to the host reachable at the given IP address.
/external/llvm/lib/CodeGen/
DMachineVerifier.cpp92 bool reachable; member
114 BBInfo() : reachable(false) {} in BBInfo()
356 if (!MInfo.reachable) { in markReachable()
357 MInfo.reachable = true; in markReachable()
829 if (!MInfo.reachable) in calcRegsPassed()
905 if (PrInfo.reachable && !PrInfo.isLiveOut(Reg)) in checkPHIOps()
930 if (!MInfo.reachable) in visitMachineFunctionAfter()
/external/bluetooth/glib/gio/tests/
Dlive-g-file.txt6 preffered to preserve unix modes) and put it on a reachable place.
/external/llvm/docs/HistoricalNotes/
D2003-06-25-Reoptimizer1.txt34 region and mark reachable edges.
37 region IGNORING back edges, and mark the edges which are reachable in
38 1) and also in 2) (i.e., must be reachable from both the start BB and
/external/llvm/test/Transforms/LoopSimplify/
D2003-12-10-ExitBlocksProblem.ll2 ; the loop are reachable from more than just the exit nodes: the exit blocks
/external/bison/tests/
Dreduce.at232 not_reachable: useful { /* A not reachable action. */ }
278 //not_reachable: useful { /* A not reachable action. */ }
/external/iproute2/ip/
Dipntable.c486 __u64 reachable = *(__u64 *)RTA_DATA(tpb[NDTPA_REACHABLE_TIME]); in print_ntable() local
487 fprintf(fp, "reachable %llu ", reachable); in print_ntable()
/external/iproute2/doc/
Dip-tunnels.tex122 but address of peering host, which is directly reachable
133 kinds and gateway is required to be directly reachable via this tunnel,
220 reachable over device \verb|tunl0|. With IPv6 the situation is much simpler:
223 Internet is {\em really reachable} via \verb|sit0|! Excellent, the command
/external/llvm/lib/Support/
Dregengine.inc846 - step - map set of states reachable before char to set reachable after
852 states bef, /* states reachable before */
854 states aft) /* states already known reachable after */

123