| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 11 // is reachable within the CFG.
36 ReachableMap reachable; member in class:clang::CFGReverseBlockReachabilityAnalysis
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| AnalyzerStatsChecker.cpp | 45 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; local
64 reachable.insert(CB);
78 if (!reachable.count(CB)) {
|
| UnreachableCodeChecker.cpp | 41 CFGBlocksSet &reachable,
51 CFGBlocksSet reachable, visited; local
79 reachable.insert(CB->getBlockID());
98 if (reachable.count(CB->getBlockID()))
107 FindUnreachableEntryPoints(CB, reachable, visited);
110 if (reachable.count(CB->getBlockID()))
179 CFGBlocksSet &reachable,
188 if (!reachable.count((*I)->getBlockID())) {
189 // If we find an unreachable predecessor, mark this block as reachable so
191 reachable.insert(CB->getBlockID())
[all...] |
| DeadStoresChecker.cpp | 70 llvm::BitVector reachable; member in class:__anon3323::ReachableCode
73 : cfg(cfg), reachable(cfg.getNumBlockIDs(), false) {}
78 return reachable[block->getBlockID()];
92 llvm::BitVector::reference isReachable = reachable[block->getBlockID()];
200 // Compute reachable blocks within the CFG for trivial cases
|
| /src/sys/compat/netinet6/ |
| nd6.h | 38 u_int32_t reachable; /* Reachable Time */ member in struct:nd_ifinfo90
56 u_int32_t reachable; /* Reachable Time */ member in struct:in6_ondireq::__anon2414
|
| /src/external/bsd/dhcpcd/dist/src/ |
| ipv6nd.h | 63 uint32_t reachable; member in struct:ra
|
| if-bsd.c | 1348 bool reachable; local
1352 reachable = (rtm->rtm_type == RTM_ADD ||
1355 ipv6nd_neighbour(ctx, &dest->sin6_addr, reachable);
1785 nd.ndi.basereachable = rap->reachable;
1802 #warning OS does not allow setting of RA bits hoplimit, retrans or reachable
|
| /src/sys/netinet6/ |
| nd6.h | 65 uint32_t reachable; /* Reachable Time */ member in struct:nd_kifinfo
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa.cc | 86 We enqueue nodes at two occasions: when we find them reachable or when we find
89 reachable. */
93 hash_set<symtab_node *> *reachable)
99 only if it became reachable now. */
100 if (node->aux == (void *)2 && !reachable->contains (node))
132 hash_set<symtab_node *> *reachable)
159 reachable->add (body);
160 reachable->add (node);
162 enqueue_node (node, first, reachable);
167 all its potential targets as reachable to permit later inlining i
316 hash_set<symtab_node *> reachable; local
[all...] |
| omp-oacc-neuter-broadcast.cc | 1447 dfs_broadcast_reachable_1 (basic_block bb, sbitmap reachable)
1462 bitmap_set_bit (reachable, dest->index);
1464 dfs_broadcast_reachable_1 (dest, reachable);
1680 sbitmap *reachable local
1684 bitmap_vector_clear (reachable, last_basic_block_for_fn (cfun));
1699 dfs_broadcast_reachable_1 (bb, reachable[bb->index]);
1713 EXECUTE_IF_SET_IN_BITMAP (reachable[i], 0, j, bi)
1718 bitmap_ior (reachable[i], reachable[i], inverted[i]);
1750 EXECUTE_IF_SET_IN_BITMAP (reachable[blkno], 0, j, bi
[all...] |
| ira.cc | 5114 auto_bitmap need_new, reachable;
5133 bitmap_set_bit (reachable, bb->index);
5152 && bitmap_set_bit (reachable, e->dest->index))
5171 if (bitmap_bit_p (reachable, ubbi))
5090 auto_bitmap need_new, reachable; local
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa.cc | 84 We enqueue nodes at two occasions: when we find them reachable or when we find
87 reachable. */
91 hash_set<symtab_node *> *reachable)
97 only if it became reachable now. */
98 if (node->aux == (void *)2 && !reachable->contains (node))
130 hash_set<symtab_node *> *reachable)
157 reachable->add (body);
158 reachable->add (node);
160 enqueue_node (node, first, reachable);
165 all its potential targets as reachable to permit later inlining i
315 hash_set<symtab_node *> reachable; local
[all...] |
| omp-oacc-neuter-broadcast.cc | 1447 dfs_broadcast_reachable_1 (basic_block bb, sbitmap reachable)
1462 bitmap_set_bit (reachable, dest->index);
1464 dfs_broadcast_reachable_1 (dest, reachable);
1680 sbitmap *reachable local
1684 bitmap_vector_clear (reachable, last_basic_block_for_fn (cfun));
1699 dfs_broadcast_reachable_1 (bb, reachable[bb->index]);
1713 EXECUTE_IF_SET_IN_BITMAP (reachable[i], 0, j, bi)
1718 bitmap_ior (reachable[i], reachable[i], inverted[i]);
1750 EXECUTE_IF_SET_IN_BITMAP (reachable[blkno], 0, j, bi
[all...] |
| ira.cc | 5089 auto_bitmap need_new, reachable;
5108 bitmap_set_bit (reachable, bb->index);
5127 && bitmap_set_bit (reachable, e->dest->index))
5146 if (bitmap_bit_p (reachable, ubbi))
5065 auto_bitmap need_new, reachable; local
|
| /src/external/apache2/mDNSResponder/dist/ServiceRegistration/ |
| route.h | 299 bool reachable; // True if this router was reachable when last probed member in struct:icmp_message
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineVerifier.cpp | 130 // Is this MBB reachable from the MF entry point?
131 bool reachable = false; member in struct:__anon4245::MachineVerifier::BBInfo
558 if (!MInfo.reachable) {
559 MInfo.reachable = true;
2464 assert(Info.reachable);
2470 if (!PredInfo.reachable)
2574 if (MInfo.reachable) {
2577 if (!MO0.isUndef() && PrInfo.reachable &&
2584 if (MInfo.reachable) {
3127 df_iterator_default_set<const MachineBasicBlock*> Reachable;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| AttributorAttributes.cpp | 2394 // TODO: Return the number of reachable queries.
2395 return "reachable";
2412 void trackStatistics() const override { STATS_DECLTRACK_FN_ATTR(reachable); } variable
|
